RubyGems - ruby_abc - Versions diffs - 0.0.3 → 0.1.0 - Mend

ruby_abc 0.0.3 → 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1732) hide show

checksums.yaml +5 -5
data/.yardopts +7 -0
data/LICENSE +51 -52
data/README.md +96 -37
data/bin/ruby_abc +103 -0
data/ext/ruby_abc/extconf.rb +58 -0
data/ext/{ruby_abc.c → ruby_abc/ruby_abc.c} +45 -72
data/ext/ruby_abc/ruby_abc.map +6 -0
data/ext/{ruby_abc_wrapper.c → ruby_abc/ruby_abc_wrapper.c} +0 -0
data/ext/ruby_abc/ruby_abc_wrapper.h +39 -0
data/lib/ruby_abc/version.rb +4 -0
data/lib/ruby_abc.rb +247 -225
data/share/bash_completion/ruby_abc.bash-completion.sh +24 -0
data/share/osu018.genlib +66 -0
data/share/simple.genlib +25 -0
data/test/test_ruby_abc.rb +1 -1
metadata +19 -1727
data/Rakefile +0 -83
data/bin/rubyabc_synthesis +0 -71
data/ext/abc/CMakeLists.txt +0 -103
data/ext/abc/Makefile +0 -213
data/ext/abc/abc.rc +0 -146
data/ext/abc/abcexe.dsp +0 -103
data/ext/abc/abclib.dsp +0 -5948
data/ext/abc/abcspace.dsw +0 -44
data/ext/abc/arch_flags.c +0 -17
data/ext/abc/copyright.txt +0 -23
data/ext/abc/depends.sh +0 -13
data/ext/abc/i10.aig +0 -752
data/ext/abc/lib/pthread.h +0 -1369
data/ext/abc/lib/sched.h +0 -178
data/ext/abc/lib/semaphore.h +0 -166
data/ext/abc/lib/x64/pthreadVC2.dll +0 -0
data/ext/abc/lib/x64/pthreadVC2.lib +0 -0
data/ext/abc/lib/x86/pthreadVC2.dll +0 -0
data/ext/abc/lib/x86/pthreadVC2.lib +0 -0
data/ext/abc/readme.md +0 -111
data/ext/abc/readmeaig +0 -47
data/ext/abc/src/aig/aig/aig.h +0 -713
data/ext/abc/src/aig/aig/aigCanon.c +0 -701
data/ext/abc/src/aig/aig/aigCheck.c +0 -168
data/ext/abc/src/aig/aig/aigCuts.c +0 -673
data/ext/abc/src/aig/aig/aigDfs.c +0 -1136
data/ext/abc/src/aig/aig/aigDoms.c +0 -1154
data/ext/abc/src/aig/aig/aigDup.c +0 -1335
data/ext/abc/src/aig/aig/aigFact.c +0 -734
data/ext/abc/src/aig/aig/aigFanout.c +0 -194
data/ext/abc/src/aig/aig/aigFrames.c +0 -140
data/ext/abc/src/aig/aig/aigInter.c +0 -301
data/ext/abc/src/aig/aig/aigJust.c +0 -316
data/ext/abc/src/aig/aig/aigMan.c +0 -486
data/ext/abc/src/aig/aig/aigMem.c +0 -610
data/ext/abc/src/aig/aig/aigMffc.c +0 -316
data/ext/abc/src/aig/aig/aigObj.c +0 -536
data/ext/abc/src/aig/aig/aigOper.c +0 -606
data/ext/abc/src/aig/aig/aigOrder.c +0 -176
data/ext/abc/src/aig/aig/aigPack.c +0 -404
data/ext/abc/src/aig/aig/aigPart.c +0 -1613
data/ext/abc/src/aig/aig/aigPartReg.c +0 -629
data/ext/abc/src/aig/aig/aigPartSat.c +0 -618
data/ext/abc/src/aig/aig/aigRepar.c +0 -403
data/ext/abc/src/aig/aig/aigRepr.c +0 -559
data/ext/abc/src/aig/aig/aigRet.c +0 -975
data/ext/abc/src/aig/aig/aigRetF.c +0 -214
data/ext/abc/src/aig/aig/aigScl.c +0 -708
data/ext/abc/src/aig/aig/aigShow.c +0 -368
data/ext/abc/src/aig/aig/aigSplit.c +0 -330
data/ext/abc/src/aig/aig/aigTable.c +0 -277
data/ext/abc/src/aig/aig/aigTest.c +0 -39
data/ext/abc/src/aig/aig/aigTiming.c +0 -356
data/ext/abc/src/aig/aig/aigTruth.c +0 -103
data/ext/abc/src/aig/aig/aigTsim.c +0 -526
data/ext/abc/src/aig/aig/aigUtil.c +0 -1575
data/ext/abc/src/aig/aig/aigWin.c +0 -189
data/ext/abc/src/aig/aig/aig_.c +0 -53
data/ext/abc/src/aig/aig/module.make +0 -31
data/ext/abc/src/aig/gia/gia.c +0 -52
data/ext/abc/src/aig/gia/gia.h +0 -1667
data/ext/abc/src/aig/gia/giaAgi.c +0 -238
data/ext/abc/src/aig/gia/giaAig.c +0 -676
data/ext/abc/src/aig/gia/giaAig.h +0 -78
data/ext/abc/src/aig/gia/giaAiger.c +0 -1479
data/ext/abc/src/aig/gia/giaAigerExt.c +0 -326
data/ext/abc/src/aig/gia/giaBalAig.c +0 -1095
data/ext/abc/src/aig/gia/giaBalLut.c +0 -982
data/ext/abc/src/aig/gia/giaBalMap.c +0 -326
data/ext/abc/src/aig/gia/giaBidec.c +0 -305
data/ext/abc/src/aig/gia/giaCCof.c +0 -349
data/ext/abc/src/aig/gia/giaCSat.c +0 -1105
data/ext/abc/src/aig/gia/giaCSatOld.c +0 -804
data/ext/abc/src/aig/gia/giaCTas.c +0 -1790
data/ext/abc/src/aig/gia/giaCTas2.c +0 -208
data/ext/abc/src/aig/gia/giaCex.c +0 -392
data/ext/abc/src/aig/gia/giaClp.c +0 -422
data/ext/abc/src/aig/gia/giaCof.c +0 -1002
data/ext/abc/src/aig/gia/giaCone.c +0 -590
data/ext/abc/src/aig/gia/giaConstr.c +0 -52
data/ext/abc/src/aig/gia/giaCut.c +0 -646
data/ext/abc/src/aig/gia/giaDfs.c +0 -582
data/ext/abc/src/aig/gia/giaDup.c +0 -4791
data/ext/abc/src/aig/gia/giaEdge.c +0 -1000
data/ext/abc/src/aig/gia/giaEmbed.c +0 -1876
data/ext/abc/src/aig/gia/giaEnable.c +0 -650
data/ext/abc/src/aig/gia/giaEquiv.c +0 -2416
data/ext/abc/src/aig/gia/giaEra.c +0 -602
data/ext/abc/src/aig/gia/giaEra2.c +0 -1963
data/ext/abc/src/aig/gia/giaEsop.c +0 -541
data/ext/abc/src/aig/gia/giaFalse.c +0 -552
data/ext/abc/src/aig/gia/giaFanout.c +0 -338
data/ext/abc/src/aig/gia/giaForce.c +0 -1106
data/ext/abc/src/aig/gia/giaFrames.c +0 -996
data/ext/abc/src/aig/gia/giaFront.c +0 -295
data/ext/abc/src/aig/gia/giaFx.c +0 -487
data/ext/abc/src/aig/gia/giaGiarf.c +0 -1079
data/ext/abc/src/aig/gia/giaGig.c +0 -506
data/ext/abc/src/aig/gia/giaGlitch.c +0 -786
data/ext/abc/src/aig/gia/giaHash.c +0 -816
data/ext/abc/src/aig/gia/giaHcd.c +0 -689
data/ext/abc/src/aig/gia/giaIf.c +0 -2536
data/ext/abc/src/aig/gia/giaIff.c +0 -444
data/ext/abc/src/aig/gia/giaIiff.c +0 -62
data/ext/abc/src/aig/gia/giaIiff.h +0 -54
data/ext/abc/src/aig/gia/giaIso.c +0 -1331
data/ext/abc/src/aig/gia/giaIso2.c +0 -776
data/ext/abc/src/aig/gia/giaIso3.c +0 -167
data/ext/abc/src/aig/gia/giaJf.c +0 -1805
data/ext/abc/src/aig/gia/giaKf.c +0 -1341
data/ext/abc/src/aig/gia/giaLf.c +0 -2301
data/ext/abc/src/aig/gia/giaMan.c +0 -1126
data/ext/abc/src/aig/gia/giaMem.c +0 -598
data/ext/abc/src/aig/gia/giaMf.c +0 -1741
data/ext/abc/src/aig/gia/giaMffc.c +0 -313
data/ext/abc/src/aig/gia/giaMfs.c +0 -477
data/ext/abc/src/aig/gia/giaMini.c +0 -574
data/ext/abc/src/aig/gia/giaMuxes.c +0 -915
data/ext/abc/src/aig/gia/giaNf.c +0 -2420
data/ext/abc/src/aig/gia/giaOf.c +0 -1866
data/ext/abc/src/aig/gia/giaPack.c +0 -207
data/ext/abc/src/aig/gia/giaPat.c +0 -135
data/ext/abc/src/aig/gia/giaPf.c +0 -1354
data/ext/abc/src/aig/gia/giaProp.c +0 -176
data/ext/abc/src/aig/gia/giaQbf.c +0 -701
data/ext/abc/src/aig/gia/giaResub.c +0 -292
data/ext/abc/src/aig/gia/giaRetime.c +0 -304
data/ext/abc/src/aig/gia/giaRex.c +0 -545
data/ext/abc/src/aig/gia/giaSat.c +0 -427
data/ext/abc/src/aig/gia/giaSat3.c +0 -136
data/ext/abc/src/aig/gia/giaSatEdge.c +0 -537
data/ext/abc/src/aig/gia/giaSatLE.c +0 -1083
data/ext/abc/src/aig/gia/giaSatLut.c +0 -1225
data/ext/abc/src/aig/gia/giaSatMap.c +0 -554
data/ext/abc/src/aig/gia/giaSatoko.c +0 -274
data/ext/abc/src/aig/gia/giaScl.c +0 -300
data/ext/abc/src/aig/gia/giaScript.c +0 -783
data/ext/abc/src/aig/gia/giaShow.c +0 -1164
data/ext/abc/src/aig/gia/giaShrink.c +0 -154
data/ext/abc/src/aig/gia/giaShrink6.c +0 -492
data/ext/abc/src/aig/gia/giaShrink7.c +0 -373
data/ext/abc/src/aig/gia/giaSim.c +0 -905
data/ext/abc/src/aig/gia/giaSim2.c +0 -706
data/ext/abc/src/aig/gia/giaSort.c +0 -273
data/ext/abc/src/aig/gia/giaSpeedup.c +0 -805
data/ext/abc/src/aig/gia/giaSplit.c +0 -578
data/ext/abc/src/aig/gia/giaStg.c +0 -528
data/ext/abc/src/aig/gia/giaStr.c +0 -1865
data/ext/abc/src/aig/gia/giaSupMin.c +0 -165
data/ext/abc/src/aig/gia/giaSupp.c +0 -886
data/ext/abc/src/aig/gia/giaSweep.c +0 -777
data/ext/abc/src/aig/gia/giaSweeper.c +0 -1185
data/ext/abc/src/aig/gia/giaSwitch.c +0 -829
data/ext/abc/src/aig/gia/giaTim.c +0 -1017
data/ext/abc/src/aig/gia/giaTis.c +0 -213
data/ext/abc/src/aig/gia/giaTruth.c +0 -639
data/ext/abc/src/aig/gia/giaTsim.c +0 -757
data/ext/abc/src/aig/gia/giaUnate.c +0 -255
data/ext/abc/src/aig/gia/giaUtil.c +0 -2136
data/ext/abc/src/aig/gia/module.make +0 -89
data/ext/abc/src/aig/hop/cudd2.c +0 -360
data/ext/abc/src/aig/hop/cudd2.h +0 -86
data/ext/abc/src/aig/hop/hop.h +0 -356
data/ext/abc/src/aig/hop/hopBalance.c +0 -401
data/ext/abc/src/aig/hop/hopCheck.c +0 -115
data/ext/abc/src/aig/hop/hopDfs.c +0 -591
data/ext/abc/src/aig/hop/hopMan.c +0 -169
data/ext/abc/src/aig/hop/hopMem.c +0 -120
data/ext/abc/src/aig/hop/hopObj.c +0 -277
data/ext/abc/src/aig/hop/hopOper.c +0 -378
data/ext/abc/src/aig/hop/hopTable.c +0 -232
data/ext/abc/src/aig/hop/hopTruth.c +0 -274
data/ext/abc/src/aig/hop/hopUtil.c +0 -578
data/ext/abc/src/aig/hop/hop_.c +0 -53
data/ext/abc/src/aig/hop/module.make +0 -10
data/ext/abc/src/aig/ioa/ioa.h +0 -87
data/ext/abc/src/aig/ioa/ioaReadAig.c +0 -465
data/ext/abc/src/aig/ioa/ioaUtil.c +0 -146
data/ext/abc/src/aig/ioa/ioaWriteAig.c +0 -599
data/ext/abc/src/aig/ioa/module.make +0 -3
data/ext/abc/src/aig/ivy/attr.h +0 -418
data/ext/abc/src/aig/ivy/ivy.h +0 -562
data/ext/abc/src/aig/ivy/ivyBalance.c +0 -414
data/ext/abc/src/aig/ivy/ivyCanon.c +0 -149
data/ext/abc/src/aig/ivy/ivyCheck.c +0 -278
data/ext/abc/src/aig/ivy/ivyCut.c +0 -995
data/ext/abc/src/aig/ivy/ivyCutTrav.c +0 -478
data/ext/abc/src/aig/ivy/ivyDfs.c +0 -498
data/ext/abc/src/aig/ivy/ivyDsd.c +0 -831
data/ext/abc/src/aig/ivy/ivyFanout.c +0 -314
data/ext/abc/src/aig/ivy/ivyFastMap.c +0 -1569
data/ext/abc/src/aig/ivy/ivyFraig.c +0 -2972
data/ext/abc/src/aig/ivy/ivyHaig.c +0 -535
data/ext/abc/src/aig/ivy/ivyMan.c +0 -552
data/ext/abc/src/aig/ivy/ivyMem.c +0 -121
data/ext/abc/src/aig/ivy/ivyMulti.c +0 -312
data/ext/abc/src/aig/ivy/ivyMulti8.c +0 -432
data/ext/abc/src/aig/ivy/ivyObj.c +0 -481
data/ext/abc/src/aig/ivy/ivyOper.c +0 -298
data/ext/abc/src/aig/ivy/ivyResyn.c +0 -201
data/ext/abc/src/aig/ivy/ivyRwr.c +0 -618
data/ext/abc/src/aig/ivy/ivyRwrAlg.c +0 -413
data/ext/abc/src/aig/ivy/ivySeq.c +0 -1142
data/ext/abc/src/aig/ivy/ivyShow.c +0 -343
data/ext/abc/src/aig/ivy/ivyTable.c +0 -272
data/ext/abc/src/aig/ivy/ivyUtil.c +0 -824
data/ext/abc/src/aig/ivy/ivy_.c +0 -53
data/ext/abc/src/aig/ivy/module.make +0 -22
data/ext/abc/src/aig/miniaig/abcOper.h +0 -249
data/ext/abc/src/aig/miniaig/miniaig.h +0 -346
data/ext/abc/src/aig/miniaig/minilut.h +0 -288
data/ext/abc/src/aig/miniaig/module.make +0 -1
data/ext/abc/src/aig/miniaig/ndr.h +0 -521
data/ext/abc/src/aig/saig/module.make +0 -26
data/ext/abc/src/aig/saig/saig.h +0 -200
data/ext/abc/src/aig/saig/saigCone.c +0 -181
data/ext/abc/src/aig/saig/saigConstr.c +0 -484
data/ext/abc/src/aig/saig/saigConstr2.c +0 -1013
data/ext/abc/src/aig/saig/saigDual.c +0 -240
data/ext/abc/src/aig/saig/saigDup.c +0 -600
data/ext/abc/src/aig/saig/saigGlaCba.c +0 -840
data/ext/abc/src/aig/saig/saigGlaPba.c +0 -589
data/ext/abc/src/aig/saig/saigGlaPba2.c +0 -558
data/ext/abc/src/aig/saig/saigInd.c +0 -409
data/ext/abc/src/aig/saig/saigIoa.c +0 -405
data/ext/abc/src/aig/saig/saigIso.c +0 -628
data/ext/abc/src/aig/saig/saigIsoFast.c +0 -353
data/ext/abc/src/aig/saig/saigIsoSlow.c +0 -1224
data/ext/abc/src/aig/saig/saigMiter.c +0 -1317
data/ext/abc/src/aig/saig/saigOutDec.c +0 -205
data/ext/abc/src/aig/saig/saigPhase.c +0 -1081
data/ext/abc/src/aig/saig/saigRefSat.c +0 -986
data/ext/abc/src/aig/saig/saigRetFwd.c +0 -248
data/ext/abc/src/aig/saig/saigRetMin.c +0 -705
data/ext/abc/src/aig/saig/saigRetStep.c +0 -236
data/ext/abc/src/aig/saig/saigScl.c +0 -115
data/ext/abc/src/aig/saig/saigSimFast.c +0 -451
data/ext/abc/src/aig/saig/saigSimMv.c +0 -956
data/ext/abc/src/aig/saig/saigSimSeq.c +0 -518
data/ext/abc/src/aig/saig/saigStrSim.c +0 -976
data/ext/abc/src/aig/saig/saigSwitch.c +0 -573
data/ext/abc/src/aig/saig/saigSynch.c +0 -665
data/ext/abc/src/aig/saig/saigTempor.c +0 -256
data/ext/abc/src/aig/saig/saigTrans.c +0 -428
data/ext/abc/src/aig/saig/saigUnfold2.c +0 -497
data/ext/abc/src/aig/saig/saigWnd.c +0 -816
data/ext/abc/src/aig/saig/saig_.c +0 -52
data/ext/abc/src/base/abc/abc.h +0 -1064
data/ext/abc/src/base/abc/abcAig.c +0 -1505
data/ext/abc/src/base/abc/abcBarBuf.c +0 -513
data/ext/abc/src/base/abc/abcBlifMv.c +0 -1167
data/ext/abc/src/base/abc/abcCheck.c +0 -953
data/ext/abc/src/base/abc/abcDfs.c +0 -1910
data/ext/abc/src/base/abc/abcFanOrder.c +0 -652
data/ext/abc/src/base/abc/abcFanio.c +0 -366
data/ext/abc/src/base/abc/abcFunc.c +0 -1273
data/ext/abc/src/base/abc/abcHie.c +0 -843
data/ext/abc/src/base/abc/abcHieCec.c +0 -764
data/ext/abc/src/base/abc/abcHieGia.c +0 -582
data/ext/abc/src/base/abc/abcHieNew.c +0 -1635
data/ext/abc/src/base/abc/abcInt.h +0 -60
data/ext/abc/src/base/abc/abcLatch.c +0 -778
data/ext/abc/src/base/abc/abcLib.c +0 -400
data/ext/abc/src/base/abc/abcMinBase.c +0 -841
data/ext/abc/src/base/abc/abcNames.c +0 -802
data/ext/abc/src/base/abc/abcNetlist.c +0 -511
data/ext/abc/src/base/abc/abcNtk.c +0 -2298
data/ext/abc/src/base/abc/abcObj.c +0 -1075
data/ext/abc/src/base/abc/abcRefs.c +0 -457
data/ext/abc/src/base/abc/abcShow.c +0 -458
data/ext/abc/src/base/abc/abcSop.c +0 -1356
data/ext/abc/src/base/abc/abcUtil.c +0 -3269
data/ext/abc/src/base/abc/abc_.c +0 -52
data/ext/abc/src/base/abc/module.make +0 -23
data/ext/abc/src/base/abci/abc.c +0 -44490
data/ext/abc/src/base/abci/abcAttach.c +0 -409
data/ext/abc/src/base/abci/abcAuto.c +0 -256
data/ext/abc/src/base/abci/abcBalance.c +0 -629
data/ext/abc/src/base/abci/abcBidec.c +0 -156
data/ext/abc/src/base/abci/abcBm.c +0 -2050
data/ext/abc/src/base/abci/abcBmc.c +0 -122
data/ext/abc/src/base/abci/abcCas.c +0 -128
data/ext/abc/src/base/abci/abcCascade.c +0 -1062
data/ext/abc/src/base/abci/abcCollapse.c +0 -957
data/ext/abc/src/base/abci/abcCut.c +0 -700
data/ext/abc/src/base/abci/abcDar.c +0 -4807
data/ext/abc/src/base/abci/abcDarUnfold2.c +0 -69
data/ext/abc/src/base/abci/abcDebug.c +0 -213
data/ext/abc/src/base/abci/abcDec.c +0 -666
data/ext/abc/src/base/abci/abcDetect.c +0 -1264
data/ext/abc/src/base/abci/abcDress.c +0 -214
data/ext/abc/src/base/abci/abcDress2.c +0 -500
data/ext/abc/src/base/abci/abcDress3.c +0 -320
data/ext/abc/src/base/abci/abcDsd.c +0 -710
data/ext/abc/src/base/abci/abcEco.c +0 -58
data/ext/abc/src/base/abci/abcEspresso.c +0 -255
data/ext/abc/src/base/abci/abcExact.c +0 -3024
data/ext/abc/src/base/abci/abcExtract.c +0 -752
data/ext/abc/src/base/abci/abcFlop.c +0 -40
data/ext/abc/src/base/abci/abcFpga.c +0 -288
data/ext/abc/src/base/abci/abcFpgaFast.c +0 -195
data/ext/abc/src/base/abci/abcFraig.c +0 -816
data/ext/abc/src/base/abci/abcFx.c +0 -1207
data/ext/abc/src/base/abci/abcFxu.c +0 -292
data/ext/abc/src/base/abci/abcGen.c +0 -830
data/ext/abc/src/base/abci/abcHaig.c +0 -557
data/ext/abc/src/base/abci/abcIf.c +0 -830
data/ext/abc/src/base/abci/abcIfMux.c +0 -422
data/ext/abc/src/base/abci/abcIfif.c +0 -349
data/ext/abc/src/base/abci/abcIvy.c +0 -1149
data/ext/abc/src/base/abci/abcLog.c +0 -242
data/ext/abc/src/base/abci/abcLut.c +0 -793
data/ext/abc/src/base/abci/abcLutmin.c +0 -785
data/ext/abc/src/base/abci/abcMap.c +0 -1064
data/ext/abc/src/base/abci/abcMeasure.c +0 -483
data/ext/abc/src/base/abci/abcMerge.c +0 -358
data/ext/abc/src/base/abci/abcMffc.c +0 -1252
data/ext/abc/src/base/abci/abcMfs.c +0 -469
data/ext/abc/src/base/abci/abcMini.c +0 -237
data/ext/abc/src/base/abci/abcMiter.c +0 -1196
data/ext/abc/src/base/abci/abcMulti.c +0 -660
data/ext/abc/src/base/abci/abcMv.c +0 -381
data/ext/abc/src/base/abci/abcNpn.c +0 -392
data/ext/abc/src/base/abci/abcNpnSave.c +0 -740
data/ext/abc/src/base/abci/abcNtbdd.c +0 -619
data/ext/abc/src/base/abci/abcOdc.c +0 -1132
data/ext/abc/src/base/abci/abcOrder.c +0 -136
data/ext/abc/src/base/abci/abcPart.c +0 -1206
data/ext/abc/src/base/abci/abcPlace.c +0 -260
data/ext/abc/src/base/abci/abcPrint.c +0 -2008
data/ext/abc/src/base/abci/abcProve.c +0 -354
data/ext/abc/src/base/abci/abcQbf.c +0 -319
data/ext/abc/src/base/abci/abcQuant.c +0 -436
data/ext/abc/src/base/abci/abcReach.c +0 -327
data/ext/abc/src/base/abci/abcRec3.c +0 -1433
data/ext/abc/src/base/abci/abcReconv.c +0 -776
data/ext/abc/src/base/abci/abcRefactor.c +0 -418
data/ext/abc/src/base/abci/abcRenode.c +0 -326
data/ext/abc/src/base/abci/abcReorder.c +0 -117
data/ext/abc/src/base/abci/abcRestruct.c +0 -1511
data/ext/abc/src/base/abci/abcResub.c +0 -1957
data/ext/abc/src/base/abci/abcRewrite.c +0 -420
data/ext/abc/src/base/abci/abcRpo.c +0 -442
data/ext/abc/src/base/abci/abcRr.c +0 -1005
data/ext/abc/src/base/abci/abcSat.c +0 -1020
data/ext/abc/src/base/abci/abcSaucy.c +0 -3346
data/ext/abc/src/base/abci/abcScorr.c +0 -454
data/ext/abc/src/base/abci/abcSense.c +0 -216
data/ext/abc/src/base/abci/abcSpeedup.c +0 -965
data/ext/abc/src/base/abci/abcStrash.c +0 -848
data/ext/abc/src/base/abci/abcSweep.c +0 -1030
data/ext/abc/src/base/abci/abcSymm.c +0 -246
data/ext/abc/src/base/abci/abcTim.c +0 -637
data/ext/abc/src/base/abci/abcTiming.c +0 -1398
data/ext/abc/src/base/abci/abcUnate.c +0 -178
data/ext/abc/src/base/abci/abcUnreach.c +0 -366
data/ext/abc/src/base/abci/abcVerify.c +0 -1109
data/ext/abc/src/base/abci/abcXsim.c +0 -231
data/ext/abc/src/base/abci/abciUnfold2.c +0 -186
data/ext/abc/src/base/abci/fahout_cut.c +0 -358
data/ext/abc/src/base/abci/module.make +0 -75
data/ext/abc/src/base/acb/acb.c +0 -52
data/ext/abc/src/base/acb/acb.h +0 -1038
data/ext/abc/src/base/acb/acbAbc.c +0 -302
data/ext/abc/src/base/acb/acbAig.c +0 -52
data/ext/abc/src/base/acb/acbCom.c +0 -735
data/ext/abc/src/base/acb/acbFunc.c +0 -56
data/ext/abc/src/base/acb/acbMfs.c +0 -1644
data/ext/abc/src/base/acb/acbPar.h +0 -70
data/ext/abc/src/base/acb/acbPush.c +0 -372
data/ext/abc/src/base/acb/acbSets.c +0 -54
data/ext/abc/src/base/acb/acbSets.h +0 -61
data/ext/abc/src/base/acb/acbUtil.c +0 -479
data/ext/abc/src/base/acb/module.make +0 -8
data/ext/abc/src/base/bac/bac.c +0 -52
data/ext/abc/src/base/bac/bac.h +0 -1017
data/ext/abc/src/base/bac/bacBac.c +0 -298
data/ext/abc/src/base/bac/bacBlast.c +0 -587
data/ext/abc/src/base/bac/bacCom.c +0 -728
data/ext/abc/src/base/bac/bacLib.c +0 -52
data/ext/abc/src/base/bac/bacNtk.c +0 -603
data/ext/abc/src/base/bac/bacOper.c +0 -365
data/ext/abc/src/base/bac/bacPrs.h +0 -363
data/ext/abc/src/base/bac/bacPrsBuild.c +0 -356
data/ext/abc/src/base/bac/bacPrsTrans.c +0 -211
data/ext/abc/src/base/bac/bacPtr.c +0 -470
data/ext/abc/src/base/bac/bacPtrAbc.c +0 -486
data/ext/abc/src/base/bac/bacReadBlif.c +0 -453
data/ext/abc/src/base/bac/bacReadSmt.c +0 -42
data/ext/abc/src/base/bac/bacReadVer.c +0 -875
data/ext/abc/src/base/bac/bacWriteBlif.c +0 -236
data/ext/abc/src/base/bac/bacWriteSmt.c +0 -52
data/ext/abc/src/base/bac/bacWriteVer.c +0 -703
data/ext/abc/src/base/bac/module.make +0 -15
data/ext/abc/src/base/cba/cba.c +0 -52
data/ext/abc/src/base/cba/cba.h +0 -1024
data/ext/abc/src/base/cba/cbaBlast.c +0 -1069
data/ext/abc/src/base/cba/cbaCba.c +0 -58
data/ext/abc/src/base/cba/cbaCom.c +0 -731
data/ext/abc/src/base/cba/cbaNtk.c +0 -1183
data/ext/abc/src/base/cba/cbaPrs.h +0 -520
data/ext/abc/src/base/cba/cbaReadBlif.c +0 -646
data/ext/abc/src/base/cba/cbaReadVer.c +0 -2182
data/ext/abc/src/base/cba/cbaTypes.h +0 -169
data/ext/abc/src/base/cba/cbaWriteBlif.c +0 -218
data/ext/abc/src/base/cba/cbaWriteVer.c +0 -1016
data/ext/abc/src/base/cba/module.make +0 -8
data/ext/abc/src/base/cmd/cmd.c +0 -2611
data/ext/abc/src/base/cmd/cmd.h +0 -81
data/ext/abc/src/base/cmd/cmdAlias.c +0 -126
data/ext/abc/src/base/cmd/cmdApi.c +0 -127
data/ext/abc/src/base/cmd/cmdAuto.c +0 -684
data/ext/abc/src/base/cmd/cmdFlag.c +0 -110
data/ext/abc/src/base/cmd/cmdHist.c +0 -180
data/ext/abc/src/base/cmd/cmdInt.h +0 -92
data/ext/abc/src/base/cmd/cmdLoad.c +0 -209
data/ext/abc/src/base/cmd/cmdPlugin.c +0 -773
data/ext/abc/src/base/cmd/cmdStarter.c +0 -259
data/ext/abc/src/base/cmd/cmdUtils.c +0 -756
data/ext/abc/src/base/cmd/module.make +0 -10
data/ext/abc/src/base/exor/exor.c +0 -958
data/ext/abc/src/base/exor/exor.h +0 -189
data/ext/abc/src/base/exor/exorBits.c +0 -425
data/ext/abc/src/base/exor/exorCubes.c +0 -190
data/ext/abc/src/base/exor/exorLink.c +0 -749
data/ext/abc/src/base/exor/exorList.c +0 -1156
data/ext/abc/src/base/exor/exorUtil.c +0 -228
data/ext/abc/src/base/exor/module.make +0 -6
data/ext/abc/src/base/io/io.c +0 -3157
data/ext/abc/src/base/io/ioAbc.h +0 -172
data/ext/abc/src/base/io/ioInt.h +0 -57
data/ext/abc/src/base/io/ioJson.c +0 -270
data/ext/abc/src/base/io/ioReadAiger.c +0 -599
data/ext/abc/src/base/io/ioReadBaf.c +0 -177
data/ext/abc/src/base/io/ioReadBblif.c +0 -348
data/ext/abc/src/base/io/ioReadBench.c +0 -391
data/ext/abc/src/base/io/ioReadBlif.c +0 -1707
data/ext/abc/src/base/io/ioReadBlifAig.c +0 -1019
data/ext/abc/src/base/io/ioReadBlifMv.c +0 -2363
data/ext/abc/src/base/io/ioReadDsd.c +0 -313
data/ext/abc/src/base/io/ioReadEdif.c +0 -240
data/ext/abc/src/base/io/ioReadEqn.c +0 -244
data/ext/abc/src/base/io/ioReadPla.c +0 -600
data/ext/abc/src/base/io/ioReadPlaMo.c +0 -813
data/ext/abc/src/base/io/ioReadVerilog.c +0 -102
data/ext/abc/src/base/io/ioUtil.c +0 -871
data/ext/abc/src/base/io/ioWriteAiger.c +0 -956
data/ext/abc/src/base/io/ioWriteBaf.c +0 -173
data/ext/abc/src/base/io/ioWriteBblif.c +0 -116
data/ext/abc/src/base/io/ioWriteBench.c +0 -340
data/ext/abc/src/base/io/ioWriteBlif.c +0 -1410
data/ext/abc/src/base/io/ioWriteBlifMv.c +0 -476
data/ext/abc/src/base/io/ioWriteBook.c +0 -998
data/ext/abc/src/base/io/ioWriteCnf.c +0 -120
data/ext/abc/src/base/io/ioWriteDot.c +0 -854
data/ext/abc/src/base/io/ioWriteEqn.c +0 -257
data/ext/abc/src/base/io/ioWriteGml.c +0 -121
data/ext/abc/src/base/io/ioWriteList.c +0 -293
data/ext/abc/src/base/io/ioWritePla.c +0 -460
data/ext/abc/src/base/io/ioWriteSmv.c +0 -265
data/ext/abc/src/base/io/ioWriteVerilog.c +0 -662
data/ext/abc/src/base/io/module.make +0 -31
data/ext/abc/src/base/main/abcapis.h +0 -106
data/ext/abc/src/base/main/abcapis_old.h +0 -84
data/ext/abc/src/base/main/libSupport.c +0 -211
data/ext/abc/src/base/main/main.c +0 -12
data/ext/abc/src/base/main/main.h +0 -171
data/ext/abc/src/base/main/mainFrame.c +0 -742
data/ext/abc/src/base/main/mainInit.c +0 -168
data/ext/abc/src/base/main/mainInt.h +0 -207
data/ext/abc/src/base/main/mainLib.c +0 -93
data/ext/abc/src/base/main/mainMC.c +0 -203
data/ext/abc/src/base/main/mainReal.c +0 -386
data/ext/abc/src/base/main/mainUtils.c +0 -294
data/ext/abc/src/base/main/module.make +0 -7
data/ext/abc/src/base/pla/module.make +0 -7
data/ext/abc/src/base/pla/pla.c +0 -52
data/ext/abc/src/base/pla/pla.h +0 -297
data/ext/abc/src/base/pla/plaCom.c +0 -507
data/ext/abc/src/base/pla/plaFxch.c +0 -854
data/ext/abc/src/base/pla/plaHash.c +0 -347
data/ext/abc/src/base/pla/plaMan.c +0 -300
data/ext/abc/src/base/pla/plaMerge.c +0 -55
data/ext/abc/src/base/pla/plaRead.c +0 -224
data/ext/abc/src/base/pla/plaSimple.c +0 -339
data/ext/abc/src/base/pla/plaWrite.c +0 -112
data/ext/abc/src/base/test/module.make +0 -1
data/ext/abc/src/base/test/test.c +0 -70
data/ext/abc/src/base/ver/module.make +0 -4
data/ext/abc/src/base/ver/ver.h +0 -122
data/ext/abc/src/base/ver/verCore.c +0 -3037
data/ext/abc/src/base/ver/verFormula.c +0 -479
data/ext/abc/src/base/ver/verParse.c +0 -131
data/ext/abc/src/base/ver/verStream.c +0 -450
data/ext/abc/src/base/ver/verWords.c +0 -53
data/ext/abc/src/base/ver/ver_.c +0 -53
data/ext/abc/src/base/wlc/module.make +0 -17
data/ext/abc/src/base/wlc/wlc.c +0 -274
data/ext/abc/src/base/wlc/wlc.h +0 -392
data/ext/abc/src/base/wlc/wlcAbc.c +0 -275
data/ext/abc/src/base/wlc/wlcAbs.c +0 -1912
data/ext/abc/src/base/wlc/wlcAbs2.c +0 -410
data/ext/abc/src/base/wlc/wlcBlast.c +0 -1692
data/ext/abc/src/base/wlc/wlcCom.c +0 -1559
data/ext/abc/src/base/wlc/wlcGraft.c +0 -573
data/ext/abc/src/base/wlc/wlcJson.c +0 -54
data/ext/abc/src/base/wlc/wlcNtk.c +0 -1268
data/ext/abc/src/base/wlc/wlcPth.c +0 -173
data/ext/abc/src/base/wlc/wlcReadSmt.c +0 -1784
data/ext/abc/src/base/wlc/wlcReadVer.c +0 -1308
data/ext/abc/src/base/wlc/wlcShow.c +0 -337
data/ext/abc/src/base/wlc/wlcSim.c +0 -251
data/ext/abc/src/base/wlc/wlcStdin.c +0 -255
data/ext/abc/src/base/wlc/wlcUif.c +0 -290
data/ext/abc/src/base/wlc/wlcWin.c +0 -166
data/ext/abc/src/base/wlc/wlcWriteVer.c +0 -450
data/ext/abc/src/bdd/bbr/bbr.h +0 -93
data/ext/abc/src/bdd/bbr/bbrCex.c +0 -172
data/ext/abc/src/bdd/bbr/bbrImage.c +0 -1327
data/ext/abc/src/bdd/bbr/bbrNtbdd.c +0 -218
data/ext/abc/src/bdd/bbr/bbrReach.c +0 -615
data/ext/abc/src/bdd/bbr/bbr_.c +0 -52
data/ext/abc/src/bdd/bbr/module.make +0 -4
data/ext/abc/src/bdd/cas/cas.h +0 -66
data/ext/abc/src/bdd/cas/casCore.c +0 -1265
data/ext/abc/src/bdd/cas/casDec.c +0 -512
data/ext/abc/src/bdd/cas/module.make +0 -3
data/ext/abc/src/bdd/cudd/Makefile +0 -124
data/ext/abc/src/bdd/cudd/cuBdd.make +0 -41
data/ext/abc/src/bdd/cudd/cudd.h +0 -1054
data/ext/abc/src/bdd/cudd/cudd.make +0 -42
data/ext/abc/src/bdd/cudd/cuddAPI.c +0 -4444
data/ext/abc/src/bdd/cudd/cuddAddAbs.c +0 -588
data/ext/abc/src/bdd/cudd/cuddAddApply.c +0 -949
data/ext/abc/src/bdd/cudd/cuddAddFind.c +0 -316
data/ext/abc/src/bdd/cudd/cuddAddInv.c +0 -209
data/ext/abc/src/bdd/cudd/cuddAddIte.c +0 -647
data/ext/abc/src/bdd/cudd/cuddAddNeg.c +0 -296
data/ext/abc/src/bdd/cudd/cuddAddWalsh.c +0 -399
data/ext/abc/src/bdd/cudd/cuddAndAbs.c +0 -384
data/ext/abc/src/bdd/cudd/cuddAnneal.c +0 -822
data/ext/abc/src/bdd/cudd/cuddApa.c +0 -979
data/ext/abc/src/bdd/cudd/cuddApprox.c +0 -2213
data/ext/abc/src/bdd/cudd/cuddBddAbs.c +0 -725
data/ext/abc/src/bdd/cudd/cuddBddCorr.c +0 -515
data/ext/abc/src/bdd/cudd/cuddBddIte.c +0 -1328
data/ext/abc/src/bdd/cudd/cuddBridge.c +0 -1021
data/ext/abc/src/bdd/cudd/cuddCache.c +0 -1100
data/ext/abc/src/bdd/cudd/cuddCheck.c +0 -887
data/ext/abc/src/bdd/cudd/cuddClip.c +0 -566
data/ext/abc/src/bdd/cudd/cuddCof.c +0 -335
data/ext/abc/src/bdd/cudd/cuddCompose.c +0 -1760
data/ext/abc/src/bdd/cudd/cuddDecomp.c +0 -2185
data/ext/abc/src/bdd/cudd/cuddEssent.c +0 -1475
data/ext/abc/src/bdd/cudd/cuddExact.c +0 -1028
data/ext/abc/src/bdd/cudd/cuddExport.c +0 -1384
data/ext/abc/src/bdd/cudd/cuddGenCof.c +0 -2175
data/ext/abc/src/bdd/cudd/cuddGenetic.c +0 -957
data/ext/abc/src/bdd/cudd/cuddGroup.c +0 -2173
data/ext/abc/src/bdd/cudd/cuddHarwell.c +0 -576
data/ext/abc/src/bdd/cudd/cuddInit.c +0 -319
data/ext/abc/src/bdd/cudd/cuddInt.h +0 -1232
data/ext/abc/src/bdd/cudd/cuddInteract.c +0 -437
data/ext/abc/src/bdd/cudd/cuddLCache.c +0 -1465
data/ext/abc/src/bdd/cudd/cuddLevelQ.c +0 -569
data/ext/abc/src/bdd/cudd/cuddLinear.c +0 -1373
data/ext/abc/src/bdd/cudd/cuddLiteral.c +0 -272
data/ext/abc/src/bdd/cudd/cuddMatMult.c +0 -715
data/ext/abc/src/bdd/cudd/cuddPriority.c +0 -2035
data/ext/abc/src/bdd/cudd/cuddRead.c +0 -525
data/ext/abc/src/bdd/cudd/cuddRef.c +0 -816
data/ext/abc/src/bdd/cudd/cuddReorder.c +0 -2143
data/ext/abc/src/bdd/cudd/cuddSat.c +0 -1338
data/ext/abc/src/bdd/cudd/cuddSign.c +0 -326
data/ext/abc/src/bdd/cudd/cuddSolve.c +0 -374
data/ext/abc/src/bdd/cudd/cuddSplit.c +0 -694
data/ext/abc/src/bdd/cudd/cuddSubsetHB.c +0 -1337
data/ext/abc/src/bdd/cudd/cuddSubsetSP.c +0 -1657
data/ext/abc/src/bdd/cudd/cuddSymmetry.c +0 -1706
data/ext/abc/src/bdd/cudd/cuddTable.c +0 -3179
data/ext/abc/src/bdd/cudd/cuddUtil.c +0 -3929
data/ext/abc/src/bdd/cudd/cuddWindow.c +0 -1031
data/ext/abc/src/bdd/cudd/cuddZddCount.c +0 -357
data/ext/abc/src/bdd/cudd/cuddZddFuncs.c +0 -1638
data/ext/abc/src/bdd/cudd/cuddZddGroup.c +0 -1344
data/ext/abc/src/bdd/cudd/cuddZddIsop.c +0 -919
data/ext/abc/src/bdd/cudd/cuddZddLin.c +0 -975
data/ext/abc/src/bdd/cudd/cuddZddMisc.c +0 -286
data/ext/abc/src/bdd/cudd/cuddZddPort.c +0 -389
data/ext/abc/src/bdd/cudd/cuddZddReord.c +0 -1668
data/ext/abc/src/bdd/cudd/cuddZddSetop.c +0 -1166
data/ext/abc/src/bdd/cudd/cuddZddSymm.c +0 -1707
data/ext/abc/src/bdd/cudd/cuddZddUtil.c +0 -1071
data/ext/abc/src/bdd/cudd/license +0 -32
data/ext/abc/src/bdd/cudd/module.make +0 -61
data/ext/abc/src/bdd/cudd/r7x8.1.mat +0 -53
data/ext/abc/src/bdd/cudd/r7x8.1.out +0 -377
data/ext/abc/src/bdd/cudd/testcudd.c +0 -1073
data/ext/abc/src/bdd/dsd/dsd.h +0 -134
data/ext/abc/src/bdd/dsd/dsdApi.c +0 -102
data/ext/abc/src/bdd/dsd/dsdCheck.c +0 -319
data/ext/abc/src/bdd/dsd/dsdInt.h +0 -99
data/ext/abc/src/bdd/dsd/dsdLocal.c +0 -342
data/ext/abc/src/bdd/dsd/dsdMan.c +0 -119
data/ext/abc/src/bdd/dsd/dsdProc.c +0 -1613
data/ext/abc/src/bdd/dsd/dsdTree.c +0 -1181
data/ext/abc/src/bdd/dsd/module.make +0 -6
data/ext/abc/src/bdd/epd/epd.c +0 -1347
data/ext/abc/src/bdd/epd/epd.h +0 -196
data/ext/abc/src/bdd/epd/module.make +0 -1
data/ext/abc/src/bdd/extrab/extraBdd.h +0 -317
data/ext/abc/src/bdd/extrab/extraBddAuto.c +0 -1563
data/ext/abc/src/bdd/extrab/extraBddCas.c +0 -1235
data/ext/abc/src/bdd/extrab/extraBddImage.c +0 -1162
data/ext/abc/src/bdd/extrab/extraBddKmap.c +0 -876
data/ext/abc/src/bdd/extrab/extraBddMisc.c +0 -2591
data/ext/abc/src/bdd/extrab/extraBddSymm.c +0 -1474
data/ext/abc/src/bdd/extrab/extraBddThresh.c +0 -693
data/ext/abc/src/bdd/extrab/extraBddTime.c +0 -660
data/ext/abc/src/bdd/extrab/extraBddUnate.c +0 -646
data/ext/abc/src/bdd/extrab/module.make +0 -9
data/ext/abc/src/bdd/llb/llb.c +0 -52
data/ext/abc/src/bdd/llb/llb.h +0 -96
data/ext/abc/src/bdd/llb/llb1Cluster.c +0 -356
data/ext/abc/src/bdd/llb/llb1Constr.c +0 -313
data/ext/abc/src/bdd/llb/llb1Core.c +0 -222
data/ext/abc/src/bdd/llb/llb1Group.c +0 -474
data/ext/abc/src/bdd/llb/llb1Hint.c +0 -226
data/ext/abc/src/bdd/llb/llb1Man.c +0 -218
data/ext/abc/src/bdd/llb/llb1Matrix.c +0 -430
data/ext/abc/src/bdd/llb/llb1Pivot.c +0 -254
data/ext/abc/src/bdd/llb/llb1Reach.c +0 -904
data/ext/abc/src/bdd/llb/llb1Sched.c +0 -257
data/ext/abc/src/bdd/llb/llb2Bad.c +0 -138
data/ext/abc/src/bdd/llb/llb2Core.c +0 -777
data/ext/abc/src/bdd/llb/llb2Driver.c +0 -222
data/ext/abc/src/bdd/llb/llb2Dump.c +0 -104
data/ext/abc/src/bdd/llb/llb2Flow.c +0 -1376
data/ext/abc/src/bdd/llb/llb2Image.c +0 -482
data/ext/abc/src/bdd/llb/llb3Image.c +0 -1095
data/ext/abc/src/bdd/llb/llb3Nonlin.c +0 -872
data/ext/abc/src/bdd/llb/llb4Cex.c +0 -320
data/ext/abc/src/bdd/llb/llb4Cluster.c +0 -452
data/ext/abc/src/bdd/llb/llb4Image.c +0 -863
data/ext/abc/src/bdd/llb/llb4Map.c +0 -123
data/ext/abc/src/bdd/llb/llb4Nonlin.c +0 -1185
data/ext/abc/src/bdd/llb/llb4Sweep.c +0 -589
data/ext/abc/src/bdd/llb/llbInt.h +0 -212
data/ext/abc/src/bdd/llb/module.make +0 -22
data/ext/abc/src/bdd/mtr/module.make +0 -2
data/ext/abc/src/bdd/mtr/mtr.h +0 -187
data/ext/abc/src/bdd/mtr/mtrBasic.c +0 -453
data/ext/abc/src/bdd/mtr/mtrGroup.c +0 -734
data/ext/abc/src/bdd/mtr/mtrInt.h +0 -94
data/ext/abc/src/bdd/reo/module.make +0 -8
data/ext/abc/src/bdd/reo/reo.h +0 -234
data/ext/abc/src/bdd/reo/reoApi.c +0 -294
data/ext/abc/src/bdd/reo/reoCore.c +0 -441
data/ext/abc/src/bdd/reo/reoProfile.c +0 -370
data/ext/abc/src/bdd/reo/reoShuffle.c +0 -230
data/ext/abc/src/bdd/reo/reoSift.c +0 -346
data/ext/abc/src/bdd/reo/reoSwap.c +0 -905
data/ext/abc/src/bdd/reo/reoTest.c +0 -256
data/ext/abc/src/bdd/reo/reoTransfer.c +0 -206
data/ext/abc/src/bdd/reo/reoUnits.c +0 -190
data/ext/abc/src/bool/bdc/bdc.h +0 -98
data/ext/abc/src/bool/bdc/bdcCore.c +0 -374
data/ext/abc/src/bool/bdc/bdcDec.c +0 -751
data/ext/abc/src/bool/bdc/bdcInt.h +0 -165
data/ext/abc/src/bool/bdc/bdcSpfd.c +0 -1184
data/ext/abc/src/bool/bdc/bdcTable.c +0 -134
data/ext/abc/src/bool/bdc/bdc_.c +0 -54
data/ext/abc/src/bool/bdc/module.make +0 -5
data/ext/abc/src/bool/dec/dec.h +0 -725
data/ext/abc/src/bool/dec/decAbc.c +0 -358
data/ext/abc/src/bool/dec/decFactor.c +0 -403
data/ext/abc/src/bool/dec/decMan.c +0 -88
data/ext/abc/src/bool/dec/decPrint.c +0 -289
data/ext/abc/src/bool/dec/decUtil.c +0 -148
data/ext/abc/src/bool/dec/module.make +0 -5
data/ext/abc/src/bool/deco/deco.h +0 -714
data/ext/abc/src/bool/deco/module.make +0 -1
data/ext/abc/src/bool/kit/cloud.c +0 -993
data/ext/abc/src/bool/kit/cloud.h +0 -254
data/ext/abc/src/bool/kit/kit.h +0 -655
data/ext/abc/src/bool/kit/kitAig.c +0 -126
data/ext/abc/src/bool/kit/kitBdd.c +0 -243
data/ext/abc/src/bool/kit/kitCloud.c +0 -378
data/ext/abc/src/bool/kit/kitDec.c +0 -343
data/ext/abc/src/bool/kit/kitDsd.c +0 -3285
data/ext/abc/src/bool/kit/kitFactor.c +0 -344
data/ext/abc/src/bool/kit/kitGraph.c +0 -402
data/ext/abc/src/bool/kit/kitHop.c +0 -200
data/ext/abc/src/bool/kit/kitIsop.c +0 -365
data/ext/abc/src/bool/kit/kitPerm.c +0 -357
data/ext/abc/src/bool/kit/kitPla.c +0 -535
data/ext/abc/src/bool/kit/kitSop.c +0 -579
data/ext/abc/src/bool/kit/kitTruth.c +0 -2224
data/ext/abc/src/bool/kit/kit_.c +0 -53
data/ext/abc/src/bool/kit/module.make +0 -11
data/ext/abc/src/bool/lucky/lucky.c +0 -705
data/ext/abc/src/bool/lucky/lucky.h +0 -44
data/ext/abc/src/bool/lucky/luckyFast16.c +0 -872
data/ext/abc/src/bool/lucky/luckyFast6.c +0 -285
data/ext/abc/src/bool/lucky/luckyInt.h +0 -136
data/ext/abc/src/bool/lucky/luckyRead.c +0 -333
data/ext/abc/src/bool/lucky/luckySimple.c +0 -307
data/ext/abc/src/bool/lucky/luckySwap.c +0 -402
data/ext/abc/src/bool/lucky/luckySwapIJ.c +0 -102
data/ext/abc/src/bool/lucky/module.make +0 -7
data/ext/abc/src/bool/rpo/literal.h +0 -297
data/ext/abc/src/bool/rpo/module.make +0 -1
data/ext/abc/src/bool/rpo/rpo.c +0 -383
data/ext/abc/src/bool/rpo/rpo.h +0 -61
data/ext/abc/src/bool/rsb/module.make +0 -2
data/ext/abc/src/bool/rsb/rsb.h +0 -65
data/ext/abc/src/bool/rsb/rsbDec6.c +0 -770
data/ext/abc/src/bool/rsb/rsbInt.h +0 -84
data/ext/abc/src/bool/rsb/rsbMan.c +0 -99
data/ext/abc/src/demo.c +0 -181
data/ext/abc/src/generic.c +0 -52
data/ext/abc/src/generic.h +0 -63
data/ext/abc/src/map/amap/amap.h +0 -97
data/ext/abc/src/map/amap/amapCore.c +0 -110
data/ext/abc/src/map/amap/amapGraph.c +0 -399
data/ext/abc/src/map/amap/amapInt.h +0 -376
data/ext/abc/src/map/amap/amapLib.c +0 -374
data/ext/abc/src/map/amap/amapLiberty.c +0 -1103
data/ext/abc/src/map/amap/amapMan.c +0 -104
data/ext/abc/src/map/amap/amapMatch.c +0 -622
data/ext/abc/src/map/amap/amapMerge.c +0 -541
data/ext/abc/src/map/amap/amapOutput.c +0 -186
data/ext/abc/src/map/amap/amapParse.c +0 -480
data/ext/abc/src/map/amap/amapPerm.c +0 -380
data/ext/abc/src/map/amap/amapRead.c +0 -494
data/ext/abc/src/map/amap/amapRule.c +0 -462
data/ext/abc/src/map/amap/amapUniq.c +0 -317
data/ext/abc/src/map/amap/module.make +0 -13
data/ext/abc/src/map/cov/cov.h +0 -109
data/ext/abc/src/map/cov/covBuild.c +0 -544
data/ext/abc/src/map/cov/covCore.c +0 -1030
data/ext/abc/src/map/cov/covInt.h +0 -654
data/ext/abc/src/map/cov/covMan.c +0 -149
data/ext/abc/src/map/cov/covMinEsop.c +0 -304
data/ext/abc/src/map/cov/covMinMan.c +0 -118
data/ext/abc/src/map/cov/covMinSop.c +0 -620
data/ext/abc/src/map/cov/covMinUtil.c +0 -343
data/ext/abc/src/map/cov/covTest.c +0 -422
data/ext/abc/src/map/cov/module.make +0 -7
data/ext/abc/src/map/fpga/fpga.c +0 -288
data/ext/abc/src/map/fpga/fpga.h +0 -175
data/ext/abc/src/map/fpga/fpgaCore.c +0 -194
data/ext/abc/src/map/fpga/fpgaCreate.c +0 -584
data/ext/abc/src/map/fpga/fpgaCut.c +0 -1186
data/ext/abc/src/map/fpga/fpgaCutUtils.c +0 -476
data/ext/abc/src/map/fpga/fpgaFanout.c +0 -146
data/ext/abc/src/map/fpga/fpgaGENERIC.c +0 -51
data/ext/abc/src/map/fpga/fpgaInt.h +0 -389
data/ext/abc/src/map/fpga/fpgaLib.c +0 -255
data/ext/abc/src/map/fpga/fpgaMatch.c +0 -800
data/ext/abc/src/map/fpga/fpgaSwitch.c +0 -156
data/ext/abc/src/map/fpga/fpgaTime.c +0 -267
data/ext/abc/src/map/fpga/fpgaTruth.c +0 -171
data/ext/abc/src/map/fpga/fpgaUtils.c +0 -990
data/ext/abc/src/map/fpga/fpgaVec.c +0 -413
data/ext/abc/src/map/fpga/module.make +0 -13
data/ext/abc/src/map/if/if.h +0 -689
data/ext/abc/src/map/if/ifCache.c +0 -100
data/ext/abc/src/map/if/ifCheck.c +0 -204
data/ext/abc/src/map/if/ifCom.c +0 -372
data/ext/abc/src/map/if/ifCore.c +0 -200
data/ext/abc/src/map/if/ifCount.h +0 -521
data/ext/abc/src/map/if/ifCut.c +0 -1479
data/ext/abc/src/map/if/ifData2.c +0 -52
data/ext/abc/src/map/if/ifDec07.c +0 -1125
data/ext/abc/src/map/if/ifDec08.c +0 -507
data/ext/abc/src/map/if/ifDec10.c +0 -506
data/ext/abc/src/map/if/ifDec16.c +0 -2374
data/ext/abc/src/map/if/ifDec75.c +0 -341
data/ext/abc/src/map/if/ifDelay.c +0 -447
data/ext/abc/src/map/if/ifDsd.c +0 -2838
data/ext/abc/src/map/if/ifLibBox.c +0 -401
data/ext/abc/src/map/if/ifLibLut.c +0 -505
data/ext/abc/src/map/if/ifMan.c +0 -720
data/ext/abc/src/map/if/ifMap.c +0 -680
data/ext/abc/src/map/if/ifMatch2.c +0 -62
data/ext/abc/src/map/if/ifReduce.c +0 -466
data/ext/abc/src/map/if/ifSat.c +0 -548
data/ext/abc/src/map/if/ifSelect.c +0 -601
data/ext/abc/src/map/if/ifSeq.c +0 -397
data/ext/abc/src/map/if/ifTest.c +0 -352
data/ext/abc/src/map/if/ifTime.c +0 -525
data/ext/abc/src/map/if/ifTruth.c +0 -339
data/ext/abc/src/map/if/ifTune.c +0 -1452
data/ext/abc/src/map/if/ifUtil.c +0 -632
data/ext/abc/src/map/if/if_.c +0 -52
data/ext/abc/src/map/if/module.make +0 -26
data/ext/abc/src/map/mapper/mapper.c +0 -185
data/ext/abc/src/map/mapper/mapper.h +0 -201
data/ext/abc/src/map/mapper/mapperCanon.c +0 -277
data/ext/abc/src/map/mapper/mapperCore.c +0 -231
data/ext/abc/src/map/mapper/mapperCreate.c +0 -587
data/ext/abc/src/map/mapper/mapperCut.c +0 -1178
data/ext/abc/src/map/mapper/mapperCutUtils.c +0 -279
data/ext/abc/src/map/mapper/mapperFanout.c +0 -146
data/ext/abc/src/map/mapper/mapperInt.h +0 -469
data/ext/abc/src/map/mapper/mapperLib.c +0 -258
data/ext/abc/src/map/mapper/mapperMatch.c +0 -664
data/ext/abc/src/map/mapper/mapperRefs.c +0 -540
data/ext/abc/src/map/mapper/mapperSuper.c +0 -456
data/ext/abc/src/map/mapper/mapperSwitch.c +0 -229
data/ext/abc/src/map/mapper/mapperTable.c +0 -407
data/ext/abc/src/map/mapper/mapperTime.c +0 -459
data/ext/abc/src/map/mapper/mapperTree.c +0 -1042
data/ext/abc/src/map/mapper/mapperTruth.c +0 -315
data/ext/abc/src/map/mapper/mapperUtils.c +0 -898
data/ext/abc/src/map/mapper/mapperVec.c +0 -344
data/ext/abc/src/map/mapper/module.make +0 -17
data/ext/abc/src/map/mio/exp.h +0 -343
data/ext/abc/src/map/mio/mio.c +0 -728
data/ext/abc/src/map/mio/mio.h +0 -242
data/ext/abc/src/map/mio/mioApi.c +0 -254
data/ext/abc/src/map/mio/mioForm.c +0 -307
data/ext/abc/src/map/mio/mioFunc.c +0 -327
data/ext/abc/src/map/mio/mioInt.h +0 -160
data/ext/abc/src/map/mio/mioParse.c +0 -504
data/ext/abc/src/map/mio/mioRead.c +0 -780
data/ext/abc/src/map/mio/mioSop.c +0 -333
data/ext/abc/src/map/mio/mioUtils.c +0 -1752
data/ext/abc/src/map/mio/module.make +0 -7
data/ext/abc/src/map/mpm/module.make +0 -11
data/ext/abc/src/map/mpm/mpm.c +0 -55
data/ext/abc/src/map/mpm/mpm.h +0 -98
data/ext/abc/src/map/mpm/mpmAbc.c +0 -350
data/ext/abc/src/map/mpm/mpmCore.c +0 -115
data/ext/abc/src/map/mpm/mpmDsd.c +0 -1055
data/ext/abc/src/map/mpm/mpmGates.c +0 -307
data/ext/abc/src/map/mpm/mpmInt.h +0 -265
data/ext/abc/src/map/mpm/mpmLib.c +0 -74
data/ext/abc/src/map/mpm/mpmMan.c +0 -207
data/ext/abc/src/map/mpm/mpmMap.c +0 -872
data/ext/abc/src/map/mpm/mpmMig.c +0 -204
data/ext/abc/src/map/mpm/mpmMig.h +0 -358
data/ext/abc/src/map/mpm/mpmPre.c +0 -1029
data/ext/abc/src/map/mpm/mpmTruth.c +0 -239
data/ext/abc/src/map/mpm/mpmUtil.c +0 -52
data/ext/abc/src/map/scl/module.make +0 -11
data/ext/abc/src/map/scl/scl.c +0 -2042
data/ext/abc/src/map/scl/scl.h +0 -58
data/ext/abc/src/map/scl/sclBufSize.c +0 -518
data/ext/abc/src/map/scl/sclBuffer.c +0 -1010
data/ext/abc/src/map/scl/sclCon.h +0 -293
data/ext/abc/src/map/scl/sclDnsize.c +0 -378
data/ext/abc/src/map/scl/sclLib.h +0 -770
data/ext/abc/src/map/scl/sclLibScl.c +0 -848
data/ext/abc/src/map/scl/sclLibUtil.c +0 -1078
data/ext/abc/src/map/scl/sclLiberty.c +0 -1697
data/ext/abc/src/map/scl/sclLoad.c +0 -238
data/ext/abc/src/map/scl/sclSize.c +0 -915
data/ext/abc/src/map/scl/sclSize.h +0 -594
data/ext/abc/src/map/scl/sclTime.h +0 -234
data/ext/abc/src/map/scl/sclUpsize.c +0 -1045
data/ext/abc/src/map/scl/sclUtil.c +0 -320
data/ext/abc/src/map/super/module.make +0 -3
data/ext/abc/src/map/super/super.c +0 -333
data/ext/abc/src/map/super/super.h +0 -62
data/ext/abc/src/map/super/superAnd.c +0 -701
data/ext/abc/src/map/super/superGENERIC.c +0 -51
data/ext/abc/src/map/super/superGate.c +0 -1473
data/ext/abc/src/map/super/superInt.h +0 -64
data/ext/abc/src/map/super/superWrite.c +0 -81
data/ext/abc/src/misc/avl/avl.c +0 -621
data/ext/abc/src/misc/avl/avl.doc +0 -166
data/ext/abc/src/misc/avl/avl.h +0 -91
data/ext/abc/src/misc/bar/bar.c +0 -193
data/ext/abc/src/misc/bar/bar.h +0 -78
data/ext/abc/src/misc/bar/module.make +0 -1
data/ext/abc/src/misc/bbl/bblif.c +0 -1518
data/ext/abc/src/misc/bbl/bblif.h +0 -285
data/ext/abc/src/misc/bbl/module.make +0 -1
data/ext/abc/src/misc/bzlib/CHANGES +0 -319
data/ext/abc/src/misc/bzlib/LICENSE +0 -42
data/ext/abc/src/misc/bzlib/blocksort.c +0 -1098
data/ext/abc/src/misc/bzlib/bzip2.txt +0 -391
data/ext/abc/src/misc/bzlib/bzlib.c +0 -1588
data/ext/abc/src/misc/bzlib/bzlib.h +0 -287
data/ext/abc/src/misc/bzlib/bzlib_private.h +0 -513
data/ext/abc/src/misc/bzlib/compress.c +0 -677
data/ext/abc/src/misc/bzlib/crctable.c +0 -109
data/ext/abc/src/misc/bzlib/decompress.c +0 -631
data/ext/abc/src/misc/bzlib/huffman.c +0 -210
data/ext/abc/src/misc/bzlib/link.txt +0 -2
data/ext/abc/src/misc/bzlib/manual.html +0 -2540
data/ext/abc/src/misc/bzlib/module.make +0 -7
data/ext/abc/src/misc/bzlib/randtable.c +0 -89
data/ext/abc/src/misc/espresso/cofactor.c +0 -389
data/ext/abc/src/misc/espresso/cols.c +0 -319
data/ext/abc/src/misc/espresso/compl.c +0 -685
data/ext/abc/src/misc/espresso/contain.c +0 -450
data/ext/abc/src/misc/espresso/cubehack.c +0 -143
data/ext/abc/src/misc/espresso/cubestr.c +0 -157
data/ext/abc/src/misc/espresso/cvrin.c +0 -816
data/ext/abc/src/misc/espresso/cvrm.c +0 -544
data/ext/abc/src/misc/espresso/cvrmisc.c +0 -147
data/ext/abc/src/misc/espresso/cvrout.c +0 -614
data/ext/abc/src/misc/espresso/dominate.c +0 -103
data/ext/abc/src/misc/espresso/equiv.c +0 -99
data/ext/abc/src/misc/espresso/espresso.c +0 -144
data/ext/abc/src/misc/espresso/espresso.h +0 -786
data/ext/abc/src/misc/espresso/essen.c +0 -184
data/ext/abc/src/misc/espresso/exact.c +0 -186
data/ext/abc/src/misc/espresso/expand.c +0 -700
data/ext/abc/src/misc/espresso/gasp.c +0 -233
data/ext/abc/src/misc/espresso/gimpel.c +0 -112
data/ext/abc/src/misc/espresso/globals.c +0 -81
data/ext/abc/src/misc/espresso/hack.c +0 -646
data/ext/abc/src/misc/espresso/indep.c +0 -139
data/ext/abc/src/misc/espresso/irred.c +0 -445
data/ext/abc/src/misc/espresso/main.c +0 -751
data/ext/abc/src/misc/espresso/main.h +0 -122
data/ext/abc/src/misc/espresso/map.c +0 -122
data/ext/abc/src/misc/espresso/matrix.c +0 -579
data/ext/abc/src/misc/espresso/mincov.c +0 -383
data/ext/abc/src/misc/espresso/mincov.h +0 -11
data/ext/abc/src/misc/espresso/mincov_int.h +0 -55
data/ext/abc/src/misc/espresso/module.make +0 -39
data/ext/abc/src/misc/espresso/opo.c +0 -629
data/ext/abc/src/misc/espresso/pair.c +0 -685
data/ext/abc/src/misc/espresso/part.c +0 -127
data/ext/abc/src/misc/espresso/primes.c +0 -175
data/ext/abc/src/misc/espresso/reduce.c +0 -263
data/ext/abc/src/misc/espresso/rows.c +0 -319
data/ext/abc/src/misc/espresso/set.c +0 -825
data/ext/abc/src/misc/espresso/setc.c +0 -488
data/ext/abc/src/misc/espresso/sharp.c +0 -252
data/ext/abc/src/misc/espresso/sminterf.c +0 -49
data/ext/abc/src/misc/espresso/solution.c +0 -119
data/ext/abc/src/misc/espresso/sparse.c +0 -151
data/ext/abc/src/misc/espresso/sparse.h +0 -143
data/ext/abc/src/misc/espresso/sparse_int.h +0 -121
data/ext/abc/src/misc/espresso/unate.c +0 -446
data/ext/abc/src/misc/espresso/util_old.h +0 -309
data/ext/abc/src/misc/espresso/verify.c +0 -198
data/ext/abc/src/misc/extra/extra.h +0 -417
data/ext/abc/src/misc/extra/extraUtilBitMatrix.c +0 -420
data/ext/abc/src/misc/extra/extraUtilCanon.c +0 -691
data/ext/abc/src/misc/extra/extraUtilCube.c +0 -279
data/ext/abc/src/misc/extra/extraUtilDsd.c +0 -1271
data/ext/abc/src/misc/extra/extraUtilEnum.c +0 -680
data/ext/abc/src/misc/extra/extraUtilFile.c +0 -887
data/ext/abc/src/misc/extra/extraUtilMemory.c +0 -628
data/ext/abc/src/misc/extra/extraUtilMisc.c +0 -2580
data/ext/abc/src/misc/extra/extraUtilPerm.c +0 -933
data/ext/abc/src/misc/extra/extraUtilPrime.c +0 -602
data/ext/abc/src/misc/extra/extraUtilProgress.c +0 -185
data/ext/abc/src/misc/extra/extraUtilReader.c +0 -390
data/ext/abc/src/misc/extra/extraUtilSupp.c +0 -532
data/ext/abc/src/misc/extra/extraUtilTruth.c +0 -1153
data/ext/abc/src/misc/extra/extraUtilUtil.c +0 -421
data/ext/abc/src/misc/extra/extraZddTrunc.c +0 -338
data/ext/abc/src/misc/extra/module.make +0 -14
data/ext/abc/src/misc/hash/hash.h +0 -70
data/ext/abc/src/misc/hash/hashFlt.h +0 -339
data/ext/abc/src/misc/hash/hashGen.h +0 -367
data/ext/abc/src/misc/hash/hashInt.h +0 -302
data/ext/abc/src/misc/hash/hashPtr.h +0 -339
data/ext/abc/src/misc/hash/module.make +0 -1
data/ext/abc/src/misc/mem/mem.c +0 -605
data/ext/abc/src/misc/mem/mem.h +0 -75
data/ext/abc/src/misc/mem/mem2.h +0 -271
data/ext/abc/src/misc/mem/module.make +0 -1
data/ext/abc/src/misc/mvc/module.make +0 -15
data/ext/abc/src/misc/mvc/mvc.c +0 -51
data/ext/abc/src/misc/mvc/mvc.h +0 -739
data/ext/abc/src/misc/mvc/mvcApi.c +0 -238
data/ext/abc/src/misc/mvc/mvcCompare.c +0 -374
data/ext/abc/src/misc/mvc/mvcContain.c +0 -178
data/ext/abc/src/misc/mvc/mvcCover.c +0 -256
data/ext/abc/src/misc/mvc/mvcCube.c +0 -180
data/ext/abc/src/misc/mvc/mvcDivide.c +0 -442
data/ext/abc/src/misc/mvc/mvcDivisor.c +0 -95
data/ext/abc/src/misc/mvc/mvcList.c +0 -367
data/ext/abc/src/misc/mvc/mvcLits.c +0 -350
data/ext/abc/src/misc/mvc/mvcMan.c +0 -82
data/ext/abc/src/misc/mvc/mvcOpAlg.c +0 -168
data/ext/abc/src/misc/mvc/mvcOpBool.c +0 -156
data/ext/abc/src/misc/mvc/mvcPrint.c +0 -225
data/ext/abc/src/misc/mvc/mvcSort.c +0 -146
data/ext/abc/src/misc/mvc/mvcUtils.c +0 -873
data/ext/abc/src/misc/nm/module.make +0 -2
data/ext/abc/src/misc/nm/nm.h +0 -96
data/ext/abc/src/misc/nm/nmApi.c +0 -278
data/ext/abc/src/misc/nm/nmInt.h +0 -94
data/ext/abc/src/misc/nm/nmTable.c +0 -310
data/ext/abc/src/misc/parse/module.make +0 -2
data/ext/abc/src/misc/parse/parse.h +0 -62
data/ext/abc/src/misc/parse/parseCore.c +0 -536
data/ext/abc/src/misc/parse/parseEqn.c +0 -362
data/ext/abc/src/misc/parse/parseInt.h +0 -77
data/ext/abc/src/misc/parse/parseStack.c +0 -248
data/ext/abc/src/misc/st/module.make +0 -2
data/ext/abc/src/misc/st/st.c +0 -561
data/ext/abc/src/misc/st/st.h +0 -121
data/ext/abc/src/misc/st/stmm.c +0 -627
data/ext/abc/src/misc/st/stmm.h +0 -147
data/ext/abc/src/misc/tim/module.make +0 -5
data/ext/abc/src/misc/tim/tim.c +0 -39
data/ext/abc/src/misc/tim/tim.h +0 -184
data/ext/abc/src/misc/tim/timBox.c +0 -326
data/ext/abc/src/misc/tim/timDump.c +0 -201
data/ext/abc/src/misc/tim/timInt.h +0 -148
data/ext/abc/src/misc/tim/timMan.c +0 -807
data/ext/abc/src/misc/tim/timTime.c +0 -267
data/ext/abc/src/misc/tim/timTrav.c +0 -185
data/ext/abc/src/misc/util/abc_global.h +0 -416
data/ext/abc/src/misc/util/abc_namespaces.h +0 -58
data/ext/abc/src/misc/util/module.make +0 -8
data/ext/abc/src/misc/util/utilBridge.c +0 -564
data/ext/abc/src/misc/util/utilCex.c +0 -574
data/ext/abc/src/misc/util/utilCex.h +0 -84
data/ext/abc/src/misc/util/utilColor.c +0 -124
data/ext/abc/src/misc/util/utilDouble.h +0 -222
data/ext/abc/src/misc/util/utilFile.c +0 -221
data/ext/abc/src/misc/util/utilFloat.h +0 -226
data/ext/abc/src/misc/util/utilIsop.c +0 -1139
data/ext/abc/src/misc/util/utilMem.c +0 -341
data/ext/abc/src/misc/util/utilMem.h +0 -73
data/ext/abc/src/misc/util/utilNam.c +0 -622
data/ext/abc/src/misc/util/utilNam.h +0 -80
data/ext/abc/src/misc/util/utilSignal.c +0 -68
data/ext/abc/src/misc/util/utilSignal.h +0 -58
data/ext/abc/src/misc/util/utilSort.c +0 -789
data/ext/abc/src/misc/util/utilTruth.h +0 -3076
data/ext/abc/src/misc/util/util_hack.h +0 -46
data/ext/abc/src/misc/vec/module.make +0 -1
data/ext/abc/src/misc/vec/vec.h +0 -74
data/ext/abc/src/misc/vec/vecAtt.h +0 -298
data/ext/abc/src/misc/vec/vecBit.h +0 -636
data/ext/abc/src/misc/vec/vecFlt.h +0 -826
data/ext/abc/src/misc/vec/vecHash.h +0 -280
data/ext/abc/src/misc/vec/vecHsh.h +0 -590
data/ext/abc/src/misc/vec/vecInt.h +0 -2078
data/ext/abc/src/misc/vec/vecMem.h +0 -431
data/ext/abc/src/misc/vec/vecPtr.h +0 -1160
data/ext/abc/src/misc/vec/vecQue.h +0 -374
data/ext/abc/src/misc/vec/vecSet.h +0 -299
data/ext/abc/src/misc/vec/vecStr.h +0 -1072
data/ext/abc/src/misc/vec/vecVec.h +0 -646
data/ext/abc/src/misc/vec/vecWec.h +0 -738
data/ext/abc/src/misc/vec/vecWrd.h +0 -1205
data/ext/abc/src/misc/zlib/README +0 -115
data/ext/abc/src/misc/zlib/adler32.c +0 -168
data/ext/abc/src/misc/zlib/algorithm.txt +0 -209
data/ext/abc/src/misc/zlib/compress_.c +0 -76
data/ext/abc/src/misc/zlib/crc32.c +0 -433
data/ext/abc/src/misc/zlib/crc32.h +0 -445
data/ext/abc/src/misc/zlib/deflate.c +0 -1784
data/ext/abc/src/misc/zlib/deflate.h +0 -346
data/ext/abc/src/misc/zlib/gzclose.c +0 -33
data/ext/abc/src/misc/zlib/gzguts.h +0 -147
data/ext/abc/src/misc/zlib/gzlib.c +0 -517
data/ext/abc/src/misc/zlib/gzread.c +0 -641
data/ext/abc/src/misc/zlib/gzwrite.c +0 -520
data/ext/abc/src/misc/zlib/infback.c +0 -631
data/ext/abc/src/misc/zlib/inffast.c +0 -351
data/ext/abc/src/misc/zlib/inffast.h +0 -15
data/ext/abc/src/misc/zlib/inffixed.h +0 -98
data/ext/abc/src/misc/zlib/inflate.c +0 -1457
data/ext/abc/src/misc/zlib/inflate.h +0 -126
data/ext/abc/src/misc/zlib/inftrees.c +0 -337
data/ext/abc/src/misc/zlib/inftrees.h +0 -66
data/ext/abc/src/misc/zlib/license +0 -31
data/ext/abc/src/misc/zlib/link.txt +0 -1
data/ext/abc/src/misc/zlib/module.make +0 -15
data/ext/abc/src/misc/zlib/trees.c +0 -1216
data/ext/abc/src/misc/zlib/trees.h +0 -132
data/ext/abc/src/misc/zlib/uncompr.c +0 -67
data/ext/abc/src/misc/zlib/zconf.h +0 -432
data/ext/abc/src/misc/zlib/zlib.h +0 -1619
data/ext/abc/src/misc/zlib/zutil.c +0 -318
data/ext/abc/src/misc/zlib/zutil.h +0 -288
data/ext/abc/src/opt/cgt/cgt.h +0 -87
data/ext/abc/src/opt/cgt/cgtAig.c +0 -601
data/ext/abc/src/opt/cgt/cgtCore.c +0 -328
data/ext/abc/src/opt/cgt/cgtDecide.c +0 -300
data/ext/abc/src/opt/cgt/cgtInt.h +0 -123
data/ext/abc/src/opt/cgt/cgtMan.c +0 -179
data/ext/abc/src/opt/cgt/cgtSat.c +0 -98
data/ext/abc/src/opt/cgt/module.make +0 -5
data/ext/abc/src/opt/csw/csw.h +0 -69
data/ext/abc/src/opt/csw/cswCore.c +0 -100
data/ext/abc/src/opt/csw/cswCut.c +0 -608
data/ext/abc/src/opt/csw/cswInt.h +0 -160
data/ext/abc/src/opt/csw/cswMan.c +0 -130
data/ext/abc/src/opt/csw/cswTable.c +0 -166
data/ext/abc/src/opt/csw/csw_.c +0 -53
data/ext/abc/src/opt/csw/module.make +0 -4
data/ext/abc/src/opt/cut/abcCut.c +0 -498
data/ext/abc/src/opt/cut/cut.h +0 -172
data/ext/abc/src/opt/cut/cutApi.c +0 -202
data/ext/abc/src/opt/cut/cutCut.c +0 -364
data/ext/abc/src/opt/cut/cutExpand.c +0 -189
data/ext/abc/src/opt/cut/cutInt.h +0 -165
data/ext/abc/src/opt/cut/cutList.h +0 -215
data/ext/abc/src/opt/cut/cutMan.c +0 -320
data/ext/abc/src/opt/cut/cutMerge.c +0 -662
data/ext/abc/src/opt/cut/cutNode.c +0 -1004
data/ext/abc/src/opt/cut/cutOracle.c +0 -424
data/ext/abc/src/opt/cut/cutPre22.c +0 -994
data/ext/abc/src/opt/cut/cutSeq.c +0 -232
data/ext/abc/src/opt/cut/cutTruth.c +0 -232
data/ext/abc/src/opt/cut/module.make +0 -9
data/ext/abc/src/opt/dar/dar.h +0 -116
data/ext/abc/src/opt/dar/darBalance.c +0 -761
data/ext/abc/src/opt/dar/darCore.c +0 -348
data/ext/abc/src/opt/dar/darCut.c +0 -837
data/ext/abc/src/opt/dar/darData.c +0 -11294
data/ext/abc/src/opt/dar/darInt.h +0 -169
data/ext/abc/src/opt/dar/darLib.c +0 -1341
data/ext/abc/src/opt/dar/darMan.c +0 -174
data/ext/abc/src/opt/dar/darPrec.c +0 -394
data/ext/abc/src/opt/dar/darRefact.c +0 -639
data/ext/abc/src/opt/dar/darResub.c +0 -53
data/ext/abc/src/opt/dar/darScript.c +0 -911
data/ext/abc/src/opt/dar/dar_.c +0 -53
data/ext/abc/src/opt/dar/module.make +0 -9
data/ext/abc/src/opt/dau/dau.c +0 -53
data/ext/abc/src/opt/dau/dau.h +0 -125
data/ext/abc/src/opt/dau/dauArray.c +0 -257
data/ext/abc/src/opt/dau/dauCanon.c +0 -1202
data/ext/abc/src/opt/dau/dauCore.c +0 -112
data/ext/abc/src/opt/dau/dauDivs.c +0 -111
data/ext/abc/src/opt/dau/dauDsd.c +0 -2098
data/ext/abc/src/opt/dau/dauDsd2.c +0 -660
data/ext/abc/src/opt/dau/dauEnum.c +0 -253
data/ext/abc/src/opt/dau/dauGia.c +0 -573
data/ext/abc/src/opt/dau/dauInt.h +0 -70
data/ext/abc/src/opt/dau/dauMerge.c +0 -824
data/ext/abc/src/opt/dau/dauNonDsd.c +0 -903
data/ext/abc/src/opt/dau/dauTree.c +0 -2022
data/ext/abc/src/opt/dau/module.make +0 -9
data/ext/abc/src/opt/dsc/dsc.c +0 -525
data/ext/abc/src/opt/dsc/dsc.h +0 -91
data/ext/abc/src/opt/dsc/module.make +0 -1
data/ext/abc/src/opt/fret/fretFlow.c +0 -700
data/ext/abc/src/opt/fret/fretInit.c +0 -1343
data/ext/abc/src/opt/fret/fretMain.c +0 -1383
data/ext/abc/src/opt/fret/fretTime.c +0 -766
data/ext/abc/src/opt/fret/fretime.h +0 -212
data/ext/abc/src/opt/fret/module.make +0 -5
data/ext/abc/src/opt/fsim/fsim.h +0 -101
data/ext/abc/src/opt/fsim/fsimCore.c +0 -88
data/ext/abc/src/opt/fsim/fsimFront.c +0 -369
data/ext/abc/src/opt/fsim/fsimInt.h +0 -138
data/ext/abc/src/opt/fsim/fsimMan.c +0 -212
data/ext/abc/src/opt/fsim/fsimSim.c +0 -569
data/ext/abc/src/opt/fsim/fsimSwitch.c +0 -40
data/ext/abc/src/opt/fsim/fsimTsim.c +0 -416
data/ext/abc/src/opt/fsim/module.make +0 -6
data/ext/abc/src/opt/fxch/Fxch.c +0 -266
data/ext/abc/src/opt/fxch/Fxch.h +0 -229
data/ext/abc/src/opt/fxch/FxchDiv.c +0 -485
data/ext/abc/src/opt/fxch/FxchMan.c +0 -785
data/ext/abc/src/opt/fxch/FxchSCHashTable.c +0 -382
data/ext/abc/src/opt/fxch/module.make +0 -4
data/ext/abc/src/opt/fxu/fxu.c +0 -260
data/ext/abc/src/opt/fxu/fxu.h +0 -97
data/ext/abc/src/opt/fxu/fxuCreate.c +0 -447
data/ext/abc/src/opt/fxu/fxuHeapD.c +0 -450
data/ext/abc/src/opt/fxu/fxuHeapS.c +0 -449
data/ext/abc/src/opt/fxu/fxuInt.h +0 -545
data/ext/abc/src/opt/fxu/fxuList.c +0 -527
data/ext/abc/src/opt/fxu/fxuMatrix.c +0 -377
data/ext/abc/src/opt/fxu/fxuPair.c +0 -560
data/ext/abc/src/opt/fxu/fxuPrint.c +0 -202
data/ext/abc/src/opt/fxu/fxuReduce.c +0 -213
data/ext/abc/src/opt/fxu/fxuSelect.c +0 -608
data/ext/abc/src/opt/fxu/fxuSingle.c +0 -289
data/ext/abc/src/opt/fxu/fxuUpdate.c +0 -811
data/ext/abc/src/opt/fxu/module.make +0 -12
data/ext/abc/src/opt/lpk/lpk.h +0 -88
data/ext/abc/src/opt/lpk/lpkAbcDec.c +0 -294
data/ext/abc/src/opt/lpk/lpkAbcDsd.c +0 -617
data/ext/abc/src/opt/lpk/lpkAbcMux.c +0 -240
data/ext/abc/src/opt/lpk/lpkAbcUtil.c +0 -249
data/ext/abc/src/opt/lpk/lpkCore.c +0 -694
data/ext/abc/src/opt/lpk/lpkCut.c +0 -689
data/ext/abc/src/opt/lpk/lpkInt.h +0 -250
data/ext/abc/src/opt/lpk/lpkMan.c +0 -127
data/ext/abc/src/opt/lpk/lpkMap.c +0 -210
data/ext/abc/src/opt/lpk/lpkMulti.c +0 -513
data/ext/abc/src/opt/lpk/lpkMux.c +0 -252
data/ext/abc/src/opt/lpk/lpkSets.c +0 -445
data/ext/abc/src/opt/lpk/lpk_.c +0 -53
data/ext/abc/src/opt/lpk/module.make +0 -11
data/ext/abc/src/opt/mfs/mfs.h +0 -89
data/ext/abc/src/opt/mfs/mfsCore.c +0 -596
data/ext/abc/src/opt/mfs/mfsCore_.c +0 -394
data/ext/abc/src/opt/mfs/mfsDiv.c +0 -309
data/ext/abc/src/opt/mfs/mfsGia.c +0 -301
data/ext/abc/src/opt/mfs/mfsInt.h +0 -192
data/ext/abc/src/opt/mfs/mfsInter.c +0 -398
data/ext/abc/src/opt/mfs/mfsMan.c +0 -202
data/ext/abc/src/opt/mfs/mfsResub.c +0 -622
data/ext/abc/src/opt/mfs/mfsResub_.c +0 -567
data/ext/abc/src/opt/mfs/mfsSat.c +0 -182
data/ext/abc/src/opt/mfs/mfsStrash.c +0 -406
data/ext/abc/src/opt/mfs/mfsWin.c +0 -117
data/ext/abc/src/opt/mfs/mfs_.c +0 -52
data/ext/abc/src/opt/mfs/module.make +0 -8
data/ext/abc/src/opt/nwk/module.make +0 -14
data/ext/abc/src/opt/nwk/ntlnwk.h +0 -113
data/ext/abc/src/opt/nwk/nwk.h +0 -307
data/ext/abc/src/opt/nwk/nwkAig.c +0 -299
data/ext/abc/src/opt/nwk/nwkBidec.c +0 -177
data/ext/abc/src/opt/nwk/nwkCheck.c +0 -76
data/ext/abc/src/opt/nwk/nwkDfs.c +0 -664
data/ext/abc/src/opt/nwk/nwkFanio.c +0 -320
data/ext/abc/src/opt/nwk/nwkFlow.c +0 -606
data/ext/abc/src/opt/nwk/nwkFlow_depth.c +0 -631
data/ext/abc/src/opt/nwk/nwkMan.c +0 -278
data/ext/abc/src/opt/nwk/nwkMap.c +0 -396
data/ext/abc/src/opt/nwk/nwkMerge.c +0 -1046
data/ext/abc/src/opt/nwk/nwkMerge.h +0 -153
data/ext/abc/src/opt/nwk/nwkObj.c +0 -204
data/ext/abc/src/opt/nwk/nwkSpeedup.c +0 -382
data/ext/abc/src/opt/nwk/nwkStrash.c +0 -149
data/ext/abc/src/opt/nwk/nwkTiming.c +0 -894
data/ext/abc/src/opt/nwk/nwkUtil.c +0 -644
data/ext/abc/src/opt/nwk/nwk_.c +0 -52
data/ext/abc/src/opt/res/module.make +0 -7
data/ext/abc/src/opt/res/res.h +0 -79
data/ext/abc/src/opt/res/resCore.c +0 -427
data/ext/abc/src/opt/res/resDivs.c +0 -290
data/ext/abc/src/opt/res/resFilter.c +0 -439
data/ext/abc/src/opt/res/resInt.h +0 -141
data/ext/abc/src/opt/res/resSat.c +0 -414
data/ext/abc/src/opt/res/resSim.c +0 -795
data/ext/abc/src/opt/res/resSim_old.c +0 -526
data/ext/abc/src/opt/res/resStrash.c +0 -122
data/ext/abc/src/opt/res/resWin.c +0 -490
data/ext/abc/src/opt/res/res_.c +0 -55
data/ext/abc/src/opt/ret/module.make +0 -8
data/ext/abc/src/opt/ret/retArea.c +0 -554
data/ext/abc/src/opt/ret/retCore.c +0 -138
data/ext/abc/src/opt/ret/retDelay.c +0 -315
data/ext/abc/src/opt/ret/retFlow.c +0 -789
data/ext/abc/src/opt/ret/retIncrem.c +0 -480
data/ext/abc/src/opt/ret/retInit.c +0 -355
data/ext/abc/src/opt/ret/retInt.h +0 -88
data/ext/abc/src/opt/ret/retLvalue.c +0 -402
data/ext/abc/src/opt/ret/ret_.c +0 -53
data/ext/abc/src/opt/rwr/module.make +0 -7
data/ext/abc/src/opt/rwr/rwr.h +0 -173
data/ext/abc/src/opt/rwr/rwrDec.c +0 -155
data/ext/abc/src/opt/rwr/rwrEva.c +0 -599
data/ext/abc/src/opt/rwr/rwrExp.c +0 -336
data/ext/abc/src/opt/rwr/rwrLib.c +0 -367
data/ext/abc/src/opt/rwr/rwrMan.c +0 -323
data/ext/abc/src/opt/rwr/rwrPrint.c +0 -271
data/ext/abc/src/opt/rwr/rwrTemp.c +0 -126
data/ext/abc/src/opt/rwr/rwrUtil.c +0 -661
data/ext/abc/src/opt/rwt/module.make +0 -3
data/ext/abc/src/opt/rwt/rwt.h +0 -165
data/ext/abc/src/opt/rwt/rwtDec.c +0 -155
data/ext/abc/src/opt/rwt/rwtMan.c +0 -363
data/ext/abc/src/opt/rwt/rwtUtil.c +0 -663
data/ext/abc/src/opt/sbd/module.make +0 -9
data/ext/abc/src/opt/sbd/sbd.c +0 -122
data/ext/abc/src/opt/sbd/sbd.h +0 -82
data/ext/abc/src/opt/sbd/sbdCnf.c +0 -147
data/ext/abc/src/opt/sbd/sbdCore.c +0 -2229
data/ext/abc/src/opt/sbd/sbdCut.c +0 -872
data/ext/abc/src/opt/sbd/sbdCut2.c +0 -431
data/ext/abc/src/opt/sbd/sbdInt.h +0 -125
data/ext/abc/src/opt/sbd/sbdLut.c +0 -311
data/ext/abc/src/opt/sbd/sbdPath.c +0 -197
data/ext/abc/src/opt/sbd/sbdSat.c +0 -793
data/ext/abc/src/opt/sbd/sbdSim.c +0 -310
data/ext/abc/src/opt/sbd/sbdWin.c +0 -464
data/ext/abc/src/opt/sfm/module.make +0 -10
data/ext/abc/src/opt/sfm/sfm.h +0 -107
data/ext/abc/src/opt/sfm/sfmArea.c +0 -380
data/ext/abc/src/opt/sfm/sfmCnf.c +0 -179
data/ext/abc/src/opt/sfm/sfmCore.c +0 -306
data/ext/abc/src/opt/sfm/sfmDec.c +0 -2168
data/ext/abc/src/opt/sfm/sfmInt.h +0 -254
data/ext/abc/src/opt/sfm/sfmLib.c +0 -766
data/ext/abc/src/opt/sfm/sfmMit.c +0 -73
data/ext/abc/src/opt/sfm/sfmNtk.c +0 -381
data/ext/abc/src/opt/sfm/sfmSat.c +0 -273
data/ext/abc/src/opt/sfm/sfmTim.c +0 -458
data/ext/abc/src/opt/sfm/sfmWin.c +0 -481
data/ext/abc/src/opt/sim/module.make +0 -9
data/ext/abc/src/opt/sim/sim.h +0 -237
data/ext/abc/src/opt/sim/simMan.c +0 -293
data/ext/abc/src/opt/sim/simSat.c +0 -53
data/ext/abc/src/opt/sim/simSeq.c +0 -176
data/ext/abc/src/opt/sim/simSupp.c +0 -603
data/ext/abc/src/opt/sim/simSwitch.c +0 -112
data/ext/abc/src/opt/sim/simSym.c +0 -148
data/ext/abc/src/opt/sim/simSymSat.c +0 -205
data/ext/abc/src/opt/sim/simSymSim.c +0 -178
data/ext/abc/src/opt/sim/simSymStr.c +0 -493
data/ext/abc/src/opt/sim/simUtils.c +0 -718
data/ext/abc/src/phys/place/Makefile +0 -30
data/ext/abc/src/phys/place/README +0 -50
data/ext/abc/src/phys/place/hpwl +0 -57
data/ext/abc/src/phys/place/libhmetis.h +0 -39
data/ext/abc/src/phys/place/module.make +0 -10
data/ext/abc/src/phys/place/place_base.c +0 -350
data/ext/abc/src/phys/place/place_base.h +0 -145
data/ext/abc/src/phys/place/place_bin.c +0 -282
data/ext/abc/src/phys/place/place_genqp.c +0 -314
data/ext/abc/src/phys/place/place_gordian.c +0 -165
data/ext/abc/src/phys/place/place_gordian.h +0 -86
data/ext/abc/src/phys/place/place_inc.c +0 -111
data/ext/abc/src/phys/place/place_io.c +0 -99
data/ext/abc/src/phys/place/place_legalize.c +0 -28
data/ext/abc/src/phys/place/place_pads.c +0 -146
data/ext/abc/src/phys/place/place_partition.c +0 -1140
data/ext/abc/src/phys/place/place_qpsolver.c +0 -1275
data/ext/abc/src/phys/place/place_qpsolver.h +0 -139
data/ext/abc/src/phys/place/place_test.c +0 -365
data/ext/abc/src/proof/abs/abs.c +0 -52
data/ext/abc/src/proof/abs/abs.h +0 -177
data/ext/abc/src/proof/abs/absDup.c +0 -445
data/ext/abc/src/proof/abs/absGla.c +0 -1901
data/ext/abc/src/proof/abs/absGlaOld.c +0 -1956
data/ext/abc/src/proof/abs/absIter.c +0 -148
data/ext/abc/src/proof/abs/absOldCex.c +0 -873
data/ext/abc/src/proof/abs/absOldRef.c +0 -474
data/ext/abc/src/proof/abs/absOldSat.c +0 -986
data/ext/abc/src/proof/abs/absOldSim.c +0 -477
data/ext/abc/src/proof/abs/absOut.c +0 -458
data/ext/abc/src/proof/abs/absPth.c +0 -205
data/ext/abc/src/proof/abs/absRef.c +0 -751
data/ext/abc/src/proof/abs/absRef.h +0 -129
data/ext/abc/src/proof/abs/absRefJ.c +0 -916
data/ext/abc/src/proof/abs/absRefJ.h +0 -67
data/ext/abc/src/proof/abs/absRefSelect.c +0 -309
data/ext/abc/src/proof/abs/absRpm.c +0 -874
data/ext/abc/src/proof/abs/absRpmOld.c +0 -201
data/ext/abc/src/proof/abs/absUtil.c +0 -257
data/ext/abc/src/proof/abs/absVta.c +0 -1764
data/ext/abc/src/proof/abs/module.make +0 -16
data/ext/abc/src/proof/acec/acec.c +0 -52
data/ext/abc/src/proof/acec/acec.h +0 -98
data/ext/abc/src/proof/acec/acec2Mult.c +0 -1211
data/ext/abc/src/proof/acec/acecBo.c +0 -216
data/ext/abc/src/proof/acec/acecCl.c +0 -445
data/ext/abc/src/proof/acec/acecCo.c +0 -429
data/ext/abc/src/proof/acec/acecCore.c +0 -553
data/ext/abc/src/proof/acec/acecCover.c +0 -263
data/ext/abc/src/proof/acec/acecFadds.c +0 -1247
data/ext/abc/src/proof/acec/acecInt.h +0 -105
data/ext/abc/src/proof/acec/acecMult.c +0 -623
data/ext/abc/src/proof/acec/acecNorm.c +0 -226
data/ext/abc/src/proof/acec/acecOrder.c +0 -254
data/ext/abc/src/proof/acec/acecPa.c +0 -277
data/ext/abc/src/proof/acec/acecPo.c +0 -655
data/ext/abc/src/proof/acec/acecPolyn.c +0 -445
data/ext/abc/src/proof/acec/acecPool.c +0 -428
data/ext/abc/src/proof/acec/acecRe.c +0 -602
data/ext/abc/src/proof/acec/acecSt.c +0 -422
data/ext/abc/src/proof/acec/acecStruct.c +0 -271
data/ext/abc/src/proof/acec/acecTree.c +0 -783
data/ext/abc/src/proof/acec/acecUtil.c +0 -122
data/ext/abc/src/proof/acec/acecXor.c +0 -434
data/ext/abc/src/proof/acec/module.make +0 -19
data/ext/abc/src/proof/cec/cec.c +0 -53
data/ext/abc/src/proof/cec/cec.h +0 -240
data/ext/abc/src/proof/cec/cecCec.c +0 -580
data/ext/abc/src/proof/cec/cecChoice.c +0 -410
data/ext/abc/src/proof/cec/cecClass.c +0 -931
data/ext/abc/src/proof/cec/cecCore.c +0 -554
data/ext/abc/src/proof/cec/cecCorr.c +0 -1229
data/ext/abc/src/proof/cec/cecInt.h +0 -227
data/ext/abc/src/proof/cec/cecIso.c +0 -375
data/ext/abc/src/proof/cec/cecMan.c +0 -297
data/ext/abc/src/proof/cec/cecPat.c +0 -578
data/ext/abc/src/proof/cec/cecSat.c +0 -1040
data/ext/abc/src/proof/cec/cecSatG.c +0 -1048
data/ext/abc/src/proof/cec/cecSeq.c +0 -449
data/ext/abc/src/proof/cec/cecSim.c +0 -53
data/ext/abc/src/proof/cec/cecSimBack.c +0 -194
data/ext/abc/src/proof/cec/cecSolve.c +0 -1107
data/ext/abc/src/proof/cec/cecSplit.c +0 -849
data/ext/abc/src/proof/cec/cecSweep.c +0 -301
data/ext/abc/src/proof/cec/cecSynth.c +0 -433
data/ext/abc/src/proof/cec/module.make +0 -15
data/ext/abc/src/proof/dch/dch.h +0 -91
data/ext/abc/src/proof/dch/dchAig.c +0 -119
data/ext/abc/src/proof/dch/dchChoice.c +0 -552
data/ext/abc/src/proof/dch/dchClass.c +0 -611
data/ext/abc/src/proof/dch/dchCnf.c +0 -334
data/ext/abc/src/proof/dch/dchCore.c +0 -161
data/ext/abc/src/proof/dch/dchInt.h +0 -170
data/ext/abc/src/proof/dch/dchMan.c +0 -191
data/ext/abc/src/proof/dch/dchSat.c +0 -167
data/ext/abc/src/proof/dch/dchSim.c +0 -297
data/ext/abc/src/proof/dch/dchSimSat.c +0 -260
data/ext/abc/src/proof/dch/dchSweep.c +0 -146
data/ext/abc/src/proof/dch/module.make +0 -10
data/ext/abc/src/proof/fra/fra.h +0 -389
data/ext/abc/src/proof/fra/fraBmc.c +0 -453
data/ext/abc/src/proof/fra/fraCec.c +0 -574
data/ext/abc/src/proof/fra/fraClass.c +0 -862
data/ext/abc/src/proof/fra/fraClau.c +0 -745
data/ext/abc/src/proof/fra/fraClaus.c +0 -1877
data/ext/abc/src/proof/fra/fraCnf.c +0 -289
data/ext/abc/src/proof/fra/fraCore.c +0 -490
data/ext/abc/src/proof/fra/fraHot.c +0 -476
data/ext/abc/src/proof/fra/fraImp.c +0 -732
data/ext/abc/src/proof/fra/fraInd.c +0 -712
data/ext/abc/src/proof/fra/fraIndVer.c +0 -166
data/ext/abc/src/proof/fra/fraLcr.c +0 -708
data/ext/abc/src/proof/fra/fraMan.c +0 -314
data/ext/abc/src/proof/fra/fraPart.c +0 -269
data/ext/abc/src/proof/fra/fraSat.c +0 -571
data/ext/abc/src/proof/fra/fraSec.c +0 -693
data/ext/abc/src/proof/fra/fraSim.c +0 -1173
data/ext/abc/src/proof/fra/fra_.c +0 -53
data/ext/abc/src/proof/fra/module.make +0 -17
data/ext/abc/src/proof/fraig/fraig.h +0 -257
data/ext/abc/src/proof/fraig/fraigApi.c +0 -299
data/ext/abc/src/proof/fraig/fraigCanon.c +0 -223
data/ext/abc/src/proof/fraig/fraigChoice.c +0 -246
data/ext/abc/src/proof/fraig/fraigFanout.c +0 -180
data/ext/abc/src/proof/fraig/fraigFeed.c +0 -914
data/ext/abc/src/proof/fraig/fraigInt.h +0 -436
data/ext/abc/src/proof/fraig/fraigMan.c +0 -546
data/ext/abc/src/proof/fraig/fraigMem.c +0 -251
data/ext/abc/src/proof/fraig/fraigNode.c +0 -319
data/ext/abc/src/proof/fraig/fraigPrime.c +0 -113
data/ext/abc/src/proof/fraig/fraigSat.c +0 -1463
data/ext/abc/src/proof/fraig/fraigTable.c +0 -664
data/ext/abc/src/proof/fraig/fraigUtil.c +0 -1039
data/ext/abc/src/proof/fraig/fraigVec.c +0 -550
data/ext/abc/src/proof/fraig/module.make +0 -12
data/ext/abc/src/proof/int/int.h +0 -96
data/ext/abc/src/proof/int/intCheck.c +0 -305
data/ext/abc/src/proof/int/intContain.c +0 -341
data/ext/abc/src/proof/int/intCore.c +0 -412
data/ext/abc/src/proof/int/intCtrex.c +0 -168
data/ext/abc/src/proof/int/intDup.c +0 -184
data/ext/abc/src/proof/int/intFrames.c +0 -124
data/ext/abc/src/proof/int/intInt.h +0 -143
data/ext/abc/src/proof/int/intInter.c +0 -145
data/ext/abc/src/proof/int/intM114.c +0 -323
data/ext/abc/src/proof/int/intM114p.c +0 -443
data/ext/abc/src/proof/int/intMan.c +0 -165
data/ext/abc/src/proof/int/intUtil.c +0 -108
data/ext/abc/src/proof/int/module.make +0 -10
data/ext/abc/src/proof/int2/int2.h +0 -90
data/ext/abc/src/proof/int2/int2Bmc.c +0 -355
data/ext/abc/src/proof/int2/int2Core.c +0 -335
data/ext/abc/src/proof/int2/int2Int.h +0 -164
data/ext/abc/src/proof/int2/int2Refine.c +0 -154
data/ext/abc/src/proof/int2/int2Util.c +0 -152
data/ext/abc/src/proof/int2/module.make +0 -4
data/ext/abc/src/proof/live/arenaViolation.c +0 -549
data/ext/abc/src/proof/live/combination.c +0 -463
data/ext/abc/src/proof/live/disjunctiveMonotone.c +0 -757
data/ext/abc/src/proof/live/kLiveConstraints.c +0 -177
data/ext/abc/src/proof/live/kliveness.c +0 -816
data/ext/abc/src/proof/live/liveness.c +0 -2575
data/ext/abc/src/proof/live/liveness_sim.c +0 -849
data/ext/abc/src/proof/live/ltl_parser.c +0 -839
data/ext/abc/src/proof/live/module.make +0 -9
data/ext/abc/src/proof/live/monotone.c +0 -507
data/ext/abc/src/proof/pdr/module.make +0 -10
data/ext/abc/src/proof/pdr/pdr.c +0 -53
data/ext/abc/src/proof/pdr/pdr.h +0 -109
data/ext/abc/src/proof/pdr/pdrClass.c +0 -223
data/ext/abc/src/proof/pdr/pdrCnf.c +0 -455
data/ext/abc/src/proof/pdr/pdrCore.c +0 -1451
data/ext/abc/src/proof/pdr/pdrIncr.c +0 -1046
data/ext/abc/src/proof/pdr/pdrInt.h +0 -275
data/ext/abc/src/proof/pdr/pdrInv.c +0 -985
data/ext/abc/src/proof/pdr/pdrMan.c +0 -549
data/ext/abc/src/proof/pdr/pdrSat.c +0 -395
data/ext/abc/src/proof/pdr/pdrTsim.c +0 -502
data/ext/abc/src/proof/pdr/pdrTsim2.c +0 -550
data/ext/abc/src/proof/pdr/pdrTsim3.c +0 -361
data/ext/abc/src/proof/pdr/pdrUtil.c +0 -800
data/ext/abc/src/proof/ssc/module.make +0 -5
data/ext/abc/src/proof/ssc/ssc.h +0 -78
data/ext/abc/src/proof/ssc/sscClass.c +0 -326
data/ext/abc/src/proof/ssc/sscCore.c +0 -469
data/ext/abc/src/proof/ssc/sscInt.h +0 -135
data/ext/abc/src/proof/ssc/sscSat.c +0 -430
data/ext/abc/src/proof/ssc/sscSim.c +0 -364
data/ext/abc/src/proof/ssc/sscUtil.c +0 -173
data/ext/abc/src/proof/ssw/module.make +0 -20
data/ext/abc/src/proof/ssw/ssw.h +0 -170
data/ext/abc/src/proof/ssw/sswAig.c +0 -258
data/ext/abc/src/proof/ssw/sswBmc.c +0 -224
data/ext/abc/src/proof/ssw/sswClass.c +0 -1170
data/ext/abc/src/proof/ssw/sswCnf.c +0 -427
data/ext/abc/src/proof/ssw/sswConstr.c +0 -718
data/ext/abc/src/proof/ssw/sswCore.c +0 -539
data/ext/abc/src/proof/ssw/sswDyn.c +0 -491
data/ext/abc/src/proof/ssw/sswFilter.c +0 -493
data/ext/abc/src/proof/ssw/sswInt.h +0 -302
data/ext/abc/src/proof/ssw/sswIslands.c +0 -598
data/ext/abc/src/proof/ssw/sswLcorr.c +0 -337
data/ext/abc/src/proof/ssw/sswMan.c +0 -217
data/ext/abc/src/proof/ssw/sswPairs.c +0 -480
data/ext/abc/src/proof/ssw/sswPart.c +0 -140
data/ext/abc/src/proof/ssw/sswRarity.c +0 -1385
data/ext/abc/src/proof/ssw/sswRarity2.c +0 -518
data/ext/abc/src/proof/ssw/sswSat.c +0 -307
data/ext/abc/src/proof/ssw/sswSemi.c +0 -323
data/ext/abc/src/proof/ssw/sswSim.c +0 -1406
data/ext/abc/src/proof/ssw/sswSimSat.c +0 -124
data/ext/abc/src/proof/ssw/sswSweep.c +0 -440
data/ext/abc/src/proof/ssw/sswUnique.c +0 -196
data/ext/abc/src/sat/bmc/bmc.c +0 -52
data/ext/abc/src/sat/bmc/bmc.h +0 -205
data/ext/abc/src/sat/bmc/bmcBCore.c +0 -273
data/ext/abc/src/sat/bmc/bmcBmc.c +0 -377
data/ext/abc/src/sat/bmc/bmcBmc2.c +0 -944
data/ext/abc/src/sat/bmc/bmcBmc3.c +0 -1893
data/ext/abc/src/sat/bmc/bmcBmcAnd.c +0 -1100
data/ext/abc/src/sat/bmc/bmcBmcG.c +0 -455
data/ext/abc/src/sat/bmc/bmcBmcS.c +0 -940
data/ext/abc/src/sat/bmc/bmcBmci.c +0 -344
data/ext/abc/src/sat/bmc/bmcCexCare.c +0 -476
data/ext/abc/src/sat/bmc/bmcCexCut.c +0 -537
data/ext/abc/src/sat/bmc/bmcCexDepth.c +0 -373
data/ext/abc/src/sat/bmc/bmcCexMin1.c +0 -578
data/ext/abc/src/sat/bmc/bmcCexMin2.c +0 -363
data/ext/abc/src/sat/bmc/bmcCexTools.c +0 -852
data/ext/abc/src/sat/bmc/bmcChain.c +0 -396
data/ext/abc/src/sat/bmc/bmcClp.c +0 -1548
data/ext/abc/src/sat/bmc/bmcEco.c +0 -312
data/ext/abc/src/sat/bmc/bmcEnum.c +0 -223
data/ext/abc/src/sat/bmc/bmcExpand.c +0 -172
data/ext/abc/src/sat/bmc/bmcFault.c +0 -1710
data/ext/abc/src/sat/bmc/bmcFx.c +0 -725
data/ext/abc/src/sat/bmc/bmcGen.c +0 -193
data/ext/abc/src/sat/bmc/bmcICheck.c +0 -540
data/ext/abc/src/sat/bmc/bmcInse.c +0 -345
data/ext/abc/src/sat/bmc/bmcLoad.c +0 -212
data/ext/abc/src/sat/bmc/bmcMaj.c +0 -745
data/ext/abc/src/sat/bmc/bmcMaj2.c +0 -852
data/ext/abc/src/sat/bmc/bmcMaxi.c +0 -282
data/ext/abc/src/sat/bmc/bmcMesh.c +0 -433
data/ext/abc/src/sat/bmc/bmcMesh2.c +0 -449
data/ext/abc/src/sat/bmc/bmcMulti.c +0 -296
data/ext/abc/src/sat/bmc/bmcUnroll.c +0 -505
data/ext/abc/src/sat/bmc/module.make +0 -31
data/ext/abc/src/sat/bsat/license +0 -21
data/ext/abc/src/sat/bsat/module.make +0 -14
data/ext/abc/src/sat/bsat/satChecker.c +0 -193
data/ext/abc/src/sat/bsat/satClause.h +0 -476
data/ext/abc/src/sat/bsat/satInter.c +0 -1077
data/ext/abc/src/sat/bsat/satInterA.c +0 -1090
data/ext/abc/src/sat/bsat/satInterB.c +0 -1115
data/ext/abc/src/sat/bsat/satInterP.c +0 -1096
data/ext/abc/src/sat/bsat/satMem.c +0 -583
data/ext/abc/src/sat/bsat/satMem.h +0 -85
data/ext/abc/src/sat/bsat/satProof.c +0 -934
data/ext/abc/src/sat/bsat/satProof2.h +0 -327
data/ext/abc/src/sat/bsat/satSolver.c +0 -2417
data/ext/abc/src/sat/bsat/satSolver.h +0 -639
data/ext/abc/src/sat/bsat/satSolver2.c +0 -1998
data/ext/abc/src/sat/bsat/satSolver2.h +0 -377
data/ext/abc/src/sat/bsat/satSolver2i.c +0 -242
data/ext/abc/src/sat/bsat/satSolver3.c +0 -2299
data/ext/abc/src/sat/bsat/satSolver3.h +0 -622
data/ext/abc/src/sat/bsat/satStore.c +0 -469
data/ext/abc/src/sat/bsat/satStore.h +0 -158
data/ext/abc/src/sat/bsat/satTrace.c +0 -112
data/ext/abc/src/sat/bsat/satTruth.c +0 -299
data/ext/abc/src/sat/bsat/satTruth.h +0 -89
data/ext/abc/src/sat/bsat/satUtil.c +0 -358
data/ext/abc/src/sat/bsat/satVec.h +0 -161
data/ext/abc/src/sat/bsat2/AbcApi.cpp +0 -59
data/ext/abc/src/sat/bsat2/Alg.h +0 -84
data/ext/abc/src/sat/bsat2/Alloc.h +0 -131
data/ext/abc/src/sat/bsat2/Dimacs.h +0 -89
data/ext/abc/src/sat/bsat2/Heap.h +0 -149
data/ext/abc/src/sat/bsat2/IntTypes.h +0 -47
data/ext/abc/src/sat/bsat2/LICENSE +0 -21
data/ext/abc/src/sat/bsat2/MainSat.cpp +0 -197
data/ext/abc/src/sat/bsat2/MainSimp.cpp +0 -206
data/ext/abc/src/sat/bsat2/Map.h +0 -193
data/ext/abc/src/sat/bsat2/Options.cpp +0 -93
data/ext/abc/src/sat/bsat2/Options.h +0 -387
data/ext/abc/src/sat/bsat2/ParseUtils.h +0 -122
data/ext/abc/src/sat/bsat2/Queue.h +0 -69
data/ext/abc/src/sat/bsat2/README +0 -24
data/ext/abc/src/sat/bsat2/ReleaseNotes-2.2.0.txt +0 -79
data/ext/abc/src/sat/bsat2/SimpSolver.cpp +0 -720
data/ext/abc/src/sat/bsat2/SimpSolver.h +0 -197
data/ext/abc/src/sat/bsat2/Solver.cpp +0 -924
data/ext/abc/src/sat/bsat2/Solver.h +0 -373
data/ext/abc/src/sat/bsat2/SolverTypes.h +0 -407
data/ext/abc/src/sat/bsat2/Sort.h +0 -98
data/ext/abc/src/sat/bsat2/System.cpp +0 -95
data/ext/abc/src/sat/bsat2/System.h +0 -60
data/ext/abc/src/sat/bsat2/Vec.h +0 -130
data/ext/abc/src/sat/bsat2/XAlloc.h +0 -45
data/ext/abc/src/sat/bsat2/module.make +0 -7
data/ext/abc/src/sat/bsat2/pstdint.h +0 -813
data/ext/abc/src/sat/cnf/cnf.h +0 -202
data/ext/abc/src/sat/cnf/cnfCore.c +0 -290
data/ext/abc/src/sat/cnf/cnfCut.c +0 -376
data/ext/abc/src/sat/cnf/cnfData.c +0 -4789
data/ext/abc/src/sat/cnf/cnfFast.c +0 -697
data/ext/abc/src/sat/cnf/cnfMan.c +0 -726
data/ext/abc/src/sat/cnf/cnfMap.c +0 -362
data/ext/abc/src/sat/cnf/cnfPost.c +0 -238
data/ext/abc/src/sat/cnf/cnfUtil.c +0 -479
data/ext/abc/src/sat/cnf/cnfWrite.c +0 -806
data/ext/abc/src/sat/cnf/cnf_.c +0 -53
data/ext/abc/src/sat/cnf/module.make +0 -9
data/ext/abc/src/sat/csat/csat_apis.c +0 -778
data/ext/abc/src/sat/csat/csat_apis.h +0 -226
data/ext/abc/src/sat/csat/module.make +0 -1
data/ext/abc/src/sat/glucose/AbcGlucose.cpp +0 -1372
data/ext/abc/src/sat/glucose/AbcGlucose.h +0 -110
data/ext/abc/src/sat/glucose/AbcGlucoseCmd.cpp +0 -144
data/ext/abc/src/sat/glucose/Alg.h +0 -84
data/ext/abc/src/sat/glucose/Alloc.h +0 -132
data/ext/abc/src/sat/glucose/BoundedQueue.h +0 -110
data/ext/abc/src/sat/glucose/Constants.h +0 -33
data/ext/abc/src/sat/glucose/Dimacs.h +0 -89
data/ext/abc/src/sat/glucose/Glucose.cpp +0 -1493
data/ext/abc/src/sat/glucose/Heap.h +0 -150
data/ext/abc/src/sat/glucose/IntTypes.h +0 -47
data/ext/abc/src/sat/glucose/Map.h +0 -193
data/ext/abc/src/sat/glucose/Options.cpp +0 -92
data/ext/abc/src/sat/glucose/Options.h +0 -388
data/ext/abc/src/sat/glucose/ParseUtils.h +0 -151
data/ext/abc/src/sat/glucose/Queue.h +0 -69
data/ext/abc/src/sat/glucose/SimpSolver.cpp +0 -774
data/ext/abc/src/sat/glucose/SimpSolver.h +0 -204
data/ext/abc/src/sat/glucose/Solver.h +0 -491
data/ext/abc/src/sat/glucose/SolverTypes.h +0 -434
data/ext/abc/src/sat/glucose/Sort.h +0 -98
data/ext/abc/src/sat/glucose/System.cpp +0 -95
data/ext/abc/src/sat/glucose/System.h +0 -60
data/ext/abc/src/sat/glucose/Vec.h +0 -130
data/ext/abc/src/sat/glucose/XAlloc.h +0 -47
data/ext/abc/src/sat/glucose/module.make +0 -6
data/ext/abc/src/sat/glucose/pstdint.h +0 -919
data/ext/abc/src/sat/glucose/stdint.h +0 -1628
data/ext/abc/src/sat/lsat/solver.h +0 -132
data/ext/abc/src/sat/msat/module.make +0 -13
data/ext/abc/src/sat/msat/msat.h +0 -168
data/ext/abc/src/sat/msat/msatActivity.c +0 -165
data/ext/abc/src/sat/msat/msatClause.c +0 -537
data/ext/abc/src/sat/msat/msatClauseVec.c +0 -237
data/ext/abc/src/sat/msat/msatInt.h +0 -295
data/ext/abc/src/sat/msat/msatMem.c +0 -534
data/ext/abc/src/sat/msat/msatOrderH.c +0 -415
data/ext/abc/src/sat/msat/msatOrderJ.c +0 -477
data/ext/abc/src/sat/msat/msatQueue.c +0 -162
data/ext/abc/src/sat/msat/msatRead.c +0 -274
data/ext/abc/src/sat/msat/msatSolverApi.c +0 -505
data/ext/abc/src/sat/msat/msatSolverCore.c +0 -215
data/ext/abc/src/sat/msat/msatSolverIo.c +0 -182
data/ext/abc/src/sat/msat/msatSolverSearch.c +0 -634
data/ext/abc/src/sat/msat/msatSort.c +0 -178
data/ext/abc/src/sat/msat/msatVec.c +0 -500
data/ext/abc/src/sat/proof/pr.c +0 -1264
data/ext/abc/src/sat/proof/pr.h +0 -69
data/ext/abc/src/sat/proof/stats.txt +0 -66
data/ext/abc/src/sat/psat/m114p.h +0 -47
data/ext/abc/src/sat/psat/m114p_types.h +0 -13
data/ext/abc/src/sat/psat/module.make +0 -1
data/ext/abc/src/sat/satoko/LICENSE +0 -22
data/ext/abc/src/sat/satoko/act_clause.h +0 -43
data/ext/abc/src/sat/satoko/act_var.h +0 -53
data/ext/abc/src/sat/satoko/cdb.h +0 -106
data/ext/abc/src/sat/satoko/clause.h +0 -77
data/ext/abc/src/sat/satoko/cnf_reader.c +0 -157
data/ext/abc/src/sat/satoko/module.make +0 -3
data/ext/abc/src/sat/satoko/satoko.h +0 -147
data/ext/abc/src/sat/satoko/solver.c +0 -771
data/ext/abc/src/sat/satoko/solver.h +0 -260
data/ext/abc/src/sat/satoko/solver_api.c +0 -669
data/ext/abc/src/sat/satoko/types.h +0 -39
data/ext/abc/src/sat/satoko/utils/b_queue.h +0 -81
data/ext/abc/src/sat/satoko/utils/heap.h +0 -178
data/ext/abc/src/sat/satoko/utils/mem.h +0 -23
data/ext/abc/src/sat/satoko/utils/misc.h +0 -35
data/ext/abc/src/sat/satoko/utils/sdbl.h +0 -133
data/ext/abc/src/sat/satoko/utils/sort.h +0 -65
data/ext/abc/src/sat/satoko/utils/vec/vec_char.h +0 -260
data/ext/abc/src/sat/satoko/utils/vec/vec_flt.h +0 -246
data/ext/abc/src/sat/satoko/utils/vec/vec_int.h +0 -240
data/ext/abc/src/sat/satoko/utils/vec/vec_sdbl.h +0 -253
data/ext/abc/src/sat/satoko/utils/vec/vec_uint.h +0 -268
data/ext/abc/src/sat/satoko/watch_list.h +0 -203
data/ext/abc/src/sat/xsat/license +0 -39
data/ext/abc/src/sat/xsat/module.make +0 -3
data/ext/abc/src/sat/xsat/xsat.h +0 -59
data/ext/abc/src/sat/xsat/xsatBQueue.h +0 -190
data/ext/abc/src/sat/xsat/xsatClause.h +0 -109
data/ext/abc/src/sat/xsat/xsatCnfReader.c +0 -236
data/ext/abc/src/sat/xsat/xsatHeap.h +0 -330
data/ext/abc/src/sat/xsat/xsatMemory.h +0 -222
data/ext/abc/src/sat/xsat/xsatSolver.c +0 -1003
data/ext/abc/src/sat/xsat/xsatSolver.h +0 -248
data/ext/abc/src/sat/xsat/xsatSolverAPI.c +0 -346
data/ext/abc/src/sat/xsat/xsatUtils.h +0 -106
data/ext/abc/src/sat/xsat/xsatWatchList.h +0 -269
data/ext/abc/src/starter.c +0 -190
data/ext/abc/src/template.c +0 -111
data/ext/extconf.rb +0 -14
data/ext/ruby_abc_wrapper.h +0 -13

data/ext/abc/src/misc/bzlib/manual.html DELETED Viewed

@@ -1,2540 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>bzip2 and libbzip2, version 1.0.5</title>
-<meta name="generator" content="DocBook XSL Stylesheets V1.69.1">
-<style type="text/css" media="screen">/* Colours:
-#74240f  dark brown      h1, h2, h3, h4
-#336699  medium blue     links
-#339999  turquoise       link hover colour
-#202020  almost black    general text
-#761596  purple          md5sum text
-#626262  dark gray       pre border
-#eeeeee  very light gray pre background
-#f2f2f9  very light blue nav table background
-#3366cc  medium blue     nav table border
-*/
-a, a:link, a:visited, a:active { color: #336699; }
-a:hover { color: #339999; }
-body { font: 80%/126% sans-serif; }
-h1, h2, h3, h4 { color: #74240f; }
-dt { color: #336699; font-weight: bold }
-dd {
- margin-left: 1.5em;
- padding-bottom: 0.8em;
-}
-/* -- ruler -- */
-div.hr_blue {
-  height:  3px;
-  background:#ffffff url("/images/hr_blue.png") repeat-x; }
-div.hr_blue hr { display:none; }
-/* release styles */
-#release p { margin-top: 0.4em; }
-#release .md5sum { color: #761596; }
-/* ------ styles for docs|manuals|howto ------ */
-/* -- lists -- */
-ul  {
- margin:     0px 4px 16px 16px;
- padding:    0px;
- list-style: url("/images/li-blue.png");
-}
-ul li {
- margin-bottom: 10px;
-}
-ul ul	{
- list-style-type:  none;
- list-style-image: none;
- margin-left:      0px;
-}
-/* header / footer nav tables */
-table.nav {
- border:     solid 1px #3366cc;
- background: #f2f2f9;
- background-color: #f2f2f9;
- margin-bottom: 0.5em;
-}
-/* don't have underlined links in chunked nav menus */
-table.nav a { text-decoration: none; }
-table.nav a:hover { text-decoration: underline; }
-table.nav td { font-size: 85%; }
-code, tt, pre { font-size: 120%; }
-code, tt { color: #761596; }
-div.literallayout, pre.programlisting, pre.screen {
- color:      #000000;
- padding:    0.5em;
- background: #eeeeee;
- border:     1px solid #626262;
- background-color: #eeeeee;
- margin: 4px 0px 4px 0px;
-}
-</style>
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="book" lang="en">
-<div class="titlepage">
-<div>
-<div><h1 class="title">
-<a name="userman"></a>bzip2 and libbzip2, version 1.0.5</h1></div>
-<div><h2 class="subtitle">A program and library for data compression</h2></div>
-<div><div class="authorgroup"><div class="author">
-<h3 class="author">
-<span class="firstname">Julian</span> <span class="surname">Seward</span>
-</h3>
-<div class="affiliation"><span class="orgname">http://www.bzip.org<br></span></div>
-</div></div></div>
-<div><p class="releaseinfo">Version 1.0.5 of 10 December 2007</p></div>
-<div><p class="copyright">Copyright � 1996-2007 Julian Seward</p></div>
-<div><div class="legalnotice">
-<a name="id2499833"></a><p>This program, <code class="computeroutput">bzip2</code>, the
-  associated library <code class="computeroutput">libbzip2</code>, and
-  all documentation, are copyright � 1996-2007 Julian Seward.
-  All rights reserved.</p>
-<p>Redistribution and use in source and binary forms, with
-  or without modification, are permitted provided that the
-  following conditions are met:</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p>Redistributions of source code must retain the
-   above copyright notice, this list of conditions and the
-   following disclaimer.</p></li>
-<li style="list-style-type: disc"><p>The origin of this software must not be
-   misrepresented; you must not claim that you wrote the original
-   software.  If you use this software in a product, an
-   acknowledgment in the product documentation would be
-   appreciated but is not required.</p></li>
-<li style="list-style-type: disc"><p>Altered source versions must be plainly marked
-   as such, and must not be misrepresented as being the original
-   software.</p></li>
-<li style="list-style-type: disc"><p>The name of the author may not be used to
-   endorse or promote products derived from this software without
-   specific prior written permission.</p></li>
-</ul></div>
-<p>THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY
-  EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
-  PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
-  AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
-  TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
-  IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
-  THE POSSIBILITY OF SUCH DAMAGE.</p>
-<p>PATENTS: To the best of my knowledge,
- <code class="computeroutput">bzip2</code> and
- <code class="computeroutput">libbzip2</code> do not use any patented
- algorithms.  However, I do not have the resources to carry
- out a patent search.  Therefore I cannot give any guarantee of
- the above statement.
- </p>
-</div></div>
-</div>
-<hr>
-</div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="chapter"><a href="#intro">1. Introduction</a></span></dt>
-<dt><span class="chapter"><a href="#using">2. How to use bzip2</a></span></dt>
-<dd><dl>
-<dt><span class="sect1"><a href="#name">2.1. NAME</a></span></dt>
-<dt><span class="sect1"><a href="#synopsis">2.2. SYNOPSIS</a></span></dt>
-<dt><span class="sect1"><a href="#description">2.3. DESCRIPTION</a></span></dt>
-<dt><span class="sect1"><a href="#options">2.4. OPTIONS</a></span></dt>
-<dt><span class="sect1"><a href="#memory-management">2.5. MEMORY MANAGEMENT</a></span></dt>
-<dt><span class="sect1"><a href="#recovering">2.6. RECOVERING DATA FROM DAMAGED FILES</a></span></dt>
-<dt><span class="sect1"><a href="#performance">2.7. PERFORMANCE NOTES</a></span></dt>
-<dt><span class="sect1"><a href="#caveats">2.8. CAVEATS</a></span></dt>
-<dt><span class="sect1"><a href="#author">2.9. AUTHOR</a></span></dt>
-</dl></dd>
-<dt><span class="chapter"><a href="#libprog">3.
-Programming with <code class="computeroutput">libbzip2</code>
-</a></span></dt>
-<dd><dl>
-<dt><span class="sect1"><a href="#top-level">3.1. Top-level structure</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#ll-summary">3.1.1. Low-level summary</a></span></dt>
-<dt><span class="sect2"><a href="#hl-summary">3.1.2. High-level summary</a></span></dt>
-<dt><span class="sect2"><a href="#util-fns-summary">3.1.3. Utility functions summary</a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#err-handling">3.2. Error handling</a></span></dt>
-<dt><span class="sect1"><a href="#low-level">3.3. Low-level interface</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#bzcompress-init">3.3.1. <code class="computeroutput">BZ2_bzCompressInit</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzCompress">3.3.2. <code class="computeroutput">BZ2_bzCompress</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzCompress-end">3.3.3. <code class="computeroutput">BZ2_bzCompressEnd</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzDecompress-init">3.3.4. <code class="computeroutput">BZ2_bzDecompressInit</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzDecompress">3.3.5. <code class="computeroutput">BZ2_bzDecompress</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzDecompress-end">3.3.6. <code class="computeroutput">BZ2_bzDecompressEnd</code></a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#hl-interface">3.4. High-level interface</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#bzreadopen">3.4.1. <code class="computeroutput">BZ2_bzReadOpen</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzread">3.4.2. <code class="computeroutput">BZ2_bzRead</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzreadgetunused">3.4.3. <code class="computeroutput">BZ2_bzReadGetUnused</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzreadclose">3.4.4. <code class="computeroutput">BZ2_bzReadClose</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzwriteopen">3.4.5. <code class="computeroutput">BZ2_bzWriteOpen</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzwrite">3.4.6. <code class="computeroutput">BZ2_bzWrite</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzwriteclose">3.4.7. <code class="computeroutput">BZ2_bzWriteClose</code></a></span></dt>
-<dt><span class="sect2"><a href="#embed">3.4.8. Handling embedded compressed data streams</a></span></dt>
-<dt><span class="sect2"><a href="#std-rdwr">3.4.9. Standard file-reading/writing code</a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#util-fns">3.5. Utility functions</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#bzbufftobuffcompress">3.5.1. <code class="computeroutput">BZ2_bzBuffToBuffCompress</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzbufftobuffdecompress">3.5.2. <code class="computeroutput">BZ2_bzBuffToBuffDecompress</code></a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#zlib-compat">3.6. <code class="computeroutput">zlib</code> compatibility functions</a></span></dt>
-<dt><span class="sect1"><a href="#stdio-free">3.7. Using the library in a <code class="computeroutput">stdio</code>-free environment</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#stdio-bye">3.7.1. Getting rid of <code class="computeroutput">stdio</code></a></span></dt>
-<dt><span class="sect2"><a href="#critical-error">3.7.2. Critical error handling</a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#win-dll">3.8. Making a Windows DLL</a></span></dt>
-</dl></dd>
-<dt><span class="chapter"><a href="#misc">4. Miscellanea</a></span></dt>
-<dd><dl>
-<dt><span class="sect1"><a href="#limits">4.1. Limitations of the compressed file format</a></span></dt>
-<dt><span class="sect1"><a href="#port-issues">4.2. Portability issues</a></span></dt>
-<dt><span class="sect1"><a href="#bugs">4.3. Reporting bugs</a></span></dt>
-<dt><span class="sect1"><a href="#package">4.4. Did you get the right package?</a></span></dt>
-<dt><span class="sect1"><a href="#reading">4.5. Further Reading</a></span></dt>
-</dl></dd>
-</dl>
-</div>
-<div class="chapter" lang="en">
-<div class="titlepage"><div><div><h2 class="title">
-<a name="intro"></a>1.�Introduction</h2></div></div></div>
-<p><code class="computeroutput">bzip2</code> compresses files
-using the Burrows-Wheeler block-sorting text compression
-algorithm, and Huffman coding.  Compression is generally
-considerably better than that achieved by more conventional
-LZ77/LZ78-based compressors, and approaches the performance of
-the PPM family of statistical compressors.</p>
-<p><code class="computeroutput">bzip2</code> is built on top of
-<code class="computeroutput">libbzip2</code>, a flexible library for
-handling compressed data in the
-<code class="computeroutput">bzip2</code> format.  This manual
-describes both how to use the program and how to work with the
-library interface.  Most of the manual is devoted to this
-library, not the program, which is good news if your interest is
-only in the program.</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p><a href="#using">How to use bzip2</a> describes how to use
- <code class="computeroutput">bzip2</code>; this is the only part
- you need to read if you just want to know how to operate the
- program.</p></li>
-<li style="list-style-type: disc"><p><a href="#libprog">Programming with libbzip2</a> describes the
- programming interfaces in detail, and</p></li>
-<li style="list-style-type: disc"><p><a href="#misc">Miscellanea</a> records some
- miscellaneous notes which I thought ought to be recorded
- somewhere.</p></li>
-</ul></div>
-</div>
-<div class="chapter" lang="en">
-<div class="titlepage"><div><div><h2 class="title">
-<a name="using"></a>2.�How to use bzip2</h2></div></div></div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="sect1"><a href="#name">2.1. NAME</a></span></dt>
-<dt><span class="sect1"><a href="#synopsis">2.2. SYNOPSIS</a></span></dt>
-<dt><span class="sect1"><a href="#description">2.3. DESCRIPTION</a></span></dt>
-<dt><span class="sect1"><a href="#options">2.4. OPTIONS</a></span></dt>
-<dt><span class="sect1"><a href="#memory-management">2.5. MEMORY MANAGEMENT</a></span></dt>
-<dt><span class="sect1"><a href="#recovering">2.6. RECOVERING DATA FROM DAMAGED FILES</a></span></dt>
-<dt><span class="sect1"><a href="#performance">2.7. PERFORMANCE NOTES</a></span></dt>
-<dt><span class="sect1"><a href="#caveats">2.8. CAVEATS</a></span></dt>
-<dt><span class="sect1"><a href="#author">2.9. AUTHOR</a></span></dt>
-</dl>
-</div>
-<p>This chapter contains a copy of the
-<code class="computeroutput">bzip2</code> man page, and nothing
-else.</p>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="name"></a>2.1.�NAME</h2></div></div></div>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p><code class="computeroutput">bzip2</code>,
-  <code class="computeroutput">bunzip2</code> - a block-sorting file
-  compressor, v1.0.4</p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">bzcat</code> -
-   decompresses files to stdout</p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">bzip2recover</code> -
-   recovers data from damaged bzip2 files</p></li>
-</ul></div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="synopsis"></a>2.2.�SYNOPSIS</h2></div></div></div>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p><code class="computeroutput">bzip2</code> [
-  -cdfkqstvzVL123456789 ] [ filenames ...  ]</p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">bunzip2</code> [
-  -fkvsVL ] [ filenames ...  ]</p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">bzcat</code> [ -s ] [
-  filenames ...  ]</p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">bzip2recover</code>
-  filename</p></li>
-</ul></div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="description"></a>2.3.�DESCRIPTION</h2></div></div></div>
-<p><code class="computeroutput">bzip2</code> compresses files
-using the Burrows-Wheeler block sorting text compression
-algorithm, and Huffman coding.  Compression is generally
-considerably better than that achieved by more conventional
-LZ77/LZ78-based compressors, and approaches the performance of
-the PPM family of statistical compressors.</p>
-<p>The command-line options are deliberately very similar to
-those of GNU <code class="computeroutput">gzip</code>, but they are
-not identical.</p>
-<p><code class="computeroutput">bzip2</code> expects a list of
-file names to accompany the command-line flags.  Each file is
-replaced by a compressed version of itself, with the name
-<code class="computeroutput">original_name.bz2</code>.  Each
-compressed file has the same modification date, permissions, and,
-when possible, ownership as the corresponding original, so that
-these properties can be correctly restored at decompression time.
-File name handling is naive in the sense that there is no
-mechanism for preserving original file names, permissions,
-ownerships or dates in filesystems which lack these concepts, or
-have serious file name length restrictions, such as
-MS-DOS.</p>
-<p><code class="computeroutput">bzip2</code> and
-<code class="computeroutput">bunzip2</code> will by default not
-overwrite existing files.  If you want this to happen, specify
-the <code class="computeroutput">-f</code> flag.</p>
-<p>If no file names are specified,
-<code class="computeroutput">bzip2</code> compresses from standard
-input to standard output.  In this case,
-<code class="computeroutput">bzip2</code> will decline to write
-compressed output to a terminal, as this would be entirely
-incomprehensible and therefore pointless.</p>
-<p><code class="computeroutput">bunzip2</code> (or
-<code class="computeroutput">bzip2 -d</code>) decompresses all
-specified files.  Files which were not created by
-<code class="computeroutput">bzip2</code> will be detected and
-ignored, and a warning issued.
-<code class="computeroutput">bzip2</code> attempts to guess the
-filename for the decompressed file from that of the compressed
-file as follows:</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p><code class="computeroutput">filename.bz2 </code>
-  becomes
-  <code class="computeroutput">filename</code></p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">filename.bz </code>
-  becomes
-  <code class="computeroutput">filename</code></p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">filename.tbz2</code>
-  becomes
-  <code class="computeroutput">filename.tar</code></p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">filename.tbz </code>
-  becomes
-  <code class="computeroutput">filename.tar</code></p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">anyothername </code>
-  becomes
-  <code class="computeroutput">anyothername.out</code></p></li>
-</ul></div>
-<p>If the file does not end in one of the recognised endings,
-<code class="computeroutput">.bz2</code>,
-<code class="computeroutput">.bz</code>,
-<code class="computeroutput">.tbz2</code> or
-<code class="computeroutput">.tbz</code>,
-<code class="computeroutput">bzip2</code> complains that it cannot
-guess the name of the original file, and uses the original name
-with <code class="computeroutput">.out</code> appended.</p>
-<p>As with compression, supplying no filenames causes
-decompression from standard input to standard output.</p>
-<p><code class="computeroutput">bunzip2</code> will correctly
-decompress a file which is the concatenation of two or more
-compressed files.  The result is the concatenation of the
-corresponding uncompressed files.  Integrity testing
-(<code class="computeroutput">-t</code>) of concatenated compressed
-files is also supported.</p>
-<p>You can also compress or decompress files to the standard
-output by giving the <code class="computeroutput">-c</code> flag.
-Multiple files may be compressed and decompressed like this.  The
-resulting outputs are fed sequentially to stdout.  Compression of
-multiple files in this manner generates a stream containing
-multiple compressed file representations.  Such a stream can be
-decompressed correctly only by
-<code class="computeroutput">bzip2</code> version 0.9.0 or later.
-Earlier versions of <code class="computeroutput">bzip2</code> will
-stop after decompressing the first file in the stream.</p>
-<p><code class="computeroutput">bzcat</code> (or
-<code class="computeroutput">bzip2 -dc</code>) decompresses all
-specified files to the standard output.</p>
-<p><code class="computeroutput">bzip2</code> will read arguments
-from the environment variables
-<code class="computeroutput">BZIP2</code> and
-<code class="computeroutput">BZIP</code>, in that order, and will
-process them before any arguments read from the command line.
-This gives a convenient way to supply default arguments.</p>
-<p>Compression is always performed, even if the compressed
-file is slightly larger than the original.  Files of less than
-about one hundred bytes tend to get larger, since the compression
-mechanism has a constant overhead in the region of 50 bytes.
-Random data (including the output of most file compressors) is
-coded at about 8.05 bits per byte, giving an expansion of around
-0.5%.</p>
-<p>As a self-check for your protection,
-<code class="computeroutput">bzip2</code> uses 32-bit CRCs to make
-sure that the decompressed version of a file is identical to the
-original.  This guards against corruption of the compressed data,
-and against undetected bugs in
-<code class="computeroutput">bzip2</code> (hopefully very unlikely).
-The chances of data corruption going undetected is microscopic,
-about one chance in four billion for each file processed.  Be
-aware, though, that the check occurs upon decompression, so it
-can only tell you that something is wrong.  It can't help you
-recover the original uncompressed data.  You can use
-<code class="computeroutput">bzip2recover</code> to try to recover
-data from damaged files.</p>
-<p>Return values: 0 for a normal exit, 1 for environmental
-problems (file not found, invalid flags, I/O errors, etc.), 2
-to indicate a corrupt compressed file, 3 for an internal
-consistency error (eg, bug) which caused
-<code class="computeroutput">bzip2</code> to panic.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="options"></a>2.4.�OPTIONS</h2></div></div></div>
-<div class="variablelist"><dl>
-<dt><span class="term"><code class="computeroutput">-c --stdout</code></span></dt>
-<dd><p>Compress or decompress to standard
-  output.</p></dd>
-<dt><span class="term"><code class="computeroutput">-d --decompress</code></span></dt>
-<dd><p>Force decompression.
-  <code class="computeroutput">bzip2</code>,
-  <code class="computeroutput">bunzip2</code> and
-  <code class="computeroutput">bzcat</code> are really the same
-  program, and the decision about what actions to take is done on
-  the basis of which name is used.  This flag overrides that
-  mechanism, and forces bzip2 to decompress.</p></dd>
-<dt><span class="term"><code class="computeroutput">-z --compress</code></span></dt>
-<dd><p>The complement to
-  <code class="computeroutput">-d</code>: forces compression,
-  regardless of the invokation name.</p></dd>
-<dt><span class="term"><code class="computeroutput">-t --test</code></span></dt>
-<dd><p>Check integrity of the specified file(s), but
-  don't decompress them.  This really performs a trial
-  decompression and throws away the result.</p></dd>
-<dt><span class="term"><code class="computeroutput">-f --force</code></span></dt>
-<dd>
-<p>Force overwrite of output files.  Normally,
-  <code class="computeroutput">bzip2</code> will not overwrite
-  existing output files.  Also forces
-  <code class="computeroutput">bzip2</code> to break hard links to
-  files, which it otherwise wouldn't do.</p>
-<p><code class="computeroutput">bzip2</code> normally declines
-  to decompress files which don't have the correct magic header
-  bytes. If forced (<code class="computeroutput">-f</code>),
-  however, it will pass such files through unmodified. This is
-  how GNU <code class="computeroutput">gzip</code> behaves.</p>
-</dd>
-<dt><span class="term"><code class="computeroutput">-k --keep</code></span></dt>
-<dd><p>Keep (don't delete) input files during
-  compression or decompression.</p></dd>
-<dt><span class="term"><code class="computeroutput">-s --small</code></span></dt>
-<dd>
-<p>Reduce memory usage, for compression,
-  decompression and testing.  Files are decompressed and tested
-  using a modified algorithm which only requires 2.5 bytes per
-  block byte.  This means any file can be decompressed in 2300k
-  of memory, albeit at about half the normal speed.</p>
-<p>During compression, <code class="computeroutput">-s</code>
-  selects a block size of 200k, which limits memory use to around
-  the same figure, at the expense of your compression ratio.  In
-  short, if your machine is low on memory (8 megabytes or less),
-  use <code class="computeroutput">-s</code> for everything.  See
-  <a href="#memory-management">MEMORY MANAGEMENT</a> below.</p>
-</dd>
-<dt><span class="term"><code class="computeroutput">-q --quiet</code></span></dt>
-<dd><p>Suppress non-essential warning messages.
-  Messages pertaining to I/O errors and other critical events
-  will not be suppressed.</p></dd>
-<dt><span class="term"><code class="computeroutput">-v --verbose</code></span></dt>
-<dd><p>Verbose mode -- show the compression ratio for
-  each file processed.  Further
-  <code class="computeroutput">-v</code>'s increase the verbosity
-  level, spewing out lots of information which is primarily of
-  interest for diagnostic purposes.</p></dd>
-<dt><span class="term"><code class="computeroutput">-L --license -V --version</code></span></dt>
-<dd><p>Display the software version, license terms and
-  conditions.</p></dd>
-<dt><span class="term"><code class="computeroutput">-1</code> (or
- <code class="computeroutput">--fast</code>) to
- <code class="computeroutput">-9</code> (or
- <code class="computeroutput">-best</code>)</span></dt>
-<dd><p>Set the block size to 100 k, 200 k ...  900 k
-  when compressing.  Has no effect when decompressing.  See <a href="#memory-management">MEMORY MANAGEMENT</a> below.  The
-  <code class="computeroutput">--fast</code> and
-  <code class="computeroutput">--best</code> aliases are primarily
-  for GNU <code class="computeroutput">gzip</code> compatibility.
-  In particular, <code class="computeroutput">--fast</code> doesn't
-  make things significantly faster.  And
-  <code class="computeroutput">--best</code> merely selects the
-  default behaviour.</p></dd>
-<dt><span class="term"><code class="computeroutput">--</code></span></dt>
-<dd><p>Treats all subsequent arguments as file names,
-  even if they start with a dash.  This is so you can handle
-  files with names beginning with a dash, for example:
-  <code class="computeroutput">bzip2 --
-  -myfilename</code>.</p></dd>
-<dt>
-<span class="term"><code class="computeroutput">--repetitive-fast</code>, </span><span class="term"><code class="computeroutput">--repetitive-best</code></span>
-</dt>
-<dd><p>These flags are redundant in versions 0.9.5 and
-  above.  They provided some coarse control over the behaviour of
-  the sorting algorithm in earlier versions, which was sometimes
-  useful.  0.9.5 and above have an improved algorithm which
-  renders these flags irrelevant.</p></dd>
-</dl></div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="memory-management"></a>2.5.�MEMORY MANAGEMENT</h2></div></div></div>
-<p><code class="computeroutput">bzip2</code> compresses large
-files in blocks.  The block size affects both the compression
-ratio achieved, and the amount of memory needed for compression
-and decompression.  The flags <code class="computeroutput">-1</code>
-through <code class="computeroutput">-9</code> specify the block
-size to be 100,000 bytes through 900,000 bytes (the default)
-respectively.  At decompression time, the block size used for
-compression is read from the header of the compressed file, and
-<code class="computeroutput">bunzip2</code> then allocates itself
-just enough memory to decompress the file.  Since block sizes are
-stored in compressed files, it follows that the flags
-<code class="computeroutput">-1</code> to
-<code class="computeroutput">-9</code> are irrelevant to and so
-ignored during decompression.</p>
-<p>Compression and decompression requirements, in bytes, can be
-estimated as:</p>
-<pre class="programlisting">Compression:   400k + ( 8 x block size )
-Decompression: 100k + ( 4 x block size ), or
-               100k + ( 2.5 x block size )</pre>
-<p>Larger block sizes give rapidly diminishing marginal
-returns.  Most of the compression comes from the first two or
-three hundred k of block size, a fact worth bearing in mind when
-using <code class="computeroutput">bzip2</code> on small machines.
-It is also important to appreciate that the decompression memory
-requirement is set at compression time by the choice of block
-size.</p>
-<p>For files compressed with the default 900k block size,
-<code class="computeroutput">bunzip2</code> will require about 3700
-kbytes to decompress.  To support decompression of any file on a
-4 megabyte machine, <code class="computeroutput">bunzip2</code> has
-an option to decompress using approximately half this amount of
-memory, about 2300 kbytes.  Decompression speed is also halved,
-so you should use this option only where necessary.  The relevant
-flag is <code class="computeroutput">-s</code>.</p>
-<p>In general, try and use the largest block size memory
-constraints allow, since that maximises the compression achieved.
-Compression and decompression speed are virtually unaffected by
-block size.</p>
-<p>Another significant point applies to files which fit in a
-single block -- that means most files you'd encounter using a
-large block size.  The amount of real memory touched is
-proportional to the size of the file, since the file is smaller
-than a block.  For example, compressing a file 20,000 bytes long
-with the flag <code class="computeroutput">-9</code> will cause the
-compressor to allocate around 7600k of memory, but only touch
-400k + 20000 * 8 = 560 kbytes of it.  Similarly, the decompressor
-will allocate 3700k but only touch 100k + 20000 * 4 = 180
-kbytes.</p>
-<p>Here is a table which summarises the maximum memory usage
-for different block sizes.  Also recorded is the total compressed
-size for 14 files of the Calgary Text Compression Corpus
-totalling 3,141,622 bytes.  This column gives some feel for how
-compression varies with block size.  These figures tend to
-understate the advantage of larger block sizes for larger files,
-since the Corpus is dominated by smaller files.</p>
-<pre class="programlisting">        Compress   Decompress   Decompress   Corpus
-Flag     usage      usage       -s usage     Size
- -1      1200k       500k         350k      914704
- -2      2000k       900k         600k      877703
- -3      2800k      1300k         850k      860338
- -4      3600k      1700k        1100k      846899
- -5      4400k      2100k        1350k      845160
- -6      5200k      2500k        1600k      838626
- -7      6100k      2900k        1850k      834096
- -8      6800k      3300k        2100k      828642
- -9      7600k      3700k        2350k      828642</pre>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="recovering"></a>2.6.�RECOVERING DATA FROM DAMAGED FILES</h2></div></div></div>
-<p><code class="computeroutput">bzip2</code> compresses files in
-blocks, usually 900kbytes long.  Each block is handled
-independently.  If a media or transmission error causes a
-multi-block <code class="computeroutput">.bz2</code> file to become
-damaged, it may be possible to recover data from the undamaged
-blocks in the file.</p>
-<p>The compressed representation of each block is delimited by
-a 48-bit pattern, which makes it possible to find the block
-boundaries with reasonable certainty.  Each block also carries
-its own 32-bit CRC, so damaged blocks can be distinguished from
-undamaged ones.</p>
-<p><code class="computeroutput">bzip2recover</code> is a simple
-program whose purpose is to search for blocks in
-<code class="computeroutput">.bz2</code> files, and write each block
-out into its own <code class="computeroutput">.bz2</code> file.  You
-can then use <code class="computeroutput">bzip2 -t</code> to test
-the integrity of the resulting files, and decompress those which
-are undamaged.</p>
-<p><code class="computeroutput">bzip2recover</code> takes a
-single argument, the name of the damaged file, and writes a
-number of files <code class="computeroutput">rec0001file.bz2</code>,
-<code class="computeroutput">rec0002file.bz2</code>, etc, containing
-the extracted blocks.  The output filenames are designed so that
-the use of wildcards in subsequent processing -- for example,
-<code class="computeroutput">bzip2 -dc rec*file.bz2 &gt;
-recovered_data</code> -- lists the files in the correct
-order.</p>
-<p><code class="computeroutput">bzip2recover</code> should be of
-most use dealing with large <code class="computeroutput">.bz2</code>
-files, as these will contain many blocks.  It is clearly futile
-to use it on damaged single-block files, since a damaged block
-cannot be recovered.  If you wish to minimise any potential data
-loss through media or transmission errors, you might consider
-compressing with a smaller block size.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="performance"></a>2.7.�PERFORMANCE NOTES</h2></div></div></div>
-<p>The sorting phase of compression gathers together similar
-strings in the file.  Because of this, files containing very long
-runs of repeated symbols, like "aabaabaabaab ..."  (repeated
-several hundred times) may compress more slowly than normal.
-Versions 0.9.5 and above fare much better than previous versions
-in this respect.  The ratio between worst-case and average-case
-compression time is in the region of 10:1.  For previous
-versions, this figure was more like 100:1.  You can use the
-<code class="computeroutput">-vvvv</code> option to monitor progress
-in great detail, if you want.</p>
-<p>Decompression speed is unaffected by these
-phenomena.</p>
-<p><code class="computeroutput">bzip2</code> usually allocates
-several megabytes of memory to operate in, and then charges all
-over it in a fairly random fashion.  This means that performance,
-both for compressing and decompressing, is largely determined by
-the speed at which your machine can service cache misses.
-Because of this, small changes to the code to reduce the miss
-rate have been observed to give disproportionately large
-performance improvements.  I imagine
-<code class="computeroutput">bzip2</code> will perform best on
-machines with very large caches.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="caveats"></a>2.8.�CAVEATS</h2></div></div></div>
-<p>I/O error messages are not as helpful as they could be.
-<code class="computeroutput">bzip2</code> tries hard to detect I/O
-errors and exit cleanly, but the details of what the problem is
-sometimes seem rather misleading.</p>
-<p>This manual page pertains to version 1.0.5 of
-<code class="computeroutput">bzip2</code>.  Compressed data created by
-this version is entirely forwards and backwards compatible with the
-previous public releases, versions 0.1pl2, 0.9.0 and 0.9.5, 1.0.0,
-1.0.1, 1.0.2 and 1.0.3, but with the following exception: 0.9.0 and
-above can correctly decompress multiple concatenated compressed files.
-0.1pl2 cannot do this; it will stop after decompressing just the first
-file in the stream.</p>
-<p><code class="computeroutput">bzip2recover</code> versions
-prior to 1.0.2 used 32-bit integers to represent bit positions in
-compressed files, so it could not handle compressed files more
-than 512 megabytes long.  Versions 1.0.2 and above use 64-bit ints
-on some platforms which support them (GNU supported targets, and
-Windows). To establish whether or not
-<code class="computeroutput">bzip2recover</code> was built with such
-a limitation, run it without arguments. In any event you can
-build yourself an unlimited version if you can recompile it with
-<code class="computeroutput">MaybeUInt64</code> set to be an
-unsigned 64-bit integer.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="author"></a>2.9.�AUTHOR</h2></div></div></div>
-<p>Julian Seward,
-<code class="computeroutput">jseward@bzip.org</code></p>
-<p>The ideas embodied in
-<code class="computeroutput">bzip2</code> are due to (at least) the
-following people: Michael Burrows and David Wheeler (for the
-block sorting transformation), David Wheeler (again, for the
-Huffman coder), Peter Fenwick (for the structured coding model in
-the original <code class="computeroutput">bzip</code>, and many
-refinements), and Alistair Moffat, Radford Neal and Ian Witten
-(for the arithmetic coder in the original
-<code class="computeroutput">bzip</code>).  I am much indebted for
-their help, support and advice.  See the manual in the source
-distribution for pointers to sources of documentation.  Christian
-von Roques encouraged me to look for faster sorting algorithms,
-so as to speed up compression.  Bela Lubkin encouraged me to
-improve the worst-case compression performance.
-Donna Robinson XMLised the documentation.
-Many people sent
-patches, helped with portability problems, lent machines, gave
-advice and were generally helpful.</p>
-</div>
-</div>
-<div class="chapter" lang="en">
-<div class="titlepage"><div><div><h2 class="title">
-<a name="libprog"></a>3.�
-Programming with <code class="computeroutput">libbzip2</code>
-</h2></div></div></div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="sect1"><a href="#top-level">3.1. Top-level structure</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#ll-summary">3.1.1. Low-level summary</a></span></dt>
-<dt><span class="sect2"><a href="#hl-summary">3.1.2. High-level summary</a></span></dt>
-<dt><span class="sect2"><a href="#util-fns-summary">3.1.3. Utility functions summary</a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#err-handling">3.2. Error handling</a></span></dt>
-<dt><span class="sect1"><a href="#low-level">3.3. Low-level interface</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#bzcompress-init">3.3.1. <code class="computeroutput">BZ2_bzCompressInit</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzCompress">3.3.2. <code class="computeroutput">BZ2_bzCompress</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzCompress-end">3.3.3. <code class="computeroutput">BZ2_bzCompressEnd</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzDecompress-init">3.3.4. <code class="computeroutput">BZ2_bzDecompressInit</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzDecompress">3.3.5. <code class="computeroutput">BZ2_bzDecompress</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzDecompress-end">3.3.6. <code class="computeroutput">BZ2_bzDecompressEnd</code></a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#hl-interface">3.4. High-level interface</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#bzreadopen">3.4.1. <code class="computeroutput">BZ2_bzReadOpen</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzread">3.4.2. <code class="computeroutput">BZ2_bzRead</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzreadgetunused">3.4.3. <code class="computeroutput">BZ2_bzReadGetUnused</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzreadclose">3.4.4. <code class="computeroutput">BZ2_bzReadClose</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzwriteopen">3.4.5. <code class="computeroutput">BZ2_bzWriteOpen</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzwrite">3.4.6. <code class="computeroutput">BZ2_bzWrite</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzwriteclose">3.4.7. <code class="computeroutput">BZ2_bzWriteClose</code></a></span></dt>
-<dt><span class="sect2"><a href="#embed">3.4.8. Handling embedded compressed data streams</a></span></dt>
-<dt><span class="sect2"><a href="#std-rdwr">3.4.9. Standard file-reading/writing code</a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#util-fns">3.5. Utility functions</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#bzbufftobuffcompress">3.5.1. <code class="computeroutput">BZ2_bzBuffToBuffCompress</code></a></span></dt>
-<dt><span class="sect2"><a href="#bzbufftobuffdecompress">3.5.2. <code class="computeroutput">BZ2_bzBuffToBuffDecompress</code></a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#zlib-compat">3.6. <code class="computeroutput">zlib</code> compatibility functions</a></span></dt>
-<dt><span class="sect1"><a href="#stdio-free">3.7. Using the library in a <code class="computeroutput">stdio</code>-free environment</a></span></dt>
-<dd><dl>
-<dt><span class="sect2"><a href="#stdio-bye">3.7.1. Getting rid of <code class="computeroutput">stdio</code></a></span></dt>
-<dt><span class="sect2"><a href="#critical-error">3.7.2. Critical error handling</a></span></dt>
-</dl></dd>
-<dt><span class="sect1"><a href="#win-dll">3.8. Making a Windows DLL</a></span></dt>
-</dl>
-</div>
-<p>This chapter describes the programming interface to
-<code class="computeroutput">libbzip2</code>.</p>
-<p>For general background information, particularly about
-memory use and performance aspects, you'd be well advised to read
-<a href="#using">How to use bzip2</a> as well.</p>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="top-level"></a>3.1.�Top-level structure</h2></div></div></div>
-<p><code class="computeroutput">libbzip2</code> is a flexible
-library for compressing and decompressing data in the
-<code class="computeroutput">bzip2</code> data format.  Although
-packaged as a single entity, it helps to regard the library as
-three separate parts: the low level interface, and the high level
-interface, and some utility functions.</p>
-<p>The structure of
-<code class="computeroutput">libbzip2</code>'s interfaces is similar
-to that of Jean-loup Gailly's and Mark Adler's excellent
-<code class="computeroutput">zlib</code> library.</p>
-<p>All externally visible symbols have names beginning
-<code class="computeroutput">BZ2_</code>.  This is new in version
-1.0.  The intention is to minimise pollution of the namespaces of
-library clients.</p>
-<p>To use any part of the library, you need to
-<code class="computeroutput">#include &lt;bzlib.h&gt;</code>
-into your sources.</p>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="ll-summary"></a>3.1.1.�Low-level summary</h3></div></div></div>
-<p>This interface provides services for compressing and
-decompressing data in memory.  There's no provision for dealing
-with files, streams or any other I/O mechanisms, just straight
-memory-to-memory work.  In fact, this part of the library can be
-compiled without inclusion of
-<code class="computeroutput">stdio.h</code>, which may be helpful
-for embedded applications.</p>
-<p>The low-level part of the library has no global variables
-and is therefore thread-safe.</p>
-<p>Six routines make up the low level interface:
-<code class="computeroutput">BZ2_bzCompressInit</code>,
-<code class="computeroutput">BZ2_bzCompress</code>, and
-<code class="computeroutput">BZ2_bzCompressEnd</code> for
-compression, and a corresponding trio
-<code class="computeroutput">BZ2_bzDecompressInit</code>,
-<code class="computeroutput">BZ2_bzDecompress</code> and
-<code class="computeroutput">BZ2_bzDecompressEnd</code> for
-decompression.  The <code class="computeroutput">*Init</code>
-functions allocate memory for compression/decompression and do
-other initialisations, whilst the
-<code class="computeroutput">*End</code> functions close down
-operations and release memory.</p>
-<p>The real work is done by
-<code class="computeroutput">BZ2_bzCompress</code> and
-<code class="computeroutput">BZ2_bzDecompress</code>.  These
-compress and decompress data from a user-supplied input buffer to
-a user-supplied output buffer.  These buffers can be any size;
-arbitrary quantities of data are handled by making repeated calls
-to these functions.  This is a flexible mechanism allowing a
-consumer-pull style of activity, or producer-push, or a mixture
-of both.</p>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="hl-summary"></a>3.1.2.�High-level summary</h3></div></div></div>
-<p>This interface provides some handy wrappers around the
-low-level interface to facilitate reading and writing
-<code class="computeroutput">bzip2</code> format files
-(<code class="computeroutput">.bz2</code> files).  The routines
-provide hooks to facilitate reading files in which the
-<code class="computeroutput">bzip2</code> data stream is embedded
-within some larger-scale file structure, or where there are
-multiple <code class="computeroutput">bzip2</code> data streams
-concatenated end-to-end.</p>
-<p>For reading files,
-<code class="computeroutput">BZ2_bzReadOpen</code>,
-<code class="computeroutput">BZ2_bzRead</code>,
-<code class="computeroutput">BZ2_bzReadClose</code> and
-<code class="computeroutput">BZ2_bzReadGetUnused</code> are
-supplied.  For writing files,
-<code class="computeroutput">BZ2_bzWriteOpen</code>,
-<code class="computeroutput">BZ2_bzWrite</code> and
-<code class="computeroutput">BZ2_bzWriteFinish</code> are
-available.</p>
-<p>As with the low-level library, no global variables are used
-so the library is per se thread-safe.  However, if I/O errors
-occur whilst reading or writing the underlying compressed files,
-you may have to consult <code class="computeroutput">errno</code> to
-determine the cause of the error.  In that case, you'd need a C
-library which correctly supports
-<code class="computeroutput">errno</code> in a multithreaded
-environment.</p>
-<p>To make the library a little simpler and more portable,
-<code class="computeroutput">BZ2_bzReadOpen</code> and
-<code class="computeroutput">BZ2_bzWriteOpen</code> require you to
-pass them file handles (<code class="computeroutput">FILE*</code>s)
-which have previously been opened for reading or writing
-respectively.  That avoids portability problems associated with
-file operations and file attributes, whilst not being much of an
-imposition on the programmer.</p>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="util-fns-summary"></a>3.1.3.�Utility functions summary</h3></div></div></div>
-<p>For very simple needs,
-<code class="computeroutput">BZ2_bzBuffToBuffCompress</code> and
-<code class="computeroutput">BZ2_bzBuffToBuffDecompress</code> are
-provided.  These compress data in memory from one buffer to
-another buffer in a single function call.  You should assess
-whether these functions fulfill your memory-to-memory
-compression/decompression requirements before investing effort in
-understanding the more general but more complex low-level
-interface.</p>
-<p>Yoshioka Tsuneo
-(<code class="computeroutput">tsuneo@rr.iij4u.or.jp</code>) has
-contributed some functions to give better
-<code class="computeroutput">zlib</code> compatibility.  These
-functions are <code class="computeroutput">BZ2_bzopen</code>,
-<code class="computeroutput">BZ2_bzread</code>,
-<code class="computeroutput">BZ2_bzwrite</code>,
-<code class="computeroutput">BZ2_bzflush</code>,
-<code class="computeroutput">BZ2_bzclose</code>,
-<code class="computeroutput">BZ2_bzerror</code> and
-<code class="computeroutput">BZ2_bzlibVersion</code>.  You may find
-these functions more convenient for simple file reading and
-writing, than those in the high-level interface.  These functions
-are not (yet) officially part of the library, and are minimally
-documented here.  If they break, you get to keep all the pieces.
-I hope to document them properly when time permits.</p>
-<p>Yoshioka also contributed modifications to allow the
-library to be built as a Windows DLL.</p>
-</div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="err-handling"></a>3.2.�Error handling</h2></div></div></div>
-<p>The library is designed to recover cleanly in all
-situations, including the worst-case situation of decompressing
-random data.  I'm not 100% sure that it can always do this, so
-you might want to add a signal handler to catch segmentation
-violations during decompression if you are feeling especially
-paranoid.  I would be interested in hearing more about the
-robustness of the library to corrupted compressed data.</p>
-<p>Version 1.0.3 more robust in this respect than any
-previous version.  Investigations with Valgrind (a tool for detecting
-problems with memory management) indicate
-that, at least for the few files I tested, all single-bit errors
-in the decompressed data are caught properly, with no
-segmentation faults, no uses of uninitialised data, no out of
-range reads or writes, and no infinite looping in the decompressor.
-So it's certainly pretty robust, although
-I wouldn't claim it to be totally bombproof.</p>
-<p>The file <code class="computeroutput">bzlib.h</code> contains
-all definitions needed to use the library.  In particular, you
-should definitely not include
-<code class="computeroutput">bzlib_private.h</code>.</p>
-<p>In <code class="computeroutput">bzlib.h</code>, the various
-return values are defined.  The following list is not intended as
-an exhaustive description of the circumstances in which a given
-value may be returned -- those descriptions are given later.
-Rather, it is intended to convey the rough meaning of each return
-value.  The first five actions are normal and not intended to
-denote an error situation.</p>
-<div class="variablelist"><dl>
-<dt><span class="term"><code class="computeroutput">BZ_OK</code></span></dt>
-<dd><p>The requested action was completed
-   successfully.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_RUN_OK, BZ_FLUSH_OK,
-    BZ_FINISH_OK</code></span></dt>
-<dd><p>In
-   <code class="computeroutput">BZ2_bzCompress</code>, the requested
-   flush/finish/nothing-special action was completed
-   successfully.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_STREAM_END</code></span></dt>
-<dd><p>Compression of data was completed, or the
-   logical stream end was detected during
-   decompression.</p></dd>
-</dl></div>
-<p>The following return values indicate an error of some
-kind.</p>
-<div class="variablelist"><dl>
-<dt><span class="term"><code class="computeroutput">BZ_CONFIG_ERROR</code></span></dt>
-<dd><p>Indicates that the library has been improperly
-   compiled on your platform -- a major configuration error.
-   Specifically, it means that
-   <code class="computeroutput">sizeof(char)</code>,
-   <code class="computeroutput">sizeof(short)</code> and
-   <code class="computeroutput">sizeof(int)</code> are not 1, 2 and
-   4 respectively, as they should be.  Note that the library
-   should still work properly on 64-bit platforms which follow
-   the LP64 programming model -- that is, where
-   <code class="computeroutput">sizeof(long)</code> and
-   <code class="computeroutput">sizeof(void*)</code> are 8.  Under
-   LP64, <code class="computeroutput">sizeof(int)</code> is still 4,
-   so <code class="computeroutput">libbzip2</code>, which doesn't
-   use the <code class="computeroutput">long</code> type, is
-   OK.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_SEQUENCE_ERROR</code></span></dt>
-<dd><p>When using the library, it is important to call
-   the functions in the correct sequence and with data structures
-   (buffers etc) in the correct states.
-   <code class="computeroutput">libbzip2</code> checks as much as it
-   can to ensure this is happening, and returns
-   <code class="computeroutput">BZ_SEQUENCE_ERROR</code> if not.
-   Code which complies precisely with the function semantics, as
-   detailed below, should never receive this value; such an event
-   denotes buggy code which you should
-   investigate.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_PARAM_ERROR</code></span></dt>
-<dd><p>Returned when a parameter to a function call is
-   out of range or otherwise manifestly incorrect.  As with
-   <code class="computeroutput">BZ_SEQUENCE_ERROR</code>, this
-   denotes a bug in the client code.  The distinction between
-   <code class="computeroutput">BZ_PARAM_ERROR</code> and
-   <code class="computeroutput">BZ_SEQUENCE_ERROR</code> is a bit
-   hazy, but still worth making.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_MEM_ERROR</code></span></dt>
-<dd><p>Returned when a request to allocate memory
-   failed.  Note that the quantity of memory needed to decompress
-   a stream cannot be determined until the stream's header has
-   been read.  So
-   <code class="computeroutput">BZ2_bzDecompress</code> and
-   <code class="computeroutput">BZ2_bzRead</code> may return
-   <code class="computeroutput">BZ_MEM_ERROR</code> even though some
-   of the compressed data has been read.  The same is not true
-   for compression; once
-   <code class="computeroutput">BZ2_bzCompressInit</code> or
-   <code class="computeroutput">BZ2_bzWriteOpen</code> have
-   successfully completed,
-   <code class="computeroutput">BZ_MEM_ERROR</code> cannot
-   occur.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_DATA_ERROR</code></span></dt>
-<dd><p>Returned when a data integrity error is
-   detected during decompression.  Most importantly, this means
-   when stored and computed CRCs for the data do not match.  This
-   value is also returned upon detection of any other anomaly in
-   the compressed data.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_DATA_ERROR_MAGIC</code></span></dt>
-<dd><p>As a special case of
-   <code class="computeroutput">BZ_DATA_ERROR</code>, it is
-   sometimes useful to know when the compressed stream does not
-   start with the correct magic bytes (<code class="computeroutput">'B' 'Z'
-   'h'</code>).</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_IO_ERROR</code></span></dt>
-<dd><p>Returned by
-   <code class="computeroutput">BZ2_bzRead</code> and
-   <code class="computeroutput">BZ2_bzWrite</code> when there is an
-   error reading or writing in the compressed file, and by
-   <code class="computeroutput">BZ2_bzReadOpen</code> and
-   <code class="computeroutput">BZ2_bzWriteOpen</code> for attempts
-   to use a file for which the error indicator (viz,
-   <code class="computeroutput">ferror(f)</code>) is set.  On
-   receipt of <code class="computeroutput">BZ_IO_ERROR</code>, the
-   caller should consult <code class="computeroutput">errno</code>
-   and/or <code class="computeroutput">perror</code> to acquire
-   operating-system specific information about the
-   problem.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_UNEXPECTED_EOF</code></span></dt>
-<dd><p>Returned by
-   <code class="computeroutput">BZ2_bzRead</code> when the
-   compressed file finishes before the logical end of stream is
-   detected.</p></dd>
-<dt><span class="term"><code class="computeroutput">BZ_OUTBUFF_FULL</code></span></dt>
-<dd><p>Returned by
-   <code class="computeroutput">BZ2_bzBuffToBuffCompress</code> and
-   <code class="computeroutput">BZ2_bzBuffToBuffDecompress</code> to
-   indicate that the output data will not fit into the output
-   buffer provided.</p></dd>
-</dl></div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="low-level"></a>3.3.�Low-level interface</h2></div></div></div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzcompress-init"></a>3.3.1.�<code class="computeroutput">BZ2_bzCompressInit</code></h3></div></div></div>
-<pre class="programlisting">typedef struct {
-  char *next_in;
-  unsigned int avail_in;
-  unsigned int total_in_lo32;
-  unsigned int total_in_hi32;
-  char *next_out;
-  unsigned int avail_out;
-  unsigned int total_out_lo32;
-  unsigned int total_out_hi32;
-  void *state;
-  void *(*bzalloc)(void *,int,int);
-  void (*bzfree)(void *,void *);
-  void *opaque;
-} bz_stream;
-int BZ2_bzCompressInit ( bz_stream *strm,
-                         int blockSize100k,
-                         int verbosity,
-                         int workFactor );</pre>
-<p>Prepares for compression.  The
-<code class="computeroutput">bz_stream</code> structure holds all
-data pertaining to the compression activity.  A
-<code class="computeroutput">bz_stream</code> structure should be
-allocated and initialised prior to the call.  The fields of
-<code class="computeroutput">bz_stream</code> comprise the entirety
-of the user-visible data.  <code class="computeroutput">state</code>
-is a pointer to the private data structures required for
-compression.</p>
-<p>Custom memory allocators are supported, via fields
-<code class="computeroutput">bzalloc</code>,
-<code class="computeroutput">bzfree</code>, and
-<code class="computeroutput">opaque</code>.  The value
-<code class="computeroutput">opaque</code> is passed to as the first
-argument to all calls to <code class="computeroutput">bzalloc</code>
-and <code class="computeroutput">bzfree</code>, but is otherwise
-ignored by the library.  The call <code class="computeroutput">bzalloc (
-opaque, n, m )</code> is expected to return a pointer
-<code class="computeroutput">p</code> to <code class="computeroutput">n *
-m</code> bytes of memory, and <code class="computeroutput">bzfree (
-opaque, p )</code> should free that memory.</p>
-<p>If you don't want to use a custom memory allocator, set
-<code class="computeroutput">bzalloc</code>,
-<code class="computeroutput">bzfree</code> and
-<code class="computeroutput">opaque</code> to
-<code class="computeroutput">NULL</code>, and the library will then
-use the standard <code class="computeroutput">malloc</code> /
-<code class="computeroutput">free</code> routines.</p>
-<p>Before calling
-<code class="computeroutput">BZ2_bzCompressInit</code>, fields
-<code class="computeroutput">bzalloc</code>,
-<code class="computeroutput">bzfree</code> and
-<code class="computeroutput">opaque</code> should be filled
-appropriately, as just described.  Upon return, the internal
-state will have been allocated and initialised, and
-<code class="computeroutput">total_in_lo32</code>,
-<code class="computeroutput">total_in_hi32</code>,
-<code class="computeroutput">total_out_lo32</code> and
-<code class="computeroutput">total_out_hi32</code> will have been
-set to zero.  These four fields are used by the library to inform
-the caller of the total amount of data passed into and out of the
-library, respectively.  You should not try to change them.  As of
-version 1.0, 64-bit counts are maintained, even on 32-bit
-platforms, using the <code class="computeroutput">_hi32</code>
-fields to store the upper 32 bits of the count.  So, for example,
-the total amount of data in is <code class="computeroutput">(total_in_hi32
-&lt;&lt; 32) + total_in_lo32</code>.</p>
-<p>Parameter <code class="computeroutput">blockSize100k</code>
-specifies the block size to be used for compression.  It should
-be a value between 1 and 9 inclusive, and the actual block size
-used is 100000 x this figure.  9 gives the best compression but
-takes most memory.</p>
-<p>Parameter <code class="computeroutput">verbosity</code> should
-be set to a number between 0 and 4 inclusive.  0 is silent, and
-greater numbers give increasingly verbose monitoring/debugging
-output.  If the library has been compiled with
-<code class="computeroutput">-DBZ_NO_STDIO</code>, no such output
-will appear for any verbosity setting.</p>
-<p>Parameter <code class="computeroutput">workFactor</code>
-controls how the compression phase behaves when presented with
-worst case, highly repetitive, input data.  If compression runs
-into difficulties caused by repetitive data, the library switches
-from the standard sorting algorithm to a fallback algorithm.  The
-fallback is slower than the standard algorithm by perhaps a
-factor of three, but always behaves reasonably, no matter how bad
-the input.</p>
-<p>Lower values of <code class="computeroutput">workFactor</code>
-reduce the amount of effort the standard algorithm will expend
-before resorting to the fallback.  You should set this parameter
-carefully; too low, and many inputs will be handled by the
-fallback algorithm and so compress rather slowly, too high, and
-your average-to-worst case compression times can become very
-large.  The default value of 30 gives reasonable behaviour over a
-wide range of circumstances.</p>
-<p>Allowable values range from 0 to 250 inclusive.  0 is a
-special case, equivalent to using the default value of 30.</p>
-<p>Note that the compressed output generated is the same
-regardless of whether or not the fallback algorithm is
-used.</p>
-<p>Be aware also that this parameter may disappear entirely in
-future versions of the library.  In principle it should be
-possible to devise a good way to automatically choose which
-algorithm to use.  Such a mechanism would render the parameter
-obsolete.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_CONFIG_ERROR
-  if the library has been mis-compiled
-BZ_PARAM_ERROR
-  if strm is NULL
-  or blockSize &lt; 1 or blockSize &gt; 9
-  or verbosity &lt; 0 or verbosity &gt; 4
-  or workFactor &lt; 0 or workFactor &gt; 250
-BZ_MEM_ERROR
-  if not enough memory is available
-BZ_OK
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">BZ2_bzCompress
-  if BZ_OK is returned
-  no specific action needed in case of error</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzCompress"></a>3.3.2.�<code class="computeroutput">BZ2_bzCompress</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzCompress ( bz_stream *strm, int action );</pre>
-<p>Provides more input and/or output buffer space for the
-library.  The caller maintains input and output buffers, and
-calls <code class="computeroutput">BZ2_bzCompress</code> to transfer
-data between them.</p>
-<p>Before each call to
-<code class="computeroutput">BZ2_bzCompress</code>,
-<code class="computeroutput">next_in</code> should point at the data
-to be compressed, and <code class="computeroutput">avail_in</code>
-should indicate how many bytes the library may read.
-<code class="computeroutput">BZ2_bzCompress</code> updates
-<code class="computeroutput">next_in</code>,
-<code class="computeroutput">avail_in</code> and
-<code class="computeroutput">total_in</code> to reflect the number
-of bytes it has read.</p>
-<p>Similarly, <code class="computeroutput">next_out</code> should
-point to a buffer in which the compressed data is to be placed,
-with <code class="computeroutput">avail_out</code> indicating how
-much output space is available.
-<code class="computeroutput">BZ2_bzCompress</code> updates
-<code class="computeroutput">next_out</code>,
-<code class="computeroutput">avail_out</code> and
-<code class="computeroutput">total_out</code> to reflect the number
-of bytes output.</p>
-<p>You may provide and remove as little or as much data as you
-like on each call of
-<code class="computeroutput">BZ2_bzCompress</code>.  In the limit,
-it is acceptable to supply and remove data one byte at a time,
-although this would be terribly inefficient.  You should always
-ensure that at least one byte of output space is available at
-each call.</p>
-<p>A second purpose of
-<code class="computeroutput">BZ2_bzCompress</code> is to request a
-change of mode of the compressed stream.</p>
-<p>Conceptually, a compressed stream can be in one of four
-states: IDLE, RUNNING, FLUSHING and FINISHING.  Before
-initialisation
-(<code class="computeroutput">BZ2_bzCompressInit</code>) and after
-termination (<code class="computeroutput">BZ2_bzCompressEnd</code>),
-a stream is regarded as IDLE.</p>
-<p>Upon initialisation
-(<code class="computeroutput">BZ2_bzCompressInit</code>), the stream
-is placed in the RUNNING state.  Subsequent calls to
-<code class="computeroutput">BZ2_bzCompress</code> should pass
-<code class="computeroutput">BZ_RUN</code> as the requested action;
-other actions are illegal and will result in
-<code class="computeroutput">BZ_SEQUENCE_ERROR</code>.</p>
-<p>At some point, the calling program will have provided all
-the input data it wants to.  It will then want to finish up -- in
-effect, asking the library to process any data it might have
-buffered internally.  In this state,
-<code class="computeroutput">BZ2_bzCompress</code> will no longer
-attempt to read data from
-<code class="computeroutput">next_in</code>, but it will want to
-write data to <code class="computeroutput">next_out</code>.  Because
-the output buffer supplied by the user can be arbitrarily small,
-the finishing-up operation cannot necessarily be done with a
-single call of
-<code class="computeroutput">BZ2_bzCompress</code>.</p>
-<p>Instead, the calling program passes
-<code class="computeroutput">BZ_FINISH</code> as an action to
-<code class="computeroutput">BZ2_bzCompress</code>.  This changes
-the stream's state to FINISHING.  Any remaining input (ie,
-<code class="computeroutput">next_in[0 .. avail_in-1]</code>) is
-compressed and transferred to the output buffer.  To do this,
-<code class="computeroutput">BZ2_bzCompress</code> must be called
-repeatedly until all the output has been consumed.  At that
-point, <code class="computeroutput">BZ2_bzCompress</code> returns
-<code class="computeroutput">BZ_STREAM_END</code>, and the stream's
-state is set back to IDLE.
-<code class="computeroutput">BZ2_bzCompressEnd</code> should then be
-called.</p>
-<p>Just to make sure the calling program does not cheat, the
-library makes a note of <code class="computeroutput">avail_in</code>
-at the time of the first call to
-<code class="computeroutput">BZ2_bzCompress</code> which has
-<code class="computeroutput">BZ_FINISH</code> as an action (ie, at
-the time the program has announced its intention to not supply
-any more input).  By comparing this value with that of
-<code class="computeroutput">avail_in</code> over subsequent calls
-to <code class="computeroutput">BZ2_bzCompress</code>, the library
-can detect any attempts to slip in more data to compress.  Any
-calls for which this is detected will return
-<code class="computeroutput">BZ_SEQUENCE_ERROR</code>.  This
-indicates a programming mistake which should be corrected.</p>
-<p>Instead of asking to finish, the calling program may ask
-<code class="computeroutput">BZ2_bzCompress</code> to take all the
-remaining input, compress it and terminate the current
-(Burrows-Wheeler) compression block.  This could be useful for
-error control purposes.  The mechanism is analogous to that for
-finishing: call <code class="computeroutput">BZ2_bzCompress</code>
-with an action of <code class="computeroutput">BZ_FLUSH</code>,
-remove output data, and persist with the
-<code class="computeroutput">BZ_FLUSH</code> action until the value
-<code class="computeroutput">BZ_RUN</code> is returned.  As with
-finishing, <code class="computeroutput">BZ2_bzCompress</code>
-detects any attempt to provide more input data once the flush has
-begun.</p>
-<p>Once the flush is complete, the stream returns to the
-normal RUNNING state.</p>
-<p>This all sounds pretty complex, but isn't really.  Here's a
-table which shows which actions are allowable in each state, what
-action will be taken, what the next state is, and what the
-non-error return values are.  Note that you can't explicitly ask
-what state the stream is in, but nor do you need to -- it can be
-inferred from the values returned by
-<code class="computeroutput">BZ2_bzCompress</code>.</p>
-<pre class="programlisting">IDLE/any
-  Illegal.  IDLE state only exists after BZ2_bzCompressEnd or
-  before BZ2_bzCompressInit.
-  Return value = BZ_SEQUENCE_ERROR
-RUNNING/BZ_RUN
-  Compress from next_in to next_out as much as possible.
-  Next state = RUNNING
-  Return value = BZ_RUN_OK
-RUNNING/BZ_FLUSH
-  Remember current value of next_in. Compress from next_in
-  to next_out as much as possible, but do not accept any more input.
-  Next state = FLUSHING
-  Return value = BZ_FLUSH_OK
-RUNNING/BZ_FINISH
-  Remember current value of next_in. Compress from next_in
-  to next_out as much as possible, but do not accept any more input.
-  Next state = FINISHING
-  Return value = BZ_FINISH_OK
-FLUSHING/BZ_FLUSH
-  Compress from next_in to next_out as much as possible,
-  but do not accept any more input.
-  If all the existing input has been used up and all compressed
-  output has been removed
-    Next state = RUNNING; Return value = BZ_RUN_OK
-  else
-    Next state = FLUSHING; Return value = BZ_FLUSH_OK
-FLUSHING/other
-  Illegal.
-  Return value = BZ_SEQUENCE_ERROR
-FINISHING/BZ_FINISH
-  Compress from next_in to next_out as much as possible,
-  but to not accept any more input.
-  If all the existing input has been used up and all compressed
-  output has been removed
-    Next state = IDLE; Return value = BZ_STREAM_END
-  else
-    Next state = FINISHING; Return value = BZ_FINISH_OK
-FINISHING/other
-  Illegal.
-  Return value = BZ_SEQUENCE_ERROR</pre>
-<p>That still looks complicated?  Well, fair enough.  The
-usual sequence of calls for compressing a load of data is:</p>
-<div class="orderedlist"><ol type="1">
-<li><p>Get started with
-  <code class="computeroutput">BZ2_bzCompressInit</code>.</p></li>
-<li><p>Shovel data in and shlurp out its compressed form
-  using zero or more calls of
-  <code class="computeroutput">BZ2_bzCompress</code> with action =
-  <code class="computeroutput">BZ_RUN</code>.</p></li>
-<li><p>Finish up. Repeatedly call
-  <code class="computeroutput">BZ2_bzCompress</code> with action =
-  <code class="computeroutput">BZ_FINISH</code>, copying out the
-  compressed output, until
-  <code class="computeroutput">BZ_STREAM_END</code> is
-  returned.</p></li>
-<li><p>Close up and go home.  Call
-  <code class="computeroutput">BZ2_bzCompressEnd</code>.</p></li>
-</ol></div>
-<p>If the data you want to compress fits into your input
-buffer all at once, you can skip the calls of
-<code class="computeroutput">BZ2_bzCompress ( ..., BZ_RUN )</code>
-and just do the <code class="computeroutput">BZ2_bzCompress ( ..., BZ_FINISH
-)</code> calls.</p>
-<p>All required memory is allocated by
-<code class="computeroutput">BZ2_bzCompressInit</code>.  The
-compression library can accept any data at all (obviously).  So
-you shouldn't get any error return values from the
-<code class="computeroutput">BZ2_bzCompress</code> calls.  If you
-do, they will be
-<code class="computeroutput">BZ_SEQUENCE_ERROR</code>, and indicate
-a bug in your programming.</p>
-<p>Trivial other possible return values:</p>
-<pre class="programlisting">BZ_PARAM_ERROR
-  if strm is NULL, or strm-&gt;s is NULL</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzCompress-end"></a>3.3.3.�<code class="computeroutput">BZ2_bzCompressEnd</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzCompressEnd ( bz_stream *strm );</pre>
-<p>Releases all memory associated with a compression
-stream.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_PARAM_ERROR  if strm is NULL or strm-&gt;s is NULL
-BZ_OK           otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzDecompress-init"></a>3.3.4.�<code class="computeroutput">BZ2_bzDecompressInit</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzDecompressInit ( bz_stream *strm, int verbosity, int small );</pre>
-<p>Prepares for decompression.  As with
-<code class="computeroutput">BZ2_bzCompressInit</code>, a
-<code class="computeroutput">bz_stream</code> record should be
-allocated and initialised before the call.  Fields
-<code class="computeroutput">bzalloc</code>,
-<code class="computeroutput">bzfree</code> and
-<code class="computeroutput">opaque</code> should be set if a custom
-memory allocator is required, or made
-<code class="computeroutput">NULL</code> for the normal
-<code class="computeroutput">malloc</code> /
-<code class="computeroutput">free</code> routines.  Upon return, the
-internal state will have been initialised, and
-<code class="computeroutput">total_in</code> and
-<code class="computeroutput">total_out</code> will be zero.</p>
-<p>For the meaning of parameter
-<code class="computeroutput">verbosity</code>, see
-<code class="computeroutput">BZ2_bzCompressInit</code>.</p>
-<p>If <code class="computeroutput">small</code> is nonzero, the
-library will use an alternative decompression algorithm which
-uses less memory but at the cost of decompressing more slowly
-(roughly speaking, half the speed, but the maximum memory
-requirement drops to around 2300k).  See <a href="#using">How to use bzip2</a>
-for more information on memory management.</p>
-<p>Note that the amount of memory needed to decompress a
-stream cannot be determined until the stream's header has been
-read, so even if
-<code class="computeroutput">BZ2_bzDecompressInit</code> succeeds, a
-subsequent <code class="computeroutput">BZ2_bzDecompress</code>
-could fail with
-<code class="computeroutput">BZ_MEM_ERROR</code>.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_CONFIG_ERROR
-  if the library has been mis-compiled
-BZ_PARAM_ERROR
-  if ( small != 0 &amp;&amp; small != 1 )
-  or (verbosity &lt;; 0 || verbosity &gt; 4)
-BZ_MEM_ERROR
-  if insufficient memory is available</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">BZ2_bzDecompress
-  if BZ_OK was returned
-  no specific action required in case of error</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzDecompress"></a>3.3.5.�<code class="computeroutput">BZ2_bzDecompress</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzDecompress ( bz_stream *strm );</pre>
-<p>Provides more input and/out output buffer space for the
-library.  The caller maintains input and output buffers, and uses
-<code class="computeroutput">BZ2_bzDecompress</code> to transfer
-data between them.</p>
-<p>Before each call to
-<code class="computeroutput">BZ2_bzDecompress</code>,
-<code class="computeroutput">next_in</code> should point at the
-compressed data, and <code class="computeroutput">avail_in</code>
-should indicate how many bytes the library may read.
-<code class="computeroutput">BZ2_bzDecompress</code> updates
-<code class="computeroutput">next_in</code>,
-<code class="computeroutput">avail_in</code> and
-<code class="computeroutput">total_in</code> to reflect the number
-of bytes it has read.</p>
-<p>Similarly, <code class="computeroutput">next_out</code> should
-point to a buffer in which the uncompressed output is to be
-placed, with <code class="computeroutput">avail_out</code>
-indicating how much output space is available.
-<code class="computeroutput">BZ2_bzCompress</code> updates
-<code class="computeroutput">next_out</code>,
-<code class="computeroutput">avail_out</code> and
-<code class="computeroutput">total_out</code> to reflect the number
-of bytes output.</p>
-<p>You may provide and remove as little or as much data as you
-like on each call of
-<code class="computeroutput">BZ2_bzDecompress</code>.  In the limit,
-it is acceptable to supply and remove data one byte at a time,
-although this would be terribly inefficient.  You should always
-ensure that at least one byte of output space is available at
-each call.</p>
-<p>Use of <code class="computeroutput">BZ2_bzDecompress</code> is
-simpler than
-<code class="computeroutput">BZ2_bzCompress</code>.</p>
-<p>You should provide input and remove output as described
-above, and repeatedly call
-<code class="computeroutput">BZ2_bzDecompress</code> until
-<code class="computeroutput">BZ_STREAM_END</code> is returned.
-Appearance of <code class="computeroutput">BZ_STREAM_END</code>
-denotes that <code class="computeroutput">BZ2_bzDecompress</code>
-has detected the logical end of the compressed stream.
-<code class="computeroutput">BZ2_bzDecompress</code> will not
-produce <code class="computeroutput">BZ_STREAM_END</code> until all
-output data has been placed into the output buffer, so once
-<code class="computeroutput">BZ_STREAM_END</code> appears, you are
-guaranteed to have available all the decompressed output, and
-<code class="computeroutput">BZ2_bzDecompressEnd</code> can safely
-be called.</p>
-<p>If case of an error return value, you should call
-<code class="computeroutput">BZ2_bzDecompressEnd</code> to clean up
-and release memory.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_PARAM_ERROR
-  if strm is NULL or strm-&gt;s is NULL
-  or strm-&gt;avail_out &lt; 1
-BZ_DATA_ERROR
-  if a data integrity error is detected in the compressed stream
-BZ_DATA_ERROR_MAGIC
-  if the compressed stream doesn't begin with the right magic bytes
-BZ_MEM_ERROR
-  if there wasn't enough memory available
-BZ_STREAM_END
-  if the logical end of the data stream was detected and all
-  output in has been consumed, eg s--&gt;avail_out &gt; 0
-BZ_OK
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">BZ2_bzDecompress
-  if BZ_OK was returned
-BZ2_bzDecompressEnd
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzDecompress-end"></a>3.3.6.�<code class="computeroutput">BZ2_bzDecompressEnd</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzDecompressEnd ( bz_stream *strm );</pre>
-<p>Releases all memory associated with a decompression
-stream.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_PARAM_ERROR
-  if strm is NULL or strm-&gt;s is NULL
-BZ_OK
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">  None.</pre>
-</div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="hl-interface"></a>3.4.�High-level interface</h2></div></div></div>
-<p>This interface provides functions for reading and writing
-<code class="computeroutput">bzip2</code> format files.  First, some
-general points.</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p>All of the functions take an
-  <code class="computeroutput">int*</code> first argument,
-  <code class="computeroutput">bzerror</code>.  After each call,
-  <code class="computeroutput">bzerror</code> should be consulted
-  first to determine the outcome of the call.  If
-  <code class="computeroutput">bzerror</code> is
-  <code class="computeroutput">BZ_OK</code>, the call completed
-  successfully, and only then should the return value of the
-  function (if any) be consulted.  If
-  <code class="computeroutput">bzerror</code> is
-  <code class="computeroutput">BZ_IO_ERROR</code>, there was an
-  error reading/writing the underlying compressed file, and you
-  should then consult <code class="computeroutput">errno</code> /
-  <code class="computeroutput">perror</code> to determine the cause
-  of the difficulty.  <code class="computeroutput">bzerror</code>
-  may also be set to various other values; precise details are
-  given on a per-function basis below.</p></li>
-<li style="list-style-type: disc"><p>If <code class="computeroutput">bzerror</code> indicates
-  an error (ie, anything except
-  <code class="computeroutput">BZ_OK</code> and
-  <code class="computeroutput">BZ_STREAM_END</code>), you should
-  immediately call
-  <code class="computeroutput">BZ2_bzReadClose</code> (or
-  <code class="computeroutput">BZ2_bzWriteClose</code>, depending on
-  whether you are attempting to read or to write) to free up all
-  resources associated with the stream.  Once an error has been
-  indicated, behaviour of all calls except
-  <code class="computeroutput">BZ2_bzReadClose</code>
-  (<code class="computeroutput">BZ2_bzWriteClose</code>) is
-  undefined.  The implication is that (1)
-  <code class="computeroutput">bzerror</code> should be checked
-  after each call, and (2) if
-  <code class="computeroutput">bzerror</code> indicates an error,
-  <code class="computeroutput">BZ2_bzReadClose</code>
-  (<code class="computeroutput">BZ2_bzWriteClose</code>) should then
-  be called to clean up.</p></li>
-<li style="list-style-type: disc"><p>The <code class="computeroutput">FILE*</code> arguments
-  passed to <code class="computeroutput">BZ2_bzReadOpen</code> /
-  <code class="computeroutput">BZ2_bzWriteOpen</code> should be set
-  to binary mode.  Most Unix systems will do this by default, but
-  other platforms, including Windows and Mac, will not.  If you
-  omit this, you may encounter problems when moving code to new
-  platforms.</p></li>
-<li style="list-style-type: disc"><p>Memory allocation requests are handled by
-  <code class="computeroutput">malloc</code> /
-  <code class="computeroutput">free</code>.  At present there is no
-  facility for user-defined memory allocators in the file I/O
-  functions (could easily be added, though).</p></li>
-</ul></div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzreadopen"></a>3.4.1.�<code class="computeroutput">BZ2_bzReadOpen</code></h3></div></div></div>
-<pre class="programlisting">typedef void BZFILE;
-BZFILE *BZ2_bzReadOpen( int *bzerror, FILE *f,
-                        int verbosity, int small,
-                        void *unused, int nUnused );</pre>
-<p>Prepare to read compressed data from file handle
-<code class="computeroutput">f</code>.
-<code class="computeroutput">f</code> should refer to a file which
-has been opened for reading, and for which the error indicator
-(<code class="computeroutput">ferror(f)</code>)is not set.  If
-<code class="computeroutput">small</code> is 1, the library will try
-to decompress using less memory, at the expense of speed.</p>
-<p>For reasons explained below,
-<code class="computeroutput">BZ2_bzRead</code> will decompress the
-<code class="computeroutput">nUnused</code> bytes starting at
-<code class="computeroutput">unused</code>, before starting to read
-from the file <code class="computeroutput">f</code>.  At most
-<code class="computeroutput">BZ_MAX_UNUSED</code> bytes may be
-supplied like this.  If this facility is not required, you should
-pass <code class="computeroutput">NULL</code> and
-<code class="computeroutput">0</code> for
-<code class="computeroutput">unused</code> and
-n<code class="computeroutput">Unused</code> respectively.</p>
-<p>For the meaning of parameters
-<code class="computeroutput">small</code> and
-<code class="computeroutput">verbosity</code>, see
-<code class="computeroutput">BZ2_bzDecompressInit</code>.</p>
-<p>The amount of memory needed to decompress a file cannot be
-determined until the file's header has been read.  So it is
-possible that <code class="computeroutput">BZ2_bzReadOpen</code>
-returns <code class="computeroutput">BZ_OK</code> but a subsequent
-call of <code class="computeroutput">BZ2_bzRead</code> will return
-<code class="computeroutput">BZ_MEM_ERROR</code>.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_CONFIG_ERROR
-  if the library has been mis-compiled
-BZ_PARAM_ERROR
-  if f is NULL
-  or small is neither 0 nor 1
-  or ( unused == NULL &amp;&amp; nUnused != 0 )
-  or ( unused != NULL &amp;&amp; !(0 &lt;= nUnused &lt;= BZ_MAX_UNUSED) )
-BZ_IO_ERROR
-  if ferror(f) is nonzero
-BZ_MEM_ERROR
-  if insufficient memory is available
-BZ_OK
-  otherwise.</pre>
-<p>Possible return values:</p>
-<pre class="programlisting">Pointer to an abstract BZFILE
-  if bzerror is BZ_OK
-NULL
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">BZ2_bzRead
-  if bzerror is BZ_OK
-BZ2_bzClose
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzread"></a>3.4.2.�<code class="computeroutput">BZ2_bzRead</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzRead ( int *bzerror, BZFILE *b, void *buf, int len );</pre>
-<p>Reads up to <code class="computeroutput">len</code>
-(uncompressed) bytes from the compressed file
-<code class="computeroutput">b</code> into the buffer
-<code class="computeroutput">buf</code>.  If the read was
-successful, <code class="computeroutput">bzerror</code> is set to
-<code class="computeroutput">BZ_OK</code> and the number of bytes
-read is returned.  If the logical end-of-stream was detected,
-<code class="computeroutput">bzerror</code> will be set to
-<code class="computeroutput">BZ_STREAM_END</code>, and the number of
-bytes read is returned.  All other
-<code class="computeroutput">bzerror</code> values denote an
-error.</p>
-<p><code class="computeroutput">BZ2_bzRead</code> will supply
-<code class="computeroutput">len</code> bytes, unless the logical
-stream end is detected or an error occurs.  Because of this, it
-is possible to detect the stream end by observing when the number
-of bytes returned is less than the number requested.
-Nevertheless, this is regarded as inadvisable; you should instead
-check <code class="computeroutput">bzerror</code> after every call
-and watch out for
-<code class="computeroutput">BZ_STREAM_END</code>.</p>
-<p>Internally, <code class="computeroutput">BZ2_bzRead</code>
-copies data from the compressed file in chunks of size
-<code class="computeroutput">BZ_MAX_UNUSED</code> bytes before
-decompressing it.  If the file contains more bytes than strictly
-needed to reach the logical end-of-stream,
-<code class="computeroutput">BZ2_bzRead</code> will almost certainly
-read some of the trailing data before signalling
-<code class="computeroutput">BZ_SEQUENCE_END</code>.  To collect the
-read but unused data once
-<code class="computeroutput">BZ_SEQUENCE_END</code> has appeared,
-call <code class="computeroutput">BZ2_bzReadGetUnused</code>
-immediately before
-<code class="computeroutput">BZ2_bzReadClose</code>.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_PARAM_ERROR
-  if b is NULL or buf is NULL or len &lt; 0
-BZ_SEQUENCE_ERROR
-  if b was opened with BZ2_bzWriteOpen
-BZ_IO_ERROR
-  if there is an error reading from the compressed file
-BZ_UNEXPECTED_EOF
-  if the compressed file ended before
-  the logical end-of-stream was detected
-BZ_DATA_ERROR
-  if a data integrity error was detected in the compressed stream
-BZ_DATA_ERROR_MAGIC
-  if the stream does not begin with the requisite header bytes
-  (ie, is not a bzip2 data file).  This is really
-  a special case of BZ_DATA_ERROR.
-BZ_MEM_ERROR
-  if insufficient memory was available
-BZ_STREAM_END
-  if the logical end of stream was detected.
-BZ_OK
-  otherwise.</pre>
-<p>Possible return values:</p>
-<pre class="programlisting">number of bytes read
-  if bzerror is BZ_OK or BZ_STREAM_END
-undefined
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">collect data from buf, then BZ2_bzRead or BZ2_bzReadClose
-  if bzerror is BZ_OK
-collect data from buf, then BZ2_bzReadClose or BZ2_bzReadGetUnused
-  if bzerror is BZ_SEQUENCE_END
-BZ2_bzReadClose
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzreadgetunused"></a>3.4.3.�<code class="computeroutput">BZ2_bzReadGetUnused</code></h3></div></div></div>
-<pre class="programlisting">void BZ2_bzReadGetUnused( int* bzerror, BZFILE *b,
-                          void** unused, int* nUnused );</pre>
-<p>Returns data which was read from the compressed file but
-was not needed to get to the logical end-of-stream.
-<code class="computeroutput">*unused</code> is set to the address of
-the data, and <code class="computeroutput">*nUnused</code> to the
-number of bytes.  <code class="computeroutput">*nUnused</code> will
-be set to a value between <code class="computeroutput">0</code> and
-<code class="computeroutput">BZ_MAX_UNUSED</code> inclusive.</p>
-<p>This function may only be called once
-<code class="computeroutput">BZ2_bzRead</code> has signalled
-<code class="computeroutput">BZ_STREAM_END</code> but before
-<code class="computeroutput">BZ2_bzReadClose</code>.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_PARAM_ERROR
-  if b is NULL
-  or unused is NULL or nUnused is NULL
-BZ_SEQUENCE_ERROR
-  if BZ_STREAM_END has not been signalled
-  or if b was opened with BZ2_bzWriteOpen
-BZ_OK
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">BZ2_bzReadClose</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzreadclose"></a>3.4.4.�<code class="computeroutput">BZ2_bzReadClose</code></h3></div></div></div>
-<pre class="programlisting">void BZ2_bzReadClose ( int *bzerror, BZFILE *b );</pre>
-<p>Releases all memory pertaining to the compressed file
-<code class="computeroutput">b</code>.
-<code class="computeroutput">BZ2_bzReadClose</code> does not call
-<code class="computeroutput">fclose</code> on the underlying file
-handle, so you should do that yourself if appropriate.
-<code class="computeroutput">BZ2_bzReadClose</code> should be called
-to clean up after all error situations.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_SEQUENCE_ERROR
-  if b was opened with BZ2_bzOpenWrite
-BZ_OK
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">none</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzwriteopen"></a>3.4.5.�<code class="computeroutput">BZ2_bzWriteOpen</code></h3></div></div></div>
-<pre class="programlisting">BZFILE *BZ2_bzWriteOpen( int *bzerror, FILE *f,
-                         int blockSize100k, int verbosity,
-                         int workFactor );</pre>
-<p>Prepare to write compressed data to file handle
-<code class="computeroutput">f</code>.
-<code class="computeroutput">f</code> should refer to a file which
-has been opened for writing, and for which the error indicator
-(<code class="computeroutput">ferror(f)</code>)is not set.</p>
-<p>For the meaning of parameters
-<code class="computeroutput">blockSize100k</code>,
-<code class="computeroutput">verbosity</code> and
-<code class="computeroutput">workFactor</code>, see
-<code class="computeroutput">BZ2_bzCompressInit</code>.</p>
-<p>All required memory is allocated at this stage, so if the
-call completes successfully,
-<code class="computeroutput">BZ_MEM_ERROR</code> cannot be signalled
-by a subsequent call to
-<code class="computeroutput">BZ2_bzWrite</code>.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_CONFIG_ERROR
-  if the library has been mis-compiled
-BZ_PARAM_ERROR
-  if f is NULL
-  or blockSize100k &lt; 1 or blockSize100k &gt; 9
-BZ_IO_ERROR
-  if ferror(f) is nonzero
-BZ_MEM_ERROR
-  if insufficient memory is available
-BZ_OK
-  otherwise</pre>
-<p>Possible return values:</p>
-<pre class="programlisting">Pointer to an abstract BZFILE
-  if bzerror is BZ_OK
-NULL
-  otherwise</pre>
-<p>Allowable next actions:</p>
-<pre class="programlisting">BZ2_bzWrite
-  if bzerror is BZ_OK
-  (you could go directly to BZ2_bzWriteClose, but this would be pretty pointless)
-BZ2_bzWriteClose
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzwrite"></a>3.4.6.�<code class="computeroutput">BZ2_bzWrite</code></h3></div></div></div>
-<pre class="programlisting">void BZ2_bzWrite ( int *bzerror, BZFILE *b, void *buf, int len );</pre>
-<p>Absorbs <code class="computeroutput">len</code> bytes from the
-buffer <code class="computeroutput">buf</code>, eventually to be
-compressed and written to the file.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_PARAM_ERROR
-  if b is NULL or buf is NULL or len &lt; 0
-BZ_SEQUENCE_ERROR
-  if b was opened with BZ2_bzReadOpen
-BZ_IO_ERROR
-  if there is an error writing the compressed file.
-BZ_OK
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzwriteclose"></a>3.4.7.�<code class="computeroutput">BZ2_bzWriteClose</code></h3></div></div></div>
-<pre class="programlisting">void BZ2_bzWriteClose( int *bzerror, BZFILE* f,
-                       int abandon,
-                       unsigned int* nbytes_in,
-                       unsigned int* nbytes_out );
-void BZ2_bzWriteClose64( int *bzerror, BZFILE* f,
-                         int abandon,
-                         unsigned int* nbytes_in_lo32,
-                         unsigned int* nbytes_in_hi32,
-                         unsigned int* nbytes_out_lo32,
-                         unsigned int* nbytes_out_hi32 );</pre>
-<p>Compresses and flushes to the compressed file all data so
-far supplied by <code class="computeroutput">BZ2_bzWrite</code>.
-The logical end-of-stream markers are also written, so subsequent
-calls to <code class="computeroutput">BZ2_bzWrite</code> are
-illegal.  All memory associated with the compressed file
-<code class="computeroutput">b</code> is released.
-<code class="computeroutput">fflush</code> is called on the
-compressed file, but it is not
-<code class="computeroutput">fclose</code>'d.</p>
-<p>If <code class="computeroutput">BZ2_bzWriteClose</code> is
-called to clean up after an error, the only action is to release
-the memory.  The library records the error codes issued by
-previous calls, so this situation will be detected automatically.
-There is no attempt to complete the compression operation, nor to
-<code class="computeroutput">fflush</code> the compressed file.  You
-can force this behaviour to happen even in the case of no error,
-by passing a nonzero value to
-<code class="computeroutput">abandon</code>.</p>
-<p>If <code class="computeroutput">nbytes_in</code> is non-null,
-<code class="computeroutput">*nbytes_in</code> will be set to be the
-total volume of uncompressed data handled.  Similarly,
-<code class="computeroutput">nbytes_out</code> will be set to the
-total volume of compressed data written.  For compatibility with
-older versions of the library,
-<code class="computeroutput">BZ2_bzWriteClose</code> only yields the
-lower 32 bits of these counts.  Use
-<code class="computeroutput">BZ2_bzWriteClose64</code> if you want
-the full 64 bit counts.  These two functions are otherwise
-absolutely identical.</p>
-<p>Possible assignments to
-<code class="computeroutput">bzerror</code>:</p>
-<pre class="programlisting">BZ_SEQUENCE_ERROR
-  if b was opened with BZ2_bzReadOpen
-BZ_IO_ERROR
-  if there is an error writing the compressed file
-BZ_OK
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="embed"></a>3.4.8.�Handling embedded compressed data streams</h3></div></div></div>
-<p>The high-level library facilitates use of
-<code class="computeroutput">bzip2</code> data streams which form
-some part of a surrounding, larger data stream.</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p>For writing, the library takes an open file handle,
-  writes compressed data to it,
-  <code class="computeroutput">fflush</code>es it but does not
-  <code class="computeroutput">fclose</code> it.  The calling
-  application can write its own data before and after the
-  compressed data stream, using that same file handle.</p></li>
-<li style="list-style-type: disc"><p>Reading is more complex, and the facilities are not as
-  general as they could be since generality is hard to reconcile
-  with efficiency.  <code class="computeroutput">BZ2_bzRead</code>
-  reads from the compressed file in blocks of size
-  <code class="computeroutput">BZ_MAX_UNUSED</code> bytes, and in
-  doing so probably will overshoot the logical end of compressed
-  stream.  To recover this data once decompression has ended,
-  call <code class="computeroutput">BZ2_bzReadGetUnused</code> after
-  the last call of <code class="computeroutput">BZ2_bzRead</code>
-  (the one returning
-  <code class="computeroutput">BZ_STREAM_END</code>) but before
-  calling
-  <code class="computeroutput">BZ2_bzReadClose</code>.</p></li>
-</ul></div>
-<p>This mechanism makes it easy to decompress multiple
-<code class="computeroutput">bzip2</code> streams placed end-to-end.
-As the end of one stream, when
-<code class="computeroutput">BZ2_bzRead</code> returns
-<code class="computeroutput">BZ_STREAM_END</code>, call
-<code class="computeroutput">BZ2_bzReadGetUnused</code> to collect
-the unused data (copy it into your own buffer somewhere).  That
-data forms the start of the next compressed stream.  To start
-uncompressing that next stream, call
-<code class="computeroutput">BZ2_bzReadOpen</code> again, feeding in
-the unused data via the <code class="computeroutput">unused</code> /
-<code class="computeroutput">nUnused</code> parameters.  Keep doing
-this until <code class="computeroutput">BZ_STREAM_END</code> return
-coincides with the physical end of file
-(<code class="computeroutput">feof(f)</code>).  In this situation
-<code class="computeroutput">BZ2_bzReadGetUnused</code> will of
-course return no data.</p>
-<p>This should give some feel for how the high-level interface
-can be used.  If you require extra flexibility, you'll have to
-bite the bullet and get to grips with the low-level
-interface.</p>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="std-rdwr"></a>3.4.9.�Standard file-reading/writing code</h3></div></div></div>
-<p>Here's how you'd write data to a compressed file:</p>
-<pre class="programlisting">FILE*   f;
-BZFILE* b;
-int     nBuf;
-char    buf[ /* whatever size you like */ ];
-int     bzerror;
-int     nWritten;
-f = fopen ( "myfile.bz2", "w" );
-if ( !f ) {
- /* handle error */
-}
-b = BZ2_bzWriteOpen( &amp;bzerror, f, 9 );
-if (bzerror != BZ_OK) {
- BZ2_bzWriteClose ( b );
- /* handle error */
-}
-while ( /* condition */ ) {
- /* get data to write into buf, and set nBuf appropriately */
- nWritten = BZ2_bzWrite ( &amp;bzerror, b, buf, nBuf );
- if (bzerror == BZ_IO_ERROR) {
-   BZ2_bzWriteClose ( &amp;bzerror, b );
-   /* handle error */
- }
-}
-BZ2_bzWriteClose( &amp;bzerror, b );
-if (bzerror == BZ_IO_ERROR) {
- /* handle error */
-}</pre>
-<p>And to read from a compressed file:</p>
-<pre class="programlisting">FILE*   f;
-BZFILE* b;
-int     nBuf;
-char    buf[ /* whatever size you like */ ];
-int     bzerror;
-int     nWritten;
-f = fopen ( "myfile.bz2", "r" );
-if ( !f ) {
-  /* handle error */
-}
-b = BZ2_bzReadOpen ( &amp;bzerror, f, 0, NULL, 0 );
-if ( bzerror != BZ_OK ) {
-  BZ2_bzReadClose ( &amp;bzerror, b );
-  /* handle error */
-}
-bzerror = BZ_OK;
-while ( bzerror == BZ_OK &amp;&amp; /* arbitrary other conditions */) {
-  nBuf = BZ2_bzRead ( &amp;bzerror, b, buf, /* size of buf */ );
-  if ( bzerror == BZ_OK ) {
-    /* do something with buf[0 .. nBuf-1] */
-  }
-}
-if ( bzerror != BZ_STREAM_END ) {
-   BZ2_bzReadClose ( &amp;bzerror, b );
-   /* handle error */
-} else {
-   BZ2_bzReadClose ( &amp;bzerror, b );
-}</pre>
-</div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="util-fns"></a>3.5.�Utility functions</h2></div></div></div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzbufftobuffcompress"></a>3.5.1.�<code class="computeroutput">BZ2_bzBuffToBuffCompress</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzBuffToBuffCompress( char*         dest,
-                              unsigned int* destLen,
-                              char*         source,
-                              unsigned int  sourceLen,
-                              int           blockSize100k,
-                              int           verbosity,
-                              int           workFactor );</pre>
-<p>Attempts to compress the data in <code class="computeroutput">source[0
-.. sourceLen-1]</code> into the destination buffer,
-<code class="computeroutput">dest[0 .. *destLen-1]</code>.  If the
-destination buffer is big enough,
-<code class="computeroutput">*destLen</code> is set to the size of
-the compressed data, and <code class="computeroutput">BZ_OK</code>
-is returned.  If the compressed data won't fit,
-<code class="computeroutput">*destLen</code> is unchanged, and
-<code class="computeroutput">BZ_OUTBUFF_FULL</code> is
-returned.</p>
-<p>Compression in this manner is a one-shot event, done with a
-single call to this function.  The resulting compressed data is a
-complete <code class="computeroutput">bzip2</code> format data
-stream.  There is no mechanism for making additional calls to
-provide extra input data.  If you want that kind of mechanism,
-use the low-level interface.</p>
-<p>For the meaning of parameters
-<code class="computeroutput">blockSize100k</code>,
-<code class="computeroutput">verbosity</code> and
-<code class="computeroutput">workFactor</code>, see
-<code class="computeroutput">BZ2_bzCompressInit</code>.</p>
-<p>To guarantee that the compressed data will fit in its
-buffer, allocate an output buffer of size 1% larger than the
-uncompressed data, plus six hundred extra bytes.</p>
-<p><code class="computeroutput">BZ2_bzBuffToBuffDecompress</code>
-will not write data at or beyond
-<code class="computeroutput">dest[*destLen]</code>, even in case of
-buffer overflow.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_CONFIG_ERROR
-  if the library has been mis-compiled
-BZ_PARAM_ERROR
-  if dest is NULL or destLen is NULL
-  or blockSize100k &lt; 1 or blockSize100k &gt; 9
-  or verbosity &lt; 0 or verbosity &gt; 4
-  or workFactor &lt; 0 or workFactor &gt; 250
-BZ_MEM_ERROR
-  if insufficient memory is available
-BZ_OUTBUFF_FULL
-  if the size of the compressed data exceeds *destLen
-BZ_OK
-  otherwise</pre>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="bzbufftobuffdecompress"></a>3.5.2.�<code class="computeroutput">BZ2_bzBuffToBuffDecompress</code></h3></div></div></div>
-<pre class="programlisting">int BZ2_bzBuffToBuffDecompress( char*         dest,
-                                unsigned int* destLen,
-                                char*         source,
-                                unsigned int  sourceLen,
-                                int           small,
-                                int           verbosity );</pre>
-<p>Attempts to decompress the data in <code class="computeroutput">source[0
-.. sourceLen-1]</code> into the destination buffer,
-<code class="computeroutput">dest[0 .. *destLen-1]</code>.  If the
-destination buffer is big enough,
-<code class="computeroutput">*destLen</code> is set to the size of
-the uncompressed data, and <code class="computeroutput">BZ_OK</code>
-is returned.  If the compressed data won't fit,
-<code class="computeroutput">*destLen</code> is unchanged, and
-<code class="computeroutput">BZ_OUTBUFF_FULL</code> is
-returned.</p>
-<p><code class="computeroutput">source</code> is assumed to hold
-a complete <code class="computeroutput">bzip2</code> format data
-stream.
-<code class="computeroutput">BZ2_bzBuffToBuffDecompress</code> tries
-to decompress the entirety of the stream into the output
-buffer.</p>
-<p>For the meaning of parameters
-<code class="computeroutput">small</code> and
-<code class="computeroutput">verbosity</code>, see
-<code class="computeroutput">BZ2_bzDecompressInit</code>.</p>
-<p>Because the compression ratio of the compressed data cannot
-be known in advance, there is no easy way to guarantee that the
-output buffer will be big enough.  You may of course make
-arrangements in your code to record the size of the uncompressed
-data, but such a mechanism is beyond the scope of this
-library.</p>
-<p><code class="computeroutput">BZ2_bzBuffToBuffDecompress</code>
-will not write data at or beyond
-<code class="computeroutput">dest[*destLen]</code>, even in case of
-buffer overflow.</p>
-<p>Possible return values:</p>
-<pre class="programlisting">BZ_CONFIG_ERROR
-  if the library has been mis-compiled
-BZ_PARAM_ERROR
-  if dest is NULL or destLen is NULL
-  or small != 0 &amp;&amp; small != 1
-  or verbosity &lt; 0 or verbosity &gt; 4
-BZ_MEM_ERROR
-  if insufficient memory is available
-BZ_OUTBUFF_FULL
-  if the size of the compressed data exceeds *destLen
-BZ_DATA_ERROR
-  if a data integrity error was detected in the compressed data
-BZ_DATA_ERROR_MAGIC
-  if the compressed data doesn't begin with the right magic bytes
-BZ_UNEXPECTED_EOF
-  if the compressed data ends unexpectedly
-BZ_OK
-  otherwise</pre>
-</div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="zlib-compat"></a>3.6.�<code class="computeroutput">zlib</code> compatibility functions</h2></div></div></div>
-<p>Yoshioka Tsuneo has contributed some functions to give
-better <code class="computeroutput">zlib</code> compatibility.
-These functions are <code class="computeroutput">BZ2_bzopen</code>,
-<code class="computeroutput">BZ2_bzread</code>,
-<code class="computeroutput">BZ2_bzwrite</code>,
-<code class="computeroutput">BZ2_bzflush</code>,
-<code class="computeroutput">BZ2_bzclose</code>,
-<code class="computeroutput">BZ2_bzerror</code> and
-<code class="computeroutput">BZ2_bzlibVersion</code>.  These
-functions are not (yet) officially part of the library.  If they
-break, you get to keep all the pieces.  Nevertheless, I think
-they work ok.</p>
-<pre class="programlisting">typedef void BZFILE;
-const char * BZ2_bzlibVersion ( void );</pre>
-<p>Returns a string indicating the library version.</p>
-<pre class="programlisting">BZFILE * BZ2_bzopen  ( const char *path, const char *mode );
-BZFILE * BZ2_bzdopen ( int        fd,    const char *mode );</pre>
-<p>Opens a <code class="computeroutput">.bz2</code> file for
-reading or writing, using either its name or a pre-existing file
-descriptor.  Analogous to <code class="computeroutput">fopen</code>
-and <code class="computeroutput">fdopen</code>.</p>
-<pre class="programlisting">int BZ2_bzread  ( BZFILE* b, void* buf, int len );
-int BZ2_bzwrite ( BZFILE* b, void* buf, int len );</pre>
-<p>Reads/writes data from/to a previously opened
-<code class="computeroutput">BZFILE</code>.  Analogous to
-<code class="computeroutput">fread</code> and
-<code class="computeroutput">fwrite</code>.</p>
-<pre class="programlisting">int  BZ2_bzflush ( BZFILE* b );
-void BZ2_bzclose ( BZFILE* b );</pre>
-<p>Flushes/closes a <code class="computeroutput">BZFILE</code>.
-<code class="computeroutput">BZ2_bzflush</code> doesn't actually do
-anything.  Analogous to <code class="computeroutput">fflush</code>
-and <code class="computeroutput">fclose</code>.</p>
-<pre class="programlisting">const char * BZ2_bzerror ( BZFILE *b, int *errnum )</pre>
-<p>Returns a string describing the more recent error status of
-<code class="computeroutput">b</code>, and also sets
-<code class="computeroutput">*errnum</code> to its numerical
-value.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="stdio-free"></a>3.7.�Using the library in a <code class="computeroutput">stdio</code>-free environment</h2></div></div></div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="stdio-bye"></a>3.7.1.�Getting rid of <code class="computeroutput">stdio</code></h3></div></div></div>
-<p>In a deeply embedded application, you might want to use
-just the memory-to-memory functions.  You can do this
-conveniently by compiling the library with preprocessor symbol
-<code class="computeroutput">BZ_NO_STDIO</code> defined.  Doing this
-gives you a library containing only the following eight
-functions:</p>
-<p><code class="computeroutput">BZ2_bzCompressInit</code>,
-<code class="computeroutput">BZ2_bzCompress</code>,
-<code class="computeroutput">BZ2_bzCompressEnd</code>
-<code class="computeroutput">BZ2_bzDecompressInit</code>,
-<code class="computeroutput">BZ2_bzDecompress</code>,
-<code class="computeroutput">BZ2_bzDecompressEnd</code>
-<code class="computeroutput">BZ2_bzBuffToBuffCompress</code>,
-<code class="computeroutput">BZ2_bzBuffToBuffDecompress</code></p>
-<p>When compiled like this, all functions will ignore
-<code class="computeroutput">verbosity</code> settings.</p>
-</div>
-<div class="sect2" lang="en">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="critical-error"></a>3.7.2.�Critical error handling</h3></div></div></div>
-<p><code class="computeroutput">libbzip2</code> contains a number
-of internal assertion checks which should, needless to say, never
-be activated.  Nevertheless, if an assertion should fail,
-behaviour depends on whether or not the library was compiled with
-<code class="computeroutput">BZ_NO_STDIO</code> set.</p>
-<p>For a normal compile, an assertion failure yields the
-message:</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>bzip2/libbzip2: internal error number N.</p>
-<p>This is a bug in bzip2/libbzip2, 1.0.5 of 10 December 2007.
-Please report it to me at: jseward@bzip.org.  If this happened
-when you were using some program which uses libbzip2 as a
-component, you should also report this bug to the author(s)
-of that program.  Please make an effort to report this bug;
-timely and accurate bug reports eventually lead to higher
-quality software.  Thanks.  Julian Seward, 10 December 2007.
-</p>
-</blockquote></div>
-<p>where <code class="computeroutput">N</code> is some error code
-number.  If <code class="computeroutput">N == 1007</code>, it also
-prints some extra text advising the reader that unreliable memory
-is often associated with internal error 1007. (This is a
-frequently-observed-phenomenon with versions 1.0.0/1.0.1).</p>
-<p><code class="computeroutput">exit(3)</code> is then
-called.</p>
-<p>For a <code class="computeroutput">stdio</code>-free library,
-assertion failures result in a call to a function declared
-as:</p>
-<pre class="programlisting">extern void bz_internal_error ( int errcode );</pre>
-<p>The relevant code is passed as a parameter.  You should
-supply such a function.</p>
-<p>In either case, once an assertion failure has occurred, any
-<code class="computeroutput">bz_stream</code> records involved can
-be regarded as invalid.  You should not attempt to resume normal
-operation with them.</p>
-<p>You may, of course, change critical error handling to suit
-your needs.  As I said above, critical errors indicate bugs in
-the library and should not occur.  All "normal" error situations
-are indicated via error return codes from functions, and can be
-recovered from.</p>
-</div>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="win-dll"></a>3.8.�Making a Windows DLL</h2></div></div></div>
-<p>Everything related to Windows has been contributed by
-Yoshioka Tsuneo
-(<code class="computeroutput">tsuneo@rr.iij4u.or.jp</code>), so
-you should send your queries to him (but perhaps Cc: me,
-<code class="computeroutput">jseward@bzip.org</code>).</p>
-<p>My vague understanding of what to do is: using Visual C++
-5.0, open the project file
-<code class="computeroutput">libbz2.dsp</code>, and build.  That's
-all.</p>
-<p>If you can't open the project file for some reason, make a
-new one, naming these files:
-<code class="computeroutput">blocksort.c</code>,
-<code class="computeroutput">bzlib.c</code>,
-<code class="computeroutput">compress.c</code>,
-<code class="computeroutput">crctable.c</code>,
-<code class="computeroutput">decompress.c</code>,
-<code class="computeroutput">huffman.c</code>,
-<code class="computeroutput">randtable.c</code> and
-<code class="computeroutput">libbz2.def</code>.  You will also need
-to name the header files <code class="computeroutput">bzlib.h</code>
-and <code class="computeroutput">bzlib_private.h</code>.</p>
-<p>If you don't use VC++, you may need to define the
-proprocessor symbol
-<code class="computeroutput">_WIN32</code>.</p>
-<p>Finally, <code class="computeroutput">dlltest.c</code> is a
-sample program using the DLL.  It has a project file,
-<code class="computeroutput">dlltest.dsp</code>.</p>
-<p>If you just want a makefile for Visual C, have a look at
-<code class="computeroutput">makefile.msc</code>.</p>
-<p>Be aware that if you compile
-<code class="computeroutput">bzip2</code> itself on Win32, you must
-set <code class="computeroutput">BZ_UNIX</code> to 0 and
-<code class="computeroutput">BZ_LCCWIN32</code> to 1, in the file
-<code class="computeroutput">bzip2.c</code>, before compiling.
-Otherwise the resulting binary won't work correctly.</p>
-<p>I haven't tried any of this stuff myself, but it all looks
-plausible.</p>
-</div>
-</div>
-<div class="chapter" lang="en">
-<div class="titlepage"><div><div><h2 class="title">
-<a name="misc"></a>4.�Miscellanea</h2></div></div></div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt><span class="sect1"><a href="#limits">4.1. Limitations of the compressed file format</a></span></dt>
-<dt><span class="sect1"><a href="#port-issues">4.2. Portability issues</a></span></dt>
-<dt><span class="sect1"><a href="#bugs">4.3. Reporting bugs</a></span></dt>
-<dt><span class="sect1"><a href="#package">4.4. Did you get the right package?</a></span></dt>
-<dt><span class="sect1"><a href="#reading">4.5. Further Reading</a></span></dt>
-</dl>
-</div>
-<p>These are just some random thoughts of mine.  Your mileage
-may vary.</p>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="limits"></a>4.1.�Limitations of the compressed file format</h2></div></div></div>
-<p><code class="computeroutput">bzip2-1.0.X</code>,
-<code class="computeroutput">0.9.5</code> and
-<code class="computeroutput">0.9.0</code> use exactly the same file
-format as the original version,
-<code class="computeroutput">bzip2-0.1</code>.  This decision was
-made in the interests of stability.  Creating yet another
-incompatible compressed file format would create further
-confusion and disruption for users.</p>
-<p>Nevertheless, this is not a painless decision.  Development
-work since the release of
-<code class="computeroutput">bzip2-0.1</code> in August 1997 has
-shown complexities in the file format which slow down
-decompression and, in retrospect, are unnecessary.  These
-are:</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p>The run-length encoder, which is the first of the
-   compression transformations, is entirely irrelevant.  The
-   original purpose was to protect the sorting algorithm from the
-   very worst case input: a string of repeated symbols.  But
-   algorithm steps Q6a and Q6b in the original Burrows-Wheeler
-   technical report (SRC-124) show how repeats can be handled
-   without difficulty in block sorting.</p></li>
-<li style="list-style-type: disc">
-<p>The randomisation mechanism doesn't really need to be
-   there.  Udi Manber and Gene Myers published a suffix array
-   construction algorithm a few years back, which can be employed
-   to sort any block, no matter how repetitive, in O(N log N)
-   time.  Subsequent work by Kunihiko Sadakane has produced a
-   derivative O(N (log N)^2) algorithm which usually outperforms
-   the Manber-Myers algorithm.</p>
-<p>I could have changed to Sadakane's algorithm, but I find
-   it to be slower than <code class="computeroutput">bzip2</code>'s
-   existing algorithm for most inputs, and the randomisation
-   mechanism protects adequately against bad cases.  I didn't
-   think it was a good tradeoff to make.  Partly this is due to
-   the fact that I was not flooded with email complaints about
-   <code class="computeroutput">bzip2-0.1</code>'s performance on
-   repetitive data, so perhaps it isn't a problem for real
-   inputs.</p>
-<p>Probably the best long-term solution, and the one I have
-   incorporated into 0.9.5 and above, is to use the existing
-   sorting algorithm initially, and fall back to a O(N (log N)^2)
-   algorithm if the standard algorithm gets into
-   difficulties.</p>
-</li>
-<li style="list-style-type: disc"><p>The compressed file format was never designed to be
-   handled by a library, and I have had to jump though some hoops
-   to produce an efficient implementation of decompression.  It's
-   a bit hairy.  Try passing
-   <code class="computeroutput">decompress.c</code> through the C
-   preprocessor and you'll see what I mean.  Much of this
-   complexity could have been avoided if the compressed size of
-   each block of data was recorded in the data stream.</p></li>
-<li style="list-style-type: disc"><p>An Adler-32 checksum, rather than a CRC32 checksum,
-   would be faster to compute.</p></li>
-</ul></div>
-<p>It would be fair to say that the
-<code class="computeroutput">bzip2</code> format was frozen before I
-properly and fully understood the performance consequences of
-doing so.</p>
-<p>Improvements which I was able to incorporate into 0.9.0,
-despite using the same file format, are:</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc"><p>Single array implementation of the inverse BWT.  This
-  significantly speeds up decompression, presumably because it
-  reduces the number of cache misses.</p></li>
-<li style="list-style-type: disc"><p>Faster inverse MTF transform for large MTF values.
-  The new implementation is based on the notion of sliding blocks
-  of values.</p></li>
-<li style="list-style-type: disc"><p><code class="computeroutput">bzip2-0.9.0</code> now reads
-  and writes files with <code class="computeroutput">fread</code>
-  and <code class="computeroutput">fwrite</code>; version 0.1 used
-  <code class="computeroutput">putc</code> and
-  <code class="computeroutput">getc</code>.  Duh!  Well, you live
-  and learn.</p></li>
-</ul></div>
-<p>Further ahead, it would be nice to be able to do random
-access into files.  This will require some careful design of
-compressed file formats.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="port-issues"></a>4.2.�Portability issues</h2></div></div></div>
-<p>After some consideration, I have decided not to use GNU
-<code class="computeroutput">autoconf</code> to configure 0.9.5 or
-1.0.</p>
-<p><code class="computeroutput">autoconf</code>, admirable and
-wonderful though it is, mainly assists with portability problems
-between Unix-like platforms.  But
-<code class="computeroutput">bzip2</code> doesn't have much in the
-way of portability problems on Unix; most of the difficulties
-appear when porting to the Mac, or to Microsoft's operating
-systems.  <code class="computeroutput">autoconf</code> doesn't help
-in those cases, and brings in a whole load of new
-complexity.</p>
-<p>Most people should be able to compile the library and
-program under Unix straight out-of-the-box, so to speak,
-especially if you have a version of GNU C available.</p>
-<p>There are a couple of
-<code class="computeroutput">__inline__</code> directives in the
-code.  GNU C (<code class="computeroutput">gcc</code>) should be
-able to handle them.  If you're not using GNU C, your C compiler
-shouldn't see them at all.  If your compiler does, for some
-reason, see them and doesn't like them, just
-<code class="computeroutput">#define</code>
-<code class="computeroutput">__inline__</code> to be
-<code class="computeroutput">/* */</code>.  One easy way to do this
-is to compile with the flag
-<code class="computeroutput">-D__inline__=</code>, which should be
-understood by most Unix compilers.</p>
-<p>If you still have difficulties, try compiling with the
-macro <code class="computeroutput">BZ_STRICT_ANSI</code> defined.
-This should enable you to build the library in a strictly ANSI
-compliant environment.  Building the program itself like this is
-dangerous and not supported, since you remove
-<code class="computeroutput">bzip2</code>'s checks against
-compressing directories, symbolic links, devices, and other
-not-really-a-file entities.  This could cause filesystem
-corruption!</p>
-<p>One other thing: if you create a
-<code class="computeroutput">bzip2</code> binary for public distribution,
-please consider linking it statically (<code class="computeroutput">gcc
--static</code>).  This avoids all sorts of library-version
-issues that others may encounter later on.</p>
-<p>If you build <code class="computeroutput">bzip2</code> on
-Win32, you must set <code class="computeroutput">BZ_UNIX</code> to 0
-and <code class="computeroutput">BZ_LCCWIN32</code> to 1, in the
-file <code class="computeroutput">bzip2.c</code>, before compiling.
-Otherwise the resulting binary won't work correctly.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="bugs"></a>4.3.�Reporting bugs</h2></div></div></div>
-<p>I tried pretty hard to make sure
-<code class="computeroutput">bzip2</code> is bug free, both by
-design and by testing.  Hopefully you'll never need to read this
-section for real.</p>
-<p>Nevertheless, if <code class="computeroutput">bzip2</code> dies
-with a segmentation fault, a bus error or an internal assertion
-failure, it will ask you to email me a bug report.  Experience from
-years of feedback of bzip2 users indicates that almost all these
-problems can be traced to either compiler bugs or hardware
-problems.</p>
-<div class="itemizedlist"><ul type="bullet">
-<li style="list-style-type: disc">
-<p>Recompile the program with no optimisation, and
-  see if it works.  And/or try a different compiler.  I heard all
-  sorts of stories about various flavours of GNU C (and other
-  compilers) generating bad code for
-  <code class="computeroutput">bzip2</code>, and I've run across two
-  such examples myself.</p>
-<p>2.7.X versions of GNU C are known to generate bad code
-  from time to time, at high optimisation levels.  If you get
-  problems, try using the flags
-  <code class="computeroutput">-O2</code>
-  <code class="computeroutput">-fomit-frame-pointer</code>
-  <code class="computeroutput">-fno-strength-reduce</code>.  You
-  should specifically <span class="emphasis"><em>not</em></span> use
-  <code class="computeroutput">-funroll-loops</code>.</p>
-<p>You may notice that the Makefile runs six tests as part
-  of the build process.  If the program passes all of these, it's
-  a pretty good (but not 100%) indication that the compiler has
-  done its job correctly.</p>
-</li>
-<li style="list-style-type: disc">
-<p>If <code class="computeroutput">bzip2</code>
-  crashes randomly, and the crashes are not repeatable, you may
-  have a flaky memory subsystem.
-  <code class="computeroutput">bzip2</code> really hammers your
-  memory hierarchy, and if it's a bit marginal, you may get these
-  problems.  Ditto if your disk or I/O subsystem is slowly
-  failing.  Yup, this really does happen.</p>
-<p>Try using a different machine of the same type, and see
-  if you can repeat the problem.</p>
-</li>
-<li style="list-style-type: disc"><p>This isn't really a bug, but ... If
-  <code class="computeroutput">bzip2</code> tells you your file is
-  corrupted on decompression, and you obtained the file via FTP,
-  there is a possibility that you forgot to tell FTP to do a
-  binary mode transfer.  That absolutely will cause the file to
-  be non-decompressible.  You'll have to transfer it
-  again.</p></li>
-</ul></div>
-<p>If you've incorporated
-<code class="computeroutput">libbzip2</code> into your own program
-and are getting problems, please, please, please, check that the
-parameters you are passing in calls to the library, are correct,
-and in accordance with what the documentation says is allowable.
-I have tried to make the library robust against such problems,
-but I'm sure I haven't succeeded.</p>
-<p>Finally, if the above comments don't help, you'll have to
-send me a bug report.  Now, it's just amazing how many people
-will send me a bug report saying something like:</p>
-<pre class="programlisting">bzip2 crashed with segmentation fault on my machine</pre>
-<p>and absolutely nothing else.  Needless to say, a such a
-report is <span class="emphasis"><em>totally, utterly, completely and
-comprehensively 100% useless; a waste of your time, my time, and
-net bandwidth</em></span>.  With no details at all, there's no way
-I can possibly begin to figure out what the problem is.</p>
-<p>The rules of the game are: facts, facts, facts.  Don't omit
-them because "oh, they won't be relevant".  At the bare
-minimum:</p>
-<pre class="programlisting">Machine type.  Operating system version.
-Exact version of bzip2 (do bzip2 -V).
-Exact version of the compiler used.
-Flags passed to the compiler.</pre>
-<p>However, the most important single thing that will help me
-is the file that you were trying to compress or decompress at the
-time the problem happened.  Without that, my ability to do
-anything more than speculate about the cause, is limited.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="package"></a>4.4.�Did you get the right package?</h2></div></div></div>
-<p><code class="computeroutput">bzip2</code> is a resource hog.
-It soaks up large amounts of CPU cycles and memory.  Also, it
-gives very large latencies.  In the worst case, you can feed many
-megabytes of uncompressed data into the library before getting
-any compressed output, so this probably rules out applications
-requiring interactive behaviour.</p>
-<p>These aren't faults of my implementation, I hope, but more
-an intrinsic property of the Burrows-Wheeler transform
-(unfortunately).  Maybe this isn't what you want.</p>
-<p>If you want a compressor and/or library which is faster,
-uses less memory but gets pretty good compression, and has
-minimal latency, consider Jean-loup Gailly's and Mark Adler's
-work, <code class="computeroutput">zlib-1.2.1</code> and
-<code class="computeroutput">gzip-1.2.4</code>.  Look for them at
-<a href="http://www.zlib.org" target="_top">http://www.zlib.org</a> and
-<a href="http://www.gzip.org" target="_top">http://www.gzip.org</a>
-respectively.</p>
-<p>For something faster and lighter still, you might try Markus F
-X J Oberhumer's <code class="computeroutput">LZO</code> real-time
-compression/decompression library, at
-<a href="http://www.oberhumer.com/opensource" target="_top">http://www.oberhumer.com/opensource</a>.</p>
-</div>
-<div class="sect1" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="reading"></a>4.5.�Further Reading</h2></div></div></div>
-<p><code class="computeroutput">bzip2</code> is not research
-work, in the sense that it doesn't present any new ideas.
-Rather, it's an engineering exercise based on existing
-ideas.</p>
-<p>Four documents describe essentially all the ideas behind
-<code class="computeroutput">bzip2</code>:</p>
-<div class="literallayout"><p>Michael�Burrows�and�D.�J.�Wheeler:<br>
-��"A�block-sorting�lossless�data�compression�algorithm"<br>
-���10th�May�1994.�<br>
-���Digital�SRC�Research�Report�124.<br>
-���ftp://ftp.digital.com/pub/DEC/SRC/research-reports/SRC-124.ps.gz<br>
-���If�you�have�trouble�finding�it,�try�searching�at�the<br>
-���New�Zealand�Digital�Library,�http://www.nzdl.org.<br>
-<br>
-Daniel�S.�Hirschberg�and�Debra�A.�LeLewer<br>
-��"Efficient�Decoding�of�Prefix�Codes"<br>
-���Communications�of�the�ACM,�April�1990,�Vol�33,�Number�4.<br>
-���You�might�be�able�to�get�an�electronic�copy�of�this<br>
-���from�the�ACM�Digital�Library.<br>
-<br>
-David�J.�Wheeler<br>
-���Program�bred3.c�and�accompanying�document�bred3.ps.<br>
-���This�contains�the�idea�behind�the�multi-table�Huffman�coding�scheme.<br>
-���ftp://ftp.cl.cam.ac.uk/users/djw3/<br>
-<br>
-Jon�L.�Bentley�and�Robert�Sedgewick<br>
-��"Fast�Algorithms�for�Sorting�and�Searching�Strings"<br>
-���Available�from�Sedgewick's�web�page,<br>
-���www.cs.princeton.edu/~rs<br>
-</p></div>
-<p>The following paper gives valuable additional insights into
-the algorithm, but is not immediately the basis of any code used
-in bzip2.</p>
-<div class="literallayout"><p>Peter�Fenwick:<br>
-���Block�Sorting�Text�Compression<br>
-���Proceedings�of�the�19th�Australasian�Computer�Science�Conference,<br>
-�����Melbourne,�Australia.��Jan�31�-�Feb�2,�1996.<br>
-���ftp://ftp.cs.auckland.ac.nz/pub/peter-f/ACSC96paper.ps</p></div>
-<p>Kunihiko Sadakane's sorting algorithm, mentioned above, is
-available from:</p>
-<div class="literallayout"><p>http://naomi.is.s.u-tokyo.ac.jp/~sada/papers/Sada98b.ps.gz<br>
-</p></div>
-<p>The Manber-Myers suffix array construction algorithm is
-described in a paper available from:</p>
-<div class="literallayout"><p>http://www.cs.arizona.edu/people/gene/PAPERS/suffix.ps<br>
-</p></div>
-<p>Finally, the following papers document some
-investigations I made into the performance of sorting
-and decompression algorithms:</p>
-<div class="literallayout"><p>Julian�Seward<br>
-���On�the�Performance�of�BWT�Sorting�Algorithms<br>
-���Proceedings�of�the�IEEE�Data�Compression�Conference�2000<br>
-�����Snowbird,�Utah.��28-30�March�2000.<br>
-<br>
-Julian�Seward<br>
-���Space-time�Tradeoffs�in�the�Inverse�B-W�Transform<br>
-���Proceedings�of�the�IEEE�Data�Compression�Conference�2001<br>
-�����Snowbird,�Utah.��27-29�March�2001.<br>
-</p></div>
-</div>
-</div>
-</div></body>
-</html>