diff --git a/tests/file-tests/README b/tests/file-tests/README
new file mode 100644
index 0000000..51dfd6c
--- /dev/null
+++ b/tests/file-tests/README
@@ -0,0 +1,3 @@
+./prepare.sh
+./reference.sh [--mime-type]
+./runtest.sh [--mime-type]
\ No newline at end of file
diff --git a/tests/file-tests/blacklist.txt b/tests/file-tests/blacklist.txt
new file mode 100644
index 0000000..c89aeef
--- /dev/null
+++ b/tests/file-tests/blacklist.txt
@@ -0,0 +1,19 @@
+cab/cabinet.cab
+db/test.db
+doc/encrypted.doc
+doc/PMD.doc
+dump/big-endian-dump
+elf/library.so
+elf/pie-now.out
+elf/pie.out
+img/qcow2.img
+jpg/xsane-zoom-in.jpg
+lnk/windows_link.lnk
+pbm/icontopbm-back-from-icon.pbm
+so/libaio.so
+tar.gz/a.tar.gz
+tgz/broken-file.tgz
+webm/bunny.webm
+xls/encrypted.xls
+xls/excel-file.xls
+xps/presentation.xps
\ No newline at end of file
diff --git a/tests/file-tests/db/3ds/key.3DS b/tests/file-tests/db/3ds/key.3DS
new file mode 100644
index 0000000..c05b61e
Binary files /dev/null and b/tests/file-tests/db/3ds/key.3DS differ
diff --git a/tests/file-tests/db/3ds/key.3DS.source.txt b/tests/file-tests/db/3ds/key.3DS.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/3ds/key.3DS.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/7z/spectrum.7z b/tests/file-tests/db/7z/spectrum.7z
new file mode 100644
index 0000000..ca7c679
Binary files /dev/null and b/tests/file-tests/db/7z/spectrum.7z differ
diff --git a/tests/file-tests/db/7z/spectrum.7z.source.txt b/tests/file-tests/db/7z/spectrum.7z.source.txt
new file mode 100644
index 0000000..6611b26
--- /dev/null
+++ b/tests/file-tests/db/7z/spectrum.7z.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/AppleDouble/AppleDouble b/tests/file-tests/db/AppleDouble/AppleDouble
new file mode 100644
index 0000000..cd3520e
Binary files /dev/null and b/tests/file-tests/db/AppleDouble/AppleDouble differ
diff --git a/tests/file-tests/db/AppleDouble/AppleDouble.source.txt b/tests/file-tests/db/AppleDouble/AppleDouble.source.txt
new file mode 100644
index 0000000..891e655
--- /dev/null
+++ b/tests/file-tests/db/AppleDouble/AppleDouble.source.txt
@@ -0,0 +1,4 @@
+AUTHOR: Intra2net <info@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
+NOTE: AppleDouble files appear in folder __MACOSX of zip files created on MacOSX systems with same name and path as the "real" zip file contents
diff --git a/tests/file-tests/db/DS_Store/DS_Store b/tests/file-tests/db/DS_Store/DS_Store
new file mode 100644
index 0000000..5008ddf
Binary files /dev/null and b/tests/file-tests/db/DS_Store/DS_Store differ
diff --git a/tests/file-tests/db/DS_Store/DS_Store.source.txt b/tests/file-tests/db/DS_Store/DS_Store.source.txt
new file mode 100644
index 0000000..87def34
--- /dev/null
+++ b/tests/file-tests/db/DS_Store/DS_Store.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Intra2net <info@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/accdb/database.accdb b/tests/file-tests/db/accdb/database.accdb
new file mode 100644
index 0000000..e2b391e
Binary files /dev/null and b/tests/file-tests/db/accdb/database.accdb differ
diff --git a/tests/file-tests/db/accdb/database.accdb.source.txt b/tests/file-tests/db/accdb/database.accdb.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/accdb/database.accdb.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/ade/ms_access_project_encoded.ade b/tests/file-tests/db/ade/ms_access_project_encoded.ade
new file mode 100644
index 0000000..aea7eae
Binary files /dev/null and b/tests/file-tests/db/ade/ms_access_project_encoded.ade differ
diff --git a/tests/file-tests/db/ade/ms_access_project_encoded.ade.source.txt b/tests/file-tests/db/ade/ms_access_project_encoded.ade.source.txt
new file mode 100644
index 0000000..df3263a
--- /dev/null
+++ b/tests/file-tests/db/ade/ms_access_project_encoded.ade.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck
+SOURCE: self-created
+LICENSE: public domain
diff --git a/tests/file-tests/db/adp/ms_access_project.adp b/tests/file-tests/db/adp/ms_access_project.adp
new file mode 100644
index 0000000..b620c88
Binary files /dev/null and b/tests/file-tests/db/adp/ms_access_project.adp differ
diff --git a/tests/file-tests/db/adp/ms_access_project.adp.source.txt b/tests/file-tests/db/adp/ms_access_project.adp.source.txt
new file mode 100644
index 0000000..df3263a
--- /dev/null
+++ b/tests/file-tests/db/adp/ms_access_project.adp.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck
+SOURCE: self-created
+LICENSE: public domain
diff --git a/tests/file-tests/db/ani/animated_cursor.ani b/tests/file-tests/db/ani/animated_cursor.ani
new file mode 100644
index 0000000..6e70fe1
Binary files /dev/null and b/tests/file-tests/db/ani/animated_cursor.ani differ
diff --git a/tests/file-tests/db/ani/animated_cursor.ani.source.txt b/tests/file-tests/db/ani/animated_cursor.ani.source.txt
new file mode 100644
index 0000000..bdd2b27
--- /dev/null
+++ b/tests/file-tests/db/ani/animated_cursor.ani.source.txt
@@ -0,0 +1,5 @@
+animated cursor from http://www.rw-designer.com/cursor-detail/24909
+original file name: 03 Working In Background.ani
+
+license: "Release to PUblic Domain" license ("You are free: To use this work for any legal purpose.")
+Published on May 14th 2011 by NesManiac
diff --git a/tests/file-tests/db/asa/global.asa b/tests/file-tests/db/asa/global.asa
new file mode 100644
index 0000000..0ab4555
--- /dev/null
+++ b/tests/file-tests/db/asa/global.asa
@@ -0,0 +1,20 @@
+<script language="vbscript" runat="server">
+
+ sub Application_OnStart
+    Application("status")=1
+ end sub
+
+ sub Session_OnStart
+    Application("status")=2
+ end sub
+
+ sub Application_OnEnd
+    Application("status")=3
+ end sub
+
+ sub Session_OnEnd
+    Application("status")=4
+ end sub
+
+ </script>
+
diff --git a/tests/file-tests/db/asa/global.asa.source.txt b/tests/file-tests/db/asa/global.asa.source.txt
new file mode 100644
index 0000000..af5f578
--- /dev/null
+++ b/tests/file-tests/db/asa/global.asa.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck
+URL: None (self-created)
+LICENSE: public domain
diff --git a/tests/file-tests/db/asp/policies_part.asp b/tests/file-tests/db/asp/policies_part.asp
new file mode 100644
index 0000000..5f54edf
--- /dev/null
+++ b/tests/file-tests/db/asp/policies_part.asp
@@ -0,0 +1,97 @@
+<!DOCTYPE HTML>
+
+<html lang="en">
+
+
+<!-- extra lang tag was here --><head>
+<title>Web Site Policies and Important Links [NEI Tools]</title>
+<meta name="description" content="Eye health information and resources for the public and professionals." />
+<meta name="keywords" content="eye, health, research, information" />
+
+
+<meta name="creator" content="National Eye Institute" />
+<meta name="language" content="English" />
+
+<meta name="MSSmartTagsPreventParsing" content="TRUE" />
+<meta name="viewport" content="initial-scale=1, width=device-width" />
+
+<script language="javascript" type="text/javascript" src="/js/leavesite.js"></script>
+
+<script type="text/javascript" src="/js/textsize.js"></script>
+<script type="text/javascript" src="/js/cookies.js"></script>
+<script type="text/javascript" src="/js/jquery.js"></script>
+<script src="http://sf1-na.readspeaker.com/script/5823/ReadSpeaker.js?pids=embhl" type="text/javascript"></script>
+
+
+
+<link rel="stylesheet" type="text/css" href="/css/Reset.css" />
+<link rel="stylesheet" type="text/css" href="/css/BaseStyles.css" />
+<link rel="stylesheet" type="text/css" href="/css/nei.css" />
+<link rel="stylesheet" type="text/css" href="/css/media.css" />
+
+<link rel="stylesheet" type="text/css" href="/css/dropdown_nav5.css" />
+<link rel="stylesheet" type="text/css" media="print" href="/css/print.css" />
+
+<script type="text/javascript" async src="//assets.pinterest.com/js/pinit.js"></script>
+
+
+<!--google analytics start-->
+<script type="text/javascript">
+
+  var _gaq = _gaq || [];
+  _gaq.push(['_setAccount', 'UA-1875828-4']);
+  _gaq.push(['_setDomainName', '.nei.nih.gov']);
+  _gaq.push(['_trackPageview']);
+
+  (function() {
+    var ga = document.createElement('script'); 
+        ga.type = 'text/javascript'; ga.async = true;
+    ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
+    var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
+  })();
+
+
+
+</script>
+
+
+
+<script type="text/javascript">
+/*Google Analytics Automatic External Link, Downloads, Mailto Tracking- jQuery GA Async Version*/
+if (typeof jQuery != 'undefined') {
+    jQuery(document).ready(function($) {
+        var filetypes = /\.(zip|exe|pdf|doc|xls|ppt|mp3)$/i;
+        var baseHref = '';
+        if (jQuery('base').attr('href') != undefined)
+            baseHref = jQuery('base').attr('href');
+        jQuery('a').each(function() {
+            var href = jQuery(this).attr('href');
+            if (href && (href.match(/^https?\:/i)) && (!href.match(document.domain))) {
+                jQuery(this).click(function() {
+                    var extLink = href.replace(/^https?\:\/\//i, '');
+                    _gaq.push(['_trackEvent', 'External', 'Link Click', extLink]);
+                    if (jQuery(this).attr('target') != undefined && jQuery(this).attr('target').toLowerCase() != '_blank') {
+                        setTimeout(function() { location.href = href; }, 200);
+                        return false;
+                    }
+                });
+            }
+             else if (href && href.toLowerCase().match('.*nih.gov.*') && href.toLowerCase().indexOf('nei.nih.gov') == -1) {
+jQuery(this).click(function() {
+//Exit link tracking for other .nih.gov domains (excludes nei.nih.gov)
+var extLink = href.replace(/^https?\:\/\//i, '');
+_gaq.push(['_trackEvent', 'External', 'Link Click', extLink]); 
+                });
+            }
+            else if (href && href.match(/^mailto\:/i)) {
+                jQuery(this).click(function() {
+                    var mailLink = href.replace(/^mailto\:/i, '');
+                    _gaq.push(['_trackEvent', 'Email', 'mailto', mailLink]);
+                });
+            }
+            else if (href && href.match(filetypes)) {
+                jQuery(this).click(function() {
+                    var extension = (/[.]/.exec(href)) ? /[^.]+$/.exec(href) : undefined;
+                    var filePath = href;
+                    _gaq.push(['_trackEvent', 'Download',extension+ ' Click', filePath]);
+                    i
\ No newline at end of file
diff --git a/tests/file-tests/db/asp/policies_part.asp.source.txt b/tests/file-tests/db/asp/policies_part.asp.source.txt
new file mode 100644
index 0000000..e74c7d7
--- /dev/null
+++ b/tests/file-tests/db/asp/policies_part.asp.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: National Eye Institute
+URL: http://www.nei.nih.gov/tools/policies.asp
+LICENSE: Public Domain (Courtesy: National Eye Institute, National Institutes of Health (NEI/NIH))
diff --git a/tests/file-tests/db/bas/PILES_START.bas b/tests/file-tests/db/bas/PILES_START.bas
new file mode 100644
index 0000000..142230f
--- /dev/null
+++ b/tests/file-tests/db/bas/PILES_START.bas
@@ -0,0 +1,186 @@
+DEFINT A-Z
+DECLARE SUB BigTextEnd (SndT, PlyT)
+DECLARE SUB BigText (Factor%, S$, Y%, X%, C%)
+DECLARE SUB Plot (Num, Y, X)
+STACK 512
+DIM Grid(20, 20) AS STRING * 1
+DIM Colors(3) AS INTEGER
+DIM Gcol(20, 20) AS INTEGER
+DIM SHARED Text AS INTEGER
+DIM SHARED Brick(65, 3)
+DIM Pic&(8192)
+DIM Temp(5000), TempVar(5000)
+DIM SHARED SndT, PlyT
+
+DIM A$(186)
+L$ = CHR$(0) + CHR$(75)
+R$ = CHR$(0) + CHR$(77)
+U$ = CHR$(0) + CHR$(72)
+D$ = CHR$(0) + CHR$(80)
+F1$ = CHR$(0) + CHR$(59)
+F2$ = CHR$(0) + CHR$(60)
+F3$ = CHR$(0) + CHR$(61)
+F4$ = CHR$(0) + CHR$(62)
+
+PLAY "o0MBL8 "
+DATA A16,MN, A2,o1,ML,E4.,D-32,C32,D2
+DATA C16,ML,O0,B16,o0,D-16,MN,o1,C,C,o0,B2,A4.,ML,C16,G16
+DATA F2,o1,C4.,o0,ML,B16,G16,A-4
+DATA A4,B.,o1,MS,C16,MN,D.
+DATA o0,ML,G16,B16,MN,o1,E,E,ML,E4,D8,ML,C16,E16,MN,E2
+DATA T240
+DATA o0,F2,ML,B2,B4,MN,E4,ML,A2
+DATA A,MN,D,ML,G2,G4,MN,C4,F2
+DATA T120
+DATA o0,MS,E4,o1,ML,C2,C8
+DATA MN,F8,ML,G16,F16,E16,D16
+DATA C2,C8,MN,F8,ML,G16,F16,E16,D16
+
+DATA o1,Co0,G,ML,A16,G16,F16,D16,MN,G,B-,o1,ML,C16,o0,B16,A16,G16,MN,o1,C2.
+DATA ML,o0,G,B,o1,D,MN,D,D4,P8,G,G
+DATA F+,F,F,E,P8,E-,ML,E,D,D,E,E,D,D,C,MN,C4,ML,o0,B.,A16,B16,MN,A4,P8,A
+DATA o0,ML,D,B4.,A,G4,P8,D,B4,A,G4,P8,D,o1,E2.,MS,D,C,o0,B,A,G4,P4,P8,ML,E16
+
+PRINT "Please Wait..."
+FOR J = 1 TO 184
+    READ A$(J)
+NEXT J
+LOCATE 1, 1: PRINT "             "
+
+SndT = 1
+PlyT = 1
+Com$ = UCASE$(COMMAND$)
+
+IF INSTR(Com$, "NOGR") THEN NoGr = 1
+IF INSTR(Com$, "TEXT") THEN
+    Text = 1
+    GOTO Txt
+END IF
+IF Text <> 1 THEN
+    ON ERROR GOTO Text
+    IF INSTR(Com$, "MCGA") THEN
+        SCREEN 13
+        MCGA = 1
+    ELSE
+        SCREEN 9
+    END IF
+    ON ERROR GOTO 0
+    FOR J = 1 TO 3
+        LINE (1, 1)-(7, 7), J, BF
+        LINE (1, 1)-(1, 7), 3 + J
+        LINE (1, 1)-(7, 1), 3 + J
+        LINE (7, 1)-(7, 7), 8 + J
+        LINE (7, 7)-(2, 7), 8 + J
+        GET (1, 1)-(7, 7), Brick(0, J)
+    NEXT J
+    IF MCGA <> 1 THEN
+        PALETTE 4, 8
+        PALETTE 5, 16
+        PALETTE 6, 24
+    ELSE
+        PALETTE 4, 1376256
+        PALETTE 5, 5376&
+        PALETTE 6, 1381632
+    END IF
+    CLS
+    IF MCGA <> 1 THEN
+        WINDOW (0, 0)-(319, 199)
+        WIDTH 40
+    END IF
+    IF MCGA <> 1 AND NoGr <> 1 THEN
+        LINE (118, 100)-(208, 112), 15, B
+        LOCATE 14, 16: PRINT "Please Wait"
+        GET (119, 101)-(207, 111), Temp
+        PUT (119, 101), Temp
+        PAINT (122, 102), 7, 15
+        PUT (119, 101), Temp, OR
+        LINE (118, 100)-(208, 112), 8, B
+        LINE (208, 101)-(208, 112), 15
+        LINE (119, 112)-(208, 112), 15
+
+        ON ERROR GOTO Ferror
+        OPEN "Piles.NAS" FOR INPUT AS #1
+        FOR J% = 0 TO 8192
+            INPUT #1, Pic&(J%)
+        NEXT J%
+        CLOSE
+    END IF
+END IF
+
+GOTO Start
+
+Ferror:
+RESUME Start:
+
+Text:
+RESUME Txt
+
+Txt:
+Text = 1
+SCREEN 0
+WIDTH 40
+CLS
+
+Start:
+
+Score& = 0
+
+ON ERROR GOTO 0
+
+IF Text <> 1 THEN
+    CLS
+    IF MCGA <> 1 AND NoGr <> 1 THEN
+        PUT (0, 0), Pic&(0)
+        COLOR 9
+        LINE (160, 0)-(160, 160), 9
+        LINE (0, 160)-(160, 160), 9
+    END IF
+    LINE (0, 0)-(159, 159), 0, BF
+ELSE
+    FOR J = 1 TO 24
+        LOCATE 25, 1
+        PRINT SPACE$(34);
+    NEXT J
+END IF
+
+RANDOMIZE TIMER
+
+FOR X = 1 TO 20
+    FOR Y = 1 TO 20
+        Grid(X, Y) = " "
+        Gcol(X, Y) = 0
+    NEXT Y
+NEXT X
+
+FOR J = 1 TO 20
+    LOCATE J, 1
+    PRINT SPACE$(20)
+NEXT J
+
+COLOR 9
+LOCATE 1, 25
+PRINT "�������������Ŀ"
+LOCATE 2, 25
+PRINT "�  S C O R E  �"
+LOCATE 3, 25
+PRINT "�������������Ĵ"
+LOCATE 4, 25
+PRINT USING "� ###,###,### �"; Score
+LOCATE 5, 25
+PRINT "���������������"
+IF Text <> 1 THEN
+    LINE (197, 6)-(197, 19), 1
+    LINE (197, 5)-(306, 5), 1
+    LINE (197, 22)-(197, 35), 1
+    LINE (197, 21)-(306, 21), 1
+    LINE (197, 37)-(308, 37), 1
+    LINE (309, 37)-(309, 5), 1
+    COLOR 1
+    LOCATE 2, 26
+    GET (198, 8)-(305, 15), TempVar
+    PRINT "  S C O R E  "
+    GET (198, 8)-(305, 15), Temp
+    PUT (199, 9), Temp, OR
+    PUT (198, 8), TempVar, OR
+END IF
+LOCATE 6, 
\ No newline at end of file
diff --git a/tests/file-tests/db/bas/PILES_START.bas.source.txt b/tests/file-tests/db/bas/PILES_START.bas.source.txt
new file mode 100644
index 0000000..d89f426
--- /dev/null
+++ b/tests/file-tests/db/bas/PILES_START.bas.source.txt
@@ -0,0 +1,2 @@
+taken from https://github.com/cout/vbdos/blob/master/games/piles/PILES.BAS
+released into public domain by author "cout"
diff --git a/tests/file-tests/db/bat/build.bat b/tests/file-tests/db/bat/build.bat
new file mode 100644
index 0000000..75717d2
--- /dev/null
+++ b/tests/file-tests/db/bat/build.bat
@@ -0,0 +1,85 @@
+@echo off
+if exist lastmake.mk call clean.bat
+if "%1"=="clean" clean.bat
+if "%1"=="clean" goto ende
+
+if not x%1==x set LNG=%1
+if "%lng%"=="" set LNG=english
+
+echo.
+echo Making basic utilities for build process
+echo.
+cd utils
+make -futils.mak all
+if errorlevel 1 goto ende
+cd ..
+
+echo.
+echo Making STRINGS resource
+echo.
+cd strings
+if exist mkSTRLIB.Bat del mkSTRLIB.Bat >NUL
+make -fstrings.mak -DLNG=%LNG% all
+if errorlevel 1 goto ende
+if exist mkSTRLIB.Bat call mkSTRLIB.Bat
+if errorlevel 1 goto ende
+if exist mkSTRLIB.Bat del mkSTRLIB.Bat >NUL
+cd ..
+
+echo.
+echo Making CRITER resource
+echo.
+cd criter
+make -fcriter.mak all
+if errorlevel 1 goto ende
+cd ..
+
+echo.
+echo Making misc library
+echo.
+cd lib
+make -flib.mak all
+if errorlevel 1 goto ende
+cd ..
+
+echo.
+echo Making commands library
+echo.
+cd cmd
+make -fcmd.mak all
+if errorlevel 1 goto ende
+cd ..
+
+echo.
+echo Making COMMAND.COM
+echo.
+cd shell
+make -fcommand.mak all
+if errorlevel 1 goto ende
+cd ..
+
+utils\mkinfres.exe infores shell\command.map shell\command.exe
+copy /b shell\command.exe + infores + criter\criter1 + criter\criter + strings\strings.dat command.com
+if not exist command.com goto ende
+
+echo.
+echo Making supplemental tools
+echo.
+cd tools
+type tools.m1 >tools.mak
+..\utils\mktools.exe >>tools.mak
+type tools.m2 >>tools.mak
+make -ftools.mak all
+if errorlevel 1 goto ende
+cd ..
+
+echo.
+echo Patching heap size to 6KB
+echo.
+tools\ptchsize.exe command.com +6KB
+
+echo.
+echo All done. COMMAND.COM is ready for useage!
+echo.
+
+:ende
diff --git a/tests/file-tests/db/bat/build.bat.source.txt b/tests/file-tests/db/bat/build.bat.source.txt
new file mode 100644
index 0000000..3da41d9
--- /dev/null
+++ b/tests/file-tests/db/bat/build.bat.source.txt
@@ -0,0 +1,2 @@
+URL: ftp://ftp.ibiblio.org/pub/micro/pc-stuff/freedos/files/dos/command/0.83/com083b26s.zip
+License: GPL
diff --git a/tests/file-tests/db/bin/vax b/tests/file-tests/db/bin/vax
new file mode 100644
index 0000000..c769c7b
Binary files /dev/null and b/tests/file-tests/db/bin/vax differ
diff --git a/tests/file-tests/db/bin/vax.source.txt b/tests/file-tests/db/bin/vax.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/bin/vax.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/bmp/InstallerHeader.bmp b/tests/file-tests/db/bmp/InstallerHeader.bmp
new file mode 100644
index 0000000..1040f7e
Binary files /dev/null and b/tests/file-tests/db/bmp/InstallerHeader.bmp differ
diff --git a/tests/file-tests/db/bmp/InstallerHeader.bmp.source.txt b/tests/file-tests/db/bmp/InstallerHeader.bmp.source.txt
new file mode 100644
index 0000000..434bcf4
--- /dev/null
+++ b/tests/file-tests/db/bmp/InstallerHeader.bmp.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: https://github.com/miracle2k/fretsonfire/blob/master/data/win32/installer/InstallerHeader.bmp
+LICENSE: GPL
diff --git a/tests/file-tests/db/bz2/test.txt.bz2 b/tests/file-tests/db/bz2/test.txt.bz2
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/tests/file-tests/db/bz2/test.txt.bz2
diff --git a/tests/file-tests/db/bz2/test.txt.bz2.source.txt b/tests/file-tests/db/bz2/test.txt.bz2.source.txt
new file mode 100644
index 0000000..02c4463
--- /dev/null
+++ b/tests/file-tests/db/bz2/test.txt.bz2.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Thomas Jarosch
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/cab/cabinet.cab b/tests/file-tests/db/cab/cabinet.cab
new file mode 100644
index 0000000..21dcfc2
Binary files /dev/null and b/tests/file-tests/db/cab/cabinet.cab differ
diff --git a/tests/file-tests/db/cab/cabinet.cab.source.txt b/tests/file-tests/db/cab/cabinet.cab.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/cab/cabinet.cab.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/chm/index_start.chm b/tests/file-tests/db/chm/index_start.chm
new file mode 100644
index 0000000..b65d3d7
Binary files /dev/null and b/tests/file-tests/db/chm/index_start.chm differ
diff --git a/tests/file-tests/db/chm/index_start.chm.source.txt b/tests/file-tests/db/chm/index_start.chm.source.txt
new file mode 100644
index 0000000..87e7379
--- /dev/null
+++ b/tests/file-tests/db/chm/index_start.chm.source.txt
@@ -0,0 +1,5 @@
+Example chm file taken from Ogre3D Wiki 
+http://www.ogre3d.org/tikiwiki/tiki-index.php?page=Compiled+API+Reference
+(version 1.7.0, 22 Oct 2010)
+
+License: Creative Commons Attribution-ShareAlike License
diff --git a/tests/file-tests/db/cmd/wp_batch_example.cmd b/tests/file-tests/db/cmd/wp_batch_example.cmd
new file mode 100644
index 0000000..e865fe0
--- /dev/null
+++ b/tests/file-tests/db/cmd/wp_batch_example.cmd
@@ -0,0 +1,67 @@
+@echo off
+color 0E
+title Conditional Shutdown.
+ 
+:start
+echo Welcome, %USERNAME%
+echo What would you like to do?
+echo.
+echo 1. Shut down within specified number of minutes
+echo 2. Shut down at a specified time
+echo 3. Shut down now
+echo 4. Restart now
+echo 5. Log off now
+echo 6. Hibernate now
+echo 7. Cancel shutdown
+echo. 
+echo 0. Quit
+echo.
+ 
+set /p choice="Enter your choice: "
+if "%choice%"=="1" goto shutdown
+if "%choice%"=="2" goto shutdown-clock
+if "%choice%"=="3" shutdown.exe -s -f
+if "%choice%"=="4" shutdown.exe -r -f
+if "%choice%"=="5" shutdown.exe -l -f
+if "%choice%"=="6" shutdown.exe -h -f
+if "%choice%"=="7" goto cancel_now
+if "%choice%"=="0" exit
+echo Invalid choice: %choice%
+echo.
+pause
+cls
+goto start
+ 
+:shutdown
+cls
+set /p min="Minutes until shutdown: "
+set /a sec=60*%min%
+shutdown.exe -s -f -t %sec%
+echo Shutdown initiated at %time%
+echo.
+goto cancel
+ 
+:shutdown-clock
+echo.
+echo The time format is HH:MM:SS (24 hour time)
+echo Example: 14:30:00 for 2:30 PM
+echo.
+set /p tmg=Enter the time at which you wish the computer to shut down: 
+schtasks.exe /create /sc ONCE /tn shutdown /st %tmg% /tr "shutdown.exe -s -t 00"
+echo Shutdown initiated at %tmg%
+echo.
+ 
+:cancel
+set /p cancel="Type cancel to stop shutdown: "
+if not "%cancel%"=="cancel" exit
+:cancel_now
+shutdown.exe -a
+cls
+schtasks.exe /end /tn shutdown
+cls
+schtasks.exe /delete /tn shutdown
+cls
+echo Any impending shutdown has been cancelled.
+echo.
+pause
+exit
diff --git a/tests/file-tests/db/cmd/wp_batch_example.cmd.source.txt b/tests/file-tests/db/cmd/wp_batch_example.cmd.source.txt
new file mode 100644
index 0000000..bf60512
--- /dev/null
+++ b/tests/file-tests/db/cmd/wp_batch_example.cmd.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: wikipedia
+URL: http://en.wikipedia.org/wiki/Batch_file
+LICENSE: Creative Commons Attribution-ShareAlike
diff --git a/tests/file-tests/db/cnt/help-contents.cnt b/tests/file-tests/db/cnt/help-contents.cnt
new file mode 100644
index 0000000..d0427d6
--- /dev/null
+++ b/tests/file-tests/db/cnt/help-contents.cnt
@@ -0,0 +1,8 @@
+:Base help-contents.hlp>proc4
+:Title Hilfe zu Hilfeninhaltsangaben
+:Index Hilfe zu Hilfeninhaltsangaben=help-contents.hlp
+1 Inhaltsangabe von Hilfedateien
+2 Unterpunkt1=HELP_CONTENTS_1
+2 Unterpunkt2=HELP_CONTENTS_2
+2 Unterpunkt3=HELP_CONTENTS_3
+2 Unterpunkt4=HELP_CONTENTS_4
diff --git a/tests/file-tests/db/cnt/help-contents.cnt.source.txt b/tests/file-tests/db/cnt/help-contents.cnt.source.txt
new file mode 100644
index 0000000..69ce8b4
--- /dev/null
+++ b/tests/file-tests/db/cnt/help-contents.cnt.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck
+URL: None (self-created)
+LICENSE: Public domain
diff --git a/tests/file-tests/db/com/kssf.com b/tests/file-tests/db/com/kssf.com
new file mode 100644
index 0000000..0eed511
Binary files /dev/null and b/tests/file-tests/db/com/kssf.com differ
diff --git a/tests/file-tests/db/com/kssf.com.source.txt b/tests/file-tests/db/com/kssf.com.source.txt
new file mode 100644
index 0000000..0f19045
--- /dev/null
+++ b/tests/file-tests/db/com/kssf.com.source.txt
@@ -0,0 +1,2 @@
+URL: ftp://ftp.ibiblio.org/pub/micro/pc-stuff/freedos/files/dos/command/0.83/com083b26x.zip
+License: GPL
diff --git a/tests/file-tests/db/cpl/ac3filter_first4k.cpl b/tests/file-tests/db/cpl/ac3filter_first4k.cpl
new file mode 100644
index 0000000..a508681
Binary files /dev/null and b/tests/file-tests/db/cpl/ac3filter_first4k.cpl differ
diff --git a/tests/file-tests/db/cpl/ac3filter_first4k.cpl.source.txt b/tests/file-tests/db/cpl/ac3filter_first4k.cpl.source.txt
new file mode 100644
index 0000000..775683d
--- /dev/null
+++ b/tests/file-tests/db/cpl/ac3filter_first4k.cpl.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Alexander Vigovsky 
+URL: http://ac3filter.sourceforge.net/ac3filter_eng.html
+LICENSE: GNU General Public Licence v2
diff --git a/tests/file-tests/db/cpp/test.cpp b/tests/file-tests/db/cpp/test.cpp
new file mode 100644
index 0000000..b7f74dc
--- /dev/null
+++ b/tests/file-tests/db/cpp/test.cpp
@@ -0,0 +1,184 @@
+/**************************************************************************\
+ *
+ *  This file is part of the Coin 3D visualization library.
+ *  Copyright (C) 1998-2009 by Kongsberg SIM.  All rights reserved.
+ *
+ *  This library is free software; you can redistribute it and/or
+ *  modify it under the terms of the GNU General Public License
+ *  ("GPL") version 2 as published by the Free Software Foundation.
+ *  See the file LICENSE.GPL at the root directory of this source
+ *  distribution for additional information about the GNU GPL.
+ *
+ *  For using Coin with software that can not be combined with the GNU
+ *  GPL, and for taking advantage of the additional benefits of our
+ *  support services, please contact Kongsberg SIM about acquiring
+ *  a Coin Professional Edition License.
+ *
+ *  See http://www.coin3d.org/ for more information.
+ *
+ *  Kongsberg SIM, Postboks 1283, Pirsenteret, 7462 Trondheim, NORWAY.
+ *  http://www.sim.no/  sales@sim.no  coin-support@coin3d.org
+ *
+\**************************************************************************/
+
+#include <Inventor/SbClip.h>
+#include <Inventor/SbVec2f.h>
+#include <Inventor/SbPlane.h>
+#include <cstdio>
+#include <cassert>
+
+/*!
+  \class SbClip SbClip.h include/Inventor/base/SbClip.h
+  \brief The SbClip class is a generic polygon clipper class.
+  \ingroup base
+
+  It is used by first adding all vertices in the polygon, and then
+  clipping against any number of planes. If you need to supply
+  additional information per vertex (e.g. texture coordinates), you
+  should supply a callback in the constructor, and a pointer to your
+  vertex structure in addVertex(). For every new vertex created, the
+  callback is called with the line being clipped, including the
+  pointers to your vertex structures and the position of the new
+  (clipped against some plane) vertex. You should then create a new
+  vertex structure, calculate your data (e.g. a new texture
+  coordinate) and return a pointer to this structure.  
+
+  \COIN_CLASS_EXTENSION
+
+  \since Coin 2.0
+*/
+// FIXME: a small usage example would do wonders for the class
+// doc. 20020120 mortene.
+
+/*!
+  A constructor. Supply a callback if you need to handle additional
+  data per vertex.
+*/
+SbClip::SbClip(SbClipCallback * callback, void * userdata)
+  : callback(callback),
+    cbdata(userdata),
+    curr(0)
+{
+}
+
+/*!
+  Adds a polygon vertex. \a vdata could be a pointer to your
+  vertex structure.
+*/
+void
+SbClip::addVertex(const SbVec3f &v, void * vdata)
+{
+  this->array[this->curr].append(SbClipData(v, vdata));
+}
+
+/*!
+  Resets the clipper. This should be called before adding any vertices
+  when reusing an SbClip instance.
+*/
+void
+SbClip::reset(void)
+{
+  this->array[0].truncate(0);
+  this->array[1].truncate(0);
+}
+
+//
+// private method, inline only inside this class
+//
+inline void
+SbClip::outputVertex(const SbVec3f & v, void * data)
+{
+  this->array[this->curr ^ 1].append(SbClipData(v, data));
+}
+
+/*!
+  Clip polygon against \a plane. This might change the number of
+  vertices in the polygon. For each time a new vertex is created, the
+  callback supplied in the constructor (if != NULL) is called with the
+  line being clipped and the new vertex calculated. The callback
+  should return a new void pointer to be stored by the clipper.
+*/
+void
+SbClip::clip(const SbPlane & plane)
+{
+  int n = this->array[this->curr].getLength();
+
+  if (n == 0) return;
+
+  // create loop
+  SbClipData dummy = this->array[this->curr][0];
+  this->array[this->curr].append(dummy);
+
+  const SbVec3f & planeN = plane.getNormal();
+
+  for (int i = 0; i < n; i++) {
+    SbVec3f v0, v1;
+    void * data0, *data1;
+    this->array[this->curr][i].get(v0, data0);
+    this->array[this->curr][i+1].get(v1, data1);
+
+    float d0 = plane.getDistance(v0);
+    float d1 = plane.getDistance(v1);
+
+    if (d0 >= 0.0f && d1 < 0.0f) { // exit plane
+      SbVec3f dir = v1-v0;
+      // we know that v0 != v1 since we got here
+      (void) dir.normalize();
+      float dot = dir.dot(planeN);
+      SbVec3f newvertex = v0 - dir * (d0/dot);
+      void * newdata = NULL;
+      if (this->callback) {
+        newdata = this->callback(v0, data0, v1, data1, newvertex, this->cbdata);
+      }
+      outputVertex(newvertex, newdata);
+    }
+    else if (d0 < 0.0f && d1 >= 0.0f) { // enter plane
+      SbVec3f dir = v1-v0;
+      // we know that v0 != v1 since we got here
+      (void) dir.normalize();
+      float dot = dir.dot(planeN);
+      SbVec3f newvertex = v0 - dir * (d0/dot);
+      void * newdata = NULL;
+      if (this->callback) {
+        newdata = this->callback(v0, data0, v1, data1, newvertex, this->cbdata);
+      }
+      outputVertex(newvertex, newdata);
+      outputVertex(v1, data1);
+    }
+    else if (d0 >= 0.0f && d1 >= 0.0f) { // in plane
+      outputVertex(v1, data1);
+    }
+  }
+  this->array[this->curr].truncate(0);
+  this->curr ^= 1;
+}
+
+/*!
+  Returns the number of vertices in the polygon.
+  \sa SbClip::getVertex()
+*/
+int
+SbClip::getNumVertices(void) const
+{
+  return this->array[this->curr].getLength();
+}
+
+/*!
+  Returns the vertex at index \a idx.
+  \sa SbClip::getNumVertices()
+*/
+void
+SbClip::getVertex(const int idx, SbVec3f & v, void ** vdata) const
+{
+  v = this->array[this->curr][idx].vertex;
+  if (vdata) *vdata = this->array[this->curr][idx].data;
+}
+
+/*!
+  Return the vertex data at index \a idx.
+*/
+void *
+SbClip::getVertexData(const int idx) const
+{
+  return this->array[this->curr][idx].data;
+}
diff --git a/tests/file-tests/db/cpp/test.cpp.source.txt b/tests/file-tests/db/cpp/test.cpp.source.txt
new file mode 100644
index 0000000..2297e23
--- /dev/null
+++ b/tests/file-tests/db/cpp/test.cpp.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: http://fossies.org/dox/Coin-3.1.3/SbClip_8cpp_source.html
+LICENSE: GPLv2
diff --git a/tests/file-tests/db/crt/server.crt b/tests/file-tests/db/crt/server.crt
new file mode 100644
index 0000000..79d58e1
--- /dev/null
+++ b/tests/file-tests/db/crt/server.crt
@@ -0,0 +1,13 @@
+-----BEGIN CERTIFICATE-----
+MIIB+zCCAWQCCQDiQZMQOrZAPTANBgkqhkiG9w0BAQUFADBCMQswCQYDVQQGEwJY
+WDEVMBMGA1UEBwwMRGVmYXVsdCBDaXR5MRwwGgYDVQQKDBNEZWZhdWx0IENvbXBh
+bnkgTHRkMB4XDTE0MDMyMDEzNTAzOVoXDTE1MDMyMDEzNTAzOVowQjELMAkGA1UE
+BhMCWFgxFTATBgNVBAcMDERlZmF1bHQgQ2l0eTEcMBoGA1UECgwTRGVmYXVsdCBD
+b21wYW55IEx0ZDCBnzANBgkqhkiG9w0BAQEFAAOBjQAwgYkCgYEA+8FzYRJxNs6X
+E9iASuNLXMkhu/kHiB2lN/zV5IAv4q/LOyJcm7kkP3KuXtieCIRZkjXD3ltFiOzI
+JHOcUFSPqiRNh08aYQEfP/R2F2KhCmpjbhCL45TiqW8FGJQzFs1vhFcHvRowMEB6
+lAZ33qha5UFh3lmHZEs1o6eqv2JLedkCAwEAATANBgkqhkiG9w0BAQUFAAOBgQC2
+DTuUTOTc1VpucwI4qlhW4Eba2X6XH73VeyeqYe6BaKM2tu9YGIMUsSBvRFx98VRs
+FFBnGbrNvC3V2n+HaMZhMvTZv5WxqWeiqPBYPicIPWYXQr1OdaXCZ3R+BXoNW7KH
+I6+HpjzIR9HRSKSXmx2gkgEEPgrjfUCmCv1vDAHO9g==
+-----END CERTIFICATE-----
diff --git a/tests/file-tests/db/crt/server.crt.source.txt b/tests/file-tests/db/crt/server.crt.source.txt
new file mode 100644
index 0000000..2514565
--- /dev/null
+++ b/tests/file-tests/db/crt/server.crt.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck, intra2net
+URL: None (self-created)
+LICENSE: public domain
diff --git a/tests/file-tests/db/cur/cursor.cur b/tests/file-tests/db/cur/cursor.cur
new file mode 100644
index 0000000..afb823a
Binary files /dev/null and b/tests/file-tests/db/cur/cursor.cur differ
diff --git a/tests/file-tests/db/cur/cursor.cur.source.txt b/tests/file-tests/db/cur/cursor.cur.source.txt
new file mode 100644
index 0000000..fe2f636
--- /dev/null
+++ b/tests/file-tests/db/cur/cursor.cur.source.txt
@@ -0,0 +1,5 @@
+cursor from http://www.rw-designer.com/cursor-detail/24909
+original file name: Diamond Sword - Normal Select.cur
+
+license: "Release to PUblic Domain" license ("You are free: To use this work for any legal purpose.")
+Published on May 6th 2011 by NesManiac
diff --git a/tests/file-tests/db/dat/winmail.dat b/tests/file-tests/db/dat/winmail.dat
new file mode 100644
index 0000000..733b609
Binary files /dev/null and b/tests/file-tests/db/dat/winmail.dat differ
diff --git a/tests/file-tests/db/dat/winmail.dat.source.txt b/tests/file-tests/db/dat/winmail.dat.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/dat/winmail.dat.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/db/sqlite3.db b/tests/file-tests/db/db/sqlite3.db
new file mode 100644
index 0000000..c532201
Binary files /dev/null and b/tests/file-tests/db/db/sqlite3.db differ
diff --git a/tests/file-tests/db/db/sqlite3.db.source.txt b/tests/file-tests/db/db/sqlite3.db.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/db/sqlite3.db.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/db/test.db b/tests/file-tests/db/db/test.db
new file mode 100644
index 0000000..afb6500
Binary files /dev/null and b/tests/file-tests/db/db/test.db differ
diff --git a/tests/file-tests/db/db/test.db.source.txt b/tests/file-tests/db/db/test.db.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/db/test.db.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/db/thumbs.db b/tests/file-tests/db/db/thumbs.db
new file mode 100644
index 0000000..a353493
Binary files /dev/null and b/tests/file-tests/db/db/thumbs.db differ
diff --git a/tests/file-tests/db/dbf/biblio.dbf b/tests/file-tests/db/dbf/biblio.dbf
new file mode 100644
index 0000000..5b795db
Binary files /dev/null and b/tests/file-tests/db/dbf/biblio.dbf differ
diff --git a/tests/file-tests/db/dbf/biblio.dbf.source.txt b/tests/file-tests/db/dbf/biblio.dbf.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/dbf/biblio.dbf.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/deb/p.deb b/tests/file-tests/db/deb/p.deb
new file mode 100644
index 0000000..c89e408
Binary files /dev/null and b/tests/file-tests/db/deb/p.deb differ
diff --git a/tests/file-tests/db/deb/p.deb.source.txt b/tests/file-tests/db/deb/p.deb.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/deb/p.deb.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/diso/foo.diso b/tests/file-tests/db/diso/foo.diso
new file mode 100644
index 0000000..bea857d
Binary files /dev/null and b/tests/file-tests/db/diso/foo.diso differ
diff --git a/tests/file-tests/db/diso/foo.diso.source.txt b/tests/file-tests/db/diso/foo.diso.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/diso/foo.diso.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dll/SDL2.dll b/tests/file-tests/db/dll/SDL2.dll
new file mode 100644
index 0000000..81144e1
Binary files /dev/null and b/tests/file-tests/db/dll/SDL2.dll differ
diff --git a/tests/file-tests/db/dll/SDL2.dll.source.txt b/tests/file-tests/db/dll/SDL2.dll.source.txt
new file mode 100644
index 0000000..9fdb6fa
--- /dev/null
+++ b/tests/file-tests/db/dll/SDL2.dll.source.txt
@@ -0,0 +1,2 @@
+URL: http://libsdl.org/release/SDL2-2.0.3-win32-x86.zip
+License: zlib license
diff --git a/tests/file-tests/db/dmp/mdmp.dmp b/tests/file-tests/db/dmp/mdmp.dmp
new file mode 100644
index 0000000..c68a921
Binary files /dev/null and b/tests/file-tests/db/dmp/mdmp.dmp differ
diff --git a/tests/file-tests/db/dmp/mdmp.dmp.source.txt b/tests/file-tests/db/dmp/mdmp.dmp.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/dmp/mdmp.dmp.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/doc/PMD.doc b/tests/file-tests/db/doc/PMD.doc
new file mode 100644
index 0000000..e902b98
Binary files /dev/null and b/tests/file-tests/db/doc/PMD.doc differ
diff --git a/tests/file-tests/db/doc/PMD.doc.source.txt b/tests/file-tests/db/doc/PMD.doc.source.txt
new file mode 100644
index 0000000..09836c6
--- /dev/null
+++ b/tests/file-tests/db/doc/PMD.doc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: http://java.labsoft.dcc.ufmg.br/comets/dataset/pmd/srcs/pmd96/etc/fr_docs/PMD.doc
+LICENSE: BSD
diff --git a/tests/file-tests/db/doc/encrypted.doc b/tests/file-tests/db/doc/encrypted.doc
new file mode 100644
index 0000000..cf553d7
Binary files /dev/null and b/tests/file-tests/db/doc/encrypted.doc differ
diff --git a/tests/file-tests/db/doc/encrypted.doc.source.txt b/tests/file-tests/db/doc/encrypted.doc.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/doc/encrypted.doc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/doc/word_document.doc b/tests/file-tests/db/doc/word_document.doc
new file mode 100755
index 0000000..786e979
Binary files /dev/null and b/tests/file-tests/db/doc/word_document.doc differ
diff --git a/tests/file-tests/db/doc/word_document.doc.source.txt b/tests/file-tests/db/doc/word_document.doc.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/doc/word_document.doc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/doc/word_document_with_autostart_macro.doc b/tests/file-tests/db/doc/word_document_with_autostart_macro.doc
new file mode 100755
index 0000000..2d36a0a
Binary files /dev/null and b/tests/file-tests/db/doc/word_document_with_autostart_macro.doc differ
diff --git a/tests/file-tests/db/doc/word_document_with_autostart_macro.doc.source.txt b/tests/file-tests/db/doc/word_document_with_autostart_macro.doc.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/doc/word_document_with_autostart_macro.doc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/docm/encrypted.docm b/tests/file-tests/db/docm/encrypted.docm
new file mode 100644
index 0000000..92d608a
Binary files /dev/null and b/tests/file-tests/db/docm/encrypted.docm differ
diff --git a/tests/file-tests/db/docm/encrypted.docm.source.txt b/tests/file-tests/db/docm/encrypted.docm.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/docm/encrypted.docm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/docm/word_document.docm b/tests/file-tests/db/docm/word_document.docm
new file mode 100755
index 0000000..ceee14e
Binary files /dev/null and b/tests/file-tests/db/docm/word_document.docm differ
diff --git a/tests/file-tests/db/docm/word_document.docm.source.txt b/tests/file-tests/db/docm/word_document.docm.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/docm/word_document.docm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/docm/word_document_with_autostart_macro.docm b/tests/file-tests/db/docm/word_document_with_autostart_macro.docm
new file mode 100755
index 0000000..0689920
Binary files /dev/null and b/tests/file-tests/db/docm/word_document_with_autostart_macro.docm differ
diff --git a/tests/file-tests/db/docm/word_document_with_autostart_macro.docm.source.txt b/tests/file-tests/db/docm/word_document_with_autostart_macro.docm.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/docm/word_document_with_autostart_macro.docm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/docx/encrypted.docx b/tests/file-tests/db/docx/encrypted.docx
new file mode 100644
index 0000000..06d9e87
Binary files /dev/null and b/tests/file-tests/db/docx/encrypted.docx differ
diff --git a/tests/file-tests/db/docx/encrypted.docx.source.txt b/tests/file-tests/db/docx/encrypted.docx.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/docx/encrypted.docx.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/docx/word_document.docx b/tests/file-tests/db/docx/word_document.docx
new file mode 100755
index 0000000..38976e8
Binary files /dev/null and b/tests/file-tests/db/docx/word_document.docx differ
diff --git a/tests/file-tests/db/docx/word_document.docx.source.txt b/tests/file-tests/db/docx/word_document.docx.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/docx/word_document.docx.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dot/word_document.dot b/tests/file-tests/db/dot/word_document.dot
new file mode 100755
index 0000000..cddc75b
Binary files /dev/null and b/tests/file-tests/db/dot/word_document.dot differ
diff --git a/tests/file-tests/db/dot/word_document.dot.source.txt b/tests/file-tests/db/dot/word_document.dot.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/dot/word_document.dot.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dot/word_document_with_autostart_macro.dot b/tests/file-tests/db/dot/word_document_with_autostart_macro.dot
new file mode 100755
index 0000000..c35ee7d
Binary files /dev/null and b/tests/file-tests/db/dot/word_document_with_autostart_macro.dot differ
diff --git a/tests/file-tests/db/dot/word_document_with_autostart_macro.dot.source.txt b/tests/file-tests/db/dot/word_document_with_autostart_macro.dot.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/dot/word_document_with_autostart_macro.dot.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dotm/word_document.dotm b/tests/file-tests/db/dotm/word_document.dotm
new file mode 100755
index 0000000..1abf18a
Binary files /dev/null and b/tests/file-tests/db/dotm/word_document.dotm differ
diff --git a/tests/file-tests/db/dotm/word_document.dotm.source.txt b/tests/file-tests/db/dotm/word_document.dotm.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/dotm/word_document.dotm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dotm/word_document_with_autostart_macro.dotm b/tests/file-tests/db/dotm/word_document_with_autostart_macro.dotm
new file mode 100755
index 0000000..057b14e
Binary files /dev/null and b/tests/file-tests/db/dotm/word_document_with_autostart_macro.dotm differ
diff --git a/tests/file-tests/db/dotm/word_document_with_autostart_macro.dotm.source.txt b/tests/file-tests/db/dotm/word_document_with_autostart_macro.dotm.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/dotm/word_document_with_autostart_macro.dotm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dotx/word_document.dotx b/tests/file-tests/db/dotx/word_document.dotx
new file mode 100755
index 0000000..dd38e84
Binary files /dev/null and b/tests/file-tests/db/dotx/word_document.dotx differ
diff --git a/tests/file-tests/db/dotx/word_document.dotx.source.txt b/tests/file-tests/db/dotx/word_document.dotx.source.txt
new file mode 100644
index 0000000..4ecf03e
--- /dev/null
+++ b/tests/file-tests/db/dotx/word_document.dotx.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christian Herdtweck <christian.herdtweck@intra2net.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/drpm/foo1.drpm b/tests/file-tests/db/drpm/foo1.drpm
new file mode 100644
index 0000000..c4f468a
Binary files /dev/null and b/tests/file-tests/db/drpm/foo1.drpm differ
diff --git a/tests/file-tests/db/drpm/foo1.drpm.source.txt b/tests/file-tests/db/drpm/foo1.drpm.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/drpm/foo1.drpm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/drpm/foo2.drpm b/tests/file-tests/db/drpm/foo2.drpm
new file mode 100644
index 0000000..3105bba
Binary files /dev/null and b/tests/file-tests/db/drpm/foo2.drpm differ
diff --git a/tests/file-tests/db/drpm/foo2.drpm.source.txt b/tests/file-tests/db/drpm/foo2.drpm.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/drpm/foo2.drpm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dump/big-endian-dump b/tests/file-tests/db/dump/big-endian-dump
new file mode 100644
index 0000000..6a874bc
Binary files /dev/null and b/tests/file-tests/db/dump/big-endian-dump differ
diff --git a/tests/file-tests/db/dump/big-endian-dump.source.txt b/tests/file-tests/db/dump/big-endian-dump.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/dump/big-endian-dump.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/dump/evolocal.odb b/tests/file-tests/db/dump/evolocal.odb
new file mode 100644
index 0000000..82f486a
Binary files /dev/null and b/tests/file-tests/db/dump/evolocal.odb differ
diff --git a/tests/file-tests/db/dump/evolocal.odb.source.txt b/tests/file-tests/db/dump/evolocal.odb.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/dump/evolocal.odb.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/a b/tests/file-tests/db/elf/a
new file mode 100755
index 0000000..43dffa7
Binary files /dev/null and b/tests/file-tests/db/elf/a differ
diff --git a/tests/file-tests/db/elf/a.source.txt b/tests/file-tests/db/elf/a.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/elf/a.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/filter b/tests/file-tests/db/elf/filter
new file mode 100644
index 0000000..b19698d
Binary files /dev/null and b/tests/file-tests/db/elf/filter differ
diff --git a/tests/file-tests/db/elf/filter.source.txt b/tests/file-tests/db/elf/filter.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/elf/filter.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/hello-aarch64-executable b/tests/file-tests/db/elf/hello-aarch64-executable
new file mode 100644
index 0000000..578dfd1
Binary files /dev/null and b/tests/file-tests/db/elf/hello-aarch64-executable differ
diff --git a/tests/file-tests/db/elf/hello-aarch64-executable.source.txt b/tests/file-tests/db/elf/hello-aarch64-executable.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/elf/hello-aarch64-executable.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/library-now.so b/tests/file-tests/db/elf/library-now.so
new file mode 100755
index 0000000..fd7afb5
Binary files /dev/null and b/tests/file-tests/db/elf/library-now.so differ
diff --git a/tests/file-tests/db/elf/library-now.so.source.txt b/tests/file-tests/db/elf/library-now.so.source.txt
new file mode 100644
index 0000000..72d8cbf
--- /dev/null
+++ b/tests/file-tests/db/elf/library-now.so.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christos Zoulas <christos@zoulas.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/library.so b/tests/file-tests/db/elf/library.so
new file mode 100755
index 0000000..14a0dae
Binary files /dev/null and b/tests/file-tests/db/elf/library.so differ
diff --git a/tests/file-tests/db/elf/library.so.source.txt b/tests/file-tests/db/elf/library.so.source.txt
new file mode 100644
index 0000000..72d8cbf
--- /dev/null
+++ b/tests/file-tests/db/elf/library.so.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christos Zoulas <christos@zoulas.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/new-keyctl.debug b/tests/file-tests/db/elf/new-keyctl.debug
new file mode 100644
index 0000000..35f16f5
Binary files /dev/null and b/tests/file-tests/db/elf/new-keyctl.debug differ
diff --git a/tests/file-tests/db/elf/new-keyctl.debug.source.txt b/tests/file-tests/db/elf/new-keyctl.debug.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/elf/new-keyctl.debug.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/old-keyctl.debug b/tests/file-tests/db/elf/old-keyctl.debug
new file mode 100644
index 0000000..a298116
Binary files /dev/null and b/tests/file-tests/db/elf/old-keyctl.debug differ
diff --git a/tests/file-tests/db/elf/old-keyctl.debug.source.txt b/tests/file-tests/db/elf/old-keyctl.debug.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/elf/old-keyctl.debug.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/pie-now.out b/tests/file-tests/db/elf/pie-now.out
new file mode 100755
index 0000000..d41763a
Binary files /dev/null and b/tests/file-tests/db/elf/pie-now.out differ
diff --git a/tests/file-tests/db/elf/pie-now.out.source.txt b/tests/file-tests/db/elf/pie-now.out.source.txt
new file mode 100644
index 0000000..72d8cbf
--- /dev/null
+++ b/tests/file-tests/db/elf/pie-now.out.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christos Zoulas <christos@zoulas.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/pie-test b/tests/file-tests/db/elf/pie-test
new file mode 100755
index 0000000..1a9cd9d
--- /dev/null
+++ b/tests/file-tests/db/elf/pie-test
@@ -0,0 +1,40 @@
+#!/bin/sh
+# Test program code [1].
+
+check() {
+	../../../file -m ../../../../magic/magic.mgc "$@"
+}
+
+cat << EOF > f1.c
+void main(void)
+{
+	int i = 69;
+	i = i;
+	return;
+}
+EOF
+
+attr() {
+cat << EOF > $output.source.txt
+AUTHOR: Christos Zoulas <christos@zoulas.com>
+URL: Created it myself
+LICENSE: public domain
+EOF
+}
+
+run() {
+	local flags=$1
+	local output=$2
+	local pie=$3
+	set -x
+	gcc -shared -fpie $flags f1.c -o $output
+	set +x
+	check $output
+	attr $output
+}
+
+
+run "" library.so no
+run "-pie" pie.out yes
+run "-Wl,-z,now" library-now.so no
+run "-pie -Wl,-z,now" pie-now.out yes
diff --git a/tests/file-tests/db/elf/pie.out b/tests/file-tests/db/elf/pie.out
new file mode 100755
index 0000000..d41763a
Binary files /dev/null and b/tests/file-tests/db/elf/pie.out differ
diff --git a/tests/file-tests/db/elf/pie.out.source.txt b/tests/file-tests/db/elf/pie.out.source.txt
new file mode 100644
index 0000000..72d8cbf
--- /dev/null
+++ b/tests/file-tests/db/elf/pie.out.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Christos Zoulas <christos@zoulas.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/elf/ppm b/tests/file-tests/db/elf/ppm
new file mode 100644
index 0000000..480ec2c
Binary files /dev/null and b/tests/file-tests/db/elf/ppm differ
diff --git a/tests/file-tests/db/elf/ppm.source.txt b/tests/file-tests/db/elf/ppm.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/elf/ppm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/exe/e5f5fdb10c8bb35d3219a87516147e15.exe b/tests/file-tests/db/exe/e5f5fdb10c8bb35d3219a87516147e15.exe
new file mode 100644
index 0000000..d7285ff
Binary files /dev/null and b/tests/file-tests/db/exe/e5f5fdb10c8bb35d3219a87516147e15.exe differ
diff --git a/tests/file-tests/db/filesystems/bootsector b/tests/file-tests/db/filesystems/bootsector
new file mode 100644
index 0000000..9d182ca
Binary files /dev/null and b/tests/file-tests/db/filesystems/bootsector differ
diff --git a/tests/file-tests/db/filesystems/bootsector.source.txt b/tests/file-tests/db/filesystems/bootsector.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/bootsector.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/filesystems/ext4 b/tests/file-tests/db/filesystems/ext4
new file mode 100644
index 0000000..c9bfe89
Binary files /dev/null and b/tests/file-tests/db/filesystems/ext4 differ
diff --git a/tests/file-tests/db/filesystems/ext4.source.txt b/tests/file-tests/db/filesystems/ext4.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/ext4.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/filesystems/filetest b/tests/file-tests/db/filesystems/filetest
new file mode 100644
index 0000000..262b065
Binary files /dev/null and b/tests/file-tests/db/filesystems/filetest differ
diff --git a/tests/file-tests/db/filesystems/filetest.source.txt b/tests/file-tests/db/filesystems/filetest.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/filetest.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/filesystems/lvm2 b/tests/file-tests/db/filesystems/lvm2
new file mode 100644
index 0000000..4006fa7
Binary files /dev/null and b/tests/file-tests/db/filesystems/lvm2 differ
diff --git a/tests/file-tests/db/filesystems/lvm2.source.txt b/tests/file-tests/db/filesystems/lvm2.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/lvm2.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/filesystems/ntfs b/tests/file-tests/db/filesystems/ntfs
new file mode 100644
index 0000000..c9bfe89
Binary files /dev/null and b/tests/file-tests/db/filesystems/ntfs differ
diff --git a/tests/file-tests/db/filesystems/ntfs.source.txt b/tests/file-tests/db/filesystems/ntfs.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/ntfs.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/filesystems/swap-ia64 b/tests/file-tests/db/filesystems/swap-ia64
new file mode 100644
index 0000000..a4e0206
Binary files /dev/null and b/tests/file-tests/db/filesystems/swap-ia64 differ
diff --git a/tests/file-tests/db/filesystems/swap-ia64.source.txt b/tests/file-tests/db/filesystems/swap-ia64.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/swap-ia64.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/filesystems/swap-ppc b/tests/file-tests/db/filesystems/swap-ppc
new file mode 100644
index 0000000..c125f5d
Binary files /dev/null and b/tests/file-tests/db/filesystems/swap-ppc differ
diff --git a/tests/file-tests/db/filesystems/swap-ppc.source.txt b/tests/file-tests/db/filesystems/swap-ppc.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/filesystems/swap-ppc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/frm/help_relation.frm b/tests/file-tests/db/frm/help_relation.frm
new file mode 100644
index 0000000..a40daaa
Binary files /dev/null and b/tests/file-tests/db/frm/help_relation.frm differ
diff --git a/tests/file-tests/db/frm/help_relation.frm.source.txt b/tests/file-tests/db/frm/help_relation.frm.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/frm/help_relation.frm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/gif/1.gif b/tests/file-tests/db/gif/1.gif
new file mode 100644
index 0000000..d912c3e
Binary files /dev/null and b/tests/file-tests/db/gif/1.gif differ
diff --git a/tests/file-tests/db/gif/1.gif.source.txt b/tests/file-tests/db/gif/1.gif.source.txt
new file mode 100644
index 0000000..3a15510
--- /dev/null
+++ b/tests/file-tests/db/gif/1.gif.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it from http://www.isc.tamu.edu/~lewing/linux/
+LICENSE: public domain
diff --git a/tests/file-tests/db/gz/a.gz b/tests/file-tests/db/gz/a.gz
new file mode 100644
index 0000000..5110f21
Binary files /dev/null and b/tests/file-tests/db/gz/a.gz differ
diff --git a/tests/file-tests/db/gz/a.gz.source.txt b/tests/file-tests/db/gz/a.gz.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/gz/a.gz.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/gz/abc1.gz b/tests/file-tests/db/gz/abc1.gz
new file mode 100644
index 0000000..2fdd94c
Binary files /dev/null and b/tests/file-tests/db/gz/abc1.gz differ
diff --git a/tests/file-tests/db/gz/abc1.gz.source.txt b/tests/file-tests/db/gz/abc1.gz.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/gz/abc1.gz.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/gz/abc2.gz b/tests/file-tests/db/gz/abc2.gz
new file mode 100644
index 0000000..f096b28
Binary files /dev/null and b/tests/file-tests/db/gz/abc2.gz differ
diff --git a/tests/file-tests/db/gz/abc2.gz.source.txt b/tests/file-tests/db/gz/abc2.gz.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/gz/abc2.gz.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/h/a.h b/tests/file-tests/db/h/a.h
new file mode 100644
index 0000000..7f869bc
--- /dev/null
+++ b/tests/file-tests/db/h/a.h
@@ -0,0 +1,23 @@
+/* This file is automatically generated.
+   It defines a symbol `__stub_FUNCTION' for each function
+   in the C library which is a stub, meaning it will fail
+   every time called, usually setting errno to ENOSYS.  */
+
+#ifdef _LIBC
+# error Applications may not define the macro _LIBC
+#endif
+
+#define __stub___kernel_cosl
+#define __stub___kernel_sinl
+#define __stub___kernel_tanl
+#define __stub_chflags
+#define __stub_fattach
+#define __stub_fchflags
+#define __stub_fdetach
+#define __stub_gtty
+#define __stub_lchmod
+#define __stub_revoke
+#define __stub_setlogin
+#define __stub_sigreturn
+#define __stub_sstk
+#define __stub_stty
diff --git a/tests/file-tests/db/h/a.h.source.txt b/tests/file-tests/db/h/a.h.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/h/a.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/h/basic_string.h b/tests/file-tests/db/h/basic_string.h
new file mode 100644
index 0000000..d6d9989
--- /dev/null
+++ b/tests/file-tests/db/h/basic_string.h
@@ -0,0 +1,2936 @@
+// Components for manipulating sequences of characters -*- C++ -*-
+
+// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
+// 2006, 2007, 2008, 2009, 2010
+// Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, 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 General Public License for more details.
+
+// Under Section 7 of GPL version 3, you are granted additional
+// permissions described in the GCC Runtime Library Exception, version
+// 3.1, as published by the Free Software Foundation.
+
+// You should have received a copy of the GNU General Public License and
+// a copy of the GCC Runtime Library Exception along with this program;
+// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+// <http://www.gnu.org/licenses/>.
+
+/** @file basic_string.h
+ *  This is an internal header file, included by other library headers.
+ *  You should not attempt to use it directly.
+ */
+
+//
+// ISO C++ 14882: 21 Strings library
+//
+
+#ifndef _BASIC_STRING_H
+#define _BASIC_STRING_H 1
+
+#pragma GCC system_header
+
+#include <ext/atomicity.h>
+#include <debug/debug.h>
+#include <initializer_list>
+
+_GLIBCXX_BEGIN_NAMESPACE(std)
+
+  /**
+   *  @class basic_string basic_string.h <string>
+   *  @brief  Managing sequences of characters and character-like objects.
+   *
+   *  @ingroup strings
+   *  @ingroup sequences
+   *
+   *  Meets the requirements of a <a href="tables.html#65">container</a>, a
+   *  <a href="tables.html#66">reversible container</a>, and a
+   *  <a href="tables.html#67">sequence</a>.  Of the
+   *  <a href="tables.html#68">optional sequence requirements</a>, only
+   *  @c push_back, @c at, and @c %array access are supported.
+   *
+   *  @doctodo
+   *
+   *
+   *  Documentation?  What's that?
+   *  Nathan Myers <ncm@cantrip.org>.
+   *
+   *  A string looks like this:
+   *
+   *  @code
+   *                                        [_Rep]
+   *                                        _M_length
+   *   [basic_string<char_type>]            _M_capacity
+   *   _M_dataplus                          _M_refcount
+   *   _M_p ---------------->               unnamed array of char_type
+   *  @endcode
+   *
+   *  Where the _M_p points to the first character in the string, and
+   *  you cast it to a pointer-to-_Rep and subtract 1 to get a
+   *  pointer to the header.
+   *
+   *  This approach has the enormous advantage that a string object
+   *  requires only one allocation.  All the ugliness is confined
+   *  within a single %pair of inline functions, which each compile to
+   *  a single @a add instruction: _Rep::_M_data(), and
+   *  string::_M_rep(); and the allocation function which gets a
+   *  block of raw bytes and with room enough and constructs a _Rep
+   *  object at the front.
+   *
+   *  The reason you want _M_data pointing to the character %array and
+   *  not the _Rep is so that the debugger can see the string
+   *  contents. (Probably we should add a non-inline member to get
+   *  the _Rep for the debugger to use, so users can check the actual
+   *  string length.)
+   *
+   *  Note that the _Rep object is a POD so that you can have a
+   *  static <em>empty string</em> _Rep object already @a constructed before
+   *  static constructors have run.  The reference-count encoding is
+   *  chosen so that a 0 indicates one reference, so you never try to
+   *  destroy the empty-string _Rep object.
+   *
+   *  All but the last paragraph is considered pretty conventional
+   *  for a C++ string implementation.
+  */
+  // 21.3  Template class basic_string
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    class basic_string
+    {
+      typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;
+
+      // Types:
+    public:
+      typedef _Traits					    traits_type;
+      typedef typename _Traits::char_type		    value_type;
+      typedef _Alloc					    allocator_type;
+      typedef typename _CharT_alloc_type::size_type	    size_type;
+      typedef typename _CharT_alloc_type::difference_type   difference_type;
+      typedef typename _CharT_alloc_type::reference	    reference;
+      typedef typename _CharT_alloc_type::const_reference   const_reference;
+      typedef typename _CharT_alloc_type::pointer	    pointer;
+      typedef typename _CharT_alloc_type::const_pointer	    const_pointer;
+      typedef __gnu_cxx::__normal_iterator<pointer, basic_string>  iterator;
+      typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
+                                                            const_iterator;
+      typedef std::reverse_iterator<const_iterator>	const_reverse_iterator;
+      typedef std::reverse_iterator<iterator>		    reverse_iterator;
+
+    private:
+      // _Rep: string representation
+      //   Invariants:
+      //   1. String really contains _M_length + 1 characters: due to 21.3.4
+      //      must be kept null-terminated.
+      //   2. _M_capacity >= _M_length
+      //      Allocated memory is always (_M_capacity + 1) * sizeof(_CharT).
+      //   3. _M_refcount has three states:
+      //      -1: leaked, one reference, no ref-copies allowed, non-const.
+      //       0: one reference, non-const.
+      //     n>0: n + 1 references, operations require a lock, const.
+      //   4. All fields==0 is an empty string, given the extra storage
+      //      beyond-the-end for a null terminator; thus, the shared
+      //      empty string representation needs no constructor.
+
+      struct _Rep_base
+      {
+	size_type		_M_length;
+	size_type		_M_capacity;
+	_Atomic_word		_M_refcount;
+      };
+
+      struct _Rep : _Rep_base
+      {
+	// Types:
+	typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc;
+
+	// (Public) Data members:
+
+	// The maximum number of individual char_type elements of an
+	// individual string is determined by _S_max_size. This is the
+	// value that will be returned by max_size().  (Whereas npos
+	// is the maximum number of bytes the allocator can allocate.)
+	// If one was to divvy up the theoretical largest size string,
+	// with a terminating character and m _CharT elements, it'd
+	// look like this:
+	// npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT)
+	// Solving for m:
+	// m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1
+	// In addition, this implementation quarters this amount.
+	static const size_type	_S_max_size;
+	static const _CharT	_S_terminal;
+
+	// The following storage is init'd to 0 by the linker, resulting
+        // (carefully) in an empty string with one reference.
+        static size_type _S_empty_rep_storage[];
+
+        static _Rep&
+        _S_empty_rep()
+        { 
+	  // NB: Mild hack to avoid strict-aliasing warnings.  Note that
+	  // _S_empty_rep_storage is never modified and the punning should
+	  // be reasonably safe in this case.
+	  void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage);
+	  return *reinterpret_cast<_Rep*>(__p);
+	}
+
+        bool
+	_M_is_leaked() const
+        { return this->_M_refcount < 0; }
+
+        bool
+	_M_is_shared() const
+        { return this->_M_refcount > 0; }
+
+        void
+	_M_set_leaked()
+        { this->_M_refcount = -1; }
+
+        void
+	_M_set_sharable()
+        { this->_M_refcount = 0; }
+
+	void
+	_M_set_length_and_sharable(size_type __n)
+	{
+#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
+	  if (__builtin_expect(this != &_S_empty_rep(), false))
+#endif
+	    {
+	      this->_M_set_sharable();  // One reference.
+	      this->_M_length = __n;
+	      traits_type::assign(this->_M_refdata()[__n], _S_terminal);
+	      // grrr. (per 21.3.4)
+	      // You cannot leave those LWG people alone for a second.
+	    }
+	}
+
+	_CharT*
+	_M_refdata() throw()
+	{ return reinterpret_cast<_CharT*>(this + 1); }
+
+	_CharT*
+	_M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)
+	{
+	  return (!_M_is_leaked() && __alloc1 == __alloc2)
+	          ? _M_refcopy() : _M_clone(__alloc1);
+	}
+
+	// Create & Destroy
+	static _Rep*
+	_S_create(size_type, size_type, const _Alloc&);
+
+	void
+	_M_dispose(const _Alloc& __a)
+	{
+#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
+	  if (__builtin_expect(this != &_S_empty_rep(), false))
+#endif
+	    if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,
+						       -1) <= 0)
+	      _M_destroy(__a);
+	}  // XXX MT
+
+	void
+	_M_destroy(const _Alloc&) throw();
+
+	_CharT*
+	_M_refcopy() throw()
+	{
+#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
+	  if (__builtin_expect(this != &_S_empty_rep(), false))
+#endif
+            __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
+	  return _M_refdata();
+	}  // XXX MT
+
+	_CharT*
+	_M_clone(const _Alloc&, size_type __res = 0);
+      };
+
+      // Use empty-base optimization: http://www.cantrip.org/emptyopt.html
+      struct _Alloc_hider : _Alloc
+      {
+	_Alloc_hider(_CharT* __dat, const _Alloc& __a)
+	: _Alloc(__a), _M_p(__dat) { }
+
+	_CharT* _M_p; // The actual data.
+      };
+
+    public:
+      // Data Members (public):
+      // NB: This is an unsigned type, and thus represents the maximum
+      // size that the allocator can hold.
+      ///  Value returned by various member functions when they fail.
+      static const size_type	npos = static_cast<size_type>(-1);
+
+    private:
+      // Data Members (private):
+      mutable _Alloc_hider	_M_dataplus;
+
+      _CharT*
+      _M_data() const
+      { return  _M_dataplus._M_p; }
+
+      _CharT*
+      _M_data(_CharT* __p)
+      { return (_M_dataplus._M_p = __p); }
+
+      _Rep*
+      _M_rep() const
+      { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }
+
+      // For the internal use we have functions similar to `begin'/`end'
+      // but they do not call _M_leak.
+      iterator
+      _M_ibegin() const
+      { return iterator(_M_data()); }
+
+      iterator
+      _M_iend() const
+      { return iterator(_M_data() + this->size()); }
+
+      void
+      _M_leak()    // for use in begin() & non-const op[]
+      {
+	if (!_M_rep()->_M_is_leaked())
+	  _M_leak_hard();
+      }
+
+      size_type
+      _M_check(size_type __pos, const char* __s) const
+      {
+	if (__pos > this->size())
+	  __throw_out_of_range(__N(__s));
+	return __pos;
+      }
+
+      void
+      _M_check_length(size_type __n1, size_type __n2, const char* __s) const
+      {
+	if (this->max_size() - (this->size() - __n1) < __n2)
+	  __throw_length_error(__N(__s));
+      }
+
+      // NB: _M_limit doesn't check for a bad __pos value.
+      size_type
+      _M_limit(size_type __pos, size_type __off) const
+      {
+	const bool __testoff =  __off < this->size() - __pos;
+	return __testoff ? __off : this->size() - __pos;
+      }
+
+      // True if _Rep and source do not overlap.
+      bool
+      _M_disjunct(const _CharT* __s) const
+      {
+	return (less<const _CharT*>()(__s, _M_data())
+		|| less<const _CharT*>()(_M_data() + this->size(), __s));
+      }
+
+      // When __n = 1 way faster than the general multichar
+      // traits_type::copy/move/assign.
+      static void
+      _M_copy(_CharT* __d, const _CharT* __s, size_type __n)
+      {
+	if (__n == 1)
+	  traits_type::assign(*__d, *__s);
+	else
+	  traits_type::copy(__d, __s, __n);
+      }
+
+      static void
+      _M_move(_CharT* __d, const _CharT* __s, size_type __n)
+      {
+	if (__n == 1)
+	  traits_type::assign(*__d, *__s);
+	else
+	  traits_type::move(__d, __s, __n);	  
+      }
+
+      static void
+      _M_assign(_CharT* __d, size_type __n, _CharT __c)
+      {
+	if (__n == 1)
+	  traits_type::assign(*__d, __c);
+	else
+	  traits_type::assign(__d, __n, __c);	  
+      }
+
+      // _S_copy_chars is a separate template to permit specialization
+      // to optimize for the common case of pointers as iterators.
+      template<class _Iterator>
+        static void
+        _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
+        {
+	  for (; __k1 != __k2; ++__k1, ++__p)
+	    traits_type::assign(*__p, *__k1); // These types are off.
+	}
+
+      static void
+      _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
+      { _S_copy_chars(__p, __k1.base(), __k2.base()); }
+
+      static void
+      _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
+      { _S_copy_chars(__p, __k1.base(), __k2.base()); }
+
+      static void
+      _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)
+      { _M_copy(__p, __k1, __k2 - __k1); }
+
+      static void
+      _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
+      { _M_copy(__p, __k1, __k2 - __k1); }
+
+      static int
+      _S_compare(size_type __n1, size_type __n2)
+      {
+	const difference_type __d = difference_type(__n1 - __n2);
+
+	if (__d > __gnu_cxx::__numeric_traits<int>::__max)
+	  return __gnu_cxx::__numeric_traits<int>::__max;
+	else if (__d < __gnu_cxx::__numeric_traits<int>::__min)
+	  return __gnu_cxx::__numeric_traits<int>::__min;
+	else
+	  return int(__d);
+      }
+
+      void
+      _M_mutate(size_type __pos, size_type __len1, size_type __len2);
+
+      void
+      _M_leak_hard();
+
+      static _Rep&
+      _S_empty_rep()
+      { return _Rep::_S_empty_rep(); }
+
+    public:
+      // Construct/copy/destroy:
+      // NB: We overload ctors in some cases instead of using default
+      // arguments, per 17.4.4.4 para. 2 item 2.
+
+      /**
+       *  @brief  Default constructor creates an empty string.
+       */
+      basic_string()
+#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING
+      : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }
+#else
+      : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc()){ }
+#endif
+
+      /**
+       *  @brief  Construct an empty string using allocator @a a.
+       */
+      explicit
+      basic_string(const _Alloc& __a);
+
+      // NB: per LWG issue 42, semantics different from IS:
+      /**
+       *  @brief  Construct string with copy of value of @a str.
+       *  @param  str  Source string.
+       */
+      basic_string(const basic_string& __str);
+      /**
+       *  @brief  Construct string as copy of a substring.
+       *  @param  str  Source string.
+       *  @param  pos  Index of first character to copy from.
+       *  @param  n  Number of characters to copy (default remainder).
+       */
+      basic_string(const basic_string& __str, size_type __pos,
+		   size_type __n = npos);
+      /**
+       *  @brief  Construct string as copy of a substring.
+       *  @param  str  Source string.
+       *  @param  pos  Index of first character to copy from.
+       *  @param  n  Number of characters to copy.
+       *  @param  a  Allocator to use.
+       */
+      basic_string(const basic_string& __str, size_type __pos,
+		   size_type __n, const _Alloc& __a);
+
+      /**
+       *  @brief  Construct string initialized by a character %array.
+       *  @param  s  Source character %array.
+       *  @param  n  Number of characters to copy.
+       *  @param  a  Allocator to use (default is default allocator).
+       *
+       *  NB: @a s must have at least @a n characters, &apos;\\0&apos;
+       *  has no special meaning.
+       */
+      basic_string(const _CharT* __s, size_type __n,
+		   const _Alloc& __a = _Alloc());
+      /**
+       *  @brief  Construct string as copy of a C string.
+       *  @param  s  Source C string.
+       *  @param  a  Allocator to use (default is default allocator).
+       */
+      basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());
+      /**
+       *  @brief  Construct string as multiple characters.
+       *  @param  n  Number of characters.
+       *  @param  c  Character to use.
+       *  @param  a  Allocator to use (default is default allocator).
+       */
+      basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Move construct string.
+       *  @param  str  Source string.
+       *
+       *  The newly-created string contains the exact contents of @a str.
+       *  @a str is a valid, but unspecified string.
+       **/
+      basic_string(basic_string&& __str)
+      : _M_dataplus(__str._M_dataplus)
+      {
+#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING	
+	__str._M_data(_S_empty_rep()._M_refdata());
+#else
+	__str._M_data(_S_construct(size_type(), _CharT(), get_allocator()));
+#endif
+      }
+
+      /**
+       *  @brief  Construct string from an initializer %list.
+       *  @param  l  std::initializer_list of characters.
+       *  @param  a  Allocator to use (default is default allocator).
+       */
+      basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc());
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      /**
+       *  @brief  Construct string as copy of a range.
+       *  @param  beg  Start of range.
+       *  @param  end  End of range.
+       *  @param  a  Allocator to use (default is default allocator).
+       */
+      template<class _InputIterator>
+        basic_string(_InputIterator __beg, _InputIterator __end,
+		     const _Alloc& __a = _Alloc());
+
+      /**
+       *  @brief  Destroy the string instance.
+       */
+      ~basic_string()
+      { _M_rep()->_M_dispose(this->get_allocator()); }
+
+      /**
+       *  @brief  Assign the value of @a str to this string.
+       *  @param  str  Source string.
+       */
+      basic_string&
+      operator=(const basic_string& __str) 
+      { return this->assign(__str); }
+
+      /**
+       *  @brief  Copy contents of @a s into this string.
+       *  @param  s  Source null-terminated string.
+       */
+      basic_string&
+      operator=(const _CharT* __s) 
+      { return this->assign(__s); }
+
+      /**
+       *  @brief  Set value to string of length 1.
+       *  @param  c  Source character.
+       *
+       *  Assigning to a character makes this string length 1 and
+       *  (*this)[0] == @a c.
+       */
+      basic_string&
+      operator=(_CharT __c) 
+      { 
+	this->assign(1, __c); 
+	return *this;
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Move assign the value of @a str to this string.
+       *  @param  str  Source string.
+       *
+       *  The contents of @a str are moved into this string (without copying).
+       *  @a str is a valid, but unspecified string.
+       **/
+      basic_string&
+      operator=(basic_string&& __str)
+      {
+	// NB: DR 1204.
+	this->swap(__str);
+	return *this;
+      }
+
+      /**
+       *  @brief  Set value to string constructed from initializer %list.
+       *  @param  l  std::initializer_list.
+       */
+      basic_string&
+      operator=(initializer_list<_CharT> __l)
+      {
+	this->assign(__l.begin(), __l.size());
+	return *this;
+      }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      // Iterators:
+      /**
+       *  Returns a read/write iterator that points to the first character in
+       *  the %string.  Unshares the string.
+       */
+      iterator
+      begin()
+      {
+	_M_leak();
+	return iterator(_M_data());
+      }
+
+      /**
+       *  Returns a read-only (constant) iterator that points to the first
+       *  character in the %string.
+       */
+      const_iterator
+      begin() const
+      { return const_iterator(_M_data()); }
+
+      /**
+       *  Returns a read/write iterator that points one past the last
+       *  character in the %string.  Unshares the string.
+       */
+      iterator
+      end()
+      {
+	_M_leak();
+	return iterator(_M_data() + this->size());
+      }
+
+      /**
+       *  Returns a read-only (constant) iterator that points one past the
+       *  last character in the %string.
+       */
+      const_iterator
+      end() const
+      { return const_iterator(_M_data() + this->size()); }
+
+      /**
+       *  Returns a read/write reverse iterator that points to the last
+       *  character in the %string.  Iteration is done in reverse element
+       *  order.  Unshares the string.
+       */
+      reverse_iterator
+      rbegin()
+      { return reverse_iterator(this->end()); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points
+       *  to the last character in the %string.  Iteration is done in
+       *  reverse element order.
+       */
+      const_reverse_iterator
+      rbegin() const
+      { return const_reverse_iterator(this->end()); }
+
+      /**
+       *  Returns a read/write reverse iterator that points to one before the
+       *  first character in the %string.  Iteration is done in reverse
+       *  element order.  Unshares the string.
+       */
+      reverse_iterator
+      rend()
+      { return reverse_iterator(this->begin()); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points
+       *  to one before the first character in the %string.  Iteration
+       *  is done in reverse element order.
+       */
+      const_reverse_iterator
+      rend() const
+      { return const_reverse_iterator(this->begin()); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  Returns a read-only (constant) iterator that points to the first
+       *  character in the %string.
+       */
+      const_iterator
+      cbegin() const
+      { return const_iterator(this->_M_data()); }
+
+      /**
+       *  Returns a read-only (constant) iterator that points one past the
+       *  last character in the %string.
+       */
+      const_iterator
+      cend() const
+      { return const_iterator(this->_M_data() + this->size()); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points
+       *  to the last character in the %string.  Iteration is done in
+       *  reverse element order.
+       */
+      const_reverse_iterator
+      crbegin() const
+      { return const_reverse_iterator(this->end()); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points
+       *  to one before the first character in the %string.  Iteration
+       *  is done in reverse element order.
+       */
+      const_reverse_iterator
+      crend() const
+      { return const_reverse_iterator(this->begin()); }
+#endif
+
+    public:
+      // Capacity:
+      ///  Returns the number of characters in the string, not including any
+      ///  null-termination.
+      size_type
+      size() const
+      { return _M_rep()->_M_length; }
+
+      ///  Returns the number of characters in the string, not including any
+      ///  null-termination.
+      size_type
+      length() const
+      { return _M_rep()->_M_length; }
+
+      ///  Returns the size() of the largest possible %string.
+      size_type
+      max_size() const
+      { return _Rep::_S_max_size; }
+
+      /**
+       *  @brief  Resizes the %string to the specified number of characters.
+       *  @param  n  Number of characters the %string should contain.
+       *  @param  c  Character to fill any new elements.
+       *
+       *  This function will %resize the %string to the specified
+       *  number of characters.  If the number is smaller than the
+       *  %string's current size the %string is truncated, otherwise
+       *  the %string is extended and new elements are %set to @a c.
+       */
+      void
+      resize(size_type __n, _CharT __c);
+
+      /**
+       *  @brief  Resizes the %string to the specified number of characters.
+       *  @param  n  Number of characters the %string should contain.
+       *
+       *  This function will resize the %string to the specified length.  If
+       *  the new size is smaller than the %string's current size the %string
+       *  is truncated, otherwise the %string is extended and new characters
+       *  are default-constructed.  For basic types such as char, this means
+       *  setting them to 0.
+       */
+      void
+      resize(size_type __n)
+      { this->resize(__n, _CharT()); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      ///  A non-binding request to reduce capacity() to size().
+      void
+      shrink_to_fit()
+      {
+	__try
+	  { reserve(0); }
+	__catch(...)
+	  { }
+      }
+#endif
+
+      /**
+       *  Returns the total number of characters that the %string can hold
+       *  before needing to allocate more memory.
+       */
+      size_type
+      capacity() const
+      { return _M_rep()->_M_capacity; }
+
+      /**
+       *  @brief  Attempt to preallocate enough memory for specified number of
+       *          characters.
+       *  @param  res_arg  Number of characters required.
+       *  @throw  std::length_error  If @a res_arg exceeds @c max_size().
+       *
+       *  This function attempts to reserve enough memory for the
+       *  %string to hold the specified number of characters.  If the
+       *  number requested is more than max_size(), length_error is
+       *  thrown.
+       *
+       *  The advantage of this function is that if optimal code is a
+       *  necessity and the user can determine the string length that will be
+       *  required, the user can reserve the memory in %advance, and thus
+       *  prevent a possible reallocation of memory and copying of %string
+       *  data.
+       */
+      void
+      reserve(size_type __res_arg = 0);
+
+      /**
+       *  Erases the string, making it empty.
+       */
+      void
+      clear()
+      { _M_mutate(0, this->size(), 0); }
+
+      /**
+       *  Returns true if the %string is empty.  Equivalent to 
+       *  <code>*this == ""</code>.
+       */
+      bool
+      empty() const
+      { return this->size() == 0; }
+
+      // Element access:
+      /**
+       *  @brief  Subscript access to the data contained in the %string.
+       *  @param  pos  The index of the character to access.
+       *  @return  Read-only (constant) reference to the character.
+       *
+       *  This operator allows for easy, array-style, data access.
+       *  Note that data access with this operator is unchecked and
+       *  out_of_range lookups are not defined. (For checked lookups
+       *  see at().)
+       */
+      const_reference
+      operator[] (size_type __pos) const
+      {
+	_GLIBCXX_DEBUG_ASSERT(__pos <= size());
+	return _M_data()[__pos];
+      }
+
+      /**
+       *  @brief  Subscript access to the data contained in the %string.
+       *  @param  pos  The index of the character to access.
+       *  @return  Read/write reference to the character.
+       *
+       *  This operator allows for easy, array-style, data access.
+       *  Note that data access with this operator is unchecked and
+       *  out_of_range lookups are not defined. (For checked lookups
+       *  see at().)  Unshares the string.
+       */
+      reference
+      operator[](size_type __pos)
+      {
+        // allow pos == size() as v3 extension:
+	_GLIBCXX_DEBUG_ASSERT(__pos <= size());
+        // but be strict in pedantic mode:
+	_GLIBCXX_DEBUG_PEDASSERT(__pos < size());
+	_M_leak();
+	return _M_data()[__pos];
+      }
+
+      /**
+       *  @brief  Provides access to the data contained in the %string.
+       *  @param n The index of the character to access.
+       *  @return  Read-only (const) reference to the character.
+       *  @throw  std::out_of_range  If @a n is an invalid index.
+       *
+       *  This function provides for safer data access.  The parameter is
+       *  first checked that it is in the range of the string.  The function
+       *  throws out_of_range if the check fails.
+       */
+      const_reference
+      at(size_type __n) const
+      {
+	if (__n >= this->size())
+	  __throw_out_of_range(__N("basic_string::at"));
+	return _M_data()[__n];
+      }
+
+      /**
+       *  @brief  Provides access to the data contained in the %string.
+       *  @param n The index of the character to access.
+       *  @return  Read/write reference to the character.
+       *  @throw  std::out_of_range  If @a n is an invalid index.
+       *
+       *  This function provides for safer data access.  The parameter is
+       *  first checked that it is in the range of the string.  The function
+       *  throws out_of_range if the check fails.  Success results in
+       *  unsharing the string.
+       */
+      reference
+      at(size_type __n)
+      {
+	if (__n >= size())
+	  __throw_out_of_range(__N("basic_string::at"));
+	_M_leak();
+	return _M_data()[__n];
+      }
+
+      // Modifiers:
+      /**
+       *  @brief  Append a string to this string.
+       *  @param str  The string to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      operator+=(const basic_string& __str)
+      { return this->append(__str); }
+
+      /**
+       *  @brief  Append a C string.
+       *  @param s  The C string to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      operator+=(const _CharT* __s)
+      { return this->append(__s); }
+
+      /**
+       *  @brief  Append a character.
+       *  @param c  The character to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      operator+=(_CharT __c)
+      { 
+	this->push_back(__c);
+	return *this;
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Append an initializer_list of characters.
+       *  @param l  The initializer_list of characters to be appended.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      operator+=(initializer_list<_CharT> __l)
+      { return this->append(__l.begin(), __l.size()); }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      /**
+       *  @brief  Append a string to this string.
+       *  @param str  The string to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      append(const basic_string& __str);
+
+      /**
+       *  @brief  Append a substring.
+       *  @param str  The string to append.
+       *  @param pos  Index of the first character of str to append.
+       *  @param n  The number of characters to append.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range if @a pos is not a valid index.
+       *
+       *  This function appends @a n characters from @a str starting at @a pos
+       *  to this string.  If @a n is is larger than the number of available
+       *  characters in @a str, the remainder of @a str is appended.
+       */
+      basic_string&
+      append(const basic_string& __str, size_type __pos, size_type __n);
+
+      /**
+       *  @brief  Append a C substring.
+       *  @param s  The C string to append.
+       *  @param n  The number of characters to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      append(const _CharT* __s, size_type __n);
+
+      /**
+       *  @brief  Append a C string.
+       *  @param s  The C string to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      append(const _CharT* __s)
+      {
+	__glibcxx_requires_string(__s);
+	return this->append(__s, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Append multiple characters.
+       *  @param n  The number of characters to append.
+       *  @param c  The character to use.
+       *  @return  Reference to this string.
+       *
+       *  Appends n copies of c to this string.
+       */
+      basic_string&
+      append(size_type __n, _CharT __c);
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Append an initializer_list of characters.
+       *  @param l  The initializer_list of characters to append.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      append(initializer_list<_CharT> __l)
+      { return this->append(__l.begin(), __l.size()); }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      /**
+       *  @brief  Append a range of characters.
+       *  @param first  Iterator referencing the first character to append.
+       *  @param last  Iterator marking the end of the range.
+       *  @return  Reference to this string.
+       *
+       *  Appends characters in the range [first,last) to this string.
+       */
+      template<class _InputIterator>
+        basic_string&
+        append(_InputIterator __first, _InputIterator __last)
+        { return this->replace(_M_iend(), _M_iend(), __first, __last); }
+
+      /**
+       *  @brief  Append a single character.
+       *  @param c  Character to append.
+       */
+      void
+      push_back(_CharT __c)
+      { 
+	const size_type __len = 1 + this->size();
+	if (__len > this->capacity() || _M_rep()->_M_is_shared())
+	  this->reserve(__len);
+	traits_type::assign(_M_data()[this->size()], __c);
+	_M_rep()->_M_set_length_and_sharable(__len);
+      }
+
+      /**
+       *  @brief  Set value to contents of another string.
+       *  @param  str  Source string to use.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      assign(const basic_string& __str);
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Set value to contents of another string.
+       *  @param  str  Source string to use.
+       *  @return  Reference to this string.
+       *
+       *  This function sets this string to the exact contents of @a str.
+       *  @a str is a valid, but unspecified string.
+       */
+      basic_string&
+      assign(basic_string&& __str)
+      {
+	this->swap(__str);
+	return *this;
+      }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      /**
+       *  @brief  Set value to a substring of a string.
+       *  @param str  The string to use.
+       *  @param pos  Index of the first character of str.
+       *  @param n  Number of characters to use.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range if @a pos is not a valid index.
+       *
+       *  This function sets this string to the substring of @a str consisting
+       *  of @a n characters at @a pos.  If @a n is is larger than the number
+       *  of available characters in @a str, the remainder of @a str is used.
+       */
+      basic_string&
+      assign(const basic_string& __str, size_type __pos, size_type __n)
+      { return this->assign(__str._M_data()
+			    + __str._M_check(__pos, "basic_string::assign"),
+			    __str._M_limit(__pos, __n)); }
+
+      /**
+       *  @brief  Set value to a C substring.
+       *  @param s  The C string to use.
+       *  @param n  Number of characters to use.
+       *  @return  Reference to this string.
+       *
+       *  This function sets the value of this string to the first @a n
+       *  characters of @a s.  If @a n is is larger than the number of
+       *  available characters in @a s, the remainder of @a s is used.
+       */
+      basic_string&
+      assign(const _CharT* __s, size_type __n);
+
+      /**
+       *  @brief  Set value to contents of a C string.
+       *  @param s  The C string to use.
+       *  @return  Reference to this string.
+       *
+       *  This function sets the value of this string to the value of @a s.
+       *  The data is copied, so there is no dependence on @a s once the
+       *  function returns.
+       */
+      basic_string&
+      assign(const _CharT* __s)
+      {
+	__glibcxx_requires_string(__s);
+	return this->assign(__s, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Set value to multiple characters.
+       *  @param n  Length of the resulting string.
+       *  @param c  The character to use.
+       *  @return  Reference to this string.
+       *
+       *  This function sets the value of this string to @a n copies of
+       *  character @a c.
+       */
+      basic_string&
+      assign(size_type __n, _CharT __c)
+      { return _M_replace_aux(size_type(0), this->size(), __n, __c); }
+
+      /**
+       *  @brief  Set value to a range of characters.
+       *  @param first  Iterator referencing the first character to append.
+       *  @param last  Iterator marking the end of the range.
+       *  @return  Reference to this string.
+       *
+       *  Sets value of string to characters in the range [first,last).
+      */
+      template<class _InputIterator>
+        basic_string&
+        assign(_InputIterator __first, _InputIterator __last)
+        { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Set value to an initializer_list of characters.
+       *  @param l  The initializer_list of characters to assign.
+       *  @return  Reference to this string.
+       */
+      basic_string&
+      assign(initializer_list<_CharT> __l)
+      { return this->assign(__l.begin(), __l.size()); }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      /**
+       *  @brief  Insert multiple characters.
+       *  @param p  Iterator referencing location in string to insert at.
+       *  @param n  Number of characters to insert
+       *  @param c  The character to insert.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Inserts @a n copies of character @a c starting at the position
+       *  referenced by iterator @a p.  If adding characters causes the length
+       *  to exceed max_size(), length_error is thrown.  The value of the
+       *  string doesn't change if an error is thrown.
+      */
+      void
+      insert(iterator __p, size_type __n, _CharT __c)
+      {	this->replace(__p, __p, __n, __c);  }
+
+      /**
+       *  @brief  Insert a range of characters.
+       *  @param p  Iterator referencing location in string to insert at.
+       *  @param beg  Start of range.
+       *  @param end  End of range.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Inserts characters in range [beg,end).  If adding characters causes
+       *  the length to exceed max_size(), length_error is thrown.  The value
+       *  of the string doesn't change if an error is thrown.
+      */
+      template<class _InputIterator>
+        void
+        insert(iterator __p, _InputIterator __beg, _InputIterator __end)
+        { this->replace(__p, __p, __beg, __end); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Insert an initializer_list of characters.
+       *  @param p  Iterator referencing location in string to insert at.
+       *  @param l  The initializer_list of characters to insert.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       */
+      void
+      insert(iterator __p, initializer_list<_CharT> __l)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
+	this->insert(__p - _M_ibegin(), __l.begin(), __l.size());
+      }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+      /**
+       *  @brief  Insert value of a string.
+       *  @param pos1  Iterator referencing location in string to insert at.
+       *  @param str  The string to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Inserts value of @a str starting at @a pos1.  If adding characters
+       *  causes the length to exceed max_size(), length_error is thrown.  The
+       *  value of the string doesn't change if an error is thrown.
+      */
+      basic_string&
+      insert(size_type __pos1, const basic_string& __str)
+      { return this->insert(__pos1, __str, size_type(0), __str.size()); }
+
+      /**
+       *  @brief  Insert a substring.
+       *  @param pos1  Iterator referencing location in string to insert at.
+       *  @param str  The string to insert.
+       *  @param pos2  Start of characters in str to insert.
+       *  @param n  Number of characters to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *  @throw  std::out_of_range  If @a pos1 > size() or
+       *  @a pos2 > @a str.size().
+       *
+       *  Starting at @a pos1, insert @a n character of @a str beginning with
+       *  @a pos2.  If adding characters causes the length to exceed
+       *  max_size(), length_error is thrown.  If @a pos1 is beyond the end of
+       *  this string or @a pos2 is beyond the end of @a str, out_of_range is
+       *  thrown.  The value of the string doesn't change if an error is
+       *  thrown.
+      */
+      basic_string&
+      insert(size_type __pos1, const basic_string& __str,
+	     size_type __pos2, size_type __n)
+      { return this->insert(__pos1, __str._M_data()
+			    + __str._M_check(__pos2, "basic_string::insert"),
+			    __str._M_limit(__pos2, __n)); }
+
+      /**
+       *  @brief  Insert a C substring.
+       *  @param pos  Iterator referencing location in string to insert at.
+       *  @param s  The C string to insert.
+       *  @param n  The number of characters to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *  @throw  std::out_of_range  If @a pos is beyond the end of this
+       *  string.
+       *
+       *  Inserts the first @a n characters of @a s starting at @a pos.  If
+       *  adding characters causes the length to exceed max_size(),
+       *  length_error is thrown.  If @a pos is beyond end(), out_of_range is
+       *  thrown.  The value of the string doesn't change if an error is
+       *  thrown.
+      */
+      basic_string&
+      insert(size_type __pos, const _CharT* __s, size_type __n);
+
+      /**
+       *  @brief  Insert a C string.
+       *  @param pos  Iterator referencing location in string to insert at.
+       *  @param s  The C string to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *  @throw  std::out_of_range  If @a pos is beyond the end of this
+       *  string.
+       *
+       *  Inserts the first @a n characters of @a s starting at @a pos.  If
+       *  adding characters causes the length to exceed max_size(),
+       *  length_error is thrown.  If @a pos is beyond end(), out_of_range is
+       *  thrown.  The value of the string doesn't change if an error is
+       *  thrown.
+      */
+      basic_string&
+      insert(size_type __pos, const _CharT* __s)
+      {
+	__glibcxx_requires_string(__s);
+	return this->insert(__pos, __s, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Insert multiple characters.
+       *  @param pos  Index in string to insert at.
+       *  @param n  Number of characters to insert
+       *  @param c  The character to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *  @throw  std::out_of_range  If @a pos is beyond the end of this
+       *  string.
+       *
+       *  Inserts @a n copies of character @a c starting at index @a pos.  If
+       *  adding characters causes the length to exceed max_size(),
+       *  length_error is thrown.  If @a pos > length(), out_of_range is
+       *  thrown.  The value of the string doesn't change if an error is
+       *  thrown.
+      */
+      basic_string&
+      insert(size_type __pos, size_type __n, _CharT __c)
+      { return _M_replace_aux(_M_check(__pos, "basic_string::insert"),
+			      size_type(0), __n, __c); }
+
+      /**
+       *  @brief  Insert one character.
+       *  @param p  Iterator referencing position in string to insert at.
+       *  @param c  The character to insert.
+       *  @return  Iterator referencing newly inserted char.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Inserts character @a c at position referenced by @a p.  If adding
+       *  character causes the length to exceed max_size(), length_error is
+       *  thrown.  If @a p is beyond end of string, out_of_range is thrown.
+       *  The value of the string doesn't change if an error is thrown.
+      */
+      iterator
+      insert(iterator __p, _CharT __c)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
+	const size_type __pos = __p - _M_ibegin();
+	_M_replace_aux(__pos, size_type(0), size_type(1), __c);
+	_M_rep()->_M_set_leaked();
+	return iterator(_M_data() + __pos);
+      }
+
+      /**
+       *  @brief  Remove characters.
+       *  @param pos  Index of first character to remove (default 0).
+       *  @param n  Number of characters to remove (default remainder).
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range  If @a pos is beyond the end of this
+       *  string.
+       *
+       *  Removes @a n characters from this string starting at @a pos.  The
+       *  length of the string is reduced by @a n.  If there are < @a n
+       *  characters to remove, the remainder of the string is truncated.  If
+       *  @a p is beyond end of string, out_of_range is thrown.  The value of
+       *  the string doesn't change if an error is thrown.
+      */
+      basic_string&
+      erase(size_type __pos = 0, size_type __n = npos)
+      { 
+	_M_mutate(_M_check(__pos, "basic_string::erase"),
+		  _M_limit(__pos, __n), size_type(0));
+	return *this;
+      }
+
+      /**
+       *  @brief  Remove one character.
+       *  @param position  Iterator referencing the character to remove.
+       *  @return  iterator referencing same location after removal.
+       *
+       *  Removes the character at @a position from this string. The value
+       *  of the string doesn't change if an error is thrown.
+      */
+      iterator
+      erase(iterator __position)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin()
+				 && __position < _M_iend());
+	const size_type __pos = __position - _M_ibegin();
+	_M_mutate(__pos, size_type(1), size_type(0));
+	_M_rep()->_M_set_leaked();
+	return iterator(_M_data() + __pos);
+      }
+
+      /**
+       *  @brief  Remove a range of characters.
+       *  @param first  Iterator referencing the first character to remove.
+       *  @param last  Iterator referencing the end of the range.
+       *  @return  Iterator referencing location of first after removal.
+       *
+       *  Removes the characters in the range [first,last) from this string.
+       *  The value of the string doesn't change if an error is thrown.
+      */
+      iterator
+      erase(iterator __first, iterator __last);
+ 
+      /**
+       *  @brief  Replace characters with value from another string.
+       *  @param pos  Index of first character to replace.
+       *  @param n  Number of characters to be replaced.
+       *  @param str  String to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range  If @a pos is beyond the end of this
+       *  string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [pos,pos+n) from this string.
+       *  In place, the value of @a str is inserted.  If @a pos is beyond end
+       *  of string, out_of_range is thrown.  If the length of the result
+       *  exceeds max_size(), length_error is thrown.  The value of the string
+       *  doesn't change if an error is thrown.
+      */
+      basic_string&
+      replace(size_type __pos, size_type __n, const basic_string& __str)
+      { return this->replace(__pos, __n, __str._M_data(), __str.size()); }
+
+      /**
+       *  @brief  Replace characters with value from another string.
+       *  @param pos1  Index of first character to replace.
+       *  @param n1  Number of characters to be replaced.
+       *  @param str  String to insert.
+       *  @param pos2  Index of first character of str to use.
+       *  @param n2  Number of characters from str to use.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range  If @a pos1 > size() or @a pos2 >
+       *  str.size().
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [pos1,pos1 + n) from this
+       *  string.  In place, the value of @a str is inserted.  If @a pos is
+       *  beyond end of string, out_of_range is thrown.  If the length of the
+       *  result exceeds max_size(), length_error is thrown.  The value of the
+       *  string doesn't change if an error is thrown.
+      */
+      basic_string&
+      replace(size_type __pos1, size_type __n1, const basic_string& __str,
+	      size_type __pos2, size_type __n2)
+      { return this->replace(__pos1, __n1, __str._M_data()
+			     + __str._M_check(__pos2, "basic_string::replace"),
+			     __str._M_limit(__pos2, __n2)); }
+
+      /**
+       *  @brief  Replace characters with value of a C substring.
+       *  @param pos  Index of first character to replace.
+       *  @param n1  Number of characters to be replaced.
+       *  @param s  C string to insert.
+       *  @param n2  Number of characters from @a s to use.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range  If @a pos1 > size().
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [pos,pos + n1) from this string.
+       *  In place, the first @a n2 characters of @a s are inserted, or all
+       *  of @a s if @a n2 is too large.  If @a pos is beyond end of string,
+       *  out_of_range is thrown.  If the length of result exceeds max_size(),
+       *  length_error is thrown.  The value of the string doesn't change if
+       *  an error is thrown.
+      */
+      basic_string&
+      replace(size_type __pos, size_type __n1, const _CharT* __s,
+	      size_type __n2);
+
+      /**
+       *  @brief  Replace characters with value of a C string.
+       *  @param pos  Index of first character to replace.
+       *  @param n1  Number of characters to be replaced.
+       *  @param s  C string to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range  If @a pos > size().
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [pos,pos + n1) from this string.
+       *  In place, the characters of @a s are inserted.  If @a pos is beyond
+       *  end of string, out_of_range is thrown.  If the length of result
+       *  exceeds max_size(), length_error is thrown.  The value of the string
+       *  doesn't change if an error is thrown.
+      */
+      basic_string&
+      replace(size_type __pos, size_type __n1, const _CharT* __s)
+      {
+	__glibcxx_requires_string(__s);
+	return this->replace(__pos, __n1, __s, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Replace characters with multiple characters.
+       *  @param pos  Index of first character to replace.
+       *  @param n1  Number of characters to be replaced.
+       *  @param n2  Number of characters to insert.
+       *  @param c  Character to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::out_of_range  If @a pos > size().
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [pos,pos + n1) from this string.
+       *  In place, @a n2 copies of @a c are inserted.  If @a pos is beyond
+       *  end of string, out_of_range is thrown.  If the length of result
+       *  exceeds max_size(), length_error is thrown.  The value of the string
+       *  doesn't change if an error is thrown.
+      */
+      basic_string&
+      replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
+      { return _M_replace_aux(_M_check(__pos, "basic_string::replace"),
+			      _M_limit(__pos, __n1), __n2, __c); }
+
+      /**
+       *  @brief  Replace range of characters with string.
+       *  @param i1  Iterator referencing start of range to replace.
+       *  @param i2  Iterator referencing end of range to replace.
+       *  @param str  String value to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [i1,i2).  In place, the value of
+       *  @a str is inserted.  If the length of result exceeds max_size(),
+       *  length_error is thrown.  The value of the string doesn't change if
+       *  an error is thrown.
+      */
+      basic_string&
+      replace(iterator __i1, iterator __i2, const basic_string& __str)
+      { return this->replace(__i1, __i2, __str._M_data(), __str.size()); }
+
+      /**
+       *  @brief  Replace range of characters with C substring.
+       *  @param i1  Iterator referencing start of range to replace.
+       *  @param i2  Iterator referencing end of range to replace.
+       *  @param s  C string value to insert.
+       *  @param n  Number of characters from s to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [i1,i2).  In place, the first @a
+       *  n characters of @a s are inserted.  If the length of result exceeds
+       *  max_size(), length_error is thrown.  The value of the string doesn't
+       *  change if an error is thrown.
+      */
+      basic_string&
+      replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				 && __i2 <= _M_iend());
+	return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
+      }
+
+      /**
+       *  @brief  Replace range of characters with C string.
+       *  @param i1  Iterator referencing start of range to replace.
+       *  @param i2  Iterator referencing end of range to replace.
+       *  @param s  C string value to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [i1,i2).  In place, the
+       *  characters of @a s are inserted.  If the length of result exceeds
+       *  max_size(), length_error is thrown.  The value of the string doesn't
+       *  change if an error is thrown.
+      */
+      basic_string&
+      replace(iterator __i1, iterator __i2, const _CharT* __s)
+      {
+	__glibcxx_requires_string(__s);
+	return this->replace(__i1, __i2, __s, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Replace range of characters with multiple characters
+       *  @param i1  Iterator referencing start of range to replace.
+       *  @param i2  Iterator referencing end of range to replace.
+       *  @param n  Number of characters to insert.
+       *  @param c  Character to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [i1,i2).  In place, @a n copies
+       *  of @a c are inserted.  If the length of result exceeds max_size(),
+       *  length_error is thrown.  The value of the string doesn't change if
+       *  an error is thrown.
+      */
+      basic_string&
+      replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				 && __i2 <= _M_iend());
+	return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
+      }
+
+      /**
+       *  @brief  Replace range of characters with range.
+       *  @param i1  Iterator referencing start of range to replace.
+       *  @param i2  Iterator referencing end of range to replace.
+       *  @param k1  Iterator referencing start of range to insert.
+       *  @param k2  Iterator referencing end of range to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [i1,i2).  In place, characters
+       *  in the range [k1,k2) are inserted.  If the length of result exceeds
+       *  max_size(), length_error is thrown.  The value of the string doesn't
+       *  change if an error is thrown.
+      */
+      template<class _InputIterator>
+        basic_string&
+        replace(iterator __i1, iterator __i2,
+		_InputIterator __k1, _InputIterator __k2)
+        {
+	  _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				   && __i2 <= _M_iend());
+	  __glibcxx_requires_valid_range(__k1, __k2);
+	  typedef typename std::__is_integer<_InputIterator>::__type _Integral;
+	  return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
+	}
+
+      // Specializations for the common case of pointer and iterator:
+      // useful to avoid the overhead of temporary buffering in _M_replace.
+      basic_string&
+      replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				 && __i2 <= _M_iend());
+	__glibcxx_requires_valid_range(__k1, __k2);
+	return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
+			     __k1, __k2 - __k1);
+      }
+
+      basic_string&
+      replace(iterator __i1, iterator __i2,
+	      const _CharT* __k1, const _CharT* __k2)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				 && __i2 <= _M_iend());
+	__glibcxx_requires_valid_range(__k1, __k2);
+	return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
+			     __k1, __k2 - __k1);
+      }
+
+      basic_string&
+      replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				 && __i2 <= _M_iend());
+	__glibcxx_requires_valid_range(__k1, __k2);
+	return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
+			     __k1.base(), __k2 - __k1);
+      }
+
+      basic_string&
+      replace(iterator __i1, iterator __i2,
+	      const_iterator __k1, const_iterator __k2)
+      {
+	_GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
+				 && __i2 <= _M_iend());
+	__glibcxx_requires_valid_range(__k1, __k2);
+	return this->replace(__i1 - _M_ibegin(), __i2 - __i1,
+			     __k1.base(), __k2 - __k1);
+      }
+      
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  Replace range of characters with initializer_list.
+       *  @param i1  Iterator referencing start of range to replace.
+       *  @param i2  Iterator referencing end of range to replace.
+       *  @param l  The initializer_list of characters to insert.
+       *  @return  Reference to this string.
+       *  @throw  std::length_error  If new length exceeds @c max_size().
+       *
+       *  Removes the characters in the range [i1,i2).  In place, characters
+       *  in the range [k1,k2) are inserted.  If the length of result exceeds
+       *  max_size(), length_error is thrown.  The value of the string doesn't
+       *  change if an error is thrown.
+      */
+      basic_string& replace(iterator __i1, iterator __i2,
+			    initializer_list<_CharT> __l)
+      { return this->replace(__i1, __i2, __l.begin(), __l.end()); }
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
+    private:
+      template<class _Integer>
+	basic_string&
+	_M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
+			    _Integer __val, __true_type)
+        { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
+
+      template<class _InputIterator>
+	basic_string&
+	_M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
+			    _InputIterator __k2, __false_type);
+
+      basic_string&
+      _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
+		     _CharT __c);
+
+      basic_string&
+      _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,
+		      size_type __n2);
+
+      // _S_construct_aux is used to implement the 21.3.1 para 15 which
+      // requires special behaviour if _InIter is an integral type
+      template<class _InIterator>
+        static _CharT*
+        _S_construct_aux(_InIterator __beg, _InIterator __end,
+			 const _Alloc& __a, __false_type)
+	{
+          typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
+          return _S_construct(__beg, __end, __a, _Tag());
+	}
+
+      // _GLIBCXX_RESOLVE_LIB_DEFECTS
+      // 438. Ambiguity in the "do the right thing" clause
+      template<class _Integer>
+        static _CharT*
+        _S_construct_aux(_Integer __beg, _Integer __end,
+			 const _Alloc& __a, __true_type)
+        { return _S_construct_aux_2(static_cast<size_type>(__beg),
+				    __end, __a); }
+
+      static _CharT*
+      _S_construct_aux_2(size_type __req, _CharT __c, const _Alloc& __a)
+      { return _S_construct(__req, __c, __a); }
+
+      template<class _InIterator>
+        static _CharT*
+        _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)
+	{
+	  typedef typename std::__is_integer<_InIterator>::__type _Integral;
+	  return _S_construct_aux(__beg, __end, __a, _Integral());
+        }
+
+      // For Input Iterators, used in istreambuf_iterators, etc.
+      template<class _InIterator>
+        static _CharT*
+         _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,
+		      input_iterator_tag);
+
+      // For forward_iterators up to random_access_iterators, used for
+      // string::iterator, _CharT*, etc.
+      template<class _FwdIterator>
+        static _CharT*
+        _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a,
+		     forward_iterator_tag);
+
+      static _CharT*
+      _S_construct(size_type __req, _CharT __c, const _Alloc& __a);
+
+    public:
+
+      /**
+       *  @brief  Copy substring into C string.
+       *  @param s  C string to copy value into.
+       *  @param n  Number of characters to copy.
+       *  @param pos  Index of first character to copy.
+       *  @return  Number of characters actually copied
+       *  @throw  std::out_of_range  If pos > size().
+       *
+       *  Copies up to @a n characters starting at @a pos into the C string @a
+       *  s.  If @a pos is %greater than size(), out_of_range is thrown.
+      */
+      size_type
+      copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
+
+      /**
+       *  @brief  Swap contents with another string.
+       *  @param s  String to swap with.
+       *
+       *  Exchanges the contents of this string with that of @a s in constant
+       *  time.
+      */
+      void
+      swap(basic_string& __s);
+
+      // String operations:
+      /**
+       *  @brief  Return const pointer to null-terminated contents.
+       *
+       *  This is a handle to internal data.  Do not modify or dire things may
+       *  happen.
+      */
+      const _CharT*
+      c_str() const
+      { return _M_data(); }
+
+      /**
+       *  @brief  Return const pointer to contents.
+       *
+       *  This is a handle to internal data.  Do not modify or dire things may
+       *  happen.
+      */
+      const _CharT*
+      data() const
+      { return _M_data(); }
+
+      /**
+       *  @brief  Return copy of allocator used to construct this string.
+      */
+      allocator_type
+      get_allocator() const
+      { return _M_dataplus; }
+
+      /**
+       *  @brief  Find position of a C substring.
+       *  @param s  C string to locate.
+       *  @param pos  Index of character to search from.
+       *  @param n  Number of characters from @a s to search for.
+       *  @return  Index of start of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for the first @a n characters
+       *  in @a s within this string.  If found, returns the index where it
+       *  begins.  If not found, returns npos.
+      */
+      size_type
+      find(const _CharT* __s, size_type __pos, size_type __n) const;
+
+      /**
+       *  @brief  Find position of a string.
+       *  @param str  String to locate.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of start of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for value of @a str within
+       *  this string.  If found, returns the index where it begins.  If not
+       *  found, returns npos.
+      */
+      size_type
+      find(const basic_string& __str, size_type __pos = 0) const
+      { return this->find(__str.data(), __pos, __str.size()); }
+
+      /**
+       *  @brief  Find position of a C string.
+       *  @param s  C string to locate.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of start of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for the value of @a s within
+       *  this string.  If found, returns the index where it begins.  If not
+       *  found, returns npos.
+      */
+      size_type
+      find(const _CharT* __s, size_type __pos = 0) const
+      {
+	__glibcxx_requires_string(__s);
+	return this->find(__s, __pos, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Find position of a character.
+       *  @param c  Character to locate.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for @a c within this string.
+       *  If found, returns the index where it was found.  If not found,
+       *  returns npos.
+      */
+      size_type
+      find(_CharT __c, size_type __pos = 0) const;
+
+      /**
+       *  @brief  Find last position of a string.
+       *  @param str  String to locate.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of start of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for value of @a str within
+       *  this string.  If found, returns the index where it begins.  If not
+       *  found, returns npos.
+      */
+      size_type
+      rfind(const basic_string& __str, size_type __pos = npos) const
+      { return this->rfind(__str.data(), __pos, __str.size()); }
+
+      /**
+       *  @brief  Find last position of a C substring.
+       *  @param s  C string to locate.
+       *  @param pos  Index of character to search back from.
+       *  @param n  Number of characters from s to search for.
+       *  @return  Index of start of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for the first @a n
+       *  characters in @a s within this string.  If found, returns the index
+       *  where it begins.  If not found, returns npos.
+      */
+      size_type
+      rfind(const _CharT* __s, size_type __pos, size_type __n) const;
+
+      /**
+       *  @brief  Find last position of a C string.
+       *  @param s  C string to locate.
+       *  @param pos  Index of character to start search at (default end).
+       *  @return  Index of start of  last occurrence.
+       *
+       *  Starting from @a pos, searches backward for the value of @a s within
+       *  this string.  If found, returns the index where it begins.  If not
+       *  found, returns npos.
+      */
+      size_type
+      rfind(const _CharT* __s, size_type __pos = npos) const
+      {
+	__glibcxx_requires_string(__s);
+	return this->rfind(__s, __pos, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Find last position of a character.
+       *  @param c  Character to locate.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for @a c within this string.
+       *  If found, returns the index where it was found.  If not found,
+       *  returns npos.
+      */
+      size_type
+      rfind(_CharT __c, size_type __pos = npos) const;
+
+      /**
+       *  @brief  Find position of a character of string.
+       *  @param str  String containing characters to locate.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for one of the characters of
+       *  @a str within this string.  If found, returns the index where it was
+       *  found.  If not found, returns npos.
+      */
+      size_type
+      find_first_of(const basic_string& __str, size_type __pos = 0) const
+      { return this->find_first_of(__str.data(), __pos, __str.size()); }
+
+      /**
+       *  @brief  Find position of a character of C substring.
+       *  @param s  String containing characters to locate.
+       *  @param pos  Index of character to search from.
+       *  @param n  Number of characters from s to search for.
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for one of the first @a n
+       *  characters of @a s within this string.  If found, returns the index
+       *  where it was found.  If not found, returns npos.
+      */
+      size_type
+      find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
+
+      /**
+       *  @brief  Find position of a character of C string.
+       *  @param s  String containing characters to locate.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for one of the characters of
+       *  @a s within this string.  If found, returns the index where it was
+       *  found.  If not found, returns npos.
+      */
+      size_type
+      find_first_of(const _CharT* __s, size_type __pos = 0) const
+      {
+	__glibcxx_requires_string(__s);
+	return this->find_first_of(__s, __pos, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Find position of a character.
+       *  @param c  Character to locate.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for the character @a c within
+       *  this string.  If found, returns the index where it was found.  If
+       *  not found, returns npos.
+       *
+       *  Note: equivalent to find(c, pos).
+      */
+      size_type
+      find_first_of(_CharT __c, size_type __pos = 0) const
+      { return this->find(__c, __pos); }
+
+      /**
+       *  @brief  Find last position of a character of string.
+       *  @param str  String containing characters to locate.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for one of the characters of
+       *  @a str within this string.  If found, returns the index where it was
+       *  found.  If not found, returns npos.
+      */
+      size_type
+      find_last_of(const basic_string& __str, size_type __pos = npos) const
+      { return this->find_last_of(__str.data(), __pos, __str.size()); }
+
+      /**
+       *  @brief  Find last position of a character of C substring.
+       *  @param s  C string containing characters to locate.
+       *  @param pos  Index of character to search back from.
+       *  @param n  Number of characters from s to search for.
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for one of the first @a n
+       *  characters of @a s within this string.  If found, returns the index
+       *  where it was found.  If not found, returns npos.
+      */
+      size_type
+      find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
+
+      /**
+       *  @brief  Find last position of a character of C string.
+       *  @param s  C string containing characters to locate.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for one of the characters of
+       *  @a s within this string.  If found, returns the index where it was
+       *  found.  If not found, returns npos.
+      */
+      size_type
+      find_last_of(const _CharT* __s, size_type __pos = npos) const
+      {
+	__glibcxx_requires_string(__s);
+	return this->find_last_of(__s, __pos, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Find last position of a character.
+       *  @param c  Character to locate.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for @a c within this string.
+       *  If found, returns the index where it was found.  If not found,
+       *  returns npos.
+       *
+       *  Note: equivalent to rfind(c, pos).
+      */
+      size_type
+      find_last_of(_CharT __c, size_type __pos = npos) const
+      { return this->rfind(__c, __pos); }
+
+      /**
+       *  @brief  Find position of a character not in string.
+       *  @param str  String containing characters to avoid.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for a character not contained
+       *  in @a str within this string.  If found, returns the index where it
+       *  was found.  If not found, returns npos.
+      */
+      size_type
+      find_first_not_of(const basic_string& __str, size_type __pos = 0) const
+      { return this->find_first_not_of(__str.data(), __pos, __str.size()); }
+
+      /**
+       *  @brief  Find position of a character not in C substring.
+       *  @param s  C string containing characters to avoid.
+       *  @param pos  Index of character to search from.
+       *  @param n  Number of characters from s to consider.
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for a character not contained
+       *  in the first @a n characters of @a s within this string.  If found,
+       *  returns the index where it was found.  If not found, returns npos.
+      */
+      size_type
+      find_first_not_of(const _CharT* __s, size_type __pos,
+			size_type __n) const;
+
+      /**
+       *  @brief  Find position of a character not in C string.
+       *  @param s  C string containing characters to avoid.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for a character not contained
+       *  in @a s within this string.  If found, returns the index where it
+       *  was found.  If not found, returns npos.
+      */
+      size_type
+      find_first_not_of(const _CharT* __s, size_type __pos = 0) const
+      {
+	__glibcxx_requires_string(__s);
+	return this->find_first_not_of(__s, __pos, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Find position of a different character.
+       *  @param c  Character to avoid.
+       *  @param pos  Index of character to search from (default 0).
+       *  @return  Index of first occurrence.
+       *
+       *  Starting from @a pos, searches forward for a character other than @a c
+       *  within this string.  If found, returns the index where it was found.
+       *  If not found, returns npos.
+      */
+      size_type
+      find_first_not_of(_CharT __c, size_type __pos = 0) const;
+
+      /**
+       *  @brief  Find last position of a character not in string.
+       *  @param str  String containing characters to avoid.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for a character not
+       *  contained in @a str within this string.  If found, returns the index
+       *  where it was found.  If not found, returns npos.
+      */
+      size_type
+      find_last_not_of(const basic_string& __str, size_type __pos = npos) const
+      { return this->find_last_not_of(__str.data(), __pos, __str.size()); }
+
+      /**
+       *  @brief  Find last position of a character not in C substring.
+       *  @param s  C string containing characters to avoid.
+       *  @param pos  Index of character to search back from.
+       *  @param n  Number of characters from s to consider.
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for a character not
+       *  contained in the first @a n characters of @a s within this string.
+       *  If found, returns the index where it was found.  If not found,
+       *  returns npos.
+      */
+      size_type
+      find_last_not_of(const _CharT* __s, size_type __pos,
+		       size_type __n) const;
+      /**
+       *  @brief  Find last position of a character not in C string.
+       *  @param s  C string containing characters to avoid.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for a character not
+       *  contained in @a s within this string.  If found, returns the index
+       *  where it was found.  If not found, returns npos.
+      */
+      size_type
+      find_last_not_of(const _CharT* __s, size_type __pos = npos) const
+      {
+	__glibcxx_requires_string(__s);
+	return this->find_last_not_of(__s, __pos, traits_type::length(__s));
+      }
+
+      /**
+       *  @brief  Find last position of a different character.
+       *  @param c  Character to avoid.
+       *  @param pos  Index of character to search back from (default end).
+       *  @return  Index of last occurrence.
+       *
+       *  Starting from @a pos, searches backward for a character other than
+       *  @a c within this string.  If found, returns the index where it was
+       *  found.  If not found, returns npos.
+      */
+      size_type
+      find_last_not_of(_CharT __c, size_type __pos = npos) const;
+
+      /**
+       *  @brief  Get a substring.
+       *  @param pos  Index of first character (default 0).
+       *  @param n  Number of characters in substring (default remainder).
+       *  @return  The new string.
+       *  @throw  std::out_of_range  If pos > size().
+       *
+       *  Construct and return a new string using the @a n characters starting
+       *  at @a pos.  If the string is too short, use the remainder of the
+       *  characters.  If @a pos is beyond the end of the string, out_of_range
+       *  is thrown.
+      */
+      basic_string
+      substr(size_type __pos = 0, size_type __n = npos) const
+      { return basic_string(*this,
+			    _M_check(__pos, "basic_string::substr"), __n); }
+
+      /**
+       *  @brief  Compare to a string.
+       *  @param str  String to compare against.
+       *  @return  Integer < 0, 0, or > 0.
+       *
+       *  Returns an integer < 0 if this string is ordered before @a str, 0 if
+       *  their values are equivalent, or > 0 if this string is ordered after
+       *  @a str.  Determines the effective length rlen of the strings to
+       *  compare as the smallest of size() and str.size().  The function
+       *  then compares the two strings by calling traits::compare(data(),
+       *  str.data(),rlen).  If the result of the comparison is nonzero returns
+       *  it, otherwise the shorter one is ordered first.
+      */
+      int
+      compare(const basic_string& __str) const
+      {
+	const size_type __size = this->size();
+	const size_type __osize = __str.size();
+	const size_type __len = std::min(__size, __osize);
+
+	int __r = traits_type::compare(_M_data(), __str.data(), __len);
+	if (!__r)
+	  __r = _S_compare(__size, __osize);
+	return __r;
+      }
+
+      /**
+       *  @brief  Compare substring to a string.
+       *  @param pos  Index of first character of substring.
+       *  @param n  Number of characters in substring.
+       *  @param str  String to compare against.
+       *  @return  Integer < 0, 0, or > 0.
+       *
+       *  Form the substring of this string from the @a n characters starting
+       *  at @a pos.  Returns an integer < 0 if the substring is ordered
+       *  before @a str, 0 if their values are equivalent, or > 0 if the
+       *  substring is ordered after @a str.  Determines the effective length
+       *  rlen of the strings to compare as the smallest of the length of the
+       *  substring and @a str.size().  The function then compares the two
+       *  strings by calling traits::compare(substring.data(),str.data(),rlen).
+       *  If the result of the comparison is nonzero returns it, otherwise the
+       *  shorter one is ordered first.
+      */
+      int
+      compare(size_type __pos, size_type __n, const basic_string& __str) const;
+
+      /**
+       *  @brief  Compare substring to a substring.
+       *  @param pos1  Index of first character of substring.
+       *  @param n1  Number of characters in substring.
+       *  @param str  String to compare against.
+       *  @param pos2  Index of first character of substring of str.
+       *  @param n2  Number of characters in substring of str.
+       *  @return  Integer < 0, 0, or > 0.
+       *
+       *  Form the substring of this string from the @a n1 characters starting
+       *  at @a pos1.  Form the substring of @a str from the @a n2 characters
+       *  starting at @a pos2.  Returns an integer < 0 if this substring is
+       *  ordered before the substring of @a str, 0 if their values are
+       *  equivalent, or > 0 if this substring is ordered after the substring
+       *  of @a str.  Determines the effective length rlen of the strings
+       *  to compare as the smallest of the lengths of the substrings.  The
+       *  function then compares the two strings by calling
+       *  traits::compare(substring.data(),str.substr(pos2,n2).data(),rlen).
+       *  If the result of the comparison is nonzero returns it, otherwise the
+       *  shorter one is ordered first.
+      */
+      int
+      compare(size_type __pos1, size_type __n1, const basic_string& __str,
+	      size_type __pos2, size_type __n2) const;
+
+      /**
+       *  @brief  Compare to a C string.
+       *  @param s  C string to compare against.
+       *  @return  Integer < 0, 0, or > 0.
+       *
+       *  Returns an integer < 0 if this string is ordered before @a s, 0 if
+       *  their values are equivalent, or > 0 if this string is ordered after
+       *  @a s.  Determines the effective length rlen of the strings to
+       *  compare as the smallest of size() and the length of a string
+       *  constructed from @a s.  The function then compares the two strings
+       *  by calling traits::compare(data(),s,rlen).  If the result of the
+       *  comparison is nonzero returns it, otherwise the shorter one is
+       *  ordered first.
+      */
+      int
+      compare(const _CharT* __s) const;
+
+      // _GLIBCXX_RESOLVE_LIB_DEFECTS
+      // 5 String::compare specification questionable
+      /**
+       *  @brief  Compare substring to a C string.
+       *  @param pos  Index of first character of substring.
+       *  @param n1  Number of characters in substring.
+       *  @param s  C string to compare against.
+       *  @return  Integer < 0, 0, or > 0.
+       *
+       *  Form the substring of this string from the @a n1 characters starting
+       *  at @a pos.  Returns an integer < 0 if the substring is ordered
+       *  before @a s, 0 if their values are equivalent, or > 0 if the
+       *  substring is ordered after @a s.  Determines the effective length
+       *  rlen of the strings to compare as the smallest of the length of the 
+       *  substring and the length of a string constructed from @a s.  The
+       *  function then compares the two string by calling
+       *  traits::compare(substring.data(),s,rlen).  If the result of the
+       *  comparison is nonzero returns it, otherwise the shorter one is
+       *  ordered first.
+      */
+      int
+      compare(size_type __pos, size_type __n1, const _CharT* __s) const;
+
+      /**
+       *  @brief  Compare substring against a character %array.
+       *  @param pos1  Index of first character of substring.
+       *  @param n1  Number of characters in substring.
+       *  @param s  character %array to compare against.
+       *  @param n2  Number of characters of s.
+       *  @return  Integer < 0, 0, or > 0.
+       *
+       *  Form the substring of this string from the @a n1 characters starting
+       *  at @a pos1.  Form a string from the first @a n2 characters of @a s.
+       *  Returns an integer < 0 if this substring is ordered before the string
+       *  from @a s, 0 if their values are equivalent, or > 0 if this substring
+       *  is ordered after the string from @a s.   Determines the effective
+       *  length rlen of the strings to compare as the smallest of the length
+       *  of the substring and @a n2.  The function then compares the two
+       *  strings by calling traits::compare(substring.data(),s,rlen).  If the
+       *  result of the comparison is nonzero returns it, otherwise the shorter
+       *  one is ordered first.
+       *
+       *  NB: s must have at least n2 characters, &apos;\\0&apos; has
+       *  no special meaning.
+      */
+      int
+      compare(size_type __pos, size_type __n1, const _CharT* __s,
+	      size_type __n2) const;
+  };
+
+  // operator+
+  /**
+   *  @brief  Concatenate two strings.
+   *  @param lhs  First string.
+   *  @param rhs  Last string.
+   *  @return  New string with value of @a lhs followed by @a rhs.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    basic_string<_CharT, _Traits, _Alloc>
+    operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    {
+      basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
+      __str.append(__rhs);
+      return __str;
+    }
+
+  /**
+   *  @brief  Concatenate C string and string.
+   *  @param lhs  First string.
+   *  @param rhs  Last string.
+   *  @return  New string with value of @a lhs followed by @a rhs.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    basic_string<_CharT,_Traits,_Alloc>
+    operator+(const _CharT* __lhs,
+	      const basic_string<_CharT,_Traits,_Alloc>& __rhs);
+
+  /**
+   *  @brief  Concatenate character and string.
+   *  @param lhs  First string.
+   *  @param rhs  Last string.
+   *  @return  New string with @a lhs followed by @a rhs.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    basic_string<_CharT,_Traits,_Alloc>
+    operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs);
+
+  /**
+   *  @brief  Concatenate string and C string.
+   *  @param lhs  First string.
+   *  @param rhs  Last string.
+   *  @return  New string with @a lhs followed by @a rhs.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline basic_string<_CharT, _Traits, _Alloc>
+    operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	     const _CharT* __rhs)
+    {
+      basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
+      __str.append(__rhs);
+      return __str;
+    }
+
+  /**
+   *  @brief  Concatenate string and character.
+   *  @param lhs  First string.
+   *  @param rhs  Last string.
+   *  @return  New string with @a lhs followed by @a rhs.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline basic_string<_CharT, _Traits, _Alloc>
+    operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)
+    {
+      typedef basic_string<_CharT, _Traits, _Alloc>	__string_type;
+      typedef typename __string_type::size_type		__size_type;
+      __string_type __str(__lhs);
+      __str.append(__size_type(1), __rhs);
+      return __str;
+    }
+
+  // operator ==
+  /**
+   *  @brief  Test equivalence of two strings.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *  @return  True if @a lhs.compare(@a rhs) == 0.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __lhs.compare(__rhs) == 0; }
+
+  template<typename _CharT>
+    inline
+    typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type
+    operator==(const basic_string<_CharT>& __lhs,
+	       const basic_string<_CharT>& __rhs)
+    { return (__lhs.size() == __rhs.size()
+	      && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(),
+						    __lhs.size())); }
+
+  /**
+   *  @brief  Test equivalence of C string and string.
+   *  @param lhs  C string.
+   *  @param rhs  String.
+   *  @return  True if @a rhs.compare(@a lhs) == 0.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator==(const _CharT* __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __rhs.compare(__lhs) == 0; }
+
+  /**
+   *  @brief  Test equivalence of string and C string.
+   *  @param lhs  String.
+   *  @param rhs  C string.
+   *  @return  True if @a lhs.compare(@a rhs) == 0.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const _CharT* __rhs)
+    { return __lhs.compare(__rhs) == 0; }
+
+  // operator !=
+  /**
+   *  @brief  Test difference of two strings.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *  @return  True if @a lhs.compare(@a rhs) != 0.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return !(__lhs == __rhs); }
+
+  /**
+   *  @brief  Test difference of C string and string.
+   *  @param lhs  C string.
+   *  @param rhs  String.
+   *  @return  True if @a rhs.compare(@a lhs) != 0.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator!=(const _CharT* __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return !(__lhs == __rhs); }
+
+  /**
+   *  @brief  Test difference of string and C string.
+   *  @param lhs  String.
+   *  @param rhs  C string.
+   *  @return  True if @a lhs.compare(@a rhs) != 0.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const _CharT* __rhs)
+    { return !(__lhs == __rhs); }
+
+  // operator <
+  /**
+   *  @brief  Test if string precedes string.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *  @return  True if @a lhs precedes @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __lhs.compare(__rhs) < 0; }
+
+  /**
+   *  @brief  Test if string precedes C string.
+   *  @param lhs  String.
+   *  @param rhs  C string.
+   *  @return  True if @a lhs precedes @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	      const _CharT* __rhs)
+    { return __lhs.compare(__rhs) < 0; }
+
+  /**
+   *  @brief  Test if C string precedes string.
+   *  @param lhs  C string.
+   *  @param rhs  String.
+   *  @return  True if @a lhs precedes @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator<(const _CharT* __lhs,
+	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __rhs.compare(__lhs) > 0; }
+
+  // operator >
+  /**
+   *  @brief  Test if string follows string.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *  @return  True if @a lhs follows @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __lhs.compare(__rhs) > 0; }
+
+  /**
+   *  @brief  Test if string follows C string.
+   *  @param lhs  String.
+   *  @param rhs  C string.
+   *  @return  True if @a lhs follows @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	      const _CharT* __rhs)
+    { return __lhs.compare(__rhs) > 0; }
+
+  /**
+   *  @brief  Test if C string follows string.
+   *  @param lhs  C string.
+   *  @param rhs  String.
+   *  @return  True if @a lhs follows @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator>(const _CharT* __lhs,
+	      const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __rhs.compare(__lhs) < 0; }
+
+  // operator <=
+  /**
+   *  @brief  Test if string doesn't follow string.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *  @return  True if @a lhs doesn't follow @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __lhs.compare(__rhs) <= 0; }
+
+  /**
+   *  @brief  Test if string doesn't follow C string.
+   *  @param lhs  String.
+   *  @param rhs  C string.
+   *  @return  True if @a lhs doesn't follow @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const _CharT* __rhs)
+    { return __lhs.compare(__rhs) <= 0; }
+
+  /**
+   *  @brief  Test if C string doesn't follow string.
+   *  @param lhs  C string.
+   *  @param rhs  String.
+   *  @return  True if @a lhs doesn't follow @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator<=(const _CharT* __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __rhs.compare(__lhs) >= 0; }
+
+  // operator >=
+  /**
+   *  @brief  Test if string doesn't precede string.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *  @return  True if @a lhs doesn't precede @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __lhs.compare(__rhs) >= 0; }
+
+  /**
+   *  @brief  Test if string doesn't precede C string.
+   *  @param lhs  String.
+   *  @param rhs  C string.
+   *  @return  True if @a lhs doesn't precede @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	       const _CharT* __rhs)
+    { return __lhs.compare(__rhs) >= 0; }
+
+  /**
+   *  @brief  Test if C string doesn't precede string.
+   *  @param lhs  C string.
+   *  @param rhs  String.
+   *  @return  True if @a lhs doesn't precede @a rhs.  False otherwise.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline bool
+    operator>=(const _CharT* __lhs,
+	     const basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { return __rhs.compare(__lhs) <= 0; }
+
+  /**
+   *  @brief  Swap contents of two strings.
+   *  @param lhs  First string.
+   *  @param rhs  Second string.
+   *
+   *  Exchanges the contents of @a lhs and @a rhs in constant time.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline void
+    swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,
+	 basic_string<_CharT, _Traits, _Alloc>& __rhs)
+    { __lhs.swap(__rhs); }
+
+  /**
+   *  @brief  Read stream into a string.
+   *  @param is  Input stream.
+   *  @param str  Buffer to store into.
+   *  @return  Reference to the input stream.
+   *
+   *  Stores characters from @a is into @a str until whitespace is found, the
+   *  end of the stream is encountered, or str.max_size() is reached.  If
+   *  is.width() is non-zero, that is the limit on the number of characters
+   *  stored into @a str.  Any previous contents of @a str are erased.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    basic_istream<_CharT, _Traits>&
+    operator>>(basic_istream<_CharT, _Traits>& __is,
+	       basic_string<_CharT, _Traits, _Alloc>& __str);
+
+  template<>
+    basic_istream<char>&
+    operator>>(basic_istream<char>& __is, basic_string<char>& __str);
+
+  /**
+   *  @brief  Write string to a stream.
+   *  @param os  Output stream.
+   *  @param str  String to write out.
+   *  @return  Reference to the output stream.
+   *
+   *  Output characters of @a str into os following the same rules as for
+   *  writing a C string.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline basic_ostream<_CharT, _Traits>&
+    operator<<(basic_ostream<_CharT, _Traits>& __os,
+	       const basic_string<_CharT, _Traits, _Alloc>& __str)
+    {
+      // _GLIBCXX_RESOLVE_LIB_DEFECTS
+      // 586. string inserter not a formatted function
+      return __ostream_insert(__os, __str.data(), __str.size());
+    }
+
+  /**
+   *  @brief  Read a line from stream into a string.
+   *  @param is  Input stream.
+   *  @param str  Buffer to store into.
+   *  @param delim  Character marking end of line.
+   *  @return  Reference to the input stream.
+   *
+   *  Stores characters from @a is into @a str until @a delim is found, the
+   *  end of the stream is encountered, or str.max_size() is reached.  If
+   *  is.width() is non-zero, that is the limit on the number of characters
+   *  stored into @a str.  Any previous contents of @a str are erased.  If @a
+   *  delim was encountered, it is extracted but not stored into @a str.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    basic_istream<_CharT, _Traits>&
+    getline(basic_istream<_CharT, _Traits>& __is,
+	    basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim);
+
+  /**
+   *  @brief  Read a line from stream into a string.
+   *  @param is  Input stream.
+   *  @param str  Buffer to store into.
+   *  @return  Reference to the input stream.
+   *
+   *  Stores characters from is into @a str until &apos;\n&apos; is
+   *  found, the end of the stream is encountered, or str.max_size()
+   *  is reached.  If is.width() is non-zero, that is the limit on the
+   *  number of characters stored into @a str.  Any previous contents
+   *  of @a str are erased.  If end of line was encountered, it is
+   *  extracted but not stored into @a str.
+   */
+  template<typename _CharT, typename _Traits, typename _Alloc>
+    inline basic_istream<_CharT, _Traits>&
+    getline(basic_istream<_CharT, _Traits>& __is,
+	    basic_string<_CharT, _Traits, _Alloc>& __str)
+    { return getline(__is, __str, __is.widen('\n')); }
+
+  template<>
+    basic_istream<char>&
+    getline(basic_istream<char>& __in, basic_string<char>& __str,
+	    char __delim);
+
+#ifdef _GLIBCXX_USE_WCHAR_T
+  template<>
+    basic_istream<wchar_t>&
+    getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str,
+	    wchar_t __delim);
+#endif  
+
+_GLIBCXX_END_NAMESPACE
+
+#if (defined(__GXX_EXPERIMENTAL_CXX0X__) && defined(_GLIBCXX_USE_C99) \
+     && !defined(_GLIBCXX_HAVE_BROKEN_VSWPRINTF))
+
+#include <ext/string_conversions.h>
+
+_GLIBCXX_BEGIN_NAMESPACE(std)
+
+  // 21.4 Numeric Conversions [string.conversions].
+  inline int
+  stoi(const string& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa<long, int>(&std::strtol, "stoi", __str.c_str(),
+					__idx, __base); }
+
+  inline long
+  stol(const string& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::strtol, "stol", __str.c_str(),
+			     __idx, __base); }
+
+  inline unsigned long
+  stoul(const string& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::strtoul, "stoul", __str.c_str(),
+			     __idx, __base); }
+
+  inline long long
+  stoll(const string& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::strtoll, "stoll", __str.c_str(),
+			     __idx, __base); }
+
+  inline unsigned long long
+  stoull(const string& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::strtoull, "stoull", __str.c_str(),
+			     __idx, __base); }
+
+  // NB: strtof vs strtod.
+  inline float
+  stof(const string& __str, size_t* __idx = 0)
+  { return __gnu_cxx::__stoa(&std::strtof, "stof", __str.c_str(), __idx); }
+
+  inline double
+  stod(const string& __str, size_t* __idx = 0)
+  { return __gnu_cxx::__stoa(&std::strtod, "stod", __str.c_str(), __idx); }
+
+  inline long double
+  stold(const string& __str, size_t* __idx = 0)
+  { return __gnu_cxx::__stoa(&std::strtold, "stold", __str.c_str(), __idx); }
+
+  // NB: (v)snprintf vs sprintf.
+
+  // DR 1261.
+  inline string
+  to_string(int __val)
+  { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, 4 * sizeof(int),
+					   "%d", __val); }
+
+  inline string
+  to_string(unsigned __val)
+  { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
+					   4 * sizeof(unsigned),
+					   "%u", __val); }
+
+  inline string
+  to_string(long __val)
+  { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, 4 * sizeof(long),
+					   "%ld", __val); }
+
+  inline string
+  to_string(unsigned long __val)
+  { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
+					   4 * sizeof(unsigned long),
+					   "%lu", __val); }
+
+  inline string
+  to_string(long long __val)
+  { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
+					   4 * sizeof(long long),
+					   "%lld", __val); }
+
+  inline string
+  to_string(unsigned long long __val)
+  { return __gnu_cxx::__to_xstring<string>(&std::vsnprintf,
+					   4 * sizeof(unsigned long long),
+					   "%llu", __val); }
+
+  inline string
+  to_string(float __val)
+  {
+    const int __n = 
+      __gnu_cxx::__numeric_traits<float>::__max_exponent10 + 20;
+    return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n,
+					   "%f", __val);
+  }
+
+  inline string
+  to_string(double __val)
+  {
+    const int __n = 
+      __gnu_cxx::__numeric_traits<double>::__max_exponent10 + 20;
+    return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n,
+					   "%f", __val);
+  }
+
+  inline string
+  to_string(long double __val)
+  {
+    const int __n = 
+      __gnu_cxx::__numeric_traits<long double>::__max_exponent10 + 20;
+    return __gnu_cxx::__to_xstring<string>(&std::vsnprintf, __n,
+					   "%Lf", __val);
+  }
+
+#ifdef _GLIBCXX_USE_WCHAR_T
+  inline int 
+  stoi(const wstring& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa<long, int>(&std::wcstol, "stoi", __str.c_str(),
+					__idx, __base); }
+
+  inline long 
+  stol(const wstring& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::wcstol, "stol", __str.c_str(),
+			     __idx, __base); }
+
+  inline unsigned long
+  stoul(const wstring& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::wcstoul, "stoul", __str.c_str(),
+			     __idx, __base); }
+
+  inline long long
+  stoll(const wstring& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::wcstoll, "stoll", __str.c_str(),
+			     __idx, __base); }
+
+  inline unsigned long long
+  stoull(const wstring& __str, size_t* __idx = 0, int __base = 10)
+  { return __gnu_cxx::__stoa(&std::wcstoull, "stoull", __str.c_str(),
+			     __idx, __base); }
+
+  // NB: wcstof vs wcstod.
+  inline float
+  stof(const wstring& __str, size_t* __idx = 0)
+  { return __gnu_cxx::__stoa(&std::wcstof, "stof", __str.c_str(), __idx); }
+
+  inline double
+  stod(const wstring& __str, size_t* __idx = 0)
+  { return __gnu_cxx::__stoa(&std::wcstod, "stod", __str.c_str(), __idx); }
+
+  inline long double
+  stold(const wstring& __str, size_t* __idx = 0)
+  { return __gnu_cxx::__stoa(&std::wcstold, "stold", __str.c_str(), __idx); }
+
+  // DR 1261.
+  inline wstring
+  to_wstring(int __val)
+  { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, 4 * sizeof(int),
+					    L"%d", __val); }
+
+  inline wstring
+  to_wstring(unsigned __val)
+  { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
+					    4 * sizeof(unsigned),
+					    L"%u", __val); }
+
+  inline wstring
+  to_wstring(long __val)
+  { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, 4 * sizeof(long),
+					    L"%ld", __val); }
+
+  inline wstring
+  to_wstring(unsigned long __val)
+  { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
+					    4 * sizeof(unsigned long),
+					    L"%lu", __val); }
+
+  inline wstring
+  to_wstring(long long __val)
+  { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
+					    4 * sizeof(long long),
+					    L"%lld", __val); }
+
+  inline wstring
+  to_wstring(unsigned long long __val)
+  { return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf,
+					    4 * sizeof(unsigned long long),
+					    L"%llu", __val); }
+
+  inline wstring
+  to_wstring(float __val)
+  {
+    const int __n =
+      __gnu_cxx::__numeric_traits<float>::__max_exponent10 + 20;
+    return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n,
+					    L"%f", __val);
+  }
+
+  inline wstring
+  to_wstring(double __val)
+  {
+    const int __n =
+      __gnu_cxx::__numeric_traits<double>::__max_exponent10 + 20;
+    return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n,
+					    L"%f", __val);
+  }
+
+  inline wstring
+  to_wstring(long double __val)
+  {
+    const int __n =
+      __gnu_cxx::__numeric_traits<long double>::__max_exponent10 + 20;
+    return __gnu_cxx::__to_xstring<wstring>(&std::vswprintf, __n,
+					    L"%Lf", __val);
+  }
+#endif
+
+_GLIBCXX_END_NAMESPACE
+
+#endif /* __GXX_EXPERIMENTAL_CXX0X__ && _GLIBCXX_USE_C99 ... */
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+
+#include <bits/functional_hash.h>
+
+_GLIBCXX_BEGIN_NAMESPACE(std)
+
+  // DR 1182.
+
+#ifndef _GLIBCXX_COMPATIBILITY_CXX0X
+  /// std::hash specialization for string.
+  template<>
+    struct hash<string>
+    : public std::unary_function<string, size_t>
+    {
+      size_t
+      operator()(const string& __s) const
+      { return std::_Fnv_hash::hash(__s.data(), __s.length()); }
+    };
+
+#ifdef _GLIBCXX_USE_WCHAR_T
+  /// std::hash specialization for wstring.
+  template<>
+    struct hash<wstring>
+    : public std::unary_function<wstring, size_t>
+    {
+      size_t
+      operator()(const wstring& __s) const
+      { return std::_Fnv_hash::hash(__s.data(),
+				    __s.length() * sizeof(wchar_t)); }
+    };
+#endif
+#endif /* _GLIBCXX_COMPATIBILITY_CXX0X */
+
+#ifdef _GLIBCXX_USE_C99_STDINT_TR1
+  /// std::hash specialization for u16string.
+  template<>
+    struct hash<u16string>
+    : public std::unary_function<u16string, size_t>
+    {
+      size_t
+      operator()(const u16string& __s) const
+      { return std::_Fnv_hash::hash(__s.data(),
+				    __s.length() * sizeof(char16_t)); }
+    };
+
+  /// std::hash specialization for u32string.
+  template<>
+    struct hash<u32string>
+    : public std::unary_function<u32string, size_t>
+    {
+      size_t
+      operator()(const u32string& __s) const
+      { return std::_Fnv_hash::hash(__s.data(),
+				    __s.length() * sizeof(char32_t)); }
+    };
+#endif
+
+_GLIBCXX_END_NAMESPACE
+
+#endif /* __GXX_EXPERIMENTAL_CXX0X__ */
+
+#endif /* _BASIC_STRING_H */
diff --git a/tests/file-tests/db/h/basic_string.h.source.txt b/tests/file-tests/db/h/basic_string.h.source.txt
new file mode 100644
index 0000000..ff58f41
--- /dev/null
+++ b/tests/file-tests/db/h/basic_string.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: libstdc++-devel: /usr/include/c++/4.8.2/bits/basic_string.h
+LICENSE: GPLv3+
diff --git a/tests/file-tests/db/h/gclosure.h b/tests/file-tests/db/h/gclosure.h
new file mode 100644
index 0000000..fc0cb47
--- /dev/null
+++ b/tests/file-tests/db/h/gclosure.h
@@ -0,0 +1,251 @@
+/* GObject - GLib Type, Object, Parameter and Signal Library
+ * Copyright (C) 2000-2001 Red Hat, Inc.
+ * Copyright (C) 2005 Imendio AB
+ *
+ * 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 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.
+ */
+#if !defined (__GLIB_GOBJECT_H_INSIDE__) && !defined (GOBJECT_COMPILATION)
+#error "Only <glib-object.h> can be included directly."
+#endif
+
+#ifndef __G_CLOSURE_H__
+#define __G_CLOSURE_H__
+
+#include        <gobject/gtype.h>
+
+G_BEGIN_DECLS
+
+/* --- defines --- */
+/**
+ * G_CLOSURE_NEEDS_MARSHAL:
+ * @closure: a #GClosure
+ * 
+ * Check if the closure still needs a marshaller. See g_closure_set_marshal().
+ *
+ * Returns: %TRUE if a #GClosureMarshal marshaller has not yet been set on 
+ * @closure.
+ */
+#define	G_CLOSURE_NEEDS_MARSHAL(closure) (((GClosure*) (closure))->marshal == NULL)
+/**
+ * G_CLOSURE_N_NOTIFIERS:
+ * @cl: a #GClosure
+ * 
+ * Get the total number of notifiers connected with the closure @cl. 
+ * The count includes the meta marshaller, the finalize and invalidate notifiers 
+ * and the marshal guards. Note that each guard counts as two notifiers. 
+ * See g_closure_set_meta_marshal(), g_closure_add_finalize_notifier(),
+ * g_closure_add_invalidate_notifier() and g_closure_add_marshal_guards().
+ *
+ * Returns: number of notifiers
+ */
+#define	G_CLOSURE_N_NOTIFIERS(cl)	 ((cl)->meta_marshal + ((cl)->n_guards << 1L) + \
+                                          (cl)->n_fnotifiers + (cl)->n_inotifiers)
+/**
+ * G_CCLOSURE_SWAP_DATA:
+ * @cclosure: a #GCClosure
+ * 
+ * Checks whether the user data of the #GCClosure should be passed as the
+ * first parameter to the callback. See g_cclosure_new_swap().
+ *
+ * Returns: %TRUE if data has to be swapped.
+ */
+#define	G_CCLOSURE_SWAP_DATA(cclosure)	 (((GClosure*) (cclosure))->derivative_flag)
+/**
+ * G_CALLBACK:
+ * @f: a function pointer.
+ * 
+ * Cast a function pointer to a #GCallback.
+ */
+#define	G_CALLBACK(f)			 ((GCallback) (f))
+
+
+/* -- typedefs --- */
+typedef struct _GClosure		 GClosure;
+typedef struct _GClosureNotifyData	 GClosureNotifyData;
+
+/**
+ * GCallback:
+ * 
+ * The type used for callback functions in structure definitions and function 
+ * signatures. This doesn't mean that all callback functions must take no 
+ * parameters and return void. The required signature of a callback function 
+ * is determined by the context in which is used (e.g. the signal to which it 
+ * is connected). Use G_CALLBACK() to cast the callback function to a #GCallback. 
+ */
+typedef void  (*GCallback)              (void);
+/**
+ * GClosureNotify:
+ * @data: data specified when registering the notification callback
+ * @closure: the #GClosure on which the notification is emitted
+ * 
+ * The type used for the various notification callbacks which can be registered
+ * on closures.
+ */
+typedef void  (*GClosureNotify)		(gpointer	 data,
+					 GClosure	*closure);
+/**
+ * GClosureMarshal:
+ * @closure: the #GClosure to which the marshaller belongs
+ * @return_value: a #GValue to store the return value. May be %NULL if the
+ *  callback of @closure doesn't return a value.
+ * @n_param_values: the length of the @param_values array
+ * @param_values: an array of #GValue<!-- -->s holding the arguments on
+ *  which to invoke the callback of @closure
+ * @invocation_hint: the invocation hint given as the last argument
+ *  to g_closure_invoke()
+ * @marshal_data: additional data specified when registering the marshaller,
+ *  see g_closure_set_marshal() and g_closure_set_meta_marshal()
+ * 
+ * The type used for marshaller functions.
+ */
+typedef void  (*GClosureMarshal)	(GClosure	*closure,
+					 GValue         *return_value,
+					 guint           n_param_values,
+					 const GValue   *param_values,
+					 gpointer        invocation_hint,
+					 gpointer	 marshal_data);
+/**
+ * GCClosure:
+ * @closure: the #GClosure
+ * @callback: the callback function
+ * 
+ * A #GCClosure is a specialization of #GClosure for C function callbacks.
+ */
+typedef struct _GCClosure		 GCClosure;
+
+
+/* --- structures --- */
+struct _GClosureNotifyData
+{
+  gpointer       data;
+  GClosureNotify notify;
+};
+/**
+ * GClosure:
+ * @in_marshal: Indicates whether the closure is currently being invoked with 
+ *  g_closure_invoke()
+ * @is_invalid: Indicates whether the closure has been invalidated by 
+ *  g_closure_invalidate()
+ * 
+ * A #GClosure represents a callback supplied by the programmer.
+ */
+struct _GClosure
+{
+  /*< private >*/
+  volatile      	guint	 ref_count : 15;
+  volatile       	guint	 meta_marshal : 1;
+  volatile       	guint	 n_guards : 1;
+  volatile       	guint	 n_fnotifiers : 2;	/* finalization notifiers */
+  volatile       	guint	 n_inotifiers : 8;	/* invalidation notifiers */
+  volatile       	guint	 in_inotify : 1;
+  volatile       	guint	 floating : 1;
+  /*< protected >*/
+  volatile         	guint	 derivative_flag : 1;
+  /*< public >*/
+  volatile       	guint	 in_marshal : 1;
+  volatile       	guint	 is_invalid : 1;
+
+  /*< private >*/	void   (*marshal)  (GClosure       *closure,
+					    GValue /*out*/ *return_value,
+					    guint           n_param_values,
+					    const GValue   *param_values,
+					    gpointer        invocation_hint,
+					    gpointer	    marshal_data);
+  /*< protected >*/	gpointer data;
+
+  /*< private >*/	GClosureNotifyData *notifiers;
+
+  /* invariants/constrains:
+   * - ->marshal and ->data are _invalid_ as soon as ->is_invalid==TRUE
+   * - invocation of all inotifiers occours prior to fnotifiers
+   * - order of inotifiers is random
+   *   inotifiers may _not_ free/invalidate parameter values (e.g. ->data)
+   * - order of fnotifiers is random
+   * - each notifier may only be removed before or during its invocation
+   * - reference counting may only happen prior to fnotify invocation
+   *   (in that sense, fnotifiers are really finalization handlers)
+   */
+};
+/* closure for C function calls, callback() is the user function
+ */
+struct _GCClosure
+{
+  GClosure	closure;
+  gpointer	callback;
+};
+
+
+/* --- prototypes --- */
+GClosure* g_cclosure_new			(GCallback	callback_func,
+						 gpointer	user_data,
+						 GClosureNotify destroy_data);
+GClosure* g_cclosure_new_swap			(GCallback	callback_func,
+						 gpointer	user_data,
+						 GClosureNotify destroy_data);
+GClosure* g_signal_type_cclosure_new		(GType          itype,
+						 guint          struct_offset);
+
+
+/* --- prototypes --- */
+GClosure* g_closure_ref				(GClosure	*closure);
+void	  g_closure_sink			(GClosure	*closure);
+void	  g_closure_unref			(GClosure	*closure);
+/* intimidating */
+GClosure* g_closure_new_simple			(guint		 sizeof_closure,
+						 gpointer	 data);
+void	  g_closure_add_finalize_notifier	(GClosure       *closure,
+						 gpointer	 notify_data,
+						 GClosureNotify	 notify_func);
+void	  g_closure_remove_finalize_notifier	(GClosure       *closure,
+						 gpointer	 notify_data,
+						 GClosureNotify	 notify_func);
+void	  g_closure_add_invalidate_notifier	(GClosure       *closure,
+						 gpointer	 notify_data,
+						 GClosureNotify	 notify_func);
+void	  g_closure_remove_invalidate_notifier	(GClosure       *closure,
+						 gpointer	 notify_data,
+						 GClosureNotify	 notify_func);
+void	  g_closure_add_marshal_guards		(GClosure	*closure,
+						 gpointer        pre_marshal_data,
+						 GClosureNotify	 pre_marshal_notify,
+						 gpointer        post_marshal_data,
+						 GClosureNotify	 post_marshal_notify);
+void	  g_closure_set_marshal			(GClosure	*closure,
+						 GClosureMarshal marshal);
+void	  g_closure_set_meta_marshal		(GClosure       *closure,
+						 gpointer	 marshal_data,
+						 GClosureMarshal meta_marshal);
+void	  g_closure_invalidate			(GClosure	*closure);
+void	  g_closure_invoke			(GClosure 	*closure,
+						 GValue	/*out*/	*return_value,
+						 guint		 n_param_values,
+						 const GValue	*param_values,
+						 gpointer	 invocation_hint);
+
+/* FIXME:
+   OK:  data_object::destroy		-> closure_invalidate();
+   MIS:	closure_invalidate()		-> disconnect(closure);
+   MIS:	disconnect(closure)		-> (unlink) closure_unref();
+   OK:	closure_finalize()		-> g_free (data_string);
+
+   random remarks:
+   - need marshaller repo with decent aliasing to base types
+   - provide marshaller collection, virtually covering anything out there
+*/
+
+G_END_DECLS
+
+#endif /* __G_CLOSURE_H__ */
diff --git a/tests/file-tests/db/h/gclosure.h.source.txt b/tests/file-tests/db/h/gclosure.h.source.txt
new file mode 100644
index 0000000..fbe5b17
--- /dev/null
+++ b/tests/file-tests/db/h/gclosure.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: glib2: /usr/include/glib-2.0/gobject/gclosure.h
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/h/gfile.h b/tests/file-tests/db/h/gfile.h
new file mode 100644
index 0000000..918f26a
--- /dev/null
+++ b/tests/file-tests/db/h/gfile.h
@@ -0,0 +1,1017 @@
+/* GIO - GLib Input, Output and Streaming Library
+ *
+ * Copyright (C) 2006-2007 Red Hat, Inc.
+ *
+ * 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 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.
+ *
+ * Author: Alexander Larsson <alexl@redhat.com>
+ */
+
+#if !defined (__GIO_GIO_H_INSIDE__) && !defined (GIO_COMPILATION)
+#error "Only <gio/gio.h> can be included directly."
+#endif
+
+#ifndef __G_FILE_H__
+#define __G_FILE_H__
+
+#include <gio/giotypes.h>
+
+G_BEGIN_DECLS
+
+#define G_TYPE_FILE            (g_file_get_type ())
+#define G_FILE(obj)            (G_TYPE_CHECK_INSTANCE_CAST ((obj), G_TYPE_FILE, GFile))
+#define G_IS_FILE(obj)	       (G_TYPE_CHECK_INSTANCE_TYPE ((obj), G_TYPE_FILE))
+#define G_FILE_GET_IFACE(obj)  (G_TYPE_INSTANCE_GET_INTERFACE ((obj), G_TYPE_FILE, GFileIface))
+
+#if 0
+/**
+ * GFile:
+ *
+ * A handle to an object implementing the #GFileIface interface.
+ * Generally stores a location within the file system. Handles do not
+ * necessarily represent files or directories that currently exist.
+ **/
+typedef struct _GFile         		GFile; /* Dummy typedef */
+#endif
+typedef struct _GFileIface    		GFileIface;
+
+
+/**
+ * GFileIface:
+ * @g_iface: The parent interface.
+ * @dup: Duplicates a #GFile.
+ * @hash: Creates a hash of a #GFile.
+ * @equal: Checks equality of two given #GFile<!-- -->s.
+ * @is_native: Checks to see if a file is native to the system.
+ * @has_uri_scheme: Checks to see if a #GFile has a given URI scheme.
+ * @get_uri_scheme: Gets the URI scheme for a #GFile.
+ * @get_basename: Gets the basename for a given #GFile.
+ * @get_path: Gets the current path within a #GFile.
+ * @get_uri: Gets a URI for the path within a #GFile.
+ * @get_parse_name: Gets the parsed name for the #GFile.
+ * @get_parent: Gets the parent directory for the #GFile.
+ * @prefix_matches: Checks whether a #GFile contains a specified file.
+ * @get_relative_path: Gets the path for a #GFile relative to a given path.
+ * @resolve_relative_path: Resolves a relative path for a #GFile to an absolute path.
+ * @get_child_for_display_name: Gets the child #GFile for a given display name.
+ * @enumerate_children: Gets a #GFileEnumerator with the children of a #GFile.
+ * @enumerate_children_async: Asynchronously gets a #GFileEnumerator with the children of a #GFile.
+ * @enumerate_children_finish: Finishes asynchronously enumerating the children.
+ * @query_info: Gets the #GFileInfo for a #GFile.
+ * @query_info_async: Asynchronously gets the #GFileInfo for a #GFile.
+ * @query_info_finish: Finishes an asynchronous query info operation.
+ * @query_filesystem_info: Gets a #GFileInfo for the file system #GFile is on.
+ * @query_filesystem_info_async: Asynchronously gets a #GFileInfo for the file system #GFile is on.
+ * @query_filesystem_info_finish: Finishes asynchronously getting the file system info.
+ * @find_enclosing_mount: Gets a #GMount for the #GFile.
+ * @find_enclosing_mount_async: Asynchronously gets the #GMount for a #GFile.
+ * @find_enclosing_mount_finish: Finishes asynchronously getting the volume.
+ * @set_display_name: Sets the display name for a #GFile.
+ * @set_display_name_async: Asynchronously sets a #GFile's display name.
+ * @set_display_name_finish: Finishes asynchronously setting a #GFile's display name.
+ * @query_settable_attributes: Returns a list of #GFileAttribute<!-- -->s that can be set.
+ * @_query_settable_attributes_async: Asynchronously gets a list of #GFileAttribute<!-- -->s that can be set.
+ * @_query_settable_attributes_finish: Finishes asynchronously querying settable attributes.
+ * @query_writable_namespaces: Returns a list of #GFileAttribute namespaces that are writable.
+ * @_query_writable_namespaces_async: Asynchronously gets a list of #GFileAttribute namespaces that are writable.
+ * @_query_writable_namespaces_finish: Finishes asynchronously querying the writable namespaces.
+ * @set_attribute: Sets a #GFileAttribute.
+ * @set_attributes_from_info: Sets a #GFileAttribute with information from a #GFileInfo.
+ * @set_attributes_async: Asynchronously sets a file's attributes.
+ * @set_attributes_finish: Finishes setting a file's attributes asynchronously.
+ * @read_fn: Reads a file asynchronously.
+ * @read_async: Asynchronously reads a file.
+ * @read_finish: Finishes asynchronously reading a file.
+ * @append_to: Writes to the end of a file.
+ * @append_to_async: Asynchronously writes to the end of a file.
+ * @append_to_finish: Finishes an asynchronous file append operation.
+ * @create: Creates a new file.
+ * @create_async: Asynchronously creates a file.
+ * @create_finish: Finishes asynchronously creating a file.
+ * @replace: Replaces the contents of a file.
+ * @replace_async: Asynchronously replaces the contents of a file.
+ * @replace_finish: Finishes asynchronously replacing a file.
+ * @delete_file: Deletes a file.
+ * @_delete_file_async: Asynchronously deletes a file.
+ * @_delete_file_finish: Finishes an asynchronous delete.
+ * @trash: Sends a #GFile to the Trash location.
+ * @_trash_async: Asynchronously sends a #GFile to the Trash location.
+ * @_trash_finish: Finishes an asynchronous file trashing operation.
+ * @make_directory: Makes a directory.
+ * @_make_directory_async: Asynchronously makes a directory.
+ * @_make_directory_finish: Finishes making a directory asynchronously.
+ * @make_symbolic_link: Makes a symbolic link.
+ * @_make_symbolic_link_async: Asynchronously makes a symbolic link
+ * @_make_symbolic_link_finish: Finishes making a symbolic link asynchronously.
+ * @copy: Copies a file.
+ * @copy_async: Asynchronously copies a file.
+ * @copy_finish: Finishes an asynchronous copy operation.
+ * @move: Moves a file.
+ * @_move_async: Asynchronously moves a file.
+ * @_move_finish: Finishes an asynchronous move operation.
+ * @mount_mountable: Mounts a mountable object.
+ * @mount_mountable_finish: Finishes a mounting operation.
+ * @unmount_mountable: Unmounts a mountable object.
+ * @unmount_mountable_finish: Finishes an unmount operation.
+ * @eject_mountable: Ejects a mountable.
+ * @eject_mountable_finish: Finishes an eject operation.
+ * @mount_enclosing_volume: Mounts a specified location.
+ * @mount_enclosing_volume_finish: Finishes mounting a specified location.
+ * @monitor_dir: Creates a #GFileMonitor for the location.
+ * @monitor_file: Creates a #GFileMonitor for the location.
+ * @open_readwrite: Open file read/write. Since 2.22.
+ * @open_readwrite_async: Asynchronously opens file read/write. Since 2.22.
+ * @open_readwrite_finish: Finishes an asynchronous open read/write. Since 2.22.
+ * @create_readwrite: Creates file read/write. Since 2.22.
+ * @create_readwrite_async: Asynchronously creates file read/write. Since 2.22.
+ * @create_readwrite_finish: Finishes an asynchronous creates read/write. Since 2.22.
+ * @replace_readwrite: Replaces file read/write. Since 2.22.
+ * @replace_readwrite_async: Asynchronously replaces file read/write. Since 2.22.
+ * @replace_readwrite_finish: Finishes an asynchronous replace read/write. Since 2.22.
+ * @start_mountable: Starts a mountable object. Since 2.22.
+ * @start_mountable_finish: Finishes an start operation. Since 2.22.
+ * @stop_mountable: Stops a mountable. Since 2.22.
+ * @stop_mountable_finish: Finishes an stop operation. Since 2.22.
+ * @supports_thread_contexts: a boolean that indicates whether the #GFile implementation supports thread-default contexts. Since 2.22.
+ * @unmount_mountable_with_operation: Unmounts a mountable object using a #GMountOperation. Since 2.22.
+ * @unmount_mountable_with_operation_finish: Finishes an unmount operation using a #GMountOperation. Since 2.22.
+ * @eject_mountable_with_operation: Ejects a mountable object using a #GMountOperation. Since 2.22.
+ * @eject_mountable_with_operation_finish: Finishes an eject operation using a #GMountOperation. Since 2.22.
+ * @poll_mountable: Polls a mountable object for media changes. Since 2.22.
+ * @poll_mountable_finish: Finishes an poll operation for media changes. Since 2.22.
+ *
+ * An interface for writing VFS file handles.
+ **/
+struct _GFileIface
+{
+  GTypeInterface g_iface;
+
+  /* Virtual Table */
+
+  GFile *             (* dup)                         (GFile         *file);
+  guint               (* hash)                        (GFile         *file);
+  gboolean            (* equal)                       (GFile         *file1,
+                                                       GFile         *file2);
+  gboolean            (* is_native)                   (GFile         *file);
+  gboolean            (* has_uri_scheme)              (GFile         *file,
+                                                       const char    *uri_scheme);
+  char *              (* get_uri_scheme)              (GFile         *file);
+  char *              (* get_basename)                (GFile         *file);
+  char *              (* get_path)                    (GFile         *file);
+  char *              (* get_uri)                     (GFile         *file);
+  char *              (* get_parse_name)              (GFile         *file);
+  GFile *             (* get_parent)                  (GFile         *file);
+  gboolean            (* prefix_matches)              (GFile         *prefix,
+                                                       GFile         *file);
+  char *              (* get_relative_path)           (GFile         *parent,
+                                                       GFile         *descendant);
+  GFile *             (* resolve_relative_path)       (GFile        *file,
+                                                       const char   *relative_path);
+  GFile *             (* get_child_for_display_name)  (GFile        *file,
+                                                       const char   *display_name,
+                                                       GError      **error);
+
+  GFileEnumerator *   (* enumerate_children)          (GFile                *file,
+                                                       const char           *attributes,
+                                                       GFileQueryInfoFlags   flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* enumerate_children_async)    (GFile                *file,
+                                                       const char           *attributes,
+                                                       GFileQueryInfoFlags   flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileEnumerator *   (* enumerate_children_finish)   (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFileInfo *         (* query_info)                  (GFile                *file,
+                                                       const char           *attributes,
+                                                       GFileQueryInfoFlags   flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* query_info_async)            (GFile                *file,
+                                                       const char           *attributes,
+                                                       GFileQueryInfoFlags   flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileInfo *         (* query_info_finish)           (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFileInfo *         (* query_filesystem_info)       (GFile                *file,
+                                                       const char           *attributes,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* query_filesystem_info_async) (GFile                *file,
+                                                       const char           *attributes,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileInfo *         (* query_filesystem_info_finish)(GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GMount *            (* find_enclosing_mount)        (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* find_enclosing_mount_async)  (GFile                *file,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GMount *            (* find_enclosing_mount_finish) (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFile *             (* set_display_name)            (GFile                *file,
+                                                       const char           *display_name,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* set_display_name_async)      (GFile                *file,
+                                                       const char           *display_name,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFile *             (* set_display_name_finish)     (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFileAttributeInfoList * (* query_settable_attributes)    (GFile          *file,
+                                                             GCancellable   *cancellable,
+                                                             GError        **error);
+  void                (* _query_settable_attributes_async)  (void);
+  void                (* _query_settable_attributes_finish) (void);
+
+  GFileAttributeInfoList * (* query_writable_namespaces)    (GFile          *file,
+                                                             GCancellable   *cancellable,
+                                                             GError        **error);
+  void                (* _query_writable_namespaces_async)  (void);
+  void                (* _query_writable_namespaces_finish) (void);
+
+  gboolean            (* set_attribute)               (GFile                *file,
+                                                       const char           *attribute,
+                                                       GFileAttributeType    type,
+                                                       gpointer              value_p,
+                                                       GFileQueryInfoFlags   flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  gboolean            (* set_attributes_from_info)    (GFile                *file,
+                                                       GFileInfo            *info,
+                                                       GFileQueryInfoFlags   flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* set_attributes_async)        (GFile                *file,
+                                                       GFileInfo            *info,
+                                                       GFileQueryInfoFlags   flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* set_attributes_finish)       (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GFileInfo           **info,
+                                                       GError              **error);
+
+  GFileInputStream *  (* read_fn)                     (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* read_async)                  (GFile                *file,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileInputStream *  (* read_finish)                 (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFileOutputStream * (* append_to)                   (GFile                *file,
+                                                       GFileCreateFlags      flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* append_to_async)             (GFile                *file,
+                                                       GFileCreateFlags      flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileOutputStream * (* append_to_finish)            (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFileOutputStream * (* create)                      (GFile                *file,
+                                                       GFileCreateFlags      flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* create_async)                (GFile                *file,
+                                                       GFileCreateFlags      flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileOutputStream * (* create_finish)               (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  GFileOutputStream * (* replace)                     (GFile                *file,
+                                                       const char           *etag,
+                                                       gboolean              make_backup,
+                                                       GFileCreateFlags      flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* replace_async)               (GFile                *file,
+                                                       const char           *etag,
+                                                       gboolean              make_backup,
+                                                       GFileCreateFlags      flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileOutputStream * (* replace_finish)              (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  gboolean            (* delete_file)                 (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* _delete_file_async)          (void);
+  void                (* _delete_file_finish)         (void);
+
+  gboolean            (* trash)                       (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* _trash_async)                (void);
+  void                (* _trash_finish)               (void);
+
+  gboolean            (* make_directory)              (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* _make_directory_async)       (void);
+  void                (* _make_directory_finish)      (void);
+
+  gboolean            (* make_symbolic_link)          (GFile                *file,
+                                                       const char           *symlink_value,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* _make_symbolic_link_async)   (void);
+  void                (* _make_symbolic_link_finish)  (void);
+
+  gboolean            (* copy)                        (GFile                *source,
+                                                       GFile                *destination,
+                                                       GFileCopyFlags        flags,
+                                                       GCancellable         *cancellable,
+                                                       GFileProgressCallback progress_callback,
+                                                       gpointer              progress_callback_data,
+                                                       GError              **error);
+  void                (* copy_async)                  (GFile                *source,
+                                                       GFile                *destination,
+                                                       GFileCopyFlags        flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GFileProgressCallback progress_callback,
+                                                       gpointer              progress_callback_data,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* copy_finish)                 (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  gboolean            (* move)                        (GFile                *source,
+                                                       GFile                *destination,
+                                                       GFileCopyFlags        flags,
+                                                       GCancellable         *cancellable,
+                                                       GFileProgressCallback progress_callback,
+                                                       gpointer              progress_callback_data,
+                                                       GError              **error);
+  void                (* _move_async)                 (void);
+  void                (* _move_finish)                (void);
+
+  void                (* mount_mountable)             (GFile                *file,
+                                                       GMountMountFlags      flags,
+                                                       GMountOperation      *mount_operation,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFile *             (* mount_mountable_finish)      (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  void                (* unmount_mountable)           (GFile                *file,
+                                                       GMountUnmountFlags    flags,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* unmount_mountable_finish)    (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  void                (* eject_mountable)             (GFile                *file,
+                                                       GMountUnmountFlags    flags,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* eject_mountable_finish)      (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  void                (* mount_enclosing_volume)      (GFile                *location,
+                                                       GMountMountFlags      flags,
+                                                       GMountOperation      *mount_operation,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean         (* mount_enclosing_volume_finish)  (GFile                *location,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  GFileMonitor *      (* monitor_dir)                 (GFile                *file,
+                                                       GFileMonitorFlags     flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  GFileMonitor *      (* monitor_file)                (GFile                *file,
+                                                       GFileMonitorFlags     flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+
+  GFileIOStream *     (* open_readwrite)              (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* open_readwrite_async)        (GFile                *file,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileIOStream *     (* open_readwrite_finish)       (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+  GFileIOStream *     (* create_readwrite)            (GFile                *file,
+						       GFileCreateFlags      flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* create_readwrite_async)      (GFile                *file,
+						       GFileCreateFlags      flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileIOStream *     (* create_readwrite_finish)      (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+  GFileIOStream *     (* replace_readwrite)           (GFile                *file,
+                                                       const char           *etag,
+                                                       gboolean              make_backup,
+                                                       GFileCreateFlags      flags,
+                                                       GCancellable         *cancellable,
+                                                       GError              **error);
+  void                (* replace_readwrite_async)     (GFile                *file,
+                                                       const char           *etag,
+                                                       gboolean              make_backup,
+                                                       GFileCreateFlags      flags,
+                                                       int                   io_priority,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  GFileIOStream *     (* replace_readwrite_finish)    (GFile                *file,
+                                                       GAsyncResult         *res,
+                                                       GError              **error);
+
+  void                (* start_mountable)             (GFile                *file,
+                                                       GDriveStartFlags      flags,
+                                                       GMountOperation      *start_operation,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* start_mountable_finish)      (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  void                (* stop_mountable)              (GFile                *file,
+                                                       GMountUnmountFlags    flags,
+                                                       GMountOperation      *mount_operation,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* stop_mountable_finish)       (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  gboolean            supports_thread_contexts;
+
+  void                (* unmount_mountable_with_operation) (GFile           *file,
+                                                       GMountUnmountFlags    flags,
+                                                       GMountOperation      *mount_operation,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* unmount_mountable_with_operation_finish) (GFile    *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  void                (* eject_mountable_with_operation) (GFile             *file,
+                                                       GMountUnmountFlags    flags,
+                                                       GMountOperation      *mount_operation,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* eject_mountable_with_operation_finish) (GFile      *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+
+  void                (* poll_mountable)              (GFile                *file,
+                                                       GCancellable         *cancellable,
+                                                       GAsyncReadyCallback   callback,
+                                                       gpointer              user_data);
+  gboolean            (* poll_mountable_finish)       (GFile                *file,
+                                                       GAsyncResult         *result,
+                                                       GError              **error);
+};
+
+GType                   g_file_get_type                   (void) G_GNUC_CONST;
+
+GFile *                 g_file_new_for_path               (const char                 *path);
+GFile *                 g_file_new_for_uri                (const char                 *uri);
+GFile *                 g_file_new_for_commandline_arg    (const char                 *arg);
+GFile *                 g_file_parse_name                 (const char                 *parse_name);
+GFile *                 g_file_dup                        (GFile                      *file);
+guint                   g_file_hash                       (gconstpointer               file);
+gboolean                g_file_equal                      (GFile                      *file1,
+							   GFile                      *file2);
+char *                  g_file_get_basename               (GFile                      *file);
+char *                  g_file_get_path                   (GFile                      *file);
+char *                  g_file_get_uri                    (GFile                      *file);
+char *                  g_file_get_parse_name             (GFile                      *file);
+GFile *                 g_file_get_parent                 (GFile                      *file);
+gboolean                g_file_has_parent                 (GFile                      *file,
+                                                           GFile                      *parent);
+GFile *                 g_file_get_child                  (GFile                      *file,
+							   const char                 *name);
+GFile *                 g_file_get_child_for_display_name (GFile                      *file,
+							   const char                 *display_name,
+							   GError                    **error);
+gboolean                g_file_has_prefix                 (GFile                      *file,
+							   GFile                      *prefix);
+char *                  g_file_get_relative_path          (GFile                      *parent,
+							   GFile                      *descendant);
+GFile *                 g_file_resolve_relative_path      (GFile                      *file,
+							   const char                 *relative_path);
+gboolean                g_file_is_native                  (GFile                      *file);
+gboolean                g_file_has_uri_scheme             (GFile                      *file,
+							   const char                 *uri_scheme);
+char *                  g_file_get_uri_scheme             (GFile                      *file);
+GFileInputStream *      g_file_read                       (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_read_async                 (GFile                      *file,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileInputStream *      g_file_read_finish                (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+GFileOutputStream *     g_file_append_to                  (GFile                      *file,
+							   GFileCreateFlags             flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+GFileOutputStream *     g_file_create                     (GFile                      *file,
+							   GFileCreateFlags             flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+GFileOutputStream *     g_file_replace                    (GFile                      *file,
+							   const char                 *etag,
+							   gboolean                    make_backup,
+							   GFileCreateFlags            flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_append_to_async            (GFile                      *file,
+							   GFileCreateFlags            flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileOutputStream *     g_file_append_to_finish           (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+void                    g_file_create_async               (GFile                      *file,
+							   GFileCreateFlags            flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileOutputStream *     g_file_create_finish              (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+void                    g_file_replace_async              (GFile                      *file,
+							   const char                 *etag,
+							   gboolean                    make_backup,
+							   GFileCreateFlags            flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileOutputStream *     g_file_replace_finish             (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+GFileIOStream *         g_file_open_readwrite             (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_open_readwrite_async       (GFile                      *file,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileIOStream *         g_file_open_readwrite_finish      (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+GFileIOStream *         g_file_create_readwrite           (GFile                      *file,
+							   GFileCreateFlags            flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_create_readwrite_async     (GFile                      *file,
+							   GFileCreateFlags            flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileIOStream *         g_file_create_readwrite_finish    (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+GFileIOStream *         g_file_replace_readwrite          (GFile                      *file,
+							   const char                 *etag,
+							   gboolean                    make_backup,
+							   GFileCreateFlags            flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_replace_readwrite_async    (GFile                      *file,
+							   const char                 *etag,
+							   gboolean                    make_backup,
+							   GFileCreateFlags            flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileIOStream *         g_file_replace_readwrite_finish   (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+gboolean                g_file_query_exists               (GFile                      *file,
+							   GCancellable               *cancellable);
+GFileType               g_file_query_file_type            (GFile                      *file,
+                                                           GFileQueryInfoFlags         flags,
+                                                           GCancellable               *cancellable);
+GFileInfo *             g_file_query_info                 (GFile                      *file,
+							   const char                 *attributes,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_query_info_async           (GFile                      *file,
+							   const char                 *attributes,
+							   GFileQueryInfoFlags         flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileInfo *             g_file_query_info_finish          (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+GFileInfo *             g_file_query_filesystem_info      (GFile                      *file,
+							   const char                 *attributes,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_query_filesystem_info_async (GFile                      *file,
+							   const char                 *attributes,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileInfo *             g_file_query_filesystem_info_finish (GFile                      *file,
+                                                           GAsyncResult               *res,
+							   GError                    **error);
+GMount *                g_file_find_enclosing_mount       (GFile                      *file,
+                                                           GCancellable               *cancellable,
+                                                           GError                    **error);
+void                    g_file_find_enclosing_mount_async (GFile                      *file,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GMount *                g_file_find_enclosing_mount_finish (GFile                     *file,
+							    GAsyncResult              *res,
+							    GError                   **error);
+GFileEnumerator *       g_file_enumerate_children         (GFile                      *file,
+							   const char                 *attributes,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_enumerate_children_async   (GFile                      *file,
+							   const char                 *attributes,
+							   GFileQueryInfoFlags         flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFileEnumerator *       g_file_enumerate_children_finish  (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+GFile *                 g_file_set_display_name           (GFile                      *file,
+							   const char                 *display_name,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_set_display_name_async     (GFile                      *file,
+							   const char                 *display_name,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFile *                 g_file_set_display_name_finish    (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+gboolean                g_file_delete                     (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_trash                      (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_copy                       (GFile                      *source,
+							   GFile                      *destination,
+							   GFileCopyFlags              flags,
+							   GCancellable               *cancellable,
+							   GFileProgressCallback       progress_callback,
+							   gpointer                    progress_callback_data,
+							   GError                    **error);
+void                    g_file_copy_async                 (GFile                      *source,
+							   GFile                      *destination,
+							   GFileCopyFlags              flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GFileProgressCallback       progress_callback,
+							   gpointer                    progress_callback_data,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_copy_finish                (GFile                      *file,
+							   GAsyncResult               *res,
+							   GError                    **error);
+gboolean                g_file_move                       (GFile                      *source,
+							   GFile                      *destination,
+							   GFileCopyFlags              flags,
+							   GCancellable               *cancellable,
+							   GFileProgressCallback       progress_callback,
+							   gpointer                    progress_callback_data,
+							   GError                    **error);
+gboolean                g_file_make_directory             (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_make_directory_with_parents (GFile                     *file,
+		                                           GCancellable               *cancellable,
+		                                           GError                    **error);
+gboolean                g_file_make_symbolic_link         (GFile                      *file,
+							   const char                 *symlink_value,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+GFileAttributeInfoList *g_file_query_settable_attributes  (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+GFileAttributeInfoList *g_file_query_writable_namespaces  (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attribute              (GFile                      *file,
+							   const char                 *attribute,
+							   GFileAttributeType          type,
+							   gpointer                    value_p,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attributes_from_info   (GFile                      *file,
+							   GFileInfo                  *info,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_set_attributes_async       (GFile                      *file,
+							   GFileInfo                  *info,
+							   GFileQueryInfoFlags         flags,
+							   int                         io_priority,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_set_attributes_finish      (GFile                      *file,
+							   GAsyncResult               *result,
+							   GFileInfo                 **info,
+							   GError                    **error);
+gboolean                g_file_set_attribute_string       (GFile                      *file,
+							   const char                 *attribute,
+							   const char                 *value,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attribute_byte_string  (GFile                      *file,
+							   const char                 *attribute,
+							   const char                 *value,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attribute_uint32       (GFile                      *file,
+							   const char                 *attribute,
+							   guint32                     value,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attribute_int32        (GFile                      *file,
+							   const char                 *attribute,
+							   gint32                      value,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attribute_uint64       (GFile                      *file,
+							   const char                 *attribute,
+							   guint64                     value,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+gboolean                g_file_set_attribute_int64        (GFile                      *file,
+							   const char                 *attribute,
+							   gint64                      value,
+							   GFileQueryInfoFlags         flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+void                    g_file_mount_enclosing_volume     (GFile                      *location,
+							   GMountMountFlags            flags,
+							   GMountOperation            *mount_operation,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_mount_enclosing_volume_finish (GFile                      *location,
+							   GAsyncResult               *result,
+							   GError                    **error);
+void                    g_file_mount_mountable            (GFile                      *file,
+							   GMountMountFlags            flags,
+							   GMountOperation            *mount_operation,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+GFile *                 g_file_mount_mountable_finish     (GFile                      *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+#ifndef G_DISABLE_DEPRECATED
+void                    g_file_unmount_mountable          (GFile                      *file,
+							   GMountUnmountFlags          flags,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_unmount_mountable_finish   (GFile                      *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+#endif
+void                    g_file_unmount_mountable_with_operation (GFile                *file,
+							   GMountUnmountFlags          flags,
+							   GMountOperation            *mount_operation,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_unmount_mountable_with_operation_finish (GFile         *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+#ifndef G_DISABLE_DEPRECATED
+void                    g_file_eject_mountable            (GFile                      *file,
+							   GMountUnmountFlags          flags,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_eject_mountable_finish     (GFile                      *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+#endif
+void                    g_file_eject_mountable_with_operation (GFile                  *file,
+							   GMountUnmountFlags          flags,
+							   GMountOperation            *mount_operation,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_eject_mountable_with_operation_finish (GFile           *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+
+gboolean                g_file_copy_attributes            (GFile                      *source,
+							   GFile                      *destination,
+							   GFileCopyFlags              flags,
+							   GCancellable               *cancellable,
+							   GError                    **error);
+
+
+GFileMonitor*           g_file_monitor_directory          (GFile                  *file,
+							   GFileMonitorFlags       flags,
+							   GCancellable           *cancellable,
+							   GError                **error);
+GFileMonitor*           g_file_monitor_file               (GFile                  *file,
+							   GFileMonitorFlags       flags,
+							   GCancellable           *cancellable,
+							   GError                **error);
+GFileMonitor*           g_file_monitor                    (GFile                  *file,
+							   GFileMonitorFlags       flags,
+							   GCancellable           *cancellable,
+							   GError                **error);
+
+void                    g_file_start_mountable            (GFile                      *file,
+							   GDriveStartFlags            flags,
+							   GMountOperation            *start_operation,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_start_mountable_finish     (GFile                      *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+void                    g_file_stop_mountable             (GFile                      *file,
+							   GMountUnmountFlags          flags,
+                                                           GMountOperation            *mount_operation,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_stop_mountable_finish      (GFile                      *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+
+void                    g_file_poll_mountable             (GFile                      *file,
+							   GCancellable               *cancellable,
+							   GAsyncReadyCallback         callback,
+							   gpointer                    user_data);
+gboolean                g_file_poll_mountable_finish      (GFile                      *file,
+							   GAsyncResult               *result,
+							   GError                    **error);
+
+/* Utilities */
+
+GAppInfo *g_file_query_default_handler       (GFile                  *file,
+					      GCancellable           *cancellable,
+					      GError                **error);
+gboolean g_file_load_contents                (GFile                  *file,
+					      GCancellable           *cancellable,
+					      char                  **contents,
+					      gsize                  *length,
+					      char                  **etag_out,
+					      GError                **error);
+void     g_file_load_contents_async          (GFile                  *file,
+					      GCancellable           *cancellable,
+					      GAsyncReadyCallback     callback,
+					      gpointer                user_data);
+gboolean g_file_load_contents_finish         (GFile                  *file,
+					      GAsyncResult           *res,
+					      char                  **contents,
+					      gsize                  *length,
+					      char                  **etag_out,
+					      GError                **error);
+void     g_file_load_partial_contents_async  (GFile                  *file,
+					      GCancellable           *cancellable,
+					      GFileReadMoreCallback   read_more_callback,
+					      GAsyncReadyCallback     callback,
+					      gpointer                user_data);
+gboolean g_file_load_partial_contents_finish (GFile                  *file,
+					      GAsyncResult           *res,
+					      char                  **contents,
+					      gsize                  *length,
+					      char                  **etag_out,
+					      GError                **error);
+gboolean g_file_replace_contents             (GFile                  *file,
+					      const char             *contents,
+					      gsize                   length,
+					      const char             *etag,
+					      gboolean                make_backup,
+					      GFileCreateFlags        flags,
+					      char                  **new_etag,
+					      GCancellable           *cancellable,
+					      GError                **error);
+void     g_file_replace_contents_async       (GFile                  *file,
+					      const char             *contents,
+					      gsize                   length,
+					      const char             *etag,
+					      gboolean                make_backup,
+					      GFileCreateFlags        flags,
+					      GCancellable           *cancellable,
+					      GAsyncReadyCallback     callback,
+					      gpointer                user_data);
+gboolean g_file_replace_contents_finish      (GFile                  *file,
+					      GAsyncResult           *res,
+					      char                  **new_etag,
+					      GError                **error);
+
+gboolean g_file_supports_thread_contexts     (GFile                  *file);
+
+G_END_DECLS
+
+#endif /* __G_FILE_H__ */
diff --git a/tests/file-tests/db/h/gfile.h.source.txt b/tests/file-tests/db/h/gfile.h.source.txt
new file mode 100644
index 0000000..3ed2751
--- /dev/null
+++ b/tests/file-tests/db/h/gfile.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: glib2: /usr/include/glib-2.0/gio/gfile.h
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/h/gfileattribute.h b/tests/file-tests/db/h/gfileattribute.h
new file mode 100644
index 0000000..46803fb
--- /dev/null
+++ b/tests/file-tests/db/h/gfileattribute.h
@@ -0,0 +1,77 @@
+/* GIO - GLib Input, Output and Streaming Library
+ *
+ * Copyright (C) 2006-2007 Red Hat, Inc.
+ *
+ * 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 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.
+ *
+ * Author: Alexander Larsson <alexl@redhat.com>
+ */
+
+#if !defined (__GIO_GIO_H_INSIDE__) && !defined (GIO_COMPILATION)
+#error "Only <gio/gio.h> can be included directly."
+#endif
+
+#ifndef __G_FILE_ATTRIBUTE_H__
+#define __G_FILE_ATTRIBUTE_H__
+
+#include <gio/giotypes.h>
+
+G_BEGIN_DECLS
+
+/**
+ * GFileAttributeInfo:
+ * @name: the name of the attribute.
+ * @type: the #GFileAttributeType type of the attribute.
+ * @flags: a set of #GFileAttributeInfoFlags.
+ *
+ * Information about a specific attribute.
+ **/
+struct _GFileAttributeInfo
+{
+  char                    *name;
+  GFileAttributeType       type;
+  GFileAttributeInfoFlags  flags;
+};
+
+/**
+ * GFileAttributeInfoList:
+ * @infos: an array of #GFileAttributeInfo<!-- -->s.
+ * @n_infos: the number of values in the array.
+ *
+ * Acts as a lightweight registry for possible valid file attributes.
+ * The registry stores Key-Value pair formats as #GFileAttributeInfo<!-- -->s.
+ **/
+struct _GFileAttributeInfoList
+{
+  GFileAttributeInfo *infos;
+  int                 n_infos;
+};
+
+GType                     g_file_attribute_info_list_get_type (void);
+GFileAttributeInfoList *  g_file_attribute_info_list_new    (void);
+GFileAttributeInfoList *  g_file_attribute_info_list_ref    (GFileAttributeInfoList *list);
+void                      g_file_attribute_info_list_unref  (GFileAttributeInfoList *list);
+GFileAttributeInfoList *  g_file_attribute_info_list_dup    (GFileAttributeInfoList *list);
+const GFileAttributeInfo *g_file_attribute_info_list_lookup (GFileAttributeInfoList *list,
+							     const char             *name);
+void                      g_file_attribute_info_list_add    (GFileAttributeInfoList *list,
+							     const char             *name,
+							     GFileAttributeType      type,
+							     GFileAttributeInfoFlags flags);
+
+G_END_DECLS
+
+#endif /* __G_FILE_INFO_H__ */
diff --git a/tests/file-tests/db/h/gfileattribute.h.source.txt b/tests/file-tests/db/h/gfileattribute.h.source.txt
new file mode 100644
index 0000000..330ac42
--- /dev/null
+++ b/tests/file-tests/db/h/gfileattribute.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: glib2: /usr/include/glib-2.0/gio/gfileattribute.h
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/h/gsocketaddressenumerator.h b/tests/file-tests/db/h/gsocketaddressenumerator.h
new file mode 100644
index 0000000..c69be2f
--- /dev/null
+++ b/tests/file-tests/db/h/gsocketaddressenumerator.h
@@ -0,0 +1,89 @@
+/* GIO - GLib Input, Output and Streaming Library
+ *
+ * Copyright (C) 2008 Red Hat, Inc.
+ *
+ * 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 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.
+ */
+
+#if !defined (__GIO_GIO_H_INSIDE__) && !defined (GIO_COMPILATION)
+#error "Only <gio/gio.h> can be included directly."
+#endif
+
+#ifndef __G_SOCKET_ADDRESS_ENUMERATOR_H__
+#define __G_SOCKET_ADDRESS_ENUMERATOR_H__
+
+#include <gio/giotypes.h>
+
+G_BEGIN_DECLS
+
+#define G_TYPE_SOCKET_ADDRESS_ENUMERATOR         (g_socket_address_enumerator_get_type ())
+#define G_SOCKET_ADDRESS_ENUMERATOR(o)           (G_TYPE_CHECK_INSTANCE_CAST ((o), G_TYPE_SOCKET_ADDRESS_ENUMERATOR, GSocketAddressEnumerator))
+#define G_SOCKET_ADDRESS_ENUMERATOR_CLASS(k)     (G_TYPE_CHECK_CLASS_CAST((k), G_TYPE_SOCKET_ADDRESS_ENUMERATOR, GSocketAddressEnumeratorClass))
+#define G_IS_SOCKET_ADDRESS_ENUMERATOR(o)        (G_TYPE_CHECK_INSTANCE_TYPE ((o), G_TYPE_SOCKET_ADDRESS_ENUMERATOR))
+#define G_IS_SOCKET_ADDRESS_ENUMERATOR_CLASS(k)  (G_TYPE_CHECK_CLASS_TYPE ((k), G_TYPE_SOCKET_ADDRESS_ENUMERATOR))
+#define G_SOCKET_ADDRESS_ENUMERATOR_GET_CLASS(o) (G_TYPE_INSTANCE_GET_CLASS ((o), G_TYPE_SOCKET_ADDRESS_ENUMERATOR, GSocketAddressEnumeratorClass))
+
+/**
+ * GSocketAddressEnumerator:
+ *
+ * Enumerator type for objects that contain or generate
+ * #GSocketAddress<!-- -->es.
+ */
+typedef struct _GSocketAddressEnumeratorClass GSocketAddressEnumeratorClass;
+
+struct _GSocketAddressEnumerator
+{
+  GObject parent_instance;
+
+};
+
+struct _GSocketAddressEnumeratorClass
+{
+  GObjectClass parent_class;
+
+  /* Virtual Table */
+
+  GSocketAddress * (* next)        (GSocketAddressEnumerator  *enumerator,
+				    GCancellable              *cancellable,
+				    GError                   **error);
+
+  void             (* next_async)  (GSocketAddressEnumerator  *enumerator,
+				    GCancellable              *cancellable,
+				    GAsyncReadyCallback        callback,
+				    gpointer                   user_data);
+  GSocketAddress * (* next_finish) (GSocketAddressEnumerator  *enumerator,
+				    GAsyncResult              *result,
+				    GError                   **error);
+};
+
+GType           g_socket_address_enumerator_get_type        (void) G_GNUC_CONST;
+
+GSocketAddress *g_socket_address_enumerator_next        (GSocketAddressEnumerator  *enumerator,
+							 GCancellable              *cancellable,
+							 GError                   **error);
+
+void            g_socket_address_enumerator_next_async  (GSocketAddressEnumerator  *enumerator,
+							 GCancellable              *cancellable,
+							 GAsyncReadyCallback        callback,
+							 gpointer                   user_data);
+GSocketAddress *g_socket_address_enumerator_next_finish (GSocketAddressEnumerator  *enumerator,
+							 GAsyncResult              *result,
+							 GError                   **error);
+
+G_END_DECLS
+
+
+#endif /* __G_SOCKET_ADDRESS_ENUMERATOR_H__ */
diff --git a/tests/file-tests/db/h/gsocketaddressenumerator.h.source.txt b/tests/file-tests/db/h/gsocketaddressenumerator.h.source.txt
new file mode 100644
index 0000000..5598556
--- /dev/null
+++ b/tests/file-tests/db/h/gsocketaddressenumerator.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: glib2: gsocketaddressenumerator.h
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/h/gunixmounts.h b/tests/file-tests/db/h/gunixmounts.h
new file mode 100644
index 0000000..55aa3cc
--- /dev/null
+++ b/tests/file-tests/db/h/gunixmounts.h
@@ -0,0 +1,102 @@
+/* GIO - GLib Input, Output and Streaming Library
+ *
+ * Copyright (C) 2006-2007 Red Hat, Inc.
+ *
+ * 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 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.
+ *
+ * Author: Alexander Larsson <alexl@redhat.com>
+ */
+
+#ifndef __G_UNIX_MOUNTS_H__
+#define __G_UNIX_MOUNTS_H__
+
+#include <gio/gio.h>
+
+G_BEGIN_DECLS
+
+/**
+ * GUnixMountEntry:
+ *
+ * Defines a Unix mount entry (e.g. <filename>/media/cdrom</filename>).
+ * This corresponds roughly to a mtab entry.
+ **/
+typedef struct _GUnixMountEntry GUnixMountEntry;
+
+/**
+ * GUnixMountPoint:
+ *
+ * Defines a Unix mount point (e.g. <filename>/dev</filename>).
+ * This corresponds roughly to a fstab entry.
+ **/
+typedef struct _GUnixMountPoint GUnixMountPoint;
+
+/**
+ * GUnixMountMonitor:
+ *
+ * Watches #GUnixMount<!-- -->s for changes.
+ **/
+typedef struct _GUnixMountMonitor      GUnixMountMonitor;
+typedef struct _GUnixMountMonitorClass GUnixMountMonitorClass;
+
+#define G_TYPE_UNIX_MOUNT_MONITOR        (g_unix_mount_monitor_get_type ())
+#define G_UNIX_MOUNT_MONITOR(o)          (G_TYPE_CHECK_INSTANCE_CAST ((o), G_TYPE_UNIX_MOUNT_MONITOR, GUnixMountMonitor))
+#define G_UNIX_MOUNT_MONITOR_CLASS(k)    (G_TYPE_CHECK_CLASS_CAST((k), G_TYPE_UNIX_MOUNT_MONITOR, GUnixMountMonitorClass))
+#define G_IS_UNIX_MOUNT_MONITOR(o)       (G_TYPE_CHECK_INSTANCE_TYPE ((o), G_TYPE_UNIX_MOUNT_MONITOR))
+#define G_IS_UNIX_MOUNT_MONITOR_CLASS(k) (G_TYPE_CHECK_CLASS_TYPE ((k), G_TYPE_UNIX_MOUNT_MONITOR))
+
+void           g_unix_mount_free                    (GUnixMountEntry    *mount_entry);
+void           g_unix_mount_point_free              (GUnixMountPoint    *mount_point);
+gint           g_unix_mount_compare                 (GUnixMountEntry    *mount1,
+						     GUnixMountEntry    *mount2);
+const char *   g_unix_mount_get_mount_path          (GUnixMountEntry    *mount_entry);
+const char *   g_unix_mount_get_device_path         (GUnixMountEntry    *mount_entry);
+const char *   g_unix_mount_get_fs_type             (GUnixMountEntry    *mount_entry);
+gboolean       g_unix_mount_is_readonly             (GUnixMountEntry    *mount_entry);
+gboolean       g_unix_mount_is_system_internal      (GUnixMountEntry    *mount_entry);
+gboolean       g_unix_mount_guess_can_eject         (GUnixMountEntry    *mount_entry);
+gboolean       g_unix_mount_guess_should_display    (GUnixMountEntry    *mount_entry);
+char *         g_unix_mount_guess_name              (GUnixMountEntry    *mount_entry);
+GIcon *        g_unix_mount_guess_icon              (GUnixMountEntry    *mount_entry);
+
+gint           g_unix_mount_point_compare           (GUnixMountPoint    *mount1,
+						     GUnixMountPoint    *mount2);
+const char *   g_unix_mount_point_get_mount_path    (GUnixMountPoint    *mount_point);
+const char *   g_unix_mount_point_get_device_path   (GUnixMountPoint    *mount_point);
+const char *   g_unix_mount_point_get_fs_type       (GUnixMountPoint    *mount_point);
+gboolean       g_unix_mount_point_is_readonly       (GUnixMountPoint    *mount_point);
+gboolean       g_unix_mount_point_is_user_mountable (GUnixMountPoint    *mount_point);
+gboolean       g_unix_mount_point_is_loopback       (GUnixMountPoint    *mount_point);
+gboolean       g_unix_mount_point_guess_can_eject   (GUnixMountPoint    *mount_point);
+char *         g_unix_mount_point_guess_name        (GUnixMountPoint    *mount_point);
+GIcon *        g_unix_mount_point_guess_icon        (GUnixMountPoint    *mount_point);
+
+GList *        g_unix_mount_points_get              (guint64            *time_read);
+GList *        g_unix_mounts_get                    (guint64            *time_read);
+GUnixMountEntry *g_unix_mount_at                    (const char         *mount_path,
+						     guint64            *time_read);
+gboolean       g_unix_mounts_changed_since          (guint64             time);
+gboolean       g_unix_mount_points_changed_since    (guint64             time);
+
+GType              g_unix_mount_monitor_get_type       (void) G_GNUC_CONST;
+GUnixMountMonitor *g_unix_mount_monitor_new            (void);
+void               g_unix_mount_monitor_set_rate_limit (GUnixMountMonitor *mount_monitor,
+                                                        int                limit_msec);
+
+gboolean g_unix_is_mount_path_system_internal (const char *mount_path);
+
+G_END_DECLS
+
+#endif /* __G_UNIX_MOUNTS_H__ */
diff --git a/tests/file-tests/db/h/gunixmounts.h.source.txt b/tests/file-tests/db/h/gunixmounts.h.source.txt
new file mode 100644
index 0000000..7aa17b5
--- /dev/null
+++ b/tests/file-tests/db/h/gunixmounts.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: glib2: gunixmounts.h
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/h/stl_map.h b/tests/file-tests/db/h/stl_map.h
new file mode 100644
index 0000000..7f81fab
--- /dev/null
+++ b/tests/file-tests/db/h/stl_map.h
@@ -0,0 +1,895 @@
+// Map implementation -*- C++ -*-
+
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
+// Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, 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 General Public License for more details.
+
+// Under Section 7 of GPL version 3, you are granted additional
+// permissions described in the GCC Runtime Library Exception, version
+// 3.1, as published by the Free Software Foundation.
+
+// You should have received a copy of the GNU General Public License and
+// a copy of the GCC Runtime Library Exception along with this program;
+// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+// <http://www.gnu.org/licenses/>.
+
+/*
+ *
+ * Copyright (c) 1994
+ * Hewlett-Packard Company
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Hewlett-Packard Company makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ *
+ *
+ * Copyright (c) 1996,1997
+ * Silicon Graphics Computer Systems, Inc.
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Silicon Graphics makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ */
+
+/** @file stl_map.h
+ *  This is an internal header file, included by other library headers.
+ *  You should not attempt to use it directly.
+ */
+
+#ifndef _STL_MAP_H
+#define _STL_MAP_H 1
+
+#include <bits/functexcept.h>
+#include <bits/concept_check.h>
+#include <initializer_list>
+
+_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
+
+  /**
+   *  @brief A standard container made up of (key,value) pairs, which can be
+   *  retrieved based on a key, in logarithmic time.
+   *
+   *  @ingroup associative_containers
+   *
+   *  Meets the requirements of a <a href="tables.html#65">container</a>, a
+   *  <a href="tables.html#66">reversible container</a>, and an
+   *  <a href="tables.html#69">associative container</a> (using unique keys).
+   *  For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
+   *  value_type is std::pair<const Key,T>.
+   *
+   *  Maps support bidirectional iterators.
+   *
+   *  The private tree data is declared exactly the same way for map and
+   *  multimap; the distinction is made entirely in how the tree functions are
+   *  called (*_unique versus *_equal, same as the standard).
+  */
+  template <typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
+            typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
+    class map
+    {
+    public:
+      typedef _Key                                          key_type;
+      typedef _Tp                                           mapped_type;
+      typedef std::pair<const _Key, _Tp>                    value_type;
+      typedef _Compare                                      key_compare;
+      typedef _Alloc                                        allocator_type;
+
+    private:
+      // concept requirements
+      typedef typename _Alloc::value_type                   _Alloc_value_type;
+      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
+      __glibcxx_class_requires4(_Compare, bool, _Key, _Key,
+				_BinaryFunctionConcept)
+      __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept)
+
+    public:
+      class value_compare
+      : public std::binary_function<value_type, value_type, bool>
+      {
+	friend class map<_Key, _Tp, _Compare, _Alloc>;
+      protected:
+	_Compare comp;
+
+	value_compare(_Compare __c)
+	: comp(__c) { }
+
+      public:
+	bool operator()(const value_type& __x, const value_type& __y) const
+	{ return comp(__x.first, __y.first); }
+      };
+
+    private:
+      /// This turns a red-black tree into a [multi]map. 
+      typedef typename _Alloc::template rebind<value_type>::other 
+        _Pair_alloc_type;
+
+      typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
+		       key_compare, _Pair_alloc_type> _Rep_type;
+
+      /// The actual tree structure.
+      _Rep_type _M_t;
+
+    public:
+      // many of these are specified differently in ISO, but the following are
+      // "functionally equivalent"
+      typedef typename _Pair_alloc_type::pointer         pointer;
+      typedef typename _Pair_alloc_type::const_pointer   const_pointer;
+      typedef typename _Pair_alloc_type::reference       reference;
+      typedef typename _Pair_alloc_type::const_reference const_reference;
+      typedef typename _Rep_type::iterator               iterator;
+      typedef typename _Rep_type::const_iterator         const_iterator;
+      typedef typename _Rep_type::size_type              size_type;
+      typedef typename _Rep_type::difference_type        difference_type;
+      typedef typename _Rep_type::reverse_iterator       reverse_iterator;
+      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
+
+      // [23.3.1.1] construct/copy/destroy
+      // (get_allocator() is normally listed in this section, but seems to have
+      // been accidentally omitted in the printed standard)
+      /**
+       *  @brief  Default constructor creates no elements.
+       */
+      map()
+      : _M_t() { }
+
+      /**
+       *  @brief  Creates a %map with no elements.
+       *  @param  comp  A comparison object.
+       *  @param  a  An allocator object.
+       */
+      explicit
+      map(const _Compare& __comp,
+	  const allocator_type& __a = allocator_type())
+      : _M_t(__comp, __a) { }
+
+      /**
+       *  @brief  %Map copy constructor.
+       *  @param  x  A %map of identical element and allocator types.
+       *
+       *  The newly-created %map uses a copy of the allocation object
+       *  used by @a x.
+       */
+      map(const map& __x)
+      : _M_t(__x._M_t) { }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  %Map move constructor.
+       *  @param  x  A %map of identical element and allocator types.
+       *
+       *  The newly-created %map contains the exact contents of @a x.
+       *  The contents of @a x are a valid, but unspecified %map.
+       */
+      map(map&& __x)
+      : _M_t(std::forward<_Rep_type>(__x._M_t)) { }
+
+      /**
+       *  @brief  Builds a %map from an initializer_list.
+       *  @param  l  An initializer_list.
+       *  @param  comp  A comparison object.
+       *  @param  a  An allocator object.
+       *
+       *  Create a %map consisting of copies of the elements in the
+       *  initializer_list @a l.
+       *  This is linear in N if the range is already sorted, and NlogN
+       *  otherwise (where N is @a l.size()).
+       */
+      map(initializer_list<value_type> __l,
+	  const _Compare& __c = _Compare(),
+	  const allocator_type& __a = allocator_type())
+      : _M_t(__c, __a)
+      { _M_t._M_insert_unique(__l.begin(), __l.end()); }
+#endif
+
+      /**
+       *  @brief  Builds a %map from a range.
+       *  @param  first  An input iterator.
+       *  @param  last  An input iterator.
+       *
+       *  Create a %map consisting of copies of the elements from [first,last).
+       *  This is linear in N if the range is already sorted, and NlogN
+       *  otherwise (where N is distance(first,last)).
+       */
+      template<typename _InputIterator>
+        map(_InputIterator __first, _InputIterator __last)
+	: _M_t()
+        { _M_t._M_insert_unique(__first, __last); }
+
+      /**
+       *  @brief  Builds a %map from a range.
+       *  @param  first  An input iterator.
+       *  @param  last  An input iterator.
+       *  @param  comp  A comparison functor.
+       *  @param  a  An allocator object.
+       *
+       *  Create a %map consisting of copies of the elements from [first,last).
+       *  This is linear in N if the range is already sorted, and NlogN
+       *  otherwise (where N is distance(first,last)).
+       */
+      template<typename _InputIterator>
+        map(_InputIterator __first, _InputIterator __last,
+	    const _Compare& __comp,
+	    const allocator_type& __a = allocator_type())
+	: _M_t(__comp, __a)
+        { _M_t._M_insert_unique(__first, __last); }
+
+      // FIXME There is no dtor declared, but we should have something
+      // generated by Doxygen.  I don't know what tags to add to this
+      // paragraph to make that happen:
+      /**
+       *  The dtor only erases the elements, and note that if the elements
+       *  themselves are pointers, the pointed-to memory is not touched in any
+       *  way.  Managing the pointer is the user's responsibility.
+       */
+
+      /**
+       *  @brief  %Map assignment operator.
+       *  @param  x  A %map of identical element and allocator types.
+       *
+       *  All the elements of @a x are copied, but unlike the copy constructor,
+       *  the allocator object is not copied.
+       */
+      map&
+      operator=(const map& __x)
+      {
+	_M_t = __x._M_t;
+	return *this;
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief  %Map move assignment operator.
+       *  @param  x  A %map of identical element and allocator types.
+       *
+       *  The contents of @a x are moved into this map (without copying).
+       *  @a x is a valid, but unspecified %map.
+       */
+      map&
+      operator=(map&& __x)
+      {
+	// NB: DR 1204.
+	// NB: DR 675.
+	this->clear();
+	this->swap(__x);
+	return *this;
+      }
+
+      /**
+       *  @brief  %Map list assignment operator.
+       *  @param  l  An initializer_list.
+       *
+       *  This function fills a %map with copies of the elements in the
+       *  initializer list @a l.
+       *
+       *  Note that the assignment completely changes the %map and
+       *  that the resulting %map's size is the same as the number
+       *  of elements assigned.  Old data may be lost.
+       */
+      map&
+      operator=(initializer_list<value_type> __l)
+      {
+	this->clear();
+	this->insert(__l.begin(), __l.end());
+	return *this;
+      }
+#endif
+
+      /// Get a copy of the memory allocation object.
+      allocator_type
+      get_allocator() const
+      { return _M_t.get_allocator(); }
+
+      // iterators
+      /**
+       *  Returns a read/write iterator that points to the first pair in the
+       *  %map.
+       *  Iteration is done in ascending order according to the keys.
+       */
+      iterator
+      begin()
+      { return _M_t.begin(); }
+
+      /**
+       *  Returns a read-only (constant) iterator that points to the first pair
+       *  in the %map.  Iteration is done in ascending order according to the
+       *  keys.
+       */
+      const_iterator
+      begin() const
+      { return _M_t.begin(); }
+
+      /**
+       *  Returns a read/write iterator that points one past the last
+       *  pair in the %map.  Iteration is done in ascending order
+       *  according to the keys.
+       */
+      iterator
+      end()
+      { return _M_t.end(); }
+
+      /**
+       *  Returns a read-only (constant) iterator that points one past the last
+       *  pair in the %map.  Iteration is done in ascending order according to
+       *  the keys.
+       */
+      const_iterator
+      end() const
+      { return _M_t.end(); }
+
+      /**
+       *  Returns a read/write reverse iterator that points to the last pair in
+       *  the %map.  Iteration is done in descending order according to the
+       *  keys.
+       */
+      reverse_iterator
+      rbegin()
+      { return _M_t.rbegin(); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points to the
+       *  last pair in the %map.  Iteration is done in descending order
+       *  according to the keys.
+       */
+      const_reverse_iterator
+      rbegin() const
+      { return _M_t.rbegin(); }
+
+      /**
+       *  Returns a read/write reverse iterator that points to one before the
+       *  first pair in the %map.  Iteration is done in descending order
+       *  according to the keys.
+       */
+      reverse_iterator
+      rend()
+      { return _M_t.rend(); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points to one
+       *  before the first pair in the %map.  Iteration is done in descending
+       *  order according to the keys.
+       */
+      const_reverse_iterator
+      rend() const
+      { return _M_t.rend(); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  Returns a read-only (constant) iterator that points to the first pair
+       *  in the %map.  Iteration is done in ascending order according to the
+       *  keys.
+       */
+      const_iterator
+      cbegin() const
+      { return _M_t.begin(); }
+
+      /**
+       *  Returns a read-only (constant) iterator that points one past the last
+       *  pair in the %map.  Iteration is done in ascending order according to
+       *  the keys.
+       */
+      const_iterator
+      cend() const
+      { return _M_t.end(); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points to the
+       *  last pair in the %map.  Iteration is done in descending order
+       *  according to the keys.
+       */
+      const_reverse_iterator
+      crbegin() const
+      { return _M_t.rbegin(); }
+
+      /**
+       *  Returns a read-only (constant) reverse iterator that points to one
+       *  before the first pair in the %map.  Iteration is done in descending
+       *  order according to the keys.
+       */
+      const_reverse_iterator
+      crend() const
+      { return _M_t.rend(); }
+#endif
+
+      // capacity
+      /** Returns true if the %map is empty.  (Thus begin() would equal
+       *  end().)
+      */
+      bool
+      empty() const
+      { return _M_t.empty(); }
+
+      /** Returns the size of the %map.  */
+      size_type
+      size() const
+      { return _M_t.size(); }
+
+      /** Returns the maximum size of the %map.  */
+      size_type
+      max_size() const
+      { return _M_t.max_size(); }
+
+      // [23.3.1.2] element access
+      /**
+       *  @brief  Subscript ( @c [] ) access to %map data.
+       *  @param  k  The key for which data should be retrieved.
+       *  @return  A reference to the data of the (key,data) %pair.
+       *
+       *  Allows for easy lookup with the subscript ( @c [] )
+       *  operator.  Returns data associated with the key specified in
+       *  subscript.  If the key does not exist, a pair with that key
+       *  is created using default values, which is then returned.
+       *
+       *  Lookup requires logarithmic time.
+       */
+      mapped_type&
+      operator[](const key_type& __k)
+      {
+	// concept requirements
+	__glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
+
+	iterator __i = lower_bound(__k);
+	// __i->first is greater than or equivalent to __k.
+	if (__i == end() || key_comp()(__k, (*__i).first))
+          __i = insert(__i, value_type(__k, mapped_type()));
+	return (*__i).second;
+      }
+
+      // _GLIBCXX_RESOLVE_LIB_DEFECTS
+      // DR 464. Suggestion for new member functions in standard containers.
+      /**
+       *  @brief  Access to %map data.
+       *  @param  k  The key for which data should be retrieved.
+       *  @return  A reference to the data whose key is equivalent to @a k, if
+       *           such a data is present in the %map.
+       *  @throw  std::out_of_range  If no such data is present.
+       */
+      mapped_type&
+      at(const key_type& __k)
+      {
+	iterator __i = lower_bound(__k);
+	if (__i == end() || key_comp()(__k, (*__i).first))
+	  __throw_out_of_range(__N("map::at"));
+	return (*__i).second;
+      }
+
+      const mapped_type&
+      at(const key_type& __k) const
+      {
+	const_iterator __i = lower_bound(__k);
+	if (__i == end() || key_comp()(__k, (*__i).first))
+	  __throw_out_of_range(__N("map::at"));
+	return (*__i).second;
+      }
+
+      // modifiers
+      /**
+       *  @brief Attempts to insert a std::pair into the %map.
+
+       *  @param  x  Pair to be inserted (see std::make_pair for easy creation 
+       *	     of pairs).
+
+       *  @return  A pair, of which the first element is an iterator that 
+       *           points to the possibly inserted pair, and the second is 
+       *           a bool that is true if the pair was actually inserted.
+       *
+       *  This function attempts to insert a (key, value) %pair into the %map.
+       *  A %map relies on unique keys and thus a %pair is only inserted if its
+       *  first element (the key) is not already present in the %map.
+       *
+       *  Insertion requires logarithmic time.
+       */
+      std::pair<iterator, bool>
+      insert(const value_type& __x)
+      { return _M_t._M_insert_unique(__x); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      /**
+       *  @brief Attempts to insert a list of std::pairs into the %map.
+       *  @param  list  A std::initializer_list<value_type> of pairs to be
+       *                inserted.
+       *
+       *  Complexity similar to that of the range constructor.
+       */
+      void
+      insert(std::initializer_list<value_type> __list)
+      { insert (__list.begin(), __list.end()); }
+#endif
+
+      /**
+       *  @brief Attempts to insert a std::pair into the %map.
+       *  @param  position  An iterator that serves as a hint as to where the
+       *                    pair should be inserted.
+       *  @param  x  Pair to be inserted (see std::make_pair for easy creation
+       *             of pairs).
+       *  @return  An iterator that points to the element with key of @a x (may
+       *           or may not be the %pair passed in).
+       *
+
+       *  This function is not concerned about whether the insertion
+       *  took place, and thus does not return a boolean like the
+       *  single-argument insert() does.  Note that the first
+       *  parameter is only a hint and can potentially improve the
+       *  performance of the insertion process.  A bad hint would
+       *  cause no gains in efficiency.
+       *
+       *  See
+       *  http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
+       *  for more on @a hinting.
+       *
+       *  Insertion requires logarithmic time (if the hint is not taken).
+       */
+      iterator
+      insert(iterator __position, const value_type& __x)
+      { return _M_t._M_insert_unique_(__position, __x); }
+
+      /**
+       *  @brief Template function that attempts to insert a range of elements.
+       *  @param  first  Iterator pointing to the start of the range to be
+       *                 inserted.
+       *  @param  last  Iterator pointing to the end of the range.
+       *
+       *  Complexity similar to that of the range constructor.
+       */
+      template<typename _InputIterator>
+        void
+        insert(_InputIterator __first, _InputIterator __last)
+        { _M_t._M_insert_unique(__first, __last); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      // _GLIBCXX_RESOLVE_LIB_DEFECTS
+      // DR 130. Associative erase should return an iterator.
+      /**
+       *  @brief Erases an element from a %map.
+       *  @param  position  An iterator pointing to the element to be erased.
+       *  @return An iterator pointing to the element immediately following
+       *          @a position prior to the element being erased. If no such 
+       *          element exists, end() is returned.
+       *
+       *  This function erases an element, pointed to by the given
+       *  iterator, from a %map.  Note that this function only erases
+       *  the element, and that if the element is itself a pointer,
+       *  the pointed-to memory is not touched in any way.  Managing
+       *  the pointer is the user's responsibility.
+       */
+      iterator
+      erase(iterator __position)
+      { return _M_t.erase(__position); }
+#else
+      /**
+       *  @brief Erases an element from a %map.
+       *  @param  position  An iterator pointing to the element to be erased.
+       *
+       *  This function erases an element, pointed to by the given
+       *  iterator, from a %map.  Note that this function only erases
+       *  the element, and that if the element is itself a pointer,
+       *  the pointed-to memory is not touched in any way.  Managing
+       *  the pointer is the user's responsibility.
+       */
+      void
+      erase(iterator __position)
+      { _M_t.erase(__position); }
+#endif
+
+      /**
+       *  @brief Erases elements according to the provided key.
+       *  @param  x  Key of element to be erased.
+       *  @return  The number of elements erased.
+       *
+       *  This function erases all the elements located by the given key from
+       *  a %map.
+       *  Note that this function only erases the element, and that if
+       *  the element is itself a pointer, the pointed-to memory is not touched
+       *  in any way.  Managing the pointer is the user's responsibility.
+       */
+      size_type
+      erase(const key_type& __x)
+      { return _M_t.erase(__x); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      // _GLIBCXX_RESOLVE_LIB_DEFECTS
+      // DR 130. Associative erase should return an iterator.
+      /**
+       *  @brief Erases a [first,last) range of elements from a %map.
+       *  @param  first  Iterator pointing to the start of the range to be
+       *                 erased.
+       *  @param  last  Iterator pointing to the end of the range to be erased.
+       *  @return The iterator @a last.
+       *
+       *  This function erases a sequence of elements from a %map.
+       *  Note that this function only erases the element, and that if
+       *  the element is itself a pointer, the pointed-to memory is not touched
+       *  in any way.  Managing the pointer is the user's responsibility.
+       */
+      iterator
+      erase(iterator __first, iterator __last)
+      { return _M_t.erase(__first, __last); }
+#else
+      /**
+       *  @brief Erases a [first,last) range of elements from a %map.
+       *  @param  first  Iterator pointing to the start of the range to be
+       *                 erased.
+       *  @param  last  Iterator pointing to the end of the range to be erased.
+       *
+       *  This function erases a sequence of elements from a %map.
+       *  Note that this function only erases the element, and that if
+       *  the element is itself a pointer, the pointed-to memory is not touched
+       *  in any way.  Managing the pointer is the user's responsibility.
+       */
+      void
+      erase(iterator __first, iterator __last)
+      { _M_t.erase(__first, __last); }
+#endif
+
+      /**
+       *  @brief  Swaps data with another %map.
+       *  @param  x  A %map of the same element and allocator types.
+       *
+       *  This exchanges the elements between two maps in constant
+       *  time.  (It is only swapping a pointer, an integer, and an
+       *  instance of the @c Compare type (which itself is often
+       *  stateless and empty), so it should be quite fast.)  Note
+       *  that the global std::swap() function is specialized such
+       *  that std::swap(m1,m2) will feed to this function.
+       */
+      void
+      swap(map& __x)
+      { _M_t.swap(__x._M_t); }
+
+      /**
+       *  Erases all elements in a %map.  Note that this function only
+       *  erases the elements, and that if the elements themselves are
+       *  pointers, the pointed-to memory is not touched in any way.
+       *  Managing the pointer is the user's responsibility.
+       */
+      void
+      clear()
+      { _M_t.clear(); }
+
+      // observers
+      /**
+       *  Returns the key comparison object out of which the %map was
+       *  constructed.
+       */
+      key_compare
+      key_comp() const
+      { return _M_t.key_comp(); }
+
+      /**
+       *  Returns a value comparison object, built from the key comparison
+       *  object out of which the %map was constructed.
+       */
+      value_compare
+      value_comp() const
+      { return value_compare(_M_t.key_comp()); }
+
+      // [23.3.1.3] map operations
+      /**
+       *  @brief Tries to locate an element in a %map.
+       *  @param  x  Key of (key, value) %pair to be located.
+       *  @return  Iterator pointing to sought-after element, or end() if not
+       *           found.
+       *
+       *  This function takes a key and tries to locate the element with which
+       *  the key matches.  If successful the function returns an iterator
+       *  pointing to the sought after %pair.  If unsuccessful it returns the
+       *  past-the-end ( @c end() ) iterator.
+       */
+      iterator
+      find(const key_type& __x)
+      { return _M_t.find(__x); }
+
+      /**
+       *  @brief Tries to locate an element in a %map.
+       *  @param  x  Key of (key, value) %pair to be located.
+       *  @return  Read-only (constant) iterator pointing to sought-after
+       *           element, or end() if not found.
+       *
+       *  This function takes a key and tries to locate the element with which
+       *  the key matches.  If successful the function returns a constant
+       *  iterator pointing to the sought after %pair. If unsuccessful it
+       *  returns the past-the-end ( @c end() ) iterator.
+       */
+      const_iterator
+      find(const key_type& __x) const
+      { return _M_t.find(__x); }
+
+      /**
+       *  @brief  Finds the number of elements with given key.
+       *  @param  x  Key of (key, value) pairs to be located.
+       *  @return  Number of elements with specified key.
+       *
+       *  This function only makes sense for multimaps; for map the result will
+       *  either be 0 (not present) or 1 (present).
+       */
+      size_type
+      count(const key_type& __x) const
+      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
+
+      /**
+       *  @brief Finds the beginning of a subsequence matching given key.
+       *  @param  x  Key of (key, value) pair to be located.
+       *  @return  Iterator pointing to first element equal to or greater
+       *           than key, or end().
+       *
+       *  This function returns the first element of a subsequence of elements
+       *  that matches the given key.  If unsuccessful it returns an iterator
+       *  pointing to the first element that has a greater value than given key
+       *  or end() if no such element exists.
+       */
+      iterator
+      lower_bound(const key_type& __x)
+      { return _M_t.lower_bound(__x); }
+
+      /**
+       *  @brief Finds the beginning of a subsequence matching given key.
+       *  @param  x  Key of (key, value) pair to be located.
+       *  @return  Read-only (constant) iterator pointing to first element
+       *           equal to or greater than key, or end().
+       *
+       *  This function returns the first element of a subsequence of elements
+       *  that matches the given key.  If unsuccessful it returns an iterator
+       *  pointing to the first element that has a greater value than given key
+       *  or end() if no such element exists.
+       */
+      const_iterator
+      lower_bound(const key_type& __x) const
+      { return _M_t.lower_bound(__x); }
+
+      /**
+       *  @brief Finds the end of a subsequence matching given key.
+       *  @param  x  Key of (key, value) pair to be located.
+       *  @return Iterator pointing to the first element
+       *          greater than key, or end().
+       */
+      iterator
+      upper_bound(const key_type& __x)
+      { return _M_t.upper_bound(__x); }
+
+      /**
+       *  @brief Finds the end of a subsequence matching given key.
+       *  @param  x  Key of (key, value) pair to be located.
+       *  @return  Read-only (constant) iterator pointing to first iterator
+       *           greater than key, or end().
+       */
+      const_iterator
+      upper_bound(const key_type& __x) const
+      { return _M_t.upper_bound(__x); }
+
+      /**
+       *  @brief Finds a subsequence matching given key.
+       *  @param  x  Key of (key, value) pairs to be located.
+       *  @return  Pair of iterators that possibly points to the subsequence
+       *           matching given key.
+       *
+       *  This function is equivalent to
+       *  @code
+       *    std::make_pair(c.lower_bound(val),
+       *                   c.upper_bound(val))
+       *  @endcode
+       *  (but is faster than making the calls separately).
+       *
+       *  This function probably only makes sense for multimaps.
+       */
+      std::pair<iterator, iterator>
+      equal_range(const key_type& __x)
+      { return _M_t.equal_range(__x); }
+
+      /**
+       *  @brief Finds a subsequence matching given key.
+       *  @param  x  Key of (key, value) pairs to be located.
+       *  @return  Pair of read-only (constant) iterators that possibly points
+       *           to the subsequence matching given key.
+       *
+       *  This function is equivalent to
+       *  @code
+       *    std::make_pair(c.lower_bound(val),
+       *                   c.upper_bound(val))
+       *  @endcode
+       *  (but is faster than making the calls separately).
+       *
+       *  This function probably only makes sense for multimaps.
+       */
+      std::pair<const_iterator, const_iterator>
+      equal_range(const key_type& __x) const
+      { return _M_t.equal_range(__x); }
+
+      template<typename _K1, typename _T1, typename _C1, typename _A1>
+        friend bool
+        operator==(const map<_K1, _T1, _C1, _A1>&,
+		   const map<_K1, _T1, _C1, _A1>&);
+
+      template<typename _K1, typename _T1, typename _C1, typename _A1>
+        friend bool
+        operator<(const map<_K1, _T1, _C1, _A1>&,
+		  const map<_K1, _T1, _C1, _A1>&);
+    };
+
+  /**
+   *  @brief  Map equality comparison.
+   *  @param  x  A %map.
+   *  @param  y  A %map of the same type as @a x.
+   *  @return  True iff the size and elements of the maps are equal.
+   *
+   *  This is an equivalence relation.  It is linear in the size of the
+   *  maps.  Maps are considered equivalent if their sizes are equal,
+   *  and if corresponding elements compare equal.
+  */
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline bool
+    operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,
+               const map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { return __x._M_t == __y._M_t; }
+
+  /**
+   *  @brief  Map ordering relation.
+   *  @param  x  A %map.
+   *  @param  y  A %map of the same type as @a x.
+   *  @return  True iff @a x is lexicographically less than @a y.
+   *
+   *  This is a total ordering relation.  It is linear in the size of the
+   *  maps.  The elements must be comparable with @c <.
+   *
+   *  See std::lexicographical_compare() for how the determination is made.
+  */
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline bool
+    operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
+              const map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { return __x._M_t < __y._M_t; }
+
+  /// Based on operator==
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline bool
+    operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
+               const map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { return !(__x == __y); }
+
+  /// Based on operator<
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline bool
+    operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,
+              const map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { return __y < __x; }
+
+  /// Based on operator<
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline bool
+    operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
+               const map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { return !(__y < __x); }
+
+  /// Based on operator<
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline bool
+    operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
+               const map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { return !(__x < __y); }
+
+  /// See std::map::swap().
+  template<typename _Key, typename _Tp, typename _Compare, typename _Alloc>
+    inline void
+    swap(map<_Key, _Tp, _Compare, _Alloc>& __x,
+	 map<_Key, _Tp, _Compare, _Alloc>& __y)
+    { __x.swap(__y); }
+
+_GLIBCXX_END_NESTED_NAMESPACE
+
+#endif /* _STL_MAP_H */
diff --git a/tests/file-tests/db/h/stl_map.h.source.txt b/tests/file-tests/db/h/stl_map.h.source.txt
new file mode 100644
index 0000000..6a421f2
--- /dev/null
+++ b/tests/file-tests/db/h/stl_map.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: libstdc++-devel
+LICENSE: GPLv3+
diff --git a/tests/file-tests/db/h/stl_queue.h b/tests/file-tests/db/h/stl_queue.h
new file mode 100644
index 0000000..058f1b6
--- /dev/null
+++ b/tests/file-tests/db/h/stl_queue.h
@@ -0,0 +1,564 @@
+// Queue implementation -*- C++ -*-
+
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
+// Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, 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 General Public License for more details.
+
+// Under Section 7 of GPL version 3, you are granted additional
+// permissions described in the GCC Runtime Library Exception, version
+// 3.1, as published by the Free Software Foundation.
+
+// You should have received a copy of the GNU General Public License and
+// a copy of the GCC Runtime Library Exception along with this program;
+// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+// <http://www.gnu.org/licenses/>.
+
+/*
+ *
+ * Copyright (c) 1994
+ * Hewlett-Packard Company
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Hewlett-Packard Company makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ *
+ *
+ * Copyright (c) 1996,1997
+ * Silicon Graphics Computer Systems, Inc.
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Silicon Graphics makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ */
+
+/** @file stl_queue.h
+ *  This is an internal header file, included by other library headers.
+ *  You should not attempt to use it directly.
+ */
+
+#ifndef _STL_QUEUE_H
+#define _STL_QUEUE_H 1
+
+#include <bits/concept_check.h>
+#include <debug/debug.h>
+
+_GLIBCXX_BEGIN_NAMESPACE(std)
+
+  /**
+   *  @brief  A standard container giving FIFO behavior.
+   *
+   *  @ingroup sequences
+   *
+   *  Meets many of the requirements of a
+   *  <a href="tables.html#65">container</a>,
+   *  but does not define anything to do with iterators.  Very few of the
+   *  other standard container interfaces are defined.
+   *
+   *  This is not a true container, but an @e adaptor.  It holds another
+   *  container, and provides a wrapper interface to that container.  The
+   *  wrapper is what enforces strict first-in-first-out %queue behavior.
+   *
+   *  The second template parameter defines the type of the underlying
+   *  sequence/container.  It defaults to std::deque, but it can be any type
+   *  that supports @c front, @c back, @c push_back, and @c pop_front,
+   *  such as std::list or an appropriate user-defined type.
+   *
+   *  Members not found in @a normal containers are @c container_type,
+   *  which is a typedef for the second Sequence parameter, and @c push and
+   *  @c pop, which are standard %queue/FIFO operations.
+  */
+  template<typename _Tp, typename _Sequence = deque<_Tp> >
+    class queue
+    {
+      // concept requirements
+      typedef typename _Sequence::value_type _Sequence_value_type;
+      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
+      __glibcxx_class_requires(_Sequence, _FrontInsertionSequenceConcept)
+      __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
+      __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
+
+      template<typename _Tp1, typename _Seq1>
+        friend bool
+        operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
+
+      template<typename _Tp1, typename _Seq1>
+        friend bool
+        operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
+
+    public:
+      typedef typename _Sequence::value_type                value_type;
+      typedef typename _Sequence::reference                 reference;
+      typedef typename _Sequence::const_reference           const_reference;
+      typedef typename _Sequence::size_type                 size_type;
+      typedef          _Sequence                            container_type;
+
+    protected:
+      /**
+       *  'c' is the underlying container.  Maintainers wondering why
+       *  this isn't uglified as per style guidelines should note that
+       *  this name is specified in the standard, [23.2.3.1].  (Why?
+       *  Presumably for the same reason that it's protected instead
+       *  of private: to allow derivation.  But none of the other
+       *  containers allow for derivation.  Odd.)
+       */
+      _Sequence c;
+
+    public:
+      /**
+       *  @brief  Default constructor creates no elements.
+       */
+#ifndef __GXX_EXPERIMENTAL_CXX0X__
+      explicit
+      queue(const _Sequence& __c = _Sequence())
+      : c(__c) { }
+#else
+      explicit
+      queue(const _Sequence& __c)
+      : c(__c) { }
+
+      explicit
+      queue(_Sequence&& __c = _Sequence())
+      : c(std::move(__c)) { }
+
+      queue(queue&& __q)
+      : c(std::move(__q.c)) { }
+
+      queue&
+      operator=(queue&& __q)
+      {
+	c = std::move(__q.c);
+	return *this;
+      }
+#endif
+
+      /**
+       *  Returns true if the %queue is empty.
+       */
+      bool
+      empty() const
+      { return c.empty(); }
+
+      /**  Returns the number of elements in the %queue.  */
+      size_type
+      size() const
+      { return c.size(); }
+
+      /**
+       *  Returns a read/write reference to the data at the first
+       *  element of the %queue.
+       */
+      reference
+      front()
+      {
+	__glibcxx_requires_nonempty();
+	return c.front();
+      }
+
+      /**
+       *  Returns a read-only (constant) reference to the data at the first
+       *  element of the %queue.
+       */
+      const_reference
+      front() const
+      {
+	__glibcxx_requires_nonempty();
+	return c.front();
+      }
+
+      /**
+       *  Returns a read/write reference to the data at the last
+       *  element of the %queue.
+       */
+      reference
+      back()
+      {
+	__glibcxx_requires_nonempty();
+	return c.back();
+      }
+
+      /**
+       *  Returns a read-only (constant) reference to the data at the last
+       *  element of the %queue.
+       */
+      const_reference
+      back() const
+      {
+	__glibcxx_requires_nonempty();
+	return c.back();
+      }
+
+      /**
+       *  @brief  Add data to the end of the %queue.
+       *  @param  x  Data to be added.
+       *
+       *  This is a typical %queue operation.  The function creates an
+       *  element at the end of the %queue and assigns the given data
+       *  to it.  The time complexity of the operation depends on the
+       *  underlying sequence.
+       */
+      void
+      push(const value_type& __x)
+      { c.push_back(__x); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      void
+      push(value_type&& __x)
+      { c.push_back(std::move(__x)); }
+
+      template<typename... _Args>
+        void
+        emplace(_Args&&... __args)
+	{ c.emplace_back(std::forward<_Args>(__args)...); }
+#endif
+
+      /**
+       *  @brief  Removes first element.
+       *
+       *  This is a typical %queue operation.  It shrinks the %queue by one.
+       *  The time complexity of the operation depends on the underlying
+       *  sequence.
+       *
+       *  Note that no data is returned, and if the first element's
+       *  data is needed, it should be retrieved before pop() is
+       *  called.
+       */
+      void
+      pop()
+      {
+	__glibcxx_requires_nonempty();
+	c.pop_front();
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      void
+      swap(queue& __q)
+      { c.swap(__q.c); }
+#endif
+    };
+
+  /**
+   *  @brief  Queue equality comparison.
+   *  @param  x  A %queue.
+   *  @param  y  A %queue of the same type as @a x.
+   *  @return  True iff the size and elements of the queues are equal.
+   *
+   *  This is an equivalence relation.  Complexity and semantics depend on the
+   *  underlying sequence type, but the expected rules are:  this relation is
+   *  linear in the size of the sequences, and queues are considered equivalent
+   *  if their sequences compare equal.
+  */
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
+    { return __x.c == __y.c; }
+
+  /**
+   *  @brief  Queue ordering relation.
+   *  @param  x  A %queue.
+   *  @param  y  A %queue of the same type as @a x.
+   *  @return  True iff @a x is lexicographically less than @a y.
+   *
+   *  This is an total ordering relation.  Complexity and semantics
+   *  depend on the underlying sequence type, but the expected rules
+   *  are: this relation is linear in the size of the sequences, the
+   *  elements must be comparable with @c <, and
+   *  std::lexicographical_compare() is usually used to make the
+   *  determination.
+  */
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
+    { return __x.c < __y.c; }
+
+  /// Based on operator==
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
+    { return !(__x == __y); }
+
+  /// Based on operator<
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
+    { return __y < __x; }
+
+  /// Based on operator<
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
+    { return !(__y < __x); }
+
+  /// Based on operator<
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
+    { return !(__x < __y); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _Tp, typename _Seq>
+    inline void
+    swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y)
+    { __x.swap(__y); }
+#endif
+
+  /**
+   *  @brief  A standard container automatically sorting its contents.
+   *
+   *  @ingroup sequences
+   *
+   *  This is not a true container, but an @e adaptor.  It holds
+   *  another container, and provides a wrapper interface to that
+   *  container.  The wrapper is what enforces priority-based sorting 
+   *  and %queue behavior.  Very few of the standard container/sequence
+   *  interface requirements are met (e.g., iterators).
+   *
+   *  The second template parameter defines the type of the underlying
+   *  sequence/container.  It defaults to std::vector, but it can be
+   *  any type that supports @c front(), @c push_back, @c pop_back,
+   *  and random-access iterators, such as std::deque or an
+   *  appropriate user-defined type.
+   *
+   *  The third template parameter supplies the means of making
+   *  priority comparisons.  It defaults to @c less<value_type> but
+   *  can be anything defining a strict weak ordering.
+   *
+   *  Members not found in @a normal containers are @c container_type,
+   *  which is a typedef for the second Sequence parameter, and @c
+   *  push, @c pop, and @c top, which are standard %queue operations.
+   *
+   *  @note No equality/comparison operators are provided for
+   *  %priority_queue.
+   *
+   *  @note Sorting of the elements takes place as they are added to,
+   *  and removed from, the %priority_queue using the
+   *  %priority_queue's member functions.  If you access the elements
+   *  by other means, and change their data such that the sorting
+   *  order would be different, the %priority_queue will not re-sort
+   *  the elements for you.  (How could it know to do so?)
+  */
+  template<typename _Tp, typename _Sequence = vector<_Tp>,
+	   typename _Compare  = less<typename _Sequence::value_type> >
+    class priority_queue
+    {
+      // concept requirements
+      typedef typename _Sequence::value_type _Sequence_value_type;
+      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
+      __glibcxx_class_requires(_Sequence, _SequenceConcept)
+      __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept)
+      __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
+      __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp,
+				_BinaryFunctionConcept)
+
+    public:
+      typedef typename _Sequence::value_type                value_type;
+      typedef typename _Sequence::reference                 reference;
+      typedef typename _Sequence::const_reference           const_reference;
+      typedef typename _Sequence::size_type                 size_type;
+      typedef          _Sequence                            container_type;
+
+    protected:
+      //  See queue::c for notes on these names.
+      _Sequence  c;
+      _Compare   comp;
+
+    public:
+      /**
+       *  @brief  Default constructor creates no elements.
+       */
+#ifndef __GXX_EXPERIMENTAL_CXX0X__
+      explicit
+      priority_queue(const _Compare& __x = _Compare(),
+		     const _Sequence& __s = _Sequence())
+      : c(__s), comp(__x)
+      { std::make_heap(c.begin(), c.end(), comp); }
+#else
+      explicit
+      priority_queue(const _Compare& __x,
+		     const _Sequence& __s)
+      : c(__s), comp(__x)
+      { std::make_heap(c.begin(), c.end(), comp); }
+
+      explicit
+      priority_queue(const _Compare& __x = _Compare(),
+		     _Sequence&& __s = _Sequence())
+      : c(std::move(__s)), comp(__x)
+      { std::make_heap(c.begin(), c.end(), comp); }
+#endif
+
+      /**
+       *  @brief  Builds a %queue from a range.
+       *  @param  first  An input iterator.
+       *  @param  last  An input iterator.
+       *  @param  x  A comparison functor describing a strict weak ordering.
+       *  @param  s  An initial sequence with which to start.
+       *
+       *  Begins by copying @a s, inserting a copy of the elements
+       *  from @a [first,last) into the copy of @a s, then ordering
+       *  the copy according to @a x.
+       *
+       *  For more information on function objects, see the
+       *  documentation on @link functors functor base
+       *  classes@endlink.
+       */
+#ifndef __GXX_EXPERIMENTAL_CXX0X__
+      template<typename _InputIterator>
+        priority_queue(_InputIterator __first, _InputIterator __last,
+		       const _Compare& __x = _Compare(),
+		       const _Sequence& __s = _Sequence())
+	: c(__s), comp(__x)
+        {
+	  __glibcxx_requires_valid_range(__first, __last);
+	  c.insert(c.end(), __first, __last);
+	  std::make_heap(c.begin(), c.end(), comp);
+	}
+#else
+      template<typename _InputIterator>
+        priority_queue(_InputIterator __first, _InputIterator __last,
+		       const _Compare& __x,
+		       const _Sequence& __s)
+	: c(__s), comp(__x)
+        {
+	  __glibcxx_requires_valid_range(__first, __last);
+	  c.insert(c.end(), __first, __last);
+	  std::make_heap(c.begin(), c.end(), comp);
+	}
+
+      template<typename _InputIterator>
+        priority_queue(_InputIterator __first, _InputIterator __last,
+		       const _Compare& __x = _Compare(),
+		       _Sequence&& __s = _Sequence())
+	: c(std::move(__s)), comp(__x)
+        {
+	  __glibcxx_requires_valid_range(__first, __last);
+	  c.insert(c.end(), __first, __last);
+	  std::make_heap(c.begin(), c.end(), comp);
+	}
+
+      priority_queue(priority_queue&& __pq)
+      : c(std::move(__pq.c)), comp(std::move(__pq.comp)) { }
+
+      priority_queue&
+      operator=(priority_queue&& __pq)
+      {
+	c = std::move(__pq.c);
+	comp = std::move(__pq.comp);
+	return *this;
+      }
+#endif
+
+      /**
+       *  Returns true if the %queue is empty.
+       */
+      bool
+      empty() const
+      { return c.empty(); }
+
+      /**  Returns the number of elements in the %queue.  */
+      size_type
+      size() const
+      { return c.size(); }
+
+      /**
+       *  Returns a read-only (constant) reference to the data at the first
+       *  element of the %queue.
+       */
+      const_reference
+      top() const
+      {
+	__glibcxx_requires_nonempty();
+	return c.front();
+      }
+
+      /**
+       *  @brief  Add data to the %queue.
+       *  @param  x  Data to be added.
+       *
+       *  This is a typical %queue operation.
+       *  The time complexity of the operation depends on the underlying
+       *  sequence.
+       */
+      void
+      push(const value_type& __x)
+      {
+	c.push_back(__x);
+	std::push_heap(c.begin(), c.end(), comp);
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      void
+      push(value_type&& __x)
+      {
+	c.push_back(std::move(__x));
+	std::push_heap(c.begin(), c.end(), comp);
+      }
+
+      template<typename... _Args>
+        void
+        emplace(_Args&&... __args)
+	{
+	  c.emplace_back(std::forward<_Args>(__args)...);
+	  std::push_heap(c.begin(), c.end(), comp);
+	}
+#endif
+
+      /**
+       *  @brief  Removes first element.
+       *
+       *  This is a typical %queue operation.  It shrinks the %queue
+       *  by one.  The time complexity of the operation depends on the
+       *  underlying sequence.
+       *
+       *  Note that no data is returned, and if the first element's
+       *  data is needed, it should be retrieved before pop() is
+       *  called.
+       */
+      void
+      pop()
+      {
+	__glibcxx_requires_nonempty();
+	std::pop_heap(c.begin(), c.end(), comp);
+	c.pop_back();
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      void
+      swap(priority_queue& __pq)
+      {
+	using std::swap;
+	c.swap(__pq.c);
+	swap(comp, __pq.comp);
+      }
+#endif
+    };
+
+  // No equality/comparison operators are provided for priority_queue.
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _Tp, typename _Sequence, typename _Compare>
+    inline void
+    swap(priority_queue<_Tp, _Sequence, _Compare>& __x,
+	 priority_queue<_Tp, _Sequence, _Compare>& __y)
+    { __x.swap(__y); }
+#endif
+
+_GLIBCXX_END_NAMESPACE
+
+#endif /* _STL_QUEUE_H */
diff --git a/tests/file-tests/db/h/stl_queue.h.source.txt b/tests/file-tests/db/h/stl_queue.h.source.txt
new file mode 100644
index 0000000..6a421f2
--- /dev/null
+++ b/tests/file-tests/db/h/stl_queue.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: libstdc++-devel
+LICENSE: GPLv3+
diff --git a/tests/file-tests/db/h/stl_stack.h b/tests/file-tests/db/h/stl_stack.h
new file mode 100644
index 0000000..26f50ad
--- /dev/null
+++ b/tests/file-tests/db/h/stl_stack.h
@@ -0,0 +1,289 @@
+// Stack implementation -*- C++ -*-
+
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
+// Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, 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 General Public License for more details.
+
+// Under Section 7 of GPL version 3, you are granted additional
+// permissions described in the GCC Runtime Library Exception, version
+// 3.1, as published by the Free Software Foundation.
+
+// You should have received a copy of the GNU General Public License and
+// a copy of the GCC Runtime Library Exception along with this program;
+// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+// <http://www.gnu.org/licenses/>.
+
+/*
+ *
+ * Copyright (c) 1994
+ * Hewlett-Packard Company
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Hewlett-Packard Company makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ *
+ *
+ * Copyright (c) 1996,1997
+ * Silicon Graphics Computer Systems, Inc.
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Silicon Graphics makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ */
+
+/** @file stl_stack.h
+ *  This is an internal header file, included by other library headers.
+ *  You should not attempt to use it directly.
+ */
+
+#ifndef _STL_STACK_H
+#define _STL_STACK_H 1
+
+#include <bits/concept_check.h>
+#include <debug/debug.h>
+
+_GLIBCXX_BEGIN_NAMESPACE(std)
+
+  /**
+   *  @brief  A standard container giving FILO behavior.
+   *
+   *  @ingroup sequences
+   *
+   *  Meets many of the requirements of a
+   *  <a href="tables.html#65">container</a>,
+   *  but does not define anything to do with iterators.  Very few of the
+   *  other standard container interfaces are defined.
+   *
+   *  This is not a true container, but an @e adaptor.  It holds
+   *  another container, and provides a wrapper interface to that
+   *  container.  The wrapper is what enforces strict
+   *  first-in-last-out %stack behavior.
+   *
+   *  The second template parameter defines the type of the underlying
+   *  sequence/container.  It defaults to std::deque, but it can be
+   *  any type that supports @c back, @c push_back, and @c pop_front,
+   *  such as std::list, std::vector, or an appropriate user-defined
+   *  type.
+   *
+   *  Members not found in @a normal containers are @c container_type,
+   *  which is a typedef for the second Sequence parameter, and @c
+   *  push, @c pop, and @c top, which are standard %stack/FILO
+   *  operations.
+  */
+  template<typename _Tp, typename _Sequence = deque<_Tp> >
+    class stack
+    {
+      // concept requirements
+      typedef typename _Sequence::value_type _Sequence_value_type;
+      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
+      __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
+      __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
+
+      template<typename _Tp1, typename _Seq1>
+        friend bool
+        operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
+
+      template<typename _Tp1, typename _Seq1>
+        friend bool
+        operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
+
+    public:
+      typedef typename _Sequence::value_type                value_type;
+      typedef typename _Sequence::reference                 reference;
+      typedef typename _Sequence::const_reference           const_reference;
+      typedef typename _Sequence::size_type                 size_type;
+      typedef          _Sequence                            container_type;
+
+    protected:
+      //  See queue::c for notes on this name.
+      _Sequence c;
+
+    public:
+      // XXX removed old def ctor, added def arg to this one to match 14882
+      /**
+       *  @brief  Default constructor creates no elements.
+       */
+#ifndef __GXX_EXPERIMENTAL_CXX0X__
+      explicit
+      stack(const _Sequence& __c = _Sequence())
+      : c(__c) { }
+#else
+      explicit
+      stack(const _Sequence& __c)
+      : c(__c) { }
+
+      explicit
+      stack(_Sequence&& __c = _Sequence())
+      : c(std::move(__c)) { }
+#endif
+
+      /**
+       *  Returns true if the %stack is empty.
+       */
+      bool
+      empty() const
+      { return c.empty(); }
+
+      /**  Returns the number of elements in the %stack.  */
+      size_type
+      size() const
+      { return c.size(); }
+
+      /**
+       *  Returns a read/write reference to the data at the first
+       *  element of the %stack.
+       */
+      reference
+      top()
+      {
+	__glibcxx_requires_nonempty();
+	return c.back();
+      }
+
+      /**
+       *  Returns a read-only (constant) reference to the data at the first
+       *  element of the %stack.
+       */
+      const_reference
+      top() const
+      {
+	__glibcxx_requires_nonempty();
+	return c.back();
+      }
+
+      /**
+       *  @brief  Add data to the top of the %stack.
+       *  @param  x  Data to be added.
+       *
+       *  This is a typical %stack operation.  The function creates an
+       *  element at the top of the %stack and assigns the given data
+       *  to it.  The time complexity of the operation depends on the
+       *  underlying sequence.
+       */
+      void
+      push(const value_type& __x)
+      { c.push_back(__x); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      void
+      push(value_type&& __x)
+      { c.push_back(std::move(__x)); }
+
+      template<typename... _Args>
+        void
+        emplace(_Args&&... __args)
+	{ c.emplace_back(std::forward<_Args>(__args)...); }
+#endif
+
+      /**
+       *  @brief  Removes first element.
+       *
+       *  This is a typical %stack operation.  It shrinks the %stack
+       *  by one.  The time complexity of the operation depends on the
+       *  underlying sequence.
+       *
+       *  Note that no data is returned, and if the first element's
+       *  data is needed, it should be retrieved before pop() is
+       *  called.
+       */
+      void
+      pop()
+      {
+	__glibcxx_requires_nonempty();
+	c.pop_back();
+      }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+      void
+      swap(stack& __s)
+      { c.swap(__s.c); }
+#endif
+    };
+
+  /**
+   *  @brief  Stack equality comparison.
+   *  @param  x  A %stack.
+   *  @param  y  A %stack of the same type as @a x.
+   *  @return  True iff the size and elements of the stacks are equal.
+   *
+   *  This is an equivalence relation.  Complexity and semantics
+   *  depend on the underlying sequence type, but the expected rules
+   *  are: this relation is linear in the size of the sequences, and
+   *  stacks are considered equivalent if their sequences compare
+   *  equal.
+  */
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
+    { return __x.c == __y.c; }
+
+  /**
+   *  @brief  Stack ordering relation.
+   *  @param  x  A %stack.
+   *  @param  y  A %stack of the same type as @a x.
+   *  @return  True iff @a x is lexicographically less than @a y.
+   *
+   *  This is an total ordering relation.  Complexity and semantics
+   *  depend on the underlying sequence type, but the expected rules
+   *  are: this relation is linear in the size of the sequences, the
+   *  elements must be comparable with @c <, and
+   *  std::lexicographical_compare() is usually used to make the
+   *  determination.
+  */
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
+    { return __x.c < __y.c; }
+
+  /// Based on operator==
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
+    { return !(__x == __y); }
+
+  /// Based on operator<
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
+    { return __y < __x; }
+
+  /// Based on operator<
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
+    { return !(__y < __x); }
+
+  /// Based on operator<
+  template<typename _Tp, typename _Seq>
+    inline bool
+    operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
+    { return !(__x < __y); }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+  template<typename _Tp, typename _Seq>
+    inline void
+    swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y)
+    { __x.swap(__y); }
+#endif
+
+_GLIBCXX_END_NAMESPACE
+
+#endif /* _STL_STACK_H */
diff --git a/tests/file-tests/db/h/stl_stack.h.source.txt b/tests/file-tests/db/h/stl_stack.h.source.txt
new file mode 100644
index 0000000..6a421f2
--- /dev/null
+++ b/tests/file-tests/db/h/stl_stack.h.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: libstdc++-devel
+LICENSE: GPLv3+
diff --git a/tests/file-tests/db/hlp/biochlr2.hlp b/tests/file-tests/db/hlp/biochlr2.hlp
new file mode 100644
index 0000000..5cd210d
Binary files /dev/null and b/tests/file-tests/db/hlp/biochlr2.hlp differ
diff --git a/tests/file-tests/db/hlp/biochlr2.hlp.source.txt b/tests/file-tests/db/hlp/biochlr2.hlp.source.txt
new file mode 100644
index 0000000..2a6b354
--- /dev/null
+++ b/tests/file-tests/db/hlp/biochlr2.hlp.source.txt
@@ -0,0 +1,3 @@
+http://ce540.groups.et.byu.net/syllabus/biox.htm
+original file name: BIOCHLR2.HLP
+BIOSCREEN and BIOCHLOR are public domain programs
diff --git a/tests/file-tests/db/hta/access.hta b/tests/file-tests/db/hta/access.hta
new file mode 100644
index 0000000..cef0f93
--- /dev/null
+++ b/tests/file-tests/db/hta/access.hta
@@ -0,0 +1,132 @@
+<HTML>
+<HEAD>
+<TITLE>Access 2000 Viewer</TITLE>
+<HTA:APPLICATION ID=oHTA>
+<SCRIPT LANGUAGE="VBScript">
+Option Explicit
+
+Dim gstrDatabase
+
+
+Sub ShowTables()
+Dim strTable
+Dim dbeng
+Dim intCounter
+Dim db
+Dim strHtml
+    On Error Resume Next
+    Set dbeng = CreateObject("DAO.DBEngine.36")
+    Set db = dbeng.OpenDatabase(gstrDatabase, False, True)
+    strHtml = "<b>Tables</b> (non-system):<br>"
+    For intCounter = 0 To db.TableDefs.Count - 1
+        If Left(db.TableDefs(intCounter).Name, 4) <> "MSys" Then
+            strHtml = strHtml & "<a language=vbscript href=# onClick='DisplayTable """ & db.TableDefs(intCounter).Name & """'>" & db.TableDefs(intCounter).Name & "</a><br>"
+        End If
+    Next
+    txtTables.InnerHtml = strHtml
+    strHtml = ""
+    strHtml = strHtml & "<b>Queries</b> (no parameters):<br>"
+    For intCounter = 0 To db.QueryDefs.Count - 1
+        If db.QueryDefs(intCounter).Parameters.Count = 0 Then
+            strHtml = strHtml & "<a language=vbscript href=# onClick='DisplayTable """ & db.QueryDefs(intCounter).Name & """'>" & db.QueryDefs(intCounter).Name & "</a><br>"
+        End If
+    Next
+    txtQueries.InnerHtml = strHtml
+    db.Close
+End Sub
+
+Function DisplayTable(strTableName)
+    txtData.InnerHtml = ""
+    txtData.InnerHtml = ShowTable(strTableName)
+End Function
+
+Function ShowTable(strTable) 'As String
+Dim rs 'As Recordset
+Dim intField 'As Integer
+Dim strData 'As String
+Dim dbeng
+Dim db
+Const dbReadOnly = 4 'DAO.RecordsetOptionEnum
+Const dbOpenSnapshot = 4 'DAO.RecordsetTypeEnum
+    On Error Resume Next
+    Set dbeng = CreateObject("DAO.DBEngine.36")
+    Set db = dbeng.OpenDatabase(gstrDatabase, False, True)
+    Set rs = db.OpenRecordset(strTable, dbOpenSnapshot, , dbReadOnly)
+    If Not(rs.EOF And rs.BOF) Then
+        rs.MoveLast
+        rs.MoveFirst
+        'First send out the column headers
+        strTable = "<table border=1>" & vbCrLf & "<tr>" 
+        For intField = 0 to rs.Fields.Count - 1
+            strTable = strTable & "<th bgcolor=#CCCCCC><b>" & rs.Fields(intField).Name & "</b></th>"
+        Next
+        strTable = strTable & "</tr>" & vbCrLf
+        'Now send out the table body
+        Do until rs.EOF
+            strTable = strTable & "<tr>"
+            For intField = 0 to rs.Fields.Count - 1
+                Err.Clear 
+                strTable = strTable & "<td>" & rs.Fields(intField).Value & "</td>"
+                If Err Then strTable = strTable & "<td>&nbsp;</td>" 
+            Next
+            strTable = strTable & "</tr>" & vbCrLf
+            rs.MoveNext
+        Loop
+        strTable = strTable & "</table>"
+        ShowTable = strTable
+    Else
+        ShowTable = ""
+    End If
+End Function
+
+Function BrowseForFile()
+Dim fs 'As Scripting.FileSystemObject
+Dim ts 'As Scripting.TextStream
+Const ForWriting = 2
+    Set fs = CreateObject("Scripting.FileSystemObject")
+    Set ts = fs.OpenTextFile("C:\~temp.htm", ForWriting, True)
+    ts.WriteLine "<html><head><title>Select MDB File</title></head><body><form>&nbsp;Select MDB File:"
+    ts.WriteLine "<br>&nbsp;<input type=file name=filename>"
+    ts.WriteLine "<br>&nbsp;<input type=button language='vbscript' value='OK'"
+    ts.WriteLine "onclick='Window.returnValue=document.Forms(0).elements(0).value : Window.Close'>"
+    ts.WriteLine "</form></body></html>"
+    ts.Close
+    BrowseForFile = window.showModalDialog("C:\~temp.htm", "", "dialogWidth:300px;dialogHeight:120px")
+    fs.DeleteFile "C:\~temp.htm", True
+End Function
+
+</SCRIPT>
+</HEAD>
+
+<BODY>
+<A href=# language=vbscript onClick=window.location.reload>New Database</a><hr>
+<TABLE border=0 cols=2 width=100%>
+<tr>
+<td valign=top><div id="txtTables"></div></td>
+<td valign=top><div id="txtQueries"></div></td>
+</tr>
+</table>
+<hr>
+
+<div id="txtData"></div>
+
+
+<SCRIPT language=vbscript>
+Dim strTable
+Dim dbeng
+Dim intCounter
+Dim db
+    'First test to see if DAO is current
+    On Error Resume Next
+    Set dbeng = CreateObject("DAO.DBEngine.36")
+    If dbeng Is Nothing Then
+        Window.Alert "You must install DAO version 3.6 (Jet version 4)!"
+        Window.Open "http://www.microsoft.com/data"
+    Else
+        gstrDatabase = BrowseForFile()
+        ShowTables
+    End If
+</script>
+
+</BODY>
+</HTML>
diff --git a/tests/file-tests/db/hta/access.hta.source.txt b/tests/file-tests/db/hta/access.hta.source.txt
new file mode 100644
index 0000000..f8bc564
--- /dev/null
+++ b/tests/file-tests/db/hta/access.hta.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Eric Phelps
+URL: http://www.ericphelps.com/scripting/samples/access.hta
+LICENSE: "It's all free (and worth every penny!)" (from top of http://www.ericphelps.com/ )
diff --git a/tests/file-tests/db/hta/hello_world.hta b/tests/file-tests/db/hta/hello_world.hta
new file mode 100644
index 0000000..0ca7a94
--- /dev/null
+++ b/tests/file-tests/db/hta/hello_world.hta
@@ -0,0 +1,11 @@
+<HTML>
+<HEAD>
+<HTA:APPLICATION ID="HelloExample" 
+   BORDER="thick" 
+   BORDERSTYLE="complex"/>
+<TITLE>HTA - Hello World</TITLE>
+</HEAD>
+<BODY>
+<H2>HTA - Hello World</H2>
+</BODY>
+</HTML>
diff --git a/tests/file-tests/db/hta/hello_world.hta.source.txt b/tests/file-tests/db/hta/hello_world.hta.source.txt
new file mode 100644
index 0000000..1cbbd78
--- /dev/null
+++ b/tests/file-tests/db/hta/hello_world.hta.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Wikipedia
+URL: http://en.wikipedia.org/wiki/HTML_Application
+LICENSE: Creative Commons Attribution-ShareAlike License
diff --git a/tests/file-tests/db/html/index_first4k.html b/tests/file-tests/db/html/index_first4k.html
new file mode 100644
index 0000000..641b669
--- /dev/null
+++ b/tests/file-tests/db/html/index_first4k.html
@@ -0,0 +1,88 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+
+<head>
+<!-- start of server/head-include-1.html -->
+<meta http-equiv="content-type" content="text/html; charset=utf-8" />
+<link rev="made" href="mailto:webmasters@gnu.org" />
+<link rel="icon" type="image/png" href="/graphics/gnu-head-mini.png" />
+<meta name="ICBM" content="42.355469,-71.058627" />
+<meta name="DC.title" content="gnu.org" />
+<!-- end of server/head-include-1.html -->
+
+<!-- end of server/header.html -->
+
+<!-- Parent-Version: 1.76 -->
+
+<title>The GNU Operating System</title>
+
+<meta http-equiv="Keywords" content="GNU, FSF, Free Software Foundation, Linux, Emacs, GCC, Unix, Free Software, Libre Software, Operating System, GNU Kernel, GNU Hurd" />
+<meta http-equiv="Description" content="Since 1983, developing the free Unix style operating system GNU, so that computer users can have the freedom to share and improve the software they use." />
+<link rel="alternate" title="Planet GNU" href="http://planet.gnu.org/rss20.xml" type="application/rss+xml" />
+
+<!-- begin translist file -->
+
+
+<!-- end translist file -->
+
+<!-- start of server/banner.html -->
+<!-- start of head-include-2.html -->
+
+<link rel="stylesheet" href="/combo.css" media="screen" />
+<link rel="stylesheet" href="/layout.css" media="screen" />
+
+<link rel="stylesheet" href="/mini.css" media="handheld" />
+
+<link rel="stylesheet" href="/print.css" media="print" />
+
+<!-- end of head-include-2.html -->
+
+</head>
+<body>
+<!-- start of server/body-include-1.html -->
+
+<div id="toplinks"><a href="#content">Skip to main text</a> |
+<span class="netscape4">
+<a href="#navigation">Skip to navigation</a> |</span>
+<a href="/accessibility/">Accessibility</a></div>
+
+<div id="translations">
+<p>
+<span dir="ltr" class="original"><a lang="en" hreflang="en" href="/home.en.html">English</a>&nbsp;[en]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="ca" hreflang="ca" href="/home.ca.html">català</a>&nbsp;[ca]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="cs" hreflang="cs" href="/home.cs.html">Česky</a>&nbsp;[cs]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="de" hreflang="de" href="/home.de.html">Deutsch</a>&nbsp;[de]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="el" hreflang="el" href="/home.el.html">ελληνικά</a>&nbsp;[el]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="es" hreflang="es" href="/home.es.html">español</a>&nbsp;[es]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="fr" hreflang="fr" href="/home.fr.html">français</a>&nbsp;[fr]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="hr" hreflang="hr" href="/home.hr.html">hrvatski</a>&nbsp;[hr]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="it" hreflang="it" href="/home.it.html">italiano</a>&nbsp;[it]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="ja" hreflang="ja" href="/home.ja.html">日本語</a>&nbsp;[ja]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="ko" hreflang="ko" href="/home.ko.html">한국어</a>&nbsp;[ko]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="nl" hreflang="nl" href="/home.nl.html">Nederlands</a>&nbsp;[nl]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="pl" hreflang="pl" href="/home.pl.html">polski</a>&nbsp;[pl]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="ru" hreflang="ru" href="/home.ru.html">русский</a>&nbsp;[ru]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="sq" hreflang="sq" href="/home.sq.html">Shqip</a>&nbsp;[sq]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="uk" hreflang="uk" href="/home.uk.html">українська</a>&nbsp;[uk]</span>&nbsp;&nbsp;
+<span dir="ltr"><a lang="zh-cn" hreflang="zh-cn" href="/home.zh-cn.html">简体中文</a>&nbsp;[zh-cn]</span>&nbsp;&nbsp;
+</p>
+</div>
+
+<!-- end of server/body-include-1.html -->
+
+
+<div id="null-wrapper">
+
+<!-- start of server/body-include-2 -->
+
+      <div id="header">
+        <div class="inner" style="position: relative;">
+
+        <h1 id="logo"><a href="/">The GNU Operating System</a></h1>
+
+
+
+	<div id="fssbox">
+
+<p id="joinfsftab"><a href="https://www.fsf.org/associate/support_freedom?referrer=4052">Joi
\ No newline at end of file
diff --git a/tests/file-tests/db/html/index_first4k.html.source.txt b/tests/file-tests/db/html/index_first4k.html.source.txt
new file mode 100644
index 0000000..0ca6023
--- /dev/null
+++ b/tests/file-tests/db/html/index_first4k.html.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Free Software Foundation, Inc
+URL: http://www.gnu.org/index.html
+LICENSE: Creative Commons Attribution-NoDerivs 3.0 United States License (http://creativecommons.org/licenses/by-nd/3.0/us/)
diff --git a/tests/file-tests/db/icm/bluish.icc b/tests/file-tests/db/icm/bluish.icc
new file mode 100644
index 0000000..2aa16c4
Binary files /dev/null and b/tests/file-tests/db/icm/bluish.icc differ
diff --git a/tests/file-tests/db/icm/bluish.icc.source.txt b/tests/file-tests/db/icm/bluish.icc.source.txt
new file mode 100644
index 0000000..2d554f8
--- /dev/null
+++ b/tests/file-tests/db/icm/bluish.icc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: colord: /usr/share/color/icc/colord/Bluish.icc
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/icm/sRGB.icm b/tests/file-tests/db/icm/sRGB.icm
new file mode 100644
index 0000000..20a24b8
Binary files /dev/null and b/tests/file-tests/db/icm/sRGB.icm differ
diff --git a/tests/file-tests/db/icm/sRGB.icm.source.txt b/tests/file-tests/db/icm/sRGB.icm.source.txt
new file mode 100644
index 0000000..5caea7a
--- /dev/null
+++ b/tests/file-tests/db/icm/sRGB.icm.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Part of python-imaging-Pillow package
+LICENSE: MIT
diff --git a/tests/file-tests/db/ico/pixel-install.ico b/tests/file-tests/db/ico/pixel-install.ico
new file mode 100755
index 0000000..f2106d6
Binary files /dev/null and b/tests/file-tests/db/ico/pixel-install.ico differ
diff --git a/tests/file-tests/db/ico/pixel-install.ico.source.txt b/tests/file-tests/db/ico/pixel-install.ico.source.txt
new file mode 100644
index 0000000..50b55d2
--- /dev/null
+++ b/tests/file-tests/db/ico/pixel-install.ico.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: https://wiki.powerdns.com/trac/browser/trunk/pdns/pdns/release-scripts/pixel-install.ico?rev=570
+LICENSE: GPLv2
diff --git a/tests/file-tests/db/img/initrd1.img b/tests/file-tests/db/img/initrd1.img
new file mode 100644
index 0000000..cb7183e
Binary files /dev/null and b/tests/file-tests/db/img/initrd1.img differ
diff --git a/tests/file-tests/db/img/initrd1.img.source.txt b/tests/file-tests/db/img/initrd1.img.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/img/initrd1.img.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/img/qcow2.img b/tests/file-tests/db/img/qcow2.img
new file mode 100644
index 0000000..8695fe2
Binary files /dev/null and b/tests/file-tests/db/img/qcow2.img differ
diff --git a/tests/file-tests/db/img/qcow2.img.source.txt b/tests/file-tests/db/img/qcow2.img.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/img/qcow2.img.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/img/qed.img b/tests/file-tests/db/img/qed.img
new file mode 100644
index 0000000..20eb8b7
Binary files /dev/null and b/tests/file-tests/db/img/qed.img differ
diff --git a/tests/file-tests/db/img/qed.img.source.txt b/tests/file-tests/db/img/qed.img.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/img/qed.img.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/img/vdi.img b/tests/file-tests/db/img/vdi.img
new file mode 100644
index 0000000..f62ea47
Binary files /dev/null and b/tests/file-tests/db/img/vdi.img differ
diff --git a/tests/file-tests/db/img/vdi.img.source.txt b/tests/file-tests/db/img/vdi.img.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/img/vdi.img.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/ins/internet_connection_settings.ins b/tests/file-tests/db/ins/internet_connection_settings.ins
new file mode 100644
index 0000000..441347a
--- /dev/null
+++ b/tests/file-tests/db/ins/internet_connection_settings.ins
@@ -0,0 +1,45 @@
+[Entry]
+Entry_Name=Aol
+[Phone]
+Phone_Number=666-666-666
+Dial_As_Is=yes
+[Server]
+Type=PPP
+SW_Compress=no
+PW_Encrypt=no
+Negociate_TCP/IP=yes
+[TCP/IP]
+Specify_IP_Adress=no
+Specify_Server_Address=yes
+IP_Header_Compress=yes
+Gateway_On_Remote=yes
+DNS_Address=205.188.146.146
+DNS_Alt_Address=202.67.95.0
+[User]
+Name=user
+Password=Password
+Display_Password=no
+Requires_Logon=no
+[Internet_Mail]
+Email_Name=user
+Email_Address=user@domain.bla
+POP_Server=pop.mail.bla
+POP_Logon_Name=Logon
+POP_Logon_Password=Password
+SMTP_Server=smtp.mail.bla
+Use_MS_Exchange=no
+[Internet_News]
+NNTP_Server=new.server.bla
+Logon_Required=0
+[URL]
+Home_Page=about:blank
+AutoConfig=0
+NoWelcome=1
+[ConnectionSettings]
+ApplyInsToConnection=Aol
+[Branding]
+Window_Title=Internet Explorer Window Title
+[Mail_Signature]
+Signature_Text=user\nuser@domain.bla
+Use_Mail_For_News=0
+Use_Signature=1
diff --git a/tests/file-tests/db/ins/internet_connection_settings.ins.source.txt b/tests/file-tests/db/ins/internet_connection_settings.ins.source.txt
new file mode 100644
index 0000000..60c00ef
--- /dev/null
+++ b/tests/file-tests/db/ins/internet_connection_settings.ins.source.txt
@@ -0,0 +1,4 @@
+AUTHOR: Christian Herdtweck, Intra2net
+URL: None (self-created)
+LICENSE: public domain
+(created using the INS File Editor by tmallet, http://tmallet.dyndns.org/insfe/)
diff --git a/tests/file-tests/db/ins/setup.ins b/tests/file-tests/db/ins/setup.ins
new file mode 100644
index 0000000..6dbaca3
Binary files /dev/null and b/tests/file-tests/db/ins/setup.ins differ
diff --git a/tests/file-tests/db/ins/setup.ins.source.txt b/tests/file-tests/db/ins/setup.ins.source.txt
new file mode 100644
index 0000000..ad42353
--- /dev/null
+++ b/tests/file-tests/db/ins/setup.ins.source.txt
@@ -0,0 +1,4 @@
+AUTHOR: John Elliott
+LICENSE: GPLv2+
+URL: http://www.seasip.info/Unix/Joyce
+taken from version 2.0.2 for Windows
diff --git a/tests/file-tests/db/iso/x.iso b/tests/file-tests/db/iso/x.iso
new file mode 100644
index 0000000..44b6b94
Binary files /dev/null and b/tests/file-tests/db/iso/x.iso differ
diff --git a/tests/file-tests/db/iso/x.iso.source.txt b/tests/file-tests/db/iso/x.iso.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/iso/x.iso.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/isp/self-created.isp b/tests/file-tests/db/isp/self-created.isp
new file mode 100644
index 0000000..e241caf
--- /dev/null
+++ b/tests/file-tests/db/isp/self-created.isp
@@ -0,0 +1,12 @@
+[ISP INFO]
+PhoneBookFile = MY.ICW
+URLReferral = http://referral.winzigweich.com/refer/refer.dll?
+Sign_Up_EXE = mySignUp.exe
+DUNFile = myDun.dun
+
+[Connection]
+StayConnected = 123:45:67
+
+[URL]
+Signup=about:blank
+Reconnect=about:blank
diff --git a/tests/file-tests/db/isp/self-created.isp.source.txt b/tests/file-tests/db/isp/self-created.isp.source.txt
new file mode 100644
index 0000000..fa9a936
--- /dev/null
+++ b/tests/file-tests/db/isp/self-created.isp.source.txt
@@ -0,0 +1,5 @@
+AUTHOR: Christian Herdtweck
+URL: None (self-created)
+LICENSE: public domain
+
+(based on windows isp files)
diff --git a/tests/file-tests/db/java/CreateMdb.java b/tests/file-tests/db/java/CreateMdb.java
new file mode 100644
index 0000000..d9d2f9f
--- /dev/null
+++ b/tests/file-tests/db/java/CreateMdb.java
@@ -0,0 +1,57 @@
+/** simple script to create a .mdb file for file-test db
+ *
+ * requires library jackcess (http://jackcess.sourceforge.net/)
+ *   and a few more libraries required by jackcess (see 
+ *   http://jackcess.sourceforge.net/dependencies.html
+ *   and http://search.maven.org/#browse ),
+ *   all as jar files within current working dir
+ *
+ * (Currently, ls *.jar returns:
+ *  commons-lang-2.6.jar  commons-logging-1.1.jar  jackcess-2.0.3.jar  
+ *  log4j-1.2.9.jar  poi-3.9.jar)
+ *
+ * Then run 
+ * $ javac -cp ".:*" CreateMdb.java
+ * $ java -cp ".:*" CreateMdb test.mdb
+ *
+ * Christian Herdtweck, intra2net, March 2014
+ */
+
+import com.healthmarketscience.jackcess.*;
+import java.io.File;
+import java.io.IOException;
+
+class CreateMdb {
+    public static void main(String[] args) throws IOException {
+        //for (String arg : args) {
+        //    System.out.println(arg);
+        //}
+        //System.exit(0);
+
+        if (args.length == 0) {
+            System.out.println("need file to write to as arg!");
+            System.exit(1);
+        }
+
+        System.out.println(System.getenv("CLASSPATH"));
+
+        String file_name = args[0];
+        System.out.print("Will write to file ");
+        System.out.println(file_name);
+
+        File file = new File(file_name);
+        Database db = new DatabaseBuilder(file)
+            .setFileFormat(Database.FileFormat.V2000)
+            .create();
+
+        Table table = new TableBuilder("Test")
+            .addColumn(new ColumnBuilder("ID", DataType.LONG)
+                     .setAutoNumber(true))
+          .addColumn(new ColumnBuilder("Name", DataType.TEXT))
+          .addColumn(new ColumnBuilder("Salary", DataType.MONEY))
+          .addColumn(new ColumnBuilder("StartDate", DataType.SHORT_DATE_TIME))
+          .toTable(db);
+        System.out.println("done");
+    }
+}
+
diff --git a/tests/file-tests/db/java/CreateMdb.java.source.txt b/tests/file-tests/db/java/CreateMdb.java.source.txt
new file mode 100644
index 0000000..7c411fc
--- /dev/null
+++ b/tests/file-tests/db/java/CreateMdb.java.source.txt
@@ -0,0 +1,6 @@
+AUTHOR: Christian Herdtweck, Intra2Net
+URL: None (self-created)
+LICENSE: public domain
+
+NOTE: this program created the file in ../mdb using library Jackcess 
+(http://jackcess.sourceforge.net/, under LGPLv2)
diff --git a/tests/file-tests/db/jpc/test.jpc b/tests/file-tests/db/jpc/test.jpc
new file mode 100644
index 0000000..3abdc4d
Binary files /dev/null and b/tests/file-tests/db/jpc/test.jpc differ
diff --git a/tests/file-tests/db/jpc/test.jpc.source.txt b/tests/file-tests/db/jpc/test.jpc.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/jpc/test.jpc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/jpc/testing.jpc b/tests/file-tests/db/jpc/testing.jpc
new file mode 100644
index 0000000..3320b75
Binary files /dev/null and b/tests/file-tests/db/jpc/testing.jpc differ
diff --git a/tests/file-tests/db/jpc/testing.jpc.source.txt b/tests/file-tests/db/jpc/testing.jpc.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/jpc/testing.jpc.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/jpg/lime-cat.jpg b/tests/file-tests/db/jpg/lime-cat.jpg
new file mode 100644
index 0000000..e488fc4
Binary files /dev/null and b/tests/file-tests/db/jpg/lime-cat.jpg differ
diff --git a/tests/file-tests/db/jpg/lime-cat.jpg.source.txt b/tests/file-tests/db/jpg/lime-cat.jpg.source.txt
new file mode 100644
index 0000000..b86e0eb
--- /dev/null
+++ b/tests/file-tests/db/jpg/lime-cat.jpg.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: Created it myself
+LICENSE: public domain
diff --git a/tests/file-tests/db/jpg/xsane-zoom-in.jpg b/tests/file-tests/db/jpg/xsane-zoom-in.jpg
new file mode 100644
index 0000000..c6a90a0
Binary files /dev/null and b/tests/file-tests/db/jpg/xsane-zoom-in.jpg differ
diff --git a/tests/file-tests/db/jpg/xsane-zoom-in.jpg.source.txt b/tests/file-tests/db/jpg/xsane-zoom-in.jpg.source.txt
new file mode 100644
index 0000000..716804a
--- /dev/null
+++ b/tests/file-tests/db/jpg/xsane-zoom-in.jpg.source.txt
@@ -0,0 +1,3 @@
+AUTHOR: Jan Kaluza <jkaluza@redhat.com>
+URL: part of xsane project
+LICENSE: GPLv2+
diff --git a/tests/file-tests/db/js/smartmobile.js b/tests/file-tests/db/js/smartmobile.js
new file mode 100644
index 0000000..59a8f09
--- /dev/null
+++ b/tests/file-tests/db/js/smartmobile.js
@@ -0,0 +1,794 @@
+/**
+ * mobile.js - Base mobile application logic.
+ *
+ * Copyright 2010-2014 Horde LLC (http://www.horde.org/)
+ *
+ * See the enclosed file COPYING for license information (GPL). If you
+ * did not receive this file, see http://www.horde.org/licenses/gpl.
+ *
+ * @author   Michael J. Rubinsky <mrubinsk@horde.org>
+ * @author   Jan Schneider <jan@horde.org>
+ * @category Horde
+ * @license  http://www.horde.org/licenses/gpl GPL
+ * @package  Kronolith
+ */
+var KronolithMobile = {
+
+    /**
+     * List of calendars we are displaying
+     */
+    calendars:  [],
+
+    /**
+     * List of calendars that are currently loaded for the current view
+     */
+    loadedCalendars: [],
+
+    /**
+     * Event cache
+     */
+    ecache: {},
+    cacheStart: null,
+    cacheEnd: null,
+
+    deferHash: {},
+    viewRan: false,
+
+    /**
+     * The currently displayed view
+     */
+    view: 'day',
+
+    /**
+     * The currently selected date
+     */
+    date: null,
+
+    /**
+     * Temporary fix for pages not firing pagebeforecreate events properly
+     */
+    haveOverview: false,
+
+    /**
+     * Load all events between start and end time.
+     *
+     * @param Date firstDay
+     * @param Date lastDay
+     * @param string view    The view we are loading for (month, day)
+     */
+    loadEvents: function(firstDay, lastDay, view)
+    {
+        var dates = [firstDay, lastDay], loading = false;
+
+        // Clear out the loaded cal cache
+        KronolithMobile.loadedCalendars = [];
+        KronolithMobile.clearView(view);
+        KronolithMobile.viewRan = false;
+        $.each(KronolithMobile.calendars, function(key, cal) {
+            var startDay = dates[0].clone(), endDay = dates[1].clone(),
+            cals = KronolithMobile.ecache[cal[0]], c;
+            if (typeof cals != 'undefined' &&
+                typeof cals[cal[1]] != 'undefined') {
+
+                cals = cals[cal[1]];
+                c = cals[startDay.dateString()];
+                while (typeof c != 'undefined' && startDay.isBefore(endDay)) {
+                    if (view == 'day') {
+                        KronolithMobile.insertEvents([startDay, startDay], view, cal.join('|'));
+                    }
+                    startDay.addDays(1);
+                    c = cals[startDay.dateString()];
+                }
+
+                c = cals[endDay.dateString()];
+                while (typeof c != 'undefined' && !startDay.isAfter(endDay)) {
+                    if (view == 'day') {
+                        KronolithMobile.insertEvents([endDay, endDay], view, cal.join('|'));
+                    }
+                    endDay.addDays(-1);
+                    c = cals[endDay.dateString()];
+                }
+                if (startDay.compareTo(endDay) > 0) {
+                    KronolithMobile.loadedCalendars.push(cal.join('|'));
+                    return;
+                }
+            }
+
+            var start = startDay.dateString(), end = endDay.dateString();
+                loading = true;
+            HordeMobile.doAction('listEvents',
+                                 {
+                                   'start': start,
+                                   'end': end,
+                                   'cal': cal.join('|'),
+                                   'view': view,
+                                   'sig': start + end + (Math.random() + '').slice(2)
+                                 },
+                                 KronolithMobile.loadEventsCallback
+            );
+        });
+
+        if (!loading && view == 'overview') {
+            KronolithMobile.insertEvents([firstDay, lastDay], view);
+        }
+    },
+
+    /**
+     * Sort a collection of events as returned from the ecache
+     */
+    sortEvents: function(events)
+    {
+        var e = [];
+
+        // Need a native array to sort.
+        $.each(events, function(id, event) {
+            e.push(event);
+        });
+        return  e.sort(function(a, b) {
+           sortA = a.sort;
+           sortB = b.sort;
+           return (sortA < sortB) ? -1 : (sortA > sortB) ? 1 : 0;
+         });
+    },
+
+    /**
+     * Callback for the loadEvents AJAX request.
+     *
+     * @param object data  The ajax response.
+     */
+    loadEventsCallback: function(data)
+    {
+        var start = KronolithMobile.parseDate(data.sig.substr(0, 8)),
+            end = KronolithMobile.parseDate(data.sig.substr(8, 8)),
+            dates = [start, end], view = data.view;
+
+        KronolithMobile.storeCache(data.events, data.cal, dates, true);
+        KronolithMobile.loadedCalendars.push(data.cal);
+        KronolithMobile.insertEvents(dates, view, data.cal);
+    },
+
+    /**
+     * Inserts events into current view.
+     * For Day view, builds a new listview and attaches to the DOM.
+     * For Month view, hightlights dates with events.
+     */
+    insertEvents: function(dates, view, cal)
+    {
+        var key = dates[0].dateString() + dates[1].dateString() + view + cal,
+        d = [dates[0].clone(), dates[1].clone()], date, events, list, key, day;
+
+        // Make sure all calendars are loaded before rendering the view.
+        // @TODO: Implement LIFO queue as in kronolith.js
+        if (KronolithMobile.loadedCalendars.length != KronolithMobile.calendars.length) {
+            if (KronolithMobile.deferHash[key]) {
+                return;
+            } else {
+                KronolithMobile.deferHash[key] = window.setTimeout(function() { KronolithMobile.insertEvents(d, view, cal); }, 0);
+                return;
+            }
+        }
+        if (KronolithMobile.deferHash[key]) {
+            window.clearTimeout(KronolithMobile.deferHash[key]);
+            KronolithMobile.deferHash[key] = false;
+        }
+
+        KronolithMobile.running = true;
+        switch (view) {
+            case 'day':
+                if (!KronolithMobile.viewRan) {
+                    KronolithMobile.viewRan = true;
+                    date = d[0].dateString();
+                    events = KronolithMobile.getCacheForDate(date);
+                    events = KronolithMobile.sortEvents(events);
+                    list = $('<ul>').attr({'data-role': 'listview'});
+                    $.each(events, function(index, event) {
+                        list.append(KronolithMobile.buildDayEvent(event));
+                    });
+                    if (!list.children().length) {
+                        list.append($('<li>').text(Kronolith.text.noevents));
+                    }
+                    $("#dayview :jqmData(role='content')").append(list).trigger('create');
+                }
+                break;
+
+            case 'month':
+                day = d[0].clone();
+                while (!day.isAfter(d[1])) {
+                    date = day.dateString();
+                    events = KronolithMobile.getCacheForDate(date);
+                    $.each(events, function(key, event) {
+                        $('#kronolithMonth' + date).addClass('kronolithContainsEvents');
+                    });
+                    day.next().day();
+                }
+                // Select current date.
+                $('#kronolithMonth'+ KronolithMobile.date.dateString()).addClass('kronolith-selected');
+                KronolithMobile.selectMonthDay(KronolithMobile.date.dateString());
+                break;
+
+            case 'overview':
+                day = d[0].clone(), haveEvent = false;
+                list = $('<ul>').attr({'data-role': 'listview'});
+                while (!day.isAfter(d[1])) {
+                    list.append($('<li>').attr({ 'data-role': 'list-divider' }).text(day.toString('ddd') + ' ' + day.toString('d')));
+                    events = KronolithMobile.sortEvents(KronolithMobile.getCacheForDate(day.dateString())) ;
+                    $.each(events, function(index, event) {
+                        list.append(KronolithMobile.buildDayEvent(event));
+                        haveEvent = true;
+                    });
+                    if (!haveEvent) {
+                        list.append($('<li>').text(Kronolith.text.noevents));
+                    }
+                    haveEvent = false;
+                    day.next().day();
+                }
+                $("#overview :jqmData(role='content')").append(list).trigger('create');
+                break;
+        }
+        KronolithMobile.running = false;
+    },
+
+    /**
+     * Build the dom element for an event to insert into the day view.
+     *
+     * @param object event  The event object returned from the ajax request.
+     */
+    buildDayEvent: function(event)
+    {
+        var id;
+        if ($.isEmptyObject(event)) {
+          return;
+        }
+
+        var cal = event.calendar, type = cal.split('|')[0], c = cal.split('|')[1],
+        d = $('<div>'), item = $('<li>'), a;
+
+        // Time
+        var timeWrapper = $('<div>').addClass('kronolithTimeWrapper');
+        if (event.al) {
+            timeWrapper.append(Kronolith.text.allday).html();
+        } else {
+            var startTime = Date.parse(event.s).toString(Kronolith.conf.time_format);
+            var endTime = '- ' + Date.parse(event.e).toString(Kronolith.conf.time_format);
+            timeWrapper
+              .append($('<div>').addClass('kronolithStartTime').append(startTime))
+              .append($('<div>').addClass('kronolithEndTime').append(endTime));
+        }
+
+        e = $('<h2>').text(event.t);
+        l = $('<p>').addClass('kronolithDayLocation' + Kronolith.conf.calendars[type][c].fg.substring(1)).text(event.l);
+        d.append(timeWrapper).append(e).append(l);
+
+        // Add the link to view the event detail.
+        a = $('<a>')
+            .css({ backgroundColor: Kronolith.conf.calendars[type][c].bg })
+            .attr({ href: '#eventview',
+                    'class': 'kronolith-event kronolith-event-' + Kronolith.conf.calendars[type][c].fg.substring(1) })
+            .click(function(ev) {
+                $("#eventview :jqmData(role='content') ul").detach();
+                KronolithMobile.loadEvent(cal, event.id, Date.parse(event.e));
+            })
+            .append(d);
+
+        return item.append(a);
+    },
+
+    /**
+     * Retrieve a single event from the server and show it.
+     *
+     * @param string cal  The calendar identifier.
+     * @param string id   The event identifier.
+     * @param Date   d    The date the event occurs.
+     */
+    loadEvent: function(cal, id, d)
+    {
+        HordeMobile.doAction('getEvent',
+                             {'cal': cal, 'id': id, 'date': d.toString('yyyyMMdd')},
+                             KronolithMobile.loadEventCallback);
+    },
+
+    /**
+     * Callback for loadEvent call.  Assume we are in Event view for now, build
+     * the event view structure and attach to DOM.
+     *
+     * @param object data  The ajax response.
+     */
+    loadEventCallback: function(data)
+    {
+         if (!data.event) {
+             // @TODO: Error handling.
+             return;
+         }
+
+         var event = data.event;
+         var ul = KronolithMobile.buildEventView(event);
+         $("#eventview :jqmData(role='content')").append(ul).trigger('create');
+    },
+
+    /**
+     * Build event view DOM structure and return the top event element.
+     *
+     * @param object e  The event structure returned from the ajax call.
+     */
+    buildEventView: function(e)
+    {
+         var list = $('<ul>')
+            .addClass('kronolithEventDetail')
+            .attr({'data-role': 'listview', 'data-inset': true});
+
+         var loc = false;
+
+         // Title and calendar
+         var title = $('<div>').addClass('kronolithEventDetailTitle').append($('<h2>').text(e.t));
+         var calendar = $('<p>').addClass('kronolithEventDetailCalendar').text(Kronolith.conf.calendars[e.ty][e.c]['name']);
+         list.append($('<li>').append(title).append(calendar));
+
+         // Time
+         var item = $('<div>');
+         if (e.r) {
+             var recurText = Kronolith.text.recur.desc[e.r.t][(e.r.i > 1) ? 1 : 0],
+                 date = Date.parse(e.s);
+             recurText = recurText.replace('#{interval}', e.r.i);
+             switch (e.r.t) {
+             case 2:
+                 // WEEKLY
+                 recurText = recurText.replace('#{weekday}', Kronolith.text.weekday[e.r.d]);
+                 break;
+             case 3:
+                 // MONTHLY_DATE
+                 recurText = recurText.replace('#{date}', date.toString('d') + '.');
+                 break;
+             case 5:
+                 // YEARLY_DATE
+                 recurText = recurText.replace('#{date}', date.toString('m'));
+                 break;
+             }
+             item.append($('<div>').addClass('kronolithEventDetailRecurring').append(recurText));
+             item.append($('<div>').addClass('kronolithEventDetailRecurring').text(Kronolith.text.recur[e.r.t]));
+         }
+         if (e.al) {
+             item.append($('<div>').addClass('kronolithEventDetailAllDay').text(Kronolith.text.allday))
+                .append($('<div>').addClass('kronolithEventDetailDate').text(Date.parse(e.s).toString('D')));
+         } else {
+             item.append($('<div>')
+                .append($('<div>').addClass('kronolithEventDetailDate').text(Date.parse(e.s).toString('D'))
+                .append($('<div>').addClass('kronolithEventDetailTime').text(Date.parse(e.s).toString(Kronolith.conf.time_format) + ' - ' + Date.parse(e.e).toString(Kronolith.conf.time_format))))
+             );
+         }
+         list.append($('<li>').append(item));
+
+         // Location
+         if (e.gl) {
+             loc = $('<div>').addClass('kronolithEventDetailLocation')
+                .append($('<a>').attr({'data-style': 'b', 'href': 'http://maps.google.com?q=' + encodeURIComponent(e.gl.lat + ',' + e.gl.lon)}).text(e.l));
+         } else if (e.l) {
+             loc = $('<div>').addClass('kronolithEventDetailLocation')
+                .append($('<a>').attr({'href': 'http://maps.google.com?q=' + encodeURIComponent(e.l)}).text(e.l));
+         }
+         if (loc) {
+             list.append($('<li>').append(loc));
+         }
+
+         // Description
+         if (e.d) {
+           list.append($('<li>').append($('<div>').addClass('kronolithEventDetailDesc').text(e.d)));
+         }
+
+         // url
+         if (e.u) {
+           list.append($('<li>').append($('<a>').attr({'rel': 'external', 'href': e.u}).text(e.u)));
+         }
+
+         return list;
+    },
+
+    clearView: function(view)
+    {
+        switch (view) {
+        case 'month':
+            $('#kronolithDayDetail ul').detach();
+            break;
+        case 'day':
+            $("#dayview :jqmData(role='content') ul").detach();
+            break;
+        case 'overview':
+            $("#overview :jqmData(role='content') ul").detach();
+        }
+    },
+
+    /**
+     * Advance the day view by one day
+     */
+    showNextDay: function()
+    {
+        KronolithMobile.moveToDay(KronolithMobile.date.clone().addDays(1));
+    },
+
+    /**
+     * Move the day view back by one day
+     */
+    showPrevDay: function()
+    {
+        KronolithMobile.moveToDay(KronolithMobile.date.clone().addDays(-1));
+    },
+
+    /**
+     * Move the day view to a specific day
+     *
+     * @param Date date  The date to set the day view to.
+     */
+    moveToDay: function(date)
+    {
+        $('#kronolithDayDate').text(date.toString('ddd') + ' ' + date.toString('d'));
+        KronolithMobile.date = date.clone();
+        KronolithMobile.loadEvents(KronolithMobile.date, KronolithMobile.date, 'day');
+    },
+
+    /**
+     * Advance the month view ahead one month.
+     */
+    showPrevMonth: function()
+    {
+        KronolithMobile.moveToMonth(KronolithMobile.date.clone().addMonths(-1));
+    },
+
+    /**
+     * Move the month view back one month
+     */
+    showNextMonth: function()
+    {
+        KronolithMobile.moveToMonth(KronolithMobile.date.clone().addMonths(1));
+    },
+
+    /**
+     * Move the month view to the month containing the specified date.
+     *
+     * @params Date date  The date to move to.
+     */
+    moveToMonth: function(date)
+    {
+        var dates = KronolithMobile.viewDates(date, 'month');
+        KronolithMobile.date = date;
+        KronolithMobile.loadEvents(dates[0], dates[1], 'month');
+        KronolithMobile.buildCal(date);
+        KronolithMobile.insertEvents(dates, 'month');
+    },
+
+    /**
+     * Selects a day in the month view, and displays any events it may contain.
+     * Also sets the dayview to the same date, so navigating back to it is
+     * smooth.
+     *
+     * @param string date  A date string in the form of yyyyMMdd.
+     */
+    selectMonthDay: function(date)
+    {
+        var ul = $('<ul>').attr({ 'data-role': 'listview' }),
+        d = KronolithMobile.parseDate(date), today = new Date(), text;
+        $('#kronolithDayDetail ul').detach();
+        if (today.dateString() == d.dateString()) {
+          text = Kronolith.text.today;
+        } else if (today.clone().addDays(-1).dateString() == d.dateString()) {
+          text = Kronolith.text.yesterday;
+        } else if (today.clone().addDays(1).dateString() == d.dateString()) {
+          text = Kronolith.text.tomorrow;
+        } else {
+          text = d.toString('ddd') + ' ' + d.toString('d')
+        }
+        $('#kronolithDayDetailHeader h3').text(text);
+        $('.kronolith-selected').removeClass('kronolith-selected');
+        $('#kronolithMonth' + date).addClass('kronolith-selected');
+        if ($('#kronolithMonth' + date).hasClass('kronolithContainsEvents')) {
+            var events = KronolithMobile.getCacheForDate(date);
+            events = KronolithMobile.sortEvents(events);
+            $.each(events, function(k, e) {
+                ul.append(KronolithMobile.buildDayEvent(e));
+            });
+        }
+        $('#kronolithDayDetail').append(ul).trigger('create');
+        KronolithMobile.moveToDay(d);
+    },
+
+    /**
+     * Calculates first and last days being displayed.
+     *
+     * @var Date date    The date of the view.
+     * @var string view  A view name.
+     *
+     * @return array  Array with first and last day of the view.
+     */
+    viewDates: function(date, view)
+    {
+        var start = date.clone(), end = date.clone();
+
+        switch (view) {
+        case 'month':
+            start.setDate(1);
+            start.moveToBeginOfWeek(Kronolith.conf.week_start);
+            end.moveToLastDayOfMonth();
+            end.moveToEndOfWeek(Kronolith.conf.week_start);
+            break;
+        case 'summary':
+            end.add(6).days();
+            break;
+        }
+
+        return [start, end];
+    },
+
+    /**
+     * Creates the month view calendar.
+     *
+     * @param Date date        The date to show in the calendar.
+     */
+    buildCal: function(date)
+    {
+        var tbody = $('.kronolith-minical table tbody');
+        var dates = KronolithMobile.viewDates(date, 'month'), day = dates[0].clone(),
+        today = Date.today(), dateString, td, tr, i;
+
+        // Remove old calendar rows.
+        tbody.children().remove();
+
+        // Update title
+        $('#kronolithMinicalDate').html(date.toString('MMMM yyyy'));
+
+        for (i = 0; i < 42; i++) {
+            dateString = day.dateString();
+
+            // Create calendar row .
+            if (day.getDay() == Kronolith.conf.week_start) {
+                tr = $('<tr>');
+                tbody.append(tr);
+            }
+
+            // Insert day cell.
+            td = $('<td>').attr({ id: 'kronolithMonth' + dateString })
+                .addClass('kronolithMonthDay')
+                .jqmData('date', dateString);
+            if (day.getMonth() != date.getMonth()) {
+                td.addClass('kronolithMinicalEmpty');
+            }
+
+            // Highlight today.
+            if (day.dateString() == today.dateString()) {
+                td.addClass('kronolithToday');
+            }
+            td.html(day.getDate());
+            tr.append(td);
+            day.next().day();
+        }
+    },
+
+    /**
+     * Parses a date attribute string into a Date object.
+     *
+     * For other strings use Date.parse().
+     *
+     * @param string date  A yyyyMMdd date string.
+     *
+     * @return Date  A date object.
+     */
+    parseDate: function(date)
+    {
+        var d = new Date(date.substr(0, 4), date.substr(4, 2) - 1, date.substr(6, 2));
+        if (date.length == 12) {
+            d.setHours(date.substr(8, 2));
+            d.setMinutes(date.substr(10, 2));
+        }
+        return d;
+    },
+
+    storeCache: function(events, calendar, dates, createCache)
+    {
+        events = events || {};
+
+        //calendar[0] == type, calendar[1] == calendar name
+        calendar = calendar.split('|');
+        if (!KronolithMobile.ecache[calendar[0]]) {
+            if (!createCache) {
+                return;
+            }
+            KronolithMobile.ecache[calendar[0]] = {};
+        }
+        if (!KronolithMobile.ecache[calendar[0]][calendar[1]]) {
+            if (!createCache) {
+                return;
+            }
+            KronolithMobile.ecache[calendar[0]][calendar[1]] = {};
+        }
+        var calHash = KronolithMobile.ecache[calendar[0]][calendar[1]];
+
+        // Create empty cache entries for all dates.
+        if (!!dates) {
+            var day = dates[0].clone(), date;
+            while (!day.isAfter(dates[1])) {
+                date = day.dateString();
+                if (!calHash[date]) {
+                    if (!createCache) {
+                        return;
+                    }
+                    if (!KronolithMobile.cacheStart || KronolithMobile.cacheStart.isAfter(day)) {
+                        KronolithMobile.cacheStart = day.clone();
+                    }
+                    if (!KronolithMobile.cacheEnd || KronolithMobile.cacheEnd.isBefore(day)) {
+                        KronolithMobile.cacheEnd = day.clone();
+                    }
+                    calHash[date] = {};
+                }
+                day.add(1).day();
+            }
+        }
+
+        var cal = calendar.join('|');
+        $.each(events, function(key, date) {
+            // We might not have a cache for this date if the event lasts
+            // longer than the current view
+            if (typeof calHash[key] == 'undefined') {
+                return;
+            }
+
+            // Store useful information in event objects.
+            $.each(date, function(k, event) {
+                event.calendar = cal;
+                event.start = Date.parse(event.s);
+                event.end = Date.parse(event.e);
+                event.sort = event.start.toString('HHmmss')
+                    + (240000 - parseInt(event.end.toString('HHmmss'), 10)).toPaddedString(6);
+                event.id = k;
+            });
+
+            // Store events in cache.
+            $.extend(calHash[key], date);
+        });
+    },
+
+    /**
+     * Return all events for a single day from all displayed calendars merged
+     * into a single hash.
+     *
+     * @param string date  A yyyymmdd date string.
+     *
+     * @return Hash  An event hash which event ids as keys and event objects as
+     *               values.
+     */
+    getCacheForDate: function(date, calendar)
+    {
+        if (calendar) {
+            var cals = calendar.split('|');
+            return KronolithMobile.ecache[cals[0]][cals[1]][date];
+        }
+
+        var events = {};
+        $.each(KronolithMobile.ecache, function(key, type) {
+            $.each(type, function(id, cal) {
+                if (!Kronolith.conf.calendars[key][id].show) {
+                    return;
+                }
+                if (typeof cal[date] != 'undefined') {
+                    $.extend(events, cal[date]);
+                }
+           });
+        });
+
+        return events;
+    },
+
+    /**
+     * Handle swipe events for the current view.
+     */
+    handleSwipe: function(map)
+    {
+        switch (KronolithMobile.view) {
+        case 'day':
+            if (map.type == 'swipeleft') {
+                KronolithMobile.showNextDay();
+            } else {
+                KronolithMobile.showPrevDay();
+            }
+            break;
+
+        case 'month':
+            if (map.type == 'swipeleft') {
+                KronolithMobile.showNextMonth();
+            } else {
+                KronolithMobile.showPrevMonth();
+            }
+        }
+    },
+
+    /**
+     * Event handler for the pagebeforechange event that implements loading of
+     * deep-linked pages.
+     *
+     * @param object e     Event object.
+     * @param object data  Event data.
+     */
+    toPage: function(e, data)
+    {
+        switch (data.options.parsedUrl.view) {
+        case 'minical-next':
+            KronolithMobile.showNextMonth();
+            e.preventDefault();
+            break;
+
+        case 'minical-prev':
+            KronolithMobile.showPrevMonth();
+            e.preventDefault();
+            break;
+
+        case 'nextday':
+            KronolithMobile.showNextDay();
+            e.preventDefault();
+            break;
+
+        case 'prevday':
+            KronolithMobile.showPrevDay();
+            e.preventDefault();
+            break;
+        }
+    },
+
+    /**
+     */
+    loadPage: function()
+    {
+        switch (HordeMobile.currentPage()) {
+        case 'monthview':
+            KronolithMobile.view = "month";
+            // (re)build the minical only if we need to
+            if (!$("#kronolithMinicalDate").jqmData("date") ||
+                ($("#kronolithMinicalDate").jqmData("date").toString("M") != KronolithMobile.date.toString("M"))) {
+                KronolithMobile.moveToMonth(KronolithMobile.date);
+            }
+            break;
+
+        case 'overview':
+            KronolithMobile.view = "overview";
+            if (!KronolithMobile.haveOverview) {
+                KronolithMobile.loadEvents(KronolithMobile.date, KronolithMobile.date.clone().addDays(7), "overview");
+                KronolithMobile.haveOverview = true;
+            }
+            break;
+
+        case null:
+            break;
+
+        case 'dayview':
+        default:
+            KronolithMobile.view = "day";
+            $("#kronolithDayDate").html(KronolithMobile.date.toString("ddd") + " " + KronolithMobile.date.toString("d"));
+            KronolithMobile.loadEvents(KronolithMobile.date, KronolithMobile.date, "day");
+            break;
+        }
+    },
+
+    onDocumentReady: function()
+    {
+        KronolithMobile.date = new Date();
+
+        // Build list of calendars we want.
+        $.each(Kronolith.conf.calendars, function(key, value) {
+            $.each(value, function(cal, info) {
+                if (info.show) {
+                    KronolithMobile.calendars.push([key, cal]);
+                }
+            });
+        });
+
+        // Bind click and swipe events
+        $('body').bind('swipeleft', KronolithMobile.handleSwipe)
+            .bind('swiperight', KronolithMobile.handleSwipe);
+        $(document).bind('pageshow', KronolithMobile.loadPage)
+            .bind('pagebeforechange', KronolithMobile.toPage)
+            .on("pageshow", "#eventview", function(event, ui) {
+                KronolithMobile.view = "event";
+            });
+
+        $('#kronolith-minical').on('click', 'td', function(e) {
+            KronolithMobile.selectMonthDay($(e.target).jqmData('date'));
+        });
+    }
+};
+
+$(KronolithMobile.onDocumentReady);
diff --git a/tests/file-tests/db/js/smartmobile.js.source.txt b/tests/file-tests/db/js/smartmobile.js.source.txt
new file mode 100644
index 0000000..a5e97ec
--- /dev/null
+++ b/tests/file-tests/db/js/smartmobile.js.source.txt
@@ -0,0 +1,2 @@
+URL: https://raw.github.com/horde/horde/master/kronolith/js/smartmobile.js
+License: GPL
diff --git a/tests/file-tests/db/jse/smartmobile.jse b/tests/file-tests/db/jse/smartmobile.jse
new file mode 100644
index 0000000..58cafdd
--- /dev/null
+++ b/tests/file-tests/db/jse/smartmobile.jse
@@ -0,0 +1 @@
+#@~^nm0AAA==&Ce@&,e,:W(k^nRN/~O,ACdP:K8k^+Pm22VbmmYrWU~^WLk1 @&,e@&~CPZG2HDro4O, T8!  !8c,uWMNnPdS/~vtYD2)JzhSA tKD9+ W.LJ#@&PC@&PCPjnPY4n,+Um^Gk+[,0bV+,Z}K5&1!P6W.~^kmU/Pk	WGDslDkGx~cVnJ#c~q6PzG!@&PM~9k[P	GDP.mk\PD4kkPWk^+S~k++,4YDw)J&AhSR4W.Nn KDLz^rmxdnkzo2sc@&~e@&~CP@$mEDtWMP,~Hbm4lV~BcPI!8k	/3H~@!:ME(kU/V@$4W.N WMo@*@&,eP@$C!Y4WM~,PBmx,?m4xrND~@!NlU@$4WD9nRKDo@*@&~e,@$1lO+LGMX~CK.N@&~M,@$Vr^xd+,~4YOa)JzhShc4WMNnRKDL&^kmU//zT2sPVnd@&~e~@$al^3mL+,PF.KxWsrDt@&PC&@&\CMPnDW	W^rY4HG4bVn~{P	@&@&P,PPJMM@&,P,P~e~Jb/OPKWP1lsn	Nl.d,hnPm.P[b/aVlHk	L@&,P~P,e&@&,PP,^l^+x9C./=P,$D~@&@&,P~PJMe@&P~~,Pe~Jb/OPKW,mC^+	NlM/,OtmY~lM+~^!DDUY^XP^GCNN,0GD~O4+~m!.DxO~7k+A@&,P~P,MJ@&~,P,VWmN[ZmVnx9l.d=P$YS@&@&PP,~&eC@&,P~P~M,2-+	OP1l^4@&P~~,PMz@&~,P~mmmt),`8B@&~P,P^C1t+UOlMY),U;V^~@&P~P~^mm4+AUN=PU;^V~@&@&,P~P9n6+._lkt),	)S@&,P~P7knA"lx=~0mV/S@&@&,P,P&eM@&,P~P,MP:tn~1ED.n	YsX,[b/2^lH+N,\bnh@&P~P,PM&@&PP,~\b+h=~vNmXE~@&@&~~,P&eC@&P,P~~CPK4n,m;DMn	YsHPk+VmDnN,NCY@&~~,PPC&@&,PP,[CY),x;VsS@&@&~P,~zCe@&~,PP~M,Kn:aGMl.HP6k6,0K.PalL+kPUGDP0b.k	oPaCL+(+6W.+^.lO+,n\xOd,wDG2DsX@&~,P~,eJ@&P,P,4l7+6\D-rh),Wl^/+B@&@&P,P,zMe@&~,P~PC~SKl[~mVV~n7+UYk~(+OS+xPkYm.Y,lUN,+U[,YksnR@&PP,~~e@&P,P~PM~@$wCDmhPGlOn,0k.dDfCX@&~,P~,e,@$wmDmhPGlO+,VCdDflH@&P,PP,M~@$alMlhPdOMkUo,-kh~~,PK4n,\r+S~S+~mDPVKl9rxTPWWMPchKxY4SP9lX*@&~P,P,e&@&~~,PsWm[27+UOk)PW;	mOkKUv0rM/DflH~,slkY9lH~~-b+h*@&P,PPP@&~P,P,P~P-CMP[lDn/,'~,6kDdOGlz~,sm/OGlHT~,VKCNbxLP{PWC^/+p@&@&,PP,~~P,zJP/VnCMPGED~Y4+~sKlNn[,mCV,^mm4@&,PP,P,~PnDGxKVrO4HW(rVRVKC[+9ZmVnx[CM/~',,Tp@&~~,PP~~,|.W	G^kO4HK4k^+c^Vl..b+Ac7k+Sbi@&PP,~~P,PnDGxGsbY4HK8k^+ -b+h]C	PxP6C^/np@&,PP,P,~PfRnl1tcFMWxKskDtHK8rVR1ls+U[mDd~,WE	mOrKx`VnH~~mms*P`@&P,PP,P,~P,P~\mD~dDlDD9lHP',[CY/]!DR^sKxn`*SPx[9mXPx~9lO+k,8T 1VKx+v#B@&P,P~P,P~~,PP1CVkP',F.W	W^kOt\G(ks+cnmmm4n]mls,ZTD~,^p@&~,P,PP,P,~P,kWPvYz2W0,^l^/Pex~B!x9+WkUn9B~[L@&P,P~~,PP~~,P~P,~DX2W6PmmVk,mmV,FYT~Z{PB!UN0k	n[B*PP@&@&P~~,P~P,~P,P~~,PmCskPxP1C^/,1l^$FYTp@&P,P~P,P~~,PP,~P,mP{~^l^/]/Ol.OGlzR9CY?O.bxocbYi@&P,~,P~,P,PP,P,~PStrVPcOHw+KWP1P"{~vE	N0rxn[EP'[,dYmDO9mXRrd~+WWMnv+U9fmX#*PP@&P,P~P,P~~,PP,~P,PP,~r0,`7knh~x{PvNmzB*P`@&,PP~~,P~P,~,P~,P,PP,P,~PnDGxKVrO4HW(rVRk	dnDD27+UYdc]/OlMOfmXS~kYl.OGlzTB~7knS~,ml^RNGk	`vuE#bI@&PP,~P,PP,~~P,P,P~P~~)@&~P,~P,P~~,PP~~,P~P,~kYCMYGlXcl9[fmXd`8#I@&,PP,~P,PP,~~P,P,P~P~^,'~mms/]/OCMYfCzcNCYjDDr	ov#Tp@&,~P,P~P,P~~,PP,~8@&@&P,~~P,P,P~P~~,P~m,xP1lsd]+x[9mX NmO?OMk	o`*Tp@&P,P~P,P~~,PP,~P,htbsnPvYHwnWW~1PZ',vE	NnWbx+[v,['PedDl.DfmXRb/zWYDc+	N9CH##,`@&,PP,~~P,P,P~P~~,P~P,r0,`-rhPxx,B[lHv*P`@&P,PP,P,~P,P~P,P~~,PP,~P,|DKUGVbY4HG4rsRrxknDD2-n	Y/c,x[fmzBPn	NGlXY~,-khSP1ls NWk	cB-B#*I@&P,P,P~P~~,P~P,~P,P~~)@&P~~,P~P,~,P~,P,PP,P,nx9fCXcl[[GlXkcO8#i@&~~P,P,P~P~~,P~P,~P,P^~{PmCsk$nx99mX 9lD+?DDbUov#Di@&P~~,PP,~P,PP,~~P)@&,P~P~~,P~P,~P,P~r6P`dOmDOfmzcmGswmD+:Wvnx9fCX*P@*~Z#PP@&P,PP,~~P,P,P~P~~,P~Pn.W	WsrDtHG8bVnR^GmNn9ZmV+	Nm./cw;/4`^C^RLKrxvBuEbbi@&P,P~P~~,P~P,~P,P~~,PDnO!DUi@&~,P~,P,PP,P,~P,PN@&,P~~,PP,~P,P8@&@&~P,P,P~P~~,P-lM~/Dl.O,'PdOmDOfmzcNCD+UYDbxTc#BPnx9Px~xNGCXcNlDnjYMk	oc#I@&,P~P,~P,P~~,PP~~^WCNbUTPx,YME+p@&,~P,P~P,P~~,CWM[+tW4bsnR9WzmOkGUvBskkO27+UOkB~@&~,P~P,~,P~,P,PP,P,~P,P~P,P~~,PP,~	@&PP,~~P,P,P~P~~,P~P,~P,P~~,PP~~,P~P,vkYCMYE)PkYm.YB@&~P,P~~,PP,~P,PP,~~P,P,P~P~~,P~P,~P,BnU9B)~n	NS@&,~,P~,P,PP,P,~P,P~P,P~~,PP,~P,PP,~~B1l^BlP^C^R%WbU`EuvbB@&P~~,P~P,~,P~,P,PP,P,~P,P~P,P~~,PP,~B7k+SvlP7khS@&~~,P~P,~P,P~~,PP~~,P~P,~,P~,P,PP,P,v/bov),/OCMYP3~+	NP3~cHmY4R.lU[K:c#,QPEBb kVk^nv b@&,~,P~,P,PP,P,~P,P~P,P~~,PP,~P,PP,NS@&,P,P~P~~,P~P,~P,P~~,PP~~,P~P,~,P~nDKxW^kD4HK4rVRsGmN27nxD/Zmss4mm0@&~P~~,P~P,~P,#I@&,PP~~,P~8*I@&@&~,P,PP,PbWPv"sWmNrUTP[L~\b+h,xxPEW7+.\rnSBbPP@&P,P~~,PP~~,PFDKUKVrDttW4bV k	/nDD2-n	Y/v,0bD/D9CXBP^ldY9CHTSP7r+S#I@&,PP~~,P~8@&~,P~)~@&@&P,P,&eC@&~P,P~M,?WMOPmPmKss+1YbWUPGW,+-+	O/,ld~M+Y;.	+[P6.K:~DtP+1l14+@&P~P,PM&@&PP,~/KDYA-nxD/=PWEU^DkGxvn\xOd*@&P~~,	@&P,~,P~,P7lD,+,xP]TI@&@&P~~,PP,~zJP1n[PmP	lOk-n,l.DmzPDW~dKDY @&,P~P,~,Pyc+mmtv+7nxD/SP6EU^DkW	ck9~P-nxD#,	@&P~~,P~P,~P,Pn aE/4c\nxDbp@&~,P,PP,P)bi@&P~P,P~~,D+D;D	PP dWMYv0;x^ObWU`mSP(#~`@&PP~~,P~P,~,/GMYzP',lcdWMYI@&,P~~,PP,~P,/WMO$P{P(RdW.Op@&~P,~P,P~~,PDnO!DUPvdKDOzP@!P/KDD$#,g~O8Pl~v/WMOb,@*PkG.Y~#,g~F~l,!I@&,~P,P~~,P8bI@&P~P,NB@&@&,P,PzCe@&~P,P~e,ZCs^4l1VP6WD,O4+,VKl[2-n	YdPzBboP.n$E+dOc@&~P,~,e@&,P,PPCP@$2lMlhPK4%n1YP9CYmPP:4nPmLm6~DndaWU/ @&,P~~,ez@&~,P~VKC92-xD/ZmV^8l13lP6EU^DkW	cNmYl*@&~P,PP@&~P~~,P~P7CD,/OCMYPx~nDGxKsbY4tW(kVRaCDk+9lD+c[mYlcdkTR/!8dYM`Z~~%bbB@&~P,~P,P~~,PPnU9PxPn.KxG^kDtHK4bs+cwCDk+9CD+`9CYmR/bL /!4kY.`0S,%b#B@&P,P~~,PP~~,P[lDnkPx,$kYlMYB~+	ND~,\rnSP',[lDlR7rnhp@&@&P~P~~,P~|MGxKVrO4HW8r^+ /DGM+/mm4+`9lDCR\nxD/S~9lYm mmV~,[CY/BPOD;n*i@&P,~P,P~~nDWUG^kOttG(ksR^Wl9+9/l^+UNmDd aE/4cNmYlc^CV*i@&P~P~~,P~|MGxKVrO4HW8r^+ k	dDOA\xYk`9CY/SP7knABPNmOlcml^bI@&,P,PN~@&@&,P~PJMe@&P~~,Pe~(	/nDDd,+-xD/PbxDGP1E.DxO~7k+S @&,PP,~MPwWMP9lz~7knhB~4!ks[kPl~Uh~VbdD\rh,lx9PmOYmm4+kPOG,Yt~f}HR@&~~P,PCPoW.~tWUY4~\b+AS,tkL4DVro4OkP[mY/PSkD4P\nxD/ @&,PP,~eJ@&P,~~k	/DO2-n	Yd),WE	mOrKx`[CD+d~,-b+ABP1lV*@&,~P,	@&P,P~~,PP7CD,3+H~xP9lD+d$TDcNCYjYMkULv#PQ~9lO+k,8T 9lD+?DDbUov#~_,\rnSP_,^l^~@&,~~P,P,P[Px~]NCYd$ZT ^^Wxnc*~~NmO/,8TcmVKxc#Y~~NmYnS,+\UYk~P^rdYBP0+z~~[mXI@&@&~P,P~~,Pz&~tlV+,d!Dn,l^VP1l^nx9l./,l.n,VWm[+9P4WGDPM+UNn.bxLPD4+,\rnSR@&~~,P~P,~Jz~@$K}fr=P&hw^+h+	Y~J&sr,5EE+,CdPbx,3.WUG^kOtc%/@&P~~,PP~~b0~`n.KxG^kDtHK4bs+cVGl9+[/mV+	[lM/R^nUoDt,"xPF.KxGVbOttW8r^+R^C^+UNm.kRsxTYt*PP@&P,P~P,P~~,PPbWPv|DKUGVbY4HG4rsR[+6nD_ld4]3+zD*P`@&,~,P~,P,PP,P,~P,DnY!DUI@&PP,~P,PP,~~P)PVd+~`@&P~P,~P,P~~,PP~~,|.W	G^kO4HK4k^+c[+6+.Cm/4,0+XY~',hk	[Ghc/YPkhnKEO`6;x1YrG	`#~`,|.W	G^kO4HK4k^+crxk+.YA\nUD/`9SP7k+SS~mmV*i~8S~Z#I@&,~P,P~~,PP~~,P~PMnDE.	i@&PP,P,~P,P~P,8@&~,PP,~P,8@&,~~P,P,Pr0~cnDGxKskDt\G(kVn 9+W+Mum/4]3XT*PP@&P,P~P,P~~,PPSrx9Whc^s+mD:kh+G;D`FDKUW^kO4tW4rsR[+6nMCCkt]3+HT*I@&,P~P,P~~,PP,FDKxW^rOttW(ks+ [0nD_C/4$VnHTPx~6ls/I@&P~,P,PP,8@&@&P,P~P,P~FMWxKskDtHK8rVRMEUxrUTPxPD.Ei@&~,PP~~,PdhbO1t~v\b+h*PP@&P,P~P,P~~,PP1C/PB9CzB=@&,P~P~~,P~P,~P,P~r6P`ZFMWUW^rDt\K4bV+c\bnh"lU#,	@&~,PP,~P,PP,~~P,P,P~PF.KxGVbOttW8r^+R-rh]l	~{POMEi@&,P,~P,P~P,P~~,PP,~P,NlDn~',N]!DR[CD+jYMrxT`bI@&PP~~,P~P,~,P~,P,PP,P-+	YdP{PF.KxW^rY4HW(rs+coY/l^4sGDGCY`[CD+#I@&,P~P,~,P~,P,PP,P,~P,+-+	Yd~{P|MGxKVkD4\W(k^+ /G.D2-+	O/v+-n	Y/bI@&P~P,~,P~,P,PP,P,~P,PskkY~x,^`E@!E^@*B* CYDDv	vNCOmO.W^nB=Pvsb/Y-rhv8*I@&P~,P,PP,P,~P,P~P,P~~fR+m^tv+\UO/BP6EUmOrKxck	[+X~~n7+xOb,	@&P,~,P~,P,PP,P,~P,P~P,P~~^k/D law+	[c|MW	WskO4tW8k^nR(Ers9flz37+UYvn7+UD#*i@&,P,~P,P~P,P~~,PP,~P,8#p@&~P,P,P~P~~,P~P,~P,P~r6P`Zsb/OR14bV[M+	`#cVUoDtbPP@&~~,PP,~P,PP,~~P,P,P~P~~,Vr/D lawnU9`^cv@!Vr@*EbcYnXYv|DKxKskDt Y6O 	W+7nxD/#*I@&P,P,P~P~~,P~P,~P,P~~)@&P~~,P~P,~,P~,P,PP,P,y`ra[lH\rnSP)N5:GlYmc.W^+{B^WUOxOB*E#cl22xNcsb/O#cOMkLT+M`B1DCYBbi@&P~~,PP,~P,PP,~~P)@&,P~P~~,P~P,~P,P~8M+lVI@&@&~P,~,P~,P,PP1lknPE:GxDtvl@&PP,~P,PP,~~P,P,P[lz~{P[$ZDR1VGU`#I@&,P~P,~,P~,P,PP,PS4k^+~`eNCzck/zWYD`9,qT*#,	@&P~~,P~P,~P,P~~,PP~~,NCY~{P[mXcNlD+UODbxL`*i@&~,PP,~P,PP,~~P,P,P~Pn-xO/,xPnDGUKVkO4tW8k^nconDZmmtsK.fmYn`9lOn*i@&,~P,PP,~~P,P,P~P~~,PyRCm4`n-xYdS,0;x1ObWUv3X~,+7nxD#~	@&P~~,PP,~P,PP,~~P,P,P~P~~f`va0.W	WsrDtHGUDtvP3~9lO#clN9Z^C/k`v3MWUG^kY4/W	YlbUd27+	YdBbI@&P~P,~P,P~~,PP~~,P~P,N*i@&,P,PP,P,~P,P~P,P~~,PNmzR	+6DcbR9lH`bi@&~,P~P,~P,P~~,PP~N@&P~P,~,P~,P,PP,P,&z,?nVmO~1EDMnxDPNmOnR@&P,P~P~~,P~P,~P,PycEa3.G	WskD4tWUDtE_PnDKUW^kOttW8r^+R9CYRNmOn?DDbxL`bbcl[N;slk/cv0DWUG^kOt dVn1YNB*i@&~P,P~P,P~~,PP,~PnDW	GskDttW8ksnc/nV^YtWUO4flzcnDGxKsbY4tW(kVR9CYR[lD+jOMkxTc#*i@&,~~P,P,P~P~~,P~P(.+m3I@&@&PP~~,P~P,~,P^m/PBK\.\b+AB=@&~~,PP,~P,PP,~~P,NmX~'~[]!DR1sW	+cbBPtC-2-+	O,'~6l^/+p@&,~P,P~P,P~~,PP,~Vb/Y,x~^vB@!Es@*vbclOYMc	ENCOmODGsBlPEsb/O7khB)#p@&P,P~P,P~~,PP,~P,htbsnPv"9lzRrdz0O+McN]FDb*P	@&~,P~P,~,P~,P,PP,P,~P^kdYcl22xNvy`E@!Vb@*v#clDY.``~ENCYmRDKVnv=PBsrkYRNb-bNnMB,8#cYaYvNCXcYGjDDk	L`ENN9vbP3PEPvPQ~9lzRDG?DDrUT`B[v*#bi@&~,P~,P,PP,P,~P,P~P,Pn-xYk~',|DKUGVbY4HG4rsRdWMO27+UOk`|.G	WskD4tW8bVRoY;Cm4+oWMfCO`NmzR9lYjODbxT`b#b~p@&~P,~P,P~~,PP~~,P~P,~fRnmm4`+7+	O/BPWE	mOrKx`bUN6~,n-+	Y*P`@&~~,P~P,~P,P~~,PP~~,P~P,~^kdDRmwwx9c|MWUW^kO4tW4bs+c4Ebs[fmXA\nxOc\nxDb#p@&~~,PP~~,P~P,~,P~,P,PP,P,4l7+3\xO~{PYM;+p@&P,~~P,P,P~P~~,P~P,~P)#I@&,PP~~,P~P,~,P~,P,PP,k6~`etC\2-n	Y#,`@&,PP,~~P,P,P~P~~,P~P,~P,PsrkYRC2a+UNvyvB@!^k@*B#cYaYv|.W	WsrDtRDn6DRxKn-+	Yk#bi@&~,P~P,~P,P~~,PP~~,P~8@&~,P~,P,PP,P,~P,P~P,P4C7+27nxDP',WCVk+p@&~P~~,P~P,~P,P~~,PP~~9lzR	nXYc*R9lXv#p@&P,P~P,P~~,PP,~P,8@&,~~P,P,P~P~~,P~PfcJ[W-nM\knA,)%;s9mYCvDKV+{B1GxD+UYE#Ebclwanx9`VbdO#cYMkLon.vB^DCYBbI@&PP~~,P~P,~,P~,P,4Dl0I@&,P~P,P~~)@&P,~P,PP,F.W	W^kOt\G(ks+c.E	xrUTP'~WmVd+p@&,P~,8B@&@&,P,~zCe@&P,P~~CPA!rV9PY4n~NK:,+s+hn	Y~0K.Pmx~n7+xO~DW~k	dDO,k	YW,Y4nP9lzP7knAc@&P,~P,e@&,~~P,e,@$2l.CsPG4NnmDPn-xY~~:tnP-xO,W(L+1Y,.+DE.xN~WMW:,OtPlNCaPM+$En/O @&P~P,~eJ@&~~,P4;r^N9lH37+UD),0E	mDrW	`n\xOb@&PP,~	@&PP,~~P,P7l.Pr[p@&~P,~P,P~r6P`y b/3:aOHr8N+1Y`\UY*#~	@&P~~,PP,~P,D+D;.xp@&,P~P~~,PN@&@&~P,P~~,P\C.,mCV,x,+-xDRmmVUNmDSPDX2n,'P1CVc/w^rO`EuE#,!DS,m~',^l^Rd2^kYcv-Bb$8DB@&~,P,PP,P9~',^cB@!Nr-@*B#B~kD+:,x~^vB@!Vr@*vbBPCi@&@&P,P~~,PP&&,Kr:@&,P~,P,PP7lM~Yb:nMl22DP{~^vB@!9r-@*E#cl[N/sm/d`EVDKxGsbYtPrs+	Dm2a+.E#p@&P,P,~P,Pr0,`n-xYcCV*P	@&~~P,P,P~P~~,Yr:	Dmw2nMRl22x[`n.KxG^kDtRD+XORmVsNmXb 4Y:^c#p@&P,~~P,P,8~+sdP`@&,~P,P~~,PP~~7l.PkOmDO:ks+P{PGCYR2lM/nc\+	ORk#RDGjYMk	oc|.G	WskD4R1WUWcYkhn|0GDsCD#I@&P,PP,P,~P,P~\mD~n	NKbh+,'PER~B,_,fCYn al./c+7+UOc+# OK?ODbUT`FMW	WVbY4 mKxWRDkhn|0WMhlD#i@&~~P,P,P~P~~,Yr:	Dmw2nM@&P~~,P~P,~,P~,Pclwa+	[`f`v@!9k-@*E#Rm[N;VlkdcB0DKxGVrO4?OlMOKb:nv*Rl22x[`kOmDO:ks+#*@&,~P,P~P,P~~,PPcCwa+x9cy`E@!9k-@*vbcl[N;slk/cv0DWUG^kOtAU9Krs+E#Rmwanx9`nx9Krh##p@&P,PP,~~P)@&@&P~P~~,P~+,xPf`v@!4 @*vbcYn6Dc\n	YcY#p@&,~P,P~P,V~x,^`E@!w@*B#cC[N;Vm/d`vVMWUW^rY4fCzdWmCObWUB,Q,|.KxKVkDtc^W	0 mmVnU9lDk,YHw+Y,^Tc0TRdE8dDDrxTcF*# O6Ycn7+UYcs*i@&,P,PP,P,[Rmw2+	NcOb:+q.law+Mb lawx[`nbcl2wUNvVbI@&@&P~~,P~P,&JP)9N,YtP^rx0POW,\rnSPY4nP\+	O~NYmksR@&~,P~P,~PmPx~f`B@!C@*Bb@&,~,P~,P,PP,Pc^/k``P(l^VTDW!UN;WVK.lPnDKxGVrO4R^W	WR1lsn	Nl.d]YzwD]mDc4TP8*@&,~P,P~P,P~~,RlDODv	P4.n0=PEan\nUD\r+Sv~@&P~~,PP~~,P~P,~,P~,P,Bm^lkdB=Pv3MWUG^kY4R+7+xD~VDKxKVrY4R\nxDRB,_~FMWxGsbY4R1G	0 1l^+x9lMd$DX2+Y$^Dc0ocdE(/YMrUovF*PN#@&~,P~P,~P,P~~cmVr^0`WE	^DkG	`\#,	@&~P,P~P,P~~,PP,~Pf`J[n-+	Y7knh~lN;hfmOlvDGs'B^G	YnxDv*P;^J*RNYm^tv#I@&,P~~,PP,~P,PP,~~|MW	WskO4tW8k^nR^WC[A\+UOvmCVB~\n	YckNBPGCYR2lM/nc\+	OR##p@&~P,P,P~P~~,PN#@&~P,P~~,PP~~,RCwan	Nc9#p@&@&,P,~P,P~DY;.	PkDn:clwanUNvl*i@&P~~,8S@&@&~P,P&MC@&P~~,PMP"nDDr\Pl,/bUo^+~+7+UO,0DKhPDt+,dnD7+MPCx[~ktGh,rYc@&~~,PPM@&,P~P,M,@$2mDm:PkYMrxTP^l^P~P4+P1CVxNm.~k9+	Yr0rnMR@&P,~P,e~@$alDCh,/ODbUTPr9P,PK4+,n\xOPbNnUDk0bnDc@&P,~~PCP@$wCDCh,fCY~P,N~~,PK4n,NCY~Dtn,+7+xDPK^m!DdR@&P~~,PeJ@&P,PP^GCNA\xO)~W!x^YbGxvmCsBPk[S,Nb@&,~,P`@&P,PP,P,~CKD[+tW8r^+R9Gb1YkKUcBT+D2-+UOE~@&P,~P,P~~,PP~~,P~P,~,P~,P,PP,PPvmmVv),mCsBPBb[B=Pk9S~B9lD+v)~[cYG?D.k	ocvHXXz\tN[B*NB@&~,P,PP,P,~P,P~P,P~~,PP,~P,PP,F.W	W^kOt\G(ks+csWmN3-xY/C^V8l1V*i@&,P,P8B@&@&~P,P&eC@&~~,PPC~ZmVV(C^3,0KD~VGC92-+	OP1lsscPP)dkEh+,APCM+,kx,27nxDP-kh~WKDP	GhBP4!rsN@&P,P~PM~DtnP-+	Y~-b+h~dDD;mD;M+~mx9PlDYm^t,YGPGr\ @&PP,~PC@&P,~~PCP@$wCDCh,W8L^Y,NCOmPPP4PCLma,DnkwKx/R@&~P,P~eJ@&~~,PVKCNA\+	O/l^V(l^3l~6EUmDrW	`[CDl#@&~,P~	@&~,P~,P,PPb0,c"9lOlc+-n	Y#,`@&,PP,~~P,P,P~P&&,@$PrG6),2..KDP4C	Nsk	Lc@&~,P,PP,P,~P,P.+DE.Up@&P,~P,PP,~N@&@&P,P~P~~,P-lM~+7+UO,'P[CDl +7n	YI@&P,PP,P,~P7l.P!V~x,|DKUW^kY4\G4bVR8Ers92-+	O.b+Ac\+UO*i@&P,~,P~,P,^`ra-+	Y-kh~lN;:GCYm`DKsn'EmKxO+UOE#E#cCwa+U[vEVb DDroTnM`v1DlYB*I@&,P~P)~@&@&,PP,&eC@&P,~~PCP~ErV[~\nxD~\b+A~GrH~dDD;mD;M+~mx9PDY!.x,Y4+,YG2,+\UY,+VhnxDR@&P~P~~C@&~P,~PCP@$2mDlh~K4%+1O,+~,K4+P\UY,/OD!mO;M+PMnY!Dx[~0MWsPOtn~mLC6,^l^V @&,PP~~Cz@&P,~,4;bV92\xD#khlP6EU^DkW	c+*@&P,~~	@&P,P~P~~,P-lM~Vb/O~{P^cv@!Es@*Eb@&P~,P,PP,P,~Pcl[N;VCdk`B0.W	WVbO427+	Y9+OCbVv#@&~P,P~~,PP~~,RCYD.v	v9lDlOMW^nB=PvVb/O-b+hESPENlDCRk	/Yv)~OMEn8*I@&@&P~~,PP~~,\CD,sKm~{P6lVk+p@&@&,P~P,P~~,zz,PkDV+,CUN,mmVnx[CM@&~P,~P,P~~7lD~ObYs+,x,^cE@!9k\@*B* l9N/Vm/dcE3DKUW^kY43-+	YG+Olrs:kOVv#cl22xNcyvB@!ty@*E# D+XY`RDb#p@&~P,P~~,PP7CD,ml^nUNmD,'~^cv@!w@*B* l9N/sm//cv0DGxKsbY4A\xYG+DCk^ZCVx[CMB#cO+XY`n.GxKVbY4R^G	0 mms+	NC.k$+ OHT,+c^Y$v	ls+BY#p@&P,P~P,P~~^k/D law+	[c^vB@!Vr@*vbcl2wUNvYrO^+# Cawnx9c1lsx9lD*#p@&@&,P~P,P~~,zz,Pks+@&,~~P,P,P~\C.,kO+s~',^cv@!Nk-@*E#I@&,~,P~,P,Pk6PvnRM#~	@&P~~,PP,~P,PP,-CD,Dm;DPnXY~',FDKxGsbYt O6ORMn1E.cN/m]+c.RDT,`R. bP@*,q#,gP8~lPZTB@&~P~~,P~P,~P,P~~,PNCOPxPGCD+ alM/+v+cd#p@&~P,P~~,PP,~P,D+1;.K6DPxP.n1E.KaYcDn2^lmncEa`k	OD-mV)B~,+c.Rb#I@&,P~~,PP,~P,PPkArY1t,`nR. D#~	@&~P,P~~,PP~~,P^lkn, l@&P,PP,P,~P,P~P,P~~JzPq32nS5@&~~P,P,P~P~~,P~P,~Dm;.:+6O~{P.+1;MKnXYcD+aVm^+vB:	S+nV9lX)v~,|DKUGVbY4RO+aOchn+0[lH$n MRNDbp@&~P,~,P~,P,PP,P,~P(Dnl0i@&~,PP,~P,PP,~~mm/Pf)@&~,P~P,~P,P~~,PP~~Jz~H}H:CJI{GbKA@&,~P,P~P,P~~,PP,~PM+m!.P+XY,'~Dn^!DP+XORM+2smm+cv[	[lDn)BS,NmY+cYKjYMkUovB[v*P_,vRE#i@&~~P,P,P~P~~,P~P,~4M+CVp@&P~~,P~P,~,P~,mm/+,*=@&P,P~P,P~~,PP,~P,PzJ~e2zId5mf)PA@&~P,~P,P~~,PP~~,P~D^!DP6DP',D^EMKn6DR.naVl1n`Ea	9CO+)BBP[lOncYG?D.k	ocvsB#bI@&P~P,~,P~,P,PP,P,~4M+C3p@&~~,PP,~P,PP,~N@&,P,P~P~~,P~P,rY: Caw+U[v^cB@![b\@*E#clN9Z^C/k`v3MWUG^kY43\xYGnOlbV"+^E..bxLB* lawnU9`Dn^!DP+XO*#I@&P,PP,P,~P,P~PbYnhclwanx9`^vv@!Nb\@*BbRC[9Zslkd`E3.G	WVrO42-+	OG+Omk^I+1EM.k	ov#cYnaD`|MGxKVkD4 Y6DR.+^;M$nRM YY#bI@&PP~~,P~P,N@&P~,P,PP,PbWPv+ l^#~`@&PP,~P,PP,~~P,kD+hRC2a+UNvy`E@![r7@*Bb mN[Z^Ck/cE3MWxKVbOtA\nxDfnOmkVzsVGlXEb Y6D`FDGUKVrY4 Y6O mVV[CH#b@&,~,P~,P,PP,P,~P,RCwa+U[v^`E@!Nb\@*Eb l9N;VC/dcE3.W	GVbY437+xO9YCk^9mYnE#cY+XYv9lD+ wmDdnv+RkbRDW?D.rxT`Efv#bbp@&~P,~P,P~~)P+sdP`@&,~,P~,P,PP,P,rY: lawnU9`^vv@!9k\@*vb@&,P,P~P~~,P~P,~P,RC2a+x[cf`v@!9r7@*v*RmNN;Vmd/vBVDKxGsbYtA-+	YfOCk^fmYnBb D+aYv9lD+ 2mD/ncRd#cOK?OMk	o`EfEb#@&P~P,P~~,PP,~P,PPcC2wx9`y`v@!9k-@*EbRmN[/^l/dcE3.W	G^kO427+xDfOlbVPks+vbcY+XO`GlY 2lM/`nRdbcYG?D.k	ocFMWxGsbY4R1G	0 Dks+{6WMhlD#~_,B~R,BP3~fmY+c2CDk+v+ +b DWjYMrxT`F.KxWsrDt mKU6ROb:{0KDsCY*#b#@&P~~,PP,~P,PP,bI@&,P,P~P~~,8@&P,~P,P~~,VkdOcl2wU9`yvB@!Vk@*B* lawnx9`rO:#*I@&@&PP,~~P,P,z&PJG1lOkKU@&,P~~,PP~~b0~` TVb,	@&PP,P,~P,P~P,PsG1P',y`E@!Nb-@*B*RmN[ZsCk/cB0.W	WsrDt2-n	Y9+DCbVJKmmYkKxEb@&,P~P,P~~,PP,~P,PRm22+	Nv^cB@!C@*BbRmOYM``v9lYCRkYzVv=Pv(BBPB4DWB=PvtDY2lJz:m2/coWKLs+cmK:_;xv,_~+	^W9+i]&ZWh2KxnxDcRL^R^lY,_,v~EPQPRLscVW	b8*RYaO`R^#bi@&~,P~P,~P,8~n^/+~r6Pc+cs*P`@&P,PP,P,~P,P~P^W^~{P^vv@!9k\@*vbRmN9ZslddvBVDKUW^kO4A\+UOG+OlbsdW^mYbWxE#@&~P,P~P,P~~,PP,~PclwanUNv^vB@!l@*v*RCYD.`PB4.0Bl~EtOYalJzhmwkRoKWTs+cmG:Q;xv,_PUmKN+`](ZK:aWU+UOv+ V*N#cYnaD`+ s*#I@&,~,P~,P,P8@&P,~P,P~P,kW~vVW1bPP@&P,~~P,P,P~P~~^kdYcCwa+U[v^`v@!^k@*B* mw2x9`VKm*bi@&P~P,P~~,P8@&@&P,PP,~~P,zJP9+d^Mk2YbGx@&P~~,PP~~,kWPvncNb,	@&PP,P,~P,P~P^kdOclwanx9`^vv@!Vb@*E# l22x[`fcB@!Nr-@*B# C9N/Vmdk`v0DKxW^kD427+UYG+OCbVfdmE#RDnaYv+cNb#bI@&P~P,~P,P~N@&@&P~~,P~P,~Jz~!D^@&P,P,~P,P~k6PcncE#,`@&,PP,~~P,P,PskdOcl2wUNv^cv@!Vk@*v*RCwan	Ncf`E@!l@*B* lDY.`PB.n^B),v+XY+MUCVE~,B4DnWE)~+c;8*ROnXY`n !#b#p@&,P~,P,PP,8@&@&P,P~P,P~~M+Y!.x,VkkOI@&,P,PN~@&@&,P~P1s+mD#rh)~W!x^YbG	`-b+S#@&,P,~	@&P~P,P~~,/hbOm4P`7rnh*PP@&~P~~,P~P1C/PvhKxY4v=@&~P,~,P~,P,PPf`E:3MWUW^kO4GlXGnYmkV,;sB*R9+Ol^4v#I@&,~P,P~~,PP~~(Dnl0I@&P~,P,PP,mmd+,B[lHBl@&,PP,~P,PP,~~^vJ[NCX-rh~)N5:GlOCvDWsn{B^W	OxOE#,EVr#c[+Dl^tv#I@&,PP,~P,PP,~~4M+m3I@&~~,P~P,~mm/n~EW\n.7knhEl@&P~,P,PP,P,~Pf`EaK\n.7k+S~)N;:GCOlvDKVn'v^KxO+	OB*P;sr#R[nDl^tvbp@&~,P,PP,P)@&P,P~8B@&@&~,PPJMe@&PP,~~e,b9\Cx^n,Y4+,[lHP-rhP8z,WU+,[mX@&,P,PPCz@&~P,PdtKhHnXYfmz),0E	^OkKxv#@&P~~,	@&P,~P,P~~nDWUG^kOttG(ksRsW\KK9lH`FDKxGsbYttG4bV+c[CYR1VGxnc*RCN99lH/cq*#i@&~,P~8B@&@&P~,PJee@&P,~P,e~HK\n~Dt+,[lHP\bnAP(l13~4z~KxnP9CX@&P~~,Pe&@&,P~Pk4KhKM+7flH),WE	mOkKxcb@&PP,~	@&PP,~~P,PnDGxGsbY4HK8k^+ hK\+PGGlz`n.KxG^kDtHK4bs+cNCYR^sKx+vbRmNNGCz/vO8#bi@&~,P~8B@&@&,P~~Jee@&~,P~PC~tW-PDt+,NmzP7knh,YG~mP/anmb0k1~[lH@&,P~P~M@&P~P,~e,@$2CMl:~9mYnP9CD+~,K4+P9lDnPDW~/Y~O4+P9CX,\kA~YKR@&P~P~~Cz@&P,~PsW-n:WfCz=PWE	^DkG	`9lY#@&~P,P`@&,P~~,PP,y`Ea3MGUW^kDt9lz9mYnB* Y6Oc9lYn DWjYMr	ocEN9NB*P3~B,B~_,NCORYKjYMkxTcvNE#*i@&P~~,P~P,FDKxGsbYt\G(ks+c[mYn,',NlD+c^VKxn`*i@&~,PP,~P,|DKUGVbY4HG4rsRsWm[27+UOk`|.G	WskD4tW8bVRNmYSPnDGxKVrO4HW(rVRNmOn~,B9lzBbI@&P~P,N~@&@&~~,PzMM@&P~P,~CP)9\mxmPD4+,:GxDt~-b+h,CtlN,GU+,:KxOt @&,P~P,Mz@&P~~,/tGAhDn\tG	Y4=P6Ex1YbGxv#@&P,P~`@&PP,~P,PPn.GxKVbY4HG8bVnRsG\KG\KxY4cnDGxKsbY4tW(kVR9CYR^VKxnc*Rl9[HKxY4dcO8#*i@&P~~,8S@&@&~P,P&MC@&P~~,PMPtG7+~DtP:KxD4P7knh,4C^0PW	nPsWxD4@&P,P,PMz@&~,P~/4Ghg+aOtWxO4=PWE	^DkG	`*@&P,P,`@&,P~P,P~~nDW	GVbYttG8k^+c:G\nPKHGxD4`nDGUKVkO4tW8k^ncNCD+cmVKxc#cl[NtWUO4/`8b#p@&P,~~8B@&@&P~P~&Ce@&P,~P,e~\K\+~O4+~:KUDt~7khPDW,OtPhW	Y4~1WxDCk	kxT~OtPkwnmrWb+[P9CYR@&~,PP~M@&P~P,~CP@$alMl:kPGCYP[lD+~~:t+,[lD+PDG~:K\POW @&,P~P,Mz@&P~~,:W-n:W\W	O4)~6E	mYbW	cNmYn#@&P~~,	@&,~P,PP,~-lMP9lO+d~{PFDKUW^kO4tW4rsR-kAGlO/vNlD+B~BsWUY4BbI@&PP,~P,PPn.GxKVbY4HG8bVnR9CYPx~9lYnI@&P~P,~,P~nDKxW^kD4HK4rVRsGmN27nxD/`9CO+k$ZTSP[CD+d$8D~,BhG	Ytvbp@&~P,~,P~,|MWxKVbOttW8k^+ 8!kV9/l^`NmOn#p@&,P~P~~,PFDKUW^kO4tW4rsRrxknMY37+	Y/vNmO+k~~BsWUO4B#p@&P,PP)S@&@&,P,P&eM@&,P~P,MPU+sn1Y/~C,NCX,r	PO4+,:W	Y4~\b+A~,lU[,Nkk2VmX/,CUX,+7+UYd~bY~:mzP1WUOmkx @&,P~P,M,bskW,/+D/,OtP[lH\rnSPYK~Y4+PkCh+,NmYn~~dKPUl7romYrUTP4C^0POW,rDPrk@&,PP,PC~/sWGY4R@&~,PP,M@&,PP,~MP@$wmDC:~dDDrxT~NmYn~,bP[CD+~/D.bxL,k	PY4+,WWM:~W6PzzHXHt[Nc@&P,~~PCz@&P~P~dVnmD\W	Y49mX)~W!x^YbG	`[mY#@&,P,~	@&P~P,P~~,\lM~E^P',ycB@!E^@*v# CDY.`P~B9lOC DWsnE)~B^rkY-b+SBP)#B@&P,P~P,P~[,'Pn.W	WVbO4HK4bVnR2CM/nfmO+vNCO#~~OKNCX,x,xnSPGlY`*SPD+aYp@&~~,PP,~Pf`B[V.W	W^kOt9CHfnYmrV,Esv*RNnOmm4`*I@&P~,P,PP,k6~`DW[lHR[CD+?D.k	o`*~x',NcNCYnjDDrxTc#*P`@&,PP~~,P~P,O6O,',|DKxKskDt Y6O DWNmzi@&PP,~~P,P)PnVdn,kWPvOW9lz 1VWUnv# l9[Glzk` F#cNmO+UY.k	ocb,'',[R9lYjODbxT`b#~`@&P~P,~P,P~~D+6O~{PFDKUKVrDtcY+XYcz+kYnD9lzI@&PP,~P,PP)~nVk+,kWPcOKNCXc^VKxnc*Rl[[Glz/vq*R[mY?YMk	L`*Px',N [mY+UODbxovbbPP@&,P~P~~,P~PDn6DPx~nDWUG^kOtcO6OcYK:WMDKAi@&P~P,P~~,8Ps/P	@&~~P,P,P~P~O6OP{~NcYGjDDkULvB[N9v*PQ,B,BP3P9 YK?ODbxLcENB*@&P,PP,~~P)@&,P~P~~,Py`E:3MWUG^kY49mX9+DCbVul9+D,t2v#cYn6D`OnXY#p@&P,PP,~~Pf`ERVDGUKVrY4R/Vn^D+NvbcDn:K-Zsm/k`B0DKUW^kOt /nsmY[B*i@&,~~P,P,Py`v:0DGxKskDt\G	Ytv~3P[lDn*RC9N;Vlk/vv3MWUW^kO4 /+^nmD+NEbI@&,P,P~P~~b0~`fcB[3.G	WVrO4HGxD4EPQ,NmY+*R4C/;VC/k`vVMWxKskDtZKUOlbxk2-+UOkBb#,`@&,P~~,PP~~,P~\m.,+-xD/P{Pn.W	WskDt\G(kV oYZm^4+wWMfCYnc9lO+*I@&,P~~,PP~~,P~+7n	Yd,',|DKxKskDt\W(ksnc/WMO27+xDdc+7+	Yd#I@&,P~P,~P,P~~,^RnC1tc+7n	YdBP6Ex1YbGxv3SP#~`@&PP,~P,PP,~~P,P,P;V Cawnx9c|MWUG^kY4\K4rV (Er^NGlXA\UYv+b#p@&~~,PP,~P,PP,Nbi@&P,P~P~~,8@&P,~P,P~~f`B:VMWUW^rDt9mXG+Ymk^v#cl2wx[c!V#cODboo.cB1DlO+vbp@&~P,~P,P~FMWxGsbY4HK8bVnc:K\+:WGCXvNbi@&P~~,8~@&@&P,PPJMM@&,P,P~e~/mV^E^CY/~WbD/O~mx[P^CkY~9lH/P(+bUo,Nr/aVCzNR@&~P,PPC@&~P,P,e~@$-CMP9lDnP9lOn,PP~P4+~NmOPG6PDt+,\bnhc@&~P,P~M,@$\m.PkYDbULP7kh~P)~7knh,Uls+ @&,PP~~C@&~P,~,e~@$DYEMx,CDMlzP,b..mXPSrY4P0b.dY,l	N~VCdDP[lH~W6PO4P\rnSR@&P,~,PMJ@&,PP,\bnhGlO+k)~W!xmDrW	`NmOn~,\b+A#@&~,P~	@&~P,P~~,P\C.,/OlMO,'~9lD+R1VKU+v#SPx[~{PNmO+cmVKUn`*i@&@&~P~~,P~PkAkDm4~v\knA*P`@&,~,P~,P,mlk+,v:KxOtE)@&~,PP,~P,PP,~dYmDDRd+O9mYn`8bi@&P~~,PP~~,P~PkOmDOc:K\+:W~nobx60q+nVv|DKUW^kY4 ^W	0chn+VmkYCDDbi@&P~~,PP~~,P~PU9RhK\KWdlkOfmX60tWUO4`#p@&P,PP,~~P,P,Pnx[ sW-+:G2	N6Wq++VcnDGxKsbY4cmKx0chn3|/OlMYbI@&PP,~P,PP,~~P(DlVi@&~,P~P,~P1ldn,B/;hsl.XEl@&P~,P,PP,P,~Px[RmN[c+#R9CXk`#p@&~P,P,P~P~~,P8DC3p@&~~,PP~~,8@&@&,~,P~,P,D+DEMUP]/OlMYS~xNYI@&,PP,NS@&@&P,P~zMM@&P~P,~e,Z.nmY+d~DtnPsG	Y4,\b+h,mms+	NCDc@&~~,PPC@&P,PP,M~@$alMlhP9CD+~NmO+,P~~,PP~P4+~NmOPOKPktWSPbUPDtnP1lsn	NlM @&,PP,~Mz@&P,P~4;r^N/l^lP6EU^DkWUc9lO+*@&,P~,	@&PP,P,~P,\CD,Y8G9XP{~^vBR0.GxKVbY4Ohr	k^l^~Ym4sn,Y4G[HBbi@&~,P~,P,P\mD,[lD+dP{PF.KxW^rY4HW(rs+c\b+AfCO/cNmO+BPvhKxY4v*~~Nmz,'~9lD+/]!Y m^WU+v#S@&,PP,~P,PYK[CX,',fCYn DW[lHc#BP[CD+?O.bxL~,O9~~DDBPkp@&@&~P,P~P,P&&,I+sG\PW^[~mmVx[l.~MWA/c@&P,P~~,PPO8KNzR14bV[M+	`#cDhW7+c#p@&@&~,PP,~P,zz,i2NmYPOkOs@&~P,~P,P~yvBaV.KxGVbO4Hr	k1lVGlDnB*R4YsVc[mY+cOWUYDbUL`EHtH\PzzHXv#*I@&@&P~~,PP~~6W.Pvr,'~Zi,kP@!PW+i,kQ_*P`@&,PP,~P,PP,~~NmY?ODrUTPxP9CXcNCO?Y.r	oc#p@&@&P~,P,PP,P,~PJz~ZM+COPmms+	NlM~.WSPc@&~P~~,P~P,~P,kW~vNlz T+Ofmzv#~{',|DKxKskDt mKxW S++0m/DlDDb~	@&P,P~P~~,P~P,~P,PO.,'PycE@!OD@*v*i@&,P,PP,P,~P,P~P,PO8KNXcCwa+x9cOD*i@&P~P~~,P~P,~P)@&@&~,PP~~,P~P,~Jz~&xk+DDP9CX,mnV^R@&~,PP,~P,PP,~ON,',^cB@!O9@*v#cCYDDc`,kNl~E3.W	G^kO4HKxY4B,QP9lO+UY.r	oP)b@&,PP,~~P,P,P~P~~,RCN9/Vm/dcE3DGUKVrY4\KxO4fmXB*@&,~P,P~P,P~~,PP,~RN;:GCOlvB9lO+vS,NCYjYMkUL*i@&~~,P~P,~,P~,k6P`9lH oY\W	Y4c*P"{~NmY+cLnYtW	Y4`bb,	@&P,~P,P~~,PP~~,P~Y9 mN[;Vm//vB0.W	WskDt\r	kmms2swYHvbi@&P,P~P~~,P~P,N@&@&P~~,PP~~,P~PJ&,CrTt^ko4Y,OW9lzR@&P~~,PP,~P,PPbW~`9lHR[lOnUY.k	L`*Pxx,YW[CHR[lDnUY.bxT`#*PP@&P,P~P,P~~,PP,~P,YNcC[N;Vm/d`vVMWUW^rY4KG[mXBbI@&P~P,~,P~,P,P8@&P,~P,P~P,P~~DNR4O:^`Nmz oYGlO+cb*i@&P,~P,P~~,PP~OMRCwan	NcDN*i@&,P,~P,P~P,P~[mXR	n6D`#c[CXv#p@&~P~~,P~P)@&P,P~NB@&@&~~,P&eC@&,P~,PCPnmDkn/,l~NmYn~mYYMr4!Y+,dODbxTPrxOG,l~fmO+,W8%mY @&,P~P,M@&P~,P,ePwWM~WDtnD,/O.bxok~Ek+PGCO+cwmDd+cbc@&~P,~PC@&~~,PPM~@$wCDmh,/OMk	oP9lDnP,b~XHXz\tNN,[lD+PkO.k	oc@&~P~~,e@&P,~P,e~@$M+Y;.	P9lDn,P),NmY+,W(%+1Y @&,P~~,ez@&~P,Pwm.d+GlD+lPW;	mOkKU`9lOn*@&P~~,	@&P,~,P~,P7lD,N,xP	+APGlOnvNlDnRkE4kO.`Z~,cb~~[mYnRk;4kY.cW~P+b,O~FB~9lORkE4kYMcvBP+#*i@&~,PP,~P,k0,c[lD+cVnxLO4Px',q *P`@&,PP~~,P~P,~,N k+DCW!DkcNmYnRkE8dDD`RSPy##p@&~P,P,P~P~~,P[RknYtkU;D+/c[mYnRk;(/OM`8!~, *bi@&P~P,P~~,8@&,~P,PP,~.+DEMx~NI@&,P~P)S@&@&P~~,/YG.ZCm4n=PW!x1YkKxvn\xO/BP^C^+x9CDBPNmOn/BP1DnlOn;l^tb@&,P~~P@&P~~,P~P,n7+UD/,'P\UYkPku,	NI@&@&P,~P,PP,&&mmVx[l.,ZT~'{~YHwnS,mlsn	NCD]qYPx{P1lVx9CD,xC:@&~~,PP,~P1lVU[lMP{P^lsn	NCDcdw^kOcEuBbI@&P~P,~,P~b0,`"nDKUW^kOttW8r^+R^l1t+]^CVx9l.$TDY#~	@&~P,P~~,PP~~,kWPvZ1DnmYZl1tbPP@&~P,P~~,PP,~P,PP,.nY!D	i@&P~~,P~P,~P,PN@&,PP~~,P~P,~,|.KxKVkDttG4bVnRmC^4+$1CVxNm.,!YT,'~	NI@&P~P,~P,PN@&,PP~~,P~k6~v"FMW	WVbY4\W(ks+c+^C1t+]^l^+x9C.$ZTY$^lsn	NCD]qTY#~`@&PP~~,P~P,~,Pr6Pv"mM+mO+;l^t#~`@&PP,~P,PP,~~P,P,P.+O;MxI@&,~P,P~~,PP~~)@&~P,~,P~,P,PPnDKUW^kOttW8r^+R^l1t+]^CVx9l.$TDY$^l^nx9l.,8TT~x,	Ni@&~,P~,P,P8@&P,~P,P~P7l.~1lV_C/4P',F.W	W^kOt\G(ks+cnmmm4n]mlsn	NCD]TYT,1l^+x9lM,FYTI@&@&P~~,PP,~zJPZMnCYP:2Yz~1l^t~+	Y.r/PWGMPCV^~9lO/c@&P,P,~P,Pr0,`ZZ9lYd#,	@&,~~P,P,P~P~~7l.P9CX,'~[mY+d,ZT m^G	+c*~,NlD+p@&P,P~P,P~~,PPS4k^+PvZ[lHRb/)0OnM`[lDn/]FDb*P	@&~,P~P,~,P~,P,PP,NmO+,'~NmX [mY+UODbxovbI@&,P,P~P~~,P~P,~P,kW~v"mCs_ldt][mYnY#,	@&,P,~P,P~P,P~~,PP,~P,k0,cZmM+mYnZC^4+bPP@&P,P~~,PP~~,P~P,~,P~,P,PPM+D;D	i@&P,P~~,PP,~P,PP,~~P,P)@&~P~~,P~P,~P,P~~,PP~~b0~`eFMWUKVbYttW(rVR^l1tnjDlDD~u-P|MGUW^kDt\W8r^+ mm^t?OCMYRrdz0O+Mc9lz*#,	@&,P,~P,P~P,P~~,PP,~P,PP,~FDKxKVrY4\K4rV mmm4nUYl.O,'~NmzcmsKx`#p@&,~P,P~P,P~~,PP,~P,PP)@&~P,P,P~P~~,P~P,~P,P~r6P`ZFMWUW^rDt\K4bV+cmm^t2UN,uk~nDW	GVbYttG8k^+cmCm4nAx[RbdA0G.`NCz*#~	@&~,P~,P,PP,P,~P,P~P,P~~,P|MGxKVkD4\W(k^+ mC^4+3x9~',NCzcmVGU`bi@&~,P~,P,PP,P,~P,P~P,PN@&,PP,~P,PP,~~P,P,P~P~^mVulk4$9lOnYP'~`)i@&P,~,P~,P,PP,P,~P)@&~P,P~~,PP,~P,PP,[CXcl9NcFb 9lz`*I@&,P~~,PP~~,P~8@&~,P~,P,P8@&@&,~P,P~P,\C.,ml^~',ml^nUNmDcLGkUcEuv#p@&P,P~~,PPy l^tvn7+UD/BP0!x1OkKxc3XS~9lYbPP@&P,~~P,P,P~P~&JP	+,hkTtO~	WY~4m\nPm~1l^4+,0WMPD4kkP[lD+~r6PY4nP\+	O~Vm/D/@&P~~,P~P,~P,P&&,VWULD~Y4C	PO4+,mEMDUY,\r+S@&~~,PP,~P,PP,rWPvYHwnWW~1lsCmdt]3nzYP'x~EEUNWbxn9B*P	@&P,~P,P~P,P~~,PP,.+DED	I@&P,P,P~P~~,P~8@&@&P,P~~,PP~~,P&z,jDW.P!/+6E^~k	0GDslOrKxPbUP\+	O~W(LmO/ @&,P~P,~P,P~~,^RnC1tcNmO~~6E	mYbW	c3BPn\xOb,	@&,~P,PP,~~P,P,P~Pn-xOR1CVx[CMP'~^mVI@&,~,P~,P,PP,P,~P,+-+	Y dDlDD~',flDn wmDk+c+-n	Y /*I@&,P~~,PP~~,P~P,~,+-xDR+	N,xPGlO+cwC.k+`-+	YRbI@&,P,P~P~~,P~P,~P,+-n	YRdGMY~',n7+UDRkYlMYcOWUY.k	ocv_C:sd/E#@&,~~P,P,P~P~~,P~P,~P,_~cyc!TTZPRPaCM/n&xD`+7+	ORx[RDWjOMkxTcB_C:sddB*~,FT#b DWKl9[+9?O.bxoc*i@&P,~,P~,P,PP,P,~P\nxDRr[,'P0I@&,PP,~~P,P,P~8bI@&@&~P,~P,P~~,PP&&,?OWMn,+-xD/Pbx,^l1tnR@&P~~,PP,~P,PPf n6D+	NcmCs_ldt]V+HTS~9lYnbp@&~P,~,P~,8*i@&,P,~8B@&@&P,P~&Ce@&,~P,Pe,]nY!D	PCVs~\nxDdP6W.~mP/rUTVnP9CHPWMWsPl^V,[kkwslH+[~1lVUNmD/,hnDT+9@&~P~~,e~k	OW,l~dbxosn,tC/4 @&P~,P,e@&,P,~PCP@$wmDCh,/YMrxTPNmOnP,b,XzXzhsN[P9CYPdOMkxL @&P~P,~C@&~,P,Pe,@$MnY!DUP_ld4,Pb	~+7+xD~4lkt,h4k^4,+-+	OPbNd~m/PVnH/~l	[,+-xDPW(L^YkPC/@&P~~,Pe,~P,PP,~~P,P,P~\Cs!+dR@&~P,P~MJ@&P~~,onY;C1tnwWMflD+=~0!x^YbWUc9lYSP1lVU[lM#@&P~P~`@&P~P,~P,PrW,`mCsx[lMb,	@&,P,PP,P,~P,P-lMP^C^/P{~mmV+	[CDc/aVrYcv-Bbi@&~P,P~~,PP~~,DnY!.	PFMW	WVbY4\W(ks+c+^C1t+]^l^/$ZDD$1l^/,FDD]NCYDi@&P~~,PP~~)@&@&P,~,P~,P7lD,+7nxD/~',	NI@&PP,~P,PPf nl1tv|.WUG^kOttG4bVn ml^4~~0!U1YrKxv3+H~,OXa+bPP@&~~,PP,~P,PP,y +mm4`OX2nBPWE	^YbWUcbN~~^mVbPP@&,P~,P,PP,P,~P,P~k6PcZnDW	GVbYtc^Gx6R1ls+U[mDd$0nXY$r[YR/4GS#~	@&~,P~,P,PP,P,~P,P~P,P.nDED	I@&,PP,~~P,P,P~P~~,8@&P,~P,P~~,PP~~,P~k6~vYza+K0P1l^,NmYnT,"x~EEx9n0bx+9vbPP@&,P~P~~,P~P,~P,P~~,PPy 6O+	[v+-xD/~,mms$9lO+Y#I@&,PP,~P,PP,~~P,P,8@&P~~,P~P,~P,8bI@&PP~~,P~P)bp@&@&,P,PP,P,.+DE.x,+-n	Y/p@&P,PP)S@&@&,P,P&eM@&,P~P,MP_lU[^+PdAbwnP-xOkP6WD,Y4nP1E.DxO~7k+S @&,PP,~Mz@&P,P~tCU9Vn?Srw)~W!xmOrKxc:m2*@&~,P,	@&,P,~P,P~/SkO^4P`n.W	WVbO4HK4bVnR-rhbPP@&P,P~~,PP^Ck+~B9CHBl@&P,PP,P,~P,P~k6PchmwRDzwP'{~v/Ska+s+WOE#~	@&~P,P~~,PP~~,P~P,FMWUKVbYttW(rVRdtKhHnXYfmz`*i@&,~~P,P,P~P~~)PnVknPP@&~~,PP~~,P~P,~,P~nDKxW^kD4HK4rVRd4KhnMn\GlXvbI@&,P,P~P~~,P~P)@&P,P~~,PP~~,P8DC0i@&@&P,PP,P,~mm/nPE:GUDtB=@&P,PP,~~P,P,Pr0~csl2RDzwPxx,B/Ara+s+6OE#~P@&,PP,P,~P,P~P,P~~nDW	GVbYttG8k^+c/4WAH6OHKUY4`bI@&PP~~,P~P,~,PN,+^/+,	@&~P,P~P,P~~,PP,~PnDW	GskDttW8ksnc/4WSKD\\G	Ytcbp@&~P,~,P~,P,PP)@&,~P,P~P,8@&~,PP)S@&@&PP,~&eC@&,P~P~M,2-+	OP4lU[^+D~WKD~Y4n,wCT+(+0KD^tmxL+,+-n	YPD4lDPks2s+s+	YdPsGmNrxT~W6@&~~,PPM~9+nw sbxVN,wlT+k @&,P~P,e@&~,PP,MP@$wlMChPK4N+^Y~n,P~P,3\xO~K4Ln^DR@&P,~,PM,@$alDm:,G4N+^Y,NCOmPPA-+	YP9COlc@&,P~P~MJ@&~P,~YKnCL)PW;	mOkKUv+S,NmYl*@&,~P,	@&P,P~~,PPkAkDmt,c[lDlcW2YrG	/ wm./Ni.^R\rnS#~	@&~,P~,P,Pmm/~BskUk1lsR	+6Dv)@&PP,~~P,P,P~PF.KxGVbOttW8r^+Rd4KhH+XOtWUDtv#i@&P,~P,P~P,P~~RwMn\xYGnWl!VD`bi@&~,P~P,~P,P~~(D+CVp@&@&P,~,P~,P1l/PEhk	k^l^O2.\B=@&P,PP,~~P,P,PFDGUKVrY4\W(ksnc/tGAhDn\tG	Y4v#p@&P,P,~P,P~P,Pn aD+7nxDf+6C;VD`*i@&P~~,P~P,~P,P8.l3I@&@&P~P,~,P~1lk+PExaY9lzB=@&~~,PP,~P,PP,F.W	W^kOt\G(ks+cdtKhHnXYfCzv#I@&,~,P~,P,PP,P wM+-+	Y9n6lE^O`*i@&,~~P,P,P~P~~(Dnl0I@&@&P~~,PP~~1ld+,vaDn7NmXB=@&,~P,P~P,P~~,|DKUW^kY4\G4bVRdtGAhDn\GCXv#I@&,PP~~,P~P,~,+ aD\+	YGn0mEsYv#I@&,PP,~P,PP,~~4M+m3I@&~~,P~P,~8@&P~~,8~@&@&,P~PJMC@&~,P,PeJ@&,~P,VGl9nCL)P6;x1YkKUc#@&P,P~	@&~,P~P,~PkhrO1tPcuKD[+tG(ksR1EDM+	Onmon`*#~`@&PP,~P,PP1Cd+,BsWUY4-b+AB=@&P,P~~,PP~~,PFDKUKVrDttW4bV \b+AP{PEhKxY4Ei@&PP,~~P,P,P~P&&,`.+*8EbV[~Dt+~hbxrmms,WU^X,k0,h~x+[PDW@&~,PP,~P,PP,~r0,`e^cJ:VMWUW^rY4HrUbmls9mYnJ* N;hGlDl`rNmO+r#~u-@&~~,PP,~P,PP,~~P,`f`EaV.KxGVbOttkUr1lV9CD+E#c%$:9mYm`J9lDnJ*ROWUY.r	o`r\J*P"{~FDKxKVrY4\K4rV NmYn DW?O.bxL`r\r#b*PP@&P,P,~P,P~P,P~~,P|MGxKVkD4\W(k^+ :G-KGHKUY4`F.KxWsrDt\W(r^+ 9lD+#p@&,~P,P~P,P~~,8@&,~P,PP,~~P,P(DnlVI@&@&~P,~P,P~^m/+~vK\nD7rhv=@&,PP,P,~P,P~PnDGUKVkD4HK4k^n \b+SPxPEG7+.\bnhri@&~,PP~~,P~P,~b0~v"nDW	W^rY4HG4bVn 4l\6\D\bnA#,	@&P~P~~,P~P,~P,P~~nDWUG^kOttG(ksR^Wl927nxD/c|MWUG^kY4\W(kV [lD+BPFDGUKVrY4\W(ksncNlOncmsW	nv# mN9flH/v{#BPEW7+.-b+hrbi@&PP,~~P,P,P~P~~,PFDKUW^kO4tW4rsR4l7n}\nM\b+h,',OD!+I@&,P~~,PP,~P,P8@&~~P,P,P~P~~,4.+mVi@&@&~~,PP~~,mC/~	Es^)@&PP,P,~P,P~P,4.nm3i@&@&P,PP,~~P1lk+~B[CH\r+Sv)@&P~~,PP~~9+Wl!sD)@&,P,PP,P,~P,PFDKxGsbYttG4bV+c-r+SP{PENCzri@&P,~P,P~~,PP~yvJ:3MG	WsbY4flHfmO+r# tD:scnDW	GVbYttG8k^+cNCYn DWjYMrxT`E[9NJb~3PEPr~3PFMW	WVbY4\W(ks+cNCORYKjYMkxTcENr#*i@&P~~,P~P,~P,PF.KxWsrDt\W(r^+ ^WmN27+	O/v|.W	WsrDtHK8k^+R9CO+BPnDGxGsbY4HK8k^+ [mY+S~rNCXrbp@&~,P,PP,P,~P,4.+m3I@&,PP,~P,P8@&~~P,8B@&@&P~~,WUfK^Es+UO"+l[z=PWE	^DkG	`*@&P,P,`@&,P~P,P~~nDW	GVbYttG8k^+cNCYn~{PU+S~fmYnc*i@&@&~,P~P,~,z&,A!kV9P^r/DPG0,mCsxNm./,h+,ACxDR@&P~P~~,P~^cnl1tcFMWxGsbY4R1G	0 1l^+x9lMd~,0;x1YrG	`3z~,\l^;n#,	@&P~P~~,P~P,~PfRnC1t`-C^En~,W!x^DkKx`1l^SPbxWW*P`@&,PP,~P,PP,~~P,P,kWPcr	0GRk4WS#~`@&PP~~,P~P,~,P~,P,PP,Pn.W	WskDt\G(kV mmV+	[CDkRaEdtc,0+z~,^l^TbI@&PP~~,P~P,~,P~,P,8@&,P,~P,P~P,P~N*i@&,~P,PP,~N#p@&@&P~P~~,P~zJ~Abx[~1Vk^V,lUN,dSk2P\+	Yk@&P,P~P,P~yvB4K[XE#R(rUNvBkhrwns0OBB~|MWUG^kY4\K4rV 4lU9V?hbwb@&,P~P,P~~,PP, 4bxNvvdhbwDro4OE~~|MGxKVrO4HW8r^+ tmU9VnUhbw+*i@&~P,P~P,Pyc9Wm!h+	Y#c8rx9`EwCond4WABB~|MWUG^kY4\K4rV ^WC9nmo+*@&,~P,P~P,P~~,R4bUNvBwmLn40KDnm4C	onBB~|MWUG^kY4\K4rV DWKmo#@&,P,~P,P~P,P~ Kx`r2lT+/4GAJBPran\nUD\r+SE~,0;U1YkGUv+-+	OBP;b#,	@&,P,~P,P~P,P~~,PPn.W	WVbO4HK4bVnR-rh~',E+7+UOri@&~~,P~P,~,P~,8*i@&@&P,~P,P~Pf`v:0DW	GVbYt hrxbmmVv# G	`vm^rm0BS~EYNvS,0;x1ObWUv+*P	@&P,~P,P~P,P~~nDW	GVbYttG8k^+c/nVn^DHGxD4fmXcyv+ROCMonY* N;hGlDl`ENmO+E#bi@&P~~,PP,~8*i@&,~~P)@&)i@&@&ycnDGxKskDt\G(kVn Kx9W1;s+UDIlNH#p@&ZasdAA==^#~@