quicklz (empty) → 1.5.0.1
raw patch · 9 files changed
+1519/−0 lines, 9 filesdep +QuickCheckdep +basedep +bytestringsetup-changed
Dependencies added: QuickCheck, base, bytestring, quicklz, test-framework, test-framework-quickcheck2
Files
- Codec/Compression/QuickLZ.hsc +81/−0
- LICENSE +339/−0
- README +3/−0
- Setup.hs +2/−0
- cbits/quicklz.c +848/−0
- cbits/quicklz.h +142/−0
- quicklz.cabal +66/−0
- tests/Properties.hs +17/−0
- tests/ex1.hs +21/−0
+ Codec/Compression/QuickLZ.hsc view
@@ -0,0 +1,81 @@+{-# LANGUAGE CPP, ForeignFunctionInterface #-} + +-- | +-- Module : Codec.Compression.QuickLZ +-- Copyright : (c) Austin Seipp 2011 +-- License : GPLv2 +-- +-- Maintainer : as@hacks.yi.org +-- Stability : experimental +-- Portability : portable +-- +-- This module provides a high level 'ByteString' interface to +-- the QuickLZ library. More info about quicklz can be found here: +-- http://quicklz.com +-- +-- QuickLZ is fast and compresses very well. +-- The library that is bundled with this version is QuickLZ v1.5.0, +-- with the compression level set to 1. +-- +-- Streaming/enumerator interface coming soon. +-- +module Codec.Compression.QuickLZ +( -- * Compressing and decompressing strict 'ByteString's + compress -- :: S.ByteString -> S.ByteString +, decompress -- :: S.ByteString -> S.ByteString +) where + +import Foreign +import Foreign.C + +import qualified Data.ByteString.Char8 as S +import qualified Data.ByteString.Internal as SI +import qualified Data.ByteString.Unsafe as U + +#include <quicklz.h> + +-- +-- High-level interface +-- + +-- | Compresses the input 'ByteString'. +compress :: S.ByteString -> S.ByteString +compress xs + | S.null xs = S.empty + | otherwise = + unsafePerformIO . allocaBytes qlz_state_compress_sz $ \compress_state -> + SI.createAndTrim (S.length xs + 400) $ \output -> do + U.unsafeUseAsCStringLen xs $ \(cstr,len) -> + c_qlz_compress cstr output len compress_state + + +-- | Decompress the input 'ByteString'. +decompress :: S.ByteString -> S.ByteString +decompress xs + | S.null xs = S.empty + | otherwise = + unsafePerformIO . allocaBytes qlz_state_decompress_sz $ \decompress_state -> do + sz <- U.unsafeUseAsCString xs c_qlz_size_decompressed + SI.createAndTrim sz $ \output -> do + U.unsafeUseAsCString xs $ \cstr -> + c_qlz_decompress cstr output decompress_state + +-- +-- Simple bindings to some constants +-- +qlz_state_compress_sz :: Int +qlz_state_compress_sz = #{size qlz_state_compress} +qlz_state_decompress_sz :: Int +qlz_state_decompress_sz = #{size qlz_state_decompress} + +-- +-- FFI Bindings +-- +foreign import ccall unsafe "quicklz.h qlz_compress" + c_qlz_compress :: Ptr a -> Ptr b -> Int -> Ptr c -> IO Int + +foreign import ccall unsafe "quicklz.h qlz_decompress" + c_qlz_decompress :: Ptr a -> Ptr b -> Ptr c -> IO Int + +foreign import ccall unsafe "quicklz.h qlz_size_decompressed" + c_qlz_size_decompressed :: CString -> IO Int
+ LICENSE view
@@ -0,0 +1,339 @@+ GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Lesser General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License along + with this program; if not, write to the Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) year name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + <signature of Ty Coon>, 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License.
+ README view
@@ -0,0 +1,3 @@+hs-quicklz: haskell bindings to quicklz + +TODO
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple +main = defaultMain
+ cbits/quicklz.c view
@@ -0,0 +1,848 @@+// Fast data compression library+// Copyright (C) 2006-2011 Lasse Mikkel Reinhold+// lar@quicklz.com+//+// QuickLZ can be used for free under the GPL 1, 2 or 3 license (where anything +// released into public must be open source) or under a commercial license if such +// has been acquired (see http://www.quicklz.com/order.html). The commercial license +// does not cover derived or ported versions created by third parties under GPL.++// 1.5.0 final++#include "quicklz.h"++#if QLZ_VERSION_MAJOR != 1 || QLZ_VERSION_MINOR != 5 || QLZ_VERSION_REVISION != 0+ #error quicklz.c and quicklz.h have different versions+#endif++#if (defined(__X86__) || defined(__i386__) || defined(i386) || defined(_M_IX86) || defined(__386__) || defined(__x86_64__) || defined(_M_X64))+ #define X86X64+#endif++#define MINOFFSET 2+#define UNCONDITIONAL_MATCHLEN 6+#define UNCOMPRESSED_END 4+#define CWORD_LEN 4++#if QLZ_COMPRESSION_LEVEL == 1 && defined QLZ_PTR_64 && QLZ_STREAMING_BUFFER == 0+ #define OFFSET_BASE source+ #define CAST (ui32)(size_t)+#else+ #define OFFSET_BASE 0+ #define CAST+#endif++int qlz_get_setting(int setting)+{+ switch (setting)+ {+ case 0: return QLZ_COMPRESSION_LEVEL;+ case 1: return sizeof(qlz_state_compress);+ case 2: return sizeof(qlz_state_decompress);+ case 3: return QLZ_STREAMING_BUFFER;+#ifdef QLZ_MEMORY_SAFE+ case 6: return 1;+#else+ case 6: return 0;+#endif+ case 7: return QLZ_VERSION_MAJOR;+ case 8: return QLZ_VERSION_MINOR;+ case 9: return QLZ_VERSION_REVISION;+ }+ return -1;+}++#if QLZ_COMPRESSION_LEVEL == 1+static int same(const unsigned char *src, size_t n)+{+ while(n > 0 && *(src + n) == *src)+ n--;+ return n == 0 ? 1 : 0;+}+#endif++static void reset_table_compress(qlz_state_compress *state)+{+ int i;+ for(i = 0; i < QLZ_HASH_VALUES; i++)+ {+#if QLZ_COMPRESSION_LEVEL == 1+ state->hash[i].offset = 0;+#else+ state->hash_counter[i] = 0;+#endif+ }+}++static void reset_table_decompress(qlz_state_decompress *state)+{+ int i;+ (void)state;+ (void)i;+#if QLZ_COMPRESSION_LEVEL == 2+ for(i = 0; i < QLZ_HASH_VALUES; i++)+ {+ state->hash_counter[i] = 0;+ }+#endif+}++static __inline ui32 hash_func(ui32 i)+{+#if QLZ_COMPRESSION_LEVEL == 2+ return ((i >> 9) ^ (i >> 13) ^ i) & (QLZ_HASH_VALUES - 1);+#else+ return ((i >> 12) ^ i) & (QLZ_HASH_VALUES - 1);+#endif+}++static __inline ui32 fast_read(void const *src, ui32 bytes)+{+#ifndef X86X64+ unsigned char *p = (unsigned char*)src;+ switch (bytes)+ {+ case 4:+ return(*p | *(p + 1) << 8 | *(p + 2) << 16 | *(p + 3) << 24);+ case 3: + return(*p | *(p + 1) << 8 | *(p + 2) << 16);+ case 2:+ return(*p | *(p + 1) << 8);+ case 1: + return(*p);+ }+ return 0;+#else+ if (bytes >= 1 && bytes <= 4)+ return *((ui32*)src);+ else+ return 0;+#endif+}++static __inline ui32 hashat(const unsigned char *src)+{+ ui32 fetch, hash;+ fetch = fast_read(src, 3);+ hash = hash_func(fetch);+ return hash;+}++static __inline void fast_write(ui32 f, void *dst, size_t bytes)+{+#ifndef X86X64+ unsigned char *p = (unsigned char*)dst;++ switch (bytes)+ {+ case 4: + *p = (unsigned char)f;+ *(p + 1) = (unsigned char)(f >> 8);+ *(p + 2) = (unsigned char)(f >> 16);+ *(p + 3) = (unsigned char)(f >> 24);+ return;+ case 3:+ *p = (unsigned char)f;+ *(p + 1) = (unsigned char)(f >> 8);+ *(p + 2) = (unsigned char)(f >> 16);+ return;+ case 2:+ *p = (unsigned char)f;+ *(p + 1) = (unsigned char)(f >> 8);+ return;+ case 1:+ *p = (unsigned char)f;+ return;+ }+#else+ switch (bytes)+ {+ case 4: + *((ui32*)dst) = f;+ return;+ case 3:+ *((ui32*)dst) = f;+ return;+ case 2:+ *((ui16 *)dst) = (ui16)f;+ return;+ case 1:+ *((unsigned char*)dst) = (unsigned char)f;+ return;+ }+#endif+}+++size_t qlz_size_decompressed(const char *source)+{+ ui32 n, r;+ n = (((*source) & 2) == 2) ? 4 : 1;+ r = fast_read(source + 1 + n, n);+ r = r & (0xffffffff >> ((4 - n)*8));+ return r;+}++size_t qlz_size_compressed(const char *source)+{+ ui32 n, r;+ n = (((*source) & 2) == 2) ? 4 : 1;+ r = fast_read(source + 1, n);+ r = r & (0xffffffff >> ((4 - n)*8));+ return r;+}++size_t qlz_size_header(const char *source)+{+ size_t n = 2*((((*source) & 2) == 2) ? 4 : 1) + 1;+ return n;+}+++static __inline void memcpy_up(unsigned char *dst, const unsigned char *src, ui32 n)+{+ // Caution if modifying memcpy_up! Overlap of dst and src must be special handled.+#ifndef X86X64+ unsigned char *end = dst + n;+ while(dst < end)+ {+ *dst = *src;+ dst++;+ src++;+ }+#else+ ui32 f = 0;+ do+ {+ *(ui32 *)(dst + f) = *(ui32 *)(src + f);+ f += MINOFFSET + 1;+ }+ while (f < n);+#endif+}++static __inline void update_hash(qlz_state_decompress *state, const unsigned char *s)+{+#if QLZ_COMPRESSION_LEVEL == 1+ ui32 hash;+ hash = hashat(s);+ state->hash[hash].offset = s;+ state->hash_counter[hash] = 1;+#elif QLZ_COMPRESSION_LEVEL == 2+ ui32 hash;+ unsigned char c;+ hash = hashat(s);+ c = state->hash_counter[hash];+ state->hash[hash].offset[c & (QLZ_POINTERS - 1)] = s;+ c++;+ state->hash_counter[hash] = c;+#endif+ (void)state;+ (void)s;+}++#if QLZ_COMPRESSION_LEVEL <= 2+static void update_hash_upto(qlz_state_decompress *state, unsigned char **lh, const unsigned char *max)+{+ while(*lh < max)+ {+ (*lh)++;+ update_hash(state, *lh);+ }+}+#endif++static size_t qlz_compress_core(const unsigned char *source, unsigned char *destination, size_t size, qlz_state_compress *state)+{+ const unsigned char *last_byte = source + size - 1;+ const unsigned char *src = source;+ unsigned char *cword_ptr = destination;+ unsigned char *dst = destination + CWORD_LEN;+ ui32 cword_val = 1U << 31;+ const unsigned char *last_matchstart = last_byte - UNCONDITIONAL_MATCHLEN - UNCOMPRESSED_END; + ui32 fetch = 0;+ unsigned int lits = 0;++ (void) lits;++ if(src <= last_matchstart)+ fetch = fast_read(src, 3);+ + while(src <= last_matchstart)+ {+ if ((cword_val & 1) == 1)+ {+ // store uncompressed if compression ratio is too low+ if (src > source + (size >> 1) && dst - destination > src - source - ((src - source) >> 5))+ return 0;++ fast_write((cword_val >> 1) | (1U << 31), cword_ptr, CWORD_LEN);++ cword_ptr = dst;+ dst += CWORD_LEN;+ cword_val = 1U << 31;+ fetch = fast_read(src, 3);+ }+#if QLZ_COMPRESSION_LEVEL == 1+ {+ const unsigned char *o;+ ui32 hash, cached;++ hash = hash_func(fetch);+ cached = fetch ^ state->hash[hash].cache;+ state->hash[hash].cache = fetch;++ o = state->hash[hash].offset + OFFSET_BASE;+ state->hash[hash].offset = CAST(src - OFFSET_BASE);++#ifdef X86X64+ if ((cached & 0xffffff) == 0 && o != OFFSET_BASE && (src - o > MINOFFSET || (src == o + 1 && lits >= 3 && src > source + 3 && same(src - 3, 6))))+ {+ if(cached != 0)+ {+#else+ if (cached == 0 && o != OFFSET_BASE && (src - o > MINOFFSET || (src == o + 1 && lits >= 3 && src > source + 3 && same(src - 3, 6))))+ {+ if (*(o + 3) != *(src + 3))+ {+#endif+ hash <<= 4;+ cword_val = (cword_val >> 1) | (1U << 31);+ fast_write((3 - 2) | hash, dst, 2);+ src += 3;+ dst += 2;+ }+ else+ {+ const unsigned char *old_src = src;+ size_t matchlen;+ hash <<= 4;++ cword_val = (cword_val >> 1) | (1U << 31);+ src += 4;++ if(*(o + (src - old_src)) == *src)+ {+ src++;+ if(*(o + (src - old_src)) == *src)+ {+ size_t q = last_byte - UNCOMPRESSED_END - (src - 5) + 1;+ size_t remaining = q > 255 ? 255 : q;+ src++; + while(*(o + (src - old_src)) == *src && (size_t)(src - old_src) < remaining)+ src++;+ }+ }++ matchlen = src - old_src;+ if (matchlen < 18)+ {+ fast_write((ui32)(matchlen - 2) | hash, dst, 2);+ dst += 2;+ } + else+ {+ fast_write((ui32)(matchlen << 16) | hash, dst, 3);+ dst += 3;+ }+ }+ fetch = fast_read(src, 3);+ lits = 0;+ }+ else+ {+ lits++;+ *dst = *src;+ src++;+ dst++;+ cword_val = (cword_val >> 1);+#ifdef X86X64+ fetch = fast_read(src, 3);+#else+ fetch = (fetch >> 8 & 0xffff) | (*(src + 2) << 16);+#endif+ }+ }+#elif QLZ_COMPRESSION_LEVEL >= 2+ {+ const unsigned char *o, *offset2;+ ui32 hash, matchlen, k, m, best_k = 0;+ unsigned char c;+ size_t remaining = (last_byte - UNCOMPRESSED_END - src + 1) > 255 ? 255 : (last_byte - UNCOMPRESSED_END - src + 1);+ (void)best_k;+ ++ //hash = hashat(src);+ fetch = fast_read(src, 3);+ hash = hash_func(fetch);++ c = state->hash_counter[hash];++ offset2 = state->hash[hash].offset[0];+ if(offset2 < src - MINOFFSET && c > 0 && ((fast_read(offset2, 3) ^ fetch) & 0xffffff) == 0)+ { + matchlen = 3;+ if(*(offset2 + matchlen) == *(src + matchlen))+ {+ matchlen = 4;+ while(*(offset2 + matchlen) == *(src + matchlen) && matchlen < remaining)+ matchlen++;+ }+ }+ else+ matchlen = 0;+ for(k = 1; k < QLZ_POINTERS && c > k; k++)+ {+ o = state->hash[hash].offset[k];+#if QLZ_COMPRESSION_LEVEL == 3+ if(((fast_read(o, 3) ^ fetch) & 0xffffff) == 0 && o < src - MINOFFSET)+#elif QLZ_COMPRESSION_LEVEL == 2+ if(*(src + matchlen) == *(o + matchlen) && ((fast_read(o, 3) ^ fetch) & 0xffffff) == 0 && o < src - MINOFFSET)+#endif+ { + m = 3;+ while(*(o + m) == *(src + m) && m < remaining)+ m++;+#if QLZ_COMPRESSION_LEVEL == 3+ if ((m > matchlen) || (m == matchlen && o > offset2))+#elif QLZ_COMPRESSION_LEVEL == 2+ if (m > matchlen)+#endif+ {+ offset2 = o;+ matchlen = m;+ best_k = k;+ }+ }+ }+ o = offset2;+ state->hash[hash].offset[c & (QLZ_POINTERS - 1)] = src;+ c++;+ state->hash_counter[hash] = c;++#if QLZ_COMPRESSION_LEVEL == 3+ if(matchlen > 2 && src - o < 131071)+ {+ ui32 u;+ size_t offset = src - o;++ for(u = 1; u < matchlen; u++)+ { + hash = hashat(src + u);+ c = state->hash_counter[hash]++;+ state->hash[hash].offset[c & (QLZ_POINTERS - 1)] = src + u;+ }++ cword_val = (cword_val >> 1) | (1U << 31);+ src += matchlen;++ if(matchlen == 3 && offset <= 63)+ {+ *dst = (unsigned char)(offset << 2);+ dst++;+ }+ else if (matchlen == 3 && offset <= 16383)+ {+ ui32 f = (ui32)((offset << 2) | 1);+ fast_write(f, dst, 2);+ dst += 2;+ } + else if (matchlen <= 18 && offset <= 1023)+ {+ ui32 f = ((matchlen - 3) << 2) | ((ui32)offset << 6) | 2;+ fast_write(f, dst, 2);+ dst += 2;+ }++ else if(matchlen <= 33)+ {+ ui32 f = ((matchlen - 2) << 2) | ((ui32)offset << 7) | 3;+ fast_write(f, dst, 3);+ dst += 3;+ }+ else+ {+ ui32 f = ((matchlen - 3) << 7) | ((ui32)offset << 15) | 3;+ fast_write(f, dst, 4);+ dst += 4;+ }+ }+ else+ {+ *dst = *src;+ src++;+ dst++;+ cword_val = (cword_val >> 1);+ }+#elif QLZ_COMPRESSION_LEVEL == 2++ if(matchlen > 2)+ {+ cword_val = (cword_val >> 1) | (1U << 31);+ src += matchlen; ++ if (matchlen < 10)+ { + ui32 f = best_k | ((matchlen - 2) << 2) | (hash << 5);+ fast_write(f, dst, 2);+ dst += 2;+ }+ else+ {+ ui32 f = best_k | (matchlen << 16) | (hash << 5);+ fast_write(f, dst, 3);+ dst += 3;+ }+ }+ else+ {+ *dst = *src;+ src++;+ dst++;+ cword_val = (cword_val >> 1);+ }+#endif+ }+#endif+ }+ while (src <= last_byte)+ {+ if ((cword_val & 1) == 1)+ {+ fast_write((cword_val >> 1) | (1U << 31), cword_ptr, CWORD_LEN);+ cword_ptr = dst;+ dst += CWORD_LEN;+ cword_val = 1U << 31;+ }+#if QLZ_COMPRESSION_LEVEL < 3+ if (src <= last_byte - 3)+ {+#if QLZ_COMPRESSION_LEVEL == 1+ ui32 hash, fetch;+ fetch = fast_read(src, 3);+ hash = hash_func(fetch);+ state->hash[hash].offset = CAST(src - OFFSET_BASE);+ state->hash[hash].cache = fetch;+#elif QLZ_COMPRESSION_LEVEL == 2+ ui32 hash;+ unsigned char c;+ hash = hashat(src);+ c = state->hash_counter[hash];+ state->hash[hash].offset[c & (QLZ_POINTERS - 1)] = src;+ c++;+ state->hash_counter[hash] = c;+#endif+ }+#endif+ *dst = *src;+ src++;+ dst++;+ cword_val = (cword_val >> 1);+ }++ while((cword_val & 1) != 1)+ cword_val = (cword_val >> 1);++ fast_write((cword_val >> 1) | (1U << 31), cword_ptr, CWORD_LEN);++ // min. size must be 9 bytes so that the qlz_size functions can take 9 bytes as argument+ return dst - destination < 9 ? 9 : dst - destination;+}++static size_t qlz_decompress_core(const unsigned char *source, unsigned char *destination, size_t size, qlz_state_decompress *state, const unsigned char *history)+{+ const unsigned char *src = source + qlz_size_header((const char *)source);+ unsigned char *dst = destination;+ const unsigned char *last_destination_byte = destination + size - 1;+ ui32 cword_val = 1;+ const unsigned char *last_matchstart = last_destination_byte - UNCONDITIONAL_MATCHLEN - UNCOMPRESSED_END;+ unsigned char *last_hashed = destination - 1;+ const unsigned char *last_source_byte = source + qlz_size_compressed((const char *)source) - 1;+ static const ui32 bitlut[16] = {4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0};++ (void) last_source_byte;+ (void) last_hashed;+ (void) state;+ (void) history;++ for(;;) + {+ ui32 fetch;++ if (cword_val == 1)+ {+#ifdef QLZ_MEMORY_SAFE+ if(src + CWORD_LEN - 1 > last_source_byte)+ return 0;+#endif+ cword_val = fast_read(src, CWORD_LEN);+ src += CWORD_LEN;+ }++#ifdef QLZ_MEMORY_SAFE+ if(src + 4 - 1 > last_source_byte)+ return 0;+#endif++ fetch = fast_read(src, 4);++ if ((cword_val & 1) == 1)+ {+ ui32 matchlen;+ const unsigned char *offset2;++#if QLZ_COMPRESSION_LEVEL == 1+ ui32 hash;+ cword_val = cword_val >> 1;+ hash = (fetch >> 4) & 0xfff;+ offset2 = (const unsigned char *)(size_t)state->hash[hash].offset;++ if((fetch & 0xf) != 0)+ {+ matchlen = (fetch & 0xf) + 2;+ src += 2;+ }+ else+ {+ matchlen = *(src + 2);+ src += 3; + } ++#elif QLZ_COMPRESSION_LEVEL == 2+ ui32 hash;+ unsigned char c;+ cword_val = cword_val >> 1;+ hash = (fetch >> 5) & 0x7ff;+ c = (unsigned char)(fetch & 0x3);+ offset2 = state->hash[hash].offset[c];++ if((fetch & (28)) != 0)+ {+ matchlen = ((fetch >> 2) & 0x7) + 2;+ src += 2;+ }+ else+ {+ matchlen = *(src + 2);+ src += 3; + } ++#elif QLZ_COMPRESSION_LEVEL == 3+ ui32 offset;+ cword_val = cword_val >> 1;+ if ((fetch & 3) == 0)+ {+ offset = (fetch & 0xff) >> 2;+ matchlen = 3;+ src++;+ }+ else if ((fetch & 2) == 0)+ {+ offset = (fetch & 0xffff) >> 2;+ matchlen = 3;+ src += 2;+ }+ else if ((fetch & 1) == 0)+ {+ offset = (fetch & 0xffff) >> 6;+ matchlen = ((fetch >> 2) & 15) + 3;+ src += 2;+ }+ else if ((fetch & 127) != 3)+ {+ offset = (fetch >> 7) & 0x1ffff;+ matchlen = ((fetch >> 2) & 0x1f) + 2;+ src += 3;+ }+ else+ {+ offset = (fetch >> 15);+ matchlen = ((fetch >> 7) & 255) + 3;+ src += 4;+ }++ offset2 = dst - offset;+#endif+ +#ifdef QLZ_MEMORY_SAFE+ if(offset2 < history || offset2 > dst - MINOFFSET - 1)+ return 0;++ if(matchlen > (ui32)(last_destination_byte - dst - UNCOMPRESSED_END + 1))+ return 0;+#endif++ memcpy_up(dst, offset2, matchlen);+ dst += matchlen;++#if QLZ_COMPRESSION_LEVEL <= 2+ update_hash_upto(state, &last_hashed, dst - matchlen);+ last_hashed = dst - 1;+#endif+ }+ else+ {+ if (dst < last_matchstart)+ {+ unsigned int n = bitlut[cword_val & 0xf];+#ifdef X86X64+ *(ui32 *)dst = *(ui32 *)src;+#else+ memcpy_up(dst, src, 4);+#endif+ cword_val = cword_val >> n;+ dst += n;+ src += n;+#if QLZ_COMPRESSION_LEVEL <= 2+ update_hash_upto(state, &last_hashed, dst - 3); +#endif+ }+ else+ { + while(dst <= last_destination_byte)+ {+ if (cword_val == 1)+ {+ src += CWORD_LEN;+ cword_val = 1U << 31;+ }+#ifdef QLZ_MEMORY_SAFE+ if(src >= last_source_byte + 1)+ return 0;+#endif+ *dst = *src;+ dst++;+ src++;+ cword_val = cword_val >> 1;+ }++#if QLZ_COMPRESSION_LEVEL <= 2+ update_hash_upto(state, &last_hashed, last_destination_byte - 3); // todo, use constant+#endif+ return size;+ }++ }+ }+}++size_t qlz_compress(const void *source, char *destination, size_t size, qlz_state_compress *state)+{+ size_t r;+ ui32 compressed;+ size_t base;++ if(size == 0 || size > 0xffffffff - 400)+ return 0;++ if(size < 216)+ base = 3;+ else+ base = 9;++#if QLZ_STREAMING_BUFFER > 0+ if (state->stream_counter + size - 1 >= QLZ_STREAMING_BUFFER)+#endif+ {+ reset_table_compress(state);+ r = base + qlz_compress_core((const unsigned char *)source, (unsigned char*)destination + base, size, state);+#if QLZ_STREAMING_BUFFER > 0+ reset_table_compress(state);+#endif+ if(r == base)+ {+ memcpy(destination + base, source, size);+ r = size + base;+ compressed = 0;+ }+ else+ {+ compressed = 1;+ }+ state->stream_counter = 0;+ }+#if QLZ_STREAMING_BUFFER > 0+ else+ {+ unsigned char *src = state->stream_buffer + state->stream_counter;++ memcpy(src, source, size);+ r = base + qlz_compress_core(src, (unsigned char*)destination + base, size, state);++ if(r == base)+ {+ memcpy(destination + base, src, size);+ r = size + base;+ compressed = 0;+ reset_table_compress(state);+ }+ else+ {+ compressed = 1;+ }+ state->stream_counter += size;+ }+#endif+ if(base == 3)+ {+ *destination = (unsigned char)(0 | compressed);+ *(destination + 1) = (unsigned char)r;+ *(destination + 2) = (unsigned char)size;+ }+ else+ {+ *destination = (unsigned char)(2 | compressed);+ fast_write((ui32)r, destination + 1, 4);+ fast_write((ui32)size, destination + 5, 4);+ }+ + *destination |= (QLZ_COMPRESSION_LEVEL << 2);+ *destination |= (1 << 6);+ *destination |= ((QLZ_STREAMING_BUFFER == 0 ? 0 : (QLZ_STREAMING_BUFFER == 100000 ? 1 : (QLZ_STREAMING_BUFFER == 1000000 ? 2 : 3))) << 4);++// 76543210+// 01SSLLHC++ return r;+}++size_t qlz_decompress(const char *source, void *destination, qlz_state_decompress *state)+{+ size_t dsiz = qlz_size_decompressed(source);++#if QLZ_STREAMING_BUFFER > 0+ if (state->stream_counter + qlz_size_decompressed(source) - 1 >= QLZ_STREAMING_BUFFER) +#endif+ {+ if((*source & 1) == 1)+ {+ reset_table_decompress(state);+ dsiz = qlz_decompress_core((const unsigned char *)source, (unsigned char *)destination, dsiz, state, (const unsigned char *)destination);+ }+ else+ {+ memcpy(destination, source + qlz_size_header(source), dsiz);+ }+ state->stream_counter = 0;+ reset_table_decompress(state);+ }+#if QLZ_STREAMING_BUFFER > 0+ else+ {+ unsigned char *dst = state->stream_buffer + state->stream_counter;+ if((*source & 1) == 1)+ {+ dsiz = qlz_decompress_core((const unsigned char *)source, dst, dsiz, state, (const unsigned char *)state->stream_buffer);+ }+ else+ {+ memcpy(dst, source + qlz_size_header(source), dsiz);+ reset_table_decompress(state);+ }+ memcpy(destination, dst, dsiz);+ state->stream_counter += dsiz;+ }+#endif+ return dsiz;+}+
+ cbits/quicklz.h view
@@ -0,0 +1,142 @@+#ifndef QLZ_HEADER+#define QLZ_HEADER++// Fast data compression library+// Copyright (C) 2006-2011 Lasse Mikkel Reinhold+// lar@quicklz.com+//+// QuickLZ can be used for free under the GPL 1, 2 or 3 license (where anything +// released into public must be open source) or under a commercial license if such +// has been acquired (see http://www.quicklz.com/order.html). The commercial license +// does not cover derived or ported versions created by third parties under GPL.++// You can edit following user settings. Data must be decompressed with the same +// setting of QLZ_COMPRESSION_LEVEL and QLZ_STREAMING_BUFFER as it was compressed+// (see manual). If QLZ_STREAMING_BUFFER > 0, scratch buffers must be initially+// zeroed out (see manual). First #ifndef makes it possible to define settings from +// the outside like the compiler command line.++// 1.5.0 final++// Slight modifications by Austin Seipp 2011 for use in+// haskell library binding: specify compression level statically,+// disable streaming mode, turn on memory safety when building for+// tests, etc++#define QLZ_COMPRESSION_LEVEL 1+#define QLZ_STREAMING_BUFFER 0+#ifdef DEBUG+# define QLZ_MEMORY_SAFE+#endif /* DEBUG */++#define QLZ_VERSION_MAJOR 1+#define QLZ_VERSION_MINOR 5+#define QLZ_VERSION_REVISION 0++// Using size_t, memset() and memcpy()+#include <string.h>++// Verify compression level+#if QLZ_COMPRESSION_LEVEL != 1 && QLZ_COMPRESSION_LEVEL != 2 && QLZ_COMPRESSION_LEVEL != 3+#error QLZ_COMPRESSION_LEVEL must be 1, 2 or 3+#endif++typedef unsigned int ui32;+typedef unsigned short int ui16;++// Decrease QLZ_POINTERS for level 3 to increase compression speed. Do not touch any other values!+#if QLZ_COMPRESSION_LEVEL == 1+#define QLZ_POINTERS 1+#define QLZ_HASH_VALUES 4096+#elif QLZ_COMPRESSION_LEVEL == 2+#define QLZ_POINTERS 4+#define QLZ_HASH_VALUES 2048+#elif QLZ_COMPRESSION_LEVEL == 3+#define QLZ_POINTERS 16+#define QLZ_HASH_VALUES 4096+#endif++// Detect if pointer size is 64-bit. It's not fatal if some 64-bit target is not detected because this is only for adding an optional 64-bit optimization.+#if defined _LP64 || defined __LP64__ || defined __64BIT__ || _ADDR64 || defined _WIN64 || defined __arch64__ || __WORDSIZE == 64 || (defined __sparc && defined __sparcv9) || defined __x86_64 || defined __amd64 || defined __x86_64__ || defined _M_X64 || defined _M_IA64 || defined __ia64 || defined __IA64__+ #define QLZ_PTR_64+#endif++// hash entry+typedef struct +{+#if QLZ_COMPRESSION_LEVEL == 1+ ui32 cache;+#if defined QLZ_PTR_64 && QLZ_STREAMING_BUFFER == 0+ unsigned int offset;+#else+ const unsigned char *offset;+#endif+#else+ const unsigned char *offset[QLZ_POINTERS];+#endif++} qlz_hash_compress;++typedef struct +{+#if QLZ_COMPRESSION_LEVEL == 1+ const unsigned char *offset;+#else+ const unsigned char *offset[QLZ_POINTERS];+#endif+} qlz_hash_decompress;+++// states+typedef struct+{+ #if QLZ_STREAMING_BUFFER > 0+ unsigned char stream_buffer[QLZ_STREAMING_BUFFER];+ #endif+ size_t stream_counter;+ qlz_hash_compress hash[QLZ_HASH_VALUES];+ unsigned char hash_counter[QLZ_HASH_VALUES];+} qlz_state_compress;+++#if QLZ_COMPRESSION_LEVEL == 1 || QLZ_COMPRESSION_LEVEL == 2+ typedef struct+ {+#if QLZ_STREAMING_BUFFER > 0+ unsigned char stream_buffer[QLZ_STREAMING_BUFFER];+#endif+ qlz_hash_decompress hash[QLZ_HASH_VALUES];+ unsigned char hash_counter[QLZ_HASH_VALUES];+ size_t stream_counter;+ } qlz_state_decompress;+#elif QLZ_COMPRESSION_LEVEL == 3+ typedef struct+ {+#if QLZ_STREAMING_BUFFER > 0+ unsigned char stream_buffer[QLZ_STREAMING_BUFFER];+#endif+#if QLZ_COMPRESSION_LEVEL <= 2+ qlz_hash_decompress hash[QLZ_HASH_VALUES];+#endif+ size_t stream_counter;+ } qlz_state_decompress;+#endif+++#if defined (__cplusplus)+extern "C" {+#endif++// Public functions of QuickLZ+size_t qlz_size_decompressed(const char *source);+size_t qlz_size_compressed(const char *source);+size_t qlz_compress(const void *source, char *destination, size_t size, qlz_state_compress *state);+size_t qlz_decompress(const char *source, void *destination, qlz_state_decompress *state);+int qlz_get_setting(int setting);++#if defined (__cplusplus)+}+#endif++#endif+
+ quicklz.cabal view
@@ -0,0 +1,66 @@+name: quicklz +version: 1.5.0.1 +synopsis: binding to QuickLZ compression library +description: + This package provides a high level binding to the QuickLZ (http://quicklz.com) library + for ByteStrings, under the GPLv2. QuickLZ is fast and compresses very well. + . + This package includes the QuickLZ source code, with compression level 1 and streaming + currently disabled. + . + The versioning scheme for this package is unusual. QuickLZ trys to be as fast as possible, + and will break backwards compatibility to achieve it in new versions. This versioning scheme + reflects the QuickLZ versioning scheme: the first three digits of version w.x.y.z digits are + the quicklz version, with the 'z' component (and any further needed ones) being updates to this package, + not the underlying version. +homepage: http://github.com/thoughtpolice/hs-quicklz +license: GPL-2 +license-file: LICENSE +author: Austin Seipp +maintainer: as@hacks.yi.org +category: Codec +build-type: Simple +cabal-version: >=1.10 + +extra-source-files: + cbits/quicklz.h, cbits/quicklz.c, + tests/ex1.hs, tests/Properties.hs, + README + +source-repository head + type: git + location: https://github.com/thoughtpolice/hs-quicklz.git + +flag memory-safe + description: enable quickLZ memory safety checks + default: False + +library + exposed-modules: Codec.Compression.QuickLZ + build-depends: + base >= 3 && < 5, + bytestring == 0.9.* + + c-sources: cbits/quicklz.c + include-dirs: cbits + + ghc-options: -Wall -O2 -fwarn-tabs + if flag(memory-safe) + cpp-options: -DDEBUG + default-language: Haskell98 + +test-suite properties + hs-source-dirs: tests + main-is: Properties.hs + type: exitcode-stdio-1.0 + + build-depends: + base, + bytestring == 0.9.*, + QuickCheck == 2.4.*, + test-framework == 0.3.*, + test-framework-quickcheck2 == 0.2.*, + quicklz + + ghc-options: -Wall + default-language: Haskell98
+ tests/Properties.hs view
@@ -0,0 +1,17 @@+{-# LANGUAGE ViewPatterns #-} +module Main (main) where + +import Data.ByteString.Char8 +import Codec.Compression.QuickLZ + +import Test.Framework (defaultMain, testGroup) +import Test.Framework.Providers.QuickCheck2 (testProperty) + +main :: IO () +main = defaultMain [ testGroup "simple" [ + testProperty "identity" prop_id + ] + ] + +prop_id :: String -> Bool +prop_id (pack -> xs) = xs == (decompress . compress) xs
+ tests/ex1.hs view
@@ -0,0 +1,21 @@+{-# LANGUAGE OverloadedStrings #-} +module Main where + +import Data.ByteString (ByteString) +import qualified Data.ByteString.Char8 as B +import Codec.Compression.QuickLZ + +main :: IO () +main = do + let xs = "LZ compression is based on finding repeated strings: Five, six, seven, eight, nine, fifteen, sixteen, seventeen, fifteen, sixteen, seventeen." :: ByteString + + putStrLn $ "length of original string: " ++ (show $ B.length xs) + + let ys = compress xs + + putStrLn $ "length of compressed string: " ++ (show $ B.length ys) + + let zs = decompress ys + + putStr $ "decompressed back to " ++ (show $ B.length zs) ++ " bytes, got: " + B.putStrLn zs