911:
458:
370:
2144:
2134:
177:
63:
22:
247:
505:
is inserted, linking to the previous location of that identical string instead. An encoded match to an earlier string consists of a length (3–128 bytes) and a distance (1–526,341 bytes). The level of compression can be controlled by specifying the maximum distance for which duplicated strings will
875:
The liblzg library compensates for this by using a plain 1:1 copy mode if the encoder identifies that the compressed data will be larger than the original uncompressed data. Hence, in practice, the maximum data growth is 0% (plus the size of the data header, which is 16 bytes).
478:
algorithm, called the LZG algorithm, with the primary focus of providing a very simple and fast decoding method. One of the key features of the algorithm is that it requires no memory during decompression. The software library is
518:
The data format consists of a header, followed by the compressed data. The header contains an identifier and house keeping information, such as compressed and decompressed data sizes and a 32-bit checksum (a variant of the
549:
Any symbol that is not a marker byte is considered a literal byte, and will be copied as is to the decompressed data buffer. However, if the decoder encounters any of the four marker bytes, it will decode a
271:
870:
841:
73:
210:
736:
As a special case, if any of the marker symbols are followed by a zero byte (0), the marker symbol itself is written to the decompressed buffer.
87:
of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be
968:
1636:
1447:
748:
function implements a non-linear mapping of a number in the range 3-33 to a number in the range 3-128, according to the following table:
1336:
2188:
2178:
1842:
1665:
1459:
2183:
1150:
814:
As the marker symbols are chosen as the four least common symbols in the uncompressed data stream (with a probability of at most
1847:
1424:
1577:
916:
843:
each), and a single occurrence of a marker symbol requires two bytes to encode, the compressed data may grow by at most
187:
1954:
1692:
1631:
1442:
1392:
1215:
1075:
1060:
961:
300:
228:
158:
139:
49:
2067:
418:
111:
2077:
1915:
1766:
1685:
1479:
261:
196:
884:
Both the compression and the decompression algorithms are implemented in an open source library, written in the
568:
represents the most general form of a copy operation, and it occupies four bytes in the compressed data stream:
2050:
1670:
1464:
1252:
118:
2147:
1183:
888:. There are also several alternate implementations of the decompression algorithm available (for instance in
387:
84:
1812:
2137:
2040:
1582:
1140:
954:
502:
501:
If a duplicate series of bytes (a repeated string) is spotted in the uncompressed data stream, then a back-
349:
1130:
1125:
323:
125:
2072:
1999:
1837:
1817:
1761:
1419:
1210:
1013:
846:
817:
391:
80:
2173:
2082:
2023:
1949:
1797:
1387:
1382:
1237:
1080:
471:
96:
2087:
1660:
1454:
1155:
885:
457:
383:
206:
107:
2028:
1399:
1286:
1242:
1055:
1038:
1028:
192:
35:
1653:
1404:
1188:
1033:
520:
1925:
2057:
616:
is a shorter form of a copy operation, occupying three bytes in the compressed data stream:
1741:
1203:
1165:
986:
526:
The compressed data starts with four bytes, identifying four unique 8-bit marker symbols (
8:
1972:
1863:
1822:
1807:
1776:
1771:
1680:
1587:
1520:
1489:
1474:
1257:
929:
698:
369:
2045:
2015:
1994:
1900:
1832:
1726:
1414:
1230:
1220:
1115:
1095:
1090:
92:
1626:
1989:
1977:
1959:
1827:
1711:
1648:
1494:
1409:
1365:
1326:
1008:
896:
395:
88:
132:
1964:
1920:
1893:
1888:
1746:
1731:
1641:
1550:
1545:
1374:
1107:
1085:
977:
430:
423:
406:
257:
1883:
1697:
1621:
1602:
1572:
1540:
1506:
1065:
1003:
202:
1675:
1469:
1198:
1193:
1050:
1023:
995:
411:
2167:
1982:
1930:
1597:
1592:
1567:
1499:
1120:
1018:
924:
659:
requires only two bytes, and is used for short lengths, close to the marker:
554:
pair that is used as a back reference into the previously decompressed data.
496:
480:
475:
276:
2103:
1070:
1045:
946:
484:
435:
2062:
1940:
1736:
1612:
1562:
557:
The marker bytes are interpreted as follows (% denotes a binary number):
41:
358:
2119:
1910:
1905:
1792:
1751:
1557:
889:
542:). These are used to separate literal data bytes from various forms of
399:
266:
176:
2033:
1878:
1535:
697:
requires only two bytes, and is used for nearby copies (including
1802:
1276:
1225:
79:
Please help to demonstrate the notability of the topic by citing
446:
246:
1316:
941:
2151:
1756:
1349:
1296:
893:
1306:
1160:
1145:
1135:
872:< 1.6% compared to the decompressed data (worst case).
1281:
1247:
474:. It implements an algorithm that is a variation of the
851:
822:
849:
820:
906:
864:
835:
2165:
191:, potentially preventing the article from being
74:notability guidelines for products and services
962:
739:
976:
50:Learn how and when to remove these messages
969:
955:
456:
368:
211:reliable, independent, third-party sources
809:
301:Learn how and when to remove this message
229:Learn how and when to remove this message
159:Learn how and when to remove this message
470:is a compression library for performing
205:by replacing them with more appropriate
188:too closely associated with the subject
2166:
950:
506:be searched (this is the size of the
917:Free and open-source software portal
560:
240:
170:
56:
15:
608:
13:
879:
651:
329:1.0.10 / November 29, 2018
14:
2200:
935:
865:{\displaystyle {\tfrac {4}{256}}}
836:{\displaystyle {\tfrac {1}{256}}}
689:
31:This article has multiple issues.
2143:
2142:
2133:
2132:
909:
245:
186:may rely excessively on sources
175:
61:
20:
2189:Software using the zlib license
2179:Lossless compression algorithms
731:
39:or discuss these issues on the
2184:Free data compression software
513:
1:
490:
7:
902:
603:%ooommmmmmmmnnnnnnnn + 2056
10:
2205:
2024:Compressed data structures
1346:RLE + BWT + MTF + Huffman
1014:Asymmetric numeral systems
740:Non-linear length encoding
494:
81:reliable secondary sources
70:The topic of this article
2128:
2112:
2096:
2014:
1939:
1871:
1862:
1785:
1719:
1710:
1611:
1528:
1519:
1435:
1383:Discrete cosine transform
1373:
1364:
1313:LZ77 + Huffman + context
1266:
1176:
1106:
994:
985:
701:, when the offset is 1):
472:lossless data compression
441:
429:
417:
405:
379:
348:
344:
322:
318:
72:may not meet Knowledge's
2088:Smallest grammar problem
483:, distributed under the
2029:Compressed suffix array
1578:Nyquist–Shannon theorem
761:Decoded length (3-128)
260:, as no other articles
886:C programming language
866:
837:
810:Worst case data growth
722:DECODELENGTH(%lllll+2)
642:DECODELENGTH(%lllll+2)
599:DECODELENGTH(%lllll+2)
2058:Kolmogorov complexity
1926:Video characteristics
1303:LZ77 + Huffman + ANS
867:
838:
331:; 5 years ago
2148:Compression software
1742:Compression artifact
1698:Psychoacoustic model
847:
818:
2138:Compression formats
1777:Texture compression
1772:Standard test image
1588:Silence compression
930:Run-length encoding
315:
2046:Information theory
1901:Display resolution
1727:Chroma subsampling
1116:Byte pair encoding
1061:Shannon–Fano–Elias
862:
860:
833:
831:
754:Length parameter,
313:
279:for suggestions.
269:to this page from
76:
2161:
2160:
2010:
2009:
1960:Deblocking filter
1858:
1857:
1706:
1705:
1515:
1514:
1360:
1359:
897:assembly language
859:
830:
807:
806:
718:
717:
676:
675:
638:
637:
595:
594:
561:General copy (m1)
521:Fletcher checksum
465:
464:
396:Assembly language
311:
310:
303:
293:
292:
239:
238:
231:
169:
168:
161:
143:
71:
54:
2196:
2174:Data compression
2146:
2145:
2136:
2135:
1965:Lapped transform
1869:
1868:
1747:Image resolution
1732:Coding tree unit
1717:
1716:
1526:
1525:
1371:
1370:
992:
991:
978:Data compression
971:
964:
957:
948:
947:
942:liblzg home page
919:
914:
913:
912:
871:
869:
868:
863:
861:
852:
842:
840:
839:
834:
832:
823:
751:
750:
747:
727:
723:
720:...where length=
714:
709:
704:
703:
685:
681:
678:...where length=
672:
667:
662:
661:
647:
646:%ooommmmmmmm + 8
643:
640:...where length=
634:
629:
624:
619:
618:
609:Medium copy (m2)
604:
600:
597:...where length=
591:
586:
581:
576:
571:
570:
546:pair encodings.
461:
460:
453:
450:
448:
424:Data compression
407:Operating system
372:
367:
364:
362:
360:
339:
337:
332:
316:
312:
306:
299:
288:
285:
274:
272:related articles
249:
241:
234:
227:
223:
220:
214:
179:
171:
164:
157:
153:
150:
144:
142:
101:
65:
64:
57:
46:
24:
23:
16:
2204:
2203:
2199:
2198:
2197:
2195:
2194:
2193:
2164:
2163:
2162:
2157:
2124:
2108:
2092:
2073:Rate–distortion
2006:
1935:
1854:
1781:
1702:
1607:
1603:Sub-band coding
1511:
1436:Predictive type
1431:
1356:
1323:LZSS + Huffman
1273:LZ77 + Huffman
1262:
1172:
1108:Dictionary type
1102:
1004:Adaptive coding
981:
975:
938:
915:
910:
908:
905:
882:
880:Implementations
850:
848:
845:
844:
821:
819:
816:
815:
812:
745:
742:
734:
725:
721:
712:
707:
692:
683:
679:
670:
665:
654:
652:Short copy (m3)
645:
641:
632:
627:
622:
611:
602:
598:
589:
584:
579:
574:
563:
552:length-distance
544:length-distance
516:
499:
493:
455:
445:
375:
357:
340:
335:
333:
330:
307:
296:
295:
294:
289:
283:
280:
270:
267:introduce links
250:
235:
224:
218:
215:
200:
180:
165:
154:
148:
145:
102:
100:
78:
66:
62:
25:
21:
12:
11:
5:
2202:
2192:
2191:
2186:
2181:
2176:
2159:
2158:
2156:
2155:
2140:
2129:
2126:
2125:
2123:
2122:
2116:
2114:
2110:
2109:
2107:
2106:
2100:
2098:
2094:
2093:
2091:
2090:
2085:
2080:
2075:
2070:
2065:
2060:
2055:
2054:
2053:
2043:
2038:
2037:
2036:
2031:
2020:
2018:
2012:
2011:
2008:
2007:
2005:
2004:
2003:
2002:
1997:
1987:
1986:
1985:
1980:
1975:
1967:
1962:
1957:
1952:
1946:
1944:
1937:
1936:
1934:
1933:
1928:
1923:
1918:
1913:
1908:
1903:
1898:
1897:
1896:
1891:
1886:
1875:
1873:
1866:
1860:
1859:
1856:
1855:
1853:
1852:
1851:
1850:
1845:
1840:
1835:
1825:
1820:
1815:
1810:
1805:
1800:
1795:
1789:
1787:
1783:
1782:
1780:
1779:
1774:
1769:
1764:
1759:
1754:
1749:
1744:
1739:
1734:
1729:
1723:
1721:
1714:
1708:
1707:
1704:
1703:
1701:
1700:
1695:
1690:
1689:
1688:
1683:
1678:
1673:
1668:
1658:
1657:
1656:
1646:
1645:
1644:
1639:
1629:
1624:
1618:
1616:
1609:
1608:
1606:
1605:
1600:
1595:
1590:
1585:
1580:
1575:
1570:
1565:
1560:
1555:
1554:
1553:
1548:
1543:
1532:
1530:
1523:
1517:
1516:
1513:
1512:
1510:
1509:
1507:Psychoacoustic
1504:
1503:
1502:
1497:
1492:
1484:
1483:
1482:
1477:
1472:
1467:
1462:
1452:
1451:
1450:
1439:
1437:
1433:
1432:
1430:
1429:
1428:
1427:
1422:
1417:
1407:
1402:
1397:
1396:
1395:
1390:
1379:
1377:
1375:Transform type
1368:
1362:
1361:
1358:
1357:
1355:
1354:
1353:
1352:
1344:
1343:
1342:
1339:
1331:
1330:
1329:
1321:
1320:
1319:
1311:
1310:
1309:
1301:
1300:
1299:
1291:
1290:
1289:
1284:
1279:
1270:
1268:
1264:
1263:
1261:
1260:
1255:
1250:
1245:
1240:
1235:
1234:
1233:
1228:
1218:
1213:
1208:
1207:
1206:
1196:
1191:
1186:
1180:
1178:
1174:
1173:
1171:
1170:
1169:
1168:
1163:
1158:
1153:
1148:
1143:
1138:
1133:
1128:
1118:
1112:
1110:
1104:
1103:
1101:
1100:
1099:
1098:
1093:
1088:
1083:
1073:
1068:
1063:
1058:
1053:
1048:
1043:
1042:
1041:
1036:
1031:
1021:
1016:
1011:
1006:
1000:
998:
989:
983:
982:
974:
973:
966:
959:
951:
945:
944:
937:
936:External links
934:
933:
932:
927:
921:
920:
904:
901:
881:
878:
858:
855:
829:
826:
811:
808:
805:
804:
799:
795:
794:
791:
787:
786:
783:
779:
778:
775:
771:
770:
767:
763:
762:
759:
741:
738:
733:
730:
716:
715:
710:
691:
690:Near copy (m4)
688:
674:
673:
668:
653:
650:
636:
635:
630:
625:
610:
607:
593:
592:
587:
582:
577:
562:
559:
515:
512:
508:sliding window
495:Main article:
492:
489:
463:
462:
443:
439:
438:
433:
427:
426:
421:
415:
414:
412:Cross-platform
409:
403:
402:
381:
377:
376:
374:
373:
354:
352:
346:
345:
342:
341:
328:
326:
324:Stable release
320:
319:
309:
308:
291:
290:
277:Find link tool
253:
251:
244:
237:
236:
183:
181:
174:
167:
166:
69:
67:
60:
55:
29:
28:
26:
19:
9:
6:
4:
3:
2:
2201:
2190:
2187:
2185:
2182:
2180:
2177:
2175:
2172:
2171:
2169:
2153:
2149:
2141:
2139:
2131:
2130:
2127:
2121:
2118:
2117:
2115:
2111:
2105:
2102:
2101:
2099:
2095:
2089:
2086:
2084:
2081:
2079:
2076:
2074:
2071:
2069:
2066:
2064:
2061:
2059:
2056:
2052:
2049:
2048:
2047:
2044:
2042:
2039:
2035:
2032:
2030:
2027:
2026:
2025:
2022:
2021:
2019:
2017:
2013:
2001:
1998:
1996:
1993:
1992:
1991:
1988:
1984:
1981:
1979:
1976:
1974:
1971:
1970:
1968:
1966:
1963:
1961:
1958:
1956:
1953:
1951:
1948:
1947:
1945:
1942:
1938:
1932:
1931:Video quality
1929:
1927:
1924:
1922:
1919:
1917:
1914:
1912:
1909:
1907:
1904:
1902:
1899:
1895:
1892:
1890:
1887:
1885:
1882:
1881:
1880:
1877:
1876:
1874:
1870:
1867:
1865:
1861:
1849:
1846:
1844:
1841:
1839:
1836:
1834:
1831:
1830:
1829:
1826:
1824:
1821:
1819:
1816:
1814:
1811:
1809:
1806:
1804:
1801:
1799:
1796:
1794:
1791:
1790:
1788:
1784:
1778:
1775:
1773:
1770:
1768:
1765:
1763:
1760:
1758:
1755:
1753:
1750:
1748:
1745:
1743:
1740:
1738:
1735:
1733:
1730:
1728:
1725:
1724:
1722:
1718:
1715:
1713:
1709:
1699:
1696:
1694:
1691:
1687:
1684:
1682:
1679:
1677:
1674:
1672:
1669:
1667:
1664:
1663:
1662:
1659:
1655:
1652:
1651:
1650:
1647:
1643:
1640:
1638:
1635:
1634:
1633:
1630:
1628:
1625:
1623:
1620:
1619:
1617:
1614:
1610:
1604:
1601:
1599:
1598:Speech coding
1596:
1594:
1593:Sound quality
1591:
1589:
1586:
1584:
1581:
1579:
1576:
1574:
1571:
1569:
1568:Dynamic range
1566:
1564:
1561:
1559:
1556:
1552:
1549:
1547:
1544:
1542:
1539:
1538:
1537:
1534:
1533:
1531:
1527:
1524:
1522:
1518:
1508:
1505:
1501:
1498:
1496:
1493:
1491:
1488:
1487:
1485:
1481:
1478:
1476:
1473:
1471:
1468:
1466:
1463:
1461:
1458:
1457:
1456:
1453:
1449:
1446:
1445:
1444:
1441:
1440:
1438:
1434:
1426:
1423:
1421:
1418:
1416:
1413:
1412:
1411:
1408:
1406:
1403:
1401:
1398:
1394:
1391:
1389:
1386:
1385:
1384:
1381:
1380:
1378:
1376:
1372:
1369:
1367:
1363:
1351:
1348:
1347:
1345:
1340:
1338:
1335:
1334:
1333:LZ77 + Range
1332:
1328:
1325:
1324:
1322:
1318:
1315:
1314:
1312:
1308:
1305:
1304:
1302:
1298:
1295:
1294:
1292:
1288:
1285:
1283:
1280:
1278:
1275:
1274:
1272:
1271:
1269:
1265:
1259:
1256:
1254:
1251:
1249:
1246:
1244:
1241:
1239:
1236:
1232:
1229:
1227:
1224:
1223:
1222:
1219:
1217:
1214:
1212:
1209:
1205:
1202:
1201:
1200:
1197:
1195:
1192:
1190:
1187:
1185:
1182:
1181:
1179:
1175:
1167:
1164:
1162:
1159:
1157:
1154:
1152:
1149:
1147:
1144:
1142:
1139:
1137:
1134:
1132:
1129:
1127:
1124:
1123:
1122:
1119:
1117:
1114:
1113:
1111:
1109:
1105:
1097:
1094:
1092:
1089:
1087:
1084:
1082:
1079:
1078:
1077:
1074:
1072:
1069:
1067:
1064:
1062:
1059:
1057:
1054:
1052:
1049:
1047:
1044:
1040:
1037:
1035:
1032:
1030:
1027:
1026:
1025:
1022:
1020:
1017:
1015:
1012:
1010:
1007:
1005:
1002:
1001:
999:
997:
993:
990:
988:
984:
979:
972:
967:
965:
960:
958:
953:
952:
949:
943:
940:
939:
931:
928:
926:
925:LZ77 and LZ78
923:
922:
918:
907:
900:
898:
895:
891:
887:
877:
873:
856:
853:
827:
824:
803:
800:
797:
796:
792:
789:
788:
784:
781:
780:
776:
773:
772:
768:
765:
764:
760:
757:
753:
752:
749:
737:
729:
724:, and offset=
711:
706:
705:
702:
700:
696:
687:
682:, and offset=
669:
664:
663:
660:
658:
649:
644:, and offset=
631:
626:
621:
620:
617:
615:
606:
601:, and offset=
588:
583:
578:
573:
572:
569:
567:
558:
555:
553:
547:
545:
541:
537:
533:
529:
524:
522:
511:
509:
504:
498:
497:LZ77 and LZ78
488:
486:
482:
481:free software
477:
473:
469:
459:
452:
444:
440:
437:
434:
432:
428:
425:
422:
420:
416:
413:
410:
408:
404:
401:
397:
393:
389:
385:
382:
378:
371:
366:
356:
355:
353:
351:
347:
343:
327:
325:
321:
317:
305:
302:
287:
284:February 2021
278:
273:
268:
264:
263:
259:
254:This article
252:
248:
243:
242:
233:
230:
222:
212:
208:
204:
198:
194:
190:
189:
184:This article
182:
178:
173:
172:
163:
160:
152:
141:
138:
134:
131:
127:
124:
120:
117:
113:
110: –
109:
105:
104:Find sources:
98:
94:
90:
86:
82:
75:
68:
59:
58:
53:
51:
44:
43:
38:
37:
32:
27:
18:
17:
2104:Hutter Prize
2068:Quantization
1973:Compensation
1767:Quantization
1490:Compensation
1056:Shannon–Fano
996:Entropy type
883:
874:
813:
801:
755:
746:DECODELENGTH
743:
735:
732:Literal copy
719:
694:
693:
677:
656:
655:
639:
613:
612:
596:
565:
564:
556:
551:
548:
543:
539:
535:
531:
527:
525:
517:
507:
500:
485:zlib license
467:
466:
436:zlib license
363:/mbitsnbites
297:
281:
255:
225:
216:
201:Please help
185:
155:
146:
136:
129:
122:
115:
103:
47:
40:
34:
33:Please help
30:
2063:Prefix code
1916:Frame types
1737:Color space
1563:Convolution
1293:LZ77 + ANS
1204:Incremental
1177:Other types
1096:Levenshtein
684:%oooooo + 8
514:Data format
449:.bitsnbites
85:independent
2168:Categories
2120:Mark Adler
2078:Redundancy
1995:Daubechies
1978:Estimation
1911:Frame rate
1833:Daubechies
1793:Chain code
1752:Macroblock
1558:Companding
1495:Estimation
1415:Daubechies
1121:Lempel–Ziv
1081:Exp-Golomb
1009:Arithmetic
890:JavaScript
400:JavaScript
380:Written in
350:Repository
336:2018-11-29
275:; try the
262:link to it
219:March 2015
203:improve it
193:verifiable
149:March 2015
119:newspapers
93:redirected
36:improve it
2097:Community
1921:Interlace
1307:Zstandard
1086:Fibonacci
1076:Universal
1034:Canonical
713:%ooolllll
671:%lloooooo
633:%mmmmmmmm
628:%ooolllll
590:%nnnnnnnn
585:%mmmmmmmm
580:%ooolllll
503:reference
491:Algorithm
265:. Please
207:citations
83:that are
42:talk page
2083:Symmetry
2051:Timeline
2034:FM-index
1879:Bit rate
1872:Concepts
1720:Concepts
1583:Sampling
1536:Bit rate
1529:Concepts
1231:Sequitur
1066:Tunstall
1039:Modified
1029:Adaptive
987:Lossless
903:See also
726:%ooo + 1
108:"Liblzg"
2041:Entropy
1990:Wavelet
1969:Motion
1828:Wavelet
1808:Fractal
1803:Deflate
1786:Methods
1573:Latency
1486:Motion
1410:Wavelet
1327:LHA/LZH
1277:Deflate
1226:Re-Pair
1221:Grammar
1051:Shannon
1024:Huffman
980:methods
442:Website
431:License
365:/liblzg
334: (
197:neutral
133:scholar
97:deleted
2152:codecs
2113:People
2016:Theory
1983:Vector
1500:Vector
1317:Brotli
1267:Hybrid
1166:Snappy
1019:Golomb
798:<30
758:(3-33)
468:liblzg
454:
447:liblzg
388:Pascal
359:github
314:liblzg
258:orphan
256:is an
135:
128:
121:
114:
106:
89:merged
1943:parts
1941:Codec
1906:Frame
1864:Video
1848:SPIHT
1757:Pixel
1712:Image
1666:ACELP
1637:ADPCM
1627:ÎĽ-law
1622:A-law
1615:parts
1613:Codec
1521:Audio
1460:ACELP
1448:ADPCM
1425:SPIHT
1366:Lossy
1350:bzip2
1341:LZHAM
1297:LZFSE
1199:Delta
1091:Gamma
1071:Unary
1046:Range
894:8-bit
680:%ll+3
140:JSTOR
126:books
95:, or
1955:DPCM
1762:PSNR
1693:MDCT
1686:WLPC
1671:CELP
1632:DPCM
1480:WLPC
1465:CELP
1443:DPCM
1393:MDCT
1337:LZMA
1238:LDCT
1216:DPCM
1161:LZWL
1151:LZSS
1146:LZRW
1136:LZJB
892:and
769:128
744:The
538:and
476:LZ77
419:Type
361:.com
195:and
112:news
2000:DWT
1950:DCT
1894:VBR
1889:CBR
1884:ABR
1843:EZW
1838:DWT
1823:RLE
1813:KLT
1798:DCT
1681:LSP
1676:LAR
1661:LPC
1654:FFT
1551:VBR
1546:CBR
1541:ABR
1475:LSP
1470:LAR
1455:LPC
1420:DWT
1405:FFT
1400:DST
1388:DCT
1287:LZS
1282:LZX
1258:RLE
1253:PPM
1248:PAQ
1243:MTF
1211:DMC
1189:CTW
1184:BWT
1156:LZW
1141:LZO
1131:LZ4
1126:842
899:).
857:256
828:256
793:35
785:48
777:72
699:RLE
523:).
510:).
451:.eu
392:Lua
209:to
2170::
1818:LP
1649:FT
1642:DM
1194:CM
790:30
782:31
774:32
766:33
728:.
708:m4
695:m4
686:.
666:m3
657:m3
648:.
623:m2
614:m2
605:.
575:m1
566:m1
540:m4
536:m3
534:,
532:m2
530:,
528:m1
487:.
398:,
394:,
390:,
386:,
91:,
45:.
2154:)
2150:(
970:e
963:t
956:v
854:4
825:1
802:L
756:L
384:C
338:)
304:)
298:(
286:)
282:(
232:)
226:(
221:)
217:(
213:.
199:.
162:)
156:(
151:)
147:(
137:·
130:·
123:·
116:·
99:.
77:.
52:)
48:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
