aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorChristian Grothoff <christian@grothoff.org>2012-09-04 11:00:51 +0000
committerChristian Grothoff <christian@grothoff.org>2012-09-04 11:00:51 +0000
commit4c01af4854fa50bdeabb9fa093438f05a88ad6f1 (patch)
tree2e7486e876a66da8980ef6cfd521d8c06c8cc829
parent4ea4407d8270157813c700dacdaca84f856882fe (diff)
downloadlibextractor-4c01af4854fa50bdeabb9fa093438f05a88ad6f1.tar.gz
libextractor-4c01af4854fa50bdeabb9fa093438f05a88ad6f1.zip
add description meta data
-rw-r--r--src/plugins/test_deb.c32
1 files changed, 28 insertions, 4 deletions
diff --git a/src/plugins/test_deb.c b/src/plugins/test_deb.c
index 93a5586..2cad522 100644
--- a/src/plugins/test_deb.c
+++ b/src/plugins/test_deb.c
@@ -126,16 +126,40 @@ main (int argc, char *argv[])
126 strlen ("standard") + 1, 126 strlen ("standard") + 1,
127 0 127 0
128 }, 128 },
129#if 0
130 { 129 {
131 EXTRACTOR_METATYPE_DESCRIPTION, 130 EXTRACTOR_METATYPE_DESCRIPTION,
132 EXTRACTOR_METAFORMAT_UTF8, 131 EXTRACTOR_METAFORMAT_UTF8,
133 "text/plain", 132 "text/plain",
134 "", 133 "high-quality block-sorting file compressor - utilities\n"
135 strlen ("") + 1, 134" bzip2 is a freely available, patent free, high-quality data compressor.\n"
135" It typically compresses files to within 10% to 15% of the best available\n"
136" techniques, whilst being around twice as fast at compression and six\n"
137" times faster at decompression.\n"
138" .\n"
139" bzip2 compresses files using the Burrows-Wheeler block-sorting text\n"
140" compression algorithm, and Huffman coding. Compression is generally\n"
141" considerably better than that achieved by more conventional\n"
142" LZ77/LZ78-based compressors, and approaches the performance of the PPM\n"
143" family of statistical compressors.\n"
144" .\n"
145" The archive file format of bzip2 (.bz2) is incompatible with that of its\n"
146" predecessor, bzip (.bz).",
147 strlen ("high-quality block-sorting file compressor - utilities\n"
148" bzip2 is a freely available, patent free, high-quality data compressor.\n"
149" It typically compresses files to within 10% to 15% of the best available\n"
150" techniques, whilst being around twice as fast at compression and six\n"
151" times faster at decompression.\n"
152" .\n"
153" bzip2 compresses files using the Burrows-Wheeler block-sorting text\n"
154" compression algorithm, and Huffman coding. Compression is generally\n"
155" considerably better than that achieved by more conventional\n"
156" LZ77/LZ78-based compressors, and approaches the performance of the PPM\n"
157" family of statistical compressors.\n"
158" .\n"
159" The archive file format of bzip2 (.bz2) is incompatible with that of its\n"
160" predecessor, bzip (.bz).") + 1,
136 0 161 0
137 }, 162 },
138#endif
139 { 0, 0, NULL, NULL, 0, -1 } 163 { 0, 0, NULL, NULL, 0, -1 }
140 }; 164 };
141 struct ProblemSet ps[] = 165 struct ProblemSet ps[] =