diff --git a/.gitattributes b/.gitattributes
new file mode 100644
index 0000000..1ff0c42
--- /dev/null
+++ b/.gitattributes
@@ -0,0 +1,63 @@
+###############################################################################
+# Set default behavior to automatically normalize line endings.
+###############################################################################
+* text=auto
+
+###############################################################################
+# Set default behavior for command prompt diff.
+#
+# This is need for earlier builds of msysgit that does not have it on by
+# default for csharp files.
+# Note: This is only used by command line
+###############################################################################
+#*.cs diff=csharp
+
+###############################################################################
+# Set the merge driver for project and solution files
+#
+# Merging from the command prompt will add diff markers to the files if there
+# are conflicts (Merging from VS is not affected by the settings below, in VS
+# the diff markers are never inserted). Diff markers may cause the following
+# file extensions to fail to load in VS. An alternative would be to treat
+# these files as binary and thus will always conflict and require user
+# intervention with every merge. To do so, just uncomment the entries below
+###############################################################################
+#*.sln merge=binary
+#*.csproj merge=binary
+#*.vbproj merge=binary
+#*.vcxproj merge=binary
+#*.vcproj merge=binary
+#*.dbproj merge=binary
+#*.fsproj merge=binary
+#*.lsproj merge=binary
+#*.wixproj merge=binary
+#*.modelproj merge=binary
+#*.sqlproj merge=binary
+#*.wwaproj merge=binary
+
+###############################################################################
+# behavior for image files
+#
+# image files are treated as binary by default.
+###############################################################################
+#*.jpg binary
+#*.png binary
+#*.gif binary
+
+###############################################################################
+# diff behavior for common document formats
+#
+# Convert binary document formats to text before diffing them. This feature
+# is only available from the command line. Turn it on by uncommenting the
+# entries below.
+###############################################################################
+#*.doc diff=astextplain
+#*.DOC diff=astextplain
+#*.docx diff=astextplain
+#*.DOCX diff=astextplain
+#*.dot diff=astextplain
+#*.DOT diff=astextplain
+#*.pdf diff=astextplain
+#*.PDF diff=astextplain
+#*.rtf diff=astextplain
+#*.RTF diff=astextplain
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..4ce6fdd
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,340 @@
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+##
+## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore
+
+# User-specific files
+*.rsuser
+*.suo
+*.user
+*.userosscache
+*.sln.docstates
+
+# User-specific files (MonoDevelop/Xamarin Studio)
+*.userprefs
+
+# Build results
+[Dd]ebug/
+[Dd]ebugPublic/
+[Rr]elease/
+[Rr]eleases/
+x64/
+x86/
+[Aa][Rr][Mm]/
+[Aa][Rr][Mm]64/
+bld/
+[Bb]in/
+[Oo]bj/
+[Ll]og/
+
+# Visual Studio 2015/2017 cache/options directory
+.vs/
+# Uncomment if you have tasks that create the project's static files in wwwroot
+#wwwroot/
+
+# Visual Studio 2017 auto generated files
+Generated\ Files/
+
+# MSTest test Results
+[Tt]est[Rr]esult*/
+[Bb]uild[Ll]og.*
+
+# NUNIT
+*.VisualState.xml
+TestResult.xml
+
+# Build Results of an ATL Project
+[Dd]ebugPS/
+[Rr]eleasePS/
+dlldata.c
+
+# Benchmark Results
+BenchmarkDotNet.Artifacts/
+
+# .NET Core
+project.lock.json
+project.fragment.lock.json
+artifacts/
+
+# StyleCop
+StyleCopReport.xml
+
+# Files built by Visual Studio
+*_i.c
+*_p.c
+*_h.h
+*.ilk
+*.meta
+*.obj
+*.iobj
+*.pch
+*.pdb
+*.ipdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.tmp_proj
+*_wpftmp.csproj
+*.log
+*.vspscc
+*.vssscc
+.builds
+*.pidb
+*.svclog
+*.scc
+
+# Chutzpah Test files
+_Chutzpah*
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opendb
+*.opensdf
+*.sdf
+*.cachefile
+*.VC.db
+*.VC.VC.opendb
+
+# Visual Studio profiler
+*.psess
+*.vsp
+*.vspx
+*.sap
+
+# Visual Studio Trace Files
+*.e2e
+
+# TFS 2012 Local Workspace
+$tf/
+
+# Guidance Automation Toolkit
+*.gpState
+
+# ReSharper is a .NET coding add-in
+_ReSharper*/
+*.[Rr]e[Ss]harper
+*.DotSettings.user
+
+# JustCode is a .NET coding add-in
+.JustCode
+
+# TeamCity is a build add-in
+_TeamCity*
+
+# DotCover is a Code Coverage Tool
+*.dotCover
+
+# AxoCover is a Code Coverage Tool
+.axoCover/*
+!.axoCover/settings.json
+
+# Visual Studio code coverage results
+*.coverage
+*.coveragexml
+
+# NCrunch
+_NCrunch_*
+.*crunch*.local.xml
+nCrunchTemp_*
+
+# MightyMoose
+*.mm.*
+AutoTest.Net/
+
+# Web workbench (sass)
+.sass-cache/
+
+# Installshield output folder
+[Ee]xpress/
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish/
+
+# Publish Web Output
+*.[Pp]ublish.xml
+*.azurePubxml
+# Note: Comment the next line if you want to checkin your web deploy settings,
+# but database connection strings (with potential passwords) will be unencrypted
+*.pubxml
+*.publishproj
+
+# Microsoft Azure Web App publish settings. Comment the next line if you want to
+# checkin your Azure Web App publish settings, but sensitive information contained
+# in these scripts will be unencrypted
+PublishScripts/
+
+# NuGet Packages
+*.nupkg
+# The packages folder can be ignored because of Package Restore
+**/[Pp]ackages/*
+# except build/, which is used as an MSBuild target.
+!**/[Pp]ackages/build/
+# Uncomment if necessary however generally it will be regenerated when needed
+#!**/[Pp]ackages/repositories.config
+# NuGet v3's project.json files produces more ignorable files
+*.nuget.props
+*.nuget.targets
+
+# Microsoft Azure Build Output
+csx/
+*.build.csdef
+
+# Microsoft Azure Emulator
+ecf/
+rcf/
+
+# Windows Store app package directories and files
+AppPackages/
+BundleArtifacts/
+Package.StoreAssociation.xml
+_pkginfo.txt
+*.appx
+
+# Visual Studio cache files
+# files ending in .cache can be ignored
+*.[Cc]ache
+# but keep track of directories ending in .cache
+!?*.[Cc]ache/
+
+# Others
+ClientBin/
+~$*
+*~
+*.dbmdl
+*.dbproj.schemaview
+*.jfm
+*.pfx
+*.publishsettings
+orleans.codegen.cs
+
+# Including strong name files can present a security risk
+# (https://github.com/github/gitignore/pull/2483#issue-259490424)
+#*.snk
+
+# Since there are multiple workflows, uncomment next line to ignore bower_components
+# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)
+#bower_components/
+
+# RIA/Silverlight projects
+Generated_Code/
+
+# Backup & report files from converting an old project file
+# to a newer Visual Studio version. Backup files are not needed,
+# because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+UpgradeLog*.htm
+ServiceFabricBackup/
+*.rptproj.bak
+
+# SQL Server files
+*.mdf
+*.ldf
+*.ndf
+
+# Business Intelligence projects
+*.rdl.data
+*.bim.layout
+*.bim_*.settings
+*.rptproj.rsuser
+*- Backup*.rdl
+
+# Microsoft Fakes
+FakesAssemblies/
+
+# GhostDoc plugin setting file
+*.GhostDoc.xml
+
+# Node.js Tools for Visual Studio
+.ntvs_analysis.dat
+node_modules/
+
+# Visual Studio 6 build log
+*.plg
+
+# Visual Studio 6 workspace options file
+*.opt
+
+# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)
+*.vbw
+
+# Visual Studio LightSwitch build output
+**/*.HTMLClient/GeneratedArtifacts
+**/*.DesktopClient/GeneratedArtifacts
+**/*.DesktopClient/ModelManifest.xml
+**/*.Server/GeneratedArtifacts
+**/*.Server/ModelManifest.xml
+_Pvt_Extensions
+
+# Paket dependency manager
+.paket/paket.exe
+paket-files/
+
+# FAKE - F# Make
+.fake/
+
+# JetBrains Rider
+.idea/
+*.sln.iml
+
+# CodeRush personal settings
+.cr/personal
+
+# Python Tools for Visual Studio (PTVS)
+__pycache__/
+*.pyc
+
+# Cake - Uncomment if you are using it
+# tools/**
+# !tools/packages.config
+
+# Tabs Studio
+*.tss
+
+# Telerik's JustMock configuration file
+*.jmconfig
+
+# BizTalk build output
+*.btp.cs
+*.btm.cs
+*.odx.cs
+*.xsd.cs
+
+# OpenCover UI analysis results
+OpenCover/
+
+# Azure Stream Analytics local run output
+ASALocalRun/
+
+# MSBuild Binary and Structured Log
+*.binlog
+
+# NVidia Nsight GPU debugger configuration file
+*.nvuser
+
+# MFractors (Xamarin productivity tool) working folder
+.mfractor/
+
+# Local History for Visual Studio
+.localhistory/
+
+# BeatPulse healthcheck temp database
+healthchecksdb
\ No newline at end of file
diff --git a/TinyOPDS.csproj b/TinyOPDS.csproj
new file mode 100644
index 0000000..66344df
--- /dev/null
+++ b/TinyOPDS.csproj
@@ -0,0 +1,235 @@
+
+
+
+ Debug
+ AnyCPU
+ 8.0.30703
+ 2.0
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}
+ WinExe
+ Properties
+ TinyOPDS
+ TinyOPDS
+ v4.0
+ 512
+ false
+
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ true
+ Svn
+ Svn
+ Svn
+ SubversionScc
+
+
+ true
+ bin\Debug\
+ DEBUG;TRACE
+ full
+ AnyCPU
+ bin\Debug\TinyOPDS.exe.CodeAnalysisLog.xml
+ true
+ GlobalSuppressions.cs
+ prompt
+ ;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Sets
+ true
+ ;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules
+ true
+ false
+
+
+ bin\Release\
+ TRACE
+ true
+ pdbonly
+ AnyCPU
+ bin\Release\TinyOPDS.exe.CodeAnalysisLog.xml
+ true
+ GlobalSuppressions.cs
+ prompt
+ ;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Sets
+ true
+ ;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules
+ true
+ true
+
+
+ TinyOPDS.ico
+
+
+ true
+ bin\Debug\
+ CODE_ANALYSIS;DEBUG;TRACE
+ full
+ AnyCPU
+ false
+ bin\Debug\TinyOPDS.exe.CodeAnalysisLog.xml
+ true
+ GlobalSuppressions.cs
+ prompt
+ MinimumRecommendedRules.ruleset
+ ;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Sets
+ true
+ ;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules
+ true
+
+
+ TinyOPDS.Program
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Form
+
+
+ MainForm.cs
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ MainForm.cs
+
+
+ ResXFileCodeGenerator
+ Resources.Designer.cs
+ Designer
+
+
+ True
+ Resources.resx
+ True
+
+
+
+ SettingsSingleFileGenerator
+ Settings.Designer.cs
+
+
+ True
+ Settings.settings
+ True
+
+
+
+
+
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ SQL Server Compact 3.5 SP2
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}
+ Zip Reduced
+
+
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}
+ ePubReader
+
+
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}
+ FB2Library
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/TinyOPDS.sln b/TinyOPDS.sln
new file mode 100644
index 0000000..0fea374
--- /dev/null
+++ b/TinyOPDS.sln
@@ -0,0 +1,80 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio 2012
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "TinyOPDS", "TinyOPDS\TinyOPDS.csproj", "{D4508020-1E2C-4D8E-B879-77D5C213E8EC}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ePubReader", "ePubReader\ePubReader\ePubReader.csproj", "{B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "FB2Library", "fb2library\FB2Library.csproj", "{4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zip Reduced", "dotNetZip\Zip Reduced\Zip Reduced.csproj", "{49A128D3-C3F2-46B1-8F7A-EECD209EA860}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "TinyOPDSConsole", "TinyOPDSConsole\TinyOPDSConsole.csproj", "{5A92FA9B-B91C-48F4-9488-77103868D226}"
+EndProject
+Global
+ GlobalSection(SubversionScc) = preSolution
+ Svn-Managed = True
+ Manager = AnkhSVN - Subversion Support for Visual Studio
+ EndGlobalSection
+ GlobalSection(SolutionConfigurationPlatforms) = preSolution
+ Debug|Any CPU = Debug|Any CPU
+ Debug|x86 = Debug|x86
+ Full debug|Any CPU = Full debug|Any CPU
+ Full debug|x86 = Full debug|x86
+ Release|Any CPU = Release|Any CPU
+ Release|x86 = Release|x86
+ EndGlobalSection
+ GlobalSection(ProjectConfigurationPlatforms) = postSolution
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Full debug|Any CPU.ActiveCfg = Full debug|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Full debug|Any CPU.Build.0 = Full debug|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Full debug|x86.ActiveCfg = Full debug|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Release|Any CPU.Build.0 = Release|Any CPU
+ {D4508020-1E2C-4D8E-B879-77D5C213E8EC}.Release|x86.ActiveCfg = Release|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Full debug|Any CPU.ActiveCfg = Full debug|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Full debug|Any CPU.Build.0 = Full debug|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Full debug|x86.ActiveCfg = Full debug|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Release|Any CPU.Build.0 = Release|Any CPU
+ {B5D1C9DA-D5F6-42CD-B639-E6796DD2BDBB}.Release|x86.ActiveCfg = Release|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Debug|x86.ActiveCfg = Debug|x86
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Debug|x86.Build.0 = Debug|x86
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Full debug|Any CPU.ActiveCfg = Full debug|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Full debug|Any CPU.Build.0 = Full debug|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Full debug|x86.ActiveCfg = Full debug|x86
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Full debug|x86.Build.0 = Full debug|x86
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Release|Any CPU.Build.0 = Release|Any CPU
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Release|x86.ActiveCfg = Release|x86
+ {4DEC5888-E71A-4D00-93B7-7F11C92D0A3F}.Release|x86.Build.0 = Release|x86
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Full debug|Any CPU.ActiveCfg = Full debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Full debug|Any CPU.Build.0 = Full debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Full debug|x86.ActiveCfg = Full debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|Any CPU.Build.0 = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|x86.ActiveCfg = Release|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Full debug|Any CPU.ActiveCfg = Release|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Full debug|Any CPU.Build.0 = Release|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Full debug|x86.ActiveCfg = Release|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Release|Any CPU.Build.0 = Release|Any CPU
+ {5A92FA9B-B91C-48F4-9488-77103868D226}.Release|x86.ActiveCfg = Release|Any CPU
+ EndGlobalSection
+ GlobalSection(SolutionProperties) = preSolution
+ HideSolutionNode = FALSE
+ EndGlobalSection
+EndGlobal
diff --git a/TinyOPDS/TinyOPDS.csproj b/TinyOPDS/TinyOPDS.csproj
index d0a0ab5..6278090 100644
--- a/TinyOPDS/TinyOPDS.csproj
+++ b/TinyOPDS/TinyOPDS.csproj
@@ -43,7 +43,6 @@
trueGlobalSuppressions.csprompt
- MinimumRecommendedRules.ruleset;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Setstrue;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules
@@ -60,7 +59,6 @@
trueGlobalSuppressions.csprompt
- MinimumRecommendedRules.ruleset;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Setstrue;C:\Program Files\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules
diff --git a/dotNetZip/.tfs-ignore b/dotNetZip/.tfs-ignore
new file mode 100644
index 0000000..278ac78
--- /dev/null
+++ b/dotNetZip/.tfs-ignore
@@ -0,0 +1,32 @@
+
+ bin
+ obj
+ TestResults
+ notused
+ _UpgradeReport_Files
+ Backup
+ UpgradeLog.XML
+ CodePlex-Readme.txt
+ License.rtf
+ FixProps.ps1
+ makeSrcZip.bat
+ MakeReleaseZips.bat
+ clean.ps1
+ AppNote.txt
+ Todo.txt
+ MakeZipUtils.ps1
+ SetVersion.ps1
+ Help
+ LastBuild.log
+ _Resharper*
+ Debug
+ Release
+ *.resharper
+ *.cache
+ *.suo
+ *.user
+ #*.*#
+ *.*~
+ *.zip
+
+
\ No newline at end of file
diff --git a/dotNetZip/AppNote.iz.txt b/dotNetZip/AppNote.iz.txt
new file mode 100644
index 0000000..362f31f
--- /dev/null
+++ b/dotNetZip/AppNote.iz.txt
@@ -0,0 +1,3686 @@
+[Info-ZIP note, 20040528: this file is based on PKWARE's appnote.txt of
+ 15 February 1996, taking into account PKWARE's revised appnote.txt
+ version 6.2.0 of 26 April 2004. It has been unofficially corrected
+ and extended by Info-ZIP without explicit permission by PKWARE.
+ Although Info-ZIP believes the information to be accurate and complete,
+ it is provided under a disclaimer similar to the PKWARE disclaimer below,
+ differing only in the substitution of "Info-ZIP" for "PKWARE". In other
+ words, use this information at your own risk, but we think it's correct.
+
+ Specification info from PKWARE that was obviously wrong has been corrected
+ silently (e.g. missing structure fields, wrong numbers).
+ As of PKZIPW 2.50, two new incompatibilities have been introduced by PKWARE;
+ they are noted below. Note that the "NTFS tag" conflict is currently not
+ real; PKZIPW 2.50 actually tags NTFS files as having come from a FAT
+ file system, too.]
+
+File: APPNOTE.TXT - .ZIP File Format Specification
+Version: 6.2.0 - NOTIFICATION OF CHANGE
+Revised: 04/26/2004 [2004-05-28 Info-ZIP]
+Copyright (c) 1989 - 2004 PKWARE Inc., All Rights Reserved.
+
+I. Purpose
+----------
+
+This specification is intended to define a cross-platform,
+interoperable file format. Since its first publication
+in 1989, PKWARE has remained committed to ensuring the
+interoperability of the .ZIP file format through this
+specification. We trust that all .ZIP compatible vendors
+and application developers that have adopted this format
+will share and support this commitment.
+
+
+II. Disclaimer
+--------------
+
+Although PKWARE will attempt to supply current and accurate
+information relating to its file formats, algorithms, and the
+subject programs, the possibility of error or omission can not
+be eliminated. PKWARE therefore expressly disclaims any warranty
+that the information contained in the associated materials relating
+to the subject programs and/or the format of the files created or
+accessed by the subject programs and/or the algorithms used by
+the subject programs, or any other matter, is current, correct or
+accurate as delivered. Any risk of damage due to any possible
+inaccurate information is assumed by the user of the information.
+Furthermore, the information relating to the subject programs
+and/or the file formats created or accessed by the subject
+programs and/or the algorithms used by the subject programs is
+subject to change without notice.
+
+If the version of this file is marked as a NOTIFICATION OF CHANGE,
+the content defines an Early Feature Specification (EFS) change
+to the .ZIP file format that may be subject to modification prior
+to publication of the Final Feature Specification (FFS). This
+document may also contain information on Planned Feature
+Specifications (PFS) defining recognized future extensions.
+
+
+III. Change Log
+---------------
+
+Version Change Description Date
+------- ------------------ ----------
+5.2 -Single Password Symmetric Encryption 06/02/2003
+ storage
+
+6.1.0 -Smart Card compatibility 01/20/2004
+ -Documentation on certificate storage
+
+6.2.0 -Introduction of Central Directory 04/26/2004
+ Encryption for encrypting metadata
+ -Added OS/X to Version Made By values
+
+
+IV. General Format of a .ZIP file
+---------------------------------
+
+ Files stored in arbitrary order. Large .ZIP files can span multiple
+ diskette media or be split into user-defined segment sizes. [The
+ minimum user-defined segment size for a split .ZIP file is 64K.
+ (removed by PKWare 2003-06-01)]
+
+ Overall .ZIP file format:
+
+ [local file header 1]
+ [file data 1]
+ [data descriptor 1]
+ .
+ .
+ .
+ [local file header n]
+ [file data n]
+ [data descriptor n]
+ [archive decryption header] (EFS)
+ [archive extra data record] (EFS)
+ [central directory]
+ [zip64 end of central directory record]
+ [zip64 end of central directory locator]
+ [end of central directory record]
+
+
+ A. Local file header:
+
+ local file header signature 4 bytes (0x04034b50)
+ version needed to extract 2 bytes
+ general purpose bit flag 2 bytes
+ compression method 2 bytes
+ last mod file time 2 bytes
+ last mod file date 2 bytes
+ crc-32 4 bytes
+ compressed size 4 bytes
+ uncompressed size 4 bytes
+ file name length 2 bytes
+ extra field length 2 bytes
+
+ file name (variable size)
+ extra field (variable size)
+
+
+ B. File data
+
+ Immediately following the local header for a file
+ is the compressed or stored data for the file.
+ The series of [local file header][file data][data
+ descriptor] repeats for each file in the .ZIP archive.
+
+
+ C. Data descriptor:
+
+ [Info-ZIP discrepancy:
+ The Info-ZIP zip program starts the data descriptor with a 4-byte
+ PK-style signature. Despite the specification, none of the PKWARE
+ programs supports the data descriptor. PKZIP 4.0 -fix function
+ (and PKZIPFIX 2.04) ignores the data descriptor info even when bit 3
+ of the general purpose bit flag is set.
+ data descriptor signature 4 bytes (0x08074b50)
+ ]
+ crc-32 4 bytes
+ compressed size 4 bytes
+ uncompressed size 4 bytes
+
+ This descriptor exists only if bit 3 of the general
+ purpose bit flag is set (see below). It is byte aligned
+ and immediately follows the last byte of compressed data.
+ This descriptor is used only when it was not possible to
+ seek in the output .ZIP file, e.g., when the output .ZIP file
+ was standard output or a non seekable device. For Zip64 format
+ archives, the compressed and uncompressed sizes are 8 bytes each.
+
+
+ D. Archive decryption header: (EFS)
+
+ The Archive Decryption Header is introduced in version 6.2
+ of the ZIP format specification. This record exists in support
+ of the Central Directory Encryption Feature implemented as part of
+ the Strong Encryption Specification as described in this document.
+ When the Central Directory Structure is encrypted, this decryption
+ header will precede the encrypted data segment. The encrypted
+ data segment will consist of the Archive extra data record (if
+ present) and the encrypted Central Directory Structure data.
+ The format of this data record is identical to the Decryption
+ header record preceding compressed file data. If the central
+ directory structure is encrypted, the location of the start of
+ this data record is determined using the Start of Central Directory
+ field in the Zip64 End of Central Directory record. Refer to the
+ section on the Strong Encryption Specification for information
+ on the fields used in the Archive Decryption Header record.
+
+
+ E. Archive extra data record: (EFS)
+
+ archive extra data signature 4 bytes (0x08064b50)
+ extra field length 4 bytes
+ extra field data (variable size)
+
+ The Archive Extra Data Record is introduced in version 6.2
+ of the ZIP format specification. This record exists in support
+ of the Central Directory Encryption Feature implemented as part of
+ the Strong Encryption Specification as described in this document.
+ When present, this record immediately precedes the central
+ directory data structure. The size of this data record will be
+ included in the Size of the Central Directory field in the
+ End of Central Directory record. If the central directory structure
+ is compressed, but not encrypted, the location of the start of
+ this data record is determined using the Start of Central Directory
+ field in the Zip64 End of Central Directory record.
+
+
+ F. Central directory structure:
+
+ [file header 1]
+ .
+ .
+ .
+ [file header n]
+ [digital signature]
+
+ File header:
+
+ central file header signature 4 bytes (0x02014b50)
+ version made by 2 bytes
+ version needed to extract 2 bytes
+ general purpose bit flag 2 bytes
+ compression method 2 bytes
+ last mod file time 2 bytes
+ last mod file date 2 bytes
+ crc-32 4 bytes
+ compressed size 4 bytes
+ uncompressed size 4 bytes
+ file name length 2 bytes
+ extra field length 2 bytes
+ file comment length 2 bytes
+ disk number start 2 bytes
+ internal file attributes 2 bytes
+ external file attributes 4 bytes
+ relative offset of local header 4 bytes
+
+ file name (variable size)
+ extra field (variable size)
+ file comment (variable size)
+
+ Digital signature:
+
+ header signature 4 bytes (0x05054b50)
+ size of data 2 bytes
+ signature data (variable size)
+
+ With the introduction of the Central Directory Encryption
+ feature in version 6.2 of this specification, the Central
+ Directory Structure may be stored both compressed and encrypted.
+ Although not required, it is assumed when encrypting the
+ Central Directory Structure, that it will be compressed
+ for greater storage efficiency. Information on the
+ Central Directory Encryption feature can be found in the section
+ describing the Strong Encryption Specification. The Digital
+ Signature record will be neither compressed nor encrypted.
+
+
+ G. Zip64 end of central directory record
+
+ zip64 end of central dir
+ signature 4 bytes (0x06064b50)
+ size of zip64 end of central
+ directory record 8 bytes
+ version made by 2 bytes
+ version needed to extract 2 bytes
+ number of this disk 4 bytes
+ number of the disk with the
+ start of the central directory 4 bytes
+ total number of entries in the
+ central directory on this disk 8 bytes
+ total number of entries in the
+ central directory 8 bytes
+ size of the central directory 8 bytes
+ offset of start of central
+ directory with respect to
+ the starting disk number 8 bytes
+ zip64 extensible data sector (variable size)
+
+ The above record structure defines Version 1 of the
+ Zip64 end of central directory record. Version 1 was
+ implemented in versions of this specification preceding
+ 6.2 in support of the ZIP64(tm) large file feature. The
+ introduction of the Central Directory Encryption feature
+ implemented in version 6.2 as part of the Strong Encryption
+ Specification defines Version 2 of this record structure.
+ Refer to the section describing the Strong Encryption
+ Specification for details on the version 2 format for
+ this record.
+
+
+ H. Zip64 end of central directory locator
+
+ zip64 end of central dir locator
+ signature 4 bytes (0x07064b50)
+ number of the disk with the
+ start of the zip64 end of
+ central directory 4 bytes
+ relative offset of the zip64
+ end of central directory record 8 bytes
+ total number of disks 4 bytes
+
+
+ I. End of central directory record:
+
+ end of central dir signature 4 bytes (0x06054b50)
+ number of this disk 2 bytes
+ number of the disk with the
+ start of the central directory 2 bytes
+ total number of entries in the
+ central directory on this disk 2 bytes
+ total number of entries in
+ the central directory 2 bytes
+ size of the central directory 4 bytes
+ offset of start of central
+ directory with respect to
+ the starting disk number 4 bytes
+ .ZIP file comment length 2 bytes
+ .ZIP file comment (variable size)
+
+
+ J. Explanation of fields:
+
+ version made by (2 bytes)
+
+ [PKWARE describes "OS made by" now (since 1998) as follows:
+ The upper byte indicates the compatibility of the file
+ attribute information. If the external file attributes
+ are compatible with MS-DOS and can be read by PKZIP for
+ DOS version 2.04g then this value will be zero. If these
+ attributes are not compatible, then this value will
+ identify the host system on which the attributes are
+ compatible.]
+ The upper byte indicates the host system (OS) for the
+ file. Software can use this information to determine
+ the line record format for text files etc. The current
+ mappings are:
+
+ 0 - FAT file system (DOS, OS/2, NT) + PKWARE 2.50+ VFAT, NTFS
+ 1 - Amiga
+ 2 - OpenVMS
+ 3 - Unix
+ 4 - VM/CMS
+ 5 - Atari ST
+ 6 - HPFS file system (OS/2, NT 3.x)
+ 7 - Macintosh
+ 8 - Z-System
+ 9 - CP/M
+ ---------------------------------------------------------------------
+ PKWARE assignment | Info-ZIP assignment
+ -----------------------------------|---------------------------------
+ 10 - Windows NTFS | TOPS-20
+ (since PKZIPW 2.50, but | (assigned Oct-1992,
+ not used by any PKWARE prog) | no longer used)
+ 11 - MVS | NTFS file system (WinNT)
+ | (actively used by Info-ZIP's
+ | Zip for NT since Sep-1993)
+ 12 - VSE | SMS/QDOS
+ ---------------------------------------------------------------------
+ 13 - Acorn RISC OS
+ 14 - VFAT file system (Win95, NT) [Info-ZIP reservation, unused]
+ 15 - MVS [PKWARE describes this assignment as "alternate MVS"]
+ 16 - BeOS (BeBox or PowerMac)
+ 17 - Tandem
+ 18 - OS/400 (IBM) | THEOS
+ 19 - OS/X (Darwin)
+ 20 thru 29 - unused
+ 30 - AtheOS/Syllable
+ 31 thru 255 - unused
+
+ The lower byte indicates the ZIP specification version
+ (the version of this document) supported by the software
+ used to encode the file. The value/10 indicates the major
+ version number, and the value mod 10 is the minor version
+ number.
+
+ version needed to extract (2 bytes)
+
+ The minimum supported ZIP specification version needed to
+ extract the file, mapped as above. This value is based on
+ the specific format features a ZIP program must support to
+ be able to extract the file. If multiple features are
+ applied to a file, the minimum version should be set to the
+ feature having the highest value. New features or feature
+ changes affecting the published format specification will be
+ implemented using higher version numbers than the last
+ published value to avoid conflict.
+
+ Current minimum feature versions are as defined below:
+
+ 1.0 - Default value
+ 1.1 - File is a volume label
+ 2.0 - File is a folder (directory)
+ 2.0 - File is compressed using Deflate compression
+ 2.0 - File is encrypted using traditional PKWARE encryption
+ 2.1 - File is compressed using Deflate64(tm)
+ 2.5 - File is compressed using PKWARE DCL Implode
+ 2.7 - File is a patch data set
+ 4.5 - File uses ZIP64 format extensions
+ 4.6 - File is compressed using BZIP2 compression*
+ 5.0 - File is encrypted using DES
+ 5.0 - File is encrypted using 3DES
+ 5.0 - File is encrypted using original RC2 encryption
+ 5.0 - File is encrypted using RC4 encryption
+ 5.1 - File is encrypted using AES encryption
+ 5.1 - File is encrypted using corrected RC2 encryption**
+ 5.2 - File is encrypted using corrected RC2-64 encryption**
+ 6.1 - File is encrypted using non-OAEP key wrapping***
+ 6.2 - Central directory encryption
+
+
+ * Early 7.x (pre-7.2) versions of PKZIP incorrectly set the
+ version needed to extract for BZIP2 compression to be 50
+ when it should have been 46.
+
+ ** Refer to the section on Strong Encryption Specification
+ for additional information regarding RC2 corrections.
+
+ *** Certificate encryption using non-OAEP key wrapping is the
+ intended mode of operation for all versions beginning with 6.1.
+ Support for OAEP key wrapping should only be used for
+ backward compatibility when sending ZIP files to be opened by
+ versions of PKZIP older than 6.1 (5.0 or 6.0).
+
+ When using ZIP64 extensions, the corresponding value in the
+ Zip64 end of central directory record should also be set.
+ This field currently supports only the value 45 to indicate
+ ZIP64 extensions are present.
+
+ general purpose bit flag: (2 bytes)
+
+ Bit 0: If set, indicates that the file is encrypted.
+
+ (For Method 6 - Imploding)
+ Bit 1: If the compression method used was type 6,
+ Imploding, then this bit, if set, indicates
+ an 8K sliding dictionary was used. If clear,
+ then a 4K sliding dictionary was used.
+ Bit 2: If the compression method used was type 6,
+ Imploding, then this bit, if set, indicates
+ 3 Shannon-Fano trees were used to encode the
+ sliding dictionary output. If clear, then 2
+ Shannon-Fano trees were used.
+
+ (For Methods 8 and 9 - Deflating)
+ Bit 2 Bit 1
+ 0 0 Normal (-en) compression option was used.
+ 0 1 Maximum (-exx/-ex) compression option was used.
+ 1 0 Fast (-ef) compression option was used.
+ 1 1 Super Fast (-es) compression option was used.
+
+ Note: Bits 1 and 2 are undefined if the compression
+ method is any other.
+
+ Bit 3: If this bit is set, the fields crc-32, compressed
+ size and uncompressed size are set to zero in the
+ local header. The correct values are put in the
+ data descriptor immediately following the compressed
+ data. (Note: PKZIP version 2.04g for DOS only
+ recognizes this bit for method 8 compression, newer
+ versions of PKZIP recognize this bit for any
+ compression method.)
+ [Info-ZIP note: This bit was introduced by PKZIP 2.04 for
+ DOS. In general, this feature can only be reliably used
+ together with compression methods that allow intrinsic
+ detection of the "end-of-compressed-data" condition. From
+ the set of compression methods described in this Zip archive
+ specification, only "deflate" and "bzip2" fulfill this
+ requirement.
+ Especially, the method STORED does not work!
+ The Info-ZIP tools recognize this bit regardless of the
+ compression method; but, they rely on correctly set
+ "compressed size" information in the central directory entry.]
+
+ Bit 4: Reserved for use with method 8, for enhanced
+ deflating.
+
+ Bit 5: If this bit is set, this indicates that the file is
+ compressed patched data. (Note: Requires PKZIP
+ version 2.70 or greater)
+
+ Bit 6: Strong encryption. If this bit is set, you should
+ set the version needed to extract value to at least
+ 50 and you must also set bit 0. If AES encryption
+ is used, the version needed to extract value must
+ be at least 51.
+
+ Bit 7: Currently unused.
+
+ Bit 8: Currently unused.
+
+ Bit 9: Currently unused.
+
+ Bit 10: Currently unused.
+
+ Bit 11: Currently unused.
+
+ Bit 12: Reserved by PKWARE for enhanced compression.
+
+ Bit 13: Used when encrypting the Central Directory to indicate
+ selected data values in the Local Header are masked to
+ hide their actual values. See the section describing
+ the Strong Encryption Specification for details.
+
+ Bit 14: Reserved by PKWARE.
+
+ Bit 15: Reserved by PKWARE.
+
+ compression method: (2 bytes)
+
+ (see accompanying documentation for algorithm
+ descriptions)
+
+ 0 - The file is stored (no compression)
+ 1 - The file is Shrunk
+ 2 - The file is Reduced with compression factor 1
+ 3 - The file is Reduced with compression factor 2
+ 4 - The file is Reduced with compression factor 3
+ 5 - The file is Reduced with compression factor 4
+ 6 - The file is Imploded
+ 7 - Reserved for Tokenizing compression algorithm
+ 8 - The file is Deflated
+ 9 - Enhanced Deflating using Deflate64(tm)
+ 10 - PKWARE Data Compression Library Imploding
+ 11 - Reserved by PKWARE
+ 12 - File is compressed using BZIP2 algorithm
+
+ date and time fields: (2 bytes each)
+
+ The date and time are encoded in standard MS-DOS format.
+ If input came from standard input, the date and time are
+ those at which compression was started for this data.
+ If encrypting the central directory and general purpose bit
+ flag 13 is set indicating masking, the value stored in the
+ Local Header will be zero.
+
+ CRC-32: (4 bytes)
+
+ The CRC-32 algorithm was generously contributed by
+ David Schwaderer and can be found in his excellent
+ book "C Programmers Guide to NetBIOS" published by
+ Howard W. Sams & Co. Inc. The 'magic number' for
+ the CRC is 0xdebb20e3. The proper CRC pre and post
+ conditioning is used, meaning that the CRC register
+ is pre-conditioned with all ones (a starting value
+ of 0xffffffff) and the value is post-conditioned by
+ taking the one's complement of the CRC residual.
+ If bit 3 of the general purpose flag is set, this
+ field is set to zero in the local header and the correct
+ value is put in the data descriptor and in the central
+ directory. If encrypting the central directory and general
+ purpose bit flag 13 is set indicating masking, the value
+ stored in the Local Header will be zero.
+
+ compressed size: (4 bytes)
+ uncompressed size: (4 bytes)
+
+ The size of the file compressed and uncompressed,
+ respectively. If bit 3 of the general purpose bit flag
+ is set, these fields are set to zero in the local header
+ and the correct values are put in the data descriptor and
+ in the central directory. If an archive is in zip64 format
+ and the value in this field is 0xFFFFFFFF, the size will be
+ in the corresponding 8 byte zip64 extended information
+ extra field. If encrypting the central directory and general
+ purpose bit flag 13 is set indicating masking, the value stored
+ for the uncompressed size in the Local Header will be zero.
+
+ file name length: (2 bytes)
+ extra field length: (2 bytes)
+ file comment length: (2 bytes)
+
+ The length of the file name, extra field, and comment
+ fields respectively. The combined length of any
+ directory record and these three fields should not
+ generally exceed 65,535 bytes. If input came from standard
+ input, the file name length is set to zero.
+
+ [Info-ZIP note:
+ This feature is not yet supported by any PKWARE version of ZIP
+ (at least not in PKZIP for DOS and PKZIP for Windows/WinNT).
+ The Info-ZIP programs handle standard input differently:
+ If input came from standard input, the filename is set to "-"
+ (length one).]
+
+
+ disk number start: (2 bytes)
+
+ The number of the disk on which this file begins. If an
+ archive is in zip64 format and the value in this field is
+ 0xFFFF, the size will be in the corresponding 4 byte zip64
+ extended information extra field.
+
+ internal file attributes: (2 bytes)
+
+ Bits 1 and 2 are reserved for use by PKWARE.
+
+ The lowest bit of this field indicates, if set, that
+ the file is apparently an ASCII or text file. If not
+ set, that the file apparently contains binary data.
+ The remaining bits are unused in version 1.0.
+
+ The 0x0002 bit of this field indicates, if set, that a
+ 4 byte variable record length control field precedes each
+ logical record indicating the length of the record. This
+ flag is independent of text control characters, and if used
+ in conjunction with text data, includes any control
+ characters in the total length of the record. This value is
+ provided for mainframe data transfer support.
+
+ external file attributes: (4 bytes)
+
+ The mapping of the external attributes is
+ host-system dependent (see 'version made by'). For
+ MS-DOS, the low order byte is the MS-DOS directory
+ attribute byte. If input came from standard input, this
+ field is set to zero.
+
+ relative offset of local header: (4 bytes)
+
+ This is the offset from the start of the first disk on
+ which this file appears, to where the local header should
+ be found. If an archive is in zip64 format and the value
+ in this field is 0xFFFFFFFF, the size will be in the
+ corresponding 8 byte zip64 extended information extra field.
+
+ file name: (Variable)
+
+ The name of the file, with optional relative path.
+ The path stored should not contain a drive or
+ device letter, or a leading slash. All slashes
+ should be forward slashes '/' as opposed to
+ backwards slashes '\' for compatibility with Amiga
+ and Unix file systems etc. If input came from standard
+ input, there is no file name field. If encrypting
+ the central directory and general purpose bit flag 13 is set
+ indicating masking, the file name stored in the Local Header
+ will not be the actual file name. A masking value consisting
+ of a unique hexadecimal value will be stored. This value will
+ be sequentially incremented for each file in the archive. See
+ the section on the Strong Encryption Specification for details
+ on retrieving the encrypted file name.
+ [Info-ZIP discrepancy:
+ If input came from standard input, the file name is set
+ to "-" (without the quotes).
+ As far as we know, the PKWARE specification for "input from
+ stdin" is not supported by PKZIP/PKUNZIP for DOS, OS/2, Windows
+ Windows NT.]
+
+ extra field: (Variable)
+
+ This is for expansion. If additional information
+ needs to be stored for special needs or for specific
+ platforms, it should be stored here. Earlier versions
+ of the software can then safely skip this file, and
+ find the next file or header. This field will be 0
+ length in version 1.0.
+
+ In order to allow different programs and different types
+ of information to be stored in the 'extra' field in .ZIP
+ files, the following structure should be used for all
+ programs storing data in this field:
+
+ header1+data1 + header2+data2 . . .
+
+ Each header should consist of:
+
+ Header ID - 2 bytes
+ Data Size - 2 bytes
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ The Header ID field indicates the type of data that is in
+ the following data block.
+
+ Header ID's of 0 thru 31 are reserved for use by PKWARE.
+ The remaining ID's can be used by third party vendors for
+ proprietary usage.
+
+ The current Header ID mappings defined by PKWARE are:
+
+ 0x0001 ZIP64 extended information extra field
+ 0x0007 AV Info
+ 0x0008 Reserved for future Unicode file name data (PFS)
+ 0x0009 OS/2 extended attributes (also Info-ZIP)
+ 0x000a NTFS (Win9x/WinNT FileTimes)
+ 0x000c OpenVMS (also Info-ZIP)
+ 0x000d Unix
+ 0x000e Reserved for file stream and fork descriptors
+ 0x000f Patch Descriptor
+ 0x0014 PKCS#7 Store for X.509 Certificates
+ 0x0015 X.509 Certificate ID and Signature for
+ individual file
+ 0x0016 X.509 Certificate ID for Central Directory
+ 0x0017 Strong Encryption Header
+ 0x0018 Record Management Controls
+ 0x0019 PKCS#7 Encryption Recipient Certificate List
+ 0x0065 IBM S/390 (Z390), AS/400 (I400) attributes
+ - uncompressed
+ 0x0066 Reserved for IBM S/390 (Z390), AS/400 (I400)
+ attributes - compressed
+
+ The Header ID mappings defined by Info-ZIP and third parties are:
+
+ 0x07c8 Info-ZIP Macintosh (old, J. Lee)
+ 0x2605 ZipIt Macintosh (first version)
+ 0x2705 ZipIt Macintosh v 1.3.5 and newer (w/o full filename)
+ 0x2805 ZipIt Macintosh 1.3.5+
+ 0x334d Info-ZIP Macintosh (new, D. Haase's 'Mac3' field)
+ 0x4154 Tandem NSK
+ 0x4341 Acorn/SparkFS (David Pilling)
+ 0x4453 Windows NT security descriptor (binary ACL)
+ 0x4704 VM/CMS
+ 0x470f MVS
+ 0x4854 Theos, old inofficial port
+ 0x4b46 FWKCS MD5 (see below)
+ 0x4c41 OS/2 access control list (text ACL)
+ 0x4d49 Info-ZIP OpenVMS (obsolete)
+ 0x4d63 Macintosh SmartZIP, by Macro Bambini
+ 0x4f4c Xceed original location extra field
+ 0x5356 AOS/VS (binary ACL)
+ 0x5455 extended timestamp
+ 0x554e Xceed unicode extra field
+ 0x5855 Info-ZIP Unix (original; also OS/2, NT, etc.)
+ 0x6542 BeOS (BeBox, PowerMac, etc.)
+ 0x6854 Theos
+ 0x7441 AtheOS (AtheOS/Syllable attributes)
+ 0x756e ASi Unix
+ 0x7855 Info-ZIP Unix (new)
+ 0xfb4a SMS/QDOS
+
+ Detailed descriptions of Extra Fields defined by third
+ party mappings will be documented as information on
+ these data structures is made available to PKWARE.
+ PKWARE does not guarantee the accuracy of any published
+ third party data.
+
+ The Data Size field indicates the size of the following
+ data block. Programs can use this value to skip to the
+ next header block, passing over any data blocks that are
+ not of interest.
+
+ Note: As stated above, the size of the entire .ZIP file
+ header, including the file name, comment, and extra
+ field should not exceed 64K in size.
+
+ In case two different programs should appropriate the same
+ Header ID value, it is strongly recommended that each
+ program place a unique signature of at least two bytes in
+ size (and preferably 4 bytes or bigger) at the start of
+ each data area. Every program should verify that its
+ unique signature is present, in addition to the Header ID
+ value being correct, before assuming that it is a block of
+ known type.
+
+ In the following descriptions, note that "Short" means two bytes,
+ "Long" means four bytes, and "Long-Long" means eight bytes,
+ regardless of their native sizes. Unless specifically noted, all
+ integer fields should be interpreted as unsigned (non-negative)
+ numbers.
+
+
+ -ZIP64 Extended Information Extra Field (0x0001):
+ ===============================================
+
+ The following is the layout of the ZIP64 extended
+ information "extra" block. If one of the size or
+ offset fields in the Local or Central directory
+ record is too small to hold the required data,
+ a ZIP64 extended information record is created.
+ The order of the fields in the ZIP64 extended
+ information record is fixed, but the fields will
+ only appear if the corresponding Local or Central
+ directory record field is set to 0xFFFF or 0xFFFFFFFF.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (ZIP64) 0x0001 2 bytes Tag for this "extra" block type
+ Size 2 bytes Size of this "extra" block
+ Original
+ Size 8 bytes Original uncompressed file size
+ Compressed
+ Size 8 bytes Size of compressed data
+ Relative Header
+ Offset 8 bytes Offset of local header record
+ Disk Start
+ Number 4 bytes Number of the disk on which
+ this file starts
+
+ This entry in the Local header must include BOTH original
+ and compressed file sizes.
+
+
+ -OS/2 Extended Attributes Extra Field (0x0009):
+ =============================================
+
+ The following is the layout of the OS/2 extended attributes "extra"
+ block. (Last Revision 19960922)
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (OS/2) 0x0009 Short tag for this extra block type
+ TSize Short total data size for this block
+ BSize Long uncompressed EA data size
+ CType Short compression type
+ EACRC Long CRC value for uncompressed EA data
+ (var.) variable compressed EA data
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (OS/2) 0x0009 Short tag for this extra block type
+ TSize Short total data size for this block (4)
+ BSize Long size of uncompressed local EA data
+
+ The value of CType is interpreted according to the "compression
+ method" section above; i.e., 0 for stored, 8 for deflated, etc.
+
+ The OS/2 extended attribute structure (FEA2LIST) is
+ compressed and then stored in its entirety within this
+ structure. There will only ever be one "block" of data in
+ the variable-length field.
+
+
+ -OS/2 Access Control List Extra Field:
+ ====================================
+
+ The following is the layout of the OS/2 ACL extra block.
+ (Last Revision 19960922)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (ACL) 0x4c41 Short tag for this extra block type ("AL")
+ TSize Short total data size for this block
+ BSize Long uncompressed ACL data size
+ CType Short compression type
+ EACRC Long CRC value for uncompressed ACL data
+ (var.) variable compressed ACL data
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (ACL) 0x4c41 Short tag for this extra block type ("AL")
+ TSize Short total data size for this block (4)
+ BSize Long size of uncompressed local ACL data
+
+ The value of CType is interpreted according to the "compression
+ method" section above; i.e., 0 for stored, 8 for deflated, etc.
+
+ The uncompressed ACL data consist of a text header of the form
+ "ACL1:%hX,%hd\n", where the first field is the OS/2 ACCINFO acc_attr
+ member and the second is acc_count, followed by acc_count strings
+ of the form "%s,%hx\n", where the first field is acl_ugname (user
+ group name) and the second acl_access. This block type will be
+ extended for other operating systems as needed.
+
+
+ -Windows NT Security Descriptor Extra Field (0x4453):
+ ===================================================
+
+ The following is the layout of the NT Security Descriptor (another
+ type of ACL) extra block. (Last Revision 19960922)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (SD) 0x4453 Short tag for this extra block type ("SD")
+ TSize Short total data size for this block
+ BSize Long uncompressed SD data size
+ Version Byte version of uncompressed SD data format
+ CType Short compression type
+ EACRC Long CRC value for uncompressed SD data
+ (var.) variable compressed SD data
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (SD) 0x4453 Short tag for this extra block type ("SD")
+ TSize Short total data size for this block (4)
+ BSize Long size of uncompressed local SD data
+
+ The value of CType is interpreted according to the "compression
+ method" section above; i.e., 0 for stored, 8 for deflated, etc.
+ Version specifies how the compressed data are to be interpreted
+ and allows for future expansion of this extra field type. Currently
+ only version 0 is defined.
+
+ For version 0, the compressed data are to be interpreted as a single
+ valid Windows NT SECURITY_DESCRIPTOR data structure, in self-relative
+ format.
+
+
+ -PKWARE Win95/WinNT Extra Field (0x000a):
+ =======================================
+
+ The following description covers PKWARE's "NTFS" attributes
+ "extra" block, introduced with the release of PKZIP 2.50 for
+ Windows. (Last Revision 20001118)
+
+ (Note: At this time the Mtime, Atime and Ctime values may
+ be used on any WIN32 system.)
+ [Info-ZIP note: In the current implementations, this field has
+ a fixed total data size of 32 bytes and is only stored as local
+ extra field.]
+
+ Value Size Description
+ ----- ---- -----------
+ (NTFS) 0x000a Short Tag for this "extra" block type
+ TSize Short Total Data Size for this block
+ Reserved Long for future use
+ Tag1 Short NTFS attribute tag value #1
+ Size1 Short Size of attribute #1, in bytes
+ (var.) SubSize1 Attribute #1 data
+ .
+ .
+ .
+ TagN Short NTFS attribute tag value #N
+ SizeN Short Size of attribute #N, in bytes
+ (var.) SubSizeN Attribute #N data
+
+ For NTFS, values for Tag1 through TagN are as follows:
+ (currently only one set of attributes is defined for NTFS)
+
+ Tag Size Description
+ ----- ---- -----------
+ 0x0001 2 bytes Tag for attribute #1
+ Size1 2 bytes Size of attribute #1, in bytes (24)
+ Mtime 8 bytes 64-bit NTFS file last modification time
+ Atime 8 bytes 64-bit NTFS file last access time
+ Ctime 8 bytes 64-bit NTFS file creation time
+
+ The total length for this block is 28 bytes, resulting in a
+ fixed size value of 32 for the TSize field of the NTFS block.
+
+ The NTFS filetimes are 64-bit unsigned integers, stored in Intel
+ (least significant byte first) byte order. They determine the
+ number of 1.0E-07 seconds (1/10th microseconds!) past WinNT "epoch",
+ which is "01-Jan-1601 00:00:00 UTC".
+
+
+ -PKWARE OpenVMS Extra Field (0x000c):
+ ===================================
+
+ The following is the layout of PKWARE's OpenVMS attributes
+ "extra" block. (Last Revision 12/17/91)
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (VMS) 0x000c Short Tag for this "extra" block type
+ TSize Short Total Data Size for this block
+ CRC Long 32-bit CRC for remainder of the block
+ Tag1 Short OpenVMS attribute tag value #1
+ Size1 Short Size of attribute #1, in bytes
+ (var.) Size1 Attribute #1 data
+ .
+ .
+ .
+ TagN Short OpenVMS attribute tage value #N
+ SizeN Short Size of attribute #N, in bytes
+ (var.) SizeN Attribute #N data
+
+ Rules:
+
+ 1. There will be one or more of attributes present, which
+ will each be preceded by the above TagX & SizeX values.
+ These values are identical to the ATR$C_XXXX and
+ ATR$S_XXXX constants which are defined in ATR.H under
+ OpenVMS C. Neither of these values will ever be zero.
+
+ 2. No word alignment or padding is performed.
+
+ 3. A well-behaved PKZIP/OpenVMS program should never produce
+ more than one sub-block with the same TagX value. Also,
+ there will never be more than one "extra" block of type
+ 0x000c in a particular directory record.
+
+
+ -Info-ZIP VMS Extra Field:
+ ========================
+
+ The following is the layout of Info-ZIP's VMS attributes extra
+ block for VAX or Alpha AXP. The local-header and central-header
+ versions are identical. (Last Revision 19960922)
+
+ Value Size Description
+ ----- ---- -----------
+ (VMS2) 0x4d49 Short tag for this extra block type ("JM")
+ TSize Short total data size for this block
+ ID Long block ID
+ Flags Short info bytes
+ BSize Short uncompressed block size
+ Reserved Long (reserved)
+ (var.) variable compressed VMS file-attributes block
+
+ The block ID is one of the following unterminated strings:
+
+ "VFAB" struct FAB
+ "VALL" struct XABALL
+ "VFHC" struct XABFHC
+ "VDAT" struct XABDAT
+ "VRDT" struct XABRDT
+ "VPRO" struct XABPRO
+ "VKEY" struct XABKEY
+ "VMSV" version (e.g., "V6.1"; truncated at hyphen)
+ "VNAM" reserved
+
+ The lower three bits of Flags indicate the compression method. The
+ currently defined methods are:
+
+ 0 stored (not compressed)
+ 1 simple "RLE"
+ 2 deflated
+
+ The "RLE" method simply replaces zero-valued bytes with zero-valued
+ bits and non-zero-valued bytes with a "1" bit followed by the byte
+ value.
+
+ The variable-length compressed data contains only the data corre-
+ sponding to the indicated structure or string. Typically multiple
+ VMS2 extra fields are present (each with a unique block type).
+
+
+ -Info-ZIP Macintosh Extra Field:
+ ==============================
+
+ The following is the layout of the (old) Info-ZIP resource-fork extra
+ block for Macintosh. The local-header and central-header versions
+ are identical. (Last Revision 19960922)
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac) 0x07c8 Short tag for this extra block type
+ TSize Short total data size for this block
+ "JLEE" beLong extra-field signature
+ FInfo 16 bytes Macintosh FInfo structure
+ CrDat beLong HParamBlockRec fileParam.ioFlCrDat
+ MdDat beLong HParamBlockRec fileParam.ioFlMdDat
+ Flags beLong info bits
+ DirID beLong HParamBlockRec fileParam.ioDirID
+ VolName 28 bytes volume name (optional)
+
+ All fields but the first two are in native Macintosh format
+ (big-endian Motorola order, not little-endian Intel). The least
+ significant bit of Flags is 1 if the file is a data fork, 0 other-
+ wise. In addition, if this extra field is present, the filename
+ has an extra 'd' or 'r' appended to indicate data fork or resource
+ fork. The 28-byte VolName field may be omitted.
+
+
+ -ZipIt Macintosh Extra Field (long):
+ ==================================
+
+ The following is the layout of the ZipIt extra block for Macintosh.
+ The local-header and central-header versions are identical.
+ (Last Revision 19970130)
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac2) 0x2605 Short tag for this extra block type
+ TSize Short total data size for this block
+ "ZPIT" beLong extra-field signature
+ FnLen Byte length of FileName
+ FileName variable full Macintosh filename
+ FileType Byte[4] four-byte Mac file type string
+ Creator Byte[4] four-byte Mac creator string
+
+
+ -ZipIt Macintosh Extra Field (short, for files):
+ ==============================================
+
+ The following is the layout of a shortened variant of the
+ ZipIt extra block for Macintosh (without "full name" entry).
+ This variant is used by ZipIt 1.3.5 and newer for entries of
+ files (not directories) that do not have a MacBinary encoded
+ file. The local-header and central-header versions are identical.
+ (Last Revision 20030602)
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac2b) 0x2705 Short tag for this extra block type
+ TSize Short total data size for this block (min. 12)
+ "ZPIT" beLong extra-field signature
+ FileType Byte[4] four-byte Mac file type string
+ Creator Byte[4] four-byte Mac creator string
+ fdFlags beShort attributes from FInfo.frFlags,
+ may be omitted
+ 0x0000 beShort reserved, may be omitted
+
+
+ -ZipIt Macintosh Extra Field (short, for directories):
+ ====================================================
+
+ The following is the layout of a shortened variant of the
+ ZipIt extra block for Macintosh used only for directory
+ entries. This variant is used by ZipIt 1.3.5 and newer to
+ save some optional Mac-specific information about directories.
+ The local-header and central-header versions are identical.
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac2c) 0x2805 Short tag for this extra block type
+ TSize Short total data size for this block (12)
+ "ZPIT" beLong extra-field signature
+ frFlags beShort attributes from DInfo.frFlags, may
+ be omitted
+ View beShort ZipIt view flag, may be omitted
+
+
+ The View field specifies ZipIt-internal settings as follows:
+
+ Bits of the Flags:
+ bit 0 if set, the folder is shown expanded (open)
+ when the archive contents are viewed in ZipIt.
+ bits 1-15 reserved, zero;
+
+
+ -Info-ZIP Macintosh Extra Field (new):
+ ====================================
+
+ The following is the layout of the (new) Info-ZIP extra
+ block for Macintosh, designed by Dirk Haase.
+ All values are in little-endian.
+ (Last Revision 19981005)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac3) 0x334d Short tag for this extra block type ("M3")
+ TSize Short total data size for this block
+ BSize Long uncompressed finder attribute data size
+ Flags Short info bits
+ fdType Byte[4] Type of the File (4-byte string)
+ fdCreator Byte[4] Creator of the File (4-byte string)
+ (CType) Short compression type
+ (CRC) Long CRC value for uncompressed MacOS data
+ Attribs variable finder attribute data (see below)
+
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac3) 0x334d Short tag for this extra block type ("M3")
+ TSize Short total data size for this block
+ BSize Long uncompressed finder attribute data size
+ Flags Short info bits
+ fdType Byte[4] Type of the File (4-byte string)
+ fdCreator Byte[4] Creator of the File (4-byte string)
+
+ The third bit of Flags in both headers indicates whether
+ the LOCAL extra field is uncompressed (and therefore whether CType
+ and CRC are omitted):
+
+ Bits of the Flags:
+ bit 0 if set, file is a data fork; otherwise unset
+ bit 1 if set, filename will be not changed
+ bit 2 if set, Attribs is uncompressed (no CType, CRC)
+ bit 3 if set, date and times are in 64 bit
+ if zero date and times are in 32 bit.
+ bit 4 if set, timezone offsets fields for the native
+ Mac times are omitted (UTC support deactivated)
+ bits 5-15 reserved;
+
+
+ Attributes:
+
+ Attribs is a Mac-specific block of data in little-endian format with
+ the following structure (if compressed, uncompress it first):
+
+ Value Size Description
+ ----- ---- -----------
+ fdFlags Short Finder Flags
+ fdLocation.v Short Finder Icon Location
+ fdLocation.h Short Finder Icon Location
+ fdFldr Short Folder containing file
+
+ FXInfo 16 bytes Macintosh FXInfo structure
+ FXInfo-Structure:
+ fdIconID Short
+ fdUnused[3] Short unused but reserved 6 bytes
+ fdScript Byte Script flag and number
+ fdXFlags Byte More flag bits
+ fdComment Short Comment ID
+ fdPutAway Long Home Dir ID
+
+ FVersNum Byte file version number
+ may be not used by MacOS
+ ACUser Byte directory access rights
+
+ FlCrDat ULong date and time of creation
+ FlMdDat ULong date and time of last modification
+ FlBkDat ULong date and time of last backup
+ These time numbers are original Mac FileTime values (local time!).
+ Currently, date-time width is 32-bit, but future version may
+ support be 64-bit times (see flags)
+
+ CrGMTOffs Long(signed!) difference "local Creat. time - UTC"
+ MdGMTOffs Long(signed!) difference "local Modif. time - UTC"
+ BkGMTOffs Long(signed!) difference "local Backup time - UTC"
+ These "local time - UTC" differences (stored in seconds) may be
+ used to support timestamp adjustment after inter-timezone transfer.
+ These fields are optional; bit 4 of the flags word controls their
+ presence.
+
+ Charset Short TextEncodingBase (Charset)
+ valid for the following two fields
+
+ FullPath variable Path of the current file.
+ Zero terminated string (C-String)
+ Currently coded in the native Charset.
+
+ Comment variable Finder Comment of the current file.
+ Zero terminated string (C-String)
+ Currently coded in the native Charset.
+
+
+ -SmartZIP Macintosh Extra Field:
+ ====================================
+
+ The following is the layout of the SmartZIP extra
+ block for Macintosh, designed by Marco Bambini.
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ 0x4d63 Short tag for this extra block type ("cM")
+ TSize Short total data size for this block (64)
+ "dZip" beLong extra-field signature
+ fdType Byte[4] Type of the File (4-byte string)
+ fdCreator Byte[4] Creator of the File (4-byte string)
+ fdFlags beShort Finder Flags
+ fdLocation.v beShort Finder Icon Location
+ fdLocation.h beShort Finder Icon Location
+ fdFldr beShort Folder containing file
+ CrDat beLong HParamBlockRec fileParam.ioFlCrDat
+ MdDat beLong HParamBlockRec fileParam.ioFlMdDat
+ frScroll.v Byte vertical pos. of folder's scroll bar
+ fdScript Byte Script flag and number
+ frScroll.h Byte horizontal pos. of folder's scroll bar
+ fdXFlags Byte More flag bits
+ FileName Byte[32] full Macintosh filename (pascal string)
+
+ All fields but the first two are in native Macintosh format
+ (big-endian Motorola order, not little-endian Intel).
+ The extra field size is fixed to 64 bytes.
+ The local-header and central-header versions are identical.
+
+
+ -Acorn SparkFS Extra Field:
+ =========================
+
+ The following is the layout of David Pilling's SparkFS extra block
+ for Acorn RISC OS. The local-header and central-header versions are
+ identical. (Last Revision 19960922)
+
+ Value Size Description
+ ----- ---- -----------
+ (Acorn) 0x4341 Short tag for this extra block type ("AC")
+ TSize Short total data size for this block (20)
+ "ARC0" Long extra-field signature
+ LoadAddr Long load address or file type
+ ExecAddr Long exec address
+ Attr Long file permissions
+ Zero Long reserved; always zero
+
+ The following bits of Attr are associated with the given file
+ permissions:
+
+ bit 0 user-writable ('W')
+ bit 1 user-readable ('R')
+ bit 2 reserved
+ bit 3 locked ('L')
+ bit 4 publicly writable ('w')
+ bit 5 publicly readable ('r')
+ bit 6 reserved
+ bit 7 reserved
+
+
+ -VM/CMS Extra Field:
+ ==================
+
+ The following is the layout of the file-attributes extra block for
+ VM/CMS. The local-header and central-header versions are
+ identical. (Last Revision 19960922)
+
+ Value Size Description
+ ----- ---- -----------
+ (VM/CMS) 0x4704 Short tag for this extra block type
+ TSize Short total data size for this block
+ flData variable file attributes data
+
+ flData is an uncompressed fldata_t struct.
+
+
+ -MVS Extra Field:
+ ===============
+
+ The following is the layout of the file-attributes extra block for
+ MVS. The local-header and central-header versions are identical.
+ (Last Revision 19960922)
+
+ Value Size Description
+ ----- ---- -----------
+ (MVS) 0x470f Short tag for this extra block type
+ TSize Short total data size for this block
+ flData variable file attributes data
+
+ flData is an uncompressed fldata_t struct.
+
+
+ -PKWARE Unix Extra Field (0x000d):
+ ================================
+
+ The following is the layout of PKWARE's Unix "extra" block.
+ It was introduced with the release of PKZIP for Unix 2.50.
+ Note: all fields are stored in Intel low-byte/high-byte order.
+ (Last Revision 19980901)
+
+ This field has a minimum data size of 12 bytes and is only stored
+ as local extra field.
+
+ Value Size Description
+ ----- ---- -----------
+ (Unix0) 0x000d Short Tag for this "extra" block type
+ TSize Short Total Data Size for this block
+ AcTime Long time of last access (UTC/GMT)
+ ModTime Long time of last modification (UTC/GMT)
+ UID Short Unix user ID
+ GID Short Unix group ID
+ (var) variable Variable length data field
+
+ The variable length data field will contain file type
+ specific data. Currently the only values allowed are
+ the original "linked to" file names for hard or symbolic
+ links, and the major and minor device node numbers for
+ character and block device nodes. Since device nodes
+ cannot be either symbolic or hard links, only one set of
+ variable length data is stored. Link files will have the
+ name of the original file stored. This name is NOT NULL
+ terminated. Its size can be determined by checking TSize -
+ 12. Device entries will have eight bytes stored as two 4
+ byte entries (in little-endian format). The first entry
+ will be the major device number, and the second the minor
+ device number.
+
+ [Info-ZIP note: The fixed part of this field has the same layout as
+ Info-ZIP's abandoned "Unix1 timestamps & owner ID info" extra field;
+ only the two tag bytes are different.]
+
+
+ -PATCH Descriptor Extra Field (0x000f):
+ =====================================
+
+ The following is the layout of the Patch Descriptor "extra"
+ block.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (Patch) 0x000f Short Tag for this "extra" block type
+ TSize Short Size of the total "extra" block
+ Version Short Version of the descriptor
+ Flags Long Actions and reactions (see below)
+ OldSize Long Size of the file about to be patched
+ OldCRC Long 32-bit CRC of the file about to be patched
+ NewSize Long Size of the resulting file
+ NewCRC Long 32-bit CRC of the resulting file
+
+
+ Actions and reactions
+
+ Bits Description
+ ---- ----------------
+ 0 Use for auto detection
+ 1 Treat as a self-patch
+ 2-3 RESERVED
+ 4-5 Action (see below)
+ 6-7 RESERVED
+ 8-9 Reaction (see below) to absent file
+ 10-11 Reaction (see below) to newer file
+ 12-13 Reaction (see below) to unknown file
+ 14-15 RESERVED
+ 16-31 RESERVED
+
+ Actions
+
+ Action Value
+ ------ -----
+ none 0
+ add 1
+ delete 2
+ patch 3
+
+ Reactions
+
+ Reaction Value
+ -------- -----
+ ask 0
+ skip 1
+ ignore 2
+ fail 3
+
+ Patch support is provided by PKPatchMaker(tm) technology and is
+ covered under U.S. Patents and Patents Pending.
+
+
+ -PKCS#7 Store for X.509 Certificates (0x0014):
+ ============================================
+
+ This field contains information about each of the certificates
+ files may be signed with. When the Central Directory Encryption
+ feature is enabled for a ZIP file, this record will appear in
+ the Archive Extra Data Record, otherwise it will appear in the
+ first central directory record and will be ignored in any
+ other record.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (Store) 0x0014 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the store data
+ SData TSize Data about the store
+
+ SData
+ Value Size Description
+ ----- ---- -----------
+ Version 2 bytes Version number, 0x0001 for now
+ StoreD (variable) Actual store data
+
+ The StoreD member is suitable for passing as the pbData
+ member of a CRYPT_DATA_BLOB to the CertOpenStore() function
+ in Microsoft's CryptoAPI. The SSize member above will be
+ cbData + 6, where cbData is the cbData member of the same
+ CRYPT_DATA_BLOB. The encoding type to pass to
+ CertOpenStore() should be
+ PKCS_7_ANS_ENCODING | X509_ASN_ENCODING.
+
+
+ -X.509 Certificate ID and Signature for individual file (0x0015):
+ ===============================================================
+
+ This field contains the information about which certificate in
+ the PKCS#7 store was used to sign a particular file. It also
+ contains the signature data. This field can appear multiple
+ times, but can only appear once per certificate.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (CID) 0x0015 2 bytes Tag for this "extra" block type
+ CSize 2 bytes Size of Method
+ Method (variable)
+
+ Method
+ Value Size Description
+ ----- ---- -----------
+ Version 2 bytes Version number, for now 0x0001
+ AlgID 2 bytes Algorithm ID used for signing
+ IDSize 2 bytes Size of Certificate ID data
+ CertID (variable) Certificate ID data
+ SigSize 2 bytes Size of Signature data
+ Sig (variable) Signature data
+
+ CertID
+ Value Size Description
+ ----- ---- -----------
+ Size1 4 bytes Size of CertID, should be (IDSize - 4)
+ Size1 4 bytes A bug in version one causes this value
+ to appear twice.
+ IssSize 4 bytes Issuer data size
+ Issuer (variable) Issuer data
+ SerSize 4 bytes Serial Number size
+ Serial (variable) Serial Number data
+
+ The Issuer and IssSize members are suitable for creating a
+ CRYPT_DATA_BLOB to be the Issuer member of a CERT_INFO
+ struct. The Serial and SerSize members would be the
+ SerialNumber member of the same CERT_INFO struct. This
+ struct would be used to find the certificate in the store
+ the file was signed with. Those structures are from the MS
+ CryptoAPI.
+
+ Sig and SigSize are the actual signature data and size
+ generated by signing the file with the MS CryptoAPI using a
+ hash created with the given AlgID.
+
+
+ -X.509 Certificate ID and Signature for central directory (0x0016):
+ =================================================================
+
+ This field contains the information about which certificate in
+ the PKCS#7 store was used to sign the central directory structure.
+ When the Central Directory Encryption feature is enabled for a
+ ZIP file, this record will appear in the Archive Extra Data Record,
+ otherwise it will appear in the first central directory record,
+ along with the store. The data structure is the
+ same as the CID, except that SigSize will be 0, and there
+ will be no Sig member.
+
+ This field is also kept after the last central directory
+ record, as the signature data (ID 0x05054b50, it looks like
+ a central directory record of a different type). This
+ second copy of the data is the Signature Data member of the
+ record, and will have a SigSize that is non-zero, and will
+ have Sig data.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (CDID) 0x0016 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of data that follows
+ TData TSize Data
+
+
+ -Strong Encryption Header (0x0017) (EFS):
+ ===============================
+
+ Value Size Description
+ ----- ---- -----------
+ 0x0017 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of data that follows
+ Format 2 bytes Format definition for this record
+ AlgID 2 bytes Encryption algorithm identifier
+ Bitlen 2 bytes Bit length of encryption key
+ Flags 2 bytes Processing flags
+ CertData TSize-8 Certificate decryption extra field data
+ (refer to the explanation for CertData
+ in the section describing the
+ Certificate Processing Method under
+ the Strong Encryption Specification)
+
+
+ -Record Management Controls (0x0018):
+ ===================================
+
+ Value Size Description
+ ----- ---- -----------
+(Rec-CTL) 0x0018 2 bytes Tag for this "extra" block type
+ CSize 2 bytes Size of total extra block data
+ Tag1 2 bytes Record control attribute 1
+ Size1 2 bytes Size of attribute 1, in bytes
+ Data1 Size1 Attribute 1 data
+ .
+ .
+ .
+ TagN 2 bytes Record control attribute N
+ SizeN 2 bytes Size of attribute N, in bytes
+ DataN SizeN Attribute N data
+
+
+ -PKCS#7 Encryption Recipient Certificate List (0x0019): (EFS)
+ =====================================================
+
+ This field contains the information about each of the certificates
+ that files may be encrypted with. This field should only appear
+ in the archive extra data record. This field is not required and
+ serves only to aide archive modifications by preserving public
+ encryption data. Individual security requirements may dictate
+ that this data be omitted to deter information exposure.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (CStore) 0x0019 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the store data
+ TData TSize Data about the store
+
+ TData:
+
+ Value Size Description
+ ----- ---- -----------
+ Version 2 bytes Format version number - must 0x0001 at this time
+ CStore (var) PKCS#7 data blob
+
+
+ -MVS Extra Field (PKWARE, 0x0065):
+ ================================
+
+ The following is the layout of the MVS "extra" block.
+ Note: Some fields are stored in Big Endian format.
+ All text is in EBCDIC format unless otherwise specified.
+
+ Value Size Description
+ ----- ---- -----------
+ (MVS) 0x0065 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size for the following data block
+ ID 4 bytes EBCDIC "Z390" 0xE9F3F9F0 or
+ "T4MV" for TargetFour
+ (var) TSize-4 Attribute data
+
+
+ -OS/400 Extra Field (0x0065):
+ ===========================
+
+ The following is the layout of the OS/400 "extra" block.
+ Note: Some fields are stored in Big Endian format.
+ All text is in EBCDIC format unless otherwise specified.
+
+ Value Size Description
+ ----- ---- -----------
+ (OS400) 0x0065 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size for the following data block
+ ID 4 bytes EBCDIC "I400" 0xC9F4F0F0 or
+ "T4MV" for TargetFour
+ (var) TSize-4 Attribute data
+
+
+ -Extended Timestamp Extra Field:
+ ==============================
+
+ The following is the layout of the extended-timestamp extra block.
+ (Last Revision 19970118)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (time) 0x5455 Short tag for this extra block type ("UT")
+ TSize Short total data size for this block
+ Flags Byte info bits
+ (ModTime) Long time of last modification (UTC/GMT)
+ (AcTime) Long time of last access (UTC/GMT)
+ (CrTime) Long time of original creation (UTC/GMT)
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (time) 0x5455 Short tag for this extra block type ("UT")
+ TSize Short total data size for this block
+ Flags Byte info bits (refers to local header!)
+ (ModTime) Long time of last modification (UTC/GMT)
+
+ The central-header extra field contains the modification time only,
+ or no timestamp at all. TSize is used to flag its presence or
+ absence. But note:
+
+ If "Flags" indicates that Modtime is present in the local header
+ field, it MUST be present in the central header field, too!
+ This correspondence is required because the modification time
+ value may be used to support trans-timezone freshening and
+ updating operations with zip archives.
+
+ The time values are in standard Unix signed-long format, indicating
+ the number of seconds since 1 January 1970 00:00:00. The times
+ are relative to Coordinated Universal Time (UTC), also sometimes
+ referred to as Greenwich Mean Time (GMT). To convert to local time,
+ the software must know the local timezone offset from UTC/GMT.
+
+ The lower three bits of Flags in both headers indicate which time-
+ stamps are present in the LOCAL extra field:
+
+ bit 0 if set, modification time is present
+ bit 1 if set, access time is present
+ bit 2 if set, creation time is present
+ bits 3-7 reserved for additional timestamps; not set
+
+ Those times that are present will appear in the order indicated, but
+ any combination of times may be omitted. (Creation time may be
+ present without access time, for example.) TSize should equal
+ (1 + 4*(number of set bits in Flags)), as the block is currently
+ defined. Other timestamps may be added in the future.
+
+
+ -Info-ZIP Unix Extra Field (type 1):
+ ==================================
+
+ The following is the layout of the old Info-ZIP extra block for
+ Unix. It has been replaced by the extended-timestamp extra block
+ (0x5455) and the Unix type 2 extra block (0x7855).
+ (Last Revision 19970118)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (Unix1) 0x5855 Short tag for this extra block type ("UX")
+ TSize Short total data size for this block
+ AcTime Long time of last access (UTC/GMT)
+ ModTime Long time of last modification (UTC/GMT)
+ UID Short Unix user ID (optional)
+ GID Short Unix group ID (optional)
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (Unix1) 0x5855 Short tag for this extra block type ("UX")
+ TSize Short total data size for this block
+ AcTime Long time of last access (GMT/UTC)
+ ModTime Long time of last modification (GMT/UTC)
+
+ The file access and modification times are in standard Unix signed-
+ long format, indicating the number of seconds since 1 January 1970
+ 00:00:00. The times are relative to Coordinated Universal Time
+ (UTC), also sometimes referred to as Greenwich Mean Time (GMT). To
+ convert to local time, the software must know the local timezone
+ offset from UTC/GMT. The modification time may be used by non-Unix
+ systems to support inter-timezone freshening and updating of zip
+ archives.
+
+ The local-header extra block may optionally contain UID and GID
+ info for the file. The local-header TSize value is the only
+ indication of this. Note that Unix UIDs and GIDs are usually
+ specific to a particular machine, and they generally require root
+ access to restore.
+
+ This extra field type is obsolete, but it has been in use since
+ mid-1994. Therefore future archiving software should continue to
+ support it. Some guidelines:
+
+ An archive member should either contain the old "Unix1"
+ extra field block or the new extra field types "time" and/or
+ "Unix2".
+
+ If both the old "Unix1" block type and one or both of the new
+ block types "time" and "Unix2" are found, the "Unix1" block
+ should be considered invalid and ignored.
+
+ Unarchiving software should recognize both old and new extra
+ field block types, but the info from new types overrides the
+ old "Unix1" field.
+
+ Archiving software should recognize "Unix1" extra fields for
+ timestamp comparison but never create it for updated, freshened
+ or new archive members. When copying existing members to a new
+ archive, any "Unix1" extra field blocks should be converted to
+ the new "time" and/or "Unix2" types.
+
+
+ -Info-ZIP Unix Extra Field (type 2):
+ ==================================
+
+ The following is the layout of the new Info-ZIP extra block for
+ Unix. (Last Revision 19960922)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (Unix2) 0x7855 Short tag for this extra block type ("Ux")
+ TSize Short total data size for this block (4)
+ UID Short Unix user ID
+ GID Short Unix group ID
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (Unix2) 0x7855 Short tag for this extra block type ("Ux")
+ TSize Short total data size for this block (0)
+
+ The data size of the central-header version is zero; it is used
+ solely as a flag that UID/GID info is present in the local-header
+ extra field. If additional fields are ever added to the local
+ version, the central version may be extended to indicate this.
+
+ Note that Unix UIDs and GIDs are usually specific to a particular
+ machine, and they generally require root access to restore.
+
+
+ -ASi Unix Extra Field:
+ ====================
+
+ The following is the layout of the ASi extra block for Unix. The
+ local-header and central-header versions are identical.
+ (Last Revision 19960916)
+
+ Value Size Description
+ ----- ---- -----------
+ (Unix3) 0x756e Short tag for this extra block type ("nu")
+ TSize Short total data size for this block
+ CRC Long CRC-32 of the remaining data
+ Mode Short file permissions
+ SizDev Long symlink'd size OR major/minor dev num
+ UID Short user ID
+ GID Short group ID
+ (var.) variable symbolic link filename
+
+ Mode is the standard Unix st_mode field from struct stat, containing
+ user/group/other permissions, setuid/setgid and symlink info, etc.
+
+ If Mode indicates that this file is a symbolic link, SizDev is the
+ size of the file to which the link points. Otherwise, if the file
+ is a device, SizDev contains the standard Unix st_rdev field from
+ struct stat (includes the major and minor numbers of the device).
+ SizDev is undefined in other cases.
+
+ If Mode indicates that the file is a symbolic link, the final field
+ will be the name of the file to which the link points. The file-
+ name length can be inferred from TSize.
+
+ [Note that TSize may incorrectly refer to the data size not counting
+ the CRC; i.e., it may be four bytes too small.]
+
+
+ -BeOS Extra Field:
+ ================
+
+ The following is the layout of the file-attributes extra block for
+ BeOS. (Last Revision 19970531)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (BeOS) 0x6542 Short tag for this extra block type ("Be")
+ TSize Short total data size for this block
+ BSize Long uncompressed file attribute data size
+ Flags Byte info bits
+ (CType) Short compression type
+ (CRC) Long CRC value for uncompressed file attribs
+ Attribs variable file attribute data
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (BeOS) 0x6542 Short tag for this extra block type ("Be")
+ TSize Short total data size for this block (5)
+ BSize Long size of uncompr. local EF block data
+ Flags Byte info bits
+
+ The least significant bit of Flags in both headers indicates whether
+ the LOCAL extra field is uncompressed (and therefore whether CType
+ and CRC are omitted):
+
+ bit 0 if set, Attribs is uncompressed (no CType, CRC)
+ bits 1-7 reserved; if set, assume error or unknown data
+
+ Currently the only supported compression types are deflated (type 8)
+ and stored (type 0); the latter is not used by Info-ZIP's Zip but is
+ supported by UnZip.
+
+ Attribs is a BeOS-specific block of data in big-endian format with
+ the following structure (if compressed, uncompress it first):
+
+ Value Size Description
+ ----- ---- -----------
+ Name variable attribute name (null-terminated string)
+ Type Long attribute type (32-bit unsigned integer)
+ Size Long Long data size for this sub-block (64 bits)
+ Data variable attribute data
+
+ The attribute structure is repeated for every attribute. The Data
+ field may contain anything--text, flags, bitmaps, etc.
+
+
+ -AtheOS Extra Field:
+ ==================
+
+ The following is the layout of the file-attributes extra block for
+ AtheOS. This field is a very close spin-off from the BeOS e.f.
+ The only differences are:
+ - a new extra field signature
+ - numeric field in the attributes data are stored in little-endian
+ format ("i386" was initial hardware for AtheOS)
+ (Last Revision 20040908)
+
+ Local-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (AtheOS) 0x7441 Short tag for this extra block type ("At")
+ TSize Short total data size for this block
+ BSize Long uncompressed file attribute data size
+ Flags Byte info bits
+ (CType) Short compression type
+ (CRC) Long CRC value for uncompressed file attribs
+ Attribs variable file attribute data
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (AtheOS) 0x7441 Short tag for this extra block type ("At")
+ TSize Short total data size for this block (5)
+ BSize Long size of uncompr. local EF block data
+ Flags Byte info bits
+
+ The least significant bit of Flags in both headers indicates whether
+ the LOCAL extra field is uncompressed (and therefore whether CType
+ and CRC are omitted):
+
+ bit 0 if set, Attribs is uncompressed (no CType, CRC)
+ bits 1-7 reserved; if set, assume error or unknown data
+
+ Currently the only supported compression types are deflated (type 8)
+ and stored (type 0); the latter is not used by Info-ZIP's Zip but is
+ supported by UnZip.
+
+ Attribs is a AtheOS-specific block of data in little-endian format
+ with the following structure (if compressed, uncompress it first):
+
+ Value Size Description
+ ----- ---- -----------
+ Name variable attribute name (null-terminated string)
+ Type Long attribute type (32-bit unsigned integer)
+ Size Long Long data size for this sub-block (64 bits)
+ Data variable attribute data
+
+ The attribute structure is repeated for every attribute. The Data
+ field may contain anything--text, flags, bitmaps, etc.
+
+
+ -SMS/QDOS Extra Field:
+ ====================
+
+ The following is the layout of the file-attributes extra block for
+ SMS/QDOS. The local-header and central-header versions are identical.
+ (Last Revision 19960929)
+
+ Value Size Description
+ ----- ---- -----------
+ (QDOS) 0xfb4a Short tag for this extra block type
+ TSize Short total data size for this block
+ LongID Long extra-field signature
+ (ExtraID) Long additional signature/flag bytes
+ QDirect 64 bytes qdirect structure
+
+ LongID may be "QZHD" or "QDOS". In the latter case, ExtraID will
+ be present. Its first three bytes are "02\0"; the last byte is
+ currently undefined.
+
+ QDirect contains the file's uncompressed directory info (qdirect
+ struct). Its elements are in native (big-endian) format:
+
+ d_length beLong file length
+ d_access byte file access type
+ d_type byte file type
+ d_datalen beLong data length
+ d_reserved beLong unused
+ d_szname beShort size of filename
+ d_name 36 bytes filename
+ d_update beLong time of last update
+ d_refdate beLong file version number
+ d_backup beLong time of last backup (archive date)
+
+
+ -AOS/VS Extra Field:
+ ==================
+
+ The following is the layout of the extra block for Data General
+ AOS/VS. The local-header and central-header versions are identical.
+ (Last Revision 19961125)
+
+ Value Size Description
+ ----- ---- -----------
+ (AOSVS) 0x5356 Short tag for this extra block type ("VS")
+ TSize Short total data size for this block
+ "FCI\0" Long extra-field signature
+ Version Byte version of AOS/VS extra block (10 = 1.0)
+ Fstat variable fstat packet
+ AclBuf variable raw ACL data ($MXACL bytes)
+
+ Fstat contains the file's uncompressed fstat packet, which is one of
+ the following:
+
+ normal fstat packet (P_FSTAT struct)
+ DIR/CPD fstat packet (P_FSTAT_DIR struct)
+ unit (device) fstat packet (P_FSTAT_UNIT struct)
+ IPC file fstat packet (P_FSTAT_IPC struct)
+
+ AclBuf contains the raw ACL data; its length is $MXACL.
+
+
+ -Tandem NSK Extra Field:
+ ======================
+
+ The following is the layout of the file-attributes extra block for
+ Tandem NSK. The local-header and central-header versions are
+ identical. (Last Revision 19981221)
+
+ Value Size Description
+ ----- ---- -----------
+ (TA) 0x4154 Short tag for this extra block type ("TA")
+ TSize Short total data size for this block (20)
+ NSKattrs 20 Bytes NSK attributes
+
+
+ -THEOS Extra Field:
+ =================
+
+ The following is the layout of the file-attributes extra block for
+ Theos. The local-header and central-header versions are identical.
+ (Last Revision 19990206)
+
+ Value Size Description
+ ----- ---- -----------
+ (Theos) 0x6854 Short 'Th' signature
+ size Short size of extra block
+ flags Byte reserved for future use
+ filesize Long file size
+ fileorg Byte type of file (see below)
+ keylen Short key length for indexed and keyed files,
+ data segment size for 16 bits programs
+ reclen Short record length for indexed,keyed and direct,
+ text segment size for 16 bits programs
+ filegrow Byte growing factor for indexed,keyed and direct
+ protect Byte protections (see below)
+ reserved Short reserved for future use
+
+ File types
+ ==========
+
+ 0x80 library (keyed access list of files)
+ 0x40 directory
+ 0x10 stream file
+ 0x08 direct file
+ 0x04 keyed file
+ 0x02 indexed file
+ 0x0e reserved
+ 0x01 16 bits real mode program (obsolete)
+ 0x21 16 bits protected mode program
+ 0x41 32 bits protected mode program
+
+ Protection codes
+ ================
+
+ User protection
+ ---------------
+ 0x01 non readable
+ 0x02 non writable
+ 0x04 non executable
+ 0x08 non erasable
+
+ Other protection
+ ----------------
+ 0x10 non readable
+ 0x20 non writable
+ 0x40 non executable Theos before 4.0
+ 0x40 modified Theos 4.x
+ 0x80 not hidden
+
+
+ -THEOS old inofficial Extra Field:
+ ================================
+
+ The following is the layout of an inoffical former version of a
+ Theos file-attributes extra blocks. This layout was never published
+ and is no longer created. However, UnZip can optionally support it
+ when compiling with the option flag OLD_THEOS_EXTRA defined.
+ Both the local-header and central-header versions are identical.
+ (Last Revision 19990206)
+
+ Value Size Description
+ ----- ---- -----------
+ (THS0) 0x4854 Short 'TH' signature
+ size Short size of extra block
+ flags Short reserved for future use
+ filesize Long file size
+ reclen Short record length for indexed,keyed and direct,
+ text segment size for 16 bits programs
+ keylen Short key length for indexed and keyed files,
+ data segment size for 16 bits programs
+ filegrow Byte growing factor for indexed,keyed and direct
+ reserved 3 Bytes reserved for future use
+
+
+ -FWKCS MD5 Extra Field (0x4b46):
+ ==============================
+
+ The FWKCS Contents_Signature System, used in automatically
+ identifying files independent of filename, optionally adds
+ and uses an extra field to support the rapid creation of
+ an enhanced contents_signature.
+ There is no local-header version; the following applies
+ only to the central header. (Last Revision 19961207)
+
+ Central-header version:
+
+ Value Size Description
+ ----- ---- -----------
+ (MD5) 0x4b46 Short tag for this extra block type ("FK")
+ TSize Short total data size for this block (19)
+ "MD5" 3 bytes extra-field signature
+ MD5hash 16 bytes 128-bit MD5 hash of uncompressed data
+ (low byte first)
+
+ When FWKCS revises a .ZIP file central directory to add
+ this extra field for a file, it also replaces the
+ central directory entry for that file's uncompressed
+ file length with a measured value.
+
+ FWKCS provides an option to strip this extra field, if
+ present, from a .ZIP file central directory. In adding
+ this extra field, FWKCS preserves .ZIP file Authenticity
+ Verification; if stripping this extra field, FWKCS
+ preserves all versions of AV through PKZIP version 2.04g.
+
+ FWKCS, and FWKCS Contents_Signature System, are
+ trademarks of Frederick W. Kantor.
+
+ (1) R. Rivest, RFC1321.TXT, MIT Laboratory for Computer
+ Science and RSA Data Security, Inc., April 1992.
+ ll.76-77: "The MD5 algorithm is being placed in the
+ public domain for review and possible adoption as a
+ standard."
+
+
+ file comment: (Variable)
+
+ The comment for this file.
+
+ number of this disk: (2 bytes)
+
+ The number of this disk, which contains central
+ directory end record. If an archive is in zip64 format
+ and the value in this field is 0xFFFF, the size will
+ be in the corresponding 4 byte zip64 end of central
+ directory field.
+
+ number of the disk with the start of the central directory: (2 bytes)
+
+ The number of the disk on which the central
+ directory starts. If an archive is in zip64 format
+ and the value in this field is 0xFFFF, the size will
+ be in the corresponding 4 byte zip64 end of central
+ directory field.
+
+ total number of entries in the central dir on this disk: (2 bytes)
+
+ The number of central directory entries on this disk.
+ If an archive is in zip64 format and the value in
+ this field is 0xFFFF, the size will be in the
+ corresponding 8 byte zip64 end of central
+ directory field.
+
+ total number of entries in the central dir: (2 bytes)
+
+ The total number of files in the .ZIP file. If an
+ archive is in zip64 format and the value in this field
+ is 0xFFFF, the size will be in the corresponding 8 byte
+ zip64 end of central directory field.
+
+ size of the central directory: (4 bytes)
+
+ The size (in bytes) of the entire central directory.
+ If an archive is in zip64 format and the value in
+ this field is 0xFFFFFFFF, the size will be in the
+ corresponding 8 byte zip64 end of central
+ directory field.
+
+ offset of start of central directory with respect to
+ the starting disk number: (4 bytes)
+
+ Offset of the start of the central directory on the
+ disk on which the central directory starts. If an
+ archive is in zip64 format and the value in this
+ field is 0xFFFFFFFF, the size will be in the
+ corresponding 8 byte zip64 end of central
+ directory field.
+
+ .ZIP file comment length: (2 bytes)
+
+ The length of the comment for this .ZIP file.
+
+ .ZIP file comment: (Variable)
+
+ The comment for this .ZIP file. ZIP file comment data
+ is stored unsecured. No encryption or data authentication
+ is applied to this area at this time. Confidential information
+ should not be stored in this section.
+
+ zip64 extensible data sector (variable size)
+
+ (currently reserved for use by PKWARE)
+
+
+ K. General notes:
+
+ 1) All fields unless otherwise noted are unsigned and stored
+ in Intel low-byte:high-byte, low-word:high-word order.
+
+ 2) String fields are not null terminated, since the
+ length is given explicitly.
+
+ 3) Local headers should not span disk boundaries. Also, even
+ though the central directory can span disk boundaries, no
+ single record in the central directory should be split
+ across disks.
+
+ 4) The entries in the central directory may not necessarily
+ be in the same order that files appear in the .ZIP file.
+
+ 5) Spanned/Split archives created using PKZIP for Windows
+ (V2.50 or greater), PKZIP Command Line (V2.50 or greater),
+ or PKZIP Explorer will include a special spanning
+ signature as the first 4 bytes of the first segment of
+ the archive. This signature (0x08074b50) will be
+ followed immediately by the local header signature for
+ the first file in the archive. A special spanning
+ marker may also appear in spanned/split archives if the
+ spanning or splitting process starts but only requires
+ one segment. In this case the 0x08074b50 signature
+ will be replaced with the temporary spanning marker
+ signature of 0x30304b50. Spanned/split archives
+ created with this special signature are compatible with
+ all versions of PKZIP from PKWARE. Split archives can
+ only be uncompressed by other versions of PKZIP that
+ know how to create a split archive.
+
+ 6) If one of the fields in the end of central directory
+ record is too small to hold required data, the field
+ should be set to -1 (0xFFFF or 0xFFFFFFFF) and the
+ Zip64 format record should be created.
+
+ 7) The end of central directory record and the
+ Zip64 end of central directory locator record must
+ reside on the same disk when splitting or spanning
+ an archive.
+
+V. UnShrinking - Method 1
+-------------------------
+
+Shrinking is a Dynamic Ziv-Lempel-Welch compression algorithm
+with partial clearing. The initial code size is 9 bits, and
+the maximum code size is 13 bits. Shrinking differs from
+conventional Dynamic Ziv-Lempel-Welch implementations in several
+respects:
+
+1) The code size is controlled by the compressor, and is not
+ automatically increased when codes larger than the current
+ code size are created (but not necessarily used). When
+ the decompressor encounters the code sequence 256
+ (decimal) followed by 1, it should increase the code size
+ read from the input stream to the next bit size. No
+ blocking of the codes is performed, so the next code at
+ the increased size should be read from the input stream
+ immediately after where the previous code at the smaller
+ bit size was read. Again, the decompressor should not
+ increase the code size used until the sequence 256,1 is
+ encountered.
+
+2) When the table becomes full, total clearing is not
+ performed. Rather, when the compressor emits the code
+ sequence 256,2 (decimal), the decompressor should clear
+ all leaf nodes from the Ziv-Lempel tree, and continue to
+ use the current code size. The nodes that are cleared
+ from the Ziv-Lempel tree are then re-used, with the lowest
+ code value re-used first, and the highest code value
+ re-used last. The compressor can emit the sequence 256,2
+ at any time.
+
+
+VI. Expanding - Methods 2-5
+---------------------------
+
+The Reducing algorithm is actually a combination of two
+distinct algorithms. The first algorithm compresses repeated
+byte sequences, and the second algorithm takes the compressed
+stream from the first algorithm and applies a probabilistic
+compression method.
+
+The probabilistic compression stores an array of 'follower
+sets' S(j), for j=0 to 255, corresponding to each possible
+ASCII character. Each set contains between 0 and 32
+characters, to be denoted as S(j)[0],...,S(j)[m], where m<32.
+The sets are stored at the beginning of the data area for a
+Reduced file, in reverse order, with S(255) first, and S(0)
+last.
+
+The sets are encoded as { N(j), S(j)[0],...,S(j)[N(j)-1] },
+where N(j) is the size of set S(j). N(j) can be 0, in which
+case the follower set for S(j) is empty. Each N(j) value is
+encoded in 6 bits, followed by N(j) eight bit character values
+corresponding to S(j)[0] to S(j)[N(j)-1] respectively. If
+N(j) is 0, then no values for S(j) are stored, and the value
+for N(j-1) immediately follows.
+
+Immediately after the follower sets, is the compressed data
+stream. The compressed data stream can be interpreted for the
+probabilistic decompression as follows:
+
+
+let Last-Character <- 0.
+loop until done
+ if the follower set S(Last-Character) is empty then
+ read 8 bits from the input stream, and copy this
+ value to the output stream.
+ otherwise if the follower set S(Last-Character) is non-empty then
+ read 1 bit from the input stream.
+ if this bit is not zero then
+ read 8 bits from the input stream, and copy this
+ value to the output stream.
+ otherwise if this bit is zero then
+ read B(N(Last-Character)) bits from the input
+ stream, and assign this value to I.
+ Copy the value of S(Last-Character)[I] to the
+ output stream.
+
+ assign the last value placed on the output stream to
+ Last-Character.
+end loop
+
+
+B(N(j)) is defined as the minimal number of bits required to
+encode the value N(j)-1.
+
+
+The decompressed stream from above can then be expanded to
+re-create the original file as follows:
+
+
+let State <- 0.
+
+loop until done
+ read 8 bits from the input stream into C.
+ case State of
+ 0: if C is not equal to DLE (144 decimal) then
+ copy C to the output stream.
+ otherwise if C is equal to DLE then
+ let State <- 1.
+
+ 1: if C is non-zero then
+ let V <- C.
+ let Len <- L(V)
+ let State <- F(Len).
+ otherwise if C is zero then
+ copy the value 144 (decimal) to the output stream.
+ let State <- 0
+
+ 2: let Len <- Len + C
+ let State <- 3.
+
+ 3: move backwards D(V,C) bytes in the output stream
+ (if this position is before the start of the output
+ stream, then assume that all the data before the
+ start of the output stream is filled with zeros).
+ copy Len+3 bytes from this position to the output stream.
+ let State <- 0.
+ end case
+end loop
+
+
+The functions F,L, and D are dependent on the 'compression
+factor', 1 through 4, and are defined as follows:
+
+For compression factor 1:
+ L(X) equals the lower 7 bits of X.
+ F(X) equals 2 if X equals 127 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 1 bit of X) * 256 + Y + 1.
+For compression factor 2:
+ L(X) equals the lower 6 bits of X.
+ F(X) equals 2 if X equals 63 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 2 bits of X) * 256 + Y + 1.
+For compression factor 3:
+ L(X) equals the lower 5 bits of X.
+ F(X) equals 2 if X equals 31 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 3 bits of X) * 256 + Y + 1.
+For compression factor 4:
+ L(X) equals the lower 4 bits of X.
+ F(X) equals 2 if X equals 15 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 4 bits of X) * 256 + Y + 1.
+
+
+VII. Imploding - Method 6
+-------------------------
+
+The Imploding algorithm is actually a combination of two distinct
+algorithms. The first algorithm compresses repeated byte
+sequences using a sliding dictionary. The second algorithm is
+used to compress the encoding of the sliding dictionary output,
+using multiple Shannon-Fano trees.
+
+The Imploding algorithm can use a 4K or 8K sliding dictionary
+size. The dictionary size used can be determined by bit 1 in the
+general purpose flag word; a 0 bit indicates a 4K dictionary
+while a 1 bit indicates an 8K dictionary.
+
+The Shannon-Fano trees are stored at the start of the compressed
+file. The number of trees stored is defined by bit 2 in the
+general purpose flag word; a 0 bit indicates two trees stored, a
+1 bit indicates three trees are stored. If 3 trees are stored,
+the first Shannon-Fano tree represents the encoding of the
+Literal characters, the second tree represents the encoding of
+the Length information, the third represents the encoding of the
+Distance information. When 2 Shannon-Fano trees are stored, the
+Length tree is stored first, followed by the Distance tree.
+
+The Literal Shannon-Fano tree, if present is used to represent
+the entire ASCII character set, and contains 256 values. This
+tree is used to compress any data not compressed by the sliding
+dictionary algorithm. When this tree is present, the Minimum
+Match Length for the sliding dictionary is 3. If this tree is
+not present, the Minimum Match Length is 2.
+
+The Length Shannon-Fano tree is used to compress the Length part
+of the (length,distance) pairs from the sliding dictionary
+output. The Length tree contains 64 values, ranging from the
+Minimum Match Length, to 63 plus the Minimum Match Length.
+
+The Distance Shannon-Fano tree is used to compress the Distance
+part of the (length,distance) pairs from the sliding dictionary
+output. The Distance tree contains 64 values, ranging from 0 to
+63, representing the upper 6 bits of the distance value. The
+distance values themselves will be between 0 and the sliding
+dictionary size, either 4K or 8K.
+
+The Shannon-Fano trees themselves are stored in a compressed
+format. The first byte of the tree data represents the number of
+bytes of data representing the (compressed) Shannon-Fano tree
+minus 1. The remaining bytes represent the Shannon-Fano tree
+data encoded as:
+
+ High 4 bits: Number of values at this bit length + 1. (1 - 16)
+ Low 4 bits: Bit Length needed to represent value + 1. (1 - 16)
+
+The Shannon-Fano codes can be constructed from the bit lengths
+using the following algorithm:
+
+1) Sort the Bit Lengths in ascending order, while retaining the
+ order of the original lengths stored in the file.
+
+2) Generate the Shannon-Fano trees:
+
+ Code <- 0
+ CodeIncrement <- 0
+ LastBitLength <- 0
+ i <- number of Shannon-Fano codes - 1 (either 255 or 63)
+
+ loop while i >= 0
+ Code = Code + CodeIncrement
+ if BitLength(i) <> LastBitLength then
+ LastBitLength=BitLength(i)
+ CodeIncrement = 1 shifted left (16 - LastBitLength)
+ ShannonCode(i) = Code
+ i <- i - 1
+ end loop
+
+
+3) Reverse the order of all the bits in the above ShannonCode()
+ vector, so that the most significant bit becomes the least
+ significant bit. For example, the value 0x1234 (hex) would
+ become 0x2C48 (hex).
+
+4) Restore the order of Shannon-Fano codes as originally stored
+ within the file.
+
+Example:
+
+ This example will show the encoding of a Shannon-Fano tree
+ of size 8. Notice that the actual Shannon-Fano trees used
+ for Imploding are either 64 or 256 entries in size.
+
+Example: 0x02, 0x42, 0x01, 0x13
+
+ The first byte indicates 3 values in this table. Decoding the
+ bytes:
+ 0x42 = 5 codes of 3 bits long
+ 0x01 = 1 code of 2 bits long
+ 0x13 = 2 codes of 4 bits long
+
+ This would generate the original bit length array of:
+ (3, 3, 3, 3, 3, 2, 4, 4)
+
+ There are 8 codes in this table for the values 0 thru 7. Using
+ the algorithm to obtain the Shannon-Fano codes produces:
+
+ Reversed Order Original
+Val Sorted Constructed Code Value Restored Length
+--- ------ ----------------- -------- -------- ------
+0: 2 1100000000000000 11 101 3
+1: 3 1010000000000000 101 001 3
+2: 3 1000000000000000 001 110 3
+3: 3 0110000000000000 110 010 3
+4: 3 0100000000000000 010 100 3
+5: 3 0010000000000000 100 11 2
+6: 4 0001000000000000 1000 1000 4
+7: 4 0000000000000000 0000 0000 4
+
+
+The values in the Val, Order Restored and Original Length columns
+now represent the Shannon-Fano encoding tree that can be used for
+decoding the Shannon-Fano encoded data. How to parse the
+variable length Shannon-Fano values from the data stream is beyond
+the scope of this document. (See the references listed at the end of
+this document for more information.) However, traditional decoding
+schemes used for Huffman variable length decoding, such as the
+Greenlaw algorithm, can be successfully applied.
+
+The compressed data stream begins immediately after the
+compressed Shannon-Fano data. The compressed data stream can be
+interpreted as follows:
+
+loop until done
+ read 1 bit from input stream.
+
+ if this bit is non-zero then (encoded data is literal data)
+ if Literal Shannon-Fano tree is present
+ read and decode character using Literal Shannon-Fano tree.
+ otherwise
+ read 8 bits from input stream.
+ copy character to the output stream.
+ otherwise (encoded data is sliding dictionary match)
+ if 8K dictionary size
+ read 7 bits for offset Distance (lower 7 bits of offset).
+ otherwise
+ read 6 bits for offset Distance (lower 6 bits of offset).
+
+ using the Distance Shannon-Fano tree, read and decode the
+ upper 6 bits of the Distance value.
+
+ using the Length Shannon-Fano tree, read and decode
+ the Length value.
+
+ Length <- Length + Minimum Match Length
+
+ if Length = 63 + Minimum Match Length
+ read 8 bits from the input stream,
+ add this value to Length.
+
+ move backwards Distance+1 bytes in the output stream, and
+ copy Length characters from this position to the output
+ stream. (if this position is before the start of the output
+ stream, then assume that all the data before the start of
+ the output stream is filled with zeros).
+end loop
+
+VIII. Tokenizing - Method 7
+---------------------------
+
+This method is not used by PKZIP.
+
+IX. Deflating - Method 8
+------------------------
+
+The Deflate algorithm is similar to the Implode algorithm using
+a sliding dictionary of up to 32K with secondary compression
+from Huffman/Shannon-Fano codes.
+
+The compressed data is stored in blocks with a header describing
+the block and the Huffman codes used in the data block. The header
+format is as follows:
+
+ Bit 0: Last Block bit This bit is set to 1 if this is the last
+ compressed block in the data.
+ Bits 1-2: Block type
+ 00 (0) - Block is stored - All stored data is byte aligned.
+ Skip bits until next byte, then next word = block
+ length, followed by the ones compliment of the block
+ length word. Remaining data in block is the stored
+ data.
+
+ 01 (1) - Use fixed Huffman codes for literal and distance codes.
+ Lit Code Bits Dist Code Bits
+ --------- ---- --------- ----
+ 0 - 143 8 0 - 31 5
+ 144 - 255 9
+ 256 - 279 7
+ 280 - 287 8
+
+ Literal codes 286-287 and distance codes 30-31 are
+ never used but participate in the huffman construction.
+
+ 10 (2) - Dynamic Huffman codes. (See expanding Huffman codes)
+
+ 11 (3) - Reserved - Flag a "Error in compressed data" if seen.
+
+Expanding Huffman Codes
+-----------------------
+If the data block is stored with dynamic Huffman codes, the Huffman
+codes are sent in the following compressed format:
+
+ 5 Bits: # of Literal codes sent - 257 (257 - 286)
+ All other codes are never sent.
+ 5 Bits: # of Dist codes - 1 (1 - 32)
+ 4 Bits: # of Bit Length codes - 4 (4 - 19)
+
+The Huffman codes are sent as bit lengths and the codes are built as
+described in the implode algorithm. The bit lengths themselves are
+compressed with Huffman codes. There are 19 bit length codes:
+
+ 0 - 15: Represent bit lengths of 0 - 15
+ 16: Copy the previous bit length 3 - 6 times.
+ The next 2 bits indicate repeat length (0 = 3, ... ,3 = 6)
+ Example: Codes 8, 16 (+2 bits 11), 16 (+2 bits 10) will
+ expand to 12 bit lengths of 8 (1 + 6 + 5)
+ 17: Repeat a bit length of 0 for 3 - 10 times. (3 bits of length)
+ 18: Repeat a bit length of 0 for 11 - 138 times (7 bits of length)
+
+The lengths of the bit length codes are sent packed 3 bits per value
+(0 - 7) in the following order:
+
+ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15
+
+The Huffman codes should be built as described in the Implode algorithm
+except codes are assigned starting at the shortest bit length, i.e. the
+shortest code should be all 0's rather than all 1's. Also, codes with
+a bit length of zero do not participate in the tree construction. The
+codes are then used to decode the bit lengths for the literal and
+distance tables.
+
+The bit lengths for the literal tables are sent first with the number
+of entries sent described by the 5 bits sent earlier. There are up
+to 286 literal characters; the first 256 represent the respective 8
+bit character, code 256 represents the End-Of-Block code, the remaining
+29 codes represent copy lengths of 3 thru 258. There are up to 30
+distance codes representing distances from 1 thru 32k as described
+below.
+
+ Length Codes
+ ------------
+ Extra Extra Extra Extra
+ Code Bits Length Code Bits Lengths Code Bits Lengths Code Bits Length(s)
+ ---- ---- ------ ---- ---- ------- ---- ---- ------- ---- ---- ---------
+ 257 0 3 265 1 11,12 273 3 35-42 281 5 131-162
+ 258 0 4 266 1 13,14 274 3 43-50 282 5 163-194
+ 259 0 5 267 1 15,16 275 3 51-58 283 5 195-226
+ 260 0 6 268 1 17,18 276 3 59-66 284 5 227-258
+ 261 0 7 269 2 19-22 277 4 67-82 285 0 258
+ 262 0 8 270 2 23-26 278 4 83-98
+ 263 0 9 271 2 27-30 279 4 99-114
+ 264 0 10 272 2 31-34 280 4 115-130
+
+ Distance Codes
+ --------------
+ Extra Extra Extra Extra
+ Code Bits Dist Code Bits Dist Code Bits Distance Code Bits Distance
+ ---- ---- ---- ---- ---- ------ ---- ---- -------- ---- ---- --------
+ 0 0 1 8 3 17-24 16 7 257-384 24 11 4097-6144
+ 1 0 2 9 3 25-32 17 7 385-512 25 11 6145-8192
+ 2 0 3 10 4 33-48 18 8 513-768 26 12 8193-12288
+ 3 0 4 11 4 49-64 19 8 769-1024 27 12 12289-16384
+ 4 1 5,6 12 5 65-96 20 9 1025-1536 28 13 16385-24576
+ 5 1 7,8 13 5 97-128 21 9 1537-2048 29 13 24577-32768
+ 6 2 9-12 14 6 129-192 22 10 2049-3072
+ 7 2 13-16 15 6 193-256 23 10 3073-4096
+
+The compressed data stream begins immediately after the
+compressed header data. The compressed data stream can be
+interpreted as follows:
+
+do
+ read header from input stream.
+
+ if stored block
+ skip bits until byte aligned
+ read count and 1's compliment of count
+ copy count bytes data block
+ otherwise
+ loop until end of block code sent
+ decode literal character from input stream
+ if literal < 256
+ copy character to the output stream
+ otherwise
+ if literal = end of block
+ break from loop
+ otherwise
+ decode distance from input stream
+
+ move backwards distance bytes in the output stream, and
+ copy length characters from this position to the output
+ stream.
+ end loop
+while not last block
+
+if data descriptor exists
+ skip bits until byte aligned
+ check data descriptor signature
+ read crc and sizes
+endif
+
+X. Enhanced Deflating - Method 9
+--------------------------------
+
+The Enhanced Deflating algorithm is similar to Deflate but
+uses a sliding dictionary of up to 64K. Deflate64(tm) is supported
+by the Deflate extractor.
+
+[This description is inofficial. It has been deduced by Info-ZIP from
+close inspection of PKZIP 4.x Deflate64(tm) compressed output.]
+
+The Deflate64 algorithm is almost identical to the normal Deflate algorithm.
+Differences are:
+
+- The sliding window size is 64k.
+
+- The previously unused distance codes 30 and 31 are now used to describe
+ match distances from 32k-48k and 48k-64k.
+ Extra
+ Code Bits Distance
+ ---- ---- -----------
+ .. .. ...
+ 29 13 24577-32768
+ 30 14 32769-49152
+ 31 14 49153-65536
+
+- The semantics of the "maximum match length" code #258 has been changed to
+ allow the specification of arbitrary large match lengths (up to 64k).
+ Extra
+ Code Bits Lengths
+ ---- ---- ------
+ ... .. ...
+ 284 5 227-258
+ 285 16 3-65538
+
+Whereas the first two modifications fit into the framework of Deflate,
+this last change breaks compatibility with Deflate method 8. Thus, a
+Deflate64 decompressor cannot decode normal deflated data.
+
+XI. BZIP2 - Method 12
+---------------------
+
+BZIP2 is an open-source data compression algorithm developed by
+Julian Seward. Information and source code for this algorithm
+can be found on the internet.
+
+
+XII. Traditional PKWARE Encryption
+----------------------------------
+
+The following information discusses the decryption steps
+required to support traditional PKWARE encryption. This
+form of encryption is considered weak by today's standards
+and its use is recommended only for situations with
+low security needs or for compatibility with older .ZIP
+applications.
+
+XIII. Decryption
+----------------
+
+The encryption used in PKZIP was generously supplied by Roger
+Schlafly. PKWARE is grateful to Mr. Schlafly for his expert
+help and advice in the field of data encryption.
+
+PKZIP encrypts the compressed data stream. Encrypted files must
+be decrypted before they can be extracted.
+
+Each encrypted file has an extra 12 bytes stored at the start of
+the data area defining the encryption header for that file. The
+encryption header is originally set to random values, and then
+itself encrypted, using three, 32-bit keys. The key values are
+initialized using the supplied encryption password. After each byte
+is encrypted, the keys are then updated using pseudo-random number
+generation techniques in combination with the same CRC-32 algorithm
+used in PKZIP and described elsewhere in this document.
+
+The following is the basic steps required to decrypt a file:
+
+1) Initialize the three 32-bit keys with the password.
+2) Read and decrypt the 12-byte encryption header, further
+ initializing the encryption keys.
+3) Read and decrypt the compressed data stream using the
+ encryption keys.
+
+
+Step 1 - Initializing the encryption keys
+-----------------------------------------
+
+Key(0) <- 305419896
+Key(1) <- 591751049
+Key(2) <- 878082192
+
+loop for i <- 0 to length(password)-1
+ update_keys(password(i))
+end loop
+
+
+Where update_keys() is defined as:
+
+
+update_keys(char):
+ Key(0) <- crc32(key(0),char)
+ Key(1) <- Key(1) + (Key(0) & 000000ffH)
+ Key(1) <- Key(1) * 134775813 + 1
+ Key(2) <- crc32(key(2),key(1) >> 24)
+end update_keys
+
+
+Where crc32(old_crc,char) is a routine that given a CRC value and a
+character, returns an updated CRC value after applying the CRC-32
+algorithm described elsewhere in this document.
+
+
+Step 2 - Decrypting the encryption header
+-----------------------------------------
+
+The purpose of this step is to further initialize the encryption
+keys, based on random data, to render a plaintext attack on the
+data ineffective.
+
+
+Read the 12-byte encryption header into Buffer, in locations
+Buffer(0) thru Buffer(11).
+
+loop for i <- 0 to 11
+ C <- buffer(i) ^ decrypt_byte()
+ update_keys(C)
+ buffer(i) <- C
+end loop
+
+
+Where decrypt_byte() is defined as:
+
+
+unsigned char decrypt_byte()
+ local unsigned short temp
+ temp <- Key(2) | 2
+ decrypt_byte <- (temp * (temp ^ 1)) >> 8
+end decrypt_byte
+
+
+After the header is decrypted, the last 1 or 2 bytes in Buffer
+should be the high-order word/byte of the CRC for the file being
+decrypted, stored in Intel low-byte/high-byte order, or the high-order
+byte of the file time if bit 3 of the general purpose bit flag is set.
+Versions of PKZIP prior to 2.0 used a 2 byte CRC check; a 1 byte CRC check is
+used on versions after 2.0. This can be used to test if the password
+supplied is correct or not.
+
+
+Step 3 - Decrypting the compressed data stream
+----------------------------------------------
+
+The compressed data stream can be decrypted as follows:
+
+
+loop until done
+ read a character into C
+ Temp <- C ^ decrypt_byte()
+ update_keys(temp)
+ output Temp
+end loop
+
+
+XIV. Strong Encryption Specification (EFS)
+------------------------------------------
+
+Version 5.x of this specification introduced support for strong
+encryption algorithms. These algorithms can be used with either
+a password or an X.509v3 digital certificate to encrypt each file.
+This format specification supports either password or certificate
+based encryption to meet the security needs of today, to enable
+interoperability between users within both PKI and non-PKI
+environments, and to ensure interoperability between different
+computing platforms that are running a ZIP program.
+
+Password based encryption is the most common form of encryption
+people are familiar with. However, inherent weaknesses with
+passwords (e.g. susceptibility to dictionary/brute force attack)
+as well as password management and support issues make certificate
+based encryption a more secure and scalable option. Industry
+efforts and support are defining and moving towards more advanced
+security solutions built around X.509v3 digital certificates and
+Public Key Infrastructures(PKI) because of the greater scalability,
+administrative options, and more robust security over traditional
+password-based encryption.
+
+Most standard encryption algorithms are supported with this
+specification. Reference implementations for many of these
+algorithms are available from either commercial or open source
+distributors. Readily available cryptographic toolkits make
+implementation of the encryption features straight-forward.
+This document is not intended to provide a treatise on data
+encryption principles or theory. Its purpose is to document the
+data structures required for implementing interoperable data
+encryption within the .ZIP format. It is strongly recommended that
+you have a good understanding of data encryption before reading
+further.
+
+The algorithms introduced in Version 5.0 of this specification
+include:
+
+ RC2 40 bit, 64 bit, and 128 bit
+ RC4 40 bit, 64 bit, and 128 bit
+ DES
+ 3DES 112 bit and 168 bit
+
+Version 5.1 adds support for the following:
+
+ AES 128 bit, 192 bit, and 256 bit
+
+Version 6.1 introduces encryption data changes to support
+interoperability with SmartCard and USB Token certificate storage
+methods which do not support the OAEP strengthening standard.
+
+Version 6.2 introduces support for encrypting metadata by compressing
+and encrypting the central directory data structure to reduce information
+leakage. Information leakage can occur in legacy ZIP applications
+through exposure of information about a file even though that file is
+stored encrypted. The information exposed consists of file
+characteristics stored within the records and fields defined by this
+specification. This includes data such as a files name, its original
+size, timestamp and CRC32 value.
+
+Central Directory Encryption provides greater protection against
+information leakage by encrypting the Central Directory structure and
+by masking key values that are replicated in the unencrypted Local
+Header. ZIP compatible programs that cannot interpret an encrypted
+Central Directory structure cannot rely on the data in the corresponding
+Local Header for decompression information.
+
+Extra Field records that may contain information about a file that should
+not be exposed should not be stored in the Local Header and should only
+be written to the Central Directory where they can be encrypted. This
+design currently does not support streaming. Information in the End of
+Central Directory record, the ZIP64 End of Central Directory Locator,
+and the ZIP64 End of Central Directory record are not encrypted. Access
+to view data on files within a ZIP file with an encrypted Central Directory
+requires the appropriate password or private key for decryption prior to
+viewing any files, or any information about the files, in the archive.
+
+Older ZIP compatible programs not familiar with the Central Directory
+Encryption feature will no longer be able to recognize the Central
+Directory and may assume the ZIP file is corrupt. Programs that
+attempt streaming access using Local Headers will see invalid
+information for each file. Central Directory Encryption need not be
+used for every ZIP file. Its use is recommended for greater security.
+ZIP files not using Central Directory Encryption should operate as
+in the past.
+
+The details of the strong encryption specification for certificates
+remain under development as design and testing issues are worked out
+for the range of algorithms, encryption methods, certificate processing
+and cross-platform support necessary to meet the advanced security needs
+of .ZIP file users today and in the future.
+
+This feature specification is intended to support basic encryption needs
+of today, such as password support. However this specification is also
+designed to lay the foundation for future advanced security needs.
+
+Encryption provides data confidentiality and privacy. It is
+recommended that you combine X.509 digital signing with encryption
+to add authentication and non-repudiation.
+
+
+Single Password Symmetric Encryption Method:
+-------------------------------------------
+
+The Single Password Symmetric Encryption Method using strong
+encryption algorithms operates similarly to the traditional
+PKWARE encryption defined in this format. Additional data
+structures are added to support the processing needs of the
+strong algorithms.
+
+The Strong Encryption data structures are:
+
+1. General Purpose Bits - Bits 0 and 6 of the General Purpose bit
+flag in both local and central header records. Both bits set
+indicates strong encryption. Bit 13, when set indicates the Central
+Directory is encrypted and that selected fields in the Local Header
+are masked to hide their actual value.
+
+
+2. Extra Field 0x0017 in central header only.
+
+ Fields to consider in this record are:
+
+ Format - the data format identifier for this record. The only
+ value allowed at this time is the integer value 2.
+
+ AlgId - integer identifier of the encryption algorithm from the
+ following range
+
+ 0x6601 - DES
+ 0x6602 - RC2 (version needed to extract < 5.2)
+ 0x6603 - 3DES 168
+ 0x6609 - 3DES 112
+ 0x660E - AES 128
+ 0x660F - AES 192
+ 0x6610 - AES 256
+ 0x6702 - RC2 (version needed to extract >= 5.2)
+ 0x6801 - RC4
+ 0xFFFF - Unknown algorithm
+
+ Bitlen - Explicit bit length of key
+
+ 40
+ 56
+ 64
+ 112
+ 128
+ 168
+ 192
+ 256
+
+ Flags - Processing flags needed for decryption
+
+ 0x0001 - Password is required to decrypt
+ 0x0002 - Certificates only
+ 0x0003 - Password or certificate required to decrypt
+
+ Values > 0x0003 reserved for certificate processing
+
+
+3. Decryption header record preceeding compressed file data.
+
+ -Decryption Header:
+
+ Value Size Description
+ ----- ---- -----------
+ IVSize 2 bytes Size of initialization vector (IV)
+ IVData IVSize Initialization vector for this file
+ Size 4 bytes Size of remaining decryption header data
+ Format 2 bytes Format definition for this record
+ AlgID 2 bytes Encryption algorithm identifier
+ Bitlen 2 bytes Bit length of encryption key
+ Flags 2 bytes Processing flags
+ ErdSize 2 bytes Size of Encrypted Random Data
+ ErdData ErdSize Encrypted Random Data
+ Reserved1 4 bytes Reserved certificate processing data
+ Reserved2 (var) Reserved for certificate processing data
+ VSize 2 bytes Size of password validation data
+ VData VSize-4 Password validation data
+ VCRC32 4 bytes Standard ZIP CRC32 of password validation data
+
+ IVData - The size of the IV should match the algorithm block size.
+ The IVData can be completely random data. If the size of
+ the randomly generated data does not match the block size
+ it should be complemented with zero's or truncated as
+ necessary. If IVSize is 0, then IV = CRC32 + Uncompressed
+ File Size (as a 64 bit little-endian, unsigned integer value).
+
+ Format - the data format identifier for this record. The only
+ value allowed at this time is the integer value 3.
+
+ AlgId - integer identifier of the encryption algorithm from the
+ following range
+
+ 0x6601 - DES
+ 0x6602 - RC2 (version needed to extract < 5.2)
+ 0x6603 - 3DES 168
+ 0x6609 - 3DES 112
+ 0x660E - AES 128
+ 0x660F - AES 192
+ 0x6610 - AES 256
+ 0x6702 - RC2 (version needed to extract >= 5.2)
+ 0x6801 - RC4
+ 0xFFFF - Unknown algorithm
+
+ Bitlen - Explicit bit length of key
+
+ 40
+ 56
+ 64
+ 112
+ 128
+ 168
+ 192
+ 256
+
+ Flags - Processing flags needed for decryption
+
+ 0x0001 - Password is required to decrypt
+ 0x0002 - Certificates only
+ 0x0003 - Password or certificate required to decrypt
+
+ Values > 0x0003 reserved for certificate processing
+
+ ErdData - Encrypted random data is used to generate a file
+ session key for encrypting each file. SHA1 is
+ used to calculate hash data used to derive keys.
+ File session keys are derived from a master session
+ key generated from the user-supplied password.
+ If the Flags field in the decryption header contains
+ the value 0x4000, then the ErdData field must be
+ decrypted using 3DES.
+
+ Reserved1 - Reserved for certificate processing, if value is
+ zero, then Reserved2 data is absent. See the explanation
+ under the Certificate Processing Method for details on
+ this data structure.
+
+ Reserved2 - If present, the size of the Reserved2 data structure
+ is located by skipping the first 4 bytes of this field
+ and using the next 2 bytes as the remaining size. See
+ the explanation under the Certificate Processing Method
+ for details on this data structure.
+
+ VSize - This size value will always include the 4 bytes of the
+ VCRC32 data and will be greater than 4 bytes.
+
+ VData - Random data for password validation. This data is VSize
+ in length and VSize must be a multiple of the encryption
+ block size. VCRC32 is a checksum value of VData.
+ VData and VCRC32 are stored encrypted and start the
+ stream of encrypted data for a file.
+
+4. Single Password Central Directory Encryption
+
+Central Directory Encryption is achieved within the .ZIP format by
+encrypting the Central Directory structure. This encapsulates the metadata
+most often used for processing .ZIP files. Additional metadata is stored for
+redundancy in the Local Header for each file. The process of concealing
+metadata by encrypting the Central Directory does not protect the data within
+the Local Header. To avoid information leakage from the exposed metadata
+in the Local Header, the fields containing information about a file are masked.
+
+Local Header:
+
+Masking replaces the true content of the fields for a file in the Local
+Header with false information. When masked, the Local Header is not
+suitable for streaming access and the options for data recovery of damaged
+archives is reduced. Extra Data fields that may contain confidential
+data should not be stored within the Local Header. The value set into
+the Version needed to extract field should be the correct value needed to
+extract the file without regard to Central Directory Encryption. The fields
+within the Local Header targeted for masking when the Central Directory is
+encrypted are:
+
+ Field Name Mask Value
+ ------------------ ---------------------------
+ compression method 0
+ last mod file time 0
+ last mod file date 0
+ crc-32 0
+ compressed size 0
+ uncompressed size 0
+ file name (variable size) Base 16 value from the
+ range 1 - FFFFFFFFFFFFFFFF
+ represented as a string whose
+ size will be set into the
+ file name length field
+
+The Base 16 value assigned as a masked file name is simply a sequentially
+incremented value for each file starting with 1 for the first file.
+Modifications to a ZIP file may cause different values to be stored for
+each file. For compatibility, the file name field in the Local Header
+should never be left blank. As of Version 6.2 of this specification,
+the Compression Method and Compressed Size fields are not yet masked.
+
+Encrypting the Central Directory:
+
+Encryption of the Central Directory does not include encryption of the
+Central Directory Signature data, the ZIP64 End of Central Directory
+record, the ZIP64 End of Central Directory Locator, or the End
+of Central Directory record. The ZIP file comment data is never
+encrypted.
+
+Before encrypting the Central Directory, it may optionally be compressed.
+Compression is not required, but for storage efficiency it is assumed
+this structure will be compressed before encrypting. Similarly, this
+specification supports compressing the Central Directory without
+requiring that it also be encrypted. Early implementations of this
+feature will assume the encryption method applied to files matches the
+encryption applied to the Central Directory.
+
+Encryption of the Central Directory is done in a manner similar to
+that of file encryption. The encrypted data is preceded by a
+decryption header. The decryption header is known as the Archive
+Decryption Header. The fields of this record are identical to
+the decryption header preceding each encrypted file. The location
+of the Archive Decryption Header is determined by the value in the
+Start of the Central Directory field in the ZIP64 End of Central
+Directory record. When the Central Directory is encrypted, the
+ZIP64 End of Central Directory record will always be present.
+
+The layout of the ZIP64 End of Central Directory record for all
+versions starting with 6.2 of this specification will follow the
+Version 2 format. The Version 2 format is as follows:
+
+The first 48 bytes will remain identical to that of Version 1.
+The record signature for both Version 1 and Version 2 will be
+0x06064b50. Immediately following the 48th byte, which identifies
+the end of the field known as the Offset of Start of Central
+Directory With Respect to the Starting Disk Number will begin the
+new fields defining Version 2 of this record.
+
+New fields for Version 2:
+
+Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ Compression Method 2 bytes Method used to compress the
+ Central Directory
+ Compressed Size 8 bytes Size of the compressed data
+ Original Size 8 bytes Original uncompressed size
+ AlgId 2 bytes Encryption algorithm ID
+ BitLen 2 bytes Encryption key length
+ Flags 2 bytes Encryption flags
+ HashID 2 bytes Hash algorithm identifier
+ Hash Length 2 bytes Length of hash data
+ Hash Data (variable) Hash data
+
+The Compression Method accepts the same range of values as the
+corresponding field in the Central Header.
+
+The Compressed Size and Original Size values will not include the
+data of the Central Directory Signature which is compressed or
+encrypted.
+
+The AlgId, BitLen, and Flags fields accept the same range of values
+the corresponding fields within the 0x0017 record.
+
+Hash ID identifies the algorithm used to hash the Central Directory
+data. This data does not have to be hashed, in which case the
+values for both the HashID and Hash Length will be 0. Possible
+values for HashID are:
+
+ Value Algorithm
+ ------ ---------
+ 0x0000 none
+ 0x0001 CRC32
+ 0x8003 MD5
+ 0x8004 SHA1
+
+When the Central Directory data is signed, the same hash algorithm
+used to hash the Central Directory for signing should be used.
+This is recommended for processing efficiency, however, it is
+permissible for any of the above algorithms to be used independent
+of the signing process.
+
+The Hash Data will contain the hash data for the Central Directory.
+The length of this data will vary depending on the algorithm used.
+
+The Version Needed to Extract should be set to 62.
+
+The value for the Total Number of Entries on the Current Disk will
+be 0. These records will no longer support random access when
+encrypting the Central Directory.
+
+When the Central Directory is compressed and/or encrypted, the
+End of Central Directory record will store the value 0xFFFFFFFF
+as the value for the Total Number of Entries in the Central
+Directory. The value stored in the Total Number of Entries in
+the Central Directory on this Disk field will be 0. The actual
+values will be stored in the equivalent fields of the ZIP64
+End of Central Directory record.
+
+Decrypting and decompressing the Central Directory is accomplished
+in the same manner as decrypting and decompressing a file.
+
+
+5. Useful Tips
+
+Strong Encryption is always applied to a file after compression. The
+block oriented algorithms all operate in Cypher Block Chaining (CBC)
+mode. The block size used for AES encryption is 16. All other block
+algorithms use a block size of 8. Two ID's are defined for RC2 to
+account for a discrepancy found in the implementation of the RC2
+algorithm in the cryptographic library on Windows XP SP1 and all
+earlier versions of Windows.
+
+A pseudo-code representation of the encryption process is as follows:
+
+Password = GetUserPassword()
+RD = Random()
+ERD = Encrypt(RD,DeriveKey(SHA1(Password)))
+For Each File
+ IV = Random()
+ VData = Random()
+ FileSessionKey = DeriveKey(SHA1(IV + RD))
+ Encrypt(VData + VCRC32 + FileData,FileSessionKey)
+Done
+
+The function names and parameter requirements will depend on
+the choice of the cryptographic toolkit selected. Almost any
+toolkit supporting the reference implementations for each
+algorithm can be used. The RSA BSAFE(r), OpenSSL, and Microsoft
+CryptoAPI libraries are all known to work well.
+
+
+Certificate Processing Method:
+-----------------------------
+
+The Certificate Processing Method for ZIP file encryption remains
+under development. The information provided here serves as a guide
+to those interested in certificate-based data decryption. This
+information may be subject to change in future versions of this
+specification and is subject to change without notice.
+
+OAEP Processing with Certificate-based Encryption:
+
+Versions of PKZIP available during this development phase of the
+certificate processing method may set a value of 61 into the
+version needed to extract field for a file. This indicates that
+non-OAEP key wrapping is used. This affects certificate encryption
+only, and password encryption functions should not be affected by
+this value. This means values of 61 may be found on files encrypted
+with certificates only, or on files encrypted with both password
+encryption and certificate encryption. Files encrypted with both
+methods can safely be decrypted using the password methods documented.
+
+OAEP stands for Optimal Asymmetric Encryption Padding. It is a
+strengthening technique used for small encoded items such as decryption
+keys. This is commonly applied in cryptographic key-wrapping techniques
+and is supported by PKCS #1. Versions 5.0 and 6.0 of this specification
+were designed to support OAEP key-wrapping for certificate-based
+decryption keys for additional security.
+
+Support for private keys stored on Smart Cards or Tokens introduced
+a conflict with this OAEP logic. Most card and token products do
+not support the additional strengthening applied to OAEP key-wrapped
+data. In order to resolve this conflict, versions 6.1 and above of this
+specification will no longer support OAEP when encrypting using
+digital certificates.
+
+Certificate Processing Data Fields:
+
+The Certificate Processing Method of this specification defines the
+following additional data fields:
+
+
+1. Certificate Flag Values
+
+Additional processing flags that can be present in the Flags field of both
+the 0x0017 field of the central directory Extra Field and the Decryption
+header record preceding compressed file data are:
+
+ 0x0007 - reserved for future use
+ 0x000F - reserved for future use
+ 0x0100 - Indicates non-OAEP key wrapping was used. If this
+ this field is set, the version needed to extract must
+ be at least 61. This means OAEP key wrapping is not
+ used when generating a Master Session Key using
+ ErdData.
+ 0x4000 - ErdData must be decrypted using 3DES-168, otherwise use the
+ same algorithm used for encrypting the file contents.
+ 0x8000 - reserved for future use
+
+
+2. CertData - Extra Field 0x0017 record certificate data structure
+
+The data structure used to store certificate data within the section
+of the Extra Field defined by the CertData field of the 0x0017
+record are as shown:
+
+ Value Size Description
+ ----- ---- -----------
+ RCount 4 bytes Number of recipients.
+ HashAlg 2 bytes Hash algorithm identifier
+ HSize 2 bytes Hash size
+ SRList (var) Simple list of recipients hashed public keys
+
+
+ RCount This defines the number intended recipients whose
+ public keys were used for encryption. This identifies
+ the number of elements in the SRList.
+
+ HashAlg This defines the hash algorithm used to calculate
+ the public key hash of each public key used
+ for encryption. This field currently supports
+ only the following value for SHA-1
+
+ 0x8004 - SHA1
+
+ HSize This defines the size of a hashed public key.
+
+ SRList This is a variable length list of the hashed
+ public keys for each intended recipient. Each
+ element in this list is HSize. The total size of
+ SRList is determined using RCount * HSize.
+
+
+3. Reserved1 - Certificate Decryption Header Reserved1 Data:
+
+ Value Size Description
+ ----- ---- -----------
+ RCount 4 bytes Number of recipients.
+
+ RCount This defines the number intended recipients whose
+ public keys were used for encryption. This defines
+ the number of elements in the REList field defined below.
+
+
+4. Reserved2 - Certificate Decryption Header Reserved2 Data Structures:
+
+
+ Value Size Description
+ ----- ---- -----------
+ HashAlg 2 bytes Hash algorithm identifier
+ HSize 2 bytes Hash size
+ REList (var) List of recipient data elements
+
+
+ HashAlg This defines the hash algorithm used to calculate
+ the public key hash of each public key used
+ for encryption. This field currently supports
+ only the following value for SHA-1
+
+ 0x8004 - SHA1
+
+ HSize This defines the size of a hashed public key
+ defined in REHData.
+
+ REList This is a variable length of list of recipient data.
+ Each element in this list consists of a Recipient
+ Element data structure as follows:
+
+
+ Recipient Element (REList) Data Structure:
+
+ Value Size Description
+ ----- ---- -----------
+ RESize 2 bytes Size of REHData + REKData
+ REHData HSize Hash of recipients public key
+ REKData (var) Simple key blob
+
+
+ RESize This defines the size of an individual REList
+ element. This value is the combined size of the
+ REHData field + REKData field. REHData is defined by
+ HSize. REKData is variable and can be calculated
+ for each REList element using RESize and HSize.
+
+ REHData Hashed public key for this recipient.
+
+ REKData Simple Key Blob. The format of this data structure
+ is identical to that defined in the Microsoft
+ CryptoAPI and generated using the CryptExportKey()
+ function. The version of the Simple Key Blob
+ supported at this time is 0x02 as defined by
+ Microsoft.
+
+5. Certificate Processing - Central Directory Encryption:
+
+Central Directory Encryption using Digital Certificates will
+operate in a manner similar to that of Single Password Central
+Directory Encryption. This record will only be present when there
+is data to place into it. Currently, data is placed into this
+record when digital certificates are used for either encrypting
+or signing the files within a ZIP file. When only password
+encryption is used with no certificate encryption or digital
+signing, this record is not currently needed. When present, this
+record will appear before the start of the actual Central Directory
+data structure and will be located immediately after the Archive
+Decryption Header if the Central Directory is encrypted.
+
+The Archive Extra Data record will be used to store the following
+information. Additional data may be added in future versions.
+
+Extra Data Fields:
+
+0x0014 - PKCS#7 Store for X.509 Certificates
+0x0016 - X.509 Certificate ID and Signature for central directory
+0x0019 - PKCS#7 Encryption Recipient Certificate List
+
+The 0x0014 and 0x0016 Extra Data records that otherwise would be
+located in the first record of the Central Directory for digital
+certificate processing. When encrypting or compressing the Central
+Directory, the 0x0014 and 0x0016 records must be located in the
+Archive Extra Data record and they should not remain in the first
+Central Directory record. The Archive Extra Data record will also
+be used to store the 0x0019 data.
+
+When present, the size of the Archive Extra Data record will be
+included in the size of the Central Directory. The data of the
+Archive Extra Data record will also be compressed and encrypted
+along with the Central Directory data structure.
+
+6. Certificate Processing Differences:
+
+The Certificate Processing Method of encryption differs from the
+Single Password Symmetric Encryption Method as follows. Instead
+of using a user-defined password to generate a master session key,
+cryptographically random data is used. The key material is then
+wrapped using standard key-wrapping techniques. This key material
+is wrapped using the public key of each recipient that will need
+to decrypt the file using their corresponding private key.
+
+This specification currently assumes digital certificates will follow
+the X.509 V3 format for 1024 bit and higher RSA format digital
+certificates. Implementation of this Certificate Processing Method
+requires supporting logic for key access and management. This logic
+is outside the scope of this specification.
+
+
+License Agreement:
+-----------------
+
+The features set forth in this Section XIV (the "Strong Encryption
+Specification") are covered by a pending patent application. Portions of
+this Strong Encryption technology are available for use at no charge
+under the following terms and conditions.
+
+1. License Grant.
+
+ a. NOTICE TO USER. PLEASE READ THIS ENTIRE SECTION XIV OF THE
+ APPNOTE (THE "AGREEMENT") CAREFULLY. BY USING ALL OR ANY PORTION OF THE
+ LICENSED TECHNOLOGY, YOU ACCEPT ALL THE TERMS AND CONDITIONS OF THIS
+ AGREEMENT AND YOU AGREE THAT THIS AGREEMENT IS ENFORCEABLE LIKE ANY
+ WRITTEN NEGOTIATED AGREEMENT SIGNED BY YOU. IF YOU DO NOT AGREE, DO NOT
+ USE THE LICENSED TECHNOLOGY.
+
+ b. Definitions.
+
+ i. "Licensed Technology" shall mean that proprietary technology now or
+ hereafter owned or controlled by PKWare, Inc. ("PKWARE") or any
+ subsidiary or affiliate that covers or is necessary to be used to give
+ software the ability to a) extract and decrypt data from zip files
+ encrypted using any methods of data encryption and key processing which
+ are published in this APPNOTE or any prior APPNOTE, as supplemented by
+ any Additional Compatibility Information; and b) encrypt file contents
+ as part of .ZIP file processing using only the Single Password Symmetric
+ Encryption Method as published in this APPNOTE or any prior APPNOTE, as
+ supplemented by any Additional Compatibility Information. For purposes
+ of this AGREEMENT, "Additional Compatibility Information" means, with
+ regard to any method of data encryption and key processing published in
+ this or any prior APPNOTE, any corrections, additions, or clarifications
+ to the information in such APPNOTE that are required in order to give
+ software the ability to successfully extract and decrypt zip files (or,
+ but solely in the case of the Single Password Symmetric Encryption Method,
+ to successfully encrypt zip files) in a manner interoperable with the
+ actual implementation of such method in any PKWARE product that is
+ documented or publicly described by PKWARE as being able to create, or
+ to extract and decrypt, zip files using that method.
+
+ ii. "Licensed Products" shall mean any products you produce that
+ incorporate the Licensed Technology.
+
+ c. License to Licensed Technology.
+
+ PKWARE hereby grants to you a non-exclusive license to use the Licensed
+ Technology for the purpose of manufacturing, offering, selling and using
+ Licensed Products, which license shall extend to permit the practice of all
+ claims in any patent or patent application (collectively, "Patents") now or
+ hereafter owned or controlled by PKWARE in any jurisdiction in the world
+ that are infringed by implementation of the Licensed Technology. You have
+ the right to sublicense rights you receive under the terms of this AGREEMENT
+ for the purpose of allowing sublicensee to manufacture, offer, sell and use
+ products that incorporate all or a portion of any of your Licensed Products,
+ but if you do, you agree to i) impose the same restrictions on any such
+ sublicensee as these terms impose on you and ii) notify the sublicensee,
+ by means chosen by you in your unfettered discretion, including a notice on
+ your web site, of the terms of this AGREEMENT and make available to each
+ sublicensee the full text of this APPNOTE. Further, PKWARE hereby grants to
+ you a non-exclusive right to reproduce and distribute, in any form, copies of
+ this APPNOTE, without modification. Notwithstanding anything to the contrary
+ in this AGREEMENT, you have the right to sublicense the rights, without any of
+ the restrictions described above or elsewhere in this AGREEMENT, to use, offer
+ to sell and sell Licensed Technology as incorporated in executable object code
+ or byte code forms of your Licensed Products. Any sublicense to use the
+ Licensed Technology incorporated in a Licensed Product granted by you shall
+ survive the termination of this AGREEMENT for any reason. PKWARE warrants that
+ this license shall continue to encumber the Licensed Technology regardless of
+ changes in ownership of the Licensed Technology.
+
+ d. Proprietary Notices.
+
+ i. With respect to any Licensed Product that is distributed by you either
+ in source code form or in the form of an object code library of externally
+ callable functions that has been designed by you for incorporation into third
+ party products, you agree to include, in the source code, or in the case of
+ an object code library, in accompanying documentation, a notice using the
+ words "patent pending" until a patent is issued to PKWARE covering any
+ portion of the Licensed Technology or PKWARE provides notice, by means
+ chosen by PKWARE in its unfettered discretion, that it no longer has any
+ patent pending covering any portion of the Licensed Technology. With respect
+ to any Licensed Product, upon your becoming aware that at least one patent has
+ been granted covering the Licensed Technology, you agree to include in any
+ revisions made by you to the documentation (or any source code distributed
+ by you) the words "Pat. No.", or "Patent Number" and the patent number or
+ numbers of the applicable patent or patents. PKWARE shall, from time to time,
+ inform you of the patent number or numbers of the patents covering the
+ Licensed Technology, by means chosen by PKWARE in its unfettered discretion,
+ including a notice on its web site. It shall be a violation of the terms of
+ this AGREEMENT for you to sell Licensed Products without complying with the
+ foregoing marking provisions.
+
+ ii. You acknowledge that the terms of this AGREEMENT do not grant you any
+ license or other right to use any PKWARE trademark in connection with the sale,
+ offering for sale, distribution and delivery of the Licensed Products, or in
+ connection with the advertising, promotion and offering of the Licensed Products.
+ You acknowledge PKWARE's ownership of the PKZIP trademark and all other marks
+ owned by PKWARE.
+
+ e. Covenant of Compliance and Remedies.
+
+ To the extent that you have elected to implement portions of the Licensed
+ Technology, you agree to use reasonable diligence to comply with those portions
+ of this Section XIV, as modified or supplemented by Additional Compatibility
+ Information available to you, describing the portions of the Licensed Technology
+ that you have elected to implement. Upon reasonable request by PKWARE, you will
+ provide written notice to PKWARE identifying which version of this APPNOTE you
+ have relied upon for your implementation of any specified Licensed Product.
+
+ If any substantial non-compliance with the terms of this AGREEMENT is determined
+ to exist, you will make such changes as necessary to bring your Licensed Products
+ into substantial compliance with the terms of this AGREEMENT. If, within sixty
+ days of receipt of notice that a Licensed Product fails to comply with the terms
+ of this AGREEMENT, you fail to make such changes as necessary to bring your
+ Licensed Products into compliance with the terms of this AGREEMENT, PKWARE may
+ terminate your rights under this AGREEMENT. PKWARE does not waive and expressly
+ reserves the right to pursue any and all additional remedies that are or may
+ become available to PKWARE.
+
+ f. Warranty and Indemnification Regarding Exportation.
+
+ You realize and acknowledge that, as between yourself and PKWARE, you are fully
+ responsible for compliance with the import and export laws and regulations of
+ any country in or to which you import or export any Licensed Products, and you
+ agree to hold PKWARE harmless from any claim of violation of any such import
+ or export laws.
+
+ g. Patent Infringement.
+
+ You agree that you will not bring or threaten to bring any action against PKWARE
+ for infringement of the claims of any patent owned or controlled by you solely
+ as a result of PKWARE's own implementation of the Licensed Technology. As its
+ exclusive remedy for your breach of the foregoing agreement, PKWARE reserves
+ the right to suspend or terminate all rights granted under the terms of this
+ AGREEMENT if you bring or threaten to bring any such action against PKWARE,
+ effective immediately upon delivery of written notice of suspension or
+ termination to you.
+
+ h. Governing Law.
+
+ The license granted in this AGREEMENT shall be governed by and construed under
+ the laws of the State of Wisconsin and the United States.
+
+ i. Revisions and Notice.
+
+ The license granted in this APPNOTE is irrevocable, except as expressly set
+ forth above. You agree and understand that any changes which PKWARE determines
+ to make to this APPNOTE shall be posted at the same location as the current
+ APPNOTE or at a location which will be identified by means chosen by PKWARE,
+ including a notice on its web site, and shall be available for adoption by you
+ immediately upon such posting, or at such other time as PKWARE shall determine.
+ Any changes to the terms of the license published in a subsequent version of
+ this AGREEMENT shall be binding upon you only with respect to your products
+ that (i) incorporate any Licensed Technology (as defined in the subsequent
+ AGREEMENT) that is not otherwise included in the definition of Licensed
+ Technology under this AGREEMENT, or (ii) that you expressly identify are to
+ be licensed under the subsequent AGREEMENT, which identification shall be by
+ written notice with reference to the APPNOTE (version and release date or other
+ unique identifier) in which the subsequent AGREEMENT is published. PKWARE
+ agrees to identify each change to this APPNOTE by using a unique version and
+ release date identifier or other unique identifier.
+
+ j. Warranty by PKWARE
+
+ PKWare, Inc. warrants that it has the right to grant the license hereunder.
+
+XV. Change Process
+------------------
+
+In order for the .ZIP file format to remain a viable definition, this
+specification should be considered as open for periodic review and
+revision. Although this format was originally designed with a
+certain level of extensibility, not all changes in technology
+(present or future) were or will be necessarily considered in its
+design. If your application requires new definitions to the
+extensible sections in this format, or if you would like to
+submit new data structures, please forward your request to
+zipformat@pkware.com. All submissions will be reviewed by the
+ZIP File Specification Committee for possible inclusion into
+future versions of this specification. Periodic revisions
+to this specification will be published to ensure interoperability.
+We encourage comments and feedback that may help improve clarity
+or content.
+
+
+XVI. Acknowledgements
+---------------------
+
+In addition to the above mentioned contributors to PKZIP and PKUNZIP,
+I would like to extend special thanks to Robert Mahoney for suggesting
+the extension .ZIP for this software.
+
+
+XVII. References
+----------------
+
+ Fiala, Edward R., and Greene, Daniel H., "Data compression with
+ finite windows", Communications of the ACM, Volume 32, Number 4,
+ April 1989, pages 490-505.
+
+ Held, Gilbert, "Data Compression, Techniques and Applications,
+ Hardware and Software Considerations", John Wiley & Sons, 1987.
+
+ Huffman, D.A., "A method for the construction of minimum-redundancy
+ codes", Proceedings of the IRE, Volume 40, Number 9, September 1952,
+ pages 1098-1101.
+
+ Nelson, Mark, "LZW Data Compression", Dr. Dobbs Journal, Volume 14,
+ Number 10, October 1989, pages 29-37.
+
+ Nelson, Mark, "The Data Compression Book", M&T Books, 1991.
+
+ Storer, James A., "Data Compression, Methods and Theory",
+ Computer Science Press, 1988
+
+ Welch, Terry, "A Technique for High-Performance Data Compression",
+ IEEE Computer, Volume 17, Number 6, June 1984, pages 8-19.
+
+ Ziv, J. and Lempel, A., "A universal algorithm for sequential data
+ compression", Communications of the ACM, Volume 30, Number 6,
+ June 1987, pages 520-540.
+
+ Ziv, J. and Lempel, A., "Compression of individual sequences via
+ variable-rate coding", IEEE Transactions on Information Theory,
+ Volume 24, Number 5, September 1978, pages 530-536.
diff --git a/dotNetZip/AppNote.txt b/dotNetZip/AppNote.txt
new file mode 100644
index 0000000..9440997
--- /dev/null
+++ b/dotNetZip/AppNote.txt
@@ -0,0 +1,3217 @@
+File: APPNOTE.TXT - .ZIP File Format Specification
+Version: 6.3.2
+Revised: September 28, 2007
+Copyright (c) 1989 - 2007 PKWARE Inc., All Rights Reserved.
+
+The use of certain technological aspects disclosed in the current
+APPNOTE is available pursuant to the below section entitled
+"Incorporating PKWARE Proprietary Technology into Your Product".
+
+I. Purpose
+----------
+
+This specification is intended to define a cross-platform,
+interoperable file storage and transfer format. Since its
+first publication in 1989, PKWARE has remained committed to
+ensuring the interoperability of the .ZIP file format through
+publication and maintenance of this specification. We trust that
+all .ZIP compatible vendors and application developers that have
+adopted and benefited from this format will share and support
+this commitment to interoperability.
+
+II. Contacting PKWARE
+---------------------
+
+ PKWARE, Inc.
+ 648 N. Plankinton Avenue, Suite 220
+ Milwaukee, WI 53203
+ +1-414-289-9788
+ +1-414-289-9789 FAX
+ zipformat@pkware.com
+
+III. Disclaimer
+---------------
+
+Although PKWARE will attempt to supply current and accurate
+information relating to its file formats, algorithms, and the
+subject programs, the possibility of error or omission cannot
+be eliminated. PKWARE therefore expressly disclaims any warranty
+that the information contained in the associated materials relating
+to the subject programs and/or the format of the files created or
+accessed by the subject programs and/or the algorithms used by
+the subject programs, or any other matter, is current, correct or
+accurate as delivered. Any risk of damage due to any possible
+inaccurate information is assumed by the user of the information.
+Furthermore, the information relating to the subject programs
+and/or the file formats created or accessed by the subject
+programs and/or the algorithms used by the subject programs is
+subject to change without notice.
+
+If the version of this file is marked as a NOTIFICATION OF CHANGE,
+the content defines an Early Feature Specification (EFS) change
+to the .ZIP file format that may be subject to modification prior
+to publication of the Final Feature Specification (FFS). This
+document may also contain information on Planned Feature
+Specifications (PFS) defining recognized future extensions.
+
+IV. Change Log
+--------------
+
+Version Change Description Date
+------- ------------------ ----------
+5.2 -Single Password Symmetric Encryption 06/02/2003
+ storage
+
+6.1.0 -Smartcard compatibility 01/20/2004
+ -Documentation on certificate storage
+
+6.2.0 -Introduction of Central Directory 04/26/2004
+ Encryption for encrypting metadata
+ -Added OS/X to Version Made By values
+
+6.2.1 -Added Extra Field placeholder for 04/01/2005
+ POSZIP using ID 0x4690
+
+ -Clarified size field on
+ "zip64 end of central directory record"
+
+6.2.2 -Documented Final Feature Specification 01/06/2006
+ for Strong Encryption
+
+ -Clarifications and typographical
+ corrections
+
+6.3.0 -Added tape positioning storage 09/29/2006
+ parameters
+
+ -Expanded list of supported hash algorithms
+
+ -Expanded list of supported compression
+ algorithms
+
+ -Expanded list of supported encryption
+ algorithms
+
+ -Added option for Unicode filename
+ storage
+
+ -Clarifications for consistent use
+ of Data Descriptor records
+
+ -Added additional "Extra Field"
+ definitions
+
+6.3.1 -Corrected standard hash values for 04/11/2007
+ SHA-256/384/512
+
+6.3.2 -Added compression method 97 09/28/2007
+
+ -Documented InfoZIP "Extra Field"
+ values for UTF-8 file name and
+ file comment storage
+
+V. General Format of a .ZIP file
+--------------------------------
+
+ Files stored in arbitrary order. Large .ZIP files can span multiple
+ volumes or be split into user-defined segment sizes. All values
+ are stored in little-endian byte order unless otherwise specified.
+
+ Overall .ZIP file format:
+
+ [local file header 1]
+ [file data 1]
+ [data descriptor 1]
+ .
+ .
+ .
+ [local file header n]
+ [file data n]
+ [data descriptor n]
+ [archive decryption header]
+ [archive extra data record]
+ [central directory]
+ [zip64 end of central directory record]
+ [zip64 end of central directory locator]
+ [end of central directory record]
+
+
+ A. Local file header:
+
+ local file header signature 4 bytes (0x04034b50)
+ version needed to extract 2 bytes
+ general purpose bit flag 2 bytes
+ compression method 2 bytes
+ last mod file time 2 bytes
+ last mod file date 2 bytes
+ crc-32 4 bytes
+ compressed size 4 bytes
+ uncompressed size 4 bytes
+ file name length 2 bytes
+ extra field length 2 bytes
+
+ file name (variable size)
+ extra field (variable size)
+
+ B. File data
+
+ Immediately following the local header for a file
+ is the compressed or stored data for the file.
+ The series of [local file header][file data][data
+ descriptor] repeats for each file in the .ZIP archive.
+
+ C. Data descriptor:
+
+ crc-32 4 bytes
+ compressed size 4 bytes
+ uncompressed size 4 bytes
+
+ This descriptor exists only if bit 3 of the general
+ purpose bit flag is set (see below). It is byte aligned
+ and immediately follows the last byte of compressed data.
+ This descriptor is used only when it was not possible to
+ seek in the output .ZIP file, e.g., when the output .ZIP file
+ was standard output or a non-seekable device. For ZIP64(tm) format
+ archives, the compressed and uncompressed sizes are 8 bytes each.
+
+ When compressing files, compressed and uncompressed sizes
+ should be stored in ZIP64 format (as 8 byte values) when a
+ files size exceeds 0xFFFFFFFF. However ZIP64 format may be
+ used regardless of the size of a file. When extracting, if
+ the zip64 extended information extra field is present for
+ the file the compressed and uncompressed sizes will be 8
+ byte values.
+
+ Although not originally assigned a signature, the value
+ 0x08074b50 has commonly been adopted as a signature value
+ for the data descriptor record. Implementers should be
+ aware that ZIP files may be encountered with or without this
+ signature marking data descriptors and should account for
+ either case when reading ZIP files to ensure compatibility.
+ When writing ZIP files, it is recommended to include the
+ signature value marking the data descriptor record. When
+ the signature is used, the fields currently defined for
+ the data descriptor record will immediately follow the
+ signature.
+
+ An extensible data descriptor will be released in a future
+ version of this APPNOTE. This new record is intended to
+ resolve conflicts with the use of this record going forward,
+ and to provide better support for streamed file processing.
+
+ When the Central Directory Encryption method is used, the data
+ descriptor record is not required, but may be used. If present,
+ and bit 3 of the general purpose bit field is set to indicate
+ its presence, the values in fields of the data descriptor
+ record should be set to binary zeros.
+
+ D. Archive decryption header:
+
+ The Archive Decryption Header is introduced in version 6.2
+ of the ZIP format specification. This record exists in support
+ of the Central Directory Encryption Feature implemented as part of
+ the Strong Encryption Specification as described in this document.
+ When the Central Directory Structure is encrypted, this decryption
+ header will precede the encrypted data segment. The encrypted
+ data segment will consist of the Archive extra data record (if
+ present) and the encrypted Central Directory Structure data.
+ The format of this data record is identical to the Decryption
+ header record preceding compressed file data. If the central
+ directory structure is encrypted, the location of the start of
+ this data record is determined using the Start of Central Directory
+ field in the Zip64 End of Central Directory record. Refer to the
+ section on the Strong Encryption Specification for information
+ on the fields used in the Archive Decryption Header record.
+
+
+ E. Archive extra data record:
+
+ archive extra data signature 4 bytes (0x08064b50)
+ extra field length 4 bytes
+ extra field data (variable size)
+
+ The Archive Extra Data Record is introduced in version 6.2
+ of the ZIP format specification. This record exists in support
+ of the Central Directory Encryption Feature implemented as part of
+ the Strong Encryption Specification as described in this document.
+ When present, this record immediately precedes the central
+ directory data structure. The size of this data record will be
+ included in the Size of the Central Directory field in the
+ End of Central Directory record. If the central directory structure
+ is compressed, but not encrypted, the location of the start of
+ this data record is determined using the Start of Central Directory
+ field in the Zip64 End of Central Directory record.
+
+
+ F. Central directory structure:
+
+ [file header 1]
+ .
+ .
+ .
+ [file header n]
+ [digital signature]
+
+ File header:
+
+ central file header signature 4 bytes (0x02014b50)
+ version made by 2 bytes
+ version needed to extract 2 bytes
+ general purpose bit flag 2 bytes
+ compression method 2 bytes
+ last mod file time 2 bytes
+ last mod file date 2 bytes
+ crc-32 4 bytes
+ compressed size 4 bytes
+ uncompressed size 4 bytes
+ file name length 2 bytes
+ extra field length 2 bytes
+ file comment length 2 bytes
+ disk number start 2 bytes
+ internal file attributes 2 bytes
+ external file attributes 4 bytes
+ relative offset of local header 4 bytes
+
+ file name (variable size)
+ extra field (variable size)
+ file comment (variable size)
+
+ Digital signature:
+
+ header signature 4 bytes (0x05054b50)
+ size of data 2 bytes
+ signature data (variable size)
+
+ With the introduction of the Central Directory Encryption
+ feature in version 6.2 of this specification, the Central
+ Directory Structure may be stored both compressed and encrypted.
+ Although not required, it is assumed when encrypting the
+ Central Directory Structure, that it will be compressed
+ for greater storage efficiency. Information on the
+ Central Directory Encryption feature can be found in the section
+ describing the Strong Encryption Specification. The Digital
+ Signature record will be neither compressed nor encrypted.
+
+ G. Zip64 end of central directory record
+
+ zip64 end of central dir
+ signature 4 bytes (0x06064b50)
+ size of zip64 end of central
+ directory record 8 bytes
+ version made by 2 bytes
+ version needed to extract 2 bytes
+ number of this disk 4 bytes
+ number of the disk with the
+ start of the central directory 4 bytes
+ total number of entries in the
+ central directory on this disk 8 bytes
+ total number of entries in the
+ central directory 8 bytes
+ size of the central directory 8 bytes
+ offset of start of central
+ directory with respect to
+ the starting disk number 8 bytes
+ zip64 extensible data sector (variable size)
+
+ The value stored into the "size of zip64 end of central
+ directory record" should be the size of the remaining
+ record and should not include the leading 12 bytes.
+
+ Size = SizeOfFixedFields + SizeOfVariableData - 12.
+
+ The above record structure defines Version 1 of the
+ zip64 end of central directory record. Version 1 was
+ implemented in versions of this specification preceding
+ 6.2 in support of the ZIP64 large file feature. The
+ introduction of the Central Directory Encryption feature
+ implemented in version 6.2 as part of the Strong Encryption
+ Specification defines Version 2 of this record structure.
+ Refer to the section describing the Strong Encryption
+ Specification for details on the version 2 format for
+ this record.
+
+ Special purpose data may reside in the zip64 extensible data
+ sector field following either a V1 or V2 version of this
+ record. To ensure identification of this special purpose data
+ it must include an identifying header block consisting of the
+ following:
+
+ Header ID - 2 bytes
+ Data Size - 4 bytes
+
+ The Header ID field indicates the type of data that is in the
+ data block that follows.
+
+ Data Size identifies the number of bytes that follow for this
+ data block type.
+
+ Multiple special purpose data blocks may be present, but each
+ must be preceded by a Header ID and Data Size field. Current
+ mappings of Header ID values supported in this field are as
+ defined in APPENDIX C.
+
+ H. Zip64 end of central directory locator
+
+ zip64 end of central dir locator
+ signature 4 bytes (0x07064b50)
+ number of the disk with the
+ start of the zip64 end of
+ central directory 4 bytes
+ relative offset of the zip64
+ end of central directory record 8 bytes
+ total number of disks 4 bytes
+
+ I. End of central directory record:
+
+ end of central dir signature 4 bytes (0x06054b50)
+ number of this disk 2 bytes
+ number of the disk with the
+ start of the central directory 2 bytes
+ total number of entries in the
+ central directory on this disk 2 bytes
+ total number of entries in
+ the central directory 2 bytes
+ size of the central directory 4 bytes
+ offset of start of central
+ directory with respect to
+ the starting disk number 4 bytes
+ .ZIP file comment length 2 bytes
+ .ZIP file comment (variable size)
+
+ J. Explanation of fields:
+
+ version made by (2 bytes)
+
+ The upper byte indicates the compatibility of the file
+ attribute information. If the external file attributes
+ are compatible with MS-DOS and can be read by PKZIP for
+ DOS version 2.04g then this value will be zero. If these
+ attributes are not compatible, then this value will
+ identify the host system on which the attributes are
+ compatible. Software can use this information to determine
+ the line record format for text files etc. The current
+ mappings are:
+
+ 0 - MS-DOS and OS/2 (FAT / VFAT / FAT32 file systems)
+ 1 - Amiga 2 - OpenVMS
+ 3 - UNIX 4 - VM/CMS
+ 5 - Atari ST 6 - OS/2 H.P.F.S.
+ 7 - Macintosh 8 - Z-System
+ 9 - CP/M 10 - Windows NTFS
+ 11 - MVS (OS/390 - Z/OS) 12 - VSE
+ 13 - Acorn Risc 14 - VFAT
+ 15 - alternate MVS 16 - BeOS
+ 17 - Tandem 18 - OS/400
+ 19 - OS/X (Darwin) 20 thru 255 - unused
+
+ The lower byte indicates the ZIP specification version
+ (the version of this document) supported by the software
+ used to encode the file. The value/10 indicates the major
+ version number, and the value mod 10 is the minor version
+ number.
+
+ version needed to extract (2 bytes)
+
+ The minimum supported ZIP specification version needed to
+ extract the file, mapped as above. This value is based on
+ the specific format features a ZIP program must support to
+ be able to extract the file. If multiple features are
+ applied to a file, the minimum version should be set to the
+ feature having the highest value. New features or feature
+ changes affecting the published format specification will be
+ implemented using higher version numbers than the last
+ published value to avoid conflict.
+
+ Current minimum feature versions are as defined below:
+
+ 1.0 - Default value
+ 1.1 - File is a volume label
+ 2.0 - File is a folder (directory)
+ 2.0 - File is compressed using Deflate compression
+ 2.0 - File is encrypted using traditional PKWARE encryption
+ 2.1 - File is compressed using Deflate64(tm)
+ 2.5 - File is compressed using PKWARE DCL Implode
+ 2.7 - File is a patch data set
+ 4.5 - File uses ZIP64 format extensions
+ 4.6 - File is compressed using BZIP2 compression*
+ 5.0 - File is encrypted using DES
+ 5.0 - File is encrypted using 3DES
+ 5.0 - File is encrypted using original RC2 encryption
+ 5.0 - File is encrypted using RC4 encryption
+ 5.1 - File is encrypted using AES encryption
+ 5.1 - File is encrypted using corrected RC2 encryption**
+ 5.2 - File is encrypted using corrected RC2-64 encryption**
+ 6.1 - File is encrypted using non-OAEP key wrapping***
+ 6.2 - Central directory encryption
+ 6.3 - File is compressed using LZMA
+ 6.3 - File is compressed using PPMd+
+ 6.3 - File is encrypted using Blowfish
+ 6.3 - File is encrypted using Twofish
+
+
+ * Early 7.x (pre-7.2) versions of PKZIP incorrectly set the
+ version needed to extract for BZIP2 compression to be 50
+ when it should have been 46.
+
+ ** Refer to the section on Strong Encryption Specification
+ for additional information regarding RC2 corrections.
+
+ *** Certificate encryption using non-OAEP key wrapping is the
+ intended mode of operation for all versions beginning with 6.1.
+ Support for OAEP key wrapping should only be used for
+ backward compatibility when sending ZIP files to be opened by
+ versions of PKZIP older than 6.1 (5.0 or 6.0).
+
+ + Files compressed using PPMd should set the version
+ needed to extract field to 6.3, however, not all ZIP
+ programs enforce this and may be unable to decompress
+ data files compressed using PPMd if this value is set.
+
+ When using ZIP64 extensions, the corresponding value in the
+ zip64 end of central directory record should also be set.
+ This field should be set appropriately to indicate whether
+ Version 1 or Version 2 format is in use.
+
+ general purpose bit flag: (2 bytes)
+
+ Bit 0: If set, indicates that the file is encrypted.
+
+ (For Method 6 - Imploding)
+ Bit 1: If the compression method used was type 6,
+ Imploding, then this bit, if set, indicates
+ an 8K sliding dictionary was used. If clear,
+ then a 4K sliding dictionary was used.
+ Bit 2: If the compression method used was type 6,
+ Imploding, then this bit, if set, indicates
+ 3 Shannon-Fano trees were used to encode the
+ sliding dictionary output. If clear, then 2
+ Shannon-Fano trees were used.
+
+ (For Methods 8 and 9 - Deflating)
+ Bit 2 Bit 1
+ 0 0 Normal (-en) compression option was used.
+ 0 1 Maximum (-exx/-ex) compression option was used.
+ 1 0 Fast (-ef) compression option was used.
+ 1 1 Super Fast (-es) compression option was used.
+
+ (For Method 14 - LZMA)
+ Bit 1: If the compression method used was type 14,
+ LZMA, then this bit, if set, indicates
+ an end-of-stream (EOS) marker is used to
+ mark the end of the compressed data stream.
+ If clear, then an EOS marker is not present
+ and the compressed data size must be known
+ to extract.
+
+ Note: Bits 1 and 2 are undefined if the compression
+ method is any other.
+
+ Bit 3: If this bit is set, the fields crc-32, compressed
+ size and uncompressed size are set to zero in the
+ local header. The correct values are put in the
+ data descriptor immediately following the compressed
+ data. (Note: PKZIP version 2.04g for DOS only
+ recognizes this bit for method 8 compression, newer
+ versions of PKZIP recognize this bit for any
+ compression method.)
+
+ Bit 4: Reserved for use with method 8, for enhanced
+ deflating.
+
+ Bit 5: If this bit is set, this indicates that the file is
+ compressed patched data. (Note: Requires PKZIP
+ version 2.70 or greater)
+
+ Bit 6: Strong encryption. If this bit is set, you should
+ set the version needed to extract value to at least
+ 50 and you must also set bit 0. If AES encryption
+ is used, the version needed to extract value must
+ be at least 51.
+
+ Bit 7: Currently unused.
+
+ Bit 8: Currently unused.
+
+ Bit 9: Currently unused.
+
+ Bit 10: Currently unused.
+
+ Bit 11: Language encoding flag (EFS). If this bit is set,
+ the filename and comment fields for this file
+ must be encoded using UTF-8. (see APPENDIX D)
+
+ Bit 12: Reserved by PKWARE for enhanced compression.
+
+ Bit 13: Used when encrypting the Central Directory to indicate
+ selected data values in the Local Header are masked to
+ hide their actual values. See the section describing
+ the Strong Encryption Specification for details.
+
+ Bit 14: Reserved by PKWARE.
+
+ Bit 15: Reserved by PKWARE.
+
+ compression method: (2 bytes)
+
+ (see accompanying documentation for algorithm
+ descriptions)
+
+ 0 - The file is stored (no compression)
+ 1 - The file is Shrunk
+ 2 - The file is Reduced with compression factor 1
+ 3 - The file is Reduced with compression factor 2
+ 4 - The file is Reduced with compression factor 3
+ 5 - The file is Reduced with compression factor 4
+ 6 - The file is Imploded
+ 7 - Reserved for Tokenizing compression algorithm
+ 8 - The file is Deflated
+ 9 - Enhanced Deflating using Deflate64(tm)
+ 10 - PKWARE Data Compression Library Imploding (old IBM TERSE)
+ 11 - Reserved by PKWARE
+ 12 - File is compressed using BZIP2 algorithm
+ 13 - Reserved by PKWARE
+ 14 - LZMA (EFS)
+ 15 - Reserved by PKWARE
+ 16 - Reserved by PKWARE
+ 17 - Reserved by PKWARE
+ 18 - File is compressed using IBM TERSE (new)
+ 19 - IBM LZ77 z Architecture (PFS)
+ 97 - WavPack compressed data
+ 98 - PPMd version I, Rev 1
+
+ date and time fields: (2 bytes each)
+
+ The date and time are encoded in standard MS-DOS format.
+ If input came from standard input, the date and time are
+ those at which compression was started for this data.
+ If encrypting the central directory and general purpose bit
+ flag 13 is set indicating masking, the value stored in the
+ Local Header will be zero.
+
+ CRC-32: (4 bytes)
+
+ The CRC-32 algorithm was generously contributed by
+ David Schwaderer and can be found in his excellent
+ book "C Programmers Guide to NetBIOS" published by
+ Howard W. Sams & Co. Inc. The 'magic number' for
+ the CRC is 0xdebb20e3. The proper CRC pre and post
+ conditioning is used, meaning that the CRC register
+ is pre-conditioned with all ones (a starting value
+ of 0xffffffff) and the value is post-conditioned by
+ taking the one's complement of the CRC residual.
+ If bit 3 of the general purpose flag is set, this
+ field is set to zero in the local header and the correct
+ value is put in the data descriptor and in the central
+ directory. When encrypting the central directory, if the
+ local header is not in ZIP64 format and general purpose
+ bit flag 13 is set indicating masking, the value stored
+ in the Local Header will be zero.
+
+ compressed size: (4 bytes)
+ uncompressed size: (4 bytes)
+
+ The size of the file compressed and uncompressed,
+ respectively. When a decryption header is present it will
+ be placed in front of the file data and the value of the
+ compressed file size will include the bytes of the decryption
+ header. If bit 3 of the general purpose bit flag is set,
+ these fields are set to zero in the local header and the
+ correct values are put in the data descriptor and
+ in the central directory. If an archive is in ZIP64 format
+ and the value in this field is 0xFFFFFFFF, the size will be
+ in the corresponding 8 byte ZIP64 extended information
+ extra field. When encrypting the central directory, if the
+ local header is not in ZIP64 format and general purpose bit
+ flag 13 is set indicating masking, the value stored for the
+ uncompressed size in the Local Header will be zero.
+
+ file name length: (2 bytes)
+ extra field length: (2 bytes)
+ file comment length: (2 bytes)
+
+ The length of the file name, extra field, and comment
+ fields respectively. The combined length of any
+ directory record and these three fields should not
+ generally exceed 65,535 bytes. If input came from standard
+ input, the file name length is set to zero.
+
+ disk number start: (2 bytes)
+
+ The number of the disk on which this file begins. If an
+ archive is in ZIP64 format and the value in this field is
+ 0xFFFF, the size will be in the corresponding 4 byte zip64
+ extended information extra field.
+
+ internal file attributes: (2 bytes)
+
+ Bits 1 and 2 are reserved for use by PKWARE.
+
+ The lowest bit of this field indicates, if set, that
+ the file is apparently an ASCII or text file. If not
+ set, that the file apparently contains binary data.
+ The remaining bits are unused in version 1.0.
+
+ The 0x0002 bit of this field indicates, if set, that a
+ 4 byte variable record length control field precedes each
+ logical record indicating the length of the record. The
+ record length control field is stored in little-endian byte
+ order. This flag is independent of text control characters,
+ and if used in conjunction with text data, includes any
+ control characters in the total length of the record. This
+ value is provided for mainframe data transfer support.
+
+ external file attributes: (4 bytes)
+
+ The mapping of the external attributes is
+ host-system dependent (see 'version made by'). For
+ MS-DOS, the low order byte is the MS-DOS directory
+ attribute byte. If input came from standard input, this
+ field is set to zero.
+
+ relative offset of local header: (4 bytes)
+
+ This is the offset from the start of the first disk on
+ which this file appears, to where the local header should
+ be found. If an archive is in ZIP64 format and the value
+ in this field is 0xFFFFFFFF, the size will be in the
+ corresponding 8 byte zip64 extended information extra field.
+
+ file name: (Variable)
+
+ The name of the file, with optional relative path.
+ The path stored should not contain a drive or
+ device letter, or a leading slash. All slashes
+ should be forward slashes '/' as opposed to
+ backwards slashes '\' for compatibility with Amiga
+ and UNIX file systems etc. If input came from standard
+ input, there is no file name field. If encrypting
+ the central directory and general purpose bit flag 13 is set
+ indicating masking, the file name stored in the Local Header
+ will not be the actual file name. A masking value consisting
+ of a unique hexadecimal value will be stored. This value will
+ be sequentially incremented for each file in the archive. See
+ the section on the Strong Encryption Specification for details
+ on retrieving the encrypted file name.
+
+ extra field: (Variable)
+
+ This is for expansion. If additional information
+ needs to be stored for special needs or for specific
+ platforms, it should be stored here. Earlier versions
+ of the software can then safely skip this file, and
+ find the next file or header. This field will be 0
+ length in version 1.0.
+
+ In order to allow different programs and different types
+ of information to be stored in the 'extra' field in .ZIP
+ files, the following structure should be used for all
+ programs storing data in this field:
+
+ header1+data1 + header2+data2 . . .
+
+ Each header should consist of:
+
+ Header ID - 2 bytes
+ Data Size - 2 bytes
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ The Header ID field indicates the type of data that is in
+ the following data block.
+
+ Header ID's of 0 thru 31 are reserved for use by PKWARE.
+ The remaining ID's can be used by third party vendors for
+ proprietary usage.
+
+ The current Header ID mappings defined by PKWARE are:
+
+ 0x0001 Zip64 extended information extra field
+ 0x0007 AV Info
+ 0x0008 Reserved for extended language encoding data (PFS)
+ (see APPENDIX D)
+ 0x0009 OS/2
+ 0x000a NTFS
+ 0x000c OpenVMS
+ 0x000d UNIX
+ 0x000e Reserved for file stream and fork descriptors
+ 0x000f Patch Descriptor
+ 0x0014 PKCS#7 Store for X.509 Certificates
+ 0x0015 X.509 Certificate ID and Signature for
+ individual file
+ 0x0016 X.509 Certificate ID for Central Directory
+ 0x0017 Strong Encryption Header
+ 0x0018 Record Management Controls
+ 0x0019 PKCS#7 Encryption Recipient Certificate List
+ 0x0065 IBM S/390 (Z390), AS/400 (I400) attributes
+ - uncompressed
+ 0x0066 Reserved for IBM S/390 (Z390), AS/400 (I400)
+ attributes - compressed
+ 0x4690 POSZIP 4690 (reserved)
+
+ Third party mappings commonly used are:
+
+
+ 0x07c8 Macintosh
+ 0x2605 ZipIt Macintosh
+ 0x2705 ZipIt Macintosh 1.3.5+
+ 0x2805 ZipIt Macintosh 1.3.5+
+ 0x334d Info-ZIP Macintosh
+ 0x4341 Acorn/SparkFS
+ 0x4453 Windows NT security descriptor (binary ACL)
+ 0x4704 VM/CMS
+ 0x470f MVS
+ 0x4b46 FWKCS MD5 (see below)
+ 0x4c41 OS/2 access control list (text ACL)
+ 0x4d49 Info-ZIP OpenVMS
+ 0x4f4c Xceed original location extra field
+ 0x5356 AOS/VS (ACL)
+ 0x5455 extended timestamp
+ 0x554e Xceed unicode extra field
+ 0x5855 Info-ZIP UNIX (original, also OS/2, NT, etc)
+ 0x6375 Info-ZIP Unicode Comment Extra Field
+ 0x6542 BeOS/BeBox
+ 0x7075 Info-ZIP Unicode Path Extra Field
+ 0x756e ASi UNIX
+ 0x7855 Info-ZIP UNIX (new)
+ 0xa220 Microsoft Open Packaging Growth Hint
+ 0xfd4a SMS/QDOS
+
+ Detailed descriptions of Extra Fields defined by third
+ party mappings will be documented as information on
+ these data structures is made available to PKWARE.
+ PKWARE does not guarantee the accuracy of any published
+ third party data.
+
+ The Data Size field indicates the size of the following
+ data block. Programs can use this value to skip to the
+ next header block, passing over any data blocks that are
+ not of interest.
+
+ Note: As stated above, the size of the entire .ZIP file
+ header, including the file name, comment, and extra
+ field should not exceed 64K in size.
+
+ In case two different programs should appropriate the same
+ Header ID value, it is strongly recommended that each
+ program place a unique signature of at least two bytes in
+ size (and preferably 4 bytes or bigger) at the start of
+ each data area. Every program should verify that its
+ unique signature is present, in addition to the Header ID
+ value being correct, before assuming that it is a block of
+ known type.
+
+ -Zip64 Extended Information Extra Field (0x0001):
+
+ The following is the layout of the zip64 extended
+ information "extra" block. If one of the size or
+ offset fields in the Local or Central directory
+ record is too small to hold the required data,
+ a Zip64 extended information record is created.
+ The order of the fields in the zip64 extended
+ information record is fixed, but the fields will
+ only appear if the corresponding Local or Central
+ directory record field is set to 0xFFFF or 0xFFFFFFFF.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (ZIP64) 0x0001 2 bytes Tag for this "extra" block type
+ Size 2 bytes Size of this "extra" block
+ Original
+ Size 8 bytes Original uncompressed file size
+ Compressed
+ Size 8 bytes Size of compressed data
+ Relative Header
+ Offset 8 bytes Offset of local header record
+ Disk Start
+ Number 4 bytes Number of the disk on which
+ this file starts
+
+ This entry in the Local header must include BOTH original
+ and compressed file size fields. If encrypting the
+ central directory and bit 13 of the general purpose bit
+ flag is set indicating masking, the value stored in the
+ Local Header for the original file size will be zero.
+
+
+ -OS/2 Extra Field (0x0009):
+
+ The following is the layout of the OS/2 attributes "extra"
+ block. (Last Revision 09/05/95)
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (OS/2) 0x0009 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size for the following data block
+ BSize 4 bytes Uncompressed Block Size
+ CType 2 bytes Compression type
+ EACRC 4 bytes CRC value for uncompress block
+ (var) variable Compressed block
+
+ The OS/2 extended attribute structure (FEA2LIST) is
+ compressed and then stored in it's entirety within this
+ structure. There will only ever be one "block" of data in
+ VarFields[].
+
+ -NTFS Extra Field (0x000a):
+
+ The following is the layout of the NTFS attributes
+ "extra" block. (Note: At this time the Mtime, Atime
+ and Ctime values may be used on any WIN32 system.)
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (NTFS) 0x000a 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the total "extra" block
+ Reserved 4 bytes Reserved for future use
+ Tag1 2 bytes NTFS attribute tag value #1
+ Size1 2 bytes Size of attribute #1, in bytes
+ (var.) Size1 Attribute #1 data
+ .
+ .
+ .
+ TagN 2 bytes NTFS attribute tag value #N
+ SizeN 2 bytes Size of attribute #N, in bytes
+ (var.) SizeN Attribute #N data
+
+ For NTFS, values for Tag1 through TagN are as follows:
+ (currently only one set of attributes is defined for NTFS)
+
+ Tag Size Description
+ ----- ---- -----------
+ 0x0001 2 bytes Tag for attribute #1
+ Size1 2 bytes Size of attribute #1, in bytes
+ Mtime 8 bytes File last modification time
+ Atime 8 bytes File last access time
+ Ctime 8 bytes File creation time
+
+ -OpenVMS Extra Field (0x000c):
+
+ The following is the layout of the OpenVMS attributes
+ "extra" block.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (VMS) 0x000c 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the total "extra" block
+ CRC 4 bytes 32-bit CRC for remainder of the block
+ Tag1 2 bytes OpenVMS attribute tag value #1
+ Size1 2 bytes Size of attribute #1, in bytes
+ (var.) Size1 Attribute #1 data
+ .
+ .
+ .
+ TagN 2 bytes OpenVMS attribute tag value #N
+ SizeN 2 bytes Size of attribute #N, in bytes
+ (var.) SizeN Attribute #N data
+
+ Rules:
+
+ 1. There will be one or more of attributes present, which
+ will each be preceded by the above TagX & SizeX values.
+ These values are identical to the ATR$C_XXXX and
+ ATR$S_XXXX constants which are defined in ATR.H under
+ OpenVMS C. Neither of these values will ever be zero.
+
+ 2. No word alignment or padding is performed.
+
+ 3. A well-behaved PKZIP/OpenVMS program should never produce
+ more than one sub-block with the same TagX value. Also,
+ there will never be more than one "extra" block of type
+ 0x000c in a particular directory record.
+
+ -UNIX Extra Field (0x000d):
+
+ The following is the layout of the UNIX "extra" block.
+ Note: all fields are stored in Intel low-byte/high-byte
+ order.
+
+ Value Size Description
+ ----- ---- -----------
+ (UNIX) 0x000d 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size for the following data block
+ Atime 4 bytes File last access time
+ Mtime 4 bytes File last modification time
+ Uid 2 bytes File user ID
+ Gid 2 bytes File group ID
+ (var) variable Variable length data field
+
+ The variable length data field will contain file type
+ specific data. Currently the only values allowed are
+ the original "linked to" file names for hard or symbolic
+ links, and the major and minor device node numbers for
+ character and block device nodes. Since device nodes
+ cannot be either symbolic or hard links, only one set of
+ variable length data is stored. Link files will have the
+ name of the original file stored. This name is NOT NULL
+ terminated. Its size can be determined by checking TSize -
+ 12. Device entries will have eight bytes stored as two 4
+ byte entries (in little endian format). The first entry
+ will be the major device number, and the second the minor
+ device number.
+
+ -PATCH Descriptor Extra Field (0x000f):
+
+ The following is the layout of the Patch Descriptor "extra"
+ block.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (Patch) 0x000f 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the total "extra" block
+ Version 2 bytes Version of the descriptor
+ Flags 4 bytes Actions and reactions (see below)
+ OldSize 4 bytes Size of the file about to be patched
+ OldCRC 4 bytes 32-bit CRC of the file to be patched
+ NewSize 4 bytes Size of the resulting file
+ NewCRC 4 bytes 32-bit CRC of the resulting file
+
+ Actions and reactions
+
+ Bits Description
+ ---- ----------------
+ 0 Use for auto detection
+ 1 Treat as a self-patch
+ 2-3 RESERVED
+ 4-5 Action (see below)
+ 6-7 RESERVED
+ 8-9 Reaction (see below) to absent file
+ 10-11 Reaction (see below) to newer file
+ 12-13 Reaction (see below) to unknown file
+ 14-15 RESERVED
+ 16-31 RESERVED
+
+ Actions
+
+ Action Value
+ ------ -----
+ none 0
+ add 1
+ delete 2
+ patch 3
+
+ Reactions
+
+ Reaction Value
+ -------- -----
+ ask 0
+ skip 1
+ ignore 2
+ fail 3
+
+ Patch support is provided by PKPatchMaker(tm) technology and is
+ covered under U.S. Patents and Patents Pending. The use or
+ implementation in a product of certain technological aspects set
+ forth in the current APPNOTE, including those with regard to
+ strong encryption, patching, or extended tape operations requires
+ a license from PKWARE. Please contact PKWARE with regard to
+ acquiring a license.
+
+ -PKCS#7 Store for X.509 Certificates (0x0014):
+
+ This field contains information about each of the certificates
+ files may be signed with. When the Central Directory Encryption
+ feature is enabled for a ZIP file, this record will appear in
+ the Archive Extra Data Record, otherwise it will appear in the
+ first central directory record and will be ignored in any
+ other record.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (Store) 0x0014 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the store data
+ TData TSize Data about the store
+
+
+ -X.509 Certificate ID and Signature for individual file (0x0015):
+
+ This field contains the information about which certificate in
+ the PKCS#7 store was used to sign a particular file. It also
+ contains the signature data. This field can appear multiple
+ times, but can only appear once per certificate.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (CID) 0x0015 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of data that follows
+ TData TSize Signature Data
+
+ -X.509 Certificate ID and Signature for central directory (0x0016):
+
+ This field contains the information about which certificate in
+ the PKCS#7 store was used to sign the central directory structure.
+ When the Central Directory Encryption feature is enabled for a
+ ZIP file, this record will appear in the Archive Extra Data Record,
+ otherwise it will appear in the first central directory record.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (CDID) 0x0016 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of data that follows
+ TData TSize Data
+
+ -Strong Encryption Header (0x0017):
+
+ Value Size Description
+ ----- ---- -----------
+ 0x0017 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of data that follows
+ Format 2 bytes Format definition for this record
+ AlgID 2 bytes Encryption algorithm identifier
+ Bitlen 2 bytes Bit length of encryption key
+ Flags 2 bytes Processing flags
+ CertData TSize-8 Certificate decryption extra field data
+ (refer to the explanation for CertData
+ in the section describing the
+ Certificate Processing Method under
+ the Strong Encryption Specification)
+
+
+ -Record Management Controls (0x0018):
+
+ Value Size Description
+ ----- ---- -----------
+(Rec-CTL) 0x0018 2 bytes Tag for this "extra" block type
+ CSize 2 bytes Size of total extra block data
+ Tag1 2 bytes Record control attribute 1
+ Size1 2 bytes Size of attribute 1, in bytes
+ Data1 Size1 Attribute 1 data
+ .
+ .
+ .
+ TagN 2 bytes Record control attribute N
+ SizeN 2 bytes Size of attribute N, in bytes
+ DataN SizeN Attribute N data
+
+
+ -PKCS#7 Encryption Recipient Certificate List (0x0019):
+
+ This field contains information about each of the certificates
+ used in encryption processing and it can be used to identify who is
+ allowed to decrypt encrypted files. This field should only appear
+ in the archive extra data record. This field is not required and
+ serves only to aide archive modifications by preserving public
+ encryption key data. Individual security requirements may dictate
+ that this data be omitted to deter information exposure.
+
+ Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ (CStore) 0x0019 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size of the store data
+ TData TSize Data about the store
+
+ TData:
+
+ Value Size Description
+ ----- ---- -----------
+ Version 2 bytes Format version number - must 0x0001 at this time
+ CStore (var) PKCS#7 data blob
+
+
+ -MVS Extra Field (0x0065):
+
+ The following is the layout of the MVS "extra" block.
+ Note: Some fields are stored in Big Endian format.
+ All text is in EBCDIC format unless otherwise specified.
+
+ Value Size Description
+ ----- ---- -----------
+ (MVS) 0x0065 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size for the following data block
+ ID 4 bytes EBCDIC "Z390" 0xE9F3F9F0 or
+ "T4MV" for TargetFour
+ (var) TSize-4 Attribute data (see APPENDIX B)
+
+
+ -OS/400 Extra Field (0x0065):
+
+ The following is the layout of the OS/400 "extra" block.
+ Note: Some fields are stored in Big Endian format.
+ All text is in EBCDIC format unless otherwise specified.
+
+ Value Size Description
+ ----- ---- -----------
+ (OS400) 0x0065 2 bytes Tag for this "extra" block type
+ TSize 2 bytes Size for the following data block
+ ID 4 bytes EBCDIC "I400" 0xC9F4F0F0 or
+ "T4MV" for TargetFour
+ (var) TSize-4 Attribute data (see APPENDIX A)
+
+
+ Third-party Mappings:
+
+ -ZipIt Macintosh Extra Field (long) (0x2605):
+
+ The following is the layout of the ZipIt extra block
+ for Macintosh. The local-header and central-header versions
+ are identical. This block must be present if the file is
+ stored MacBinary-encoded and it should not be used if the file
+ is not stored MacBinary-encoded.
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac2) 0x2605 Short tag for this extra block type
+ TSize Short total data size for this block
+ "ZPIT" beLong extra-field signature
+ FnLen Byte length of FileName
+ FileName variable full Macintosh filename
+ FileType Byte[4] four-byte Mac file type string
+ Creator Byte[4] four-byte Mac creator string
+
+
+ -ZipIt Macintosh Extra Field (short, for files) (0x2705):
+
+ The following is the layout of a shortened variant of the
+ ZipIt extra block for Macintosh (without "full name" entry).
+ This variant is used by ZipIt 1.3.5 and newer for entries of
+ files (not directories) that do not have a MacBinary encoded
+ file. The local-header and central-header versions are identical.
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac2b) 0x2705 Short tag for this extra block type
+ TSize Short total data size for this block (12)
+ "ZPIT" beLong extra-field signature
+ FileType Byte[4] four-byte Mac file type string
+ Creator Byte[4] four-byte Mac creator string
+ fdFlags beShort attributes from FInfo.frFlags,
+ may be omitted
+ 0x0000 beShort reserved, may be omitted
+
+
+ -ZipIt Macintosh Extra Field (short, for directories) (0x2805):
+
+ The following is the layout of a shortened variant of the
+ ZipIt extra block for Macintosh used only for directory
+ entries. This variant is used by ZipIt 1.3.5 and newer to
+ save some optional Mac-specific information about directories.
+ The local-header and central-header versions are identical.
+
+ Value Size Description
+ ----- ---- -----------
+ (Mac2c) 0x2805 Short tag for this extra block type
+ TSize Short total data size for this block (12)
+ "ZPIT" beLong extra-field signature
+ frFlags beShort attributes from DInfo.frFlags, may
+ be omitted
+ View beShort ZipIt view flag, may be omitted
+
+
+ The View field specifies ZipIt-internal settings as follows:
+
+ Bits of the Flags:
+ bit 0 if set, the folder is shown expanded (open)
+ when the archive contents are viewed in ZipIt.
+ bits 1-15 reserved, zero;
+
+
+ -FWKCS MD5 Extra Field (0x4b46):
+
+ The FWKCS Contents_Signature System, used in
+ automatically identifying files independent of file name,
+ optionally adds and uses an extra field to support the
+ rapid creation of an enhanced contents_signature:
+
+ Header ID = 0x4b46
+ Data Size = 0x0013
+ Preface = 'M','D','5'
+ followed by 16 bytes containing the uncompressed file's
+ 128_bit MD5 hash(1), low byte first.
+
+ When FWKCS revises a .ZIP file central directory to add
+ this extra field for a file, it also replaces the
+ central directory entry for that file's uncompressed
+ file length with a measured value.
+
+ FWKCS provides an option to strip this extra field, if
+ present, from a .ZIP file central directory. In adding
+ this extra field, FWKCS preserves .ZIP file Authenticity
+ Verification; if stripping this extra field, FWKCS
+ preserves all versions of AV through PKZIP version 2.04g.
+
+ FWKCS, and FWKCS Contents_Signature System, are
+ trademarks of Frederick W. Kantor.
+
+ (1) R. Rivest, RFC1321.TXT, MIT Laboratory for Computer
+ Science and RSA Data Security, Inc., April 1992.
+ ll.76-77: "The MD5 algorithm is being placed in the
+ public domain for review and possible adoption as a
+ standard."
+
+
+ -Info-ZIP Unicode Comment Extra Field (0x6375):
+
+ Stores the UTF-8 version of the file comment as stored in the
+ central directory header. (Last Revision 20070912)
+
+ Value Size Description
+ ----- ---- -----------
+ (UCom) 0x6375 Short tag for this extra block type ("uc")
+ TSize Short total data size for this block
+ Version 1 byte version of this extra field, currently 1
+ ComCRC32 4 bytes Comment Field CRC32 Checksum
+ UnicodeCom Variable UTF-8 version of the entry comment
+
+ Currently Version is set to the number 1. If there is a need
+ to change this field, the version will be incremented. Changes
+ may not be backward compatible so this extra field should not be
+ used if the version is not recognized.
+
+ The ComCRC32 is the standard zip CRC32 checksum of the File Comment
+ field in the central directory header. This is used to verify that
+ the comment field has not changed since the Unicode Comment extra field
+ was created. This can happen if a utility changes the File Comment
+ field but does not update the UTF-8 Comment extra field. If the CRC
+ check fails, this Unicode Comment extra field should be ignored and
+ the File Comment field in the header should be used instead.
+
+ The UnicodeCom field is the UTF-8 version of the File Comment field
+ in the header. As UnicodeCom is defined to be UTF-8, no UTF-8 byte
+ order mark (BOM) is used. The length of this field is determined by
+ subtracting the size of the previous fields from TSize. If both the
+ File Name and Comment fields are UTF-8, the new General Purpose Bit
+ Flag, bit 11 (Language encoding flag (EFS)), can be used to indicate
+ both the header File Name and Comment fields are UTF-8 and, in this
+ case, the Unicode Path and Unicode Comment extra fields are not
+ needed and should not be created. Note that, for backward
+ compatibility, bit 11 should only be used if the native character set
+ of the paths and comments being zipped up are already in UTF-8. It is
+ expected that the same file comment storage method, either general
+ purpose bit 11 or extra fields, be used in both the Local and Central
+ Directory Header for a file.
+
+
+ -Info-ZIP Unicode Path Extra Field (0x7075):
+
+ Stores the UTF-8 version of the file name field as stored in the
+ local header and central directory header. (Last Revision 20070912)
+
+ Value Size Description
+ ----- ---- -----------
+ (UPath) 0x7075 Short tag for this extra block type ("up")
+ TSize Short total data size for this block
+ Version 1 byte version of this extra field, currently 1
+ NameCRC32 4 bytes File Name Field CRC32 Checksum
+ UnicodeName Variable UTF-8 version of the entry File Name
+
+ Currently Version is set to the number 1. If there is a need
+ to change this field, the version will be incremented. Changes
+ may not be backward compatible so this extra field should not be
+ used if the version is not recognized.
+
+ The NameCRC32 is the standard zip CRC32 checksum of the File Name
+ field in the header. This is used to verify that the header
+ File Name field has not changed since the Unicode Path extra field
+ was created. This can happen if a utility renames the File Name but
+ does not update the UTF-8 path extra field. If the CRC check fails,
+ this UTF-8 Path Extra Field should be ignored and the File Name field
+ in the header should be used instead.
+
+ The UnicodeName is the UTF-8 version of the contents of the File Name
+ field in the header. As UnicodeName is defined to be UTF-8, no UTF-8
+ byte order mark (BOM) is used. The length of this field is determined
+ by subtracting the size of the previous fields from TSize. If both
+ the File Name and Comment fields are UTF-8, the new General Purpose
+ Bit Flag, bit 11 (Language encoding flag (EFS)), can be used to
+ indicate that both the header File Name and Comment fields are UTF-8
+ and, in this case, the Unicode Path and Unicode Comment extra fields
+ are not needed and should not be created. Note that, for backward
+ compatibility, bit 11 should only be used if the native character set
+ of the paths and comments being zipped up are already in UTF-8. It is
+ expected that the same file name storage method, either general
+ purpose bit 11 or extra fields, be used in both the Local and Central
+ Directory Header for a file.
+
+
+ -Microsoft Open Packaging Growth Hint (0xa220):
+
+ Value Size Description
+ ----- ---- -----------
+ 0xa220 Short tag for this extra block type
+ TSize Short size of Sig + PadVal + Padding
+ Sig Short verification signature (A028)
+ PadVal Short Initial padding value
+ Padding variable filled with NULL characters
+
+
+ file comment: (Variable)
+
+ The comment for this file.
+
+ number of this disk: (2 bytes)
+
+ The number of this disk, which contains central
+ directory end record. If an archive is in ZIP64 format
+ and the value in this field is 0xFFFF, the size will
+ be in the corresponding 4 byte zip64 end of central
+ directory field.
+
+
+ number of the disk with the start of the central
+ directory: (2 bytes)
+
+ The number of the disk on which the central
+ directory starts. If an archive is in ZIP64 format
+ and the value in this field is 0xFFFF, the size will
+ be in the corresponding 4 byte zip64 end of central
+ directory field.
+
+ total number of entries in the central dir on
+ this disk: (2 bytes)
+
+ The number of central directory entries on this disk.
+ If an archive is in ZIP64 format and the value in
+ this field is 0xFFFF, the size will be in the
+ corresponding 8 byte zip64 end of central
+ directory field.
+
+ total number of entries in the central dir: (2 bytes)
+
+ The total number of files in the .ZIP file. If an
+ archive is in ZIP64 format and the value in this field
+ is 0xFFFF, the size will be in the corresponding 8 byte
+ zip64 end of central directory field.
+
+ size of the central directory: (4 bytes)
+
+ The size (in bytes) of the entire central directory.
+ If an archive is in ZIP64 format and the value in
+ this field is 0xFFFFFFFF, the size will be in the
+ corresponding 8 byte zip64 end of central
+ directory field.
+
+ offset of start of central directory with respect to
+ the starting disk number: (4 bytes)
+
+ Offset of the start of the central directory on the
+ disk on which the central directory starts. If an
+ archive is in ZIP64 format and the value in this
+ field is 0xFFFFFFFF, the size will be in the
+ corresponding 8 byte zip64 end of central
+ directory field.
+
+ .ZIP file comment length: (2 bytes)
+
+ The length of the comment for this .ZIP file.
+
+ .ZIP file comment: (Variable)
+
+ The comment for this .ZIP file. ZIP file comment data
+ is stored unsecured. No encryption or data authentication
+ is applied to this area at this time. Confidential information
+ should not be stored in this section.
+
+ zip64 extensible data sector (variable size)
+
+ (currently reserved for use by PKWARE)
+
+
+ K. Splitting and Spanning ZIP files
+
+ Spanning is the process of segmenting a ZIP file across
+ multiple removable media. This support has typically only
+ been provided for DOS formatted floppy diskettes.
+
+ File splitting is a newer derivative of spanning.
+ Splitting follows the same segmentation process as
+ spanning, however, it does not require writing each
+ segment to a unique removable medium and instead supports
+ placing all pieces onto local or non-removable locations
+ such as file systems, local drives, folders, etc...
+
+ A key difference between spanned and split ZIP files is
+ that all pieces of a spanned ZIP file have the same name.
+ Since each piece is written to a separate volume, no name
+ collisions occur and each segment can reuse the original
+ .ZIP file name given to the archive.
+
+ Sequence ordering for DOS spanned archives uses the DOS
+ volume label to determine segment numbers. Volume labels
+ for each segment are written using the form PKBACK#xxx,
+ where xxx is the segment number written as a decimal
+ value from 001 - nnn.
+
+ Split ZIP files are typically written to the same location
+ and are subject to name collisions if the spanned name
+ format is used since each segment will reside on the same
+ drive. To avoid name collisions, split archives are named
+ as follows.
+
+ Segment 1 = filename.z01
+ Segment n-1 = filename.z(n-1)
+ Segment n = filename.zip
+
+ The .ZIP extension is used on the last segment to support
+ quickly reading the central directory. The segment number
+ n should be a decimal value.
+
+ Spanned ZIP files may be PKSFX Self-extracting ZIP files.
+ PKSFX files may also be split, however, in this case
+ the first segment must be named filename.exe. The first
+ segment of a split PKSFX archive must be large enough to
+ include the entire executable program.
+
+ Capacities for split archives are as follows.
+
+ Maximum number of segments = 4,294,967,295 - 1
+ Maximum .ZIP segment size = 4,294,967,295 bytes
+ Minimum segment size = 64K
+ Maximum PKSFX segment size = 2,147,483,647 bytes
+
+ Segment sizes may be different however by convention, all
+ segment sizes should be the same with the exception of the
+ last, which may be smaller. Local and central directory
+ header records must never be split across a segment boundary.
+ When writing a header record, if the number of bytes remaining
+ within a segment is less than the size of the header record,
+ end the current segment and write the header at the start
+ of the next segment. The central directory may span segment
+ boundaries, but no single record in the central directory
+ should be split across segments.
+
+ Spanned/Split archives created using PKZIP for Windows
+ (V2.50 or greater), PKZIP Command Line (V2.50 or greater),
+ or PKZIP Explorer will include a special spanning
+ signature as the first 4 bytes of the first segment of
+ the archive. This signature (0x08074b50) will be
+ followed immediately by the local header signature for
+ the first file in the archive.
+
+ A special spanning marker may also appear in spanned/split
+ archives if the spanning or splitting process starts but
+ only requires one segment. In this case the 0x08074b50
+ signature will be replaced with the temporary spanning
+ marker signature of 0x30304b50. Split archives can
+ only be uncompressed by other versions of PKZIP that
+ know how to create a split archive.
+
+ The signature value 0x08074b50 is also used by some
+ ZIP implementations as a marker for the Data Descriptor
+ record. Conflict in this alternate assignment can be
+ avoided by ensuring the position of the signature
+ within the ZIP file to determine the use for which it
+ is intended.
+
+ L. General notes:
+
+ 1) All fields unless otherwise noted are unsigned and stored
+ in Intel low-byte:high-byte, low-word:high-word order.
+
+ 2) String fields are not null terminated, since the
+ length is given explicitly.
+
+ 3) The entries in the central directory may not necessarily
+ be in the same order that files appear in the .ZIP file.
+
+ 4) If one of the fields in the end of central directory
+ record is too small to hold required data, the field
+ should be set to -1 (0xFFFF or 0xFFFFFFFF) and the
+ ZIP64 format record should be created.
+
+ 5) The end of central directory record and the
+ Zip64 end of central directory locator record must
+ reside on the same disk when splitting or spanning
+ an archive.
+
+VI. Explanation of compression methods
+--------------------------------------
+
+UnShrinking - Method 1
+----------------------
+
+Shrinking is a Dynamic Ziv-Lempel-Welch compression algorithm
+with partial clearing. The initial code size is 9 bits, and
+the maximum code size is 13 bits. Shrinking differs from
+conventional Dynamic Ziv-Lempel-Welch implementations in several
+respects:
+
+1) The code size is controlled by the compressor, and is not
+ automatically increased when codes larger than the current
+ code size are created (but not necessarily used). When
+ the decompressor encounters the code sequence 256
+ (decimal) followed by 1, it should increase the code size
+ read from the input stream to the next bit size. No
+ blocking of the codes is performed, so the next code at
+ the increased size should be read from the input stream
+ immediately after where the previous code at the smaller
+ bit size was read. Again, the decompressor should not
+ increase the code size used until the sequence 256,1 is
+ encountered.
+
+2) When the table becomes full, total clearing is not
+ performed. Rather, when the compressor emits the code
+ sequence 256,2 (decimal), the decompressor should clear
+ all leaf nodes from the Ziv-Lempel tree, and continue to
+ use the current code size. The nodes that are cleared
+ from the Ziv-Lempel tree are then re-used, with the lowest
+ code value re-used first, and the highest code value
+ re-used last. The compressor can emit the sequence 256,2
+ at any time.
+
+Expanding - Methods 2-5
+-----------------------
+
+The Reducing algorithm is actually a combination of two
+distinct algorithms. The first algorithm compresses repeated
+byte sequences, and the second algorithm takes the compressed
+stream from the first algorithm and applies a probabilistic
+compression method.
+
+The probabilistic compression stores an array of 'follower
+sets' S(j), for j=0 to 255, corresponding to each possible
+ASCII character. Each set contains between 0 and 32
+characters, to be denoted as S(j)[0],...,S(j)[m], where m<32.
+The sets are stored at the beginning of the data area for a
+Reduced file, in reverse order, with S(255) first, and S(0)
+last.
+
+The sets are encoded as { N(j), S(j)[0],...,S(j)[N(j)-1] },
+where N(j) is the size of set S(j). N(j) can be 0, in which
+case the follower set for S(j) is empty. Each N(j) value is
+encoded in 6 bits, followed by N(j) eight bit character values
+corresponding to S(j)[0] to S(j)[N(j)-1] respectively. If
+N(j) is 0, then no values for S(j) are stored, and the value
+for N(j-1) immediately follows.
+
+Immediately after the follower sets, is the compressed data
+stream. The compressed data stream can be interpreted for the
+probabilistic decompression as follows:
+
+let Last-Character <- 0.
+loop until done
+ if the follower set S(Last-Character) is empty then
+ read 8 bits from the input stream, and copy this
+ value to the output stream.
+ otherwise if the follower set S(Last-Character) is non-empty then
+ read 1 bit from the input stream.
+ if this bit is not zero then
+ read 8 bits from the input stream, and copy this
+ value to the output stream.
+ otherwise if this bit is zero then
+ read B(N(Last-Character)) bits from the input
+ stream, and assign this value to I.
+ Copy the value of S(Last-Character)[I] to the
+ output stream.
+
+ assign the last value placed on the output stream to
+ Last-Character.
+end loop
+
+B(N(j)) is defined as the minimal number of bits required to
+encode the value N(j)-1.
+
+The decompressed stream from above can then be expanded to
+re-create the original file as follows:
+
+let State <- 0.
+
+loop until done
+ read 8 bits from the input stream into C.
+ case State of
+ 0: if C is not equal to DLE (144 decimal) then
+ copy C to the output stream.
+ otherwise if C is equal to DLE then
+ let State <- 1.
+
+ 1: if C is non-zero then
+ let V <- C.
+ let Len <- L(V)
+ let State <- F(Len).
+ otherwise if C is zero then
+ copy the value 144 (decimal) to the output stream.
+ let State <- 0
+
+ 2: let Len <- Len + C
+ let State <- 3.
+
+ 3: move backwards D(V,C) bytes in the output stream
+ (if this position is before the start of the output
+ stream, then assume that all the data before the
+ start of the output stream is filled with zeros).
+ copy Len+3 bytes from this position to the output stream.
+ let State <- 0.
+ end case
+end loop
+
+The functions F,L, and D are dependent on the 'compression
+factor', 1 through 4, and are defined as follows:
+
+For compression factor 1:
+ L(X) equals the lower 7 bits of X.
+ F(X) equals 2 if X equals 127 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 1 bit of X) * 256 + Y + 1.
+For compression factor 2:
+ L(X) equals the lower 6 bits of X.
+ F(X) equals 2 if X equals 63 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 2 bits of X) * 256 + Y + 1.
+For compression factor 3:
+ L(X) equals the lower 5 bits of X.
+ F(X) equals 2 if X equals 31 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 3 bits of X) * 256 + Y + 1.
+For compression factor 4:
+ L(X) equals the lower 4 bits of X.
+ F(X) equals 2 if X equals 15 otherwise F(X) equals 3.
+ D(X,Y) equals the (upper 4 bits of X) * 256 + Y + 1.
+
+Imploding - Method 6
+--------------------
+
+The Imploding algorithm is actually a combination of two distinct
+algorithms. The first algorithm compresses repeated byte
+sequences using a sliding dictionary. The second algorithm is
+used to compress the encoding of the sliding dictionary output,
+using multiple Shannon-Fano trees.
+
+The Imploding algorithm can use a 4K or 8K sliding dictionary
+size. The dictionary size used can be determined by bit 1 in the
+general purpose flag word; a 0 bit indicates a 4K dictionary
+while a 1 bit indicates an 8K dictionary.
+
+The Shannon-Fano trees are stored at the start of the compressed
+file. The number of trees stored is defined by bit 2 in the
+general purpose flag word; a 0 bit indicates two trees stored, a
+1 bit indicates three trees are stored. If 3 trees are stored,
+the first Shannon-Fano tree represents the encoding of the
+Literal characters, the second tree represents the encoding of
+the Length information, the third represents the encoding of the
+Distance information. When 2 Shannon-Fano trees are stored, the
+Length tree is stored first, followed by the Distance tree.
+
+The Literal Shannon-Fano tree, if present is used to represent
+the entire ASCII character set, and contains 256 values. This
+tree is used to compress any data not compressed by the sliding
+dictionary algorithm. When this tree is present, the Minimum
+Match Length for the sliding dictionary is 3. If this tree is
+not present, the Minimum Match Length is 2.
+
+The Length Shannon-Fano tree is used to compress the Length part
+of the (length,distance) pairs from the sliding dictionary
+output. The Length tree contains 64 values, ranging from the
+Minimum Match Length, to 63 plus the Minimum Match Length.
+
+The Distance Shannon-Fano tree is used to compress the Distance
+part of the (length,distance) pairs from the sliding dictionary
+output. The Distance tree contains 64 values, ranging from 0 to
+63, representing the upper 6 bits of the distance value. The
+distance values themselves will be between 0 and the sliding
+dictionary size, either 4K or 8K.
+
+The Shannon-Fano trees themselves are stored in a compressed
+format. The first byte of the tree data represents the number of
+bytes of data representing the (compressed) Shannon-Fano tree
+minus 1. The remaining bytes represent the Shannon-Fano tree
+data encoded as:
+
+ High 4 bits: Number of values at this bit length + 1. (1 - 16)
+ Low 4 bits: Bit Length needed to represent value + 1. (1 - 16)
+
+The Shannon-Fano codes can be constructed from the bit lengths
+using the following algorithm:
+
+1) Sort the Bit Lengths in ascending order, while retaining the
+ order of the original lengths stored in the file.
+
+2) Generate the Shannon-Fano trees:
+
+ Code <- 0
+ CodeIncrement <- 0
+ LastBitLength <- 0
+ i <- number of Shannon-Fano codes - 1 (either 255 or 63)
+
+ loop while i >= 0
+ Code = Code + CodeIncrement
+ if BitLength(i) <> LastBitLength then
+ LastBitLength=BitLength(i)
+ CodeIncrement = 1 shifted left (16 - LastBitLength)
+ ShannonCode(i) = Code
+ i <- i - 1
+ end loop
+
+3) Reverse the order of all the bits in the above ShannonCode()
+ vector, so that the most significant bit becomes the least
+ significant bit. For example, the value 0x1234 (hex) would
+ become 0x2C48 (hex).
+
+4) Restore the order of Shannon-Fano codes as originally stored
+ within the file.
+
+Example:
+
+ This example will show the encoding of a Shannon-Fano tree
+ of size 8. Notice that the actual Shannon-Fano trees used
+ for Imploding are either 64 or 256 entries in size.
+
+Example: 0x02, 0x42, 0x01, 0x13
+
+ The first byte indicates 3 values in this table. Decoding the
+ bytes:
+ 0x42 = 5 codes of 3 bits long
+ 0x01 = 1 code of 2 bits long
+ 0x13 = 2 codes of 4 bits long
+
+ This would generate the original bit length array of:
+ (3, 3, 3, 3, 3, 2, 4, 4)
+
+ There are 8 codes in this table for the values 0 thru 7. Using
+ the algorithm to obtain the Shannon-Fano codes produces:
+
+ Reversed Order Original
+Val Sorted Constructed Code Value Restored Length
+--- ------ ----------------- -------- -------- ------
+0: 2 1100000000000000 11 101 3
+1: 3 1010000000000000 101 001 3
+2: 3 1000000000000000 001 110 3
+3: 3 0110000000000000 110 010 3
+4: 3 0100000000000000 010 100 3
+5: 3 0010000000000000 100 11 2
+6: 4 0001000000000000 1000 1000 4
+7: 4 0000000000000000 0000 0000 4
+
+The values in the Val, Order Restored and Original Length columns
+now represent the Shannon-Fano encoding tree that can be used for
+decoding the Shannon-Fano encoded data. How to parse the
+variable length Shannon-Fano values from the data stream is beyond
+the scope of this document. (See the references listed at the end of
+this document for more information.) However, traditional decoding
+schemes used for Huffman variable length decoding, such as the
+Greenlaw algorithm, can be successfully applied.
+
+The compressed data stream begins immediately after the
+compressed Shannon-Fano data. The compressed data stream can be
+interpreted as follows:
+
+loop until done
+ read 1 bit from input stream.
+
+ if this bit is non-zero then (encoded data is literal data)
+ if Literal Shannon-Fano tree is present
+ read and decode character using Literal Shannon-Fano tree.
+ otherwise
+ read 8 bits from input stream.
+ copy character to the output stream.
+ otherwise (encoded data is sliding dictionary match)
+ if 8K dictionary size
+ read 7 bits for offset Distance (lower 7 bits of offset).
+ otherwise
+ read 6 bits for offset Distance (lower 6 bits of offset).
+
+ using the Distance Shannon-Fano tree, read and decode the
+ upper 6 bits of the Distance value.
+
+ using the Length Shannon-Fano tree, read and decode
+ the Length value.
+
+ Length <- Length + Minimum Match Length
+
+ if Length = 63 + Minimum Match Length
+ read 8 bits from the input stream,
+ add this value to Length.
+
+ move backwards Distance+1 bytes in the output stream, and
+ copy Length characters from this position to the output
+ stream. (if this position is before the start of the output
+ stream, then assume that all the data before the start of
+ the output stream is filled with zeros).
+end loop
+
+Tokenizing - Method 7
+---------------------
+
+This method is not used by PKZIP.
+
+Deflating - Method 8
+--------------------
+
+The Deflate algorithm is similar to the Implode algorithm using
+a sliding dictionary of up to 32K with secondary compression
+from Huffman/Shannon-Fano codes.
+
+The compressed data is stored in blocks with a header describing
+the block and the Huffman codes used in the data block. The header
+format is as follows:
+
+ Bit 0: Last Block bit This bit is set to 1 if this is the last
+ compressed block in the data.
+ Bits 1-2: Block type
+ 00 (0) - Block is stored - All stored data is byte aligned.
+ Skip bits until next byte, then next word = block
+ length, followed by the ones compliment of the block
+ length word. Remaining data in block is the stored
+ data.
+
+ 01 (1) - Use fixed Huffman codes for literal and distance codes.
+ Lit Code Bits Dist Code Bits
+ --------- ---- --------- ----
+ 0 - 143 8 0 - 31 5
+ 144 - 255 9
+ 256 - 279 7
+ 280 - 287 8
+
+ Literal codes 286-287 and distance codes 30-31 are
+ never used but participate in the huffman construction.
+
+ 10 (2) - Dynamic Huffman codes. (See expanding Huffman codes)
+
+ 11 (3) - Reserved - Flag a "Error in compressed data" if seen.
+
+Expanding Huffman Codes
+-----------------------
+If the data block is stored with dynamic Huffman codes, the Huffman
+codes are sent in the following compressed format:
+
+ 5 Bits: # of Literal codes sent - 256 (256 - 286)
+ All other codes are never sent.
+ 5 Bits: # of Dist codes - 1 (1 - 32)
+ 4 Bits: # of Bit Length codes - 3 (3 - 19)
+
+The Huffman codes are sent as bit lengths and the codes are built as
+described in the implode algorithm. The bit lengths themselves are
+compressed with Huffman codes. There are 19 bit length codes:
+
+ 0 - 15: Represent bit lengths of 0 - 15
+ 16: Copy the previous bit length 3 - 6 times.
+ The next 2 bits indicate repeat length (0 = 3, ... ,3 = 6)
+ Example: Codes 8, 16 (+2 bits 11), 16 (+2 bits 10) will
+ expand to 12 bit lengths of 8 (1 + 6 + 5)
+ 17: Repeat a bit length of 0 for 3 - 10 times. (3 bits of length)
+ 18: Repeat a bit length of 0 for 11 - 138 times (7 bits of length)
+
+The lengths of the bit length codes are sent packed 3 bits per value
+(0 - 7) in the following order:
+
+ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15
+
+The Huffman codes should be built as described in the Implode algorithm
+except codes are assigned starting at the shortest bit length, i.e. the
+shortest code should be all 0's rather than all 1's. Also, codes with
+a bit length of zero do not participate in the tree construction. The
+codes are then used to decode the bit lengths for the literal and
+distance tables.
+
+The bit lengths for the literal tables are sent first with the number
+of entries sent described by the 5 bits sent earlier. There are up
+to 286 literal characters; the first 256 represent the respective 8
+bit character, code 256 represents the End-Of-Block code, the remaining
+29 codes represent copy lengths of 3 thru 258. There are up to 30
+distance codes representing distances from 1 thru 32k as described
+below.
+
+ Length Codes
+ ------------
+ Extra Extra Extra Extra
+ Code Bits Length Code Bits Lengths Code Bits Lengths Code Bits Length(s)
+ ---- ---- ------ ---- ---- ------- ---- ---- ------- ---- ---- ---------
+ 257 0 3 265 1 11,12 273 3 35-42 281 5 131-162
+ 258 0 4 266 1 13,14 274 3 43-50 282 5 163-194
+ 259 0 5 267 1 15,16 275 3 51-58 283 5 195-226
+ 260 0 6 268 1 17,18 276 3 59-66 284 5 227-257
+ 261 0 7 269 2 19-22 277 4 67-82 285 0 258
+ 262 0 8 270 2 23-26 278 4 83-98
+ 263 0 9 271 2 27-30 279 4 99-114
+ 264 0 10 272 2 31-34 280 4 115-130
+
+ Distance Codes
+ --------------
+ Extra Extra Extra Extra
+ Code Bits Dist Code Bits Dist Code Bits Distance Code Bits Distance
+ ---- ---- ---- ---- ---- ------ ---- ---- -------- ---- ---- --------
+ 0 0 1 8 3 17-24 16 7 257-384 24 11 4097-6144
+ 1 0 2 9 3 25-32 17 7 385-512 25 11 6145-8192
+ 2 0 3 10 4 33-48 18 8 513-768 26 12 8193-12288
+ 3 0 4 11 4 49-64 19 8 769-1024 27 12 12289-16384
+ 4 1 5,6 12 5 65-96 20 9 1025-1536 28 13 16385-24576
+ 5 1 7,8 13 5 97-128 21 9 1537-2048 29 13 24577-32768
+ 6 2 9-12 14 6 129-192 22 10 2049-3072
+ 7 2 13-16 15 6 193-256 23 10 3073-4096
+
+The compressed data stream begins immediately after the
+compressed header data. The compressed data stream can be
+interpreted as follows:
+
+do
+ read header from input stream.
+
+ if stored block
+ skip bits until byte aligned
+ read count and 1's compliment of count
+ copy count bytes data block
+ otherwise
+ loop until end of block code sent
+ decode literal character from input stream
+ if literal < 256
+ copy character to the output stream
+ otherwise
+ if literal = end of block
+ break from loop
+ otherwise
+ decode distance from input stream
+
+ move backwards distance bytes in the output stream, and
+ copy length characters from this position to the output
+ stream.
+ end loop
+while not last block
+
+if data descriptor exists
+ skip bits until byte aligned
+ read crc and sizes
+endif
+
+Enhanced Deflating - Method 9
+-----------------------------
+
+The Enhanced Deflating algorithm is similar to Deflate but
+uses a sliding dictionary of up to 64K. Deflate64(tm) is supported
+by the Deflate extractor.
+
+BZIP2 - Method 12
+-----------------
+
+BZIP2 is an open-source data compression algorithm developed by
+Julian Seward. Information and source code for this algorithm
+can be found on the internet.
+
+LZMA - Method 14 (EFS)
+----------------------
+
+LZMA is a block-oriented, general purpose data compression algorithm
+developed and maintained by Igor Pavlov. It is a derivative of LZ77
+that utilizes Markov chains and a range coder. Information and
+source code for this algorithm can be found on the internet. Consult
+with the author of this algorithm for information on terms or
+restrictions on use.
+
+Support for LZMA within the ZIP format is defined as follows:
+
+The Compression method field within the ZIP Local and Central
+Header records will be set to the value 14 to indicate data was
+compressed using LZMA.
+
+The Version needed to extract field within the ZIP Local and
+Central Header records will be set to 6.3 to indicate the
+minimum ZIP format version supporting this feature.
+
+File data compressed using the LZMA algorithm must be placed
+immediately following the Local Header for the file. If a
+standard ZIP encryption header is required, it will follow
+the Local Header and will precede the LZMA compressed file
+data segment. The location of LZMA compressed data segment
+within the ZIP format will be as shown:
+
+ [local header file 1]
+ [encryption header file 1]
+ [LZMA compressed data segment for file 1]
+ [data descriptor 1]
+ [local header file 2]
+
+The encryption header and data descriptor records may
+be conditionally present. The LZMA Compressed Data Segment
+will consist of an LZMA Properties Header followed by the
+LZMA Compressed Data as shown:
+
+ [LZMA properties header for file 1]
+ [LZMA compressed data for file 1]
+
+The LZMA Compressed Data will be stored as provided by the
+LZMA compression library. Compressed size, uncompressed
+size and other file characteristics about the file being
+compressed must be stored in standard ZIP storage format.
+
+The LZMA Properties Header will store specific data required to
+decompress the LZMA compressed Data. This data is set by the
+LZMA compression engine using the function WriteCoderProperties()
+as documented within the LZMA SDK.
+
+Storage fields for the property information within the LZMA
+Properties Header are as follows:
+
+ LZMA Version Information 2 bytes
+ LZMA Properties Size 2 bytes
+ LZMA Properties Data variable, defined by "LZMA Properties Size"
+
+LZMA Version Information - this field identifies which version of
+ the LZMA SDK was used to compress a file. The first byte will
+ store the major version number of the LZMA SDK and the second
+ byte will store the minor number.
+
+LZMA Properties Size - this field defines the size of the remaining
+ property data. Typically this size should be determined by the
+ version of the SDK. This size field is included as a convenience
+ and to help avoid any ambiguity should it arise in the future due
+ to changes in this compression algorithm.
+
+LZMA Property Data - this variable sized field records the required
+ values for the decompressor as defined by the LZMA SDK. The
+ data stored in this field should be obtained using the
+ WriteCoderProperties() in the version of the SDK defined by
+ the "LZMA Version Information" field.
+
+The layout of the "LZMA Properties Data" field is a function of the
+LZMA compression algorithm. It is possible that this layout may be
+changed by the author over time. The data layout in version 4.32
+of the LZMA SDK defines a 5 byte array that uses 4 bytes to store
+the dictionary size in little-endian order. This is preceded by a
+single packed byte as the first element of the array that contains
+the following fields:
+
+ PosStateBits
+ LiteralPosStateBits
+ LiteralContextBits
+
+Refer to the LZMA documentation for a more detailed explanation of
+these fields.
+
+Data compressed with method 14, LZMA, may include an end-of-stream
+(EOS) marker ending the compressed data stream. This marker is not
+required, but its use is highly recommended to facilitate processing
+and implementers should include the EOS marker whenever possible.
+When the EOS marker is used, general purpose bit 1 must be set. If
+general purpose bit 1 is not set, the EOS marker is not present.
+
+WavPack - Method 97
+-------------------
+
+Information describing the use of compression method 97 is
+provided by WinZIP International, LLC. This method relies on the
+open source WavPack audio compression utility developed by David Bryant.
+Information on WavPack is available at www.wavpack.com. Please consult
+with the author of this algorithm for information on terms and
+restrictions on use.
+
+WavPack data for a file begins immediately after the end of the
+local header data. This data is the output from WavPack compression
+routines. Within the ZIP file, the use of WavPack compression is
+indicated by setting the compression method field to a value of 97
+in both the local header and the central directory header. The Version
+needed to extract and version made by fields use the same values as are
+used for data compressed using the Deflate algorithm.
+
+An implementation note for storing digital sample data when using
+WavPack compression within ZIP files is that all of the bytes of
+the sample data should be compressed. This includes any unused
+bits up to the byte boundary. An example is a 2 byte sample that
+uses only 12 bits for the sample data with 4 unused bits. If only
+12 bits are passed as the sample size to the WavPack routines, the 4
+unused bits will be set to 0 on extraction regardless of their original
+state. To avoid this, the full 16 bits of the sample data size
+should be provided.
+
+PPMd - Method 98
+----------------
+
+PPMd is a data compression algorithm developed by Dmitry Shkarin
+which includes a carryless rangecoder developed by Dmitry Subbotin.
+This algorithm is based on predictive phrase matching on multiple
+order contexts. Information and source code for this algorithm
+can be found on the internet. Consult with the author of this
+algorithm for information on terms or restrictions on use.
+
+Support for PPMd within the ZIP format currently is provided only
+for version I, revision 1 of the algorithm. Storage requirements
+for using this algorithm are as follows:
+
+Parameters needed to control the algorithm are stored in the two
+bytes immediately preceding the compressed data. These bytes are
+used to store the following fields:
+
+Model order - sets the maximum model order, default is 8, possible
+ values are from 2 to 16 inclusive
+
+Sub-allocator size - sets the size of sub-allocator in MB, default is 50,
+ possible values are from 1MB to 256MB inclusive
+
+Model restoration method - sets the method used to restart context
+ model at memory insufficiency, values are:
+
+ 0 - restarts model from scratch - default
+ 1 - cut off model - decreases performance by as much as 2x
+ 2 - freeze context tree - not recommended
+
+An example for packing these fields into the 2 byte storage field is
+illustrated below. These values are stored in Intel low-byte/high-byte
+order.
+
+wPPMd = (Model order - 1) +
+ ((Sub-allocator size - 1) << 4) +
+ (Model restoration method << 12)
+
+
+VII. Traditional PKWARE Encryption
+----------------------------------
+
+The following information discusses the decryption steps
+required to support traditional PKWARE encryption. This
+form of encryption is considered weak by today's standards
+and its use is recommended only for situations with
+low security needs or for compatibility with older .ZIP
+applications.
+
+Decryption
+----------
+
+PKWARE is grateful to Mr. Roger Schlafly for his expert contribution
+towards the development of PKWARE's traditional encryption.
+
+PKZIP encrypts the compressed data stream. Encrypted files must
+be decrypted before they can be extracted.
+
+Each encrypted file has an extra 12 bytes stored at the start of
+the data area defining the encryption header for that file. The
+encryption header is originally set to random values, and then
+itself encrypted, using three, 32-bit keys. The key values are
+initialized using the supplied encryption password. After each byte
+is encrypted, the keys are then updated using pseudo-random number
+generation techniques in combination with the same CRC-32 algorithm
+used in PKZIP and described elsewhere in this document.
+
+The following is the basic steps required to decrypt a file:
+
+1) Initialize the three 32-bit keys with the password.
+2) Read and decrypt the 12-byte encryption header, further
+ initializing the encryption keys.
+3) Read and decrypt the compressed data stream using the
+ encryption keys.
+
+Step 1 - Initializing the encryption keys
+-----------------------------------------
+
+Key(0) <- 305419896
+Key(1) <- 591751049
+Key(2) <- 878082192
+
+loop for i <- 0 to length(password)-1
+ update_keys(password(i))
+end loop
+
+Where update_keys() is defined as:
+
+update_keys(char):
+ Key(0) <- crc32(key(0),char)
+ Key(1) <- Key(1) + (Key(0) & 000000ffH)
+ Key(1) <- Key(1) * 134775813 + 1
+ Key(2) <- crc32(key(2),key(1) >> 24)
+end update_keys
+
+Where crc32(old_crc,char) is a routine that given a CRC value and a
+character, returns an updated CRC value after applying the CRC-32
+algorithm described elsewhere in this document.
+
+Step 2 - Decrypting the encryption header
+-----------------------------------------
+
+The purpose of this step is to further initialize the encryption
+keys, based on random data, to render a plaintext attack on the
+data ineffective.
+
+Read the 12-byte encryption header into Buffer, in locations
+Buffer(0) thru Buffer(11).
+
+loop for i <- 0 to 11
+ C <- buffer(i) ^ decrypt_byte()
+ update_keys(C)
+ buffer(i) <- C
+end loop
+
+Where decrypt_byte() is defined as:
+
+unsigned char decrypt_byte()
+ local unsigned short temp
+ temp <- Key(2) | 2
+ decrypt_byte <- (temp * (temp ^ 1)) >> 8
+end decrypt_byte
+
+After the header is decrypted, the last 1 or 2 bytes in Buffer
+should be the high-order word/byte of the CRC for the file being
+decrypted, stored in Intel low-byte/high-byte order. Versions of
+PKZIP prior to 2.0 used a 2 byte CRC check; a 1 byte CRC check is
+used on versions after 2.0. This can be used to test if the password
+supplied is correct or not.
+
+Step 3 - Decrypting the compressed data stream
+----------------------------------------------
+
+The compressed data stream can be decrypted as follows:
+
+loop until done
+ read a character into C
+ Temp <- C ^ decrypt_byte()
+ update_keys(temp)
+ output Temp
+end loop
+
+
+VIII. Strong Encryption Specification
+-------------------------------------
+
+The Strong Encryption technology defined in this specification is
+covered under a pending patent application. The use or implementation
+in a product of certain technological aspects set forth in the current
+APPNOTE, including those with regard to strong encryption, patching,
+or extended tape operations requires a license from PKWARE. Portions
+of this Strong Encryption technology are available for use at no charge.
+Contact PKWARE for licensing terms and conditions. Refer to section II
+of this APPNOTE (Contacting PKWARE) for information on how to
+contact PKWARE.
+
+Version 5.x of this specification introduced support for strong
+encryption algorithms. These algorithms can be used with either
+a password or an X.509v3 digital certificate to encrypt each file.
+This format specification supports either password or certificate
+based encryption to meet the security needs of today, to enable
+interoperability between users within both PKI and non-PKI
+environments, and to ensure interoperability between different
+computing platforms that are running a ZIP program.
+
+Password based encryption is the most common form of encryption
+people are familiar with. However, inherent weaknesses with
+passwords (e.g. susceptibility to dictionary/brute force attack)
+as well as password management and support issues make certificate
+based encryption a more secure and scalable option. Industry
+efforts and support are defining and moving towards more advanced
+security solutions built around X.509v3 digital certificates and
+Public Key Infrastructures(PKI) because of the greater scalability,
+administrative options, and more robust security over traditional
+password based encryption.
+
+Most standard encryption algorithms are supported with this
+specification. Reference implementations for many of these
+algorithms are available from either commercial or open source
+distributors. Readily available cryptographic toolkits make
+implementation of the encryption features straight-forward.
+This document is not intended to provide a treatise on data
+encryption principles or theory. Its purpose is to document the
+data structures required for implementing interoperable data
+encryption within the .ZIP format. It is strongly recommended that
+you have a good understanding of data encryption before reading
+further.
+
+The algorithms introduced in Version 5.0 of this specification
+include:
+
+ RC2 40 bit, 64 bit, and 128 bit
+ RC4 40 bit, 64 bit, and 128 bit
+ DES
+ 3DES 112 bit and 168 bit
+
+Version 5.1 adds support for the following:
+
+ AES 128 bit, 192 bit, and 256 bit
+
+
+Version 6.1 introduces encryption data changes to support
+interoperability with Smartcard and USB Token certificate storage
+methods which do not support the OAEP strengthening standard.
+
+Version 6.2 introduces support for encrypting metadata by compressing
+and encrypting the central directory data structure to reduce information
+leakage. Information leakage can occur in legacy ZIP applications
+through exposure of information about a file even though that file is
+stored encrypted. The information exposed consists of file
+characteristics stored within the records and fields defined by this
+specification. This includes data such as a files name, its original
+size, timestamp and CRC32 value.
+
+Version 6.3 introduces support for encrypting data using the Blowfish
+and Twofish algorithms. These are symmetric block ciphers developed
+by Bruce Schneier. Blowfish supports using a variable length key from
+32 to 448 bits. Block size is 64 bits. Implementations should use 16
+rounds and the only mode supported within ZIP files is CBC. Twofish
+supports key sizes 128, 192 and 256 bits. Block size is 128 bits.
+Implementations should use 16 rounds and the only mode supported within
+ZIP files is CBC. Information and source code for both Blowfish and
+Twofish algorithms can be found on the internet. Consult with the author
+of these algorithms for information on terms or restrictions on use.
+
+Central Directory Encryption provides greater protection against
+information leakage by encrypting the Central Directory structure and
+by masking key values that are replicated in the unencrypted Local
+Header. ZIP compatible programs that cannot interpret an encrypted
+Central Directory structure cannot rely on the data in the corresponding
+Local Header for decompression information.
+
+Extra Field records that may contain information about a file that should
+not be exposed should not be stored in the Local Header and should only
+be written to the Central Directory where they can be encrypted. This
+design currently does not support streaming. Information in the End of
+Central Directory record, the Zip64 End of Central Directory Locator,
+and the Zip64 End of Central Directory records are not encrypted. Access
+to view data on files within a ZIP file with an encrypted Central Directory
+requires the appropriate password or private key for decryption prior to
+viewing any files, or any information about the files, in the archive.
+
+Older ZIP compatible programs not familiar with the Central Directory
+Encryption feature will no longer be able to recognize the Central
+Directory and may assume the ZIP file is corrupt. Programs that
+attempt streaming access using Local Headers will see invalid
+information for each file. Central Directory Encryption need not be
+used for every ZIP file. Its use is recommended for greater security.
+ZIP files not using Central Directory Encryption should operate as
+in the past.
+
+This strong encryption feature specification is intended to provide for
+scalable, cross-platform encryption needs ranging from simple password
+encryption to authenticated public/private key encryption.
+
+Encryption provides data confidentiality and privacy. It is
+recommended that you combine X.509 digital signing with encryption
+to add authentication and non-repudiation.
+
+
+Single Password Symmetric Encryption Method:
+-------------------------------------------
+
+The Single Password Symmetric Encryption Method using strong
+encryption algorithms operates similarly to the traditional
+PKWARE encryption defined in this format. Additional data
+structures are added to support the processing needs of the
+strong algorithms.
+
+The Strong Encryption data structures are:
+
+1. General Purpose Bits - Bits 0 and 6 of the General Purpose bit
+flag in both local and central header records. Both bits set
+indicates strong encryption. Bit 13, when set indicates the Central
+Directory is encrypted and that selected fields in the Local Header
+are masked to hide their actual value.
+
+
+2. Extra Field 0x0017 in central header only.
+
+ Fields to consider in this record are:
+
+ Format - the data format identifier for this record. The only
+ value allowed at this time is the integer value 2.
+
+ AlgId - integer identifier of the encryption algorithm from the
+ following range
+
+ 0x6601 - DES
+ 0x6602 - RC2 (version needed to extract < 5.2)
+ 0x6603 - 3DES 168
+ 0x6609 - 3DES 112
+ 0x660E - AES 128
+ 0x660F - AES 192
+ 0x6610 - AES 256
+ 0x6702 - RC2 (version needed to extract >= 5.2)
+ 0x6720 - Blowfish
+ 0x6721 - Twofish
+ 0x6801 - RC4
+ 0xFFFF - Unknown algorithm
+
+ Bitlen - Explicit bit length of key
+
+ 32 - 448 bits
+
+ Flags - Processing flags needed for decryption
+
+ 0x0001 - Password is required to decrypt
+ 0x0002 - Certificates only
+ 0x0003 - Password or certificate required to decrypt
+
+ Values > 0x0003 reserved for certificate processing
+
+
+3. Decryption header record preceding compressed file data.
+
+ -Decryption Header:
+
+ Value Size Description
+ ----- ---- -----------
+ IVSize 2 bytes Size of initialization vector (IV)
+ IVData IVSize Initialization vector for this file
+ Size 4 bytes Size of remaining decryption header data
+ Format 2 bytes Format definition for this record
+ AlgID 2 bytes Encryption algorithm identifier
+ Bitlen 2 bytes Bit length of encryption key
+ Flags 2 bytes Processing flags
+ ErdSize 2 bytes Size of Encrypted Random Data
+ ErdData ErdSize Encrypted Random Data
+ Reserved1 4 bytes Reserved certificate processing data
+ Reserved2 (var) Reserved for certificate processing data
+ VSize 2 bytes Size of password validation data
+ VData VSize-4 Password validation data
+ VCRC32 4 bytes Standard ZIP CRC32 of password validation data
+
+ IVData - The size of the IV should match the algorithm block size.
+ The IVData can be completely random data. If the size of
+ the randomly generated data does not match the block size
+ it should be complemented with zero's or truncated as
+ necessary. If IVSize is 0,then IV = CRC32 + Uncompressed
+ File Size (as a 64 bit little-endian, unsigned integer value).
+
+ Format - the data format identifier for this record. The only
+ value allowed at this time is the integer value 3.
+
+ AlgId - integer identifier of the encryption algorithm from the
+ following range
+
+ 0x6601 - DES
+ 0x6602 - RC2 (version needed to extract < 5.2)
+ 0x6603 - 3DES 168
+ 0x6609 - 3DES 112
+ 0x660E - AES 128
+ 0x660F - AES 192
+ 0x6610 - AES 256
+ 0x6702 - RC2 (version needed to extract >= 5.2)
+ 0x6720 - Blowfish
+ 0x6721 - Twofish
+ 0x6801 - RC4
+ 0xFFFF - Unknown algorithm
+
+ Bitlen - Explicit bit length of key
+
+ 32 - 448 bits
+
+ Flags - Processing flags needed for decryption
+
+ 0x0001 - Password is required to decrypt
+ 0x0002 - Certificates only
+ 0x0003 - Password or certificate required to decrypt
+
+ Values > 0x0003 reserved for certificate processing
+
+ ErdData - Encrypted random data is used to store random data that
+ is used to generate a file session key for encrypting
+ each file. SHA1 is used to calculate hash data used to
+ derive keys. File session keys are derived from a master
+ session key generated from the user-supplied password.
+ If the Flags field in the decryption header contains
+ the value 0x4000, then the ErdData field must be
+ decrypted using 3DES. If the value 0x4000 is not set,
+ then the ErdData field must be decrypted using AlgId.
+
+
+ Reserved1 - Reserved for certificate processing, if value is
+ zero, then Reserved2 data is absent. See the explanation
+ under the Certificate Processing Method for details on
+ this data structure.
+
+ Reserved2 - If present, the size of the Reserved2 data structure
+ is located by skipping the first 4 bytes of this field
+ and using the next 2 bytes as the remaining size. See
+ the explanation under the Certificate Processing Method
+ for details on this data structure.
+
+ VSize - This size value will always include the 4 bytes of the
+ VCRC32 data and will be greater than 4 bytes.
+
+ VData - Random data for password validation. This data is VSize
+ in length and VSize must be a multiple of the encryption
+ block size. VCRC32 is a checksum value of VData.
+ VData and VCRC32 are stored encrypted and start the
+ stream of encrypted data for a file.
+
+
+4. Useful Tips
+
+Strong Encryption is always applied to a file after compression. The
+block oriented algorithms all operate in Cypher Block Chaining (CBC)
+mode. The block size used for AES encryption is 16. All other block
+algorithms use a block size of 8. Two ID's are defined for RC2 to
+account for a discrepancy found in the implementation of the RC2
+algorithm in the cryptographic library on Windows XP SP1 and all
+earlier versions of Windows. It is recommended that zero length files
+not be encrypted, however programs should be prepared to extract them
+if they are found within a ZIP file.
+
+A pseudo-code representation of the encryption process is as follows:
+
+Password = GetUserPassword()
+MasterSessionKey = DeriveKey(SHA1(Password))
+RD = CryptographicStrengthRandomData()
+For Each File
+ IV = CryptographicStrengthRandomData()
+ VData = CryptographicStrengthRandomData()
+ VCRC32 = CRC32(VData)
+ FileSessionKey = DeriveKey(SHA1(IV + RD)
+ ErdData = Encrypt(RD,MasterSessionKey,IV)
+ Encrypt(VData + VCRC32 + FileData, FileSessionKey,IV)
+Done
+
+The function names and parameter requirements will depend on
+the choice of the cryptographic toolkit selected. Almost any
+toolkit supporting the reference implementations for each
+algorithm can be used. The RSA BSAFE(r), OpenSSL, and Microsoft
+CryptoAPI libraries are all known to work well.
+
+
+Single Password - Central Directory Encryption:
+-----------------------------------------------
+
+Central Directory Encryption is achieved within the .ZIP format by
+encrypting the Central Directory structure. This encapsulates the metadata
+most often used for processing .ZIP files. Additional metadata is stored for
+redundancy in the Local Header for each file. The process of concealing
+metadata by encrypting the Central Directory does not protect the data within
+the Local Header. To avoid information leakage from the exposed metadata
+in the Local Header, the fields containing information about a file are masked.
+
+Local Header:
+
+Masking replaces the true content of the fields for a file in the Local
+Header with false information. When masked, the Local Header is not
+suitable for streaming access and the options for data recovery of damaged
+archives is reduced. Extra Data fields that may contain confidential
+data should not be stored within the Local Header. The value set into
+the Version needed to extract field should be the correct value needed to
+extract the file without regard to Central Directory Encryption. The fields
+within the Local Header targeted for masking when the Central Directory is
+encrypted are:
+
+ Field Name Mask Value
+ ------------------ ---------------------------
+ compression method 0
+ last mod file time 0
+ last mod file date 0
+ crc-32 0
+ compressed size 0
+ uncompressed size 0
+ file name (variable size) Base 16 value from the
+ range 1 - 0xFFFFFFFFFFFFFFFF
+ represented as a string whose
+ size will be set into the
+ file name length field
+
+The Base 16 value assigned as a masked file name is simply a sequentially
+incremented value for each file starting with 1 for the first file.
+Modifications to a ZIP file may cause different values to be stored for
+each file. For compatibility, the file name field in the Local Header
+should never be left blank. As of Version 6.2 of this specification,
+the Compression Method and Compressed Size fields are not yet masked.
+Fields having a value of 0xFFFF or 0xFFFFFFFF for the ZIP64 format
+should not be masked.
+
+Encrypting the Central Directory:
+
+Encryption of the Central Directory does not include encryption of the
+Central Directory Signature data, the Zip64 End of Central Directory
+record, the Zip64 End of Central Directory Locator, or the End
+of Central Directory record. The ZIP file comment data is never
+encrypted.
+
+Before encrypting the Central Directory, it may optionally be compressed.
+Compression is not required, but for storage efficiency it is assumed
+this structure will be compressed before encrypting. Similarly, this
+specification supports compressing the Central Directory without
+requiring that it also be encrypted. Early implementations of this
+feature will assume the encryption method applied to files matches the
+encryption applied to the Central Directory.
+
+Encryption of the Central Directory is done in a manner similar to
+that of file encryption. The encrypted data is preceded by a
+decryption header. The decryption header is known as the Archive
+Decryption Header. The fields of this record are identical to
+the decryption header preceding each encrypted file. The location
+of the Archive Decryption Header is determined by the value in the
+Start of the Central Directory field in the Zip64 End of Central
+Directory record. When the Central Directory is encrypted, the
+Zip64 End of Central Directory record will always be present.
+
+The layout of the Zip64 End of Central Directory record for all
+versions starting with 6.2 of this specification will follow the
+Version 2 format. The Version 2 format is as follows:
+
+The leading fixed size fields within the Version 1 format for this
+record remain unchanged. The record signature for both Version 1
+and Version 2 will be 0x06064b50. Immediately following the last
+byte of the field known as the Offset of Start of Central
+Directory With Respect to the Starting Disk Number will begin the
+new fields defining Version 2 of this record.
+
+New fields for Version 2:
+
+Note: all fields stored in Intel low-byte/high-byte order.
+
+ Value Size Description
+ ----- ---- -----------
+ Compression Method 2 bytes Method used to compress the
+ Central Directory
+ Compressed Size 8 bytes Size of the compressed data
+ Original Size 8 bytes Original uncompressed size
+ AlgId 2 bytes Encryption algorithm ID
+ BitLen 2 bytes Encryption key length
+ Flags 2 bytes Encryption flags
+ HashID 2 bytes Hash algorithm identifier
+ Hash Length 2 bytes Length of hash data
+ Hash Data (variable) Hash data
+
+The Compression Method accepts the same range of values as the
+corresponding field in the Central Header.
+
+The Compressed Size and Original Size values will not include the
+data of the Central Directory Signature which is compressed or
+encrypted.
+
+The AlgId, BitLen, and Flags fields accept the same range of values
+the corresponding fields within the 0x0017 record.
+
+Hash ID identifies the algorithm used to hash the Central Directory
+data. This data does not have to be hashed, in which case the
+values for both the HashID and Hash Length will be 0. Possible
+values for HashID are:
+
+ Value Algorithm
+ ------ ---------
+ 0x0000 none
+ 0x0001 CRC32
+ 0x8003 MD5
+ 0x8004 SHA1
+ 0x8007 RIPEMD160
+ 0x800C SHA256
+ 0x800D SHA384
+ 0x800E SHA512
+
+When the Central Directory data is signed, the same hash algorithm
+used to hash the Central Directory for signing should be used.
+This is recommended for processing efficiency, however, it is
+permissible for any of the above algorithms to be used independent
+of the signing process.
+
+The Hash Data will contain the hash data for the Central Directory.
+The length of this data will vary depending on the algorithm used.
+
+The Version Needed to Extract should be set to 62.
+
+The value for the Total Number of Entries on the Current Disk will
+be 0. These records will no longer support random access when
+encrypting the Central Directory.
+
+When the Central Directory is compressed and/or encrypted, the
+End of Central Directory record will store the value 0xFFFFFFFF
+as the value for the Total Number of Entries in the Central
+Directory. The value stored in the Total Number of Entries in
+the Central Directory on this Disk field will be 0. The actual
+values will be stored in the equivalent fields of the Zip64
+End of Central Directory record.
+
+Decrypting and decompressing the Central Directory is accomplished
+in the same manner as decrypting and decompressing a file.
+
+Certificate Processing Method:
+-----------------------------
+
+The Certificate Processing Method of for ZIP file encryption
+defines the following additional data fields:
+
+1. Certificate Flag Values
+
+Additional processing flags that can be present in the Flags field of both
+the 0x0017 field of the central directory Extra Field and the Decryption
+header record preceding compressed file data are:
+
+ 0x0007 - reserved for future use
+ 0x000F - reserved for future use
+ 0x0100 - Indicates non-OAEP key wrapping was used. If this
+ this field is set, the version needed to extract must
+ be at least 61. This means OAEP key wrapping is not
+ used when generating a Master Session Key using
+ ErdData.
+ 0x4000 - ErdData must be decrypted using 3DES-168, otherwise use the
+ same algorithm used for encrypting the file contents.
+ 0x8000 - reserved for future use
+
+
+2. CertData - Extra Field 0x0017 record certificate data structure
+
+The data structure used to store certificate data within the section
+of the Extra Field defined by the CertData field of the 0x0017
+record are as shown:
+
+ Value Size Description
+ ----- ---- -----------
+ RCount 4 bytes Number of recipients.
+ HashAlg 2 bytes Hash algorithm identifier
+ HSize 2 bytes Hash size
+ SRList (var) Simple list of recipients hashed public keys
+
+
+ RCount This defines the number intended recipients whose
+ public keys were used for encryption. This identifies
+ the number of elements in the SRList.
+
+ HashAlg This defines the hash algorithm used to calculate
+ the public key hash of each public key used
+ for encryption. This field currently supports
+ only the following value for SHA-1
+
+ 0x8004 - SHA1
+
+ HSize This defines the size of a hashed public key.
+
+ SRList This is a variable length list of the hashed
+ public keys for each intended recipient. Each
+ element in this list is HSize. The total size of
+ SRList is determined using RCount * HSize.
+
+
+3. Reserved1 - Certificate Decryption Header Reserved1 Data:
+
+ Value Size Description
+ ----- ---- -----------
+ RCount 4 bytes Number of recipients.
+
+ RCount This defines the number intended recipients whose
+ public keys were used for encryption. This defines
+ the number of elements in the REList field defined below.
+
+
+4. Reserved2 - Certificate Decryption Header Reserved2 Data Structures:
+
+
+ Value Size Description
+ ----- ---- -----------
+ HashAlg 2 bytes Hash algorithm identifier
+ HSize 2 bytes Hash size
+ REList (var) List of recipient data elements
+
+
+ HashAlg This defines the hash algorithm used to calculate
+ the public key hash of each public key used
+ for encryption. This field currently supports
+ only the following value for SHA-1
+
+ 0x8004 - SHA1
+
+ HSize This defines the size of a hashed public key
+ defined in REHData.
+
+ REList This is a variable length of list of recipient data.
+ Each element in this list consists of a Recipient
+ Element data structure as follows:
+
+
+ Recipient Element (REList) Data Structure:
+
+ Value Size Description
+ ----- ---- -----------
+ RESize 2 bytes Size of REHData + REKData
+ REHData HSize Hash of recipients public key
+ REKData (var) Simple key blob
+
+
+ RESize This defines the size of an individual REList
+ element. This value is the combined size of the
+ REHData field + REKData field. REHData is defined by
+ HSize. REKData is variable and can be calculated
+ for each REList element using RESize and HSize.
+
+ REHData Hashed public key for this recipient.
+
+ REKData Simple Key Blob. The format of this data structure
+ is identical to that defined in the Microsoft
+ CryptoAPI and generated using the CryptExportKey()
+ function. The version of the Simple Key Blob
+ supported at this time is 0x02 as defined by
+ Microsoft.
+
+Certificate Processing - Central Directory Encryption:
+------------------------------------------------------
+
+Central Directory Encryption using Digital Certificates will
+operate in a manner similar to that of Single Password Central
+Directory Encryption. This record will only be present when there
+is data to place into it. Currently, data is placed into this
+record when digital certificates are used for either encrypting
+or signing the files within a ZIP file. When only password
+encryption is used with no certificate encryption or digital
+signing, this record is not currently needed. When present, this
+record will appear before the start of the actual Central Directory
+data structure and will be located immediately after the Archive
+Decryption Header if the Central Directory is encrypted.
+
+The Archive Extra Data record will be used to store the following
+information. Additional data may be added in future versions.
+
+Extra Data Fields:
+
+0x0014 - PKCS#7 Store for X.509 Certificates
+0x0016 - X.509 Certificate ID and Signature for central directory
+0x0019 - PKCS#7 Encryption Recipient Certificate List
+
+The 0x0014 and 0x0016 Extra Data records that otherwise would be
+located in the first record of the Central Directory for digital
+certificate processing. When encrypting or compressing the Central
+Directory, the 0x0014 and 0x0016 records must be located in the
+Archive Extra Data record and they should not remain in the first
+Central Directory record. The Archive Extra Data record will also
+be used to store the 0x0019 data.
+
+When present, the size of the Archive Extra Data record will be
+included in the size of the Central Directory. The data of the
+Archive Extra Data record will also be compressed and encrypted
+along with the Central Directory data structure.
+
+Certificate Processing Differences:
+
+The Certificate Processing Method of encryption differs from the
+Single Password Symmetric Encryption Method as follows. Instead
+of using a user-defined password to generate a master session key,
+cryptographically random data is used. The key material is then
+wrapped using standard key-wrapping techniques. This key material
+is wrapped using the public key of each recipient that will need
+to decrypt the file using their corresponding private key.
+
+This specification currently assumes digital certificates will follow
+the X.509 V3 format for 1024 bit and higher RSA format digital
+certificates. Implementation of this Certificate Processing Method
+requires supporting logic for key access and management. This logic
+is outside the scope of this specification.
+
+OAEP Processing with Certificate-based Encryption:
+
+OAEP stands for Optimal Asymmetric Encryption Padding. It is a
+strengthening technique used for small encoded items such as decryption
+keys. This is commonly applied in cryptographic key-wrapping techniques
+and is supported by PKCS #1. Versions 5.0 and 6.0 of this specification
+were designed to support OAEP key-wrapping for certificate-based
+decryption keys for additional security.
+
+Support for private keys stored on Smartcards or Tokens introduced
+a conflict with this OAEP logic. Most card and token products do
+not support the additional strengthening applied to OAEP key-wrapped
+data. In order to resolve this conflict, versions 6.1 and above of this
+specification will no longer support OAEP when encrypting using
+digital certificates.
+
+Versions of PKZIP available during initial development of the
+certificate processing method set a value of 61 into the
+version needed to extract field for a file. This indicates that
+non-OAEP key wrapping is used. This affects certificate encryption
+only, and password encryption functions should not be affected by
+this value. This means values of 61 may be found on files encrypted
+with certificates only, or on files encrypted with both password
+encryption and certificate encryption. Files encrypted with both
+methods can safely be decrypted using the password methods documented.
+
+IX. Change Process
+------------------
+
+In order for the .ZIP file format to remain a viable definition, this
+specification should be considered as open for periodic review and
+revision. Although this format was originally designed with a
+certain level of extensibility, not all changes in technology
+(present or future) were or will be necessarily considered in its
+design. If your application requires new definitions to the
+extensible sections in this format, or if you would like to
+submit new data structures, please forward your request to
+zipformat@pkware.com. All submissions will be reviewed by the
+ZIP File Specification Committee for possible inclusion into
+future versions of this specification. Periodic revisions
+to this specification will be published to ensure interoperability.
+We encourage comments and feedback that may help improve clarity
+or content.
+
+X. Incorporating PKWARE Proprietary Technology into Your Product
+----------------------------------------------------------------
+
+PKWARE is committed to the interoperability and advancement of the
+.ZIP format. PKWARE offers a free license for certain technological
+aspects described above under certain restrictions and conditions.
+However, the use or implementation in a product of certain technological
+aspects set forth in the current APPNOTE, including those with regard to
+strong encryption, patching, or extended tape operations requires a
+license from PKWARE. Please contact PKWARE with regard to acquiring
+a license.
+
+XI. Acknowledgements
+---------------------
+
+In addition to the above mentioned contributors to PKZIP and PKUNZIP,
+I would like to extend special thanks to Robert Mahoney for suggesting
+the extension .ZIP for this software.
+
+XII. References
+---------------
+
+ Fiala, Edward R., and Greene, Daniel H., "Data compression with
+ finite windows", Communications of the ACM, Volume 32, Number 4,
+ April 1989, pages 490-505.
+
+ Held, Gilbert, "Data Compression, Techniques and Applications,
+ Hardware and Software Considerations", John Wiley & Sons, 1987.
+
+ Huffman, D.A., "A method for the construction of minimum-redundancy
+ codes", Proceedings of the IRE, Volume 40, Number 9, September 1952,
+ pages 1098-1101.
+
+ Nelson, Mark, "LZW Data Compression", Dr. Dobbs Journal, Volume 14,
+ Number 10, October 1989, pages 29-37.
+
+ Nelson, Mark, "The Data Compression Book", M&T Books, 1991.
+
+ Storer, James A., "Data Compression, Methods and Theory",
+ Computer Science Press, 1988
+
+ Welch, Terry, "A Technique for High-Performance Data Compression",
+ IEEE Computer, Volume 17, Number 6, June 1984, pages 8-19.
+
+ Ziv, J. and Lempel, A., "A universal algorithm for sequential data
+ compression", Communications of the ACM, Volume 30, Number 6,
+ June 1987, pages 520-540.
+
+ Ziv, J. and Lempel, A., "Compression of individual sequences via
+ variable-rate coding", IEEE Transactions on Information Theory,
+ Volume 24, Number 5, September 1978, pages 530-536.
+
+
+APPENDIX A - AS/400 Extra Field (0x0065) Attribute Definitions
+--------------------------------------------------------------
+
+Field Definition Structure:
+
+ a. field length including length 2 bytes
+ b. field code 2 bytes
+ c. data x bytes
+
+Field Code Description
+ 4001 Source type i.e. CLP etc
+ 4002 The text description of the library
+ 4003 The text description of the file
+ 4004 The text description of the member
+ 4005 x'F0' or 0 is PF-DTA, x'F1' or 1 is PF_SRC
+ 4007 Database Type Code 1 byte
+ 4008 Database file and fields definition
+ 4009 GZIP file type 2 bytes
+ 400B IFS code page 2 bytes
+ 400C IFS Creation Time 4 bytes
+ 400D IFS Access Time 4 bytes
+ 400E IFS Modification time 4 bytes
+ 005C Length of the records in the file 2 bytes
+ 0068 GZIP two words 8 bytes
+
+APPENDIX B - z/OS Extra Field (0x0065) Attribute Definitions
+------------------------------------------------------------
+
+Field Definition Structure:
+
+ a. field length including length 2 bytes
+ b. field code 2 bytes
+ c. data x bytes
+
+Field Code Description
+ 0001 File Type 2 bytes
+ 0002 NonVSAM Record Format 1 byte
+ 0003 Reserved
+ 0004 NonVSAM Block Size 2 bytes Big Endian
+ 0005 Primary Space Allocation 3 bytes Big Endian
+ 0006 Secondary Space Allocation 3 bytes Big Endian
+ 0007 Space Allocation Type1 byte flag
+ 0008 Modification Date Retired with PKZIP 5.0 +
+ 0009 Expiration Date Retired with PKZIP 5.0 +
+ 000A PDS Directory Block Allocation 3 bytes Big Endian binary value
+ 000B NonVSAM Volume List variable
+ 000C UNIT Reference Retired with PKZIP 5.0 +
+ 000D DF/SMS Management Class 8 bytes EBCDIC Text Value
+ 000E DF/SMS Storage Class 8 bytes EBCDIC Text Value
+ 000F DF/SMS Data Class 8 bytes EBCDIC Text Value
+ 0010 PDS/PDSE Member Info. 30 bytes
+ 0011 VSAM sub-filetype 2 bytes
+ 0012 VSAM LRECL 13 bytes EBCDIC "(num_avg num_max)"
+ 0013 VSAM Cluster Name Retired with PKZIP 5.0 +
+ 0014 VSAM KSDS Key Information 13 bytes EBCDIC "(num_length num_position)"
+ 0015 VSAM Average LRECL 5 bytes EBCDIC num_value padded with blanks
+ 0016 VSAM Maximum LRECL 5 bytes EBCDIC num_value padded with blanks
+ 0017 VSAM KSDS Key Length 5 bytes EBCDIC num_value padded with blanks
+ 0018 VSAM KSDS Key Position 5 bytes EBCDIC num_value padded with blanks
+ 0019 VSAM Data Name 1-44 bytes EBCDIC text string
+ 001A VSAM KSDS Index Name 1-44 bytes EBCDIC text string
+ 001B VSAM Catalog Name 1-44 bytes EBCDIC text string
+ 001C VSAM Data Space Type 9 bytes EBCDIC text string
+ 001D VSAM Data Space Primary 9 bytes EBCDIC num_value left-justified
+ 001E VSAM Data Space Secondary 9 bytes EBCDIC num_value left-justified
+ 001F VSAM Data Volume List variable EBCDIC text list of 6-character Volume IDs
+ 0020 VSAM Data Buffer Space 8 bytes EBCDIC num_value left-justified
+ 0021 VSAM Data CISIZE 5 bytes EBCDIC num_value left-justified
+ 0022 VSAM Erase Flag 1 byte flag
+ 0023 VSAM Free CI % 3 bytes EBCDIC num_value left-justified
+ 0024 VSAM Free CA % 3 bytes EBCDIC num_value left-justified
+ 0025 VSAM Index Volume List variable EBCDIC text list of 6-character Volume IDs
+ 0026 VSAM Ordered Flag 1 byte flag
+ 0027 VSAM REUSE Flag 1 byte flag
+ 0028 VSAM SPANNED Flag 1 byte flag
+ 0029 VSAM Recovery Flag 1 byte flag
+ 002A VSAM WRITECHK Flag 1 byte flag
+ 002B VSAM Cluster/Data SHROPTS 3 bytes EBCDIC "n,y"
+ 002C VSAM Index SHROPTS 3 bytes EBCDIC "n,y"
+ 002D VSAM Index Space Type 9 bytes EBCDIC text string
+ 002E VSAM Index Space Primary 9 bytes EBCDIC num_value left-justified
+ 002F VSAM Index Space Secondary 9 bytes EBCDIC num_value left-justified
+ 0030 VSAM Index CISIZE 5 bytes EBCDIC num_value left-justified
+ 0031 VSAM Index IMBED 1 byte flag
+ 0032 VSAM Index Ordered Flag 1 byte flag
+ 0033 VSAM REPLICATE Flag 1 byte flag
+ 0034 VSAM Index REUSE Flag 1 byte flag
+ 0035 VSAM Index WRITECHK Flag 1 byte flag Retired with PKZIP 5.0 +
+ 0036 VSAM Owner 8 bytes EBCDIC text string
+ 0037 VSAM Index Owner 8 bytes EBCDIC text string
+ 0038 Reserved
+ 0039 Reserved
+ 003A Reserved
+ 003B Reserved
+ 003C Reserved
+ 003D Reserved
+ 003E Reserved
+ 003F Reserved
+ 0040 Reserved
+ 0041 Reserved
+ 0042 Reserved
+ 0043 Reserved
+ 0044 Reserved
+ 0045 Reserved
+ 0046 Reserved
+ 0047 Reserved
+ 0048 Reserved
+ 0049 Reserved
+ 004A Reserved
+ 004B Reserved
+ 004C Reserved
+ 004D Reserved
+ 004E Reserved
+ 004F Reserved
+ 0050 Reserved
+ 0051 Reserved
+ 0052 Reserved
+ 0053 Reserved
+ 0054 Reserved
+ 0055 Reserved
+ 0056 Reserved
+ 0057 Reserved
+ 0058 PDS/PDSE Member TTR Info. 6 bytes Big Endian
+ 0059 PDS 1st LMOD Text TTR 3 bytes Big Endian
+ 005A PDS LMOD EP Rec # 4 bytes Big Endian
+ 005B Reserved
+ 005C Max Length of records 2 bytes Big Endian
+ 005D PDSE Flag 1 byte flag
+ 005E Reserved
+ 005F Reserved
+ 0060 Reserved
+ 0061 Reserved
+ 0062 Reserved
+ 0063 Reserved
+ 0064 Reserved
+ 0065 Last Date Referenced 4 bytes Packed Hex "yyyymmdd"
+ 0066 Date Created 4 bytes Packed Hex "yyyymmdd"
+ 0068 GZIP two words 8 bytes
+ 0071 Extended NOTE Location 12 bytes Big Endian
+ 0072 Archive device UNIT 6 bytes EBCDIC
+ 0073 Archive 1st Volume 6 bytes EBCDIC
+ 0074 Archive 1st VOL File Seq# 2 bytes Binary
+
+APPENDIX C - Zip64 Extensible Data Sector Mappings (EFS)
+--------------------------------------------------------
+
+ -Z390 Extra Field:
+
+ The following is the general layout of the attributes for the
+ ZIP 64 "extra" block for extended tape operations. Portions of
+ this extended tape processing technology is covered under a
+ pending patent application. The use or implementation in a
+ product of certain technological aspects set forth in the
+ current APPNOTE, including those with regard to strong encryption,
+ patching or extended tape operations, requires a license from
+ PKWARE. Please contact PKWARE with regard to acquiring a license.
+
+
+ Note: some fields stored in Big Endian format. All text is
+ in EBCDIC format unless otherwise specified.
+
+ Value Size Description
+ ----- ---- -----------
+ (Z390) 0x0065 2 bytes Tag for this "extra" block type
+ Size 4 bytes Size for the following data block
+ Tag 4 bytes EBCDIC "Z390"
+ Length71 2 bytes Big Endian
+ Subcode71 2 bytes Enote type code
+ FMEPos 1 byte
+ Length72 2 bytes Big Endian
+ Subcode72 2 bytes Unit type code
+ Unit 1 byte Unit
+ Length73 2 bytes Big Endian
+ Subcode73 2 bytes Volume1 type code
+ FirstVol 1 byte Volume
+ Length74 2 bytes Big Endian
+ Subcode74 2 bytes FirstVol file sequence
+ FileSeq 2 bytes Sequence
+
+APPENDIX D - Language Encoding (EFS)
+------------------------------------
+
+The ZIP format has historically supported only the original IBM PC character
+encoding set, commonly referred to as IBM Code Page 437. This limits storing
+file name characters to only those within the original MS-DOS range of values
+and does not properly support file names in other character encodings, or
+languages. To address this limitation, this specification will support the
+following change.
+
+If general purpose bit 11 is unset, the file name and comment should conform
+to the original ZIP character encoding. If general purpose bit 11 is set, the
+filename and comment must support The Unicode Standard, Version 4.1.0 or
+greater using the character encoding form defined by the UTF-8 storage
+specification. The Unicode Standard is published by the The Unicode
+Consortium (www.unicode.org). UTF-8 encoded data stored within ZIP files
+is expected to not include a byte order mark (BOM).
+
+Applications may choose to supplement this file name storage through the use
+of the 0x0008 Extra Field. Storage for this optional field is currently
+undefined, however it will be used to allow storing extended information
+on source or target encoding that may further assist applications with file
+name, or file content encoding tasks. Please contact PKWARE with any
+requirements on how this field should be used.
+
+The 0x0008 Extra Field storage may be used with either setting for general
+purpose bit 11. Examples of the intended usage for this field is to store
+whether "modified-UTF-8" (JAVA) is used, or UTF-8-MAC. Similarly, other
+commonly used character encoding (code page) designations can be indicated
+through this field. Formalized values for use of the 0x0008 record remain
+undefined at this time. The definition for the layout of the 0x0008 field
+will be published when available. Use of the 0x0008 Extra Field provides
+for storing data within a ZIP file in an encoding other than IBM Code
+Page 437 or UTF-8.
+
+General purpose bit 11 will not imply any encoding of file content or
+password. Values defining character encoding for file content or
+password must be stored within the 0x0008 Extended Language Encoding
+Extra Field.
+
+Ed Gordon of the Info-ZIP group has defined a pair of "extra field" records
+that can be used to store UTF-8 file name and file comment fields. These
+records can be used for cases when the general purpose bit 11 method
+for storing UTF-8 data in the standard file name and comment fields is
+not desirable. A common case for this alternate method is if backward
+compatibility with older programs is required.
+
+Definitions for the record structure of these fields are included above
+in the section on 3rd party mappings for "extra field" records. These
+records are identified by Header ID's 0x6375 (Info-ZIP Unicode Comment
+Extra Field) and 0x7075 (Info-ZIP Unicode Path Extra Field).
+
+The choice of which storage method to use when writing a ZIP file is left
+to the implementation. Developers should expect that a ZIP file may
+contain either method and should provide support for reading data in
+either format. Use of general purpose bit 11 reduces storage requirements
+for file name data by not requiring additional "extra field" data for
+each file, but can result in older ZIP programs not being able to extract
+files. Use of the 0x6375 and 0x7075 records will result in a ZIP file
+that should always be readable by older ZIP programs, but requires more
+storage per file to write file name and/or file comment fields.
+
+
+
+
diff --git a/dotNetZip/BZip2 CF/AssemblyInfo.cs b/dotNetZip/BZip2 CF/AssemblyInfo.cs
new file mode 100644
index 0000000..060aa40
Binary files /dev/null and b/dotNetZip/BZip2 CF/AssemblyInfo.cs differ
diff --git a/dotNetZip/BZip2 CF/BZip2 CF DLL.csproj b/dotNetZip/BZip2 CF/BZip2 CF DLL.csproj
new file mode 100644
index 0000000..83754ab
--- /dev/null
+++ b/dotNetZip/BZip2 CF/BZip2 CF DLL.csproj
@@ -0,0 +1,132 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {18a4aed9-d477-4c57-9c7a-c0cbbd5599de}
+ Library
+ Properties
+ Ionic.BZip2
+ Ionic.BZip2.CF
+ Smartphone
+ f27da329-3269-4191-98e0-c87d3d7f1db9
+ 5.2
+ Ionic.BZip2.CF
+ v2.0
+ Windows Mobile 6 Standard SDK
+ true
+ ..\Ionic.snk
+
+
+ SAK
+ SAK
+ SAK
+ SAK
+
+
+ 4.0
+
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ bin\Debug\
+ TRACE;DEBUG;Smartphone; NETCF; NETCF20;BZIP
+ true
+ true
+ prompt
+ 512
+ 4
+ Off
+ bin\Debug\Ionic.BZip2.CF.XML
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE;Smartphone; NETCF; NETCF20;BZIP
+ true
+ true
+ prompt
+ 512
+ 4
+ Off
+ AllRules.ruleset
+
+
+
+
+
+
+
+ CRC32.cs
+
+
+
+
+ SolutionInfo.cs
+
+
+
+
+ Ionic.snk
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/BZip2 SL DLL/BZip2 SL DLL.csproj b/dotNetZip/BZip2 SL DLL/BZip2 SL DLL.csproj
new file mode 100644
index 0000000..3901935
--- /dev/null
+++ b/dotNetZip/BZip2 SL DLL/BZip2 SL DLL.csproj
@@ -0,0 +1,134 @@
+
+
+
+ v3.5
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {50e11f2c-9d49-45f5-a52d-560be456cc04}
+ {A1591282-1198-4647-A2B1-27E5FF5F6F3B};{fae04ec0-301f-11d3-bf4b-00c04f79efbc}
+ Library
+ Properties
+ Ionic.BZip2
+ Ionic.BZip2
+ v3.0
+ false
+ true
+ true
+ SAK
+ SAK
+ SAK
+ SAK
+ true
+ ..\Ionic.snk
+ Silverlight
+ $(TargetFrameworkVersion)
+
+
+ 4.0
+
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ Bin\Debug
+ DEBUG;TRACE;SILVERLIGHT
+ true
+ true
+ prompt
+ 4
+ Bin\Debug\Ionic.BZip2.XML
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ Bin\Release
+ TRACE;SILVERLIGHT
+ true
+ true
+ prompt
+ 4
+ AllRules.ruleset
+
+
+
+
+
+
+
+
+
+
+
+
+
+ CRC32.cs
+
+
+
+ Properties\SolutionInfo.cs
+
+
+
+
+ Ionic.snk
+
+
+
+
+ NOTICE.txt
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/BZip2 SL DLL/Properties/AssemblyInfo.cs b/dotNetZip/BZip2 SL DLL/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..00a3c3f
--- /dev/null
+++ b/dotNetZip/BZip2 SL DLL/Properties/AssemblyInfo.cs
@@ -0,0 +1,21 @@
+using System.Reflection;
+using System.Security;
+using System.Runtime.CompilerServices;
+
+// General Information about an assembly is controlled through the following
+// set of attributes. Change these attribute values to modify the information
+// associated with an assembly.
+
+[assembly: AssemblyTitle("Ionic's Managed BZip2 for Silverlight")]
+
+#if DEBUG
+[assembly: AssemblyConfiguration("Debug")]
+[assembly: AssemblyDescription("library for BZip2 compression. http://DotNetZip.codeplex.com/ (Flavor=Debug)")]
+#else
+[assembly: AssemblyConfiguration("Retail")]
+[assembly: AssemblyDescription("library for BZip2 compression. http://DotNetZip.codeplex.com/ (Flavor=Retail)")]
+#endif
+
+
+[assembly: System.CLSCompliant(true)]
+
diff --git a/dotNetZip/BZip2 Tests/BZip2UnitTest1.cs b/dotNetZip/BZip2 Tests/BZip2UnitTest1.cs
new file mode 100644
index 0000000..23d99bc
--- /dev/null
+++ b/dotNetZip/BZip2 Tests/BZip2UnitTest1.cs
@@ -0,0 +1,680 @@
+using System;
+using System.Linq;
+using System.Text;
+using System.Collections.Generic;
+using Ionic.BZip2;
+
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+using System.IO;
+
+namespace Ionic.BZip2.Tests
+{
+ ///
+ /// Summary description for UnitTest1
+ ///
+ [TestClass]
+ public class UnitTest1
+ {
+ private System.Random rnd;
+
+ public UnitTest1()
+ {
+ this.rnd = new System.Random();
+ FilesToRemove = new System.Collections.Generic.List();
+ }
+
+ static UnitTest1()
+ {
+ string lorem = TestStrings["LoremIpsum"];
+ LoremIpsumWords = lorem.Split(" ".ToCharArray(),
+ System.StringSplitOptions.RemoveEmptyEntries);
+ }
+
+
+ private TestContext testContextInstance;
+
+ ///
+ ///Gets or sets the test context which provides
+ ///information about and functionality for the current test run.
+ ///
+ public TestContext TestContext
+ {
+ get
+ {
+ return testContextInstance;
+ }
+ set
+ {
+ testContextInstance = value;
+ }
+ }
+
+ #region Additional test attributes
+ //
+ // You can use the following additional attributes as you write your tests:
+ //
+ // Use ClassInitialize to run code before running the first test in the class
+ // [ClassInitialize()]
+ // public static void MyClassInitialize(TestContext testContext) { }
+ //
+ // Use ClassCleanup to run code after all tests in a class have run
+ // [ClassCleanup()]
+ // public static void MyClassCleanup() { }
+ //
+ // Use TestInitialize to run code before running each test
+ // [TestInitialize()]
+ // public void MyTestInitialize() { }
+ //
+ // Use TestCleanup to run code after each test has run
+ // [TestCleanup()]
+ // public void MyTestCleanup() { }
+ //
+
+ private string CurrentDir = null;
+ private string TopLevelDir = null;
+ protected System.Collections.Generic.List FilesToRemove;
+
+ // Use TestInitialize to run code before running each test
+ [TestInitialize()]
+ public void MyTestInitialize()
+ {
+ CurrentDir = System.IO.Directory.GetCurrentDirectory();
+ Assert.AreNotEqual(System.IO.Path.GetFileName(CurrentDir), "Temp", "at start");
+
+ string parentDir = System.Environment.GetEnvironmentVariable("TEMP");
+
+ TopLevelDir = System.IO.Path.Combine(parentDir, String.Format("Ionic.ZlibTest-{0}.tmp", System.DateTime.Now.ToString("yyyyMMMdd-HHmmss")));
+ System.IO.Directory.CreateDirectory(TopLevelDir);
+ System.IO.Directory.SetCurrentDirectory(TopLevelDir);
+
+ FilesToRemove.Add(TopLevelDir);
+ }
+
+
+ // Use TestCleanup to run code after each test has run
+ [TestCleanup()]
+ public void MyTestCleanup()
+ {
+ Assert.AreNotEqual(Path.GetFileName(CurrentDir), "Temp", "at finish");
+ Directory.SetCurrentDirectory(CurrentDir);
+ IOException GotException = null;
+ int Tries = 0;
+ do
+ {
+ try
+ {
+ GotException = null;
+ foreach (string filename in FilesToRemove)
+ {
+ if (Directory.Exists(filename))
+ {
+ // turn off any ReadOnly attributes
+ ClearReadOnly(filename);
+ Directory.Delete(filename, true);
+ }
+ if (File.Exists(filename))
+ {
+ File.Delete(filename);
+ }
+ }
+ Tries++;
+ }
+ catch (IOException ioexc)
+ {
+ GotException = ioexc;
+ // use an backoff interval before retry
+ System.Threading.Thread.Sleep(200 * Tries);
+ }
+ } while ((GotException != null) && (Tries < 4));
+ if (GotException != null) throw GotException;
+ FilesToRemove.Clear();
+ }
+
+
+ public static void ClearReadOnly(string dirname)
+ {
+ // don't traverse reparse points
+ if ((File.GetAttributes(dirname) & FileAttributes.ReparsePoint) != 0)
+ return;
+
+ foreach (var d in Directory.GetDirectories(dirname))
+ {
+ ClearReadOnly(d); // recurse
+ }
+
+ foreach (var f in Directory.GetFiles(dirname))
+ {
+ // clear ReadOnly and System attributes
+ var a = File.GetAttributes(f);
+ if ((a & FileAttributes.ReadOnly) == FileAttributes.ReadOnly)
+ {
+ a ^= FileAttributes.ReadOnly;
+ File.SetAttributes(f, a);
+ }
+ if ((a & FileAttributes.System) == FileAttributes.System)
+ {
+ a ^= FileAttributes.System;
+ File.SetAttributes(f, a);
+ }
+ }
+ }
+
+
+ #endregion
+
+ #region Helpers
+ private static void CopyStream(System.IO.Stream src, System.IO.Stream dest)
+ {
+ byte[] buffer = new byte[4096];
+ int n;
+ while ((n = src.Read(buffer, 0, buffer.Length)) > 0)
+ {
+ dest.Write(buffer, 0, n);
+ }
+ }
+
+ private static string GetTestDependentDir(string startingPoint, string subdir)
+ {
+ var location = startingPoint;
+ for (int i = 0; i < 3; i++)
+ location = Path.GetDirectoryName(location);
+
+ location = Path.Combine(location, subdir);
+ return location;
+ }
+
+ private static string GetTestBinDir(string startingPoint)
+ {
+ return GetTestDependentDir(startingPoint, "BZip2 Tests\\bin\\Debug");
+ }
+
+ private string GetContentFile(string fileName)
+ {
+ string testBin = GetTestBinDir(CurrentDir);
+ string path = Path.Combine(testBin, String.Format("Resources\\{0}", fileName));
+ Assert.IsTrue(File.Exists(path), "file ({0}) does not exist", path);
+ return path;
+ }
+
+ private static Int32 GetCrc(string fname)
+ {
+ using (var fs1 = File.OpenRead(fname))
+ {
+ var checker = new Ionic.Crc.CRC32(true);
+ return checker.GetCrc32(fs1);
+ }
+ }
+
+ internal string Exec(string program, string args)
+ {
+ return Exec(program, args, true);
+ }
+
+ internal string Exec(string program, string args, bool waitForExit)
+ {
+ return Exec(program, args, waitForExit, true);
+ }
+
+ internal string Exec(string program, string args, bool waitForExit, bool emitOutput)
+ {
+ if (program == null)
+ throw new ArgumentException("program");
+
+ if (args == null)
+ throw new ArgumentException("args");
+
+ // Microsoft.VisualStudio.TestTools.UnitTesting
+ this.TestContext.WriteLine("running command: {0} {1}", program, args);
+
+ string output;
+ int rc = Exec_NoContext(program, args, waitForExit, out output);
+
+ if (rc != 0)
+ throw new Exception(String.Format("Non-zero RC {0}: {1}", program, output));
+
+ if (emitOutput)
+ this.TestContext.WriteLine("output: {0}", output);
+ else
+ this.TestContext.WriteLine("A-OK. (output suppressed)");
+
+ return output;
+ }
+
+ internal static int Exec_NoContext(string program, string args, bool waitForExit, out string output)
+ {
+ System.Diagnostics.Process p = new System.Diagnostics.Process
+ {
+ StartInfo =
+ {
+ FileName = program,
+ CreateNoWindow = true,
+ Arguments = args,
+ WindowStyle = System.Diagnostics.ProcessWindowStyle.Hidden,
+ UseShellExecute = false,
+ }
+
+ };
+
+ if (waitForExit)
+ {
+ StringBuilder sb = new StringBuilder();
+ p.StartInfo.RedirectStandardOutput = true;
+ p.StartInfo.RedirectStandardError = true;
+ // must read at least one of the stderr or stdout asynchronously,
+ // to avoid deadlock
+ Action stdErrorRead = (o, e) =>
+ {
+ if (!String.IsNullOrEmpty(e.Data))
+ sb.Append(e.Data);
+ };
+
+ p.ErrorDataReceived += new System.Diagnostics.DataReceivedEventHandler(stdErrorRead);
+ p.Start();
+ p.BeginErrorReadLine();
+ output = p.StandardOutput.ReadToEnd();
+ p.WaitForExit();
+ if (sb.Length > 0)
+ output += sb.ToString();
+ //output = CleanWzzipOut(output); // just in case
+ return p.ExitCode;
+ }
+ else
+ {
+ p.Start();
+ }
+ output = "";
+ return 0;
+ }
+
+
+ void CreateAndFillTextFile(string filename, Int64 minimumSize)
+ {
+ // fill the file with text data, selecting one word at a time
+ int L = LoremIpsumWords.Length - 2;
+ Int64 bytesRemaining = minimumSize;
+ using (StreamWriter sw = File.CreateText(filename))
+ {
+ do
+ {
+ // pick a word at random
+ int n = this.rnd.Next(L);
+ int batchLength = LoremIpsumWords[n].Length +
+ LoremIpsumWords[n+1].Length +
+ LoremIpsumWords[n+2].Length + 3;
+ sw.Write(LoremIpsumWords[n]);
+ sw.Write(" ");
+ sw.Write(LoremIpsumWords[n+1]);
+ sw.Write(" ");
+ sw.Write(LoremIpsumWords[n+2]);
+ sw.Write(" ");
+ bytesRemaining -= batchLength;
+ } while (bytesRemaining > 0);
+ }
+ }
+
+ #endregion
+
+
+ [TestMethod]
+ [Timeout(15 * 60*1000)] // 60*1000 = 1min
+ public void BZ_LargeParallel()
+ {
+ string filename = "LargeFile.txt";
+ int minSize = 0x6000000 + this.rnd.Next(0x6000000);
+ TestContext.WriteLine("Creating large file, minimum {0} bytes", minSize);
+
+ CreateAndFillTextFile(filename, minSize);
+
+ Func[] getBzStream = {
+ new Func( s0 => {
+ return new Ionic.BZip2.BZip2OutputStream(s0);
+ }),
+ new Func( s1 => {
+ return new Ionic.BZip2.ParallelBZip2OutputStream(s1);
+ })
+ };
+
+ var ts = new TimeSpan[2];
+ for (int k=0; k < 2; k++)
+ {
+ var stopwatch = new System.Diagnostics.Stopwatch();
+ TestContext.WriteLine("Trial {0}", k);
+ stopwatch.Start();
+ string bzFname = Path.GetFileNameWithoutExtension(filename) +
+ "." + k + Path.GetExtension(filename) + ".bz2";
+ using (Stream input = File.OpenRead(filename),
+ output = File.Create(bzFname),
+ compressor = getBzStream[k](output))
+ {
+ CopyStream(input, compressor);
+ }
+ stopwatch.Stop();
+ ts[k] = stopwatch.Elapsed;
+ TestContext.WriteLine("Trial complete {0} : {1}", k, ts[k]);
+ }
+
+ Assert.IsTrue(ts[1][] getBzStream = {
+ new Func( s0 => {
+ var decorator = new Ionic.BZip2.BZip2OutputStream(s0, blockSize);
+ return decorator;
+ }),
+ new Func( s1 => {
+ var decorator = new Ionic.BZip2.ParallelBZip2OutputStream(s1, blockSize);
+ return decorator;
+ })
+ };
+
+ int[] blockSizes = { 1,2,3,4,5,6,7,8,9 };
+
+ for (int k=0; k < getBzStream.Length; k++)
+ {
+ for (int m=0; m < blockSizes.Length; m++)
+ {
+ blockSize = blockSizes[m];
+ var getStream = getBzStream[k];
+ var root = Path.GetFileNameWithoutExtension(fname);
+ var ext = Path.GetExtension(fname);
+ // compress into bz2
+ var bzFname = String.Format("{0}.{1}.blocksize{2}{3}.bz2",
+ root,
+ (k==0)?"SingleThread":"MultiThread",
+ blockSize, ext);
+
+ TestContext.WriteLine("Compress cycle ({0},{1})", k,m);
+ TestContext.WriteLine("file {0}", bzFname);
+ using (var fs = File.OpenRead(fname))
+ {
+ using (var output = File.Create(bzFname))
+ {
+ using (var compressor = getStream(output))
+ {
+ CopyStream(fs, compressor);
+ }
+ }
+ }
+
+ TestContext.WriteLine("Decompress");
+ var decompressedFname = Path.GetFileNameWithoutExtension(bzFname);
+ using (Stream fs = File.OpenRead(bzFname),
+ output = File.Create(decompressedFname),
+ decompressor = new Ionic.BZip2.BZip2InputStream(fs))
+ {
+ CopyStream(decompressor, output);
+ }
+
+ TestContext.WriteLine("Check CRC");
+ int crcDecompressed = GetCrc(decompressedFname);
+ Assert.AreEqual(crcOriginal, crcDecompressed,
+ "CRC mismatch {0:X8} != {1:X8}",
+ crcOriginal, crcDecompressed);
+ TestContext.WriteLine("");
+
+ // just for the sake of disk space economy:
+ File.Delete(decompressedFname);
+ File.Delete(bzFname);
+ }
+ }
+ }
+
+
+ [TestMethod]
+ [ExpectedException(typeof(IOException))]
+ public void BZ_Error_1()
+ {
+ var bzbin = GetTestDependentDir(CurrentDir, "Tools\\BZip2\\bin\\Debug");
+ var dnzBzip2exe = Path.Combine(bzbin, "bzip2.exe");
+ string decompressedFname = "ThisWillNotWork.txt";
+ using (Stream input = File.OpenRead(dnzBzip2exe),
+ decompressor = new Ionic.BZip2.BZip2InputStream(input),
+ output = File.Create(decompressedFname))
+ CopyStream(decompressor, output);
+ }
+
+ [TestMethod]
+ [ExpectedException(typeof(IOException))]
+ public void BZ_Error_2()
+ {
+ string decompressedFname = "ThisWillNotWork.txt";
+ using (Stream input = new MemoryStream(), // empty stream
+ decompressor = new Ionic.BZip2.BZip2InputStream(input),
+ output = File.Create(decompressedFname))
+ CopyStream(decompressor, output);
+ }
+
+
+ [TestMethod]
+ public void BZ_Utility()
+ {
+ var bzbin = GetTestDependentDir(CurrentDir, "Tools\\BZip2\\bin\\Debug");
+ var dnzBzip2exe = Path.Combine(bzbin, "bzip2.exe");
+ Assert.IsTrue(File.Exists(dnzBzip2exe), "Bzip2.exe is missing {0}",
+ dnzBzip2exe);
+ var unxBzip2exe = "\\bin\\bzip2.exe";
+ Assert.IsTrue(File.Exists(unxBzip2exe), "Bzip2.exe is missing {0}",
+ unxBzip2exe);
+
+ foreach (var key in TestStrings.Keys)
+ {
+ int count = this.rnd.Next(18) + 4;
+ TestContext.WriteLine("Doing string {0}", key);
+ var s = TestStrings[key];
+ var fname = String.Format("Pippo-{0}.txt", key);
+ using (var sw = new StreamWriter(File.Create(fname)))
+ {
+ for (int k=0; k < count; k++)
+ {
+ sw.WriteLine(s);
+ }
+ }
+
+ int crcOriginal = GetCrc(fname);
+
+ string args = fname + " -keep -v";
+ TestContext.WriteLine("Exec: bzip2 {0}", args);
+ string bzout = this.Exec(dnzBzip2exe, args);
+
+ var bzfile = fname + ".bz2";
+ Assert.IsTrue(File.Exists(bzfile), "File is missing. {0}",
+ bzfile);
+
+ File.Delete(fname);
+ Assert.IsTrue(!File.Exists(fname), "The delete failed. {0}",
+ fname);
+
+ System.Threading.Thread.Sleep(1200);
+
+ args = "-dfk "+ bzfile;
+ TestContext.WriteLine("Exec: bzip2 {0}", args);
+ bzout = this.Exec(unxBzip2exe, args);
+ Assert.IsTrue(File.Exists(fname), "File is missing. {0}",
+ fname);
+
+ int crcDecompressed = GetCrc(fname);
+ Assert.AreEqual(crcOriginal, crcDecompressed,
+ "CRC mismatch {0:X8}!={1:X8}",
+ crcOriginal, crcDecompressed);
+ }
+ }
+
+
+ [TestMethod]
+ public void BZ_Samples()
+ {
+ string testBin = GetTestBinDir(CurrentDir);
+ string resourceDir = Path.Combine(testBin, "Resources");
+ var filesToDecompress = Directory.GetFiles(resourceDir, "*.bz2");
+
+ Assert.IsTrue(filesToDecompress.Length > 2,
+ "There are not enough sample files");
+
+ foreach (var filename in filesToDecompress)
+ {
+ TestContext.WriteLine("Decompressing {0}", filename);
+ var outFname = filename + ".decompressed";
+ TestContext.WriteLine("Decompressing to {0}", outFname);
+
+ using (var fs = File.OpenRead(filename))
+ {
+ using (var output = File.Create(outFname))
+ {
+ using (var decompressor = new Ionic.BZip2.BZip2InputStream(fs))
+ {
+ CopyStream(decompressor, output);
+ }
+ }
+ }
+ TestContext.WriteLine("");
+ }
+ }
+
+
+
+
+ internal static Dictionary TestStrings = new Dictionary() {
+ {"LetMeDoItNow", "I expect to pass through the world but once. Any good therefore that I can do, or any kindness I can show to any creature, let me do it now. Let me not defer it, for I shall not pass this way again. -- Anonymous, although some have attributed it to Stephen Grellet" },
+
+ {"UntilHeExtends", "Until he extends the circle of his compassion to all living things, man will not himself find peace. - Albert Schweitzer, early 20th-century German Nobel Peace Prize-winning mission doctor and theologian." },
+
+ {"WhatWouldThingsHaveBeenLike","'What would things have been like [in Russia] if during periods of mass arrests people had not simply sat there, paling with terror at every bang on the downstairs door and at every step on the staircase, but understood they had nothing to lose and had boldly set up in the downstairs hall an ambush of half a dozen people?' -- Alexander Solzhenitsyn"
+ },
+
+ {"GoPlacidly",
+ @"Go placidly amid the noise and haste, and remember what peace there may be in silence.
+
+As far as possible, without surrender, be on good terms with all persons. Speak your truth quietly and clearly; and listen to others, even to the dull and the ignorant, they too have their story. Avoid loud and aggressive persons, they are vexations to the spirit.
+
+If you compare yourself with others, you may become vain and bitter; for always there will be greater and lesser persons than yourself. Enjoy your achievements as well as your plans. Keep interested in your own career, however humble; it is a real possession in the changing fortunes of time.
+
+Exercise caution in your business affairs, for the world is full of trickery. But let this not blind you to what virtue there is; many persons strive for high ideals, and everywhere life is full of heroism. Be yourself. Especially, do not feign affection. Neither be cynical about love, for in the face of all aridity and disenchantment it is perennial as the grass.
+
+Take kindly to the counsel of the years, gracefully surrendering the things of youth. Nurture strength of spirit to shield you in sudden misfortune. But do not distress yourself with imaginings. Many fears are born of fatigue and loneliness.
+
+Beyond a wholesome discipline, be gentle with yourself. You are a child of the universe, no less than the trees and the stars; you have a right to be here. And whether or not it is clear to you, no doubt the universe is unfolding as it should.
+
+Therefore be at peace with God, whatever you conceive Him to be, and whatever your labors and aspirations, in the noisy confusion of life, keep peace in your soul.
+
+With all its sham, drudgery and broken dreams, it is still a beautiful world.
+
+Be cheerful. Strive to be happy.
+
+Max Ehrmann c.1920
+"},
+
+ {"IhaveaDream", @"Let us not wallow in the valley of despair, I say to you today, my friends.
+
+And so even though we face the difficulties of today and tomorrow, I still have a dream. It is a dream deeply rooted in the American dream.
+
+I have a dream that one day this nation will rise up and live out the true meaning of its creed: 'We hold these truths to be self-evident, that all men are created equal.'
+
+I have a dream that one day on the red hills of Georgia, the sons of former slaves and the sons of former slave owners will be able to sit down together at the table of brotherhood.
+
+I have a dream that one day even the state of Mississippi, a state sweltering with the heat of injustice, sweltering with the heat of oppression, will be transformed into an oasis of freedom and justice.
+
+I have a dream that my four little children will one day live in a nation where they will not be judged by the color of their skin but by the content of their character.
+
+I have a dream today!
+
+I have a dream that one day, down in Alabama, with its vicious racists, with its governor having his lips dripping with the words of 'interposition' and 'nullification' -- one day right there in Alabama little black boys and black girls will be able to join hands with little white boys and white girls as sisters and brothers.
+
+I have a dream today!
+
+I have a dream that one day every valley shall be exalted, and every hill and mountain shall be made low, the rough places will be made plain, and the crooked places will be made straight; 'and the glory of the Lord shall be revealed and all flesh shall see it together.'2
+"},
+
+ { "LoremIpsum",
+"Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Integer " +
+"vulputate, nibh non rhoncus euismod, erat odio pellentesque lacus, sit " +
+"amet convallis mi augue et odio. Phasellus cursus urna facilisis " +
+"quam. Suspendisse nec metus et sapien scelerisque euismod. Nullam " +
+"molestie sem quis nisl. Fusce pellentesque, ante sed semper egestas, sem " +
+"nulla vestibulum nulla, quis sollicitudin leo lorem elementum " +
+"wisi. Aliquam vestibulum nonummy orci. Sed in dolor sed enim ullamcorper " +
+"accumsan. Duis vel nibh. Class aptent taciti sociosqu ad litora torquent " +
+"per conubia nostra, per inceptos hymenaeos. Sed faucibus, enim sit amet " +
+"venenatis laoreet, nisl elit posuere est, ut sollicitudin tortor velit " +
+"ut ipsum. Aliquam erat volutpat. Phasellus tincidunt vehicula " +
+"eros. Curabitur vitae erat. " +
+"\n " +
+"Quisque pharetra lacus quis sapien. Duis id est non wisi sagittis " +
+"adipiscing. Nulla facilisi. Etiam quam erat, lobortis eu, facilisis nec, " +
+"blandit hendrerit, metus. Fusce hendrerit. Nunc magna libero, " +
+"sollicitudin non, vulputate non, ornare id, nulla. Suspendisse " +
+"potenti. Nullam in mauris. Curabitur et nisl vel purus vehicula " +
+"sodales. Class aptent taciti sociosqu ad litora torquent per conubia " +
+"nostra, per inceptos hymenaeos. Cum sociis natoque penatibus et magnis " +
+"dis parturient montes, nascetur ridiculus mus. Donec semper, arcu nec " +
+"dignissim porta, eros odio tempus pede, et laoreet nibh arcu et " +
+"nisl. Morbi pellentesque eleifend ante. Morbi dictum lorem non " +
+"ante. Nullam et augue sit amet sapien varius mollis. " +
+"\n " +
+"Nulla erat lorem, fringilla eget, ultrices nec, dictum sed, " +
+"sapien. Aliquam libero ligula, porttitor scelerisque, lobortis nec, " +
+"dignissim eu, elit. Etiam feugiat, dui vitae laoreet faucibus, tellus " +
+"urna molestie purus, sit amet pretium lorem pede in erat. Ut non libero " +
+"et sapien porttitor eleifend. Vestibulum ante ipsum primis in faucibus " +
+"orci luctus et ultrices posuere cubilia Curae; In at lorem et lacus " +
+"feugiat iaculis. Nunc tempus eros nec arcu tristique egestas. Quisque " +
+"metus arcu, pretium in, suscipit dictum, bibendum sit amet, " +
+"mauris. Aliquam non urna. Suspendisse eget diam. Aliquam erat " +
+"volutpat. In euismod aliquam lorem. Mauris dolor nisl, consectetuer sit " +
+"amet, suscipit sodales, rutrum in, lorem. Nunc nec nisl. Nulla ante " +
+"libero, aliquam porttitor, aliquet at, imperdiet sed, diam. Pellentesque " +
+"tincidunt nisl et ipsum. Suspendisse purus urna, semper quis, laoreet " +
+"in, vestibulum vel, arcu. Nunc elementum eros nec mauris. " +
+"\n " +
+"Vivamus congue pede at quam. Aliquam aliquam leo vel turpis. Ut " +
+"commodo. Integer tincidunt sem a risus. Cras aliquam libero quis " +
+"arcu. Integer posuere. Nulla malesuada, wisi ac elementum sollicitudin, " +
+"libero libero molestie velit, eu faucibus est ante eu libero. Sed " +
+"vestibulum, dolor ac ultricies consectetuer, tellus risus interdum diam, " +
+"a imperdiet nibh eros eget mauris. Donec faucibus volutpat " +
+"augue. Phasellus vitae arcu quis ipsum ultrices fermentum. Vivamus " +
+"ultricies porta ligula. Nullam malesuada. Ut feugiat urna non " +
+"turpis. Vivamus ipsum. Vivamus eleifend condimentum risus. Curabitur " +
+"pede. Maecenas suscipit pretium tortor. Integer pellentesque. " +
+"\n " +
+"Mauris est. Aenean accumsan purus vitae ligula. Lorem ipsum dolor sit " +
+"amet, consectetuer adipiscing elit. Nullam at mauris id turpis placerat " +
+"accumsan. Sed pharetra metus ut ante. Aenean vel urna sit amet ante " +
+"pretium dapibus. Sed nulla. Sed nonummy, lacus a suscipit semper, erat " +
+"wisi convallis mi, et accumsan magna elit laoreet sem. Nam leo est, " +
+"cursus ut, molestie ac, laoreet id, mauris. Suspendisse auctor nibh. " +
+ "\n"}
+ };
+
+ static string[] LoremIpsumWords;
+
+ private const int WORKING_BUFFER_SIZE = 0x4000;
+
+ }
+
+
+
+}
diff --git a/dotNetZip/BZip2 Tests/Bzip2 Tests.csproj b/dotNetZip/BZip2 Tests/Bzip2 Tests.csproj
new file mode 100644
index 0000000..17f53bf
--- /dev/null
+++ b/dotNetZip/BZip2 Tests/Bzip2 Tests.csproj
@@ -0,0 +1,121 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}
+ Library
+ Properties
+ BZip2Test
+ BZip2Test
+ v4.0
+ 512
+ {3AC096D0-A1C2-E12C-1390-A8335801FDAB};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}
+ SAK
+ SAK
+ SAK
+ SAK
+
+
+ 3.5
+
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+
+
+
+
+
+
+
+ Properties\SolutionInfo.cs
+
+
+
+
+ Always
+
+
+ Always
+
+
+ Always
+
+
+
+
+ {e2ce0d56-7af8-4404-bd0c-bc562cbd74d4}
+ BZip2 DLL
+
+
+ {c2241050-f23c-420b-aa67-60e94b34c2b2}
+ BZip2
+
+
+
+
+ False
+ Microsoft .NET Framework 4 %28x86 and x64%29
+ true
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ false
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/BZip2 Tests/Properties/AssemblyInfo.cs b/dotNetZip/BZip2 Tests/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..bbc2cba
Binary files /dev/null and b/dotNetZip/BZip2 Tests/Properties/AssemblyInfo.cs differ
diff --git a/dotNetZip/BZip2 Tests/Resources/dancing-color.ps.bz2 b/dotNetZip/BZip2 Tests/Resources/dancing-color.ps.bz2
new file mode 100644
index 0000000..15c6061
Binary files /dev/null and b/dotNetZip/BZip2 Tests/Resources/dancing-color.ps.bz2 differ
diff --git a/dotNetZip/BZip2 Tests/Resources/sample1.bz2 b/dotNetZip/BZip2 Tests/Resources/sample1.bz2
new file mode 100644
index 0000000..18dea60
Binary files /dev/null and b/dotNetZip/BZip2 Tests/Resources/sample1.bz2 differ
diff --git a/dotNetZip/BZip2 Tests/Resources/sample2.bz2 b/dotNetZip/BZip2 Tests/Resources/sample2.bz2
new file mode 100644
index 0000000..d5a6160
Binary files /dev/null and b/dotNetZip/BZip2 Tests/Resources/sample2.bz2 differ
diff --git a/dotNetZip/BZip2/BZip2 DLL.csproj b/dotNetZip/BZip2/BZip2 DLL.csproj
new file mode 100644
index 0000000..79372c8
--- /dev/null
+++ b/dotNetZip/BZip2/BZip2 DLL.csproj
@@ -0,0 +1,161 @@
+
+
+
+ Local
+ 2.0
+ Debug
+ AnyCPU
+
+
+
+
+ Ionic.BZip2
+ ..\Ionic.snk
+ JScript
+ Grid
+ IE50
+ false
+ Library
+ Ionic.BZip2
+ false
+ OnBuildSuccess
+
+
+
+
+ 3.5
+
+
+ {e2ce0d56-7af8-4404-bd0c-bc562cbd74d4}
+ false
+ true
+ SAK
+ SAK
+ SAK
+ SAK
+ v2.0
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ true
+
+
+ bin\Debug\
+ false
+ 285212672
+ false
+
+
+
+
+ bin\Debug\Ionic.BZip2.XML
+ true
+ 4096
+ false
+
+
+ false
+ false
+ false
+ 4
+ full
+ prompt
+ AllRules.ruleset
+
+
+ bin\Release\
+ false
+ 285212672
+ false
+
+
+
+
+
+
+ true
+ 4096
+ false
+
+
+ false
+ false
+ false
+ 4
+ full
+ prompt
+ AllRules.ruleset
+
+
+
+ mscorlib
+
+
+ System
+
+
+
+
+
+
+
+
+
+
+
+ CRC32.cs
+
+
+ SolutionInfo.cs
+
+
+
+
+ Ionic.snk
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 2.0 %28x86%29
+ true
+
+
+ False
+ .NET Framework 3.0 %28x86%29
+ false
+
+
+ False
+ .NET Framework 3.5
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ false
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/BZip2/BZip2Compressor.cs b/dotNetZip/BZip2/BZip2Compressor.cs
new file mode 100644
index 0000000..b09b16b
--- /dev/null
+++ b/dotNetZip/BZip2/BZip2Compressor.cs
@@ -0,0 +1,1920 @@
+// BZip2Compressor.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-July-28 06:17:22>
+//
+// ------------------------------------------------------------------
+//
+// This module defines the BZip2Compressor class, which is a
+// BZIP2-compressing encoder. It is used internally in the BZIP2
+// library, by the BZip2OutputStream class and its parallel variant,
+// ParallelBZip2OutputStream. This code was originally based on Apache
+// commons source code, and significantly modified. The license below
+// applies to the original Apache code and to this modified variant.
+//
+// ------------------------------------------------------------------
+
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+/*
+ * This package is based on the work done by Keiron Liddle, Aftex Software
+ * to whom the Ant project is very grateful for his
+ * great code.
+ */
+
+
+//
+// Design notes:
+//
+// This class performs BZip2 compression. It is derived from the
+// BZip2OutputStream from the Apache commons source code, but is
+// significantly modified from that code. While the Apache class is a
+// stream that compresses, this particular class simply performs
+// compression. It follows a Manager pattern. It manages an internal
+// buffer for uncompressed data; callers place data into the buffer
+// using the Fill() method. This class then compresses the data and
+// writes the compressed form out, via the CompressAndWrite() method.
+// Because BZip2 uses byte-shredding, this class relies on a BitWriter,
+// and not a .NET Stream, to emit its output. (*Think of the BitWriter
+// class as an Adapter that enables Bit-oriented output to a standard
+// byte-oriented .NET stream.)
+//
+// This class exists to support the two distinct output streams that
+// perform BZip2 compression: BZip2OutputStream and
+// ParallelBZip2OutputStream. These streams rely on BZip2Compressor to
+// provide the encoder/compression logic. This code has been derived
+// from the bzip2 output stream in the Apache commons library; it has
+// been significantly modified from that form, in order to provide a
+// single compressor that could support both types of streams.
+//
+// In a bz2 file or stream, there is never any bit padding except for 0..7
+// bits in the final byte in the file. Successive compressed blocks in a
+// .bz2 file are not byte-aligned.
+//
+//
+
+using System;
+using System.IO;
+
+// flymake: csc.exe /t:module BZip2InputStream.cs BZip2OutputStream.cs Rand.cs BCRC32.cs @@FILE@@
+
+namespace Ionic.BZip2
+{
+ internal class BZip2Compressor
+ {
+ private int blockSize100k; // 0...9
+ private int currentByte = -1;
+ private int runLength = 0;
+ private int last; // index into the block of the last char processed
+ private int outBlockFillThreshold;
+ private CompressionState cstate;
+ private readonly Ionic.Crc.CRC32 crc = new Ionic.Crc.CRC32(true);
+ BitWriter bw;
+ int runs;
+
+ /*
+ * The following three vars are used when sorting. If too many long
+ * comparisons happen, we stop sorting, randomise the block slightly, and
+ * try again. I think this wrinkle in the implementation was removed from
+ * a later rev of the C-language bzip, not sure. -DPC 24 Jul 2011
+ *
+ */
+ private int workDone;
+ private int workLimit;
+ private bool firstAttempt;
+ private bool blockRandomised;
+ private int origPtr;
+
+ private int nInUse;
+ private int nMTF;
+
+ private static readonly int SETMASK = (1 << 21);
+ private static readonly int CLEARMASK = (~SETMASK);
+ private static readonly byte GREATER_ICOST = 15;
+ private static readonly byte LESSER_ICOST = 0;
+ private static readonly int SMALL_THRESH = 20;
+ private static readonly int DEPTH_THRESH = 10;
+ private static readonly int WORK_FACTOR = 30;
+
+ /**
+ * Knuth's increments seem to work better than Incerpi-Sedgewick here.
+ * Possibly because the number of elems to sort is usually small, typically
+ * <= 20.
+ */
+ private static readonly int[] increments = { 1, 4, 13, 40, 121, 364, 1093, 3280,
+ 9841, 29524, 88573, 265720, 797161,
+ 2391484 };
+
+ ///
+ /// BZip2Compressor writes its compressed data out via a BitWriter. This
+ /// is necessary because BZip2 does byte shredding.
+ ///
+ public BZip2Compressor(BitWriter writer)
+ : this(writer, BZip2.MaxBlockSize)
+ {
+ }
+
+ public BZip2Compressor(BitWriter writer, int blockSize)
+ {
+ this.blockSize100k = blockSize;
+ this.bw = writer;
+
+ // 20 provides a margin of slop (not to say "Safety"). The maximum
+ // size of an encoded run in the output block is 5 bytes, so really, 5
+ // bytes ought to do, but this is a margin of slop found in the
+ // original bzip code. Not sure if important for decoding
+ // (decompressing). So we'll leave the slop.
+ this.outBlockFillThreshold = (blockSize * BZip2.BlockSizeMultiple) - 20;
+ this.cstate = new CompressionState(blockSize);
+ Reset();
+ }
+
+
+ void Reset()
+ {
+ // initBlock();
+ this.crc.Reset();
+ this.currentByte = -1;
+ this.runLength = 0;
+ this.last = -1;
+ for (int i = 256; --i >= 0;)
+ this.cstate.inUse[i] = false;
+ //bw.Reset(); xxx? want this? no no no
+ }
+
+
+ public int BlockSize
+ {
+ get { return this.blockSize100k; }
+ }
+
+ public uint Crc32
+ {
+ get; private set;
+ }
+
+ public int AvailableBytesOut
+ {
+ get; private set;
+ }
+
+ ///
+ /// The number of uncompressed bytes being held in the buffer.
+ ///
+ ///
+ ///
+ /// I am thinking this may be useful in a Stream that uses this
+ /// compressor class. In the Close() method on the stream it could
+ /// check this value to see if anything has been written at all. You
+ /// may think the stream could easily track the number of bytes it
+ /// wrote, which would eliminate the need for this. But, there is the
+ /// case where the stream writes a complete block, and it is full, and
+ /// then writes no more. In that case the stream may want to check.
+ ///
+ ///
+ public int UncompressedBytes
+ {
+ get { return this.last + 1; }
+ }
+
+
+ ///
+ /// Accept new bytes into the compressor data buffer
+ ///
+ ///
+ ///
+ /// This method does the first-level (cheap) run-length encoding, and
+ /// stores the encoded data into the rle block.
+ ///
+ ///
+ public int Fill(byte[] buffer, int offset, int count)
+ {
+ if (this.last >= this.outBlockFillThreshold)
+ return 0; // We're full, I tell you!
+
+ int bytesWritten = 0;
+ int limit = offset + count;
+ int rc;
+
+ // do run-length-encoding until block is full
+ do
+ {
+ rc = write0(buffer[offset++]);
+ if (rc > 0) bytesWritten++;
+ } while (offset < limit && rc == 1);
+
+ return bytesWritten;
+ }
+
+
+
+ ///
+ /// Process one input byte into the block.
+ ///
+ ///
+ ///
+ ///
+ /// To "process" the byte means to do the run-length encoding.
+ /// There are 3 possible return values:
+ ///
+ /// 0 - the byte was not written, in other words, not
+ /// encoded into the block. This happens when the
+ /// byte b would require the start of a new run, and
+ /// the block has no more room for new runs.
+ ///
+ /// 1 - the byte was written, and the block is not full.
+ ///
+ /// 2 - the byte was written, and the block is full.
+ ///
+ ///
+ ///
+ /// 0 if the byte was not written, non-zero if written.
+ private int write0(byte b)
+ {
+ bool rc;
+ // there is no current run in progress
+ if (this.currentByte == -1)
+ {
+ this.currentByte = b;
+ this.runLength++;
+ return 1;
+ }
+
+ // this byte is the same as the current run in progress
+ if (this.currentByte == b)
+ {
+ if (++this.runLength > 254)
+ {
+ rc = AddRunToOutputBlock(false);
+ this.currentByte = -1;
+ this.runLength = 0;
+ return (rc) ? 2 : 1;
+ }
+ return 1; // not full
+ }
+
+ // This byte requires a new run.
+ // Put the prior run into the Run-length-encoded block,
+ // and try to start a new run.
+ rc = AddRunToOutputBlock(false);
+
+ if (rc)
+ {
+ this.currentByte = -1;
+ this.runLength = 0;
+ // returning 0 implies the block is full, and the byte was not written.
+ return 0;
+ }
+
+ // start a new run
+ this.runLength = 1;
+ this.currentByte = b;
+ return 1;
+ }
+
+ ///
+ /// Append one run to the output block.
+ ///
+ ///
+ ///
+ ///
+ /// This compressor does run-length-encoding before BWT and etc. This
+ /// method simply appends a run to the output block. The append always
+ /// succeeds. The return value indicates whether the block is full:
+ /// false (not full) implies that at least one additional run could be
+ /// processed.
+ ///
+ ///
+ /// true if the block is now full; otherwise false.
+ private bool AddRunToOutputBlock(bool final)
+ {
+ runs++;
+ /* add_pair_to_block ( EState* s ) */
+ int previousLast = this.last;
+
+ // sanity check only - because of the check done at the
+ // bottom of this method, and the logic in write0(), this
+ // should never ever happen.
+ if (previousLast >= this.outBlockFillThreshold && !final)
+ {
+ var msg = String.Format("block overrun(final={2}): {0} >= threshold ({1})",
+ previousLast, this.outBlockFillThreshold, final);
+ throw new Exception(msg);
+ }
+
+ // NB: the index used here into block is always (last+2). This is
+ // because last is -1 based - the initial value is -1, a flag value
+ // used to indicate that nothing has yet been written into the
+ // block. The endBlock() fn tests for -1 to detect empty blocks. Also,
+ // the first byte of block is used, during sorting, to hold block[last
+ // +1], which is the final byte value that had been written into the
+ // rle block. For those two reasons, the base offset from last is
+ // always +2.
+
+ byte b = (byte) this.currentByte;
+ byte[] block = this.cstate.block;
+ this.cstate.inUse[b] = true;
+ int rl = this.runLength;
+ this.crc.UpdateCRC(b, rl);
+
+ switch (rl)
+ {
+ case 1:
+ block[previousLast + 2] = b;
+ this.last = previousLast + 1;
+ break;
+
+ case 2:
+ block[previousLast + 2] = b;
+ block[previousLast + 3] = b;
+ this.last = previousLast + 2;
+ break;
+
+ case 3:
+ block[previousLast + 2] = b;
+ block[previousLast + 3] = b;
+ block[previousLast + 4] = b;
+ this.last = previousLast + 3;
+ break;
+
+ default:
+ rl -= 4;
+ this.cstate.inUse[rl] = true;
+ block[previousLast + 2] = b;
+ block[previousLast + 3] = b;
+ block[previousLast + 4] = b;
+ block[previousLast + 5] = b;
+ block[previousLast + 6] = (byte) rl;
+ this.last = previousLast + 5;
+ break;
+ }
+
+ // is full?
+ return (this.last >= this.outBlockFillThreshold);
+ }
+
+
+ ///
+ /// Compress the data that has been placed (Run-length-encoded) into the
+ /// block. The compressed data goes into the CompressedBytes array.
+ ///
+ ///
+ ///
+ /// Side effects: 1. fills the CompressedBytes array. 2. sets the
+ /// AvailableBytesOut property.
+ ///
+ ///
+ public void CompressAndWrite() // endBlock
+ {
+ if (this.runLength > 0)
+ AddRunToOutputBlock(true);
+
+ this.currentByte = -1;
+
+ // Console.WriteLine(" BZip2Compressor:CompressAndWrite (r={0} bcrc={1:X8})",
+ // runs, this.crc.Crc32Result);
+
+ // has any data been written?
+ if (this.last == -1)
+ return; // no data; nothing to compress
+
+ /* sort the block and establish posn of original string */
+ blockSort();
+
+ /*
+ * A 6-byte block header, the value chosen arbitrarily as 0x314159265359
+ * :-). A 32 bit value does not really give a strong enough guarantee
+ * that the value will not appear by chance in the compressed
+ * datastream. Worst-case probability of this event, for a 900k block,
+ * is about 2.0e-3 for 32 bits, 1.0e-5 for 40 bits and 4.0e-8 for 48
+ * bits. For a compressed file of size 100Gb -- about 100000 blocks --
+ * only a 48-bit marker will do. NB: normal compression/ decompression
+ * donot rely on these statistical properties. They are only important
+ * when trying to recover blocks from damaged files.
+ */
+ this.bw.WriteByte(0x31);
+ this.bw.WriteByte(0x41);
+ this.bw.WriteByte(0x59);
+ this.bw.WriteByte(0x26);
+ this.bw.WriteByte(0x53);
+ this.bw.WriteByte(0x59);
+
+ this.Crc32 = (uint) this.crc.Crc32Result;
+ this.bw.WriteInt(this.Crc32);
+
+ /* Now a single bit indicating randomisation. */
+ this.bw.WriteBits(1, (this.blockRandomised)?1U:0U);
+
+ /* Finally, block's contents proper. */
+ moveToFrontCodeAndSend();
+
+ Reset();
+ }
+
+
+ private void randomiseBlock()
+ {
+ bool[] inUse = this.cstate.inUse;
+ byte[] block = this.cstate.block;
+ int lastShadow = this.last;
+
+ for (int i = 256; --i >= 0;)
+ inUse[i] = false;
+
+ int rNToGo = 0;
+ int rTPos = 0;
+ for (int i = 0, j = 1; i <= lastShadow; i = j, j++)
+ {
+ if (rNToGo == 0)
+ {
+ rNToGo = (char) Rand.Rnums(rTPos);
+ if (++rTPos == 512)
+ {
+ rTPos = 0;
+ }
+ }
+
+ rNToGo--;
+ block[j] ^= (byte) ((rNToGo == 1) ? 1 : 0);
+
+ // handle 16 bit signed numbers
+ inUse[block[j] & 0xff] = true;
+ }
+
+ this.blockRandomised = true;
+ }
+
+ private void mainSort()
+ {
+ CompressionState dataShadow = this.cstate;
+ int[] runningOrder = dataShadow.mainSort_runningOrder;
+ int[] copy = dataShadow.mainSort_copy;
+ bool[] bigDone = dataShadow.mainSort_bigDone;
+ int[] ftab = dataShadow.ftab;
+ byte[] block = dataShadow.block;
+ int[] fmap = dataShadow.fmap;
+ char[] quadrant = dataShadow.quadrant;
+ int lastShadow = this.last;
+ int workLimitShadow = this.workLimit;
+ bool firstAttemptShadow = this.firstAttempt;
+
+ // Set up the 2-byte frequency table
+ for (int i = 65537; --i >= 0;)
+ {
+ ftab[i] = 0;
+ }
+
+ /*
+ * In the various block-sized structures, live data runs from 0 to
+ * last+NUM_OVERSHOOT_BYTES inclusive. First, set up the overshoot area
+ * for block.
+ */
+ for (int i = 0; i < BZip2.NUM_OVERSHOOT_BYTES; i++)
+ {
+ block[lastShadow + i + 2] = block[(i % (lastShadow + 1)) + 1];
+ }
+ for (int i = lastShadow + BZip2.NUM_OVERSHOOT_BYTES +1; --i >= 0;)
+ {
+ quadrant[i] = '\0';
+ }
+ block[0] = block[lastShadow + 1];
+
+ // Complete the initial radix sort:
+
+ int c1 = block[0] & 0xff;
+ for (int i = 0; i <= lastShadow; i++)
+ {
+ int c2 = block[i + 1] & 0xff;
+ ftab[(c1 << 8) + c2]++;
+ c1 = c2;
+ }
+
+ for (int i = 1; i <= 65536; i++)
+ ftab[i] += ftab[i - 1];
+
+ c1 = block[1] & 0xff;
+ for (int i = 0; i < lastShadow; i++)
+ {
+ int c2 = block[i + 2] & 0xff;
+ fmap[--ftab[(c1 << 8) + c2]] = i;
+ c1 = c2;
+ }
+
+ fmap[--ftab[((block[lastShadow + 1] & 0xff) << 8) + (block[1] & 0xff)]] = lastShadow;
+
+ /*
+ * Now ftab contains the first loc of every small bucket. Calculate the
+ * running order, from smallest to largest big bucket.
+ */
+ for (int i = 256; --i >= 0;)
+ {
+ bigDone[i] = false;
+ runningOrder[i] = i;
+ }
+
+ for (int h = 364; h != 1;)
+ {
+ h /= 3;
+ for (int i = h; i <= 255; i++)
+ {
+ int vv = runningOrder[i];
+ int a = ftab[(vv + 1) << 8] - ftab[vv << 8];
+ int b = h - 1;
+ int j = i;
+ for (int ro = runningOrder[j - h]; (ftab[(ro + 1) << 8] - ftab[ro << 8]) > a; ro = runningOrder[j
+ - h])
+ {
+ runningOrder[j] = ro;
+ j -= h;
+ if (j <= b)
+ {
+ break;
+ }
+ }
+ runningOrder[j] = vv;
+ }
+ }
+
+ /*
+ * The main sorting loop.
+ */
+ for (int i = 0; i <= 255; i++)
+ {
+ /*
+ * Process big buckets, starting with the least full.
+ */
+ int ss = runningOrder[i];
+
+ // Step 1:
+ /*
+ * Complete the big bucket [ss] by quicksorting any unsorted small
+ * buckets [ss, j]. Hopefully previous pointer-scanning phases have
+ * already completed many of the small buckets [ss, j], so we don't
+ * have to sort them at all.
+ */
+ for (int j = 0; j <= 255; j++)
+ {
+ int sb = (ss << 8) + j;
+ int ftab_sb = ftab[sb];
+ if ((ftab_sb & SETMASK) != SETMASK)
+ {
+ int lo = ftab_sb & CLEARMASK;
+ int hi = (ftab[sb + 1] & CLEARMASK) - 1;
+ if (hi > lo)
+ {
+ mainQSort3(dataShadow, lo, hi, 2);
+ if (firstAttemptShadow
+ && (this.workDone > workLimitShadow))
+ {
+ return;
+ }
+ }
+ ftab[sb] = ftab_sb | SETMASK;
+ }
+ }
+
+ // Step 2:
+ // Now scan this big bucket so as to synthesise the
+ // sorted order for small buckets [t, ss] for all t != ss.
+
+ for (int j = 0; j <= 255; j++)
+ {
+ copy[j] = ftab[(j << 8) + ss] & CLEARMASK;
+ }
+
+ for (int j = ftab[ss << 8] & CLEARMASK, hj = (ftab[(ss + 1) << 8] & CLEARMASK); j < hj; j++)
+ {
+ int fmap_j = fmap[j];
+ c1 = block[fmap_j] & 0xff;
+ if (!bigDone[c1])
+ {
+ fmap[copy[c1]] = (fmap_j == 0) ? lastShadow : (fmap_j - 1);
+ copy[c1]++;
+ }
+ }
+
+ for (int j = 256; --j >= 0;)
+ ftab[(j << 8) + ss] |= SETMASK;
+
+ // Step 3:
+ /*
+ * The ss big bucket is now done. Record this fact, and update the
+ * quadrant descriptors. Remember to update quadrants in the
+ * overshoot area too, if necessary. The "if (i < 255)" test merely
+ * skips this updating for the last bucket processed, since updating
+ * for the last bucket is pointless.
+ */
+ bigDone[ss] = true;
+
+ if (i < 255)
+ {
+ int bbStart = ftab[ss << 8] & CLEARMASK;
+ int bbSize = (ftab[(ss + 1) << 8] & CLEARMASK) - bbStart;
+ int shifts = 0;
+
+ while ((bbSize >> shifts) > 65534)
+ {
+ shifts++;
+ }
+
+ for (int j = 0; j < bbSize; j++)
+ {
+ int a2update = fmap[bbStart + j];
+ char qVal = (char) (j >> shifts);
+ quadrant[a2update] = qVal;
+ if (a2update < BZip2.NUM_OVERSHOOT_BYTES)
+ {
+ quadrant[a2update + lastShadow + 1] = qVal;
+ }
+ }
+ }
+
+ }
+ }
+
+
+ private void blockSort()
+ {
+ this.workLimit = WORK_FACTOR * this.last;
+ this.workDone = 0;
+ this.blockRandomised = false;
+ this.firstAttempt = true;
+ mainSort();
+
+ if (this.firstAttempt && (this.workDone > this.workLimit))
+ {
+ randomiseBlock();
+ this.workLimit = this.workDone = 0;
+ this.firstAttempt = false;
+ mainSort();
+ }
+
+ int[] fmap = this.cstate.fmap;
+ this.origPtr = -1;
+ for (int i = 0, lastShadow = this.last; i <= lastShadow; i++)
+ {
+ if (fmap[i] == 0)
+ {
+ this.origPtr = i;
+ break;
+ }
+ }
+
+ // assert (this.origPtr != -1) : this.origPtr;
+ }
+
+
+ /**
+ * This is the most hammered method of this class.
+ *
+ *
+ * This is the version using unrolled loops.
+ *
+ */
+ private bool mainSimpleSort(CompressionState dataShadow, int lo,
+ int hi, int d)
+ {
+ int bigN = hi - lo + 1;
+ if (bigN < 2)
+ {
+ return this.firstAttempt && (this.workDone > this.workLimit);
+ }
+
+ int hp = 0;
+ while (increments[hp] < bigN)
+ hp++;
+
+ int[] fmap = dataShadow.fmap;
+ char[] quadrant = dataShadow.quadrant;
+ byte[] block = dataShadow.block;
+ int lastShadow = this.last;
+ int lastPlus1 = lastShadow + 1;
+ bool firstAttemptShadow = this.firstAttempt;
+ int workLimitShadow = this.workLimit;
+ int workDoneShadow = this.workDone;
+
+ // Following block contains unrolled code which could be shortened by
+ // coding it in additional loops.
+
+ // HP:
+ while (--hp >= 0)
+ {
+ int h = increments[hp];
+ int mj = lo + h - 1;
+
+ for (int i = lo + h; i <= hi;)
+ {
+ // copy
+ for (int k = 3; (i <= hi) && (--k >= 0); i++)
+ {
+ int v = fmap[i];
+ int vd = v + d;
+ int j = i;
+
+ // for (int a;
+ // (j > mj) && mainGtU((a = fmap[j - h]) + d, vd,
+ // block, quadrant, lastShadow);
+ // j -= h) {
+ // fmap[j] = a;
+ // }
+ //
+ // unrolled version:
+
+ // start inline mainGTU
+ bool onceRunned = false;
+ int a = 0;
+
+ HAMMER: while (true)
+ {
+ if (onceRunned)
+ {
+ fmap[j] = a;
+ if ((j -= h) <= mj)
+ {
+ goto END_HAMMER;
+ }
+ }
+ else {
+ onceRunned = true;
+ }
+
+ a = fmap[j - h];
+ int i1 = a + d;
+ int i2 = vd;
+
+ // following could be done in a loop, but
+ // unrolled it for performance:
+ if (block[i1 + 1] == block[i2 + 1])
+ {
+ if (block[i1 + 2] == block[i2 + 2])
+ {
+ if (block[i1 + 3] == block[i2 + 3])
+ {
+ if (block[i1 + 4] == block[i2 + 4])
+ {
+ if (block[i1 + 5] == block[i2 + 5])
+ {
+ if (block[(i1 += 6)] == block[(i2 += 6)])
+ {
+ int x = lastShadow;
+ X: while (x > 0)
+ {
+ x -= 4;
+
+ if (block[i1 + 1] == block[i2 + 1])
+ {
+ if (quadrant[i1] == quadrant[i2])
+ {
+ if (block[i1 + 2] == block[i2 + 2])
+ {
+ if (quadrant[i1 + 1] == quadrant[i2 + 1])
+ {
+ if (block[i1 + 3] == block[i2 + 3])
+ {
+ if (quadrant[i1 + 2] == quadrant[i2 + 2])
+ {
+ if (block[i1 + 4] == block[i2 + 4])
+ {
+ if (quadrant[i1 + 3] == quadrant[i2 + 3])
+ {
+ if ((i1 += 4) >= lastPlus1)
+ {
+ i1 -= lastPlus1;
+ }
+ if ((i2 += 4) >= lastPlus1)
+ {
+ i2 -= lastPlus1;
+ }
+ workDoneShadow++;
+ goto X;
+ }
+ else if ((quadrant[i1 + 3] > quadrant[i2 + 3]))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 4] & 0xff) > (block[i2 + 4] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((quadrant[i1 + 2] > quadrant[i2 + 2]))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 3] & 0xff) > (block[i2 + 3] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((quadrant[i1 + 1] > quadrant[i2 + 1]))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 2] & 0xff) > (block[i2 + 2] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((quadrant[i1] > quadrant[i2]))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 1] & 0xff) > (block[i2 + 1] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+
+ }
+ goto END_HAMMER;
+ } // while x > 0
+ else {
+ if ((block[i1] & 0xff) > (block[i2] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ }
+ else if ((block[i1 + 5] & 0xff) > (block[i2 + 5] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 4] & 0xff) > (block[i2 + 4] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 3] & 0xff) > (block[i2 + 3] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 2] & 0xff) > (block[i2 + 2] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+ }
+ else if ((block[i1 + 1] & 0xff) > (block[i2 + 1] & 0xff))
+ {
+ goto HAMMER;
+ }
+ else {
+ goto END_HAMMER;
+ }
+
+ } // HAMMER
+
+ END_HAMMER:
+ // end inline mainGTU
+
+ fmap[j] = v;
+ }
+
+ if (firstAttemptShadow && (i <= hi)
+ && (workDoneShadow > workLimitShadow))
+ {
+ goto END_HP;
+ }
+ }
+ }
+ END_HP:
+
+ this.workDone = workDoneShadow;
+ return firstAttemptShadow && (workDoneShadow > workLimitShadow);
+ }
+
+
+
+ private static void vswap(int[] fmap, int p1, int p2, int n)
+ {
+ n += p1;
+ while (p1 < n)
+ {
+ int t = fmap[p1];
+ fmap[p1++] = fmap[p2];
+ fmap[p2++] = t;
+ }
+ }
+
+ private static byte med3(byte a, byte b, byte c)
+ {
+ return (a < b) ? (b < c ? b : a < c ? c : a) : (b > c ? b : a > c ? c
+ : a);
+ }
+
+
+ /**
+ * Method "mainQSort3", file "blocksort.c", BZip2 1.0.2
+ */
+ private void mainQSort3(CompressionState dataShadow, int loSt,
+ int hiSt, int dSt)
+ {
+ int[] stack_ll = dataShadow.stack_ll;
+ int[] stack_hh = dataShadow.stack_hh;
+ int[] stack_dd = dataShadow.stack_dd;
+ int[] fmap = dataShadow.fmap;
+ byte[] block = dataShadow.block;
+
+ stack_ll[0] = loSt;
+ stack_hh[0] = hiSt;
+ stack_dd[0] = dSt;
+
+ for (int sp = 1; --sp >= 0;)
+ {
+ int lo = stack_ll[sp];
+ int hi = stack_hh[sp];
+ int d = stack_dd[sp];
+
+ if ((hi - lo < SMALL_THRESH) || (d > DEPTH_THRESH))
+ {
+ if (mainSimpleSort(dataShadow, lo, hi, d))
+ {
+ return;
+ }
+ }
+ else {
+ int d1 = d + 1;
+ int med = med3(block[fmap[lo] + d1],
+ block[fmap[hi] + d1], block[fmap[(lo + hi) >> 1] + d1]) & 0xff;
+
+ int unLo = lo;
+ int unHi = hi;
+ int ltLo = lo;
+ int gtHi = hi;
+
+ while (true)
+ {
+ while (unLo <= unHi)
+ {
+ int n = (block[fmap[unLo] + d1] & 0xff)
+ - med;
+ if (n == 0)
+ {
+ int temp = fmap[unLo];
+ fmap[unLo++] = fmap[ltLo];
+ fmap[ltLo++] = temp;
+ }
+ else if (n < 0)
+ {
+ unLo++;
+ }
+ else {
+ break;
+ }
+ }
+
+ while (unLo <= unHi)
+ {
+ int n = (block[fmap[unHi] + d1] & 0xff)
+ - med;
+ if (n == 0)
+ {
+ int temp = fmap[unHi];
+ fmap[unHi--] = fmap[gtHi];
+ fmap[gtHi--] = temp;
+ }
+ else if (n > 0)
+ {
+ unHi--;
+ }
+ else {
+ break;
+ }
+ }
+
+ if (unLo <= unHi)
+ {
+ int temp = fmap[unLo];
+ fmap[unLo++] = fmap[unHi];
+ fmap[unHi--] = temp;
+ }
+ else {
+ break;
+ }
+ }
+
+ if (gtHi < ltLo)
+ {
+ stack_ll[sp] = lo;
+ stack_hh[sp] = hi;
+ stack_dd[sp] = d1;
+ sp++;
+ }
+ else {
+ int n = ((ltLo - lo) < (unLo - ltLo)) ? (ltLo - lo)
+ : (unLo - ltLo);
+ vswap(fmap, lo, unLo - n, n);
+ int m = ((hi - gtHi) < (gtHi - unHi)) ? (hi - gtHi)
+ : (gtHi - unHi);
+ vswap(fmap, unLo, hi - m + 1, m);
+
+ n = lo + unLo - ltLo - 1;
+ m = hi - (gtHi - unHi) + 1;
+
+ stack_ll[sp] = lo;
+ stack_hh[sp] = n;
+ stack_dd[sp] = d;
+ sp++;
+
+ stack_ll[sp] = n + 1;
+ stack_hh[sp] = m - 1;
+ stack_dd[sp] = d1;
+ sp++;
+
+ stack_ll[sp] = m;
+ stack_hh[sp] = hi;
+ stack_dd[sp] = d;
+ sp++;
+ }
+ }
+ }
+ }
+
+
+
+ private void generateMTFValues()
+ {
+ int lastShadow = this.last;
+ CompressionState dataShadow = this.cstate;
+ bool[] inUse = dataShadow.inUse;
+ byte[] block = dataShadow.block;
+ int[] fmap = dataShadow.fmap;
+ char[] sfmap = dataShadow.sfmap;
+ int[] mtfFreq = dataShadow.mtfFreq;
+ byte[] unseqToSeq = dataShadow.unseqToSeq;
+ byte[] yy = dataShadow.generateMTFValues_yy;
+
+ // make maps
+ int nInUseShadow = 0;
+ for (int i = 0; i < 256; i++)
+ {
+ if (inUse[i])
+ {
+ unseqToSeq[i] = (byte) nInUseShadow;
+ nInUseShadow++;
+ }
+ }
+ this.nInUse = nInUseShadow;
+
+ int eob = nInUseShadow + 1;
+
+ for (int i = eob; i >= 0; i--)
+ {
+ mtfFreq[i] = 0;
+ }
+
+ for (int i = nInUseShadow; --i >= 0;)
+ {
+ yy[i] = (byte) i;
+ }
+
+ int wr = 0;
+ int zPend = 0;
+
+ for (int i = 0; i <= lastShadow; i++)
+ {
+ byte ll_i = unseqToSeq[block[fmap[i]] & 0xff];
+ byte tmp = yy[0];
+ int j = 0;
+
+ while (ll_i != tmp)
+ {
+ j++;
+ byte tmp2 = tmp;
+ tmp = yy[j];
+ yy[j] = tmp2;
+ }
+ yy[0] = tmp;
+
+ if (j == 0)
+ {
+ zPend++;
+ }
+ else
+ {
+ if (zPend > 0)
+ {
+ zPend--;
+ while (true)
+ {
+ if ((zPend & 1) == 0)
+ {
+ sfmap[wr] = BZip2.RUNA;
+ wr++;
+ mtfFreq[BZip2.RUNA]++;
+ }
+ else
+ {
+ sfmap[wr] = BZip2.RUNB;
+ wr++;
+ mtfFreq[BZip2.RUNB]++;
+ }
+
+ if (zPend >= 2)
+ {
+ zPend = (zPend - 2) >> 1;
+ }
+ else
+ {
+ break;
+ }
+ }
+ zPend = 0;
+ }
+ sfmap[wr] = (char) (j + 1);
+ wr++;
+ mtfFreq[j + 1]++;
+ }
+ }
+
+ if (zPend > 0)
+ {
+ zPend--;
+ while (true)
+ {
+ if ((zPend & 1) == 0)
+ {
+ sfmap[wr] = BZip2.RUNA;
+ wr++;
+ mtfFreq[BZip2.RUNA]++;
+ }
+ else
+ {
+ sfmap[wr] = BZip2.RUNB;
+ wr++;
+ mtfFreq[BZip2.RUNB]++;
+ }
+
+ if (zPend >= 2)
+ {
+ zPend = (zPend - 2) >> 1;
+ }
+ else
+ {
+ break;
+ }
+ }
+ }
+
+ sfmap[wr] = (char) eob;
+ mtfFreq[eob]++;
+ this.nMTF = wr + 1;
+ }
+
+
+ private static void hbAssignCodes(int[] code, byte[] length,
+ int minLen, int maxLen,
+ int alphaSize)
+ {
+ int vec = 0;
+ for (int n = minLen; n <= maxLen; n++)
+ {
+ for (int i = 0; i < alphaSize; i++)
+ {
+ if ((length[i] & 0xff) == n)
+ {
+ code[i] = vec;
+ vec++;
+ }
+ }
+ vec <<= 1;
+ }
+ }
+
+
+
+
+ private void sendMTFValues()
+ {
+ byte[][] len = this.cstate.sendMTFValues_len;
+ int alphaSize = this.nInUse + 2;
+
+ for (int t = BZip2.NGroups; --t >= 0;)
+ {
+ byte[] len_t = len[t];
+ for (int v = alphaSize; --v >= 0;)
+ {
+ len_t[v] = GREATER_ICOST;
+ }
+ }
+
+ /* Decide how many coding tables to use */
+ // assert (this.nMTF > 0) : this.nMTF;
+ int nGroups = (this.nMTF < 200) ? 2 : (this.nMTF < 600) ? 3
+ : (this.nMTF < 1200) ? 4 : (this.nMTF < 2400) ? 5 : 6;
+
+ /* Generate an initial set of coding tables */
+ sendMTFValues0(nGroups, alphaSize);
+
+ /*
+ * Iterate up to N_ITERS times to improve the tables.
+ */
+ int nSelectors = sendMTFValues1(nGroups, alphaSize);
+
+ /* Compute MTF values for the selectors. */
+ sendMTFValues2(nGroups, nSelectors);
+
+ /* Assign actual codes for the tables. */
+ sendMTFValues3(nGroups, alphaSize);
+
+ /* Transmit the mapping table. */
+ sendMTFValues4();
+
+ /* Now the selectors. */
+ sendMTFValues5(nGroups, nSelectors);
+
+ /* Now the coding tables. */
+ sendMTFValues6(nGroups, alphaSize);
+
+ /* And finally, the block data proper */
+ sendMTFValues7(nSelectors);
+ }
+
+ private void sendMTFValues0(int nGroups, int alphaSize)
+ {
+ byte[][] len = this.cstate.sendMTFValues_len;
+ int[] mtfFreq = this.cstate.mtfFreq;
+
+ int remF = this.nMTF;
+ int gs = 0;
+
+ for (int nPart = nGroups; nPart > 0; nPart--)
+ {
+ int tFreq = remF / nPart;
+ int ge = gs - 1;
+ int aFreq = 0;
+
+ for (int a = alphaSize - 1; (aFreq < tFreq) && (ge < a);)
+ {
+ aFreq += mtfFreq[++ge];
+ }
+
+ if ((ge > gs) && (nPart != nGroups) && (nPart != 1)
+ && (((nGroups - nPart) & 1) != 0))
+ {
+ aFreq -= mtfFreq[ge--];
+ }
+
+ byte[] len_np = len[nPart - 1];
+ for (int v = alphaSize; --v >= 0;)
+ {
+ if ((v >= gs) && (v <= ge))
+ {
+ len_np[v] = LESSER_ICOST;
+ }
+ else {
+ len_np[v] = GREATER_ICOST;
+ }
+ }
+
+ gs = ge + 1;
+ remF -= aFreq;
+ }
+ }
+
+
+ private static void hbMakeCodeLengths(byte[] len, int[] freq,
+ CompressionState state1, int alphaSize,
+ int maxLen)
+ {
+ /*
+ * Nodes and heap entries run from 1. Entry 0 for both the heap and
+ * nodes is a sentinel.
+ */
+ int[] heap = state1.heap;
+ int[] weight = state1.weight;
+ int[] parent = state1.parent;
+
+ for (int i = alphaSize; --i >= 0;)
+ {
+ weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
+ }
+
+ for (bool tooLong = true; tooLong;)
+ {
+ tooLong = false;
+
+ int nNodes = alphaSize;
+ int nHeap = 0;
+ heap[0] = 0;
+ weight[0] = 0;
+ parent[0] = -2;
+
+ for (int i = 1; i <= alphaSize; i++)
+ {
+ parent[i] = -1;
+ nHeap++;
+ heap[nHeap] = i;
+
+ int zz = nHeap;
+ int tmp = heap[zz];
+ while (weight[tmp] < weight[heap[zz >> 1]])
+ {
+ heap[zz] = heap[zz >> 1];
+ zz >>= 1;
+ }
+ heap[zz] = tmp;
+ }
+
+ while (nHeap > 1)
+ {
+ int n1 = heap[1];
+ heap[1] = heap[nHeap];
+ nHeap--;
+
+ int yy = 0;
+ int zz = 1;
+ int tmp = heap[1];
+
+ while (true)
+ {
+ yy = zz << 1;
+
+ if (yy > nHeap)
+ {
+ break;
+ }
+
+ if ((yy < nHeap)
+ && (weight[heap[yy + 1]] < weight[heap[yy]]))
+ {
+ yy++;
+ }
+
+ if (weight[tmp] < weight[heap[yy]])
+ {
+ break;
+ }
+
+ heap[zz] = heap[yy];
+ zz = yy;
+ }
+
+ heap[zz] = tmp;
+
+ int n2 = heap[1];
+ heap[1] = heap[nHeap];
+ nHeap--;
+
+ yy = 0;
+ zz = 1;
+ tmp = heap[1];
+
+ while (true)
+ {
+ yy = zz << 1;
+
+ if (yy > nHeap)
+ {
+ break;
+ }
+
+ if ((yy < nHeap)
+ && (weight[heap[yy + 1]] < weight[heap[yy]]))
+ {
+ yy++;
+ }
+
+ if (weight[tmp] < weight[heap[yy]])
+ {
+ break;
+ }
+
+ heap[zz] = heap[yy];
+ zz = yy;
+ }
+
+ heap[zz] = tmp;
+ nNodes++;
+ parent[n1] = parent[n2] = nNodes;
+
+ int weight_n1 = weight[n1];
+ int weight_n2 = weight[n2];
+ weight[nNodes] = (int) (((uint)weight_n1 & 0xffffff00U)
+ + ((uint)weight_n2 & 0xffffff00U))
+ | (1 + (((weight_n1 & 0x000000ff)
+ > (weight_n2 & 0x000000ff))
+ ? (weight_n1 & 0x000000ff)
+ : (weight_n2 & 0x000000ff)));
+
+ parent[nNodes] = -1;
+ nHeap++;
+ heap[nHeap] = nNodes;
+
+ tmp = 0;
+ zz = nHeap;
+ tmp = heap[zz];
+ int weight_tmp = weight[tmp];
+ while (weight_tmp < weight[heap[zz >> 1]])
+ {
+ heap[zz] = heap[zz >> 1];
+ zz >>= 1;
+ }
+ heap[zz] = tmp;
+
+ }
+
+ for (int i = 1; i <= alphaSize; i++)
+ {
+ int j = 0;
+ int k = i;
+
+ for (int parent_k; (parent_k = parent[k]) >= 0;)
+ {
+ k = parent_k;
+ j++;
+ }
+
+ len[i - 1] = (byte) j;
+ if (j > maxLen)
+ {
+ tooLong = true;
+ }
+ }
+
+ if (tooLong)
+ {
+ for (int i = 1; i < alphaSize; i++)
+ {
+ int j = weight[i] >> 8;
+ j = 1 + (j >> 1);
+ weight[i] = j << 8;
+ }
+ }
+ }
+ }
+
+
+ private int sendMTFValues1(int nGroups, int alphaSize)
+ {
+ CompressionState dataShadow = this.cstate;
+ int[][] rfreq = dataShadow.sendMTFValues_rfreq;
+ int[] fave = dataShadow.sendMTFValues_fave;
+ short[] cost = dataShadow.sendMTFValues_cost;
+ char[] sfmap = dataShadow.sfmap;
+ byte[] selector = dataShadow.selector;
+ byte[][] len = dataShadow.sendMTFValues_len;
+ byte[] len_0 = len[0];
+ byte[] len_1 = len[1];
+ byte[] len_2 = len[2];
+ byte[] len_3 = len[3];
+ byte[] len_4 = len[4];
+ byte[] len_5 = len[5];
+ int nMTFShadow = this.nMTF;
+
+ int nSelectors = 0;
+
+ for (int iter = 0; iter < BZip2.N_ITERS; iter++)
+ {
+ for (int t = nGroups; --t >= 0;)
+ {
+ fave[t] = 0;
+ int[] rfreqt = rfreq[t];
+ for (int i = alphaSize; --i >= 0;)
+ {
+ rfreqt[i] = 0;
+ }
+ }
+
+ nSelectors = 0;
+
+ for (int gs = 0; gs < this.nMTF;)
+ {
+ /* Set group start & end marks. */
+
+ /*
+ * Calculate the cost of this group as coded by each of the
+ * coding tables.
+ */
+
+ int ge = Math.Min(gs + BZip2.G_SIZE - 1, nMTFShadow - 1);
+
+ if (nGroups == BZip2.NGroups)
+ {
+ // unrolled version of the else-block
+
+ int[] c = new int[6];
+
+ for (int i = gs; i <= ge; i++)
+ {
+ int icv = sfmap[i];
+ c[0] += len_0[icv] & 0xff;
+ c[1] += len_1[icv] & 0xff;
+ c[2] += len_2[icv] & 0xff;
+ c[3] += len_3[icv] & 0xff;
+ c[4] += len_4[icv] & 0xff;
+ c[5] += len_5[icv] & 0xff;
+ }
+
+ cost[0] = (short) c[0];
+ cost[1] = (short) c[1];
+ cost[2] = (short) c[2];
+ cost[3] = (short) c[3];
+ cost[4] = (short) c[4];
+ cost[5] = (short) c[5];
+ }
+ else
+ {
+ for (int t = nGroups; --t >= 0;)
+ {
+ cost[t] = 0;
+ }
+
+ for (int i = gs; i <= ge; i++)
+ {
+ int icv = sfmap[i];
+ for (int t = nGroups; --t >= 0;)
+ {
+ cost[t] += (short) (len[t][icv] & 0xff);
+ }
+ }
+ }
+
+ /*
+ * Find the coding table which is best for this group, and
+ * record its identity in the selector table.
+ */
+ int bt = -1;
+ for (int t = nGroups, bc = 999999999; --t >= 0;)
+ {
+ int cost_t = cost[t];
+ if (cost_t < bc)
+ {
+ bc = cost_t;
+ bt = t;
+ }
+ }
+
+ fave[bt]++;
+ selector[nSelectors] = (byte) bt;
+ nSelectors++;
+
+ /*
+ * Increment the symbol frequencies for the selected table.
+ */
+ int[] rfreq_bt = rfreq[bt];
+ for (int i = gs; i <= ge; i++)
+ {
+ rfreq_bt[sfmap[i]]++;
+ }
+
+ gs = ge + 1;
+ }
+
+ /*
+ * Recompute the tables based on the accumulated frequencies.
+ */
+ for (int t = 0; t < nGroups; t++)
+ {
+ hbMakeCodeLengths(len[t], rfreq[t], this.cstate, alphaSize, 20);
+ }
+ }
+
+ return nSelectors;
+ }
+
+ private void sendMTFValues2(int nGroups, int nSelectors)
+ {
+ // assert (nGroups < 8) : nGroups;
+
+ CompressionState dataShadow = this.cstate;
+ byte[] pos = dataShadow.sendMTFValues2_pos;
+
+ for (int i = nGroups; --i >= 0;)
+ {
+ pos[i] = (byte) i;
+ }
+
+ for (int i = 0; i < nSelectors; i++)
+ {
+ byte ll_i = dataShadow.selector[i];
+ byte tmp = pos[0];
+ int j = 0;
+
+ while (ll_i != tmp)
+ {
+ j++;
+ byte tmp2 = tmp;
+ tmp = pos[j];
+ pos[j] = tmp2;
+ }
+
+ pos[0] = tmp;
+ dataShadow.selectorMtf[i] = (byte) j;
+ }
+ }
+
+ private void sendMTFValues3(int nGroups, int alphaSize)
+ {
+ int[][] code = this.cstate.sendMTFValues_code;
+ byte[][] len = this.cstate.sendMTFValues_len;
+
+ for (int t = 0; t < nGroups; t++)
+ {
+ int minLen = 32;
+ int maxLen = 0;
+ byte[] len_t = len[t];
+ for (int i = alphaSize; --i >= 0;)
+ {
+ int l = len_t[i] & 0xff;
+ if (l > maxLen)
+ {
+ maxLen = l;
+ }
+ if (l < minLen)
+ {
+ minLen = l;
+ }
+ }
+
+ // assert (maxLen <= 20) : maxLen;
+ // assert (minLen >= 1) : minLen;
+
+ hbAssignCodes(code[t], len[t], minLen, maxLen, alphaSize);
+ }
+ }
+
+ private void sendMTFValues4()
+ {
+ bool[] inUse = this.cstate.inUse;
+ bool[] inUse16 = this.cstate.sentMTFValues4_inUse16;
+
+ for (int i = 16; --i >= 0;)
+ {
+ inUse16[i] = false;
+ int i16 = i * 16;
+ for (int j = 16; --j >= 0;)
+ {
+ if (inUse[i16 + j])
+ {
+ inUse16[i] = true;
+ }
+ }
+ }
+
+ uint u = 0;
+ for (int i = 0; i < 16; i++)
+ {
+ if (inUse16[i])
+ u |= 1U << (16 - i - 1);
+ }
+ this.bw.WriteBits(16, u);
+
+
+ for (int i = 0; i < 16; i++)
+ {
+ if (inUse16[i])
+ {
+ int i16 = i * 16;
+ u = 0;
+ for (int j = 0; j < 16; j++)
+ {
+ if (inUse[i16 + j])
+ {
+ u |= 1U << (16 - j - 1);
+ }
+ }
+ this.bw.WriteBits(16, u);
+ }
+ }
+ }
+
+
+ private void sendMTFValues5(int nGroups, int nSelectors)
+ {
+ this.bw.WriteBits(3, (uint) nGroups);
+ this.bw.WriteBits(15, (uint) nSelectors);
+
+ byte[] selectorMtf = this.cstate.selectorMtf;
+
+ for (int i = 0; i < nSelectors; i++)
+ {
+ for (int j = 0, hj = selectorMtf[i] & 0xff; j < hj; j++)
+ {
+ this.bw.WriteBits(1, 1);
+ }
+
+ this.bw.WriteBits(1, 0);
+ }
+ }
+
+ private void sendMTFValues6(int nGroups, int alphaSize)
+ {
+ byte[][] len = this.cstate.sendMTFValues_len;
+
+ for (int t = 0; t < nGroups; t++)
+ {
+ byte[] len_t = len[t];
+ uint curr = (uint) (len_t[0] & 0xff);
+ this.bw.WriteBits(5, curr);
+
+ for (int i = 0; i < alphaSize; i++)
+ {
+ int lti = len_t[i] & 0xff;
+ while (curr < lti)
+ {
+ this.bw.WriteBits(2, 2U);
+ curr++; /* 10 */
+ }
+
+ while (curr > lti)
+ {
+ this.bw.WriteBits(2, 3U);
+ curr--; /* 11 */
+ }
+
+ this.bw.WriteBits(1, 0U);
+ }
+ }
+ }
+
+
+ private void sendMTFValues7(int nSelectors)
+ {
+ byte[][] len = this.cstate.sendMTFValues_len;
+ int[][] code = this.cstate.sendMTFValues_code;
+ byte[] selector = this.cstate.selector;
+ char[] sfmap = this.cstate.sfmap;
+ int nMTFShadow = this.nMTF;
+
+ int selCtr = 0;
+
+ for (int gs = 0; gs < nMTFShadow;)
+ {
+ int ge = Math.Min(gs + BZip2.G_SIZE - 1, nMTFShadow - 1);
+ int ix = selector[selCtr] & 0xff;
+ int[] code_selCtr = code[ix];
+ byte[] len_selCtr = len[ix];
+
+ while (gs <= ge)
+ {
+ int sfmap_i = sfmap[gs];
+ int n = len_selCtr[sfmap_i] & 0xFF;
+ this.bw.WriteBits(n, (uint) code_selCtr[sfmap_i]);
+ gs++;
+ }
+
+ gs = ge + 1;
+ selCtr++;
+ }
+ }
+
+ private void moveToFrontCodeAndSend()
+ {
+ this.bw.WriteBits(24, (uint) this.origPtr);
+ generateMTFValues();
+ sendMTFValues();
+ }
+
+
+
+
+
+
+ private class CompressionState
+ {
+ // with blockSize 900k
+ public readonly bool[] inUse = new bool[256]; // 256 byte
+ public readonly byte[] unseqToSeq = new byte[256]; // 256 byte
+ public readonly int[] mtfFreq = new int[BZip2.MaxAlphaSize]; // 1032 byte
+ public readonly byte[] selector = new byte[BZip2.MaxSelectors]; // 18002 byte
+ public readonly byte[] selectorMtf = new byte[BZip2.MaxSelectors]; // 18002 byte
+
+ public readonly byte[] generateMTFValues_yy = new byte[256]; // 256 byte
+ public byte[][] sendMTFValues_len;
+
+ // byte
+ public int[][] sendMTFValues_rfreq;
+
+ // byte
+ public readonly int[] sendMTFValues_fave = new int[BZip2.NGroups]; // 24 byte
+ public readonly short[] sendMTFValues_cost = new short[BZip2.NGroups]; // 12 byte
+ public int[][] sendMTFValues_code;
+
+ // byte
+ public readonly byte[] sendMTFValues2_pos = new byte[BZip2.NGroups]; // 6 byte
+ public readonly bool[] sentMTFValues4_inUse16 = new bool[16]; // 16 byte
+
+ public readonly int[] stack_ll = new int[BZip2.QSORT_STACK_SIZE]; // 4000 byte
+ public readonly int[] stack_hh = new int[BZip2.QSORT_STACK_SIZE]; // 4000 byte
+ public readonly int[] stack_dd = new int[BZip2.QSORT_STACK_SIZE]; // 4000 byte
+
+ public readonly int[] mainSort_runningOrder = new int[256]; // 1024 byte
+ public readonly int[] mainSort_copy = new int[256]; // 1024 byte
+ public readonly bool[] mainSort_bigDone = new bool[256]; // 256 byte
+
+ public int[] heap = new int[BZip2.MaxAlphaSize + 2]; // 1040 byte
+ public int[] weight = new int[BZip2.MaxAlphaSize * 2]; // 2064 byte
+ public int[] parent = new int[BZip2.MaxAlphaSize * 2]; // 2064 byte
+
+ public readonly int[] ftab = new int[65537]; // 262148 byte
+ // ------------
+ // 333408 byte
+
+ public byte[] block; // 900021 byte
+ public int[] fmap; // 3600000 byte
+ public char[] sfmap; // 3600000 byte
+
+ // ------------
+ // 8433529 byte
+ // ============
+
+ /**
+ * Array instance identical to sfmap, both are used only
+ * temporarily and independently, so we do not need to allocate
+ * additional memory.
+ */
+ public char[] quadrant;
+
+ public CompressionState(int blockSize100k)
+ {
+ int n = blockSize100k * BZip2.BlockSizeMultiple;
+ this.block = new byte[(n + 1 + BZip2.NUM_OVERSHOOT_BYTES)];
+ this.fmap = new int[n];
+ this.sfmap = new char[2 * n];
+ this.quadrant = this.sfmap;
+ this.sendMTFValues_len = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ this.sendMTFValues_rfreq = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ this.sendMTFValues_code = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ }
+
+ }
+
+
+
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/BZip2/BZip2InputStream.cs b/dotNetZip/BZip2/BZip2InputStream.cs
new file mode 100644
index 0000000..1c152d5
--- /dev/null
+++ b/dotNetZip/BZip2/BZip2InputStream.cs
@@ -0,0 +1,1447 @@
+// BZip2InputStream.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-July-31 11:57:32>
+//
+// ------------------------------------------------------------------
+//
+// This module defines the BZip2InputStream class, which is a decompressing
+// stream that handles BZIP2. This code is derived from Apache commons source code.
+// The license below applies to the original Apache code.
+//
+// ------------------------------------------------------------------
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+/*
+ * This package is based on the work done by Keiron Liddle, Aftex Software
+ * to whom the Ant project is very grateful for his
+ * great code.
+ */
+
+// compile: msbuild
+// not: csc.exe /t:library /debug+ /out:Ionic.BZip2.dll BZip2InputStream.cs BCRC32.cs Rand.cs
+
+
+
+using System;
+using System.IO;
+
+namespace Ionic.BZip2
+{
+
+ ///
+ /// A read-only decorator stream that performs BZip2 decompression on Read.
+ ///
+ public class BZip2InputStream : System.IO.Stream
+ {
+ bool _disposed;
+ bool _leaveOpen;
+ Int64 totalBytesRead;
+ private int last;
+
+ /* for undoing the Burrows-Wheeler transform */
+ private int origPtr;
+
+ // blockSize100k: 0 .. 9.
+ //
+ // This var name is a misnomer. The actual block size is 100000
+ // * blockSize100k. (not 100k * blocksize100k)
+ private int blockSize100k;
+ private bool blockRandomised;
+ private int bsBuff;
+ private int bsLive;
+ private readonly Ionic.Crc.CRC32 crc = new Ionic.Crc.CRC32(true);
+ private int nInUse;
+ private Stream input;
+ private int currentChar = -1;
+
+ ///
+ /// Compressor State
+ ///
+ enum CState
+ {
+ EOF = 0,
+ START_BLOCK = 1,
+ RAND_PART_A = 2,
+ RAND_PART_B = 3,
+ RAND_PART_C = 4,
+ NO_RAND_PART_A = 5,
+ NO_RAND_PART_B = 6,
+ NO_RAND_PART_C = 7,
+ }
+
+ private CState currentState = CState.START_BLOCK;
+
+ private uint storedBlockCRC, storedCombinedCRC;
+ private uint computedBlockCRC, computedCombinedCRC;
+
+ // Variables used by setup* methods exclusively
+ private int su_count;
+ private int su_ch2;
+ private int su_chPrev;
+ private int su_i2;
+ private int su_j2;
+ private int su_rNToGo;
+ private int su_rTPos;
+ private int su_tPos;
+ private char su_z;
+ private BZip2InputStream.DecompressionState data;
+
+
+ ///
+ /// Create a BZip2InputStream, wrapping it around the given input Stream.
+ ///
+ ///
+ ///
+ /// The input stream will be closed when the BZip2InputStream is closed.
+ ///
+ ///
+ /// The stream from which to read compressed data
+ public BZip2InputStream(Stream input)
+ : this(input, false)
+ {}
+
+
+ ///
+ /// Create a BZip2InputStream with the given stream, and
+ /// specifying whether to leave the wrapped stream open when
+ /// the BZip2InputStream is closed.
+ ///
+ /// The stream from which to read compressed data
+ ///
+ /// Whether to leave the input stream open, when the BZip2InputStream closes.
+ ///
+ ///
+ ///
+ ///
+ /// This example reads a bzip2-compressed file, decompresses it,
+ /// and writes the decompressed data into a newly created file.
+ ///
+ ///
+ /// var fname = "logfile.log.bz2";
+ /// using (var fs = File.OpenRead(fname))
+ /// {
+ /// using (var decompressor = new Ionic.BZip2.BZip2InputStream(fs))
+ /// {
+ /// var outFname = fname + ".decompressed";
+ /// using (var output = File.Create(outFname))
+ /// {
+ /// byte[] buffer = new byte[2048];
+ /// int n;
+ /// while ((n = decompressor.Read(buffer, 0, buffer.Length)) > 0)
+ /// {
+ /// output.Write(buffer, 0, n);
+ /// }
+ /// }
+ /// }
+ /// }
+ ///
+ ///
+ public BZip2InputStream(Stream input, bool leaveOpen)
+ : base()
+ {
+
+ this.input = input;
+ this._leaveOpen = leaveOpen;
+ init();
+ }
+
+ ///
+ /// Read data from the stream.
+ ///
+ ///
+ ///
+ ///
+ /// To decompress a BZip2 data stream, create a BZip2InputStream,
+ /// providing a stream that reads compressed data. Then call Read() on
+ /// that BZip2InputStream, and the data read will be decompressed
+ /// as you read.
+ ///
+ ///
+ ///
+ /// A BZip2InputStream can be used only for Read(), not for Write().
+ ///
+ ///
+ ///
+ /// The buffer into which the read data should be placed.
+ /// the offset within that data array to put the first byte read.
+ /// the number of bytes to read.
+ /// the number of bytes actually read
+ public override int Read(byte[] buffer, int offset, int count)
+ {
+ if (offset < 0)
+ throw new IndexOutOfRangeException(String.Format("offset ({0}) must be > 0", offset));
+
+ if (count < 0)
+ throw new IndexOutOfRangeException(String.Format("count ({0}) must be > 0", count));
+
+ if (offset + count > buffer.Length)
+ throw new IndexOutOfRangeException(String.Format("offset({0}) count({1}) bLength({2})",
+ offset, count, buffer.Length));
+
+ if (this.input == null)
+ throw new IOException("the stream is not open");
+
+
+ int hi = offset + count;
+ int destOffset = offset;
+ for (int b; (destOffset < hi) && ((b = ReadByte()) >= 0);)
+ {
+ buffer[destOffset++] = (byte) b;
+ }
+
+ return (destOffset == offset) ? -1 : (destOffset - offset);
+ }
+
+ private void MakeMaps()
+ {
+ bool[] inUse = this.data.inUse;
+ byte[] seqToUnseq = this.data.seqToUnseq;
+
+ int n = 0;
+
+ for (int i = 0; i < 256; i++)
+ {
+ if (inUse[i])
+ seqToUnseq[n++] = (byte) i;
+ }
+
+ this.nInUse = n;
+ }
+
+ ///
+ /// Read a single byte from the stream.
+ ///
+ /// the byte read from the stream, or -1 if EOF
+ public override int ReadByte()
+ {
+ int retChar = this.currentChar;
+ totalBytesRead++;
+ switch (this.currentState)
+ {
+ case CState.EOF:
+ return -1;
+
+ case CState.START_BLOCK:
+ throw new IOException("bad state");
+
+ case CState.RAND_PART_A:
+ throw new IOException("bad state");
+
+ case CState.RAND_PART_B:
+ SetupRandPartB();
+ break;
+
+ case CState.RAND_PART_C:
+ SetupRandPartC();
+ break;
+
+ case CState.NO_RAND_PART_A:
+ throw new IOException("bad state");
+
+ case CState.NO_RAND_PART_B:
+ SetupNoRandPartB();
+ break;
+
+ case CState.NO_RAND_PART_C:
+ SetupNoRandPartC();
+ break;
+
+ default:
+ throw new IOException("bad state");
+ }
+
+ return retChar;
+ }
+
+
+
+
+ ///
+ /// Indicates whether the stream can be read.
+ ///
+ ///
+ /// The return value depends on whether the captive stream supports reading.
+ ///
+ public override bool CanRead
+ {
+ get
+ {
+ if (_disposed) throw new ObjectDisposedException("BZip2Stream");
+ return this.input.CanRead;
+ }
+ }
+
+
+ ///
+ /// Indicates whether the stream supports Seek operations.
+ ///
+ ///
+ /// Always returns false.
+ ///
+ public override bool CanSeek
+ {
+ get { return false; }
+ }
+
+
+ ///
+ /// Indicates whether the stream can be written.
+ ///
+ ///
+ /// The return value depends on whether the captive stream supports writing.
+ ///
+ public override bool CanWrite
+ {
+ get
+ {
+ if (_disposed) throw new ObjectDisposedException("BZip2Stream");
+ return input.CanWrite;
+ }
+ }
+
+ ///
+ /// Flush the stream.
+ ///
+ public override void Flush()
+ {
+ if (_disposed) throw new ObjectDisposedException("BZip2Stream");
+ input.Flush();
+ }
+
+ ///
+ /// Reading this property always throws a .
+ ///
+ public override long Length
+ {
+ get { throw new NotImplementedException(); }
+ }
+
+ ///
+ /// The position of the stream pointer.
+ ///
+ ///
+ ///
+ /// Setting this property always throws a . Reading will return the
+ /// total number of uncompressed bytes read in.
+ ///
+ public override long Position
+ {
+ get
+ {
+ return this.totalBytesRead;
+ }
+ set { throw new NotImplementedException(); }
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this is irrelevant, since it will always throw!
+ /// this is irrelevant, since it will always throw!
+ /// irrelevant!
+ public override long Seek(long offset, System.IO.SeekOrigin origin)
+ {
+ throw new NotImplementedException();
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this is irrelevant, since it will always throw!
+ public override void SetLength(long value)
+ {
+ throw new NotImplementedException();
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this parameter is never used
+ /// this parameter is never used
+ /// this parameter is never used
+ public override void Write(byte[] buffer, int offset, int count)
+ {
+ throw new NotImplementedException();
+ }
+
+
+ ///
+ /// Dispose the stream.
+ ///
+ ///
+ /// indicates whether the Dispose method was invoked by user code.
+ ///
+ protected override void Dispose(bool disposing)
+ {
+ try
+ {
+ if (!_disposed)
+ {
+ if (disposing && (this.input != null))
+ this.input.Close();
+ _disposed = true;
+ }
+ }
+ finally
+ {
+ base.Dispose(disposing);
+ }
+ }
+
+
+ void init()
+ {
+ if (null == this.input)
+ throw new IOException("No input Stream");
+
+ if (!this.input.CanRead)
+ throw new IOException("Unreadable input Stream");
+
+ CheckMagicChar('B', 0);
+ CheckMagicChar('Z', 1);
+ CheckMagicChar('h', 2);
+
+ int blockSize = this.input.ReadByte();
+
+ if ((blockSize < '1') || (blockSize > '9'))
+ throw new IOException("Stream is not BZip2 formatted: illegal "
+ + "blocksize " + (char) blockSize);
+
+ this.blockSize100k = blockSize - '0';
+
+ InitBlock();
+ SetupBlock();
+ }
+
+
+ void CheckMagicChar(char expected, int position)
+ {
+ int magic = this.input.ReadByte();
+ if (magic != (int)expected)
+ {
+ var msg = String.Format("Not a valid BZip2 stream. byte {0}, expected '{1}', got '{2}'",
+ position, (int)expected, magic);
+ throw new IOException(msg);
+ }
+ }
+
+
+ void InitBlock()
+ {
+ char magic0 = bsGetUByte();
+ char magic1 = bsGetUByte();
+ char magic2 = bsGetUByte();
+ char magic3 = bsGetUByte();
+ char magic4 = bsGetUByte();
+ char magic5 = bsGetUByte();
+
+ if (magic0 == 0x17 && magic1 == 0x72 && magic2 == 0x45
+ && magic3 == 0x38 && magic4 == 0x50 && magic5 == 0x90)
+ {
+ complete(); // end of file
+ }
+ else if (magic0 != 0x31 ||
+ magic1 != 0x41 ||
+ magic2 != 0x59 ||
+ magic3 != 0x26 ||
+ magic4 != 0x53 ||
+ magic5 != 0x59)
+ {
+ this.currentState = CState.EOF;
+ var msg = String.Format("bad block header at offset 0x{0:X}",
+ this.input.Position);
+ throw new IOException(msg);
+ }
+ else
+ {
+ this.storedBlockCRC = bsGetInt();
+ // Console.WriteLine(" stored block CRC : {0:X8}", this.storedBlockCRC);
+
+ this.blockRandomised = (GetBits(1) == 1);
+
+ // Lazily allocate data
+ if (this.data == null)
+ this.data = new DecompressionState(this.blockSize100k);
+
+ // currBlockNo++;
+ getAndMoveToFrontDecode();
+
+ this.crc.Reset();
+ this.currentState = CState.START_BLOCK;
+ }
+ }
+
+
+ private void EndBlock()
+ {
+ this.computedBlockCRC = (uint)this.crc.Crc32Result;
+
+ // A bad CRC is considered a fatal error.
+ if (this.storedBlockCRC != this.computedBlockCRC)
+ {
+ // make next blocks readable without error
+ // (repair feature, not yet documented, not tested)
+ // this.computedCombinedCRC = (this.storedCombinedCRC << 1)
+ // | (this.storedCombinedCRC >> 31);
+ // this.computedCombinedCRC ^= this.storedBlockCRC;
+
+ var msg = String.Format("BZip2 CRC error (expected {0:X8}, computed {1:X8})",
+ this.storedBlockCRC, this.computedBlockCRC);
+ throw new IOException(msg);
+ }
+
+ // Console.WriteLine(" combined CRC (before): {0:X8}", this.computedCombinedCRC);
+ this.computedCombinedCRC = (this.computedCombinedCRC << 1)
+ | (this.computedCombinedCRC >> 31);
+ this.computedCombinedCRC ^= this.computedBlockCRC;
+ // Console.WriteLine(" computed block CRC : {0:X8}", this.computedBlockCRC);
+ // Console.WriteLine(" combined CRC (after) : {0:X8}", this.computedCombinedCRC);
+ // Console.WriteLine();
+ }
+
+
+ private void complete()
+ {
+ this.storedCombinedCRC = bsGetInt();
+ this.currentState = CState.EOF;
+ this.data = null;
+
+ if (this.storedCombinedCRC != this.computedCombinedCRC)
+ {
+ var msg = String.Format("BZip2 CRC error (expected {0:X8}, computed {1:X8})",
+ this.storedCombinedCRC, this.computedCombinedCRC);
+
+ throw new IOException(msg);
+ }
+ }
+
+ ///
+ /// Close the stream.
+ ///
+ public override void Close()
+ {
+ Stream inShadow = this.input;
+ if (inShadow != null)
+ {
+ try
+ {
+ if (!this._leaveOpen)
+ inShadow.Close();
+ }
+ finally
+ {
+ this.data = null;
+ this.input = null;
+ }
+ }
+ }
+
+
+ ///
+ /// Read n bits from input, right justifying the result.
+ ///
+ ///
+ ///
+ /// For example, if you read 1 bit, the result is either 0
+ /// or 1.
+ ///
+ ///
+ ///
+ /// The number of bits to read, always between 1 and 32.
+ ///
+ private int GetBits(int n)
+ {
+ int bsLiveShadow = this.bsLive;
+ int bsBuffShadow = this.bsBuff;
+
+ if (bsLiveShadow < n)
+ {
+ do
+ {
+ int thech = this.input.ReadByte();
+
+ if (thech < 0)
+ throw new IOException("unexpected end of stream");
+
+ // Console.WriteLine("R {0:X2}", thech);
+
+ bsBuffShadow = (bsBuffShadow << 8) | thech;
+ bsLiveShadow += 8;
+ } while (bsLiveShadow < n);
+
+ this.bsBuff = bsBuffShadow;
+ }
+
+ this.bsLive = bsLiveShadow - n;
+ return (bsBuffShadow >> (bsLiveShadow - n)) & ((1 << n) - 1);
+ }
+
+
+ // private bool bsGetBit()
+ // {
+ // int bsLiveShadow = this.bsLive;
+ // int bsBuffShadow = this.bsBuff;
+ //
+ // if (bsLiveShadow < 1)
+ // {
+ // int thech = this.input.ReadByte();
+ //
+ // if (thech < 0)
+ // {
+ // throw new IOException("unexpected end of stream");
+ // }
+ //
+ // bsBuffShadow = (bsBuffShadow << 8) | thech;
+ // bsLiveShadow += 8;
+ // this.bsBuff = bsBuffShadow;
+ // }
+ //
+ // this.bsLive = bsLiveShadow - 1;
+ // return ((bsBuffShadow >> (bsLiveShadow - 1)) & 1) != 0;
+ // }
+
+ private bool bsGetBit()
+ {
+ int bit = GetBits(1);
+ return bit != 0;
+ }
+
+ private char bsGetUByte()
+ {
+ return (char) GetBits(8);
+ }
+
+ private uint bsGetInt()
+ {
+ return (uint)((((((GetBits(8) << 8) | GetBits(8)) << 8) | GetBits(8)) << 8) | GetBits(8));
+ }
+
+
+ /**
+ * Called by createHuffmanDecodingTables() exclusively.
+ */
+ private static void hbCreateDecodeTables(int[] limit,
+ int[] bbase, int[] perm, char[] length,
+ int minLen, int maxLen, int alphaSize)
+ {
+ for (int i = minLen, pp = 0; i <= maxLen; i++)
+ {
+ for (int j = 0; j < alphaSize; j++)
+ {
+ if (length[j] == i)
+ {
+ perm[pp++] = j;
+ }
+ }
+ }
+
+ for (int i = BZip2.MaxCodeLength; --i > 0;)
+ {
+ bbase[i] = 0;
+ limit[i] = 0;
+ }
+
+ for (int i = 0; i < alphaSize; i++)
+ {
+ bbase[length[i] + 1]++;
+ }
+
+ for (int i = 1, b = bbase[0]; i < BZip2.MaxCodeLength; i++)
+ {
+ b += bbase[i];
+ bbase[i] = b;
+ }
+
+ for (int i = minLen, vec = 0, b = bbase[i]; i <= maxLen; i++)
+ {
+ int nb = bbase[i + 1];
+ vec += nb - b;
+ b = nb;
+ limit[i] = vec - 1;
+ vec <<= 1;
+ }
+
+ for (int i = minLen + 1; i <= maxLen; i++)
+ {
+ bbase[i] = ((limit[i - 1] + 1) << 1) - bbase[i];
+ }
+ }
+
+
+
+ private void recvDecodingTables()
+ {
+ var s = this.data;
+ bool[] inUse = s.inUse;
+ byte[] pos = s.recvDecodingTables_pos;
+ //byte[] selector = s.selector;
+
+ int inUse16 = 0;
+
+ /* Receive the mapping table */
+ for (int i = 0; i < 16; i++)
+ {
+ if (bsGetBit())
+ {
+ inUse16 |= 1 << i;
+ }
+ }
+
+ for (int i = 256; --i >= 0;)
+ {
+ inUse[i] = false;
+ }
+
+ for (int i = 0; i < 16; i++)
+ {
+ if ((inUse16 & (1 << i)) != 0)
+ {
+ int i16 = i << 4;
+ for (int j = 0; j < 16; j++)
+ {
+ if (bsGetBit())
+ {
+ inUse[i16 + j] = true;
+ }
+ }
+ }
+ }
+
+ MakeMaps();
+ int alphaSize = this.nInUse + 2;
+
+ /* Now the selectors */
+ int nGroups = GetBits(3);
+ int nSelectors = GetBits(15);
+
+ for (int i = 0; i < nSelectors; i++)
+ {
+ int j = 0;
+ while (bsGetBit())
+ {
+ j++;
+ }
+ s.selectorMtf[i] = (byte) j;
+ }
+
+ /* Undo the MTF values for the selectors. */
+ for (int v = nGroups; --v >= 0;)
+ {
+ pos[v] = (byte) v;
+ }
+
+ for (int i = 0; i < nSelectors; i++)
+ {
+ int v = s.selectorMtf[i];
+ byte tmp = pos[v];
+ while (v > 0)
+ {
+ // nearly all times v is zero, 4 in most other cases
+ pos[v] = pos[v - 1];
+ v--;
+ }
+ pos[0] = tmp;
+ s.selector[i] = tmp;
+ }
+
+ char[][] len = s.temp_charArray2d;
+
+ /* Now the coding tables */
+ for (int t = 0; t < nGroups; t++)
+ {
+ int curr = GetBits(5);
+ char[] len_t = len[t];
+ for (int i = 0; i < alphaSize; i++)
+ {
+ while (bsGetBit())
+ {
+ curr += bsGetBit() ? -1 : 1;
+ }
+ len_t[i] = (char) curr;
+ }
+ }
+
+ // finally create the Huffman tables
+ createHuffmanDecodingTables(alphaSize, nGroups);
+ }
+
+
+ /**
+ * Called by recvDecodingTables() exclusively.
+ */
+ private void createHuffmanDecodingTables(int alphaSize,
+ int nGroups)
+ {
+ var s = this.data;
+ char[][] len = s.temp_charArray2d;
+
+ for (int t = 0; t < nGroups; t++)
+ {
+ int minLen = 32;
+ int maxLen = 0;
+ char[] len_t = len[t];
+ for (int i = alphaSize; --i >= 0;)
+ {
+ char lent = len_t[i];
+ if (lent > maxLen)
+ maxLen = lent;
+
+ if (lent < minLen)
+ minLen = lent;
+ }
+ hbCreateDecodeTables(s.gLimit[t], s.gBase[t], s.gPerm[t], len[t], minLen,
+ maxLen, alphaSize);
+ s.gMinlen[t] = minLen;
+ }
+ }
+
+
+
+ private void getAndMoveToFrontDecode()
+ {
+ var s = this.data;
+ this.origPtr = GetBits(24);
+
+ if (this.origPtr < 0)
+ throw new IOException("BZ_DATA_ERROR");
+ if (this.origPtr > 10 + BZip2.BlockSizeMultiple * this.blockSize100k)
+ throw new IOException("BZ_DATA_ERROR");
+
+ recvDecodingTables();
+
+ byte[] yy = s.getAndMoveToFrontDecode_yy;
+ int limitLast = this.blockSize100k * BZip2.BlockSizeMultiple;
+
+ /*
+ * Setting up the unzftab entries here is not strictly necessary, but it
+ * does save having to do it later in a separate pass, and so saves a
+ * block's worth of cache misses.
+ */
+ for (int i = 256; --i >= 0;)
+ {
+ yy[i] = (byte) i;
+ s.unzftab[i] = 0;
+ }
+
+ int groupNo = 0;
+ int groupPos = BZip2.G_SIZE - 1;
+ int eob = this.nInUse + 1;
+ int nextSym = getAndMoveToFrontDecode0(0);
+ int bsBuffShadow = this.bsBuff;
+ int bsLiveShadow = this.bsLive;
+ int lastShadow = -1;
+ int zt = s.selector[groupNo] & 0xff;
+ int[] base_zt = s.gBase[zt];
+ int[] limit_zt = s.gLimit[zt];
+ int[] perm_zt = s.gPerm[zt];
+ int minLens_zt = s.gMinlen[zt];
+
+ while (nextSym != eob)
+ {
+ if ((nextSym == BZip2.RUNA) || (nextSym == BZip2.RUNB))
+ {
+ int es = -1;
+
+ for (int n = 1; true; n <<= 1)
+ {
+ if (nextSym == BZip2.RUNA)
+ {
+ es += n;
+ }
+ else if (nextSym == BZip2.RUNB)
+ {
+ es += n << 1;
+ }
+ else
+ {
+ break;
+ }
+
+ if (groupPos == 0)
+ {
+ groupPos = BZip2.G_SIZE - 1;
+ zt = s.selector[++groupNo] & 0xff;
+ base_zt = s.gBase[zt];
+ limit_zt = s.gLimit[zt];
+ perm_zt = s.gPerm[zt];
+ minLens_zt = s.gMinlen[zt];
+ }
+ else
+ {
+ groupPos--;
+ }
+
+ int zn = minLens_zt;
+
+ // Inlined:
+ // int zvec = GetBits(zn);
+ while (bsLiveShadow < zn)
+ {
+ int thech = this.input.ReadByte();
+ if (thech >= 0)
+ {
+ bsBuffShadow = (bsBuffShadow << 8) | thech;
+ bsLiveShadow += 8;
+ continue;
+ }
+ else
+ {
+ throw new IOException("unexpected end of stream");
+ }
+ }
+ int zvec = (bsBuffShadow >> (bsLiveShadow - zn))
+ & ((1 << zn) - 1);
+ bsLiveShadow -= zn;
+
+ while (zvec > limit_zt[zn])
+ {
+ zn++;
+ while (bsLiveShadow < 1)
+ {
+ int thech = this.input.ReadByte();
+ if (thech >= 0)
+ {
+ bsBuffShadow = (bsBuffShadow << 8) | thech;
+ bsLiveShadow += 8;
+ continue;
+ }
+ else
+ {
+ throw new IOException("unexpected end of stream");
+ }
+ }
+ bsLiveShadow--;
+ zvec = (zvec << 1)
+ | ((bsBuffShadow >> bsLiveShadow) & 1);
+ }
+ nextSym = perm_zt[zvec - base_zt[zn]];
+ }
+
+ byte ch = s.seqToUnseq[yy[0]];
+ s.unzftab[ch & 0xff] += es + 1;
+
+ while (es-- >= 0)
+ {
+ s.ll8[++lastShadow] = ch;
+ }
+
+ if (lastShadow >= limitLast)
+ throw new IOException("block overrun");
+ }
+ else
+ {
+ if (++lastShadow >= limitLast)
+ throw new IOException("block overrun");
+
+ byte tmp = yy[nextSym - 1];
+ s.unzftab[s.seqToUnseq[tmp] & 0xff]++;
+ s.ll8[lastShadow] = s.seqToUnseq[tmp];
+
+ /*
+ * This loop is hammered during decompression, hence avoid
+ * native method call overhead of System.Buffer.BlockCopy for very
+ * small ranges to copy.
+ */
+ if (nextSym <= 16)
+ {
+ for (int j = nextSym - 1; j > 0;)
+ {
+ yy[j] = yy[--j];
+ }
+ }
+ else
+ {
+ System.Buffer.BlockCopy(yy, 0, yy, 1, nextSym - 1);
+ }
+
+ yy[0] = tmp;
+
+ if (groupPos == 0)
+ {
+ groupPos = BZip2.G_SIZE - 1;
+ zt = s.selector[++groupNo] & 0xff;
+ base_zt = s.gBase[zt];
+ limit_zt = s.gLimit[zt];
+ perm_zt = s.gPerm[zt];
+ minLens_zt = s.gMinlen[zt];
+ }
+ else
+ {
+ groupPos--;
+ }
+
+ int zn = minLens_zt;
+
+ // Inlined:
+ // int zvec = GetBits(zn);
+ while (bsLiveShadow < zn)
+ {
+ int thech = this.input.ReadByte();
+ if (thech >= 0)
+ {
+ bsBuffShadow = (bsBuffShadow << 8) | thech;
+ bsLiveShadow += 8;
+ continue;
+ }
+ else
+ {
+ throw new IOException("unexpected end of stream");
+ }
+ }
+ int zvec = (bsBuffShadow >> (bsLiveShadow - zn))
+ & ((1 << zn) - 1);
+ bsLiveShadow -= zn;
+
+ while (zvec > limit_zt[zn])
+ {
+ zn++;
+ while (bsLiveShadow < 1)
+ {
+ int thech = this.input.ReadByte();
+ if (thech >= 0)
+ {
+ bsBuffShadow = (bsBuffShadow << 8) | thech;
+ bsLiveShadow += 8;
+ continue;
+ }
+ else
+ {
+ throw new IOException("unexpected end of stream");
+ }
+ }
+ bsLiveShadow--;
+ zvec = (zvec << 1) | ((bsBuffShadow >> bsLiveShadow) & 1);
+ }
+ nextSym = perm_zt[zvec - base_zt[zn]];
+ }
+ }
+
+ this.last = lastShadow;
+ this.bsLive = bsLiveShadow;
+ this.bsBuff = bsBuffShadow;
+ }
+
+
+ private int getAndMoveToFrontDecode0(int groupNo)
+ {
+ var s = this.data;
+ int zt = s.selector[groupNo] & 0xff;
+ int[] limit_zt = s.gLimit[zt];
+ int zn = s.gMinlen[zt];
+ int zvec = GetBits(zn);
+ int bsLiveShadow = this.bsLive;
+ int bsBuffShadow = this.bsBuff;
+
+ while (zvec > limit_zt[zn])
+ {
+ zn++;
+ while (bsLiveShadow < 1)
+ {
+ int thech = this.input.ReadByte();
+
+ if (thech >= 0)
+ {
+ bsBuffShadow = (bsBuffShadow << 8) | thech;
+ bsLiveShadow += 8;
+ continue;
+ }
+ else
+ {
+ throw new IOException("unexpected end of stream");
+ }
+ }
+ bsLiveShadow--;
+ zvec = (zvec << 1) | ((bsBuffShadow >> bsLiveShadow) & 1);
+ }
+
+ this.bsLive = bsLiveShadow;
+ this.bsBuff = bsBuffShadow;
+
+ return s.gPerm[zt][zvec - s.gBase[zt][zn]];
+ }
+
+
+ private void SetupBlock()
+ {
+ if (this.data == null)
+ return;
+
+ int i;
+ var s = this.data;
+ int[] tt = s.initTT(this.last + 1);
+
+ // xxxx
+
+ /* Check: unzftab entries in range. */
+ for (i = 0; i <= 255; i++)
+ {
+ if (s.unzftab[i] < 0 || s.unzftab[i] > this.last)
+ throw new Exception("BZ_DATA_ERROR");
+ }
+
+ /* Actually generate cftab. */
+ s.cftab[0] = 0;
+ for (i = 1; i <= 256; i++) s.cftab[i] = s.unzftab[i-1];
+ for (i = 1; i <= 256; i++) s.cftab[i] += s.cftab[i-1];
+ /* Check: cftab entries in range. */
+ for (i = 0; i <= 256; i++)
+ {
+ if (s.cftab[i] < 0 || s.cftab[i] > this.last+1)
+ {
+ var msg = String.Format("BZ_DATA_ERROR: cftab[{0}]={1} last={2}",
+ i, s.cftab[i], this.last);
+ throw new Exception(msg);
+ }
+ }
+ /* Check: cftab entries non-descending. */
+ for (i = 1; i <= 256; i++)
+ {
+ if (s.cftab[i-1] > s.cftab[i])
+ throw new Exception("BZ_DATA_ERROR");
+ }
+
+ int lastShadow;
+ for (i = 0, lastShadow = this.last; i <= lastShadow; i++)
+ {
+ tt[s.cftab[s.ll8[i] & 0xff]++] = i;
+ }
+
+ if ((this.origPtr < 0) || (this.origPtr >= tt.Length))
+ throw new IOException("stream corrupted");
+
+ this.su_tPos = tt[this.origPtr];
+ this.su_count = 0;
+ this.su_i2 = 0;
+ this.su_ch2 = 256; /* not a valid 8-bit byte value?, and not EOF */
+
+ if (this.blockRandomised)
+ {
+ this.su_rNToGo = 0;
+ this.su_rTPos = 0;
+ SetupRandPartA();
+ }
+ else
+ {
+ SetupNoRandPartA();
+ }
+ }
+
+
+
+ private void SetupRandPartA()
+ {
+ if (this.su_i2 <= this.last)
+ {
+ this.su_chPrev = this.su_ch2;
+ int su_ch2Shadow = this.data.ll8[this.su_tPos] & 0xff;
+ this.su_tPos = this.data.tt[this.su_tPos];
+ if (this.su_rNToGo == 0)
+ {
+ this.su_rNToGo = Rand.Rnums(this.su_rTPos) - 1;
+ if (++this.su_rTPos == 512)
+ {
+ this.su_rTPos = 0;
+ }
+ }
+ else
+ {
+ this.su_rNToGo--;
+ }
+ this.su_ch2 = su_ch2Shadow ^= (this.su_rNToGo == 1) ? 1 : 0;
+ this.su_i2++;
+ this.currentChar = su_ch2Shadow;
+ this.currentState = CState.RAND_PART_B;
+ this.crc.UpdateCRC((byte)su_ch2Shadow);
+ }
+ else
+ {
+ EndBlock();
+ InitBlock();
+ SetupBlock();
+ }
+ }
+
+ private void SetupNoRandPartA()
+ {
+ if (this.su_i2 <= this.last)
+ {
+ this.su_chPrev = this.su_ch2;
+ int su_ch2Shadow = this.data.ll8[this.su_tPos] & 0xff;
+ this.su_ch2 = su_ch2Shadow;
+ this.su_tPos = this.data.tt[this.su_tPos];
+ this.su_i2++;
+ this.currentChar = su_ch2Shadow;
+ this.currentState = CState.NO_RAND_PART_B;
+ this.crc.UpdateCRC((byte)su_ch2Shadow);
+ }
+ else
+ {
+ this.currentState = CState.NO_RAND_PART_A;
+ EndBlock();
+ InitBlock();
+ SetupBlock();
+ }
+ }
+
+ private void SetupRandPartB()
+ {
+ if (this.su_ch2 != this.su_chPrev)
+ {
+ this.currentState = CState.RAND_PART_A;
+ this.su_count = 1;
+ SetupRandPartA();
+ }
+ else if (++this.su_count >= 4)
+ {
+ this.su_z = (char) (this.data.ll8[this.su_tPos] & 0xff);
+ this.su_tPos = this.data.tt[this.su_tPos];
+ if (this.su_rNToGo == 0)
+ {
+ this.su_rNToGo = Rand.Rnums(this.su_rTPos) - 1;
+ if (++this.su_rTPos == 512)
+ {
+ this.su_rTPos = 0;
+ }
+ }
+ else
+ {
+ this.su_rNToGo--;
+ }
+ this.su_j2 = 0;
+ this.currentState = CState.RAND_PART_C;
+ if (this.su_rNToGo == 1)
+ {
+ this.su_z ^= (char)1;
+ }
+ SetupRandPartC();
+ }
+ else
+ {
+ this.currentState = CState.RAND_PART_A;
+ SetupRandPartA();
+ }
+ }
+
+ private void SetupRandPartC()
+ {
+ if (this.su_j2 < this.su_z)
+ {
+ this.currentChar = this.su_ch2;
+ this.crc.UpdateCRC((byte)this.su_ch2);
+ this.su_j2++;
+ }
+ else
+ {
+ this.currentState = CState.RAND_PART_A;
+ this.su_i2++;
+ this.su_count = 0;
+ SetupRandPartA();
+ }
+ }
+
+ private void SetupNoRandPartB()
+ {
+ if (this.su_ch2 != this.su_chPrev)
+ {
+ this.su_count = 1;
+ SetupNoRandPartA();
+ }
+ else if (++this.su_count >= 4)
+ {
+ this.su_z = (char) (this.data.ll8[this.su_tPos] & 0xff);
+ this.su_tPos = this.data.tt[this.su_tPos];
+ this.su_j2 = 0;
+ SetupNoRandPartC();
+ }
+ else
+ {
+ SetupNoRandPartA();
+ }
+ }
+
+ private void SetupNoRandPartC()
+ {
+ if (this.su_j2 < this.su_z)
+ {
+ int su_ch2Shadow = this.su_ch2;
+ this.currentChar = su_ch2Shadow;
+ this.crc.UpdateCRC((byte)su_ch2Shadow);
+ this.su_j2++;
+ this.currentState = CState.NO_RAND_PART_C;
+ }
+ else
+ {
+ this.su_i2++;
+ this.su_count = 0;
+ SetupNoRandPartA();
+ }
+ }
+
+ private sealed class DecompressionState
+ {
+ // (with blockSize 900k)
+ readonly public bool[] inUse = new bool[256];
+ readonly public byte[] seqToUnseq = new byte[256]; // 256 byte
+ readonly public byte[] selector = new byte[BZip2.MaxSelectors]; // 18002 byte
+ readonly public byte[] selectorMtf = new byte[BZip2.MaxSelectors]; // 18002 byte
+
+ /**
+ * Freq table collected to save a pass over the data during
+ * decompression.
+ */
+ public readonly int[] unzftab;
+ public readonly int[][] gLimit;
+ public readonly int[][] gBase;
+ public readonly int[][] gPerm;
+ public readonly int[] gMinlen;
+
+ public readonly int[] cftab;
+ public readonly byte[] getAndMoveToFrontDecode_yy;
+ public readonly char[][] temp_charArray2d;
+ public readonly byte[] recvDecodingTables_pos;
+ // ---------------
+ // 60798 byte
+
+ public int[] tt; // 3600000 byte
+ public byte[] ll8; // 900000 byte
+
+ // ---------------
+ // 4560782 byte
+ // ===============
+
+ public DecompressionState(int blockSize100k)
+ {
+ this.unzftab = new int[256]; // 1024 byte
+
+ this.gLimit = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ this.gBase = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ this.gPerm = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ this.gMinlen = new int[BZip2.NGroups]; // 24 byte
+
+ this.cftab = new int[257]; // 1028 byte
+ this.getAndMoveToFrontDecode_yy = new byte[256]; // 512 byte
+ this.temp_charArray2d = BZip2.InitRectangularArray(BZip2.NGroups,BZip2.MaxAlphaSize);
+ this.recvDecodingTables_pos = new byte[BZip2.NGroups]; // 6 byte
+
+ this.ll8 = new byte[blockSize100k * BZip2.BlockSizeMultiple];
+ }
+
+ /**
+ * Initializes the tt array.
+ *
+ * This method is called when the required length of the array is known.
+ * I don't initialize it at construction time to avoid unneccessary
+ * memory allocation when compressing small files.
+ */
+ public int[] initTT(int length)
+ {
+ int[] ttShadow = this.tt;
+
+ // tt.length should always be >= length, but theoretically
+ // it can happen, if the compressor mixed small and large
+ // blocks. Normally only the last block will be smaller
+ // than others.
+ if ((ttShadow == null) || (ttShadow.Length < length))
+ {
+ this.tt = ttShadow = new int[length];
+ }
+
+ return ttShadow;
+ }
+ }
+
+
+ }
+
+ // /**
+ // * Checks if the signature matches what is expected for a bzip2 file.
+ // *
+ // * @param signature
+ // * the bytes to check
+ // * @param length
+ // * the number of bytes to check
+ // * @return true, if this stream is a bzip2 compressed stream, false otherwise
+ // *
+ // * @since Apache Commons Compress 1.1
+ // */
+ // public static boolean MatchesSig(byte[] signature)
+ // {
+ // if ((signature.Length < 3) ||
+ // (signature[0] != 'B') ||
+ // (signature[1] != 'Z') ||
+ // (signature[2] != 'h'))
+ // return false;
+ //
+ // return true;
+ // }
+
+
+ internal static class BZip2
+ {
+ internal static T[][] InitRectangularArray(int d1, int d2)
+ {
+ var x = new T[d1][];
+ for (int i=0; i < d1; i++)
+ {
+ x[i] = new T[d2];
+ }
+ return x;
+ }
+
+ public static readonly int BlockSizeMultiple = 100000;
+ public static readonly int MinBlockSize = 1;
+ public static readonly int MaxBlockSize = 9;
+ public static readonly int MaxAlphaSize = 258;
+ public static readonly int MaxCodeLength = 23;
+ public static readonly char RUNA = (char) 0;
+ public static readonly char RUNB = (char) 1;
+ public static readonly int NGroups = 6;
+ public static readonly int G_SIZE = 50;
+ public static readonly int N_ITERS = 4;
+ public static readonly int MaxSelectors = (2 + (900000 / G_SIZE));
+ public static readonly int NUM_OVERSHOOT_BYTES = 20;
+ /*
+ *
If you are ever unlucky/improbable enough to get a stack
+ * overflow whilst sorting, increase the following constant and
+ * try again. In practice I have never seen the stack go above 27
+ * elems, so the following limit seems very generous.
+ */
+ internal static readonly int QSORT_STACK_SIZE = 1000;
+
+
+ }
+
+}
\ No newline at end of file
diff --git a/dotNetZip/BZip2/BZip2OutputStream.cs b/dotNetZip/BZip2/BZip2OutputStream.cs
new file mode 100644
index 0000000..74dce3c
--- /dev/null
+++ b/dotNetZip/BZip2/BZip2OutputStream.cs
@@ -0,0 +1,530 @@
+//#define Trace
+
+// BZip2OutputStream.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-August-02 16:44:11>
+//
+// ------------------------------------------------------------------
+//
+// This module defines the BZip2OutputStream class, which is a
+// compressing stream that handles BZIP2. This code may have been
+// derived in part from Apache commons source code. The license below
+// applies to the original Apache code.
+//
+// ------------------------------------------------------------------
+// flymake: csc.exe /t:module BZip2InputStream.cs BZip2Compressor.cs Rand.cs BCRC32.cs @@FILE@@
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+
+// Design Notes:
+//
+// This class follows the classic Decorator pattern: it is a Stream that
+// wraps itself around a Stream, and in doing so provides bzip2
+// compression as callers Write into it.
+//
+// BZip2 is a straightforward data format: there are 4 magic bytes at
+// the top of the file, followed by 1 or more compressed blocks. There
+// is a small "magic byte" trailer after all compressed blocks. This
+// class emits the magic bytes for the header and trailer, and relies on
+// a BZip2Compressor to generate each of the compressed data blocks.
+//
+// BZip2 does byte-shredding - it uses partial fractions of bytes to
+// represent independent pieces of information. This class relies on the
+// BitWriter to adapt the bit-oriented BZip2 output to the byte-oriented
+// model of the .NET Stream class.
+//
+// ----
+//
+// Regarding the Apache code base: Most of the code in this particular
+// class is related to stream operations, and is my own code. It largely
+// does not rely on any code obtained from Apache commons. If you
+// compare this code with the Apache commons BZip2OutputStream, you will
+// see very little code that is common, except for the
+// nearly-boilerplate structure that is common to all subtypes of
+// System.IO.Stream. There may be some small remnants of code in this
+// module derived from the Apache stuff, which is why I left the license
+// in here. Most of the Apache commons compressor magic has been ported
+// into the BZip2Compressor class.
+//
+
+using System;
+using System.IO;
+
+
+namespace Ionic.BZip2
+{
+ ///
+ /// A write-only decorator stream that compresses data as it is
+ /// written using the BZip2 algorithm.
+ ///
+ public class BZip2OutputStream : System.IO.Stream
+ {
+ int totalBytesWrittenIn;
+ bool leaveOpen;
+ BZip2Compressor compressor;
+ uint combinedCRC;
+ Stream output;
+ BitWriter bw;
+ int blockSize100k; // 0...9
+
+ private TraceBits desiredTrace = TraceBits.Crc | TraceBits.Write;
+
+ ///
+ /// Constructs a new BZip2OutputStream, that sends its
+ /// compressed output to the given output stream.
+ ///
+ ///
+ ///
+ /// The destination stream, to which compressed output will be sent.
+ ///
+ ///
+ ///
+ ///
+ /// This example reads a file, then compresses it with bzip2 file,
+ /// and writes the compressed data into a newly created file.
+ ///
+ ///
+ /// var fname = "logfile.log";
+ /// using (var fs = File.OpenRead(fname))
+ /// {
+ /// var outFname = fname + ".bz2";
+ /// using (var output = File.Create(outFname))
+ /// {
+ /// using (var compressor = new Ionic.BZip2.BZip2OutputStream(output))
+ /// {
+ /// byte[] buffer = new byte[2048];
+ /// int n;
+ /// while ((n = fs.Read(buffer, 0, buffer.Length)) > 0)
+ /// {
+ /// compressor.Write(buffer, 0, n);
+ /// }
+ /// }
+ /// }
+ /// }
+ ///
+ ///
+ public BZip2OutputStream(Stream output)
+ : this(output, BZip2.MaxBlockSize, false)
+ {
+ }
+
+
+ ///
+ /// Constructs a new BZip2OutputStream with specified blocksize.
+ ///
+ /// the destination stream.
+ ///
+ /// The blockSize in units of 100000 bytes.
+ /// The valid range is 1..9.
+ ///
+ public BZip2OutputStream(Stream output, int blockSize)
+ : this(output, blockSize, false)
+ {
+ }
+
+
+ ///
+ /// Constructs a new BZip2OutputStream.
+ ///
+ /// the destination stream.
+ ///
+ /// whether to leave the captive stream open upon closing this stream.
+ ///
+ public BZip2OutputStream(Stream output, bool leaveOpen)
+ : this(output, BZip2.MaxBlockSize, leaveOpen)
+ {
+ }
+
+
+ ///
+ /// Constructs a new BZip2OutputStream with specified blocksize,
+ /// and explicitly specifies whether to leave the wrapped stream open.
+ ///
+ ///
+ /// the destination stream.
+ ///
+ /// The blockSize in units of 100000 bytes.
+ /// The valid range is 1..9.
+ ///
+ ///
+ /// whether to leave the captive stream open upon closing this stream.
+ ///
+ public BZip2OutputStream(Stream output, int blockSize, bool leaveOpen)
+ {
+ if (blockSize < BZip2.MinBlockSize ||
+ blockSize > BZip2.MaxBlockSize)
+ {
+ var msg = String.Format("blockSize={0} is out of range; must be between {1} and {2}",
+ blockSize,
+ BZip2.MinBlockSize, BZip2.MaxBlockSize);
+ throw new ArgumentException(msg, "blockSize");
+ }
+
+ this.output = output;
+ if (!this.output.CanWrite)
+ throw new ArgumentException("The stream is not writable.", "output");
+
+ this.bw = new BitWriter(this.output);
+ this.blockSize100k = blockSize;
+ this.compressor = new BZip2Compressor(this.bw, blockSize);
+ this.leaveOpen = leaveOpen;
+ this.combinedCRC = 0;
+ EmitHeader();
+ }
+
+
+
+
+ ///
+ /// Close the stream.
+ ///
+ ///
+ ///
+ /// This may or may not close the underlying stream. Check the
+ /// constructors that accept a bool value.
+ ///
+ ///
+ public override void Close()
+ {
+ if (output != null)
+ {
+ Stream o = this.output;
+ Finish();
+ if (!leaveOpen)
+ o.Close();
+ }
+ }
+
+
+ ///
+ /// Flush the stream.
+ ///
+ public override void Flush()
+ {
+ if (this.output != null)
+ {
+ this.bw.Flush();
+ this.output.Flush();
+ }
+ }
+
+ private void EmitHeader()
+ {
+ var magic = new byte[] {
+ (byte) 'B',
+ (byte) 'Z',
+ (byte) 'h',
+ (byte) ('0' + this.blockSize100k)
+ };
+
+ // not necessary to shred the initial magic bytes
+ this.output.Write(magic, 0, magic.Length);
+ }
+
+ private void EmitTrailer()
+ {
+ // A magic 48-bit number, 0x177245385090, to indicate the end
+ // of the last block. (sqrt(pi), if you want to know)
+
+ TraceOutput(TraceBits.Write, "total written out: {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut);
+
+ // must shred
+ this.bw.WriteByte(0x17);
+ this.bw.WriteByte(0x72);
+ this.bw.WriteByte(0x45);
+ this.bw.WriteByte(0x38);
+ this.bw.WriteByte(0x50);
+ this.bw.WriteByte(0x90);
+
+ this.bw.WriteInt(this.combinedCRC);
+
+ this.bw.FinishAndPad();
+
+ TraceOutput(TraceBits.Write, "final total: {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut);
+ }
+
+ void Finish()
+ {
+ // Console.WriteLine("BZip2:Finish");
+
+ try
+ {
+ var totalBefore = this.bw.TotalBytesWrittenOut;
+ this.compressor.CompressAndWrite();
+ TraceOutput(TraceBits.Write,"out block length (bytes): {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut - totalBefore);
+
+ TraceOutput(TraceBits.Crc, " combined CRC (before): {0:X8}",
+ this.combinedCRC);
+ this.combinedCRC = (this.combinedCRC << 1) | (this.combinedCRC >> 31);
+ this.combinedCRC ^= (uint) compressor.Crc32;
+ TraceOutput(TraceBits.Crc, " block CRC : {0:X8}",
+ this.compressor.Crc32);
+ TraceOutput(TraceBits.Crc, " combined CRC (final) : {0:X8}",
+ this.combinedCRC);
+
+ EmitTrailer();
+ }
+ finally
+ {
+ this.output = null;
+ this.compressor = null;
+ this.bw = null;
+ }
+ }
+
+
+ ///
+ /// The blocksize parameter specified at construction time.
+ ///
+ public int BlockSize
+ {
+ get { return this.blockSize100k; }
+ }
+
+
+ ///
+ /// Write data to the stream.
+ ///
+ ///
+ ///
+ ///
+ /// Use the BZip2OutputStream to compress data while writing:
+ /// create a BZip2OutputStream with a writable output stream.
+ /// Then call Write() on that BZip2OutputStream, providing
+ /// uncompressed data as input. The data sent to the output stream will
+ /// be the compressed form of the input data.
+ ///
+ ///
+ ///
+ /// A BZip2OutputStream can be used only for Write() not for Read().
+ ///
+ ///
+ ///
+ ///
+ /// The buffer holding data to write to the stream.
+ /// the offset within that data array to find the first byte to write.
+ /// the number of bytes to write.
+ public override void Write(byte[] buffer, int offset, int count)
+ {
+ if (offset < 0)
+ throw new IndexOutOfRangeException(String.Format("offset ({0}) must be > 0", offset));
+ if (count < 0)
+ throw new IndexOutOfRangeException(String.Format("count ({0}) must be > 0", count));
+ if (offset + count > buffer.Length)
+ throw new IndexOutOfRangeException(String.Format("offset({0}) count({1}) bLength({2})",
+ offset, count, buffer.Length));
+ if (this.output == null)
+ throw new IOException("the stream is not open");
+
+ if (count == 0) return; // nothing to do
+
+ int bytesWritten = 0;
+ int bytesRemaining = count;
+
+ do
+ {
+ int n = compressor.Fill(buffer, offset, bytesRemaining);
+ if (n != bytesRemaining)
+ {
+ // The compressor data block is full. Compress and
+ // write out the compressed data, then reset the
+ // compressor and continue.
+
+ var totalBefore = this.bw.TotalBytesWrittenOut;
+ this.compressor.CompressAndWrite();
+ TraceOutput(TraceBits.Write,"out block length (bytes): {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut - totalBefore);
+
+ // and now any remaining bits
+ TraceOutput(TraceBits.Write,
+ " remaining: {0} 0x{1:X}",
+ this.bw.NumRemainingBits,
+ this.bw.RemainingBits);
+
+ TraceOutput(TraceBits.Crc, " combined CRC (before): {0:X8}",
+ this.combinedCRC);
+ this.combinedCRC = (this.combinedCRC << 1) | (this.combinedCRC >> 31);
+ this.combinedCRC ^= (uint) compressor.Crc32;
+ TraceOutput(TraceBits.Crc, " block CRC : {0:X8}",
+ compressor.Crc32);
+ TraceOutput(TraceBits.Crc, " combined CRC (after) : {0:X8}",
+ this.combinedCRC);
+ offset += n;
+ }
+ bytesRemaining -= n;
+ bytesWritten += n;
+ } while (bytesRemaining > 0);
+
+ totalBytesWrittenIn += bytesWritten;
+ }
+
+
+
+
+ ///
+ /// Indicates whether the stream can be read.
+ ///
+ ///
+ /// The return value is always false.
+ ///
+ public override bool CanRead
+ {
+ get { return false; }
+ }
+
+ ///
+ /// Indicates whether the stream supports Seek operations.
+ ///
+ ///
+ /// Always returns false.
+ ///
+ public override bool CanSeek
+ {
+ get { return false; }
+ }
+
+ ///
+ /// Indicates whether the stream can be written.
+ ///
+ ///
+ /// The return value should always be true, unless and until the
+ /// object is disposed and closed.
+ ///
+ public override bool CanWrite
+ {
+ get
+ {
+ if (this.output == null) throw new ObjectDisposedException("BZip2Stream");
+ return this.output.CanWrite;
+ }
+ }
+
+ ///
+ /// Reading this property always throws a .
+ ///
+ public override long Length
+ {
+ get { throw new NotImplementedException(); }
+ }
+
+ ///
+ /// The position of the stream pointer.
+ ///
+ ///
+ ///
+ /// Setting this property always throws a . Reading will return the
+ /// total number of uncompressed bytes written through.
+ ///
+ public override long Position
+ {
+ get
+ {
+ return this.totalBytesWrittenIn;
+ }
+ set { throw new NotImplementedException(); }
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this is irrelevant, since it will always throw!
+ /// this is irrelevant, since it will always throw!
+ /// irrelevant!
+ public override long Seek(long offset, System.IO.SeekOrigin origin)
+ {
+ throw new NotImplementedException();
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this is irrelevant, since it will always throw!
+ public override void SetLength(long value)
+ {
+ throw new NotImplementedException();
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this parameter is never used
+ /// this parameter is never used
+ /// this parameter is never used
+ /// never returns anything; always throws
+ public override int Read(byte[] buffer, int offset, int count)
+ {
+ throw new NotImplementedException();
+ }
+
+
+ // used only when Trace is defined
+ [Flags]
+ enum TraceBits : uint
+ {
+ None = 0,
+ Crc = 1,
+ Write = 2,
+ All = 0xffffffff,
+ }
+
+
+ [System.Diagnostics.ConditionalAttribute("Trace")]
+ private void TraceOutput(TraceBits bits, string format, params object[] varParams)
+ {
+ if ((bits & this.desiredTrace) != 0)
+ {
+ //lock(outputLock)
+ {
+ int tid = System.Threading.Thread.CurrentThread.GetHashCode();
+#if !SILVERLIGHT && !NETCF
+ Console.ForegroundColor = (ConsoleColor) (tid % 8 + 10);
+#endif
+ Console.Write("{0:000} PBOS ", tid);
+ Console.WriteLine(format, varParams);
+#if !SILVERLIGHT && !NETCF
+ Console.ResetColor();
+#endif
+ }
+ }
+ }
+
+
+ }
+
+}
diff --git a/dotNetZip/BZip2/BitWriter.cs b/dotNetZip/BZip2/BitWriter.cs
new file mode 100644
index 0000000..b739f02
--- /dev/null
+++ b/dotNetZip/BZip2/BitWriter.cs
@@ -0,0 +1,248 @@
+// BitWriter.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-July-25 18:57:31>
+//
+// ------------------------------------------------------------------
+//
+// This module defines the BitWriter class, which writes bits at a time
+// to an output stream. It's used by the BZip2Compressor class, and by
+// the BZip2OutputStream class and its parallel variant,
+// ParallelBZip2OutputStream.
+//
+// ------------------------------------------------------------------
+
+//
+// Design notes:
+//
+// BZip2 employs byte-shredding in its data format - rather than
+// aligning all data items in a compressed .bz2 file on byte barriers,
+// the BZip2 format uses portions of bytes to represent independent
+// pieces of information. This "shredding" starts with the first
+// "randomised" bit - just 12 bytes or so into a bz2 file or stream. But
+// the approach is used extensively in bzip2 files - sometimes 5 bits
+// are used, sometimes 24 or 3 bits, sometimes just 1 bit, and so on.
+// It's not possible to send this information directly to a stream in
+// this form; Streams in .NET accept byte-oriented input. Therefore,
+// when actually writing a bz2 file, the output data must be organized
+// into a byte-aligned format before being written to the output stream.
+//
+// This BitWriter class provides the byte-shredding necessary for BZip2
+// output. Think of this class as an Adapter that enables Bit-oriented
+// output to a standard byte-oriented .NET stream. This class writes
+// data out to the captive output stream only after the data bits have
+// been accumulated and aligned. For example, suppose that during
+// operation, the BZip2 compressor emits 5 bits, then 24 bits, then 32
+// bits. When the first 5 bits are sent to the BitWriter, nothing is
+// written to the output stream; instead these 5 bits are simply stored
+// in the internal accumulator. When the next 24 bits are written, the
+// first 3 bits are gathered with the accumulated bits. The resulting
+// 5+3 constitutes an entire byte; the BitWriter then actually writes
+// that byte to the output stream. This leaves 21 bits. BitWriter writes
+// 2 more whole bytes (16 more bits), in 8-bit chunks, leaving 5 in the
+// accumulator. BitWriter then follows the same procedure with the 32
+// new bits. And so on.
+//
+// A quick tour of the implementation:
+//
+// The accumulator is a uint - so it can accumulate at most 4 bytes of
+// information. In practice because of the design of this class, it
+// never accumulates more than 3 bytes.
+//
+// The Flush() method emits all whole bytes available. After calling
+// Flush(), there may be between 0-7 bits yet to be emitted into the
+// output stream.
+//
+// FinishAndPad() emits all data, including the last partial byte and
+// any necessary padding. In effect, it establishes a byte-alignment
+// barrier. To support bzip2, FinishAndPad() should be called only once
+// for a bz2 file, after the last bit of data has been written through
+// this adapter. Other binary file formats may use byte-alignment at
+// various points within the file, and FinishAndPad() would support that
+// scenario.
+//
+// The internal fn Reset() is used to reset the state of the adapter;
+// this class is used by BZip2Compressor, instances of which get re-used
+// by multiple distinct threads, for different blocks of data.
+//
+
+
+using System;
+using System.IO;
+
+namespace Ionic.BZip2
+{
+
+ internal class BitWriter
+ {
+ uint accumulator;
+ int nAccumulatedBits;
+ Stream output;
+ int totalBytesWrittenOut;
+
+ public BitWriter(Stream s)
+ {
+ this.output = s;
+ }
+
+ ///
+ /// Delivers the remaining bits, left-aligned, in a byte.
+ ///
+ ///
+ ///
+ /// This is valid only if NumRemainingBits is less than 8;
+ /// in other words it is valid only after a call to Flush().
+ ///
+ ///
+ public byte RemainingBits
+ {
+ get
+ {
+ return (byte) (this.accumulator >> (32 - this.nAccumulatedBits) & 0xff);
+ }
+ }
+
+ public int NumRemainingBits
+ {
+ get
+ {
+ return this.nAccumulatedBits;
+ }
+ }
+
+ public int TotalBytesWrittenOut
+ {
+ get
+ {
+ return this.totalBytesWrittenOut;
+ }
+ }
+
+ ///
+ /// Reset the BitWriter.
+ ///
+ ///
+ ///
+ /// This is useful when the BitWriter writes into a MemoryStream, and
+ /// is used by a BZip2Compressor, which itself is re-used for multiple
+ /// distinct data blocks.
+ ///
+ ///
+ public void Reset()
+ {
+ this.accumulator = 0;
+ this.nAccumulatedBits = 0;
+ this.totalBytesWrittenOut = 0;
+ this.output.Seek(0, SeekOrigin.Begin);
+ this.output.SetLength(0);
+ }
+
+ ///
+ /// Write some number of bits from the given value, into the output.
+ ///
+ ///
+ ///
+ /// The nbits value should be a max of 25, for safety. For performance
+ /// reasons, this method does not check!
+ ///
+ ///
+ public void WriteBits(int nbits, uint value)
+ {
+ int nAccumulated = this.nAccumulatedBits;
+ uint u = this.accumulator;
+
+ while (nAccumulated >= 8)
+ {
+ this.output.WriteByte ((byte)(u >> 24 & 0xff));
+ this.totalBytesWrittenOut++;
+ u <<= 8;
+ nAccumulated -= 8;
+ }
+
+ this.accumulator = u | (value << (32 - nAccumulated - nbits));
+ this.nAccumulatedBits = nAccumulated + nbits;
+
+ // Console.WriteLine("WriteBits({0}, 0x{1:X2}) => {2:X8} n({3})",
+ // nbits, value, accumulator, nAccumulatedBits);
+ // Console.ReadLine();
+
+ // At this point the accumulator may contain up to 31 bits waiting for
+ // output.
+ }
+
+
+ ///
+ /// Write a full 8-bit byte into the output.
+ ///
+ public void WriteByte(byte b)
+ {
+ WriteBits(8, b);
+ }
+
+ ///
+ /// Write four 8-bit bytes into the output.
+ ///
+ public void WriteInt(uint u)
+ {
+ WriteBits(8, (u >> 24) & 0xff);
+ WriteBits(8, (u >> 16) & 0xff);
+ WriteBits(8, (u >> 8) & 0xff);
+ WriteBits(8, u & 0xff);
+ }
+
+ ///
+ /// Write all available byte-aligned bytes.
+ ///
+ ///
+ ///
+ /// This method writes no new output, but flushes any accumulated
+ /// bits. At completion, the accumulator may contain up to 7
+ /// bits.
+ ///
+ ///
+ /// This is necessary when re-assembling output from N independent
+ /// compressors, one for each of N blocks. The output of any
+ /// particular compressor will in general have some fragment of a byte
+ /// remaining. This fragment needs to be accumulated into the
+ /// parent BZip2OutputStream.
+ ///
+ ///
+ public void Flush()
+ {
+ WriteBits(0,0);
+ }
+
+
+ ///
+ /// Writes all available bytes, and emits padding for the final byte as
+ /// necessary. This must be the last method invoked on an instance of
+ /// BitWriter.
+ ///
+ public void FinishAndPad()
+ {
+ Flush();
+
+ if (this.NumRemainingBits > 0)
+ {
+ byte b = (byte)((this.accumulator >> 24) & 0xff);
+ this.output.WriteByte(b);
+ this.totalBytesWrittenOut++;
+ }
+ }
+
+ }
+
+}
\ No newline at end of file
diff --git a/dotNetZip/BZip2/NOTICE.txt b/dotNetZip/BZip2/NOTICE.txt
new file mode 100644
index 0000000..a5331f0
--- /dev/null
+++ b/dotNetZip/BZip2/NOTICE.txt
@@ -0,0 +1,5 @@
+Apache Commons Compress
+Copyright 2002-2010 The Apache Software Foundation
+
+This product includes software developed by
+The Apache Software Foundation (http://www.apache.org/).
diff --git a/dotNetZip/BZip2/ParallelBZip2OutputStream.cs b/dotNetZip/BZip2/ParallelBZip2OutputStream.cs
new file mode 100644
index 0000000..b6f241f
--- /dev/null
+++ b/dotNetZip/BZip2/ParallelBZip2OutputStream.cs
@@ -0,0 +1,999 @@
+//#define Trace
+
+// ParallelBZip2OutputStream.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-August-02 16:44:24>
+//
+// ------------------------------------------------------------------
+//
+// This module defines the ParallelBZip2OutputStream class, which is a
+// BZip2 compressing stream. This code was derived in part from Apache
+// commons source code. The license below applies to the original Apache
+// code.
+//
+// ------------------------------------------------------------------
+// flymake: csc.exe /t:module BZip2InputStream.cs BZip2Compressor.cs Rand.cs BCRC32.cs @@FILE@@
+
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+
+// Design Notes:
+//
+// This class follows the classic Decorator pattern: it is a Stream that
+// wraps itself around a Stream, and in doing so provides bzip2
+// compression as callers Write into it. It is exactly the same in
+// outward function as the BZip2OutputStream, except that this class can
+// perform compression using multiple independent threads. Because of
+// that, and because of the CPU-intensive nature of BZip2 compression,
+// this class can perform significantly better (in terms of wall-click
+// time) than the single-threaded variant, at the expense of memory and
+// CPU utilization.
+//
+// BZip2 is a straightforward data format: there are 4 magic bytes at
+// the top of the file, followed by 1 or more compressed blocks. There
+// is a small "magic byte" trailer after all compressed blocks.
+//
+// In concept parallelizing BZip2 is simple: do the CPU-intensive
+// compression for each block in a separate thread, then emit the
+// compressed output, in order, to the output stream. Each block can be
+// compressed independently, so a block is the natural candidate for the
+// parcel of work that can be passed to an independent worker thread.
+//
+// The design approach used here is simple: within the Write() method of
+// the stream, fill a block. When the block is full, pass it to a
+// background worker thread for compression. When the compressor thread
+// completes its work, the main thread (the application thread that
+// calls Write()) can send the compressed data to the output stream,
+// being careful to respect the order of the compressed blocks.
+//
+// The challenge of ordering the compressed data is a solved and
+// well-understood problem - it is the same approach here as DotNetZip
+// uses in the ParallelDeflateOutputStream. It is a map/reduce approach
+// in design intent.
+//
+// One new twist for BZip2 is that the compressor output is not
+// byte-aligned. In other words the final output of a compressed block
+// will in general be a number of bits that is not a multiple of
+// 8. Therefore, combining the ordered results of the N compressor
+// threads requires additional byte-shredding by the parent
+// stream. Hence this stream uses a BitWriter to adapt bit-oriented
+// BZip2 output to the byte-oriented .NET Stream.
+//
+// The approach used here creates N instances of the BZip2Compressor
+// type, where N is governed by the number of cores (cpus) and limited
+// by the MaxWorkers property exposed by this class. Each
+// BZip2Compressor instance gets its own MemoryStream, to which it
+// writes its data, via a BitWriter.
+//
+// along with the bit accumulator described above. The MemoryStream
+// would gather the byte-aligned compressed output of the compressor.
+
+// When reducing the output of the various workers, this class must
+// again do the byte-shredding thing. The data from the compressors is
+// therefore shredded twice: once when being placed into the
+// MemoryStream, and again when emitted into the final output stream
+// that this class decorates. This is an unfortunate and seemingly
+// unavoidable inefficiency. Two rounds of byte-shredding will use more
+// CPU than we'd like, but I haven't imagined a way to avoid it.
+//
+// The BZip2Compressor is designed to write directly into the parent
+// stream's accumulator (BitWriter) when possible, and write into a
+// distinct BitWriter when necessary. The former can be used in a
+// single-thread scenario, while the latter is required in a
+// multi-thread scenario.
+//
+// ----
+//
+// Regarding the Apache code base: Most of the code in this particular
+// class is related to stream operations and thread synchronization, and
+// is my own code. It largely does not rely on any code obtained from
+// Apache commons. If you compare this code with the Apache commons
+// BZip2OutputStream, you will see very little code that is common,
+// except for the nearly-boilerplate structure that is common to all
+// subtypes of System.IO.Stream. There may be some small remnants of
+// code in this module derived from the Apache stuff, which is why I
+// left the license in here. Most of the Apache commons compressor magic
+// has been ported into the BZip2Compressor class.
+//
+
+using System;
+using System.IO;
+using System.Collections.Generic;
+using System.Threading;
+
+namespace Ionic.BZip2
+{
+ internal class WorkItem
+ {
+ public int index;
+ public BZip2Compressor Compressor { get; private set; }
+ public MemoryStream ms;
+ public int ordinal;
+ public BitWriter bw;
+
+ public WorkItem(int ix, int blockSize)
+ {
+ // compressed data gets written to a MemoryStream
+ this.ms = new MemoryStream();
+ this.bw = new BitWriter(ms);
+ this.Compressor = new BZip2Compressor(bw, blockSize);
+ this.index = ix;
+ }
+ }
+
+
+ ///
+ /// A write-only decorator stream that compresses data as it is
+ /// written using the BZip2 algorithm. This stream compresses by
+ /// block using multiple threads.
+ ///
+ ///
+ /// This class performs BZIP2 compression through writing. For
+ /// more information on the BZIP2 algorithm, see
+ /// .
+ ///
+ ///
+ ///
+ /// This class is similar to ,
+ /// except that this implementation uses an approach that employs multiple
+ /// worker threads to perform the compression. On a multi-cpu or multi-core
+ /// computer, the performance of this class can be significantly higher than
+ /// the single-threaded BZip2OutputStream, particularly for larger streams.
+ /// How large? Anything over 10mb is a good candidate for parallel
+ /// compression.
+ ///
+ ///
+ ///
+ /// The tradeoff is that this class uses more memory and more CPU than the
+ /// vanilla BZip2OutputStream. Also, for small files, the
+ /// ParallelBZip2OutputStream can be much slower than the vanilla
+ /// BZip2OutputStream, because of the overhead associated to using the
+ /// thread pool.
+ ///
+ ///
+ ///
+ public class ParallelBZip2OutputStream : System.IO.Stream
+ {
+ private static readonly int BufferPairsPerCore = 4;
+ private int _maxWorkers;
+ private bool firstWriteDone;
+ private int lastFilled;
+ private int lastWritten;
+ private int latestCompressed;
+ private int currentlyFilling;
+ private volatile Exception pendingException;
+ private bool handlingException;
+ private bool emitting;
+ private System.Collections.Generic.Queue toWrite;
+ private System.Collections.Generic.Queue toFill;
+ private System.Collections.Generic.List pool;
+ private object latestLock = new object();
+ private object eLock = new object(); // for exceptions
+ private object outputLock = new object(); // for multi-thread output
+ private AutoResetEvent newlyCompressedBlob;
+
+ long totalBytesWrittenIn;
+ long totalBytesWrittenOut;
+ bool leaveOpen;
+ uint combinedCRC;
+ Stream output;
+ BitWriter bw;
+ int blockSize100k; // 0...9
+
+ private TraceBits desiredTrace = TraceBits.Crc | TraceBits.Write;
+
+ ///
+ /// Constructs a new ParallelBZip2OutputStream, that sends its
+ /// compressed output to the given output stream.
+ ///
+ ///
+ ///
+ /// The destination stream, to which compressed output will be sent.
+ ///
+ ///
+ ///
+ ///
+ /// This example reads a file, then compresses it with bzip2 file,
+ /// and writes the compressed data into a newly created file.
+ ///
+ ///
+ /// var fname = "logfile.log";
+ /// using (var fs = File.OpenRead(fname))
+ /// {
+ /// var outFname = fname + ".bz2";
+ /// using (var output = File.Create(outFname))
+ /// {
+ /// using (var compressor = new Ionic.BZip2.ParallelBZip2OutputStream(output))
+ /// {
+ /// byte[] buffer = new byte[2048];
+ /// int n;
+ /// while ((n = fs.Read(buffer, 0, buffer.Length)) > 0)
+ /// {
+ /// compressor.Write(buffer, 0, n);
+ /// }
+ /// }
+ /// }
+ /// }
+ ///
+ ///
+ public ParallelBZip2OutputStream(Stream output)
+ : this(output, BZip2.MaxBlockSize, false)
+ {
+ }
+
+ ///
+ /// Constructs a new ParallelBZip2OutputStream with specified blocksize.
+ ///
+ /// the destination stream.
+ ///
+ /// The blockSize in units of 100000 bytes.
+ /// The valid range is 1..9.
+ ///
+ public ParallelBZip2OutputStream(Stream output, int blockSize)
+ : this(output, blockSize, false)
+ {
+ }
+
+ ///
+ /// Constructs a new ParallelBZip2OutputStream.
+ ///
+ /// the destination stream.
+ ///
+ /// whether to leave the captive stream open upon closing this stream.
+ ///
+ public ParallelBZip2OutputStream(Stream output, bool leaveOpen)
+ : this(output, BZip2.MaxBlockSize, leaveOpen)
+ {
+ }
+
+ ///
+ /// Constructs a new ParallelBZip2OutputStream with specified blocksize,
+ /// and explicitly specifies whether to leave the wrapped stream open.
+ ///
+ ///
+ /// the destination stream.
+ ///
+ /// The blockSize in units of 100000 bytes.
+ /// The valid range is 1..9.
+ ///
+ ///
+ /// whether to leave the captive stream open upon closing this stream.
+ ///
+ public ParallelBZip2OutputStream(Stream output, int blockSize, bool leaveOpen)
+ {
+ if (blockSize < BZip2.MinBlockSize || blockSize > BZip2.MaxBlockSize)
+ {
+ var msg = String.Format("blockSize={0} is out of range; must be between {1} and {2}",
+ blockSize,
+ BZip2.MinBlockSize, BZip2.MaxBlockSize);
+ throw new ArgumentException(msg, "blockSize");
+ }
+
+ this.output = output;
+ if (!this.output.CanWrite)
+ throw new ArgumentException("The stream is not writable.", "output");
+
+ this.bw = new BitWriter(this.output);
+ this.blockSize100k = blockSize;
+ this.leaveOpen = leaveOpen;
+ this.combinedCRC = 0;
+ this.MaxWorkers = 16; // default
+ EmitHeader();
+ }
+
+
+ private void InitializePoolOfWorkItems()
+ {
+ this.toWrite = new Queue();
+ this.toFill = new Queue();
+ this.pool = new System.Collections.Generic.List();
+ int nWorkers = BufferPairsPerCore * Environment.ProcessorCount;
+ nWorkers = Math.Min(nWorkers, this.MaxWorkers);
+ for(int i=0; i < nWorkers; i++)
+ {
+ this.pool.Add(new WorkItem(i, this.blockSize100k));
+ this.toFill.Enqueue(i);
+ }
+
+ this.newlyCompressedBlob = new AutoResetEvent(false);
+ this.currentlyFilling = -1;
+ this.lastFilled = -1;
+ this.lastWritten = -1;
+ this.latestCompressed = -1;
+ }
+
+
+ ///
+ /// The maximum number of concurrent compression worker threads to use.
+ ///
+ ///
+ ///
+ ///
+ /// This property sets an upper limit on the number of concurrent worker
+ /// threads to employ for compression. The implementation of this stream
+ /// employs multiple threads from the .NET thread pool, via
+ /// ThreadPool.QueueUserWorkItem(), to compress the incoming data by
+ /// block. As each block of data is compressed, this stream re-orders the
+ /// compressed blocks and writes them to the output stream.
+ ///
+ ///
+ ///
+ /// A higher number of workers enables a higher degree of
+ /// parallelism, which tends to increase the speed of compression on
+ /// multi-cpu computers. On the other hand, a higher number of buffer
+ /// pairs also implies a larger memory consumption, more active worker
+ /// threads, and a higher cpu utilization for any compression. This
+ /// property enables the application to limit its memory consumption and
+ /// CPU utilization behavior depending on requirements.
+ ///
+ ///
+ ///
+ /// By default, DotNetZip allocates 4 workers per CPU core, subject to the
+ /// upper limit specified in this property. For example, suppose the
+ /// application sets this property to 16. Then, on a machine with 2
+ /// cores, DotNetZip will use 8 workers; that number does not exceed the
+ /// upper limit specified by this property, so the actual number of
+ /// workers used will be 4 * 2 = 8. On a machine with 4 cores, DotNetZip
+ /// will use 16 workers; again, the limit does not apply. On a machine
+ /// with 8 cores, DotNetZip will use 16 workers, because of the limit.
+ ///
+ ///
+ ///
+ /// For each compression "worker thread" that occurs in parallel, there is
+ /// up to 2mb of memory allocated, for buffering and processing. The
+ /// actual number depends on the property.
+ ///
+ ///
+ ///
+ /// CPU utilization will also go up with additional workers, because a
+ /// larger number of buffer pairs allows a larger number of background
+ /// threads to compress in parallel. If you find that parallel
+ /// compression is consuming too much memory or CPU, you can adjust this
+ /// value downward.
+ ///
+ ///
+ ///
+ /// The default value is 16. Different values may deliver better or
+ /// worse results, depending on your priorities and the dynamic
+ /// performance characteristics of your storage and compute resources.
+ ///
+ ///
+ ///
+ /// The application can set this value at any time, but it is effective
+ /// only before the first call to Write(), which is when the buffers are
+ /// allocated.
+ ///
+ ///
+ public int MaxWorkers
+ {
+ get
+ {
+ return _maxWorkers;
+ }
+ set
+ {
+ if (value < 4)
+ throw new ArgumentException("MaxWorkers",
+ "Value must be 4 or greater.");
+ _maxWorkers = value;
+ }
+ }
+
+ ///
+ /// Close the stream.
+ ///
+ ///
+ ///
+ /// This may or may not close the underlying stream. Check the
+ /// constructors that accept a bool value.
+ ///
+ ///
+ public override void Close()
+ {
+ if (this.pendingException != null)
+ {
+ this.handlingException = true;
+ var pe = this.pendingException;
+ this.pendingException = null;
+ throw pe;
+ }
+
+ if (this.handlingException)
+ return;
+
+ if (output == null)
+ return;
+
+ Stream o = this.output;
+
+ try
+ {
+ FlushOutput(true);
+ }
+ finally
+ {
+ this.output = null;
+ this.bw = null;
+ }
+
+ if (!leaveOpen)
+ o.Close();
+ }
+
+
+ private void FlushOutput(bool lastInput)
+ {
+ if (this.emitting) return;
+
+ // compress and write whatever is ready
+ if (this.currentlyFilling >= 0)
+ {
+ WorkItem workitem = this.pool[this.currentlyFilling];
+ CompressOne(workitem);
+ this.currentlyFilling = -1; // get a new buffer next Write()
+ }
+
+ if (lastInput)
+ {
+ EmitPendingBuffers(true, false);
+ EmitTrailer();
+ }
+ else
+ {
+ EmitPendingBuffers(false, false);
+ }
+ }
+
+
+
+ ///
+ /// Flush the stream.
+ ///
+ public override void Flush()
+ {
+ if (this.output != null)
+ {
+ FlushOutput(false);
+ this.bw.Flush();
+ this.output.Flush();
+ }
+ }
+
+ private void EmitHeader()
+ {
+ var magic = new byte[] {
+ (byte) 'B',
+ (byte) 'Z',
+ (byte) 'h',
+ (byte) ('0' + this.blockSize100k)
+ };
+
+ // not necessary to shred the initial magic bytes
+ this.output.Write(magic, 0, magic.Length);
+ }
+
+ private void EmitTrailer()
+ {
+ // A magic 48-bit number, 0x177245385090, to indicate the end
+ // of the last block. (sqrt(pi), if you want to know)
+
+ TraceOutput(TraceBits.Write, "total written out: {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut);
+
+ // must shred
+ this.bw.WriteByte(0x17);
+ this.bw.WriteByte(0x72);
+ this.bw.WriteByte(0x45);
+ this.bw.WriteByte(0x38);
+ this.bw.WriteByte(0x50);
+ this.bw.WriteByte(0x90);
+
+ this.bw.WriteInt(this.combinedCRC);
+
+ this.bw.FinishAndPad();
+
+ TraceOutput(TraceBits.Write, "final total : {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut);
+ }
+
+
+ ///
+ /// The blocksize parameter specified at construction time.
+ ///
+ public int BlockSize
+ {
+ get { return this.blockSize100k; }
+ }
+
+
+ ///
+ /// Write data to the stream.
+ ///
+ ///
+ ///
+ ///
+ /// Use the ParallelBZip2OutputStream to compress data while
+ /// writing: create a ParallelBZip2OutputStream with a writable
+ /// output stream. Then call Write() on that
+ /// ParallelBZip2OutputStream, providing uncompressed data as
+ /// input. The data sent to the output stream will be the compressed
+ /// form of the input data.
+ ///
+ ///
+ ///
+ /// A ParallelBZip2OutputStream can be used only for
+ /// Write() not for Read().
+ ///
+ ///
+ ///
+ ///
+ /// The buffer holding data to write to the stream.
+ /// the offset within that data array to find the first byte to write.
+ /// the number of bytes to write.
+ public override void Write(byte[] buffer, int offset, int count)
+ {
+ bool mustWait = false;
+
+ // This method does this:
+ // 0. handles any pending exceptions
+ // 1. write any buffers that are ready to be written
+ // 2. fills a compressor buffer; when full, flip state to 'Filled',
+ // 3. if more data to be written, goto step 1
+
+ if (this.output == null)
+ throw new IOException("the stream is not open");
+
+ // dispense any exceptions that occurred on the BG threads
+ if (this.pendingException != null)
+ {
+ this.handlingException = true;
+ var pe = this.pendingException;
+ this.pendingException = null;
+ throw pe;
+ }
+
+ if (offset < 0)
+ throw new IndexOutOfRangeException(String.Format("offset ({0}) must be > 0", offset));
+ if (count < 0)
+ throw new IndexOutOfRangeException(String.Format("count ({0}) must be > 0", count));
+ if (offset + count > buffer.Length)
+ throw new IndexOutOfRangeException(String.Format("offset({0}) count({1}) bLength({2})",
+ offset, count, buffer.Length));
+
+
+ if (count == 0) return; // nothing to do
+
+
+ if (!this.firstWriteDone)
+ {
+ // Want to do this on first Write, first session, and not in the
+ // constructor. Must allow the MaxWorkers to change after
+ // construction, but before first Write().
+ InitializePoolOfWorkItems();
+ this.firstWriteDone = true;
+ }
+
+ int bytesWritten = 0;
+ int bytesRemaining = count;
+
+ do
+ {
+ // may need to make buffers available
+ EmitPendingBuffers(false, mustWait);
+
+ mustWait = false;
+
+ // get a compressor to fill
+ int ix = -1;
+ if (this.currentlyFilling >= 0)
+ {
+ ix = this.currentlyFilling;
+ }
+ else
+ {
+ if (this.toFill.Count == 0)
+ {
+ // No compressors available to fill, so... need to emit
+ // compressed buffers.
+ mustWait = true;
+ continue;
+ }
+
+ ix = this.toFill.Dequeue();
+ ++this.lastFilled;
+ }
+
+ WorkItem workitem = this.pool[ix];
+ workitem.ordinal = this.lastFilled;
+
+ int n = workitem.Compressor.Fill(buffer, offset, bytesRemaining);
+ if (n != bytesRemaining)
+ {
+ if (!ThreadPool.QueueUserWorkItem( CompressOne, workitem ))
+ throw new Exception("Cannot enqueue workitem");
+
+ this.currentlyFilling = -1; // will get a new buffer next time
+ offset += n;
+ }
+ else
+ this.currentlyFilling = ix;
+
+ bytesRemaining -= n;
+ bytesWritten += n;
+ }
+ while (bytesRemaining > 0);
+
+ totalBytesWrittenIn += bytesWritten;
+ return;
+ }
+
+
+
+ private void EmitPendingBuffers(bool doAll, bool mustWait)
+ {
+ // When combining parallel compression with a ZipSegmentedStream, it's
+ // possible for the ZSS to throw from within this method. In that
+ // case, Close/Dispose will be called on this stream, if this stream
+ // is employed within a using or try/finally pair as required. But
+ // this stream is unaware of the pending exception, so the Close()
+ // method invokes this method AGAIN. This can lead to a deadlock.
+ // Therefore, failfast if re-entering.
+
+ if (emitting) return;
+ emitting = true;
+
+ if (doAll || mustWait)
+ this.newlyCompressedBlob.WaitOne();
+
+ do
+ {
+ int firstSkip = -1;
+ int millisecondsToWait = doAll ? 200 : (mustWait ? -1 : 0);
+ int nextToWrite = -1;
+
+ do
+ {
+ if (Monitor.TryEnter(this.toWrite, millisecondsToWait))
+ {
+ nextToWrite = -1;
+ try
+ {
+ if (this.toWrite.Count > 0)
+ nextToWrite = this.toWrite.Dequeue();
+ }
+ finally
+ {
+ Monitor.Exit(this.toWrite);
+ }
+
+ if (nextToWrite >= 0)
+ {
+ WorkItem workitem = this.pool[nextToWrite];
+ if (workitem.ordinal != this.lastWritten + 1)
+ {
+ // out of order. requeue and try again.
+ lock(this.toWrite)
+ {
+ this.toWrite.Enqueue(nextToWrite);
+ }
+
+ if (firstSkip == nextToWrite)
+ {
+ // We went around the list once.
+ // None of the items in the list is the one we want.
+ // Now wait for a compressor to signal again.
+ this.newlyCompressedBlob.WaitOne();
+ firstSkip = -1;
+ }
+ else if (firstSkip == -1)
+ firstSkip = nextToWrite;
+
+ continue;
+ }
+
+ firstSkip = -1;
+
+ TraceOutput(TraceBits.Write,
+ "Writing block {0}", workitem.ordinal);
+
+ // write the data to the output
+ var bw2 = workitem.bw;
+ bw2.Flush(); // not bw2.FinishAndPad()!
+ var ms = workitem.ms;
+ ms.Seek(0,SeekOrigin.Begin);
+
+ // cannot dump bytes!!
+ // ms.WriteTo(this.output);
+ //
+ // must do byte shredding:
+ int n;
+ int y = -1;
+ long totOut = 0;
+ var buffer = new byte[1024];
+ while ((n = ms.Read(buffer,0,buffer.Length)) > 0)
+ {
+#if Trace
+ if (y == -1) // diagnostics only
+ {
+ var sb1 = new System.Text.StringBuilder();
+ sb1.Append("first 16 whole bytes in block: ");
+ for (int z=0; z < 16; z++)
+ sb1.Append(String.Format(" {0:X2}", buffer[z]));
+ TraceOutput(TraceBits.Write, sb1.ToString());
+ }
+#endif
+ y = n;
+ for (int k=0; k < n; k++)
+ {
+ this.bw.WriteByte(buffer[k]);
+ }
+ totOut += n;
+ }
+#if Trace
+ TraceOutput(TraceBits.Write,"out block length (bytes): {0} (0x{0:X})", totOut);
+ var sb = new System.Text.StringBuilder();
+ sb.Append("final 16 whole bytes in block: ");
+ for (int z=0; z < 16; z++)
+ sb.Append(String.Format(" {0:X2}", buffer[y-1-12+z]));
+ TraceOutput(TraceBits.Write, sb.ToString());
+#endif
+
+ // and now any remaining bits
+ TraceOutput(TraceBits.Write,
+ " remaining bits: {0} 0x{1:X}",
+ bw2.NumRemainingBits,
+ bw2.RemainingBits);
+ if (bw2.NumRemainingBits > 0)
+ {
+ this.bw.WriteBits(bw2.NumRemainingBits, bw2.RemainingBits);
+ }
+
+ TraceOutput(TraceBits.Crc," combined CRC (before): {0:X8}",
+ this.combinedCRC);
+ this.combinedCRC = (this.combinedCRC << 1) | (this.combinedCRC >> 31);
+ this.combinedCRC ^= (uint) workitem.Compressor.Crc32;
+
+ TraceOutput(TraceBits.Crc,
+ " block CRC : {0:X8}",
+ workitem.Compressor.Crc32);
+ TraceOutput(TraceBits.Crc,
+ " combined CRC (after) : {0:X8}",
+ this.combinedCRC);
+ TraceOutput(TraceBits.Write,
+ "total written out: {0} (0x{0:X})",
+ this.bw.TotalBytesWrittenOut);
+ TraceOutput(TraceBits.Write | TraceBits.Crc, "");
+
+ this.totalBytesWrittenOut += totOut;
+
+ bw2.Reset();
+ this.lastWritten = workitem.ordinal;
+ workitem.ordinal = -1;
+ this.toFill.Enqueue(workitem.index);
+
+ // don't wait next time through
+ if (millisecondsToWait == -1) millisecondsToWait = 0;
+ }
+ }
+ else
+ nextToWrite = -1;
+
+ } while (nextToWrite >= 0);
+
+ } while (doAll && (this.lastWritten != this.latestCompressed));
+
+ if (doAll)
+ {
+ TraceOutput(TraceBits.Crc,
+ " combined CRC (final) : {0:X8}", this.combinedCRC);
+ }
+
+ emitting = false;
+ }
+
+
+ private void CompressOne(Object wi)
+ {
+ // compress and one buffer
+ WorkItem workitem = (WorkItem) wi;
+ try
+ {
+ // compress and write to the compressor's MemoryStream
+ workitem.Compressor.CompressAndWrite();
+
+ lock(this.latestLock)
+ {
+ if (workitem.ordinal > this.latestCompressed)
+ this.latestCompressed = workitem.ordinal;
+ }
+ lock (this.toWrite)
+ {
+ this.toWrite.Enqueue(workitem.index);
+ }
+ this.newlyCompressedBlob.Set();
+ }
+ catch (System.Exception exc1)
+ {
+ lock(this.eLock)
+ {
+ // expose the exception to the main thread
+ if (this.pendingException!=null)
+ this.pendingException = exc1;
+ }
+ }
+ }
+
+
+
+
+ ///
+ /// Indicates whether the stream can be read.
+ ///
+ ///
+ /// The return value is always false.
+ ///
+ public override bool CanRead
+ {
+ get { return false; }
+ }
+
+ ///
+ /// Indicates whether the stream supports Seek operations.
+ ///
+ ///
+ /// Always returns false.
+ ///
+ public override bool CanSeek
+ {
+ get { return false; }
+ }
+
+ ///
+ /// Indicates whether the stream can be written.
+ ///
+ ///
+ /// The return value depends on whether the captive stream supports writing.
+ ///
+ public override bool CanWrite
+ {
+ get
+ {
+ if (this.output == null) throw new ObjectDisposedException("BZip2Stream");
+ return this.output.CanWrite;
+ }
+ }
+
+ ///
+ /// Reading this property always throws a .
+ ///
+ public override long Length
+ {
+ get { throw new NotImplementedException(); }
+ }
+
+ ///
+ /// The position of the stream pointer.
+ ///
+ ///
+ ///
+ /// Setting this property always throws a . Reading will return the
+ /// total number of uncompressed bytes written through.
+ ///
+ public override long Position
+ {
+ get
+ {
+ return this.totalBytesWrittenIn;
+ }
+ set { throw new NotImplementedException(); }
+ }
+
+ ///
+ /// The total number of bytes written out by the stream.
+ ///
+ ///
+ /// This value is meaningful only after a call to Close().
+ ///
+ public Int64 BytesWrittenOut { get { return totalBytesWrittenOut; } }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this is irrelevant, since it will always throw!
+ /// this is irrelevant, since it will always throw!
+ /// irrelevant!
+ public override long Seek(long offset, System.IO.SeekOrigin origin)
+ {
+ throw new NotImplementedException();
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this is irrelevant, since it will always throw!
+ public override void SetLength(long value)
+ {
+ throw new NotImplementedException();
+ }
+
+ ///
+ /// Calling this method always throws a .
+ ///
+ /// this parameter is never used
+ /// this parameter is never used
+ /// this parameter is never used
+ /// never returns anything; always throws
+ public override int Read(byte[] buffer, int offset, int count)
+ {
+ throw new NotImplementedException();
+ }
+
+
+ // used only when Trace is defined
+ [Flags]
+ enum TraceBits : uint
+ {
+ None = 0,
+ Crc = 1,
+ Write = 2,
+ All = 0xffffffff,
+ }
+
+
+ [System.Diagnostics.ConditionalAttribute("Trace")]
+ private void TraceOutput(TraceBits bits, string format, params object[] varParams)
+ {
+ if ((bits & this.desiredTrace) != 0)
+ {
+ lock(outputLock)
+ {
+ int tid = Thread.CurrentThread.GetHashCode();
+#if !SILVERLIGHT
+ Console.ForegroundColor = (ConsoleColor) (tid % 8 + 10);
+#endif
+ Console.Write("{0:000} PBOS ", tid);
+ Console.WriteLine(format, varParams);
+#if !SILVERLIGHT
+ Console.ResetColor();
+#endif
+ }
+ }
+ }
+
+ }
+
+}
diff --git a/dotNetZip/BZip2/Properties/AssemblyInfo.cs b/dotNetZip/BZip2/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..9473f11
Binary files /dev/null and b/dotNetZip/BZip2/Properties/AssemblyInfo.cs differ
diff --git a/dotNetZip/BZip2/Rand.cs b/dotNetZip/BZip2/Rand.cs
new file mode 100644
index 0000000..ac00dec
--- /dev/null
+++ b/dotNetZip/BZip2/Rand.cs
@@ -0,0 +1,99 @@
+// Rand.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-July-31 15:09:16>
+//
+// ------------------------------------------------------------------
+//
+// This module defines a helper class for the BZip2 classes. This code
+// is derived from the original BZip2 source code.
+//
+// ------------------------------------------------------------------
+
+
+namespace Ionic.BZip2
+{
+ internal static class Rand
+ {
+ private static int[] RNUMS =
+ {
+ 619, 720, 127, 481, 931, 816, 813, 233, 566, 247,
+ 985, 724, 205, 454, 863, 491, 741, 242, 949, 214,
+ 733, 859, 335, 708, 621, 574, 73, 654, 730, 472,
+ 419, 436, 278, 496, 867, 210, 399, 680, 480, 51,
+ 878, 465, 811, 169, 869, 675, 611, 697, 867, 561,
+ 862, 687, 507, 283, 482, 129, 807, 591, 733, 623,
+ 150, 238, 59, 379, 684, 877, 625, 169, 643, 105,
+ 170, 607, 520, 932, 727, 476, 693, 425, 174, 647,
+ 73, 122, 335, 530, 442, 853, 695, 249, 445, 515,
+ 909, 545, 703, 919, 874, 474, 882, 500, 594, 612,
+ 641, 801, 220, 162, 819, 984, 589, 513, 495, 799,
+ 161, 604, 958, 533, 221, 400, 386, 867, 600, 782,
+ 382, 596, 414, 171, 516, 375, 682, 485, 911, 276,
+ 98, 553, 163, 354, 666, 933, 424, 341, 533, 870,
+ 227, 730, 475, 186, 263, 647, 537, 686, 600, 224,
+ 469, 68, 770, 919, 190, 373, 294, 822, 808, 206,
+ 184, 943, 795, 384, 383, 461, 404, 758, 839, 887,
+ 715, 67, 618, 276, 204, 918, 873, 777, 604, 560,
+ 951, 160, 578, 722, 79, 804, 96, 409, 713, 940,
+ 652, 934, 970, 447, 318, 353, 859, 672, 112, 785,
+ 645, 863, 803, 350, 139, 93, 354, 99, 820, 908,
+ 609, 772, 154, 274, 580, 184, 79, 626, 630, 742,
+ 653, 282, 762, 623, 680, 81, 927, 626, 789, 125,
+ 411, 521, 938, 300, 821, 78, 343, 175, 128, 250,
+ 170, 774, 972, 275, 999, 639, 495, 78, 352, 126,
+ 857, 956, 358, 619, 580, 124, 737, 594, 701, 612,
+ 669, 112, 134, 694, 363, 992, 809, 743, 168, 974,
+ 944, 375, 748, 52, 600, 747, 642, 182, 862, 81,
+ 344, 805, 988, 739, 511, 655, 814, 334, 249, 515,
+ 897, 955, 664, 981, 649, 113, 974, 459, 893, 228,
+ 433, 837, 553, 268, 926, 240, 102, 654, 459, 51,
+ 686, 754, 806, 760, 493, 403, 415, 394, 687, 700,
+ 946, 670, 656, 610, 738, 392, 760, 799, 887, 653,
+ 978, 321, 576, 617, 626, 502, 894, 679, 243, 440,
+ 680, 879, 194, 572, 640, 724, 926, 56, 204, 700,
+ 707, 151, 457, 449, 797, 195, 791, 558, 945, 679,
+ 297, 59, 87, 824, 713, 663, 412, 693, 342, 606,
+ 134, 108, 571, 364, 631, 212, 174, 643, 304, 329,
+ 343, 97, 430, 751, 497, 314, 983, 374, 822, 928,
+ 140, 206, 73, 263, 980, 736, 876, 478, 430, 305,
+ 170, 514, 364, 692, 829, 82, 855, 953, 676, 246,
+ 369, 970, 294, 750, 807, 827, 150, 790, 288, 923,
+ 804, 378, 215, 828, 592, 281, 565, 555, 710, 82,
+ 896, 831, 547, 261, 524, 462, 293, 465, 502, 56,
+ 661, 821, 976, 991, 658, 869, 905, 758, 745, 193,
+ 768, 550, 608, 933, 378, 286, 215, 979, 792, 961,
+ 61, 688, 793, 644, 986, 403, 106, 366, 905, 644,
+ 372, 567, 466, 434, 645, 210, 389, 550, 919, 135,
+ 780, 773, 635, 389, 707, 100, 626, 958, 165, 504,
+ 920, 176, 193, 713, 857, 265, 203, 50, 668, 108,
+ 645, 990, 626, 197, 510, 357, 358, 850, 858, 364,
+ 936, 638
+ };
+
+
+ ///
+ /// Returns the "random" number at a specific index.
+ ///
+ /// the index
+ /// the random number
+ internal static int Rnums(int i)
+ {
+ return RNUMS[i];
+ }
+ }
+
+}
\ No newline at end of file
diff --git a/dotNetZip/BuildHelp.bat b/dotNetZip/BuildHelp.bat
new file mode 100644
index 0000000..ab236f0
--- /dev/null
+++ b/dotNetZip/BuildHelp.bat
@@ -0,0 +1,3 @@
+@REM "C:\Program Files\EWSoftware\Sandcastle Help File Builder\SandcastleBuilderConsole.exe" DotNetZip.shfb
+c:\.net3.5\msbuild.exe /p:Configuration=Release Help\Dotnetzip.shfbproj
+if exist c:\dinoch\dev\dotnet\pronounceword.exe (c:\dinoch\dev\dotnet\pronounceword.exe Build Complete > nul)
diff --git a/dotNetZip/BuildProcessTemplates/DefaultTemplate.11.1.xaml b/dotNetZip/BuildProcessTemplates/DefaultTemplate.11.1.xaml
new file mode 100644
index 0000000..bf54edf
--- /dev/null
+++ b/dotNetZip/BuildProcessTemplates/DefaultTemplate.11.1.xaml
@@ -0,0 +1,543 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ [New Microsoft.TeamFoundation.Build.Workflow.Activities.BuildSettings()]
+ [False]
+ [New Microsoft.TeamFoundation.Build.Workflow.Activities.TestSpecList(New Microsoft.TeamFoundation.Build.Workflow.Activities.AgileTestPlatformSpec("**\*test*.dll"))]
+ ["$(BuildDefinitionName)_$(Date:yyyyMMdd)$(Rev:.r)"]
+ [False]
+ [True]
+ [True]
+ [Microsoft.TeamFoundation.Build.Workflow.Activities.CleanWorkspaceOption.All]
+
+
+
+ [Microsoft.TeamFoundation.Build.Workflow.Activities.CodeAnalysisOption.AsConfigured]
+ [True]
+ [Microsoft.TeamFoundation.Build.Workflow.Activities.ToolPlatform.Auto]
+ [True]
+ [New Microsoft.TeamFoundation.Build.Workflow.Activities.SourceAndSymbolServerSettings(True, Nothing)]
+ [True]
+
+
+
+ [New Microsoft.TeamFoundation.Build.Workflow.Activities.AgentSettings() With {.MaxWaitTime = New System.TimeSpan(4, 0, 0), .MaxExecutionTime = New System.TimeSpan(0, 0, 0), .TagComparison = Microsoft.TeamFoundation.Build.Workflow.Activities.TagComparison.MatchExactly }]
+ [Microsoft.TeamFoundation.Build.Workflow.BuildVerbosity.Normal]
+
+
+
+
+
+
+ All
+ 11.0
+ Assembly references and imported namespaces serialized as XML namespaces
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dotNetZip/BuildProcessTemplates/DefaultTemplate.xaml b/dotNetZip/BuildProcessTemplates/DefaultTemplate.xaml
new file mode 100644
index 0000000..12cc624
--- /dev/null
+++ b/dotNetZip/BuildProcessTemplates/DefaultTemplate.xaml
@@ -0,0 +1,602 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Assembly references and imported namespaces serialized as XML namespaces
+
+
+ True
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ False
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ False
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ False
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ False
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ False
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/BuildProcessTemplates/LabDefaultTemplate.11.xaml b/dotNetZip/BuildProcessTemplates/LabDefaultTemplate.11.xaml
new file mode 100644
index 0000000..9e1fb0b
--- /dev/null
+++ b/dotNetZip/BuildProcessTemplates/LabDefaultTemplate.11.xaml
@@ -0,0 +1,208 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 11.0
+
+
+
+
+
+ 920,3702
+ Assembly references and imported namespaces serialized as XML namespaces
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ True
+
+
+
+
+
+
+ [LabWorkflowParameters.BuildDetails.BuildUri]
+
+
+ [ChildBuildDetail.Uri]
+
+
+
+
+
+
+
+
+
+
+
+ [BuildLocation]
+
+
+ [If(LabWorkflowParameters.BuildDetails.Configuration Is Nothing, BuildLocation, If(LabWorkflowParameters.BuildDetails.Configuration.IsEmpty Or (SelectedBuildDetail.Information.GetNodesByType(Microsoft.TeamFoundation.Build.Common.InformationTypes.ConfigurationSummary, True)).Count = 1, BuildLocation, If(LabWorkflowParameters.BuildDetails.Configuration.IsPlatformEmptyOrAnyCpu, BuildLocation + "\" + LabWorkflowParameters.BuildDetails.Configuration.Configuration, BuildLocation + "\" + LabWorkflowParameters.BuildDetails.Configuration.Platform + "\" + LabWorkflowParameters.BuildDetails.Configuration.Configuration)))]
+
+
+
+
+
+
+
+
+
+
+
+ [LabEnvironmentUri]
+
+
+ [LabWorkflowParameters.EnvironmentDetails.LabEnvironmentUri.ToString()]
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ [PostDeploymentSnapshotName]
+
+
+ [If(LabWorkflowParameters.BuildDetails.IsTeamSystemBuild = True,String.Format("{0}_{1}_{2}", LabWorkflowParameters.DeploymentDetails.PostDeploymentSnapshotName, BuildNumber,BuildDetail.BuildNumber),String.Format("{0}_{1}", LabWorkflowParameters.DeploymentDetails.PostDeploymentSnapshotName, BuildDetail.BuildNumber))]
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ [BuildStatus]
+
+
+ [Microsoft.TeamFoundation.Build.Client.BuildStatus.PartiallySucceeded]
+
+
+
+
+
+
+ [BuildStatus]
+
+
+ [Microsoft.TeamFoundation.Build.Client.BuildStatus.Failed]
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/BuildProcessTemplates/UpgradeTemplate.xaml b/dotNetZip/BuildProcessTemplates/UpgradeTemplate.xaml
new file mode 100644
index 0000000..166acb2
--- /dev/null
+++ b/dotNetZip/BuildProcessTemplates/UpgradeTemplate.xaml
@@ -0,0 +1,76 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ [New Microsoft.TeamFoundation.Build.Workflow.Activities.AgentSettings() With {.MaxWaitTime = New System.TimeSpan(4, 0, 0), .MaxExecutionTime = New System.TimeSpan(0, 0, 0), .TagComparison = Microsoft.TeamFoundation.Build.Workflow.Activities.TagComparison.MatchExactly }]
+
+
+
+ [Microsoft.TeamFoundation.Build.Workflow.Activities.ToolPlatform.Auto]
+ [False]
+ [False]
+
+
+
+
+
+
+
+
+
+ [Microsoft.TeamFoundation.VersionControl.Client.RecursionType.OneLevel]
+ [Microsoft.TeamFoundation.Build.Workflow.BuildVerbosity.Normal]
+
+
+
+ All
+ Assembly references and imported namespaces serialized as XML namespaces
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/CommonSrc/CRC32.cs b/dotNetZip/CommonSrc/CRC32.cs
new file mode 100644
index 0000000..97593b9
--- /dev/null
+++ b/dotNetZip/CommonSrc/CRC32.cs
@@ -0,0 +1,814 @@
+// CRC32.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2011 Dino Chiesa.
+// All rights reserved.
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Last Saved: <2011-August-02 18:25:54>
+//
+// ------------------------------------------------------------------
+//
+// This module defines the CRC32 class, which can do the CRC32 algorithm, using
+// arbitrary starting polynomials, and bit reversal. The bit reversal is what
+// distinguishes this CRC-32 used in BZip2 from the CRC-32 that is used in PKZIP
+// files, or GZIP files. This class does both.
+//
+// ------------------------------------------------------------------
+
+
+using System;
+using Interop = System.Runtime.InteropServices;
+
+namespace Ionic.Crc
+{
+ ///
+ /// Computes a CRC-32. The CRC-32 algorithm is parameterized - you
+ /// can set the polynomial and enable or disable bit
+ /// reversal. This can be used for GZIP, BZip2, or ZIP.
+ ///
+ ///
+ /// This type is used internally by DotNetZip; it is generally not used
+ /// directly by applications wishing to create, read, or manipulate zip
+ /// archive files.
+ ///
+
+ [Interop.GuidAttribute("ebc25cf6-9120-4283-b972-0e5520d0000C")]
+ [Interop.ComVisible(true)]
+#if !NETCF
+ [Interop.ClassInterface(Interop.ClassInterfaceType.AutoDispatch)]
+#endif
+ public class CRC32
+ {
+ ///
+ /// Indicates the total number of bytes applied to the CRC.
+ ///
+ public Int64 TotalBytesRead
+ {
+ get
+ {
+ return _TotalBytesRead;
+ }
+ }
+
+ ///
+ /// Indicates the current CRC for all blocks slurped in.
+ ///
+ public Int32 Crc32Result
+ {
+ get
+ {
+ return unchecked((Int32)(~_register));
+ }
+ }
+
+ ///
+ /// Returns the CRC32 for the specified stream.
+ ///
+ /// The stream over which to calculate the CRC32
+ /// the CRC32 calculation
+ public Int32 GetCrc32(System.IO.Stream input)
+ {
+ return GetCrc32AndCopy(input, null);
+ }
+
+ ///
+ /// Returns the CRC32 for the specified stream, and writes the input into the
+ /// output stream.
+ ///
+ /// The stream over which to calculate the CRC32
+ /// The stream into which to deflate the input
+ /// the CRC32 calculation
+ public Int32 GetCrc32AndCopy(System.IO.Stream input, System.IO.Stream output)
+ {
+ if (input == null)
+ throw new Exception("The input stream must not be null.");
+
+ unchecked
+ {
+ byte[] buffer = new byte[BUFFER_SIZE];
+ int readSize = BUFFER_SIZE;
+
+ _TotalBytesRead = 0;
+ int count = input.Read(buffer, 0, readSize);
+ if (output != null) output.Write(buffer, 0, count);
+ _TotalBytesRead += count;
+ while (count > 0)
+ {
+ SlurpBlock(buffer, 0, count);
+ count = input.Read(buffer, 0, readSize);
+ if (output != null) output.Write(buffer, 0, count);
+ _TotalBytesRead += count;
+ }
+
+ return (Int32)(~_register);
+ }
+ }
+
+
+ ///
+ /// Get the CRC32 for the given (word,byte) combo. This is a
+ /// computation defined by PKzip for PKZIP 2.0 (weak) encryption.
+ ///
+ /// The word to start with.
+ /// The byte to combine it with.
+ /// The CRC-ized result.
+ public Int32 ComputeCrc32(Int32 W, byte B)
+ {
+ return _InternalComputeCrc32((UInt32)W, B);
+ }
+
+ internal Int32 _InternalComputeCrc32(UInt32 W, byte B)
+ {
+ return (Int32)(crc32Table[(W ^ B) & 0xFF] ^ (W >> 8));
+ }
+
+
+ ///
+ /// Update the value for the running CRC32 using the given block of bytes.
+ /// This is useful when using the CRC32() class in a Stream.
+ ///
+ /// block of bytes to slurp
+ /// starting point in the block
+ /// how many bytes within the block to slurp
+ public void SlurpBlock(byte[] block, int offset, int count)
+ {
+ if (block == null)
+ throw new Exception("The data buffer must not be null.");
+
+ // bzip algorithm
+ for (int i = 0; i < count; i++)
+ {
+ int x = offset + i;
+ byte b = block[x];
+ if (this.reverseBits)
+ {
+ UInt32 temp = (_register >> 24) ^ b;
+ _register = (_register << 8) ^ crc32Table[temp];
+ }
+ else
+ {
+ UInt32 temp = (_register & 0x000000FF) ^ b;
+ _register = (_register >> 8) ^ crc32Table[temp];
+ }
+ }
+ _TotalBytesRead += count;
+ }
+
+
+ ///
+ /// Process one byte in the CRC.
+ ///
+ /// the byte to include into the CRC .
+ public void UpdateCRC(byte b)
+ {
+ if (this.reverseBits)
+ {
+ UInt32 temp = (_register >> 24) ^ b;
+ _register = (_register << 8) ^ crc32Table[temp];
+ }
+ else
+ {
+ UInt32 temp = (_register & 0x000000FF) ^ b;
+ _register = (_register >> 8) ^ crc32Table[temp];
+ }
+ }
+
+ ///
+ /// Process a run of N identical bytes into the CRC.
+ ///
+ ///
+ ///
+ /// This method serves as an optimization for updating the CRC when a
+ /// run of identical bytes is found. Rather than passing in a buffer of
+ /// length n, containing all identical bytes b, this method accepts the
+ /// byte value and the length of the (virtual) buffer - the length of
+ /// the run.
+ ///
+ ///
+ /// the byte to include into the CRC.
+ /// the number of times that byte should be repeated.
+ public void UpdateCRC(byte b, int n)
+ {
+ while (n-- > 0)
+ {
+ if (this.reverseBits)
+ {
+ uint temp = (_register >> 24) ^ b;
+ _register = (_register << 8) ^ crc32Table[(temp >= 0)
+ ? temp
+ : (temp + 256)];
+ }
+ else
+ {
+ UInt32 temp = (_register & 0x000000FF) ^ b;
+ _register = (_register >> 8) ^ crc32Table[(temp >= 0)
+ ? temp
+ : (temp + 256)];
+
+ }
+ }
+ }
+
+
+
+ private static uint ReverseBits(uint data)
+ {
+ unchecked
+ {
+ uint ret = data;
+ ret = (ret & 0x55555555) << 1 | (ret >> 1) & 0x55555555;
+ ret = (ret & 0x33333333) << 2 | (ret >> 2) & 0x33333333;
+ ret = (ret & 0x0F0F0F0F) << 4 | (ret >> 4) & 0x0F0F0F0F;
+ ret = (ret << 24) | ((ret & 0xFF00) << 8) | ((ret >> 8) & 0xFF00) | (ret >> 24);
+ return ret;
+ }
+ }
+
+ private static byte ReverseBits(byte data)
+ {
+ unchecked
+ {
+ uint u = (uint)data * 0x00020202;
+ uint m = 0x01044010;
+ uint s = u & m;
+ uint t = (u << 2) & (m << 1);
+ return (byte)((0x01001001 * (s + t)) >> 24);
+ }
+ }
+
+
+
+ private void GenerateLookupTable()
+ {
+ crc32Table = new UInt32[256];
+ unchecked
+ {
+ UInt32 dwCrc;
+ byte i = 0;
+ do
+ {
+ dwCrc = i;
+ for (byte j = 8; j > 0; j--)
+ {
+ if ((dwCrc & 1) == 1)
+ {
+ dwCrc = (dwCrc >> 1) ^ dwPolynomial;
+ }
+ else
+ {
+ dwCrc >>= 1;
+ }
+ }
+ if (reverseBits)
+ {
+ crc32Table[ReverseBits(i)] = ReverseBits(dwCrc);
+ }
+ else
+ {
+ crc32Table[i] = dwCrc;
+ }
+ i++;
+ } while (i!=0);
+ }
+
+#if VERBOSE
+ Console.WriteLine();
+ Console.WriteLine("private static readonly UInt32[] crc32Table = {");
+ for (int i = 0; i < crc32Table.Length; i+=4)
+ {
+ Console.Write(" ");
+ for (int j=0; j < 4; j++)
+ {
+ Console.Write(" 0x{0:X8}U,", crc32Table[i+j]);
+ }
+ Console.WriteLine();
+ }
+ Console.WriteLine("};");
+ Console.WriteLine();
+#endif
+ }
+
+
+ private uint gf2_matrix_times(uint[] matrix, uint vec)
+ {
+ uint sum = 0;
+ int i=0;
+ while (vec != 0)
+ {
+ if ((vec & 0x01)== 0x01)
+ sum ^= matrix[i];
+ vec >>= 1;
+ i++;
+ }
+ return sum;
+ }
+
+ private void gf2_matrix_square(uint[] square, uint[] mat)
+ {
+ for (int i = 0; i < 32; i++)
+ square[i] = gf2_matrix_times(mat, mat[i]);
+ }
+
+
+
+ ///
+ /// Combines the given CRC32 value with the current running total.
+ ///
+ ///
+ /// This is useful when using a divide-and-conquer approach to
+ /// calculating a CRC. Multiple threads can each calculate a
+ /// CRC32 on a segment of the data, and then combine the
+ /// individual CRC32 values at the end.
+ ///
+ /// the crc value to be combined with this one
+ /// the length of data the CRC value was calculated on
+ public void Combine(int crc, int length)
+ {
+ uint[] even = new uint[32]; // even-power-of-two zeros operator
+ uint[] odd = new uint[32]; // odd-power-of-two zeros operator
+
+ if (length == 0)
+ return;
+
+ uint crc1= ~_register;
+ uint crc2= (uint) crc;
+
+ // put operator for one zero bit in odd
+ odd[0] = this.dwPolynomial; // the CRC-32 polynomial
+ uint row = 1;
+ for (int i = 1; i < 32; i++)
+ {
+ odd[i] = row;
+ row <<= 1;
+ }
+
+ // put operator for two zero bits in even
+ gf2_matrix_square(even, odd);
+
+ // put operator for four zero bits in odd
+ gf2_matrix_square(odd, even);
+
+ uint len2 = (uint) length;
+
+ // apply len2 zeros to crc1 (first square will put the operator for one
+ // zero byte, eight zero bits, in even)
+ do {
+ // apply zeros operator for this bit of len2
+ gf2_matrix_square(even, odd);
+
+ if ((len2 & 1)== 1)
+ crc1 = gf2_matrix_times(even, crc1);
+ len2 >>= 1;
+
+ if (len2 == 0)
+ break;
+
+ // another iteration of the loop with odd and even swapped
+ gf2_matrix_square(odd, even);
+ if ((len2 & 1)==1)
+ crc1 = gf2_matrix_times(odd, crc1);
+ len2 >>= 1;
+
+
+ } while (len2 != 0);
+
+ crc1 ^= crc2;
+
+ _register= ~crc1;
+
+ //return (int) crc1;
+ return;
+ }
+
+
+ ///
+ /// Create an instance of the CRC32 class using the default settings: no
+ /// bit reversal, and a polynomial of 0xEDB88320.
+ ///
+ public CRC32() : this(false)
+ {
+ }
+
+ ///
+ /// Create an instance of the CRC32 class, specifying whether to reverse
+ /// data bits or not.
+ ///
+ ///
+ /// specify true if the instance should reverse data bits.
+ ///
+ ///
+ ///
+ /// In the CRC-32 used by BZip2, the bits are reversed. Therefore if you
+ /// want a CRC32 with compatibility with BZip2, you should pass true
+ /// here. In the CRC-32 used by GZIP and PKZIP, the bits are not
+ /// reversed; Therefore if you want a CRC32 with compatibility with
+ /// those, you should pass false.
+ ///
+ ///
+ public CRC32(bool reverseBits) :
+ this( unchecked((int)0xEDB88320), reverseBits)
+ {
+ }
+
+
+ ///
+ /// Create an instance of the CRC32 class, specifying the polynomial and
+ /// whether to reverse data bits or not.
+ ///
+ ///
+ /// The polynomial to use for the CRC, expressed in the reversed (LSB)
+ /// format: the highest ordered bit in the polynomial value is the
+ /// coefficient of the 0th power; the second-highest order bit is the
+ /// coefficient of the 1 power, and so on. Expressed this way, the
+ /// polynomial for the CRC-32C used in IEEE 802.3, is 0xEDB88320.
+ ///
+ ///
+ /// specify true if the instance should reverse data bits.
+ ///
+ ///
+ ///
+ ///
+ /// In the CRC-32 used by BZip2, the bits are reversed. Therefore if you
+ /// want a CRC32 with compatibility with BZip2, you should pass true
+ /// here for the reverseBits parameter. In the CRC-32 used by
+ /// GZIP and PKZIP, the bits are not reversed; Therefore if you want a
+ /// CRC32 with compatibility with those, you should pass false for the
+ /// reverseBits parameter.
+ ///
+ ///
+ public CRC32(int polynomial, bool reverseBits)
+ {
+ this.reverseBits = reverseBits;
+ this.dwPolynomial = (uint) polynomial;
+ this.GenerateLookupTable();
+ }
+
+ ///
+ /// Reset the CRC-32 class - clear the CRC "remainder register."
+ ///
+ ///
+ ///
+ /// Use this when employing a single instance of this class to compute
+ /// multiple, distinct CRCs on multiple, distinct data blocks.
+ ///
+ ///
+ public void Reset()
+ {
+ _register = 0xFFFFFFFFU;
+ }
+
+ // private member vars
+ private UInt32 dwPolynomial;
+ private Int64 _TotalBytesRead;
+ private bool reverseBits;
+ private UInt32[] crc32Table;
+ private const int BUFFER_SIZE = 8192;
+ private UInt32 _register = 0xFFFFFFFFU;
+ }
+
+
+ ///
+ /// A Stream that calculates a CRC32 (a checksum) on all bytes read,
+ /// or on all bytes written.
+ ///
+ ///
+ ///
+ ///
+ /// This class can be used to verify the CRC of a ZipEntry when
+ /// reading from a stream, or to calculate a CRC when writing to a
+ /// stream. The stream should be used to either read, or write, but
+ /// not both. If you intermix reads and writes, the results are not
+ /// defined.
+ ///
+ ///
+ ///
+ /// This class is intended primarily for use internally by the
+ /// DotNetZip library.
+ ///
+ ///
+ public class CrcCalculatorStream : System.IO.Stream, System.IDisposable
+ {
+ private static readonly Int64 UnsetLengthLimit = -99;
+
+ internal System.IO.Stream _innerStream;
+ private CRC32 _Crc32;
+ private Int64 _lengthLimit = -99;
+ private bool _leaveOpen;
+
+ ///
+ /// The default constructor.
+ ///
+ ///
+ ///
+ /// Instances returned from this constructor will leave the underlying
+ /// stream open upon Close(). The stream uses the default CRC32
+ /// algorithm, which implies a polynomial of 0xEDB88320.
+ ///
+ ///
+ /// The underlying stream
+ public CrcCalculatorStream(System.IO.Stream stream)
+ : this(true, CrcCalculatorStream.UnsetLengthLimit, stream, null)
+ {
+ }
+
+ ///
+ /// The constructor allows the caller to specify how to handle the
+ /// underlying stream at close.
+ ///
+ ///
+ ///
+ /// The stream uses the default CRC32 algorithm, which implies a
+ /// polynomial of 0xEDB88320.
+ ///
+ ///
+ /// The underlying stream
+ /// true to leave the underlying stream
+ /// open upon close of the CrcCalculatorStream; false otherwise.
+ public CrcCalculatorStream(System.IO.Stream stream, bool leaveOpen)
+ : this(leaveOpen, CrcCalculatorStream.UnsetLengthLimit, stream, null)
+ {
+ }
+
+ ///
+ /// A constructor allowing the specification of the length of the stream
+ /// to read.
+ ///
+ ///
+ ///
+ /// The stream uses the default CRC32 algorithm, which implies a
+ /// polynomial of 0xEDB88320.
+ ///
+ ///
+ /// Instances returned from this constructor will leave the underlying
+ /// stream open upon Close().
+ ///
+ ///
+ /// The underlying stream
+ /// The length of the stream to slurp
+ public CrcCalculatorStream(System.IO.Stream stream, Int64 length)
+ : this(true, length, stream, null)
+ {
+ if (length < 0)
+ throw new ArgumentException("length");
+ }
+
+ ///
+ /// A constructor allowing the specification of the length of the stream
+ /// to read, as well as whether to keep the underlying stream open upon
+ /// Close().
+ ///
+ ///
+ ///
+ /// The stream uses the default CRC32 algorithm, which implies a
+ /// polynomial of 0xEDB88320.
+ ///
+ ///
+ /// The underlying stream
+ /// The length of the stream to slurp
+ /// true to leave the underlying stream
+ /// open upon close of the CrcCalculatorStream; false otherwise.
+ public CrcCalculatorStream(System.IO.Stream stream, Int64 length, bool leaveOpen)
+ : this(leaveOpen, length, stream, null)
+ {
+ if (length < 0)
+ throw new ArgumentException("length");
+ }
+
+ ///
+ /// A constructor allowing the specification of the length of the stream
+ /// to read, as well as whether to keep the underlying stream open upon
+ /// Close(), and the CRC32 instance to use.
+ ///
+ ///
+ ///
+ /// The stream uses the specified CRC32 instance, which allows the
+ /// application to specify how the CRC gets calculated.
+ ///
+ ///
+ /// The underlying stream
+ /// The length of the stream to slurp
+ /// true to leave the underlying stream
+ /// open upon close of the CrcCalculatorStream; false otherwise.
+ /// the CRC32 instance to use to calculate the CRC32
+ public CrcCalculatorStream(System.IO.Stream stream, Int64 length, bool leaveOpen,
+ CRC32 crc32)
+ : this(leaveOpen, length, stream, crc32)
+ {
+ if (length < 0)
+ throw new ArgumentException("length");
+ }
+
+
+ // This ctor is private - no validation is done here. This is to allow the use
+ // of a (specific) negative value for the _lengthLimit, to indicate that there
+ // is no length set. So we validate the length limit in those ctors that use an
+ // explicit param, otherwise we don't validate, because it could be our special
+ // value.
+ private CrcCalculatorStream
+ (bool leaveOpen, Int64 length, System.IO.Stream stream, CRC32 crc32)
+ : base()
+ {
+ _innerStream = stream;
+ _Crc32 = crc32 ?? new CRC32();
+ _lengthLimit = length;
+ _leaveOpen = leaveOpen;
+ }
+
+
+ ///
+ /// Gets the total number of bytes run through the CRC32 calculator.
+ ///
+ ///
+ ///
+ /// This is either the total number of bytes read, or the total number of
+ /// bytes written, depending on the direction of this stream.
+ ///
+ public Int64 TotalBytesSlurped
+ {
+ get { return _Crc32.TotalBytesRead; }
+ }
+
+ ///
+ /// Provides the current CRC for all blocks slurped in.
+ ///
+ ///
+ ///
+ /// The running total of the CRC is kept as data is written or read
+ /// through the stream. read this property after all reads or writes to
+ /// get an accurate CRC for the entire stream.
+ ///
+ ///
+ public Int32 Crc
+ {
+ get { return _Crc32.Crc32Result; }
+ }
+
+ ///
+ /// Indicates whether the underlying stream will be left open when the
+ /// CrcCalculatorStream is Closed.
+ ///
+ ///
+ ///
+ /// Set this at any point before calling .
+ ///
+ ///
+ public bool LeaveOpen
+ {
+ get { return _leaveOpen; }
+ set { _leaveOpen = value; }
+ }
+
+ ///
+ /// Read from the stream
+ ///
+ /// the buffer to read
+ /// the offset at which to start
+ /// the number of bytes to read
+ /// the number of bytes actually read
+ public override int Read(byte[] buffer, int offset, int count)
+ {
+ int bytesToRead = count;
+
+ // Need to limit the # of bytes returned, if the stream is intended to have
+ // a definite length. This is especially useful when returning a stream for
+ // the uncompressed data directly to the application. The app won't
+ // necessarily read only the UncompressedSize number of bytes. For example
+ // wrapping the stream returned from OpenReader() into a StreadReader() and
+ // calling ReadToEnd() on it, We can "over-read" the zip data and get a
+ // corrupt string. The length limits that, prevents that problem.
+
+ if (_lengthLimit != CrcCalculatorStream.UnsetLengthLimit)
+ {
+ if (_Crc32.TotalBytesRead >= _lengthLimit) return 0; // EOF
+ Int64 bytesRemaining = _lengthLimit - _Crc32.TotalBytesRead;
+ if (bytesRemaining < count) bytesToRead = (int)bytesRemaining;
+ }
+ int n = _innerStream.Read(buffer, offset, bytesToRead);
+ if (n > 0) _Crc32.SlurpBlock(buffer, offset, n);
+ return n;
+ }
+
+ ///
+ /// Write to the stream.
+ ///
+ /// the buffer from which to write
+ /// the offset at which to start writing
+ /// the number of bytes to write
+ public override void Write(byte[] buffer, int offset, int count)
+ {
+ if (count > 0) _Crc32.SlurpBlock(buffer, offset, count);
+ _innerStream.Write(buffer, offset, count);
+ }
+
+ ///
+ /// Indicates whether the stream supports reading.
+ ///
+ public override bool CanRead
+ {
+ get { return _innerStream.CanRead; }
+ }
+
+ ///
+ /// Indicates whether the stream supports seeking.
+ ///
+ ///
+ ///
+ /// Always returns false.
+ ///
+ ///
+ public override bool CanSeek
+ {
+ get { return false; }
+ }
+
+ ///
+ /// Indicates whether the stream supports writing.
+ ///
+ public override bool CanWrite
+ {
+ get { return _innerStream.CanWrite; }
+ }
+
+ ///
+ /// Flush the stream.
+ ///
+ public override void Flush()
+ {
+ _innerStream.Flush();
+ }
+
+ ///
+ /// Returns the length of the underlying stream.
+ ///
+ public override long Length
+ {
+ get
+ {
+ if (_lengthLimit == CrcCalculatorStream.UnsetLengthLimit)
+ return _innerStream.Length;
+ else return _lengthLimit;
+ }
+ }
+
+ ///
+ /// The getter for this property returns the total bytes read.
+ /// If you use the setter, it will throw
+ /// .
+ ///
+ public override long Position
+ {
+ get { return _Crc32.TotalBytesRead; }
+ set { throw new NotSupportedException(); }
+ }
+
+ ///
+ /// Seeking is not supported on this stream. This method always throws
+ ///
+ ///
+ /// N/A
+ /// N/A
+ /// N/A
+ public override long Seek(long offset, System.IO.SeekOrigin origin)
+ {
+ throw new NotSupportedException();
+ }
+
+ ///
+ /// This method always throws
+ ///
+ ///
+ /// N/A
+ public override void SetLength(long value)
+ {
+ throw new NotSupportedException();
+ }
+
+
+ void IDisposable.Dispose()
+ {
+ Close();
+ }
+
+ ///
+ /// Closes the stream.
+ ///
+ public override void Close()
+ {
+ base.Close();
+ if (!_leaveOpen)
+ _innerStream.Close();
+ }
+
+ }
+
+}
\ No newline at end of file
diff --git a/dotNetZip/CommonSrc/Iso8859Dash1Encoding.cs b/dotNetZip/CommonSrc/Iso8859Dash1Encoding.cs
new file mode 100644
index 0000000..b182de8
--- /dev/null
+++ b/dotNetZip/CommonSrc/Iso8859Dash1Encoding.cs
@@ -0,0 +1,183 @@
+using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace Ionic.Encoding
+{
+ ///
+ /// Provides a text encoder for the iso-8859-1 encoding, aka Latin1 encoding,
+ /// for platforms that do not support it, for example on Silverlight or some
+ /// Compact Framework platforms.
+ ///
+ public class Iso8859Dash1Encoding : System.Text.Encoding
+ {
+ ///
+ /// Gets the name registered with the
+ /// Internet Assigned Numbers Authority (IANA) for the current encoding.
+ ///
+ ///
+ /// Always returns "iso-8859-1".
+ ///
+ public override string WebName
+ {
+ get { return "iso-8859-1"; }
+ }
+
+ ///
+ /// Encodes a set of characters from a character array into
+ /// a byte array.
+ ///
+ ///
+ /// The actual number of bytes written into .
+ ///
+ /// The character array containing the set of characters to encode.
+ /// The index of the first character to encode.
+ /// The number of characters to encode.
+ /// The byte array to contain the resulting sequence of bytes.
+ /// The index at which to start writing the resulting sequence of bytes.
+ ///
+ public override int GetBytes(char[] chars, int start, int count, byte[] bytes, int byteIndex)
+ {
+ if (chars == null)
+ throw new ArgumentNullException("chars", "null array");
+
+ if (bytes == null)
+ throw new ArgumentNullException("bytes", "null array");
+
+ if (start < 0)
+ throw new ArgumentOutOfRangeException("start");
+ if (count < 0)
+ throw new ArgumentOutOfRangeException("charCount");
+
+ if ((chars.Length - start) < count)
+ throw new ArgumentOutOfRangeException("chars");
+
+ if ((byteIndex < 0) || (byteIndex > bytes.Length))
+ throw new ArgumentOutOfRangeException("byteIndex");
+
+ // iso-8859-1 is special in that it was adopted as the first page of
+ // UCS - ISO's Universal Coding Standard, described in ISO 10646,
+ // which is the same as Unicode. This means that a a Unicode
+ // character in the range of 0 to FF maps to the iso-8859-1 character
+ // with the same value. Because of that the encoding and decoding is
+ // trivial.
+ for (int i=0; i < count; i++)
+ {
+ char c = chars[start+i]; // get the unicode char
+
+ if (c >= '\x00FF') // out of range?
+ bytes[byteIndex+i] = (byte) '?';
+ else
+ bytes[byteIndex+i] = (byte) c;
+ }
+ return count;
+ }
+
+
+ ///
+ /// Decodes a sequence of bytes from the specified byte array into the specified character array.
+ ///
+ ///
+ /// The actual number of characters written into .
+ ///
+ /// The byte array containing the sequence of bytes to decode.
+ /// The index of the first byte to decode.
+ /// The number of bytes to decode.
+ /// The character array to contain the resulting set of characters.
+ /// The index at which to start writing the resulting set of characters.
+ ///
+ public override int GetChars(byte[] bytes, int start, int count, char[] chars, int charIndex)
+ {
+ if (chars == null)
+ throw new ArgumentNullException("chars", "null array");
+
+ if (bytes == null)
+ throw new ArgumentNullException("bytes", "null array");
+
+ if (start < 0)
+ throw new ArgumentOutOfRangeException("start");
+ if (count < 0)
+ throw new ArgumentOutOfRangeException("charCount");
+
+ if ((bytes.Length - start) < count)
+ throw new ArgumentOutOfRangeException("bytes");
+
+ if ((charIndex < 0) || (charIndex > chars.Length))
+ throw new ArgumentOutOfRangeException("charIndex");
+
+ // In the range 00 to FF, the Unicode characters are the same as the
+ // iso-8859-1 characters; because of that, decoding is trivial.
+ for (int i = 0; i < count; i++)
+ chars[charIndex + i] = (char) bytes[i + start];
+
+ return count;
+ }
+
+
+ ///
+ /// Calculates the number of bytes produced by encoding a set of characters
+ /// from the specified character array.
+ ///
+ ///
+ /// The number of bytes produced by encoding the specified characters. This class
+ /// alwas returns the value of .
+ ///
+ public override int GetByteCount(char[] chars, int index, int count)
+ {
+ return count;
+ }
+
+
+ ///
+ /// Calculates the number of characters produced by decoding a sequence
+ /// of bytes from the specified byte array.
+ ///
+ ///
+ /// The number of characters produced by decoding the specified sequence of bytes. This class
+ /// alwas returns the value of .
+ ///
+ public override int GetCharCount(byte[] bytes, int index, int count)
+ {
+ return count;
+ }
+
+
+ ///
+ /// Calculates the maximum number of bytes produced by encoding the specified number of characters.
+ ///
+ ///
+ /// The maximum number of bytes produced by encoding the specified number of characters. This
+ /// class alwas returns the value of .
+ ///
+ /// The number of characters to encode.
+ ///
+ public override int GetMaxByteCount(int charCount)
+ {
+ return charCount;
+ }
+
+ ///
+ /// Calculates the maximum number of characters produced by decoding the specified number of bytes.
+ ///
+ ///
+ /// The maximum number of characters produced by decoding the specified number of bytes. This class
+ /// alwas returns the value of .
+ ///
+ /// The number of bytes to decode.
+ public override int GetMaxCharCount(int byteCount)
+ {
+ return byteCount;
+ }
+
+ ///
+ /// Gets the number of characters that are supported by this encoding.
+ /// This property returns a maximum value of 256, as the encoding class
+ /// only supports single byte encodings (1 byte == 256 possible values).
+ ///
+ public static int CharacterCount
+ {
+ get { return 256; }
+ }
+
+ }
+}
diff --git a/dotNetZip/DotNetZip.sln b/dotNetZip/DotNetZip.sln
new file mode 100644
index 0000000..6b26b59
--- /dev/null
+++ b/dotNetZip/DotNetZip.sln
@@ -0,0 +1,413 @@
+
+Microsoft Visual Studio Solution File, Format Version 11.00
+# Visual Studio 2010
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{E1C14695-E75F-4317-919A-5341EA1F9C01}"
+ ProjectSection(SolutionItems) = preProject
+ DotNetZip.vsmdi = DotNetZip.vsmdi
+ EndProjectSection
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zip DLL", "Zip\Zip DLL.csproj", "{D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zip Tests", "Zip Tests\Zip Tests.csproj", "{549466CE-5CA6-4904-BA44-58141544BE70}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zip CF DLL", "Zip CF\Zip CF DLL.csproj", "{051C2B3B-8CDF-42CB-9EA2-027232BFC395}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zip SL", "Zip SL\Zip SL.csproj", "{1F27CA58-54BD-485A-BC24-3B9176F62AC3}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zlib DLL", "Zlib\Zlib DLL.csproj", "{9816BA86-9250-4C00-A912-25F07F8677D1}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zlib Tests", "Zlib Tests\Zlib Tests.csproj", "{047A98B2-BC96-41B4-ADD8-2167FB1B6502}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zlib CF DLL", "Zlib CF\Zlib CF DLL.csproj", "{E082D395-52BE-41EE-812B-8B09C51025B4}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zlib SL DLL", "Zlib SL DLL\Zlib SL DLL.csproj", "{8E580B45-AECD-46BF-9D63-CD8BECE24D29}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BZip2 DLL", "BZip2\BZip2 DLL.csproj", "{E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BZip2 Tests", "BZip2 Tests\BZip2 Tests.csproj", "{11DC3AE9-D19F-4426-A7C8-15F17DE815BF}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BZip2 CF DLL", "BZip2 CF\BZip2 CF DLL.csproj", "{18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BZip2 SL DLL", "BZip2 SL DLL\BZip2 SL DLL.csproj", "{50E11F2C-9D49-45F5-A52D-560BE456CC04}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Zip Reduced", "Zip Reduced\Zip Reduced.csproj", "{49A128D3-C3F2-46B1-8F7A-EECD209EA860}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "CF-Unzipper", "Examples\CompactFramework\CF-Unzipper\CF-Unzipper.csproj", "{D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "QuickUnzip", "Examples\VB\Quick-Unzip\QuickUnzip.vbproj", "{95D9690B-3B37-4800-A511-6FB21436638B}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ZipDir", "Examples\C#\ZipDir\ZipDir.csproj", "{E04C2A53-3981-44D4-94AF-6AC07D97CDE8}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "CreateZip", "Examples\C#\CreateZip\CreateZip.csproj", "{FB9FC8D7-7897-4802-9694-F379F25C00CB}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ReadZip", "Examples\C#\ReadZip\ReadZip.csproj", "{F4024C01-1133-4A5A-B421-22EA8CA89EA5}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BZip2", "Tools\BZip2\BZip2.csproj", "{C2241050-F23C-420B-AA67-60E94B34C2B2}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "GZip", "Tools\GZip\GZip.csproj", "{52542D59-25EC-4EE4-8AF2-85DE50C70EA6}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "UnZip", "Tools\UnZip\UnZip.csproj", "{A22C89E0-B5D4-4881-A61F-4B1FD82F2453}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ZipIt", "Tools\ZipIt\ZipIt.csproj", "{98008721-C4DD-4F34-B3AE-A3453E29BB65}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ConvertZipToSfx", "Tools\ConvertZipToSfx\ConvertZipToSfx.csproj", "{276B8174-A24E-4257-9969-42D692F8CAC2}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Win Forms App", "Tools\WinFormsApp\Win Forms App.csproj", "{6BCCF138-2EFB-464C-B872-E3079F0A4708}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ZipTreeView", "Examples\C#\ZipTreeView\ZipTreeView.csproj", "{1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "WinForms-TreeViewZip", "Examples\VB\WinForms-TreeViewZip\WinForms-TreeViewZip\WinForms-TreeViewZip.vbproj", "{2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "WinForms-Unzip", "Examples\VB\WinForms-DotNetZip\WinForms-Unzip\WinForms-Unzip.vbproj", "{9E4C484D-656E-4E19-8741-5701D027AA51}"
+EndProject
+Project("{930C7802-8A8C-48F9-8165-68863BCCD9DD}") = "DotNetZipUtils", "Setup Utils\DotNetZipUtils.wixproj", "{18B1CDB1-709D-46D4-A894-9FE0BF929686}"
+EndProject
+Project("{930C7802-8A8C-48F9-8165-68863BCCD9DD}") = "DotNetZip Runtime", "Setup Runtime\DotNetZip Runtime.wixproj", "{CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}"
+EndProject
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Tools", "Tools", "{1BB61851-D01A-4788-8033-C1821FC3738B}"
+EndProject
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Examples", "Examples", "{F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}"
+EndProject
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Compact Framework", "Compact Framework", "{7CFA8083-4960-4BFE-8DF0-16034C828CDE}"
+EndProject
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Tests", "Tests", "{E29C6340-FD50-4857-8C45-7BA227646B00}"
+EndProject
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Setups", "Setups", "{70D5B6AD-813F-4CBC-AB08-60045171C377}"
+EndProject
+Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Silverlight", "Silverlight", "{E4B9972A-F80D-4D85-BF52-109D37856AC2}"
+EndProject
+Global
+ GlobalSection(TestCaseManagementSettings) = postSolution
+ CategoryFile = DotNetZip.vsmdi
+ EndGlobalSection
+ GlobalSection(SolutionConfigurationPlatforms) = preSolution
+ Debug|Any CPU = Debug|Any CPU
+ Debug|Mixed Platforms = Debug|Mixed Platforms
+ Debug|x86 = Debug|x86
+ Release|Any CPU = Release|Any CPU
+ Release|Mixed Platforms = Release|Mixed Platforms
+ Release|x86 = Release|x86
+ EndGlobalSection
+ GlobalSection(ProjectConfigurationPlatforms) = postSolution
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Release|Any CPU.Build.0 = Release|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}.Release|x86.ActiveCfg = Release|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Release|Any CPU.Build.0 = Release|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {549466CE-5CA6-4904-BA44-58141544BE70}.Release|x86.ActiveCfg = Release|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Release|Any CPU.Build.0 = Release|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}.Release|x86.ActiveCfg = Release|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Release|Any CPU.Build.0 = Release|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3}.Release|x86.ActiveCfg = Release|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Release|Any CPU.Build.0 = Release|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {9816BA86-9250-4C00-A912-25F07F8677D1}.Release|x86.ActiveCfg = Release|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Release|Any CPU.Build.0 = Release|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502}.Release|x86.ActiveCfg = Release|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Release|Any CPU.Build.0 = Release|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {E082D395-52BE-41EE-812B-8B09C51025B4}.Release|x86.ActiveCfg = Release|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Release|Any CPU.Build.0 = Release|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29}.Release|x86.ActiveCfg = Release|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Release|Any CPU.Build.0 = Release|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {E2CE0D56-7AF8-4404-BD0C-BC562CBD74D4}.Release|x86.ActiveCfg = Release|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Release|Any CPU.Build.0 = Release|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF}.Release|x86.ActiveCfg = Release|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Release|Any CPU.Build.0 = Release|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE}.Release|x86.ActiveCfg = Release|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Release|Any CPU.Build.0 = Release|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04}.Release|x86.ActiveCfg = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|Any CPU.Build.0 = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {49A128D3-C3F2-46B1-8F7A-EECD209EA860}.Release|x86.ActiveCfg = Release|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Release|Any CPU.Build.0 = Release|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}.Release|x86.ActiveCfg = Release|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Release|Any CPU.Build.0 = Release|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {95D9690B-3B37-4800-A511-6FB21436638B}.Release|x86.ActiveCfg = Release|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Release|Any CPU.Build.0 = Release|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}.Release|x86.ActiveCfg = Release|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Release|Any CPU.Build.0 = Release|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}.Release|x86.ActiveCfg = Release|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Release|Any CPU.Build.0 = Release|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}.Release|x86.ActiveCfg = Release|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Release|Any CPU.Build.0 = Release|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {C2241050-F23C-420B-AA67-60E94B34C2B2}.Release|x86.ActiveCfg = Release|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Release|Any CPU.Build.0 = Release|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6}.Release|x86.ActiveCfg = Release|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Release|Any CPU.Build.0 = Release|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453}.Release|x86.ActiveCfg = Release|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Release|Any CPU.Build.0 = Release|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65}.Release|x86.ActiveCfg = Release|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Release|Any CPU.Build.0 = Release|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {276B8174-A24E-4257-9969-42D692F8CAC2}.Release|x86.ActiveCfg = Release|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Release|Any CPU.Build.0 = Release|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708}.Release|x86.ActiveCfg = Release|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Release|Any CPU.Build.0 = Release|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}.Release|x86.ActiveCfg = Release|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Release|Any CPU.Build.0 = Release|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D}.Release|x86.ActiveCfg = Release|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Debug|Any CPU.Build.0 = Debug|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Debug|Mixed Platforms.ActiveCfg = Debug|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Debug|Mixed Platforms.Build.0 = Debug|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Debug|x86.ActiveCfg = Debug|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Release|Any CPU.ActiveCfg = Release|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Release|Any CPU.Build.0 = Release|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Release|Mixed Platforms.ActiveCfg = Release|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Release|Mixed Platforms.Build.0 = Release|Any CPU
+ {9E4C484D-656E-4E19-8741-5701D027AA51}.Release|x86.ActiveCfg = Release|Any CPU
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Debug|Any CPU.ActiveCfg = Debug|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Debug|Mixed Platforms.ActiveCfg = Debug|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Debug|Mixed Platforms.Build.0 = Debug|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Debug|x86.ActiveCfg = Debug|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Debug|x86.Build.0 = Debug|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Release|Any CPU.ActiveCfg = Release|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Release|Mixed Platforms.ActiveCfg = Release|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Release|Mixed Platforms.Build.0 = Release|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Release|x86.ActiveCfg = Release|x86
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686}.Release|x86.Build.0 = Release|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Debug|Any CPU.ActiveCfg = Debug|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Debug|Mixed Platforms.ActiveCfg = Debug|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Debug|Mixed Platforms.Build.0 = Debug|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Debug|x86.ActiveCfg = Debug|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Debug|x86.Build.0 = Debug|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Release|Any CPU.ActiveCfg = Release|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Release|Mixed Platforms.ActiveCfg = Release|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Release|Mixed Platforms.Build.0 = Release|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Release|x86.ActiveCfg = Release|x86
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F}.Release|x86.Build.0 = Release|x86
+ EndGlobalSection
+ GlobalSection(SolutionProperties) = preSolution
+ HideSolutionNode = FALSE
+ EndGlobalSection
+ GlobalSection(NestedProjects) = preSolution
+ {047A98B2-BC96-41B4-ADD8-2167FB1B6502} = {E29C6340-FD50-4857-8C45-7BA227646B00}
+ {11DC3AE9-D19F-4426-A7C8-15F17DE815BF} = {E29C6340-FD50-4857-8C45-7BA227646B00}
+ {549466CE-5CA6-4904-BA44-58141544BE70} = {E29C6340-FD50-4857-8C45-7BA227646B00}
+ {E082D395-52BE-41EE-812B-8B09C51025B4} = {7CFA8083-4960-4BFE-8DF0-16034C828CDE}
+ {18A4AED9-D477-4C57-9C7A-C0CBBD5599DE} = {7CFA8083-4960-4BFE-8DF0-16034C828CDE}
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395} = {7CFA8083-4960-4BFE-8DF0-16034C828CDE}
+ {8E580B45-AECD-46BF-9D63-CD8BECE24D29} = {E4B9972A-F80D-4D85-BF52-109D37856AC2}
+ {50E11F2C-9D49-45F5-A52D-560BE456CC04} = {E4B9972A-F80D-4D85-BF52-109D37856AC2}
+ {1F27CA58-54BD-485A-BC24-3B9176F62AC3} = {E4B9972A-F80D-4D85-BF52-109D37856AC2}
+ {95D9690B-3B37-4800-A511-6FB21436638B} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {2E78FB6A-EE17-4EE4-9D8D-BE9AE675C69D} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {9E4C484D-656E-4E19-8741-5701D027AA51} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B} = {F0743B6A-25EB-4D79-B5ED-AFB4F25C91B5}
+ {52542D59-25EC-4EE4-8AF2-85DE50C70EA6} = {1BB61851-D01A-4788-8033-C1821FC3738B}
+ {A22C89E0-B5D4-4881-A61F-4B1FD82F2453} = {1BB61851-D01A-4788-8033-C1821FC3738B}
+ {98008721-C4DD-4F34-B3AE-A3453E29BB65} = {1BB61851-D01A-4788-8033-C1821FC3738B}
+ {276B8174-A24E-4257-9969-42D692F8CAC2} = {1BB61851-D01A-4788-8033-C1821FC3738B}
+ {6BCCF138-2EFB-464C-B872-E3079F0A4708} = {1BB61851-D01A-4788-8033-C1821FC3738B}
+ {C2241050-F23C-420B-AA67-60E94B34C2B2} = {1BB61851-D01A-4788-8033-C1821FC3738B}
+ {CC0B949C-4F52-4DC1-9925-64DAA1CDD79F} = {70D5B6AD-813F-4CBC-AB08-60045171C377}
+ {18B1CDB1-709D-46D4-A894-9FE0BF929686} = {70D5B6AD-813F-4CBC-AB08-60045171C377}
+ EndGlobalSection
+EndGlobal
diff --git a/dotNetZip/DotNetZip.vsmdi b/dotNetZip/DotNetZip.vsmdi
new file mode 100644
index 0000000..d307431
--- /dev/null
+++ b/dotNetZip/DotNetZip.vsmdi
@@ -0,0 +1,404 @@
+
+
+
+ Basic smoke test
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Tests for WinZip AES Encryption
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ various tests for Streams, ZipOutputStream, etc
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Tests for compatibility with COM and other zip tools.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The standard list of tests. This is every test, except the "large number of small files" test, which takes a long time, and the winforms self extractor test, which requires user intervention.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/DotNetZip1.vsmdi b/dotNetZip/DotNetZip1.vsmdi
new file mode 100644
index 0000000..568b317
--- /dev/null
+++ b/dotNetZip/DotNetZip1.vsmdi
@@ -0,0 +1,444 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ testing spanned or split steams
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/EditCsproj.exe b/dotNetZip/EditCsproj.exe
new file mode 100644
index 0000000..a6853a6
Binary files /dev/null and b/dotNetZip/EditCsproj.exe differ
diff --git a/dotNetZip/Examples/ASP/AspClassic-ReadZip.asp b/dotNetZip/Examples/ASP/AspClassic-ReadZip.asp
new file mode 100644
index 0000000..da84ce0
--- /dev/null
+++ b/dotNetZip/Examples/ASP/AspClassic-ReadZip.asp
@@ -0,0 +1,184 @@
+<%@ LANGUAGE = VBScript %>
+<% Option Explicit %>
+<%
+
+' -------------------------------------------------------
+' ASP DotNetZip Example
+' -------------------------------------------------------
+' This example ASP page uses DotNetZip (Ionic.Zip.dll) via COM
+' interop. The page opens a zip file, then allows the user
+' to download any individual file within the zip file.
+'
+'' To get this to work, you must be sure to register DotNetZip for COM
+'' interop (regasm). Also you need to be sure that IIS/ASP has the correct
+'' permissions to instantiate the ZipFile object. In my experience I Was
+'' able to do this by copying Ionic.Zip.dll to the
+'' c:\windows\system32\inetsrv directory, then calling "regasm /codebbase
+'' Ionic.Zip.dll" from within that directory.
+
+'' This example assumes that the ASP page is deployed into a directory,
+'' that contains a subdirectory called "fodder". Fodder must be readable,
+'' and should contain one or more zip files. This page allows the user to
+'' select a zip file, then select a file within the zip file, and download
+'' that file.
+''
+''
+
+
+
+If Request.Form("Submit") = "Download" Then
+ dim pathForZipFile, fileToDownload
+ pathForZipFile= Request.Form("zipFile")
+ if pathForZipFile <> "" Then
+ fileToDownload = Request.Form("fileToDownload")
+ Response.Clear
+ Response.AddHeader "Content-Disposition", "attachment; filename=" & fileToDownload
+ Response.ContentType = "application/octet-stream"
+
+ pathForZipFile = Server.MapPath("fodder\" & pathForZipFile)
+
+ dim zip, ms
+ set zip = Server.CreateObject("Ionic.Zip.ZipFile")
+ zip.Initialize(pathForZipFile)
+
+ set ms = Server.CreateObject("System.IO.MemoryStream")
+
+ dim selectedEntry, entry
+ For Each entry in zip
+ If entry.FileName = fileToDownload Then
+ set selectedEntry = entry
+ End If
+ Next
+
+ selectedEntry.Extract_3(ms)
+ zip.Dispose
+
+ dim fred
+ fred = ms.ToArray
+
+ Response.BinaryWrite(fred)
+ ms.Dispose
+ End If
+
+Else
+
+%>
+
+
+
+ Simple DotNetZip Example
+
+
+
+
+
+
+
+
+
+
+
+
+
ASP DotNetZip
+
+
This page shows how to use DotNetZip from an ASP (Classic)
+page. This page reads zip files and allows the browser to download
+items from the zip files.
+
+
+
+
+
+
+<%
+End If
+%>
\ No newline at end of file
diff --git a/dotNetZip/Examples/ASPNET/GenerateZip-Csharp-FileStream.aspx b/dotNetZip/Examples/ASPNET/GenerateZip-Csharp-FileStream.aspx
new file mode 100644
index 0000000..6461e58
--- /dev/null
+++ b/dotNetZip/Examples/ASPNET/GenerateZip-Csharp-FileStream.aspx
@@ -0,0 +1,249 @@
+<%@ Page
+ Language="C#"
+ Debug="true"
+%>
+
+
+<%@ Import Namespace="System.Text" %>
+<%@ Import Namespace="System.IO" %>
+<%@ Import Namespace="Ionic.Zip" %>
+<%@ Import Namespace="System.Collections.Generic" %>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dotNetZip/Examples/ASPNET/GenerateZip-Csharp-MemoryStream.aspx b/dotNetZip/Examples/ASPNET/GenerateZip-Csharp-MemoryStream.aspx
new file mode 100644
index 0000000..fd5afc3
--- /dev/null
+++ b/dotNetZip/Examples/ASPNET/GenerateZip-Csharp-MemoryStream.aspx
@@ -0,0 +1,243 @@
+<%@ Page
+ Language="C#"
+ Debug="true"
+%>
+
+
+<%@ Import Namespace="System.Text" %>
+<%@ Import Namespace="System.IO" %>
+<%@ Import Namespace="Ionic.Zip" %>
+<%@ Import Namespace="System.Collections.Generic" %>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dotNetZip/Examples/ASPNET/GenerateZip-Csharp.aspx b/dotNetZip/Examples/ASPNET/GenerateZip-Csharp.aspx
new file mode 100644
index 0000000..734851b
--- /dev/null
+++ b/dotNetZip/Examples/ASPNET/GenerateZip-Csharp.aspx
@@ -0,0 +1,230 @@
+<%@ Page
+ Language="C#"
+ Debug="true"
+%>
+
+
+<%@ Import Namespace="System.Text" %>
+<%@ Import Namespace="System.IO" %>
+<%@ Import Namespace="Ionic.Zip" %>
+<%@ Import Namespace="System.Collections.Generic" %>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dotNetZip/Examples/ASPNET/GenerateZip-VB-FileStream.aspx b/dotNetZip/Examples/ASPNET/GenerateZip-VB-FileStream.aspx
new file mode 100644
index 0000000..6df7510
--- /dev/null
+++ b/dotNetZip/Examples/ASPNET/GenerateZip-VB-FileStream.aspx
@@ -0,0 +1,255 @@
+<%@ Page
+ Language="VB"
+ Debug="true"
+%>
+
+<%@ Import Namespace="System.Text" %>
+<%@ Import Namespace="System.IO" %>
+<%@ Import Namespace="Ionic.Zip" %>
+<%@ Import Namespace="System.Collections.Generic" %>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dotNetZip/Examples/ASPNET/GenerateZip-VB.aspx b/dotNetZip/Examples/ASPNET/GenerateZip-VB.aspx
new file mode 100644
index 0000000..174310e
--- /dev/null
+++ b/dotNetZip/Examples/ASPNET/GenerateZip-VB.aspx
@@ -0,0 +1,229 @@
+<%@ Page
+ Language="VB"
+ Debug="true"
+%>
+
+<%@ Import Namespace="System.Text" %>
+<%@ Import Namespace="System.IO" %>
+<%@ Import Namespace="Ionic.Zip" %>
+<%@ Import Namespace="System.Collections.Generic" %>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dotNetZip/Examples/C#/CreateZip/CreateZip.cs b/dotNetZip/Examples/C#/CreateZip/CreateZip.cs
new file mode 100644
index 0000000..5895198
--- /dev/null
+++ b/dotNetZip/Examples/C#/CreateZip/CreateZip.cs
@@ -0,0 +1,89 @@
+// CreateZip.cs
+//
+// ----------------------------------------------------------------------
+// Copyright (c) 2006, 2007, 2008 Microsoft Corporation. All rights reserved.
+//
+// This example is released under the Microsoft Permissive License of
+// October 2006. See the license.txt file accompanying this release for
+// full details.
+//
+// ----------------------------------------------------------------------
+//
+// This simplistic utility gets a list of all the files in the specified directory,
+// and zips them into a single archive. This utility does not recurse through
+// the directory tree.
+//
+// compile with:
+// csc /debug+ /target:exe /R:Ionic.Utils.Zip.dll /out:CreateZip.exe CreateZip.cs
+//
+//
+// Wed, 29 Mar 2006 14:36
+//
+
+using System;
+using Ionic.Zip;
+
+namespace Ionic.Zip.Examples
+{
+ public class CreateZip
+ {
+ private static void Usage()
+ {
+ Console.WriteLine("usage:\n CreateZip ");
+ Environment.Exit(1);
+ }
+
+ public static void Main(String[] args)
+ {
+ if (args.Length != 2) Usage();
+ if (!System.IO.Directory.Exists(args[1]))
+ {
+ Console.WriteLine("The directory does not exist!\n");
+ Usage();
+ }
+ if (System.IO.File.Exists(args[0]))
+ {
+ Console.WriteLine("That zipfile already exists!\n");
+ Usage();
+ }
+ if (!args[0].EndsWith(".zip"))
+ {
+ Console.WriteLine("The filename must end with .zip!\n");
+ Usage();
+ }
+
+ string ZipFileToCreate = args[0];
+ string DirectoryToZip = args[1];
+ try
+ {
+ using (ZipFile zip = new ZipFile())
+ {
+ // note: this does not recurse directories!
+ String[] filenames = System.IO.Directory.GetFiles(DirectoryToZip);
+
+ // This is just a sample, provided to illustrate the DotNetZip interface.
+ // This logic does not recurse through sub-directories.
+ // If you are zipping up a directory, you may want to see the AddDirectory() method,
+ // which operates recursively.
+ foreach (String filename in filenames)
+ {
+ Console.WriteLine("Adding {0}...", filename);
+ ZipEntry e= zip.AddFile(filename);
+ e.Comment = "Added by Cheeso's CreateZip utility.";
+ }
+
+ zip.Comment= String.Format("This zip archive was created by the CreateZip example application on machine '{0}'",
+ System.Net.Dns.GetHostName());
+
+ zip.Save(ZipFileToCreate);
+ }
+
+ }
+ catch (System.Exception ex1)
+ {
+ System.Console.Error.WriteLine("exception: " + ex1);
+ }
+
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/CreateZip/CreateZip.csproj b/dotNetZip/Examples/C#/CreateZip/CreateZip.csproj
new file mode 100644
index 0000000..c1b476d
--- /dev/null
+++ b/dotNetZip/Examples/C#/CreateZip/CreateZip.csproj
@@ -0,0 +1,101 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {FB9FC8D7-7897-4802-9694-F379F25C00CB}
+ Exe
+ Properties
+ CreateZip
+ CreateZip
+
+
+
+
+ 3.5
+ SAK
+ SAK
+ SAK
+ SAK
+ v2.0
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+
+
+
+
+
+
+
+
+ Properties\SolutionInfo.cs
+
+
+
+
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}
+ Zip DLL
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/CreateZip/Properties/AssemblyInfo.cs b/dotNetZip/Examples/C#/CreateZip/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..46a93e4
Binary files /dev/null and b/dotNetZip/Examples/C#/CreateZip/Properties/AssemblyInfo.cs differ
diff --git a/dotNetZip/Examples/C#/ReadZip/Properties/AssemblyInfo.cs b/dotNetZip/Examples/C#/ReadZip/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..84b052c
Binary files /dev/null and b/dotNetZip/Examples/C#/ReadZip/Properties/AssemblyInfo.cs differ
diff --git a/dotNetZip/Examples/C#/ReadZip/ReadZip.cs b/dotNetZip/Examples/C#/ReadZip/ReadZip.cs
new file mode 100644
index 0000000..485eac6
--- /dev/null
+++ b/dotNetZip/Examples/C#/ReadZip/ReadZip.cs
@@ -0,0 +1,70 @@
+// ReadZip.cs
+//
+// ----------------------------------------------------------------------
+// Copyright (c) 2006-2009 Microsoft Corporation. All rights reserved.
+//
+// This example is released under the Microsoft Public License .
+// See the license.txt file accompanying this release for
+// full details.
+//
+// ----------------------------------------------------------------------
+//
+// This simple example utility simply reads a zip archive and extracts
+// all elements in it, to the specified target directory.
+//
+// compile with:
+// csc /target:exe /r:Ionic.Zip.dll /out:ReadZip.exe ReadZip.cs
+//
+// Wed, 29 Mar 2006 14:36
+//
+
+
+using System;
+using Ionic.Zip;
+
+namespace Ionic.Zip.Examples
+{
+ public class ReadZip
+ {
+ private static void Usage()
+ {
+ Console.WriteLine("usage:\n ReadZip2 ");
+ Environment.Exit(1);
+ }
+
+
+ public static void Main(String[] args)
+ {
+
+ if (args.Length != 2) Usage();
+ if (!System.IO.File.Exists(args[0]))
+ {
+ Console.WriteLine("That zip file does not exist!\n");
+ Usage();
+ }
+
+ try
+ {
+ // Specifying Console.Out here causes diagnostic msgs to be sent to the Console
+ // In a WinForms or WPF or Web app, you could specify nothing, or an alternate
+ // TextWriter to capture diagnostic messages.
+
+ var options = new ReadOptions { StatusMessageWriter = System.Console.Out };
+ using (ZipFile zip = ZipFile.Read(args[0], options))
+ {
+ // This call to ExtractAll() assumes:
+ // - none of the entries are password-protected.
+ // - want to extract all entries to current working directory
+ // - none of the files in the zip already exist in the directory;
+ // if they do, the method will throw.
+ zip.ExtractAll(args[1]);
+ }
+ }
+ catch (System.Exception ex1)
+ {
+ System.Console.Error.WriteLine("exception: " + ex1);
+ }
+
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ReadZip/ReadZip.csproj b/dotNetZip/Examples/C#/ReadZip/ReadZip.csproj
new file mode 100644
index 0000000..447e230
--- /dev/null
+++ b/dotNetZip/Examples/C#/ReadZip/ReadZip.csproj
@@ -0,0 +1,101 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {F4024C01-1133-4A5A-B421-22EA8CA89EA5}
+ Exe
+ Properties
+ ReadZip
+ ReadZip
+
+
+
+
+ 3.5
+ SAK
+ SAK
+ SAK
+ SAK
+ v2.0
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+
+
+
+
+
+
+
+
+ Properties\SolutionInfo.cs
+
+
+
+
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}
+ Zip DLL
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/WinForms-QuickZip/AssemblyInfo.cs b/dotNetZip/Examples/C#/WinForms-QuickZip/AssemblyInfo.cs
new file mode 100644
index 0000000..c4d81b0
Binary files /dev/null and b/dotNetZip/Examples/C#/WinForms-QuickZip/AssemblyInfo.cs differ
diff --git a/dotNetZip/Examples/C#/WinForms-QuickZip/QuickZip.cs b/dotNetZip/Examples/C#/WinForms-QuickZip/QuickZip.cs
new file mode 100644
index 0000000..b187ef0
--- /dev/null
+++ b/dotNetZip/Examples/C#/WinForms-QuickZip/QuickZip.cs
@@ -0,0 +1,226 @@
+// QuickZip.cs
+// ------------------------------------------------------------------
+//
+// A simple app that creates a zip file, zipping up a files and
+// directories specified on the command line. This application needs to
+// be run from the console, in order to specify arguments, but it is
+// also a winforms app.
+//
+// It correctly does the multi-threading to allow smooth UI update.
+//
+// compile it with:
+// c:\.net3.5\csc.exe /t:exe /debug:full /optimize- /R:System.dll /R:Ionic.Zip.dll
+// /out:QuickZip.exe QuickZip.cs
+//
+// last saved:
+// Time-stamp: <2010-March-16 14:11:42>
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2010 by Dino Chiesa
+// All rights reserved!
+//
+// Licensed under the Microsoft Public License.
+// see http://www.opensource.org/licenses/ms-pl.html
+//
+// ------------------------------------------------------------------
+
+using System;
+//using System.Reflection;
+using System.Windows.Forms; // Form, Label, ProgressBar
+using Ionic.Zip; // ZipFile, ZipEntry
+using System.ComponentModel; // BackgroundWorker
+using Interop=System.Runtime.InteropServices; // DllImport
+
+namespace Ionic.Zip.Examples.CS
+{
+ public class QuickZip
+ {
+ [Interop.DllImport("kernel32.dll")]
+ private static extern bool AllocConsole();
+
+ [Interop.DllImport("kernel32.dll")]
+ private static extern bool AttachConsole(int pid);
+
+ [STAThread]
+ public static void Main(string[] args)
+ {
+ if (args.Length != 2)
+ {
+ // open a new window so we can write to it.
+ QuickZip.AllocConsole();
+ QuickZip.Usage(args);
+ return;
+ }
+ else
+ {
+ Application.EnableVisualStyles();
+ Application.SetCompatibleTextRenderingDefault(false);
+ var f = new QuickZipForm(args[0], args[1]);
+ Application.Run(f);
+ }
+ return;
+ }
+
+ private static int Usage(string[] args)
+ {
+ Console.WriteLine("QuickUnzip. Usage: QuickZip ");
+ Console.WriteLine("\n to continue...");
+ Console.ReadLine();
+ return 1;
+ }
+
+ }
+
+
+
+ public class QuickZipForm : Form
+ {
+
+ private QuickZipForm()
+ {
+ this.components = null;
+ this.InitializeComponent();
+ }
+
+ public QuickZipForm(string zipfile, string selectionCriteria) : this()
+ {
+ this.zipfileName = zipfile;
+ this.selectionCriteria = selectionCriteria;
+ }
+
+ protected override void Dispose(Boolean disposing)
+ {
+ if (disposing && (this.components != null))
+ this.components.Dispose();
+
+ base.Dispose(disposing);
+ }
+
+ private void FixTitle()
+ {
+ this.Text = String.Format("Quick Zip {0}", this.zipfileName);
+ }
+
+ private void InitializeComponent()
+ {
+ this.components = new System.ComponentModel.Container();
+ this.label1 = new Label();
+ this.progressBar1 = new ProgressBar();
+ base.SuspendLayout();
+ this.label1.AutoSize = true;
+ this.label1.Location = new System.Drawing.Point(12, 12);
+ this.label1.Name = "label1";
+ this.label1.Size = new System.Drawing.Size(50, 13);
+ this.label1.TabIndex = 2;
+ this.label1.Text = "Zipping...";
+ this.progressBar1.Anchor = (AnchorStyles.Right | (AnchorStyles.Left | AnchorStyles.Top));
+ this.progressBar1.Location = new System.Drawing.Point(12, 36);
+ this.progressBar1.Name = "progressBar1";
+ this.progressBar1.Size = new System.Drawing.Size(436, 18);
+ this.progressBar1.Step = 1;
+ this.progressBar1.TabIndex = 7;
+ base.AutoScaleDimensions = new System.Drawing.SizeF(6, 13);
+ base.AutoScaleMode = AutoScaleMode.Font;
+ base.ClientSize = new System.Drawing.Size(460, 80);
+ base.Controls.Add(this.label1);
+ base.Controls.Add(this.progressBar1);
+ base.Name = "QuickUnzipForm";
+ this.Text = "QuickUnzip";
+ this.Load += this.QuickZipForm_Load;
+ this.Shown += this.QuickZipForm_Shown;
+ base.ResumeLayout(false);
+ base.PerformLayout();
+ }
+
+ public void OnTimerEvent(Object source, EventArgs e)
+ {
+ base.Close();
+ }
+
+ private void QuickZipForm_Load(Object sender, EventArgs e)
+ {
+ this.FixTitle();
+ }
+
+ private void QuickZipForm_Shown(Object sender, EventArgs e)
+ {
+ // For info on running long-running tasks in response to button clicks,
+ // in VB.NET WinForms, see
+ // http://msdn.microsoft.com/en-us/library/ms951089.aspx
+
+ var backgroundWorker1 = new System.ComponentModel.BackgroundWorker();
+ backgroundWorker1.WorkerSupportsCancellation = false;
+ backgroundWorker1.WorkerReportsProgress = true;
+ backgroundWorker1.DoWork += this.Zipit;
+ backgroundWorker1.RunWorkerAsync();
+ }
+
+
+ public void SaveProgress(object sender, SaveProgressEventArgs e)
+ {
+ if (this.InvokeRequired)
+ {
+ this.Invoke(new Action(SaveProgress), new Object[] { sender, e });
+ }
+ else
+ {
+ switch (e.EventType)
+ {
+ case ZipProgressEventType.Saving_Started:
+ //Console.WriteLine("pb max {0}", e.EntriesTotal);
+ this.progressBar1.Maximum = e.EntriesTotal;
+ this.progressBar1.Value = 0;
+ this.progressBar1.Minimum = 0;
+ this.progressBar1.Step = 1;
+ break;
+
+ case ZipProgressEventType.Saving_BeforeWriteEntry:
+ //Console.WriteLine("entry {0}", e.CurrentEntry.FileName);
+ this.label1.Text = e.CurrentEntry.FileName;
+ break;
+
+ case ZipProgressEventType.Saving_AfterWriteEntry:
+ this.progressBar1.PerformStep();
+ break;
+ }
+ this.Update();
+ Application.DoEvents();
+ }
+ }
+
+
+ private void Zipit(object sender, DoWorkEventArgs e)
+ {
+ int delay = 1200; // ms to keep form open after completion
+ try
+ {
+ using (var zip = new ZipFile())
+ {
+ zip.AddSelectedFiles(selectionCriteria, ".", "", true);
+ zip.SaveProgress += this.SaveProgress;
+ zip.Save(zipfileName);
+ }
+ }
+ catch (Exception ex1)
+ {
+ this.label1.Text = "Exception: " + ex1.ToString();
+ delay = 4000;
+ }
+
+ var timer1 = new System.Timers.Timer(delay);
+ timer1.Enabled = true;
+ timer1.AutoReset = false;
+ timer1.Elapsed += this.OnTimerEvent;
+ }
+
+
+ // Fields
+ private String selectionCriteria;
+ private String zipfileName;
+ private System.ComponentModel.IContainer components ;
+ private Label label1;
+ private ProgressBar progressBar1;
+ }
+
+}
+
diff --git a/dotNetZip/Examples/C#/WinForms-QuickZip/QuickZip.csproj b/dotNetZip/Examples/C#/WinForms-QuickZip/QuickZip.csproj
new file mode 100644
index 0000000..325f564
--- /dev/null
+++ b/dotNetZip/Examples/C#/WinForms-QuickZip/QuickZip.csproj
@@ -0,0 +1,66 @@
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {4bc34fff-1fa8-4f1d-86ff-4842045785de}
+ Exe
+ Properties
+ QuickZip
+ QuickZip
+
+
+
+
+ 2.0
+ SAK
+ SAK
+ SAK
+ SAK
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE
+ prompt
+ 4
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE
+ prompt
+ 4
+
+
+
+
+
+
+
+
+
+
+
+ Properties\SolutionInfo.cs
+
+
+
+
+ {4F7A9BBE-5221-46C5-9E47-1E8B547CF258}
+ Zip Full DLL
+
+
+
+
+
diff --git a/dotNetZip/Examples/C#/ZLIB/ParallelGZipOutputStream.cs b/dotNetZip/Examples/C#/ZLIB/ParallelGZipOutputStream.cs
new file mode 100644
index 0000000..ed54655
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/ParallelGZipOutputStream.cs
@@ -0,0 +1,1221 @@
+//#define Trace
+
+// ParallelGZipOutputStream.cs
+// ------------------------------------------------------------------
+//
+// A GzipStream that does compression only, and only in output. It uses a
+// divide-and-conquer approach with multiple threads to exploit multiple
+// CPUs for the DEFLATE computation.
+//
+// Last Saved: <2011-July-11 14:36:48>
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2009-2011 by Dino Chiesa
+// All rights reserved!
+//
+// ------------------------------------------------------------------
+//
+// compile: c:\.net4.0\csc.exe /t:module /R:Ionic.Zip.dll @@ORIG@@
+// flymake: c:\.net4.0\csc.exe /t:module /R:Ionic.Zip.dll @@FILE@@
+//
+
+using System;
+using System.Collections.Concurrent;
+using System.Threading.Tasks;
+using System.Threading;
+using Ionic.Zlib;
+using System.IO;
+
+
+namespace Ionic.Exploration
+{
+ internal class WorkItem
+ {
+ public byte[] buffer;
+ public byte[] compressed;
+ public int crc;
+ public int index;
+ public int ordinal;
+ public int inputBytesAvailable;
+ public int compressedBytesAvailable;
+
+ public ZlibCodec compressor;
+
+ public WorkItem(int size,
+ Ionic.Zlib.CompressionLevel compressLevel,
+ CompressionStrategy strategy)
+ {
+ buffer= new byte[size];
+ // alloc 5 bytes overhead for every block (margin of safety= 2)
+ int n = size + ((size / 32768)+1) * 5 * 2;
+ compressed = new byte[n];
+
+ compressor = new ZlibCodec();
+ compressor.InitializeDeflate(compressLevel, false);
+ compressor.OutputBuffer = compressed;
+ compressor.InputBuffer = buffer;
+ }
+ }
+
+ ///
+ /// A class for compressing and decompressing streams using the
+ /// Deflate algorithm with multiple threads.
+ ///
+ ///
+ ///
+ ///
+ /// This class is for compression only, and that can be only
+ /// through writing.
+ ///
+ ///
+ ///
+ /// For more information on the Deflate algorithm, see IETF RFC 1952,
+ /// "GZIP file format specification version 4.3" http://tools.ietf.org/html/rfc1952
+ ///
+ ///
+ ///
+ /// This class is similar to , except that this
+ /// implementation uses an approach that employs multiple worker threads
+ /// to perform the compression. On a multi-cpu or multi-core computer,
+ /// the performance of this class can be significantly higher than the
+ /// single-threaded DeflateStream, particularly for larger streams. How
+ /// large? In my experience, Anything over 10mb is a good candidate for parallel
+ /// compression.
+ ///
+ ///
+ ///
+ /// The tradeoff is that this class uses more memory and more CPU than the
+ /// vanilla DeflateStream, and also is slightly less efficient as a compressor. For
+ /// large files the size of the compressed data stream can be less than 1%
+ /// larger than the size of a compressed data stream from the vanialla
+ /// DeflateStream. For smaller files the difference can be larger. The
+ /// difference will also be larger if you set the BufferSize to be lower
+ /// than the default value. Your mileage may vary. Finally, for small
+ /// files, the ParallelGZipOutputStream can be much slower than the vanilla
+ /// DeflateStream, because of the overhead of using the thread pool.
+ ///
+ ///
+ ///
+ ///
+ public class ParallelGZipOutputStream : System.IO.Stream
+ {
+ private static readonly int IO_BUFFER_SIZE_DEFAULT = 64 * 1024;
+
+ private System.Collections.Generic.List _pool;
+ private bool _leaveOpen;
+ private bool emitting;
+ private System.IO.Stream _outStream;
+ private Ionic.Zlib.CRC32 _runningCrc;
+ private int _currentlyFilling;
+ private AutoResetEvent _newlyCompressedBlob;
+ private int _lastWritten;
+ private int _latestCompressed;
+ private string _comment;
+ private string _FileName;
+ private int _lastFilled;
+ private int _bufferSize;
+ private int _nBuckets;
+ private object _latestLock = new object();
+ private object _outputLock = new object();
+ private bool _isClosed;
+ private bool _firstWriteDone;
+ private int _Crc32;
+ private Int64 _totalBytesProcessed;
+ private Ionic.Zlib.CompressionLevel _compressLevel;
+ private volatile Exception _pendingException;
+ private object _eLock = new Object(); // protects _pendingException
+ private BlockingCollection _toWrite;
+ private BlockingCollection _toCompress;
+ private BlockingCollection _toFill;
+
+ // This bitfield is used only when Trace is defined.
+
+ //private TraceBits _DesiredTrace = TraceBits.All;
+ private TraceBits _DesiredTrace = TraceBits.Compress |
+ TraceBits.Session |
+ TraceBits.WriteTake |
+ TraceBits.WriteEnter |
+ TraceBits.EmitEnter |
+ TraceBits.EmitDone |
+ TraceBits.EmitLock |
+ TraceBits.EmitSkip |
+ TraceBits.EmitBegin;
+
+ ///
+ /// Create a ParallelGZipOutputStream.
+ ///
+ ///
+ ///
+ ///
+ /// This stream compresses data written into it via the DEFLATE
+ /// algorithm (see RFC 1951), and writes out the compressed byte stream.
+ ///
+ ///
+ ///
+ /// The instance will use the default compression level, the default
+ /// buffer sizes and the default number of threads and buffers per
+ /// thread.
+ ///
+ ///
+ ///
+ /// This class is similar to ,
+ /// except that this implementation uses an approach that employs
+ /// multiple worker threads to perform the DEFLATE. On a multi-cpu or
+ /// multi-core computer, the performance of this class can be
+ /// significantly higher than the single-threaded DeflateStream,
+ /// particularly for larger streams. How large? Anything over 10mb is
+ /// a good candidate for parallel compression.
+ ///
+ ///
+ ///
+ ///
+ ///
+ ///
+ /// This example shows how to use a ParallelGZipOutputStream to compress
+ /// data. It reads a file, compresses it, and writes the compressed data to
+ /// a second, output file.
+ ///
+ ///
+ /// byte[] buffer = new byte[WORKING_BUFFER_SIZE];
+ /// int n= -1;
+ /// String outputFile = fileToCompress + ".compressed";
+ /// using (System.IO.Stream input = System.IO.File.OpenRead(fileToCompress))
+ /// {
+ /// using (var raw = System.IO.File.Create(outputFile))
+ /// {
+ /// using (Stream compressor = new ParallelGZipOutputStream(raw))
+ /// {
+ /// while ((n= input.Read(buffer, 0, buffer.Length)) != 0)
+ /// {
+ /// compressor.Write(buffer, 0, n);
+ /// }
+ /// }
+ /// }
+ /// }
+ ///
+ ///
+ /// Dim buffer As Byte() = New Byte(4096) {}
+ /// Dim n As Integer = -1
+ /// Dim outputFile As String = (fileToCompress & ".compressed")
+ /// Using input As Stream = File.OpenRead(fileToCompress)
+ /// Using raw As FileStream = File.Create(outputFile)
+ /// Using compressor As Stream = New ParallelGZipOutputStream(raw)
+ /// Do While (n <> 0)
+ /// If (n > 0) Then
+ /// compressor.Write(buffer, 0, n)
+ /// End If
+ /// n = input.Read(buffer, 0, buffer.Length)
+ /// Loop
+ /// End Using
+ /// End Using
+ /// End Using
+ ///
+ ///
+ /// The stream to which compressed data will be written.
+ public ParallelGZipOutputStream(System.IO.Stream stream)
+ : this(stream, CompressionLevel.Default, CompressionStrategy.Default, false)
+ {
+ }
+
+ ///
+ /// Create a ParallelDeflateOutputStream using the specified CompressionLevel.
+ ///
+ ///
+ /// See the
+ /// constructor for example code.
+ ///
+ /// The stream to which compressed data will be written.
+ /// A tuning knob to trade speed for effectiveness.
+ public ParallelGZipOutputStream(System.IO.Stream stream, CompressionLevel level)
+ : this(stream, level, CompressionStrategy.Default, false)
+ {
+ }
+
+ ///
+ /// Create a ParallelDeflateOutputStream and specify whether to leave the captive stream open
+ /// when the ParallelDeflateOutputStream is closed.
+ ///
+ ///
+ /// See the
+ /// constructor for example code.
+ ///
+ /// The stream to which compressed data will be written.
+ ///
+ /// true if the application would like the stream to remain open after inflation/deflation.
+ ///
+ public ParallelGZipOutputStream(System.IO.Stream stream, bool leaveOpen)
+ : this(stream, CompressionLevel.Default, CompressionStrategy.Default, leaveOpen)
+ {
+ }
+
+ ///
+ /// Create a ParallelDeflateOutputStream and specify whether to leave the captive stream open
+ /// when the ParallelDeflateOutputStream is closed.
+ ///
+ ///
+ /// See the
+ /// constructor for example code.
+ ///
+ /// The stream to which compressed data will be written.
+ /// A tuning knob to trade speed for effectiveness.
+ ///
+ /// true if the application would like the stream to remain open after inflation/deflation.
+ ///
+ public ParallelGZipOutputStream(System.IO.Stream stream, CompressionLevel level, bool leaveOpen)
+ : this(stream, CompressionLevel.Default, CompressionStrategy.Default, leaveOpen)
+ {
+ }
+
+ ///
+ /// Create a ParallelDeflateOutputStream using the specified
+ /// CompressionLevel and CompressionStrategy, and specifying whether to
+ /// leave the captive stream open when the ParallelDeflateOutputStream is
+ /// closed.
+ ///
+ ///
+ /// See the
+ /// constructor for example code.
+ ///
+ /// The stream to which compressed data will be written.
+ /// A tuning knob to trade speed for effectiveness.
+ ///
+ /// By tweaking this parameter, you may be able to optimize the compression for
+ /// data with particular characteristics.
+ ///
+ ///
+ /// true if the application would like the stream to remain open after inflation/deflation.
+ ///
+ public ParallelGZipOutputStream(System.IO.Stream stream,
+ CompressionLevel level,
+ CompressionStrategy strategy,
+ bool leaveOpen)
+ {
+ TraceOutput(TraceBits.Lifecycle | TraceBits.Session, "-------------------------------------------------------");
+ TraceOutput(TraceBits.Lifecycle | TraceBits.Session, "Create {0:X8}", this.GetHashCode());
+ _outStream = stream;
+ _compressLevel= level;
+ Strategy = strategy;
+ _leaveOpen = leaveOpen;
+
+ _nBuckets = 4; // default
+ _bufferSize = IO_BUFFER_SIZE_DEFAULT;
+ }
+
+
+ ///
+ /// The ZLIB strategy to be used during compression.
+ ///
+ ///
+ public CompressionStrategy Strategy
+ {
+ get;
+ private set;
+ }
+
+ ///
+ /// The number of buffers to use.
+ ///
+ ///
+ ///
+ ///
+ /// This property sets the number of memory buffers to create. This
+ /// sets an upper limit on the amount of memory the stream can use,
+ /// and also the degree of parallelism the stream can employ.
+ ///
+ ///
+ ///
+ /// The divide-and-conquer approach taken by this class assumes a
+ /// single thread from the application will call Write(). There
+ /// will be multiple Tasks that then compress (DEFLATE) the data
+ /// written into the stream. The application's thread aggregates
+ /// those results and emits the compressed output.
+ ///
+ ///
+ ///
+ /// The default value is 4. Different values may deliver better or
+ /// worse results, depending on the dynamic performance
+ /// characteristics of your storage and compute resources. If you
+ /// have more than 2 CPUs, or more than 3gb memory, you probably
+ /// want to increase this value.
+ ///
+ ///
+ ///
+ /// The total amount of storage space allocated for buffering will
+ /// be (M*S*2), where M is the multiple (this property), S is the
+ /// size of each buffer (). There are 2
+ /// buffers used by the compressor, one for input and one for
+ /// output. If you retain the default values for Buckets (4), and
+ /// BufferSize (64k), then the ParallelDeflateOutputStream will use
+ /// 512kb of buffer memory in total.
+ ///
+ ///
+ ///
+ /// The application can set this value at any time, but it is effective
+ /// only before the first call to Write(), which is when the buffers are
+ /// allocated.
+ ///
+ ///
+ public int Buckets
+ {
+ get
+ {
+ return _nBuckets;
+ }
+ set
+ {
+ if (value < 1 || value > 10240)
+ throw new ArgumentOutOfRangeException("Buckets",
+ "Buckets must be between 1 and 10240");
+ _nBuckets = value;
+ TraceOutput(TraceBits.Instance, "Buckets {0}", _nBuckets);
+ }
+ }
+
+ ///
+ /// The size of the buffers used by the compressor threads.
+ ///
+ ///
+ ///
+ ///
+ /// The default buffer size is 128k. The application can set
+ /// this value at any time, but it is effective only before
+ /// the first Write().
+ ///
+ ///
+ ///
+ /// Larger buffer sizes implies larger memory consumption but allows
+ /// more efficient compression. Using smaller buffer sizes consumes less
+ /// memory but result in less effective compression. For example, using
+ /// the default buffer size of 128k, the compression delivered is within
+ /// 1% of the compression delivered by the single-threaded . On the other hand, using a
+ /// BufferSize of 8k can result in a compressed data stream that is 5%
+ /// larger than that delivered by the single-threaded
+ /// DeflateStream. Excessively small buffer sizes can also cause
+ /// the speed of the ParallelDeflateOutputStream to drop, because of
+ /// larger thread scheduling overhead dealing with many many small
+ /// buffers.
+ ///
+ ///
+ ///
+ /// The total amount of storage space allocated for buffering will be
+ /// (n*M*S*2), where n is the number of CPUs, M is the multiple (), S is the size of each buffer (this
+ /// property), and there are 2 buffers used by the compressor, one for
+ /// input and one for output. For example, if your machine has a total
+ /// of 4 cores, and if you set to 3, and
+ /// you keep the default buffer size of 128k, then the
+ /// ParallelDeflateOutputStream will use 3mb of buffer memory in
+ /// total.
+ ///
+ ///
+ ///
+ public int BufferSize
+ {
+ get { return _bufferSize;}
+ set
+ {
+ if (value < 1024)
+ throw new ArgumentOutOfRangeException("BufferSize",
+ "BufferSize must be greater than 1024 bytes");
+ _bufferSize = value;
+ TraceOutput(TraceBits.Instance, "BufferSize {0}", _bufferSize);
+ }
+ }
+
+ ///
+ /// The CRC32 for the pre-compressed data that was written through the stream.
+ ///
+ ///
+ /// This value is meaningful only after a call to Close().
+ ///
+ public int Crc32 { get { return _Crc32; } }
+
+
+ ///
+ /// The total number of uncompressed bytes processed by the ParallelGZipOutputStream.
+ ///
+ ///
+ /// This value is meaningful only after a call to Close().
+ ///
+ public Int64 BytesProcessed { get { return _totalBytesProcessed; } }
+
+
+ ///
+ /// The comment on the GZIP stream.
+ ///
+ ///
+ ///
+ ///
+ /// The GZIP format allows for each file to optionally have an associated
+ /// comment stored with the file. The comment is encoded with the ISO-8859-1
+ /// code page. To include a comment in a GZIP stream you create, set this
+ /// property before calling Write() for the first time on the
+ /// ParallelGZipOutputStream.
+ ///
+ ///
+ ///
+ public String Comment
+ {
+ get
+ {
+ return _comment;
+ }
+ set
+ {
+ if (_firstWriteDone)
+ throw new InvalidOperationException();
+
+ _comment = value;
+ }
+ }
+
+
+ ///
+ /// The FileName for the GZIP stream.
+ ///
+ ///
+ ///
+ ///
+ ///
+ /// The GZIP format optionally allows each compressed file to embed an
+ /// associated filename. This property holds that value. Set this
+ /// property before calling Write() the first time on the
+ /// ParallelGZipOutputStream. The actual filename is encoded
+ /// into the GZIP bytestream with the ISO-8859-1 code page, according
+ /// to RFC 1952. It is the application's responsibility to insure that
+ /// the FileName can be encoded and decoded correctly with this code
+ /// page.
+ ///
+ ///
+ ///
+ /// The value of this property is merely written into the GZIP output.
+ /// There is nothing in this class that verifies that the value you
+ /// set here is consistent with any filesystem file the compressed
+ /// data eventually written to, if any.
+ ///
+ ///
+ public String FileName
+ {
+ get { return _FileName; }
+ set
+ {
+ if (_firstWriteDone)
+ throw new InvalidOperationException();
+
+ _FileName = value;
+ if (_FileName == null) return;
+ if (_FileName.IndexOf("/") != -1)
+ _FileName = _FileName.Replace("/", "\\");
+
+ if (_FileName.EndsWith("\\"))
+ throw new ArgumentException("FileName", "The FileName property may not end in slash.");
+
+ if (_FileName.IndexOf("\\") != -1)
+ _FileName = Path.GetFileName(_FileName);
+ }
+ }
+
+
+ ///
+ /// The last modified time for the GZIP stream.
+ ///
+ ///
+ ///
+ /// GZIP allows the storage of a last modified time with each GZIP entry.
+ /// When compressing data, you must set this before the first call to
+ /// Write(), in order for it to be written to the output stream.
+ ///
+ public DateTime? LastModified;
+
+
+ private void _TakeAndCompress()
+ {
+ var rnd = new System.Random();
+
+ while (!_toCompress.IsCompleted)
+ {
+ WorkItem workitem = null;
+ int ix = -1;
+ try
+ {
+ ix = _toCompress.Take();
+ workitem = _pool[ix];
+ }
+ catch (InvalidOperationException)
+ {
+ // The collection has been completed.
+ // Some other thread has called CompleteAdding()
+ // after this thread passed the
+ // IsCompleted check.
+ }
+ if (workitem == null) continue;
+
+ try
+ {
+ TraceOutput(TraceBits.Compress,
+ "Compress lock wi({0}) ord({1})",
+ workitem.index,
+ workitem.ordinal);
+
+ // compress one buffer
+ Ionic.Zlib.CRC32 crc = new CRC32();
+ int ib = workitem.inputBytesAvailable;
+ crc.SlurpBlock(workitem.buffer, 0, workitem.inputBytesAvailable);
+ DeflateOneSegment(workitem);
+ workitem.crc = crc.Crc32Result;
+ TraceOutput(TraceBits.Compress,
+ "Compress done wi({0}) ord({1}) ib-({2}) cba({3})",
+ workitem.index,
+ workitem.ordinal,
+ ib,
+ workitem.compressedBytesAvailable
+ );
+
+ lock(_latestLock)
+ {
+ if (workitem.ordinal > _latestCompressed)
+ _latestCompressed = workitem.ordinal;
+ }
+
+ _toWrite.Add(workitem.index);
+ _newlyCompressedBlob.Set();
+ }
+ catch (System.Exception exc1)
+ {
+ lock(_eLock)
+ {
+ // expose the exception to the main thread
+ if (_pendingException!=null)
+ _pendingException = exc1;
+ }
+ }
+ }
+ }
+
+
+
+ private void _InitializeBuffers()
+ {
+ _toCompress = new BlockingCollection(Buckets);
+ _toFill = new BlockingCollection(Buckets);
+ _toWrite = new BlockingCollection(new ConcurrentQueue());
+ _pool = new System.Collections.Generic.List();
+ for(int i=0; i < Buckets; i++)
+ {
+ _pool.Add(new WorkItem(_bufferSize, _compressLevel, Strategy));
+ _toFill.Add(i);
+
+ // Start one perpetual compressor task per bucket.
+ Task.Factory.StartNew( _TakeAndCompress );
+ }
+
+ // for diagnostic purposes only
+ for(int i=0; i < _pool.Count; i++)
+ _pool[i].index= i;
+
+ _newlyCompressedBlob = new AutoResetEvent(false);
+ _runningCrc = new Ionic.Zlib.CRC32();
+ _currentlyFilling = -1;
+ _lastFilled = -1;
+ _lastWritten = -1;
+ _latestCompressed = -1;
+ }
+
+
+ internal static readonly System.DateTime _unixEpoch = new System.DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Utc);
+ internal static readonly System.Text.Encoding iso8859dash1 = System.Text.Encoding.GetEncoding("iso-8859-1");
+
+
+ private int EmitHeader()
+ {
+ byte[] commentBytes = (Comment == null) ? null : iso8859dash1.GetBytes(Comment);
+ byte[] filenameBytes = (FileName == null) ? null : iso8859dash1.GetBytes(FileName);
+
+ int cbLength = (Comment == null) ? 0 : commentBytes.Length + 1;
+ int fnLength = (FileName == null) ? 0 : filenameBytes.Length + 1;
+
+ int bufferLength = 10 + cbLength + fnLength;
+ byte[] header = new byte[bufferLength];
+ int i = 0;
+ // ID
+ header[i++] = 0x1F;
+ header[i++] = 0x8B;
+
+ // compression method
+ header[i++] = 8;
+ byte flag = 0;
+ if (Comment != null)
+ flag ^= 0x10;
+ if (FileName != null)
+ flag ^= 0x8;
+
+ // flag
+ header[i++] = flag;
+
+ // mtime
+ if (!LastModified.HasValue) LastModified = DateTime.Now;
+ System.TimeSpan delta = LastModified.Value - _unixEpoch;
+ Int32 timet = (Int32)delta.TotalSeconds;
+ Array.Copy(BitConverter.GetBytes(timet), 0, header, i, 4);
+ i += 4;
+
+ // xflg
+ header[i++] = 0; // this field is totally useless
+ // OS
+ header[i++] = 0xFF; // 0xFF == unspecified
+
+ // extra field length - only if FEXTRA is set, which it is not.
+ //header[i++]= 0;
+ //header[i++]= 0;
+
+ // filename
+ if (fnLength != 0)
+ {
+ Array.Copy(filenameBytes, 0, header, i, fnLength - 1);
+ i += fnLength - 1;
+ header[i++] = 0; // terminate
+ }
+
+ // comment
+ if (cbLength != 0)
+ {
+ Array.Copy(commentBytes, 0, header, i, cbLength - 1);
+ i += cbLength - 1;
+ header[i++] = 0; // terminate
+ }
+
+ _outStream.Write(header, 0, header.Length);
+
+ return header.Length; // bytes written
+ }
+
+
+
+ private void _EmitPendingBuffers(bool doAll, bool mustWait)
+ {
+ // When combining parallel deflation with a ZipSegmentedStream, it's
+ // possible for the ZSS to throw from within this method. In that
+ // case, Close/Dispose will be called on this stream, if this stream
+ // is employed within a using or try/finally pair as required. But
+ // this stream is unaware of the pending exception, so the Close()
+ // method invokes this method AGAIN. This can lead to a deadlock.
+ // Therefore, failfast if re-entering.
+
+ if (emitting) return;
+ emitting = true;
+
+ if (doAll || mustWait)
+ _newlyCompressedBlob.WaitOne();
+
+ do
+ {
+ int firstSkip = -1;
+ int millisecondsToWait = doAll ? 200 : (mustWait ? -1 : 0);
+ int nextToWrite;
+
+ while (_toWrite.TryTake(out nextToWrite, millisecondsToWait))
+ {
+ WorkItem workitem = _pool[nextToWrite];
+ if (workitem.ordinal != _lastWritten + 1)
+ {
+ // not the needed ordinal, so requeue and try again.
+ TraceOutput(TraceBits.EmitSkip,
+ "Emit skip wi({0}) ord({1}) lw({2}) fs({3})",
+ workitem.index,
+ workitem.ordinal,
+ _lastWritten,
+ firstSkip);
+
+ _toWrite.Add(nextToWrite);
+
+ if (firstSkip == nextToWrite)
+ {
+ // We went around the list once.
+ // None of the items in the list is the one we want.
+ // Now wait for a compressor to signal.
+ _newlyCompressedBlob.WaitOne();
+ firstSkip = -1;
+ }
+ else if (firstSkip == -1)
+ firstSkip = nextToWrite;
+
+ continue;
+ }
+
+ firstSkip = -1;
+
+ TraceOutput(TraceBits.EmitBegin,
+ "Emit begin wi({0}) ord({1}) cba({2})",
+ workitem.index,
+ workitem.ordinal,
+ workitem.compressedBytesAvailable);
+
+ _outStream.Write(workitem.compressed, 0, workitem.compressedBytesAvailable);
+ _runningCrc.Combine(workitem.crc, workitem.inputBytesAvailable);
+ _totalBytesProcessed += workitem.inputBytesAvailable;
+ workitem.inputBytesAvailable= 0;
+
+ TraceOutput(TraceBits.EmitDone,
+ "Emit done wi({0}) ord({1}) cba({2}) mtw({3})",
+ workitem.index,
+ workitem.ordinal,
+ workitem.compressedBytesAvailable,
+ millisecondsToWait);
+
+ _lastWritten = workitem.ordinal;
+ _toFill.Add(workitem.index);
+
+ // don't wait next time through
+ if (millisecondsToWait == -1) millisecondsToWait = 0;
+ }
+
+ } while (doAll &&
+ !_toCompress.IsCompleted &&
+ (_lastWritten != _latestCompressed));
+
+ emitting = false;
+ }
+
+
+
+
+
+ ///
+ /// Write data to the stream.
+ ///
+ ///
+ ///
+ ///
+ ///
+ /// To use the ParallelGZipOutputStream to compress data, create a
+ /// ParallelGZipOutputStream, passing a writable output stream.
+ /// Then call Write() on that ParallelGZipOutputStream, providing
+ /// uncompressed data as input. The data sent to the output stream
+ /// will be the compressed form of the data written into the stream.
+ ///
+ ///
+ ///
+ /// To decompress data, use the class.
+ /// Any RFC-1951
+ ///
+ ///
+ ///
+ /// The buffer holding data to write to the stream.
+ /// the offset within that data array to find the first byte to write.
+ /// the number of bytes to write.
+ public override void Write(byte[] buffer, int offset, int count)
+ {
+ bool wantWaitEmit = false;
+ if (_isClosed)
+ throw new InvalidOperationException();
+
+ // dispense any exception that occurred on the BG threads
+ if (_pendingException != null)
+ throw _pendingException;
+
+ if (count == 0) return; // NOP
+
+ TraceOutput(TraceBits.WriteEnter, "Write enter");
+
+ if (!_firstWriteDone)
+ {
+ _InitializeBuffers();
+ _firstWriteDone = true;
+ EmitHeader();
+ }
+
+ do
+ {
+ // may need to make buffers available
+ _EmitPendingBuffers(false, wantWaitEmit);
+
+ wantWaitEmit = false;
+ // use current, or get a buffer to fill
+ int ix = -1;
+ if (_currentlyFilling >= 0)
+ {
+ ix = _currentlyFilling;
+ TraceOutput(TraceBits.WriteTake,
+ "Write notake wi({0}) lf({1})",
+ ix,
+ _lastFilled);
+ }
+ else
+ {
+ TraceOutput(TraceBits.WriteTake, "Write take?");
+ if (!_toFill.TryTake(out ix, 0))
+ {
+ // no available buffers, so... need to emit
+ // compressed buffers.
+ wantWaitEmit = true;
+ continue;
+ }
+
+ TraceOutput(TraceBits.WriteTake,
+ "Write take wi({0}) lf({1})",
+ ix,
+ _lastFilled);
+ ++_lastFilled; // TODO: consider rollover?
+ }
+
+ WorkItem workitem = _pool[ix];
+
+ int limit = ((workitem.buffer.Length - workitem.inputBytesAvailable) > count)
+ ? count
+ : (workitem.buffer.Length - workitem.inputBytesAvailable);
+
+ workitem.ordinal = _lastFilled;
+
+ TraceOutput(TraceBits.Write,
+ "Write lock wi({0}) ord({1}) iba({2})",
+ workitem.index,
+ workitem.ordinal,
+ workitem.inputBytesAvailable );
+
+ // copy from the provided buffer to our workitem, starting at
+ // the tail end of whatever data we might have in there currently.
+ Array.Copy(buffer,
+ offset,
+ workitem.buffer,
+ workitem.inputBytesAvailable,
+ limit);
+
+ count -= limit;
+ offset += limit;
+ workitem.inputBytesAvailable += limit;
+
+ if (workitem.inputBytesAvailable==workitem.buffer.Length)
+ {
+ TraceOutput(TraceBits.Write,
+ "Write full wi({0}) ord({1}) iba({2})",
+ workitem.index,
+ workitem.ordinal,
+ workitem.inputBytesAvailable );
+ _toCompress.Add(ix);
+ _currentlyFilling = -1; // will get a new buffer next time
+ }
+ else
+ {
+ _currentlyFilling = ix;
+ }
+
+ if (count > 0)
+ TraceOutput(TraceBits.WriteEnter, "Write more");
+ }
+ while (count > 0); // until no more to write
+
+ TraceOutput(TraceBits.WriteEnter, "Write exit");
+ return;
+ }
+
+
+
+ private void _FlushFinish()
+ {
+ // After writing a series of compressed buffers, each one closed
+ // with Flush.Sync, we now write the final one as Flush.Finish,
+ // and then stop.
+ byte[] buffer = new byte[128];
+ var compressor = new ZlibCodec();
+ int rc = compressor.InitializeDeflate(_compressLevel, false);
+ compressor.InputBuffer = null;
+ compressor.NextIn = 0;
+ compressor.AvailableBytesIn = 0;
+ compressor.OutputBuffer = buffer;
+ compressor.NextOut = 0;
+ compressor.AvailableBytesOut = buffer.Length;
+ rc = compressor.Deflate(FlushType.Finish);
+
+ if (rc != ZlibConstants.Z_STREAM_END && rc != ZlibConstants.Z_OK)
+ throw new Exception("deflating: " + compressor.Message);
+
+ if (buffer.Length - compressor.AvailableBytesOut > 0)
+ {
+ TraceOutput(TraceBits.EmitBegin,
+ "Emit begin flush bytes({0})",
+ buffer.Length - compressor.AvailableBytesOut);
+
+ _outStream.Write(buffer, 0, buffer.Length - compressor.AvailableBytesOut);
+
+ TraceOutput(TraceBits.EmitDone,
+ "Emit done flush");
+ }
+
+ compressor.EndDeflate();
+
+ _Crc32 = _runningCrc.Crc32Result;
+ }
+
+
+ private void _EmitTrailer()
+ {
+ // Emit the GZIP trailer: CRC32 and size mod 2^32
+ _outStream.Write(BitConverter.GetBytes(_runningCrc.Crc32Result), 0, 4);
+
+ int c2 = (Int32)(_totalBytesProcessed & 0x00000000FFFFFFFF);
+ _outStream.Write(BitConverter.GetBytes(c2), 0, 4);
+ }
+
+
+ private void _Flush(bool lastInput)
+ {
+ if (_isClosed)
+ throw new InvalidOperationException();
+
+ // post the current partial buffer to the _toCompress queue
+ if (_currentlyFilling>=0)
+ {
+ _toCompress.Add(_currentlyFilling);
+ TraceOutput(TraceBits.Flush,
+ "Flush filled wi({0})",
+ _currentlyFilling);
+
+ _currentlyFilling = -1; // get a new buffer next Write()
+ }
+
+ if (lastInput)
+ {
+ //_toWrite.CompleteAdding(); // cannot do because of sifting
+ _toCompress.CompleteAdding();
+ _EmitPendingBuffers(true, false);
+ _FlushFinish();
+ _EmitTrailer();
+ }
+ else
+ {
+ _EmitPendingBuffers(false, false);
+ }
+ }
+
+
+
+ ///
+ /// Flush the stream.
+ ///
+ public override void Flush()
+ {
+ _Flush(false);
+ }
+
+
+
+ ///
+ /// Close the stream.
+ ///
+ ///
+ ///
+ /// The application must call Close() on this stream to guarantee
+ /// that all of the data written in has been compressed, and the
+ /// compressed data has been written out.
+ ///
+ ///
+ /// Close() is called implicitly when this stream is used within
+ /// a using clause.
+ ///
+ ///
+ public override void Close()
+ {
+ TraceOutput(TraceBits.Session, "Close {0:X8}", this.GetHashCode());
+
+ if (_isClosed) return;
+
+ _Flush(true);
+
+ if (!_leaveOpen)
+ _outStream.Close();
+
+ _isClosed= true;
+ }
+
+
+
+ /// Dispose the object
+ ///
+ ///
+ /// Because ParallelDeflateOutputStream is IDisposable, the
+ /// application must call this method when finished using the instance.
+ ///
+ ///
+ /// This method is generally called implicitly upon exit from
+ /// a using scope in C# (Using in VB).
+ ///
+ ///
+ new public void Dispose()
+ {
+ TraceOutput(TraceBits.Lifecycle, "Dispose {0:X8}", this.GetHashCode());
+ _pool = null;
+ Close();
+ Dispose(true);
+ }
+
+
+
+ /// The Dispose method
+ protected override void Dispose(bool disposeManagedResources)
+ {
+ if (disposeManagedResources)
+ {
+ // dispose managed resources
+ }
+ }
+
+
+
+ private bool DeflateOneSegment(WorkItem workitem)
+ {
+ ZlibCodec compressor = workitem.compressor;
+ int rc= 0;
+ compressor.ResetDeflate();
+ compressor.NextIn = 0;
+
+ compressor.AvailableBytesIn = workitem.inputBytesAvailable;
+
+ // step 1: deflate the buffer
+ compressor.NextOut = 0;
+ compressor.AvailableBytesOut = workitem.compressed.Length;
+ do
+ {
+ compressor.Deflate(FlushType.None);
+ }
+ while (compressor.AvailableBytesIn > 0 || compressor.AvailableBytesOut == 0);
+
+ // step 2: flush (sync)
+ rc = compressor.Deflate(FlushType.Sync);
+
+ workitem.compressedBytesAvailable = (int) compressor.TotalBytesOut;
+ return true;
+ }
+
+
+
+ [System.Diagnostics.ConditionalAttribute("Trace")]
+ private void TraceOutput(TraceBits bits, string format, params object[] varParams)
+ {
+ if ((bits & _DesiredTrace) != 0)
+ {
+ lock(_outputLock)
+ {
+ int tid = Thread.CurrentThread.GetHashCode();
+#if !SILVERLIGHT
+ Console.ForegroundColor = (ConsoleColor) (tid % 8 + 8);
+#endif
+ Console.Write("{0:000} PGOS ", tid);
+ Console.WriteLine(format, varParams);
+#if !SILVERLIGHT
+ Console.ResetColor();
+#endif
+ }
+ }
+ }
+
+
+
+ // used only when Trace is defined
+ [Flags]
+ enum TraceBits : uint
+ {
+ None = 0,
+ NotUsed1 = 1,
+ EmitLock = 2,
+ EmitEnter = 4, // enter _EmitPending
+ EmitBegin = 8, // begin to write out
+ EmitDone = 16, // done writing out
+ EmitSkip = 32, // writer skipping a workitem
+ EmitAll = 58, // All Emit flags
+ Flush = 64,
+ Lifecycle = 128, // constructor/disposer
+ Session = 256, // Close/Reset
+ Synch = 512, // thread synchronization
+ Instance = 1024, // instance settings
+ Compress = 2048, // compress task
+ Write = 4096, // filling buffers, when caller invokes Write()
+ WriteEnter = 8192, // upon entry to Write()
+ WriteTake = 16384, // on _toFill.Take()
+ All = 0xffffffff,
+ }
+
+
+
+ ///
+ /// Indicates whether the stream supports Seek operations.
+ ///
+ ///
+ /// Always returns false.
+ ///
+ public override bool CanSeek
+ {
+ get { return false; }
+ }
+
+
+ ///
+ /// Indicates whether the stream supports Read operations.
+ ///
+ ///
+ /// Always returns false.
+ ///
+ public override bool CanRead
+ {
+ get {return false;}
+ }
+
+ ///
+ /// Indicates whether the stream supports Write operations.
+ ///
+ ///
+ /// Returns true if the provided stream is writable.
+ ///
+ public override bool CanWrite
+ {
+ get { return _outStream.CanWrite; }
+ }
+
+ ///
+ /// Reading this property always throws a NotSupportedException.
+ ///
+ public override long Length
+ {
+ get { throw new NotSupportedException(); }
+ }
+
+ ///
+ /// Writing this property always throws a NotSupportedException.
+ /// On Read, the value is the number of bytes written so far to the
+ /// output.
+ ///
+ ///
+ public override long Position
+ {
+ get { return _outStream.Position; }
+ set { throw new NotSupportedException(); }
+ }
+
+ ///
+ /// This method always throws a NotSupportedException.
+ ///
+ public override int Read(byte[] buffer, int offset, int count)
+ {
+ throw new NotSupportedException();
+ }
+
+ ///
+ /// This method always throws a NotSupportedException.
+ ///
+ public override long Seek(long offset, System.IO.SeekOrigin origin)
+ {
+ throw new NotSupportedException();
+ }
+
+ ///
+ /// This method always throws a NotSupportedException.
+ ///
+ public override void SetLength(long value)
+ {
+ throw new NotSupportedException();
+ }
+ }
+}
+
+
diff --git a/dotNetZip/Examples/C#/ZLIB/QuickCompress.cs b/dotNetZip/Examples/C#/ZLIB/QuickCompress.cs
new file mode 100644
index 0000000..9a5b0c7
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/QuickCompress.cs
@@ -0,0 +1,234 @@
+// QuickCompress.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2009-2011 by Dino Chiesa
+// All rights reserved!
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Purpose: Demonstrate compression and decompression with the easy
+// helper methods in the Ionic.Zlib namespace.
+//
+// ------------------------------------------------------------------
+//
+
+using System;
+using System.Text;
+using System.Reflection;
+using Ionic.Zlib;
+using System.Security.Cryptography;
+using System.Diagnostics;
+
+
+// to allow fast ngen
+[assembly: AssemblyTitle("QuickCompress.cs")]
+[assembly: AssemblyDescription("Demonstrate compression and decompression using the helper methods in the IOnic.Zlib namespace")]
+[assembly: AssemblyConfiguration("")]
+[assembly: AssemblyCompany("Dino Chiesa")]
+[assembly: AssemblyProduct("DotNetZip Examples")]
+[assembly: AssemblyCopyright("Copyright Dino Chiesa 2009-2011")]
+[assembly: AssemblyTrademark("")]
+[assembly: AssemblyCulture("")]
+[assembly: AssemblyVersion("1.1.1.1")]
+
+
+namespace Ionic.ToolsAndTests
+{
+
+ ///
+ /// Holds the results of the compression.
+ ///
+ ///
+ ///
+ /// Compression algorithms can be measured two ways: size of the
+ /// result, and the time required to compress. This small class
+ /// just holds the measured result for a particular compression
+ /// algorithm.
+ ///
+ ///
+ public class CompressionTrialResult
+ {
+ public string Label;
+ public int Cycles;
+ public byte[] CompressedData;
+ public TimeSpan TimeForManyCycles;
+
+ public void Show()
+ {
+ Console.WriteLine("{0}", this.Label);
+ Console.WriteLine(" Compressed Size : {0}", this.CompressedData.Length);
+ Console.WriteLine(" Time for {0} cycles: {1:N1}s",
+ this.Cycles,
+ this.TimeForManyCycles.TotalSeconds);
+ }
+ }
+
+
+ public class QuickCompress
+ {
+ internal static string GoPlacidly =
+ @"Go placidly amid the noise and haste, and remember what peace there may be in silence.
+
+As far as possible, without surrender, be on good terms with all persons. Speak your truth quietly and clearly; and listen to others, even to the dull and the ignorant, they too have their story. Avoid loud and aggressive persons, they are vexations to the spirit.
+
+If you compare yourself with others, you may become vain and bitter; for always there will be greater and lesser persons than yourself. Enjoy your achievements as well as your plans. Keep interested in your own career, however humble; it is a real possession in the changing fortunes of time.
+
+Exercise caution in your business affairs, for the world is full of trickery. But let this not blind you to what virtue there is; many persons strive for high ideals, and everywhere life is full of heroism. Be yourself. Especially, do not feign affection. Neither be cynical about love, for in the face of all aridity and disenchantment it is perennial as the grass.
+
+Take kindly to the counsel of the years, gracefully surrendering the things of youth. Nurture strength of spirit to shield you in sudden misfortune. But do not distress yourself with imaginings. Many fears are born of fatigue and loneliness.
+
+Beyond a wholesome discipline, be gentle with yourself. You are a child of the universe, no less than the trees and the stars; you have a right to be here. And whether or not it is clear to you, no doubt the universe is unfolding as it should.
+
+Therefore be at peace with God, whatever you conceive Him to be, and whatever your labors and aspirations, in the noisy confusion of life, keep peace in your soul.
+
+With all its sham, drudgery and broken dreams, it is still a beautiful world.
+
+Be cheerful. Strive to be happy.
+
+Max Ehrmann c.1920
+";
+
+
+ ///
+ /// Perform one trial, measuring the effectiveness and speed
+ /// of compression.
+ ///
+ ///
+ /// the label for the trial
+ ///
+ /// a function that accepts a string,
+ /// and returns a byte array representing the compressed
+ /// form
+ ///
+ /// a function that accepts a byte
+ /// array, and decompresses it, returning a string.
+ ///
+ /// the string to compress and decompress
+ ///
+ /// the number of cycles to time
+ ///
+ /// the CompressionTrialResult describing the trial results
+ ///
+ ///
+ ///
+ public CompressionTrialResult DoTrial(string label,
+ Func compressor,
+ Func decompressor,
+ string s,
+ int nCycles)
+ {
+ byte[] compressed = compressor(s);
+
+ // verify that the compression decompresses correctly
+ string uncompressed = decompressor(compressed);
+ if (s.Length != uncompressed.Length)
+ throw new Exception("decompression failed.");
+
+ // compress the same thing 1000 times, and measure the time
+ var stopwatch = new Stopwatch();
+ stopwatch.Start();
+ for (int i=0; i < nCycles; i++)
+ compressed = compressor(s);
+
+ stopwatch.Stop();
+
+ var result = new CompressionTrialResult
+ {
+ Label = label,
+ CompressedData = compressed,
+ Cycles = nCycles,
+ TimeForManyCycles = stopwatch.Elapsed
+ };
+ return result;
+ }
+
+
+ internal static string ByteArrayToHexString(byte[] b)
+ {
+ var sb1 = new StringBuilder();
+ for (int i = 0; i < b.Length; i++)
+ {
+ sb1.Append(String.Format("{0:X2}", b[i]));
+ }
+ return sb1.ToString().ToLower();
+ }
+
+
+ private void Run()
+ {
+ Console.WriteLine("Compressing a string...");
+
+ int lengthOriginal = GoPlacidly.Length;
+
+ // do the compression:
+ byte[] b = ZlibStream.CompressString(GoPlacidly);
+
+ int lengthCompressed = b.Length;
+
+ Console.WriteLine();
+ Console.WriteLine(" Original Length: {0}", lengthOriginal);
+ Console.WriteLine("Compressed Length: {0}", lengthCompressed);
+ Console.WriteLine(" Compression %: {0:n1}%", lengthCompressed/(0.01 * lengthOriginal));
+ Console.WriteLine("Compressed Data : {0}", ByteArrayToHexString(b));
+ Console.WriteLine();
+
+ // now let's do some timed trials
+ Console.WriteLine("Doing timing runs....");
+ CompressionTrialResult result;
+ result = DoTrial("Zlib",
+ ZlibStream.CompressString,
+ ZlibStream.UncompressString,
+ GoPlacidly,
+ 10000);
+ result.Show();
+ result = DoTrial("GZip",
+ GZipStream.CompressString,
+ GZipStream.UncompressString,
+ GoPlacidly,
+ 10000);
+ result.Show();
+
+ result = DoTrial("Deflate",
+ DeflateStream.CompressString,
+ DeflateStream.UncompressString,
+ GoPlacidly,
+ 10000);
+ result.Show();
+
+ // All these classes use the same underlying algorithm - DEFLATE -
+ // which means they all produce compressed forms that are roughly the
+ // same size. The difference between them is only in the metadata
+ // surrounding the raw compressed streams, and the level of integrity
+ // checking they provide. For example, during compression, the
+ // GzipStream internally calculates an Alder checksum on the data;
+ // during decompression, it verifies that checksum, as an integrity
+ // check. The other classes don't do this. Therefore the GZipStream
+ // will always take slightly longer in compression and decompression
+ // than the others, and will produce compressed streams that are
+ // slightly larger. The results will show that.
+ }
+
+
+ [STAThread]
+ public static void Main(System.String[] args)
+ {
+ try
+ {
+ var me = new QuickCompress();
+ me.Run();
+ }
+ catch (System.Exception e1)
+ {
+ Console.WriteLine("Exception: " + e1);
+ }
+ }
+ }
+}
diff --git a/dotNetZip/Examples/C#/ZLIB/ZlibDeflateInflate.cs b/dotNetZip/Examples/C#/ZLIB/ZlibDeflateInflate.cs
new file mode 100644
index 0000000..3161580
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/ZlibDeflateInflate.cs
@@ -0,0 +1,210 @@
+// ZlibDeflateInflate.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2009 by Dino Chiesa
+// All rights reserved!
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Purpose: Demonstrate compression and decompression with the ZlibCodec
+// class, which is part of the Ionic.Zlib namespace.
+//
+// ------------------------------------------------------------------
+//
+
+using System;
+using System.Text;
+using System.IO;
+using System.Reflection;
+using System.Security.Cryptography; // HashAlgorithm
+using Ionic.Zlib;
+
+// to allow fast ngen
+[assembly: AssemblyTitle("ZlibDeflateInflate.cs")]
+[assembly: AssemblyDescription("Demonstrate compression and decompression with the ZlibCodec class")]
+[assembly: AssemblyConfiguration("")]
+[assembly: AssemblyCompany("Dino Chiesa")]
+[assembly: AssemblyProduct("DotNetZip Examples")]
+[assembly: AssemblyCopyright("Copyright Dino Chiesa 2009")]
+[assembly: AssemblyTrademark("")]
+[assembly: AssemblyCulture("")]
+[assembly: AssemblyVersion("1.1.1.1")]
+
+
+namespace Ionic.ToolsAndTests
+{
+ public class ZlibDeflateInflate
+ {
+ private HashAlgorithm alg = new SHA256CryptoServiceProvider();
+
+ public ZlibDeflateInflate () {}
+
+ public byte[] ComputeHash(byte[] data)
+ {
+ return alg.ComputeHash(data);
+ }
+
+
+ public byte[] ComputeHash(string text)
+ {
+ return alg.ComputeHash(UTF8Encoding.UTF8.GetBytes( text ));
+ }
+
+ private static string ByteArrayToString(byte[] buffer)
+ {
+ System.Text.StringBuilder sb = new System.Text.StringBuilder();
+ foreach (byte b in buffer)
+ sb.Append(b.ToString("X2"));
+
+ return (sb.ToString());
+ }
+
+
+
+ public void Run()
+ {
+ System.Console.WriteLine("\nThis program demonstrates compression of strings with the\nIonic.Zlib.ZlibCodec class.\n");
+
+ string textToCompress = File.ReadAllText("ZlibDeflateInflate.cs");
+ string hashOfOriginal = ByteArrayToString(ComputeHash(textToCompress));
+ System.Console.WriteLine("hash of original: {0}", hashOfOriginal);
+ System.Console.WriteLine("length of original: {0}", textToCompress.Length);
+
+ byte[] compressed = ZlibCodecCompress(textToCompress);
+ System.Console.WriteLine("length of compressed: {0}", compressed.Length);
+
+ double compRatio = 100 * (1.0 - (1.0 * compressed.Length) / (1.0 * textToCompress.Length)) ;
+
+ System.Console.WriteLine("compression rate: {0:N1}%", compRatio);
+
+ string decompressed = ZlibCodecDecompress(compressed);
+ string hashOfDecompressed = ByteArrayToString(ComputeHash(textToCompress));
+ System.Console.WriteLine("hash of decompressed: {0}", hashOfDecompressed);
+ System.Console.WriteLine();
+
+ if (hashOfOriginal == hashOfDecompressed)
+ System.Console.WriteLine("Round trip SUCCESS: After compress and decompress, we obtained the original text.");
+ else
+ System.Console.WriteLine("Round trip FAIL: After compress and decompress, we did not obtain the original text.");
+ }
+
+
+ private byte[] ZlibCodecCompress(string textToCompress)
+ {
+ int outputSize = 2048;
+ byte[] output = new Byte[ outputSize ];
+ byte[] uncompressed = UTF8Encoding.UTF8.GetBytes( textToCompress );
+ int lengthToCompress = uncompressed.Length;
+
+ // If you want a ZLIB stream, set this to true. If you want
+ // a bare DEFLATE stream, set this to false.
+ bool wantRfc1950Header = false;
+
+ using ( MemoryStream ms = new MemoryStream())
+ {
+ ZlibCodec compressor = new ZlibCodec();
+ compressor.InitializeDeflate(CompressionLevel.BestCompression, wantRfc1950Header);
+
+ compressor.InputBuffer = uncompressed;
+ compressor.AvailableBytesIn = lengthToCompress;
+ compressor.NextIn = 0;
+ compressor.OutputBuffer = output;
+
+ foreach (var f in new FlushType[] { FlushType.None, FlushType.Finish } )
+ {
+ int bytesToWrite = 0;
+ do
+ {
+ compressor.AvailableBytesOut = outputSize;
+ compressor.NextOut = 0;
+ compressor.Deflate(f);
+
+ bytesToWrite = outputSize - compressor.AvailableBytesOut ;
+ if (bytesToWrite > 0)
+ ms.Write(output, 0, bytesToWrite);
+ }
+ while (( f == FlushType.None && (compressor.AvailableBytesIn != 0 || compressor.AvailableBytesOut == 0)) ||
+ ( f == FlushType.Finish && bytesToWrite != 0));
+ }
+
+ compressor.EndDeflate();
+
+ ms.Flush();
+ return ms.ToArray();
+ }
+ }
+
+
+ private string ZlibCodecDecompress(byte[] compressed)
+ {
+ int outputSize = 2048;
+ byte[] output = new Byte[ outputSize ];
+
+ // If you have a ZLIB stream, set this to true. If you have
+ // a bare DEFLATE stream, set this to false.
+ bool expectRfc1950Header = false;
+
+ using ( MemoryStream ms = new MemoryStream())
+ {
+ ZlibCodec compressor = new ZlibCodec();
+ compressor.InitializeInflate(expectRfc1950Header);
+
+ compressor.InputBuffer = compressed;
+ compressor.AvailableBytesIn = compressed.Length;
+ compressor.NextIn = 0;
+ compressor.OutputBuffer = output;
+
+ foreach (var f in new FlushType[] { FlushType.None, FlushType.Finish } )
+ {
+ int bytesToWrite = 0;
+ do
+ {
+ compressor.AvailableBytesOut = outputSize;
+ compressor.NextOut = 0;
+ compressor.Inflate(f);
+
+ bytesToWrite = outputSize - compressor.AvailableBytesOut ;
+ if (bytesToWrite > 0)
+ ms.Write(output, 0, bytesToWrite);
+ }
+ while (( f == FlushType.None && (compressor.AvailableBytesIn != 0 || compressor.AvailableBytesOut == 0)) ||
+ ( f == FlushType.Finish && bytesToWrite != 0));
+ }
+
+ compressor.EndInflate();
+
+ return UTF8Encoding.UTF8.GetString( ms.ToArray() );
+ }
+ }
+
+
+ public static void Usage()
+ {
+ Console.WriteLine("\nZlibDeflateInflate: .\n");
+ Console.WriteLine("Usage:\n ZlibDeflateInflate [-arg1 ] [-arg2]");
+ }
+
+
+ public static void Main(string[] args)
+ {
+ try
+ {
+ new ZlibDeflateInflate()
+ .Run();
+ }
+ catch (System.Exception exc1)
+ {
+ Console.WriteLine("Exception: {0}", exc1.ToString());
+ Usage();
+ }
+ }
+ }
+}
diff --git a/dotNetZip/Examples/C#/ZLIB/ZlibStreamExample.cs b/dotNetZip/Examples/C#/ZLIB/ZlibStreamExample.cs
new file mode 100644
index 0000000..1745eb7
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/ZlibStreamExample.cs
@@ -0,0 +1,118 @@
+// ZlibDeflateInflate.cs
+// ------------------------------------------------------------------
+//
+// Copyright (c) 2009-2011 by Dino Chiesa
+// All rights reserved!
+//
+// This code module is part of DotNetZip, a zipfile class library.
+//
+// ------------------------------------------------------------------
+//
+// This code is licensed under the Microsoft Public License.
+// See the file License.txt for the license details.
+// More info on: http://dotnetzip.codeplex.com
+//
+// ------------------------------------------------------------------
+//
+// Purpose: Demonstrate compression and decompression with the ZlibStream
+// class, which is part of the Ionic.Zlib namespace.
+//
+// ------------------------------------------------------------------
+//
+
+using System;
+using System.Reflection;
+using Ionic.Zlib;
+
+
+// to allow fast ngen
+[assembly: AssemblyTitle("ZlibStreamExample.cs")]
+[assembly: AssemblyDescription("Demonstrate compression and decompression using the ZlibStream class")]
+[assembly: AssemblyConfiguration("")]
+[assembly: AssemblyCompany("Dino Chiesa")]
+[assembly: AssemblyProduct("DotNetZip Examples")]
+[assembly: AssemblyCopyright("Copyright Dino Chiesa 2009-2011")]
+[assembly: AssemblyTrademark("")]
+[assembly: AssemblyCulture("")]
+[assembly: AssemblyVersion("1.1.1.1")]
+
+
+namespace Ionic.ToolsAndTests
+{
+
+ public class ZlibStreamExample
+ {
+
+ ///
+ /// Converts a string to a MemoryStream.
+ ///
+ static System.IO.MemoryStream StringToMemoryStream(string s)
+ {
+ byte[] a = System.Text.Encoding.ASCII.GetBytes(s);
+ return new System.IO.MemoryStream(a);
+ }
+
+ ///
+ /// Converts a MemoryStream to a string. Makes some assumptions about the content of the stream.
+ ///
+ ///
+ ///
+ static String MemoryStreamToString(System.IO.MemoryStream ms)
+ {
+ byte[] ByteArray = ms.ToArray();
+ return System.Text.Encoding.ASCII.GetString(ByteArray);
+ }
+
+
+ static void CopyStream(System.IO.Stream src, System.IO.Stream dest)
+ {
+ byte[] buffer = new byte[1024];
+ int len;
+ while ((len = src.Read(buffer, 0, buffer.Length)) > 0)
+ dest.Write(buffer, 0, len);
+ dest.Flush();
+ }
+
+ [STAThread]
+ public static void Main(System.String[] args)
+ {
+ try
+ {
+ System.IO.MemoryStream msSinkCompressed;
+ System.IO.MemoryStream msSinkDecompressed;
+ ZlibStream zOut;
+ String originalText = "Hello, World! This String will be compressed... ";
+
+ System.Console.Out.WriteLine("original: {0}", originalText);
+
+ // first, compress:
+ msSinkCompressed = new System.IO.MemoryStream();
+ zOut = new ZlibStream(msSinkCompressed, CompressionMode.Compress, CompressionLevel.BestCompression, true);
+ CopyStream(StringToMemoryStream(originalText), zOut);
+ zOut.Close();
+
+ // at this point, msSinkCompressed contains the compressed bytes
+
+ // now, decompress:
+ msSinkCompressed.Seek(0, System.IO.SeekOrigin.Begin);
+ msSinkDecompressed = new System.IO.MemoryStream();
+ zOut = new ZlibStream(msSinkDecompressed, CompressionMode.Decompress, true);
+ CopyStream(msSinkCompressed, zOut);
+
+ // at this point, msSinkDecompressed contains the decompressed bytes
+ string decompressed = MemoryStreamToString(msSinkDecompressed);
+ System.Console.Out.WriteLine("decompressed: {0}", decompressed);
+ System.Console.WriteLine();
+
+ if (originalText == decompressed)
+ System.Console.WriteLine("A-OK. Compression followed by decompression gets the original text.");
+ else
+ System.Console.WriteLine("The compression/decompression cycle failed.");
+ }
+ catch (System.Exception e1)
+ {
+ Console.WriteLine("Exception: " + e1);
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZLIB/makefile b/dotNetZip/Examples/C#/ZLIB/makefile
new file mode 100644
index 0000000..9515aa7
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/makefile
@@ -0,0 +1,34 @@
+.SUFFIXES: .tlb .il .dll .cpp .cs .vb .rc .ocx .jsl .java
+
+#_NETHOME=$(WINDIR)\Microsoft.NET\Framework\v1.1.4322
+#_NETHOME=c:\.net2.0
+_NETHOME=c:\.net3.5
+#_NETSDK=c:\Progra~1\Microsoft.NET\SDK\v1.1\Bin
+#_NETSDK=c:\netsdk2.0\bin
+_NETSDK=c:\netsdk3.5\bin
+
+_CS_DBG_FLAGS=/debug+
+_CS_DLL_FLAGS=/t:library $(_CS_DBG_FLAGS)
+_CS_EXE_FLAGS=/t:exe $(_CS_DBG_FLAGS)
+
+_CSC=$(_NETHOME)\csc.exe
+
+_BASE_IMPORTS=/R:System.dll /R:Ionic.Zlib.dll
+
+
+default: Ionic.Zlib.dll ZlibDeflateInflate.exe test_dict_deflate_inflate.exe test_flush_sync.exe test_large_deflate_inflate.exe ZlibStreamExample.exe QuickCompress.exe
+
+
+Ionic.Zlib.dll: ..\..\..\Zlib\obj\Debug\Ionic.Zlib.dll ..\..\..\Zlib\obj\Debug\Ionic.Zlib.pdb
+ copy /y ..\..\..\Zlib\obj\Debug\Ionic.Zlib.* .
+
+.cs.exe:
+ if not exist Ionic.Zlib.dll ( copy ..\..\..\Zlib\obj\Debug\Ionic.Zlib.* . )
+ $(_CSC) $(_CS_EXE_FLAGS) $(_BASE_IMPORTS) /out:$@ $**
+
+
+clean:
+ -del ZlibDeflateInflate.exe test_dict_deflate_inflate.exe test_flush_sync.exe test_large_deflate_inflate.exe ZlibStreamExample.exe QuickCompress.exe
+ -del Ionic.Zlib.dll
+ -del *.pdb
+
diff --git a/dotNetZip/Examples/C#/ZLIB/test_dict_deflate_inflate.cs b/dotNetZip/Examples/C#/ZLIB/test_dict_deflate_inflate.cs
new file mode 100644
index 0000000..52f2075
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/test_dict_deflate_inflate.cs
@@ -0,0 +1,118 @@
+using System;
+using Ionic.Zlib;
+
+// Test deflate() with preset dictionary
+class test_dict_deflate_inflate
+{
+ [STAThread]
+ public static void Main(String[] arg)
+ {
+ try
+ {
+ var x = new test_dict_deflate_inflate();
+ x.Run();
+ }
+ catch (System.Exception e1)
+ {
+ Console.WriteLine("Exception: " + e1);
+ }
+ }
+
+ private void Run()
+ {
+ int rc;
+ int bufferSize = 40000;
+ byte[] compressedBytes = new byte[bufferSize];
+ byte[] decompressedBytes = new byte[bufferSize];
+
+ ZlibCodec compressingStream = new ZlibCodec();
+ rc = compressingStream.InitializeDeflate(CompressionLevel.LEVEL9_BEST_COMPRESSION);
+ CheckForError(compressingStream, rc, "InitializeDeflate");
+
+ string dictionaryWord = "hello ";
+ byte[] dictionary = System.Text.ASCIIEncoding.ASCII.GetBytes(dictionaryWord);
+ string TextToCompress = "hello, hello! How are you, Joe? ";
+ byte[] BytesToCompress = System.Text.ASCIIEncoding.ASCII.GetBytes(TextToCompress);
+
+ rc = compressingStream.SetDictionary(dictionary);
+ CheckForError(compressingStream, rc, "SetDeflateDictionary");
+
+ long dictId = compressingStream.Adler32;
+
+ compressingStream.OutputBuffer = compressedBytes;
+ compressingStream.NextOut = 0;
+ compressingStream.AvailableBytesOut = bufferSize;
+
+ compressingStream.InputBuffer = BytesToCompress;
+ compressingStream.NextIn = 0;
+ compressingStream.AvailableBytesIn = BytesToCompress.Length;
+
+ rc = compressingStream.Deflate(ZlibConstants.Z_FINISH);
+ if (rc != ZlibConstants.Z_STREAM_END)
+ {
+ System.Console.Out.WriteLine("deflate should report Z_STREAM_END");
+ System.Environment.Exit(1);
+ }
+ rc = compressingStream.EndDeflate();
+ CheckForError(compressingStream, rc, "deflateEnd");
+
+ ZlibCodec decompressingStream = new ZlibCodec();
+
+ decompressingStream.InputBuffer = compressedBytes;
+ decompressingStream.NextIn = 0;
+ decompressingStream.AvailableBytesIn = bufferSize;
+
+ rc = decompressingStream.InitializeInflate();
+ CheckForError(decompressingStream, rc, "inflateInit");
+ decompressingStream.OutputBuffer = decompressedBytes;
+ decompressingStream.NextOut = 0;
+ decompressingStream.AvailableBytesOut = decompressedBytes.Length;
+
+ while (true)
+ {
+ rc = decompressingStream.Inflate(ZlibConstants.Z_NO_FLUSH);
+ if (rc == ZlibConstants.Z_STREAM_END)
+ {
+ break;
+ }
+ if (rc == ZlibConstants.Z_NEED_DICT)
+ {
+ if ((int)decompressingStream.Adler32 != (int)dictId)
+ {
+ System.Console.Out.WriteLine("unexpected dictionary");
+ System.Environment.Exit(1);
+ }
+ rc = decompressingStream.SetDictionary(dictionary);
+ }
+ CheckForError(decompressingStream, rc, "inflate with dict");
+ }
+
+ rc = decompressingStream.EndInflate();
+ CheckForError(decompressingStream, rc, "EndInflate");
+
+ int j = 0;
+ for (; j < decompressedBytes.Length; j++)
+ if (decompressedBytes[j] == 0)
+ break;
+
+ var result = System.Text.ASCIIEncoding.ASCII.GetString(decompressedBytes, 0, j);
+
+ Console.WriteLine("orig length: {0}", TextToCompress.Length);
+ Console.WriteLine("compressed length: {0}", compressingStream.TotalBytesOut);
+ Console.WriteLine("decompressed length: {0}", decompressingStream.TotalBytesOut);
+ Console.WriteLine("result length: {0}", result.Length);
+ Console.WriteLine("result of inflate:\n{0}", result);
+ }
+
+ internal static void CheckForError(ZlibCodec z, int err, System.String msg)
+ {
+ if (err != ZlibConstants.Z_OK)
+ {
+ if (z.Message != null)
+ System.Console.Out.Write(z.Message + " ");
+ System.Console.Out.WriteLine(msg + " error: " + err);
+
+ System.Environment.Exit(1);
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZLIB/test_flush_sync.cs b/dotNetZip/Examples/C#/ZLIB/test_flush_sync.cs
new file mode 100644
index 0000000..a5ad84e
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/test_flush_sync.cs
@@ -0,0 +1,120 @@
+using System;
+using Ionic.Zlib;
+
+// Test deflate() with full flush
+class test_flush_sync
+{
+
+ [STAThread]
+ public static void Main(System.String[] args)
+ {
+ try
+ {
+ var x = new test_flush_sync();
+ x.Run();
+ }
+ catch (System.Exception e1)
+ {
+ Console.WriteLine("Exception: " + e1);
+ }
+ }
+
+ private void Run()
+ {
+ int rc;
+ int comprLen = 40000;
+ int uncomprLen = comprLen;
+ byte[] CompressedBytes = new byte[comprLen];
+ byte[] DecompressedBytes = new byte[uncomprLen];
+ string TextToCompress = "This is the text that will be compressed.";
+ byte[] BytesToCompress = System.Text.ASCIIEncoding.ASCII.GetBytes(TextToCompress);
+
+ ZlibCodec compressor = new ZlibCodec(CompressionMode.Compress);
+
+ compressor.InputBuffer = BytesToCompress;
+ compressor.NextIn = 0;
+ compressor.OutputBuffer = CompressedBytes;
+ compressor.NextOut = 0;
+ compressor.AvailableBytesIn = 3;
+ compressor.AvailableBytesOut = CompressedBytes.Length;
+
+ rc = compressor.Deflate(ZlibConstants.Z_FULL_FLUSH);
+ CheckForError(compressor, rc, "Deflate");
+
+ CompressedBytes[3]++; // force an error in first compressed block // dinoch
+ compressor.AvailableBytesIn = TextToCompress.Length - 3;
+
+ rc = compressor.Deflate(ZlibConstants.Z_FINISH);
+ if (rc != ZlibConstants.Z_STREAM_END)
+ {
+ CheckForError(compressor, rc, "Deflate");
+ }
+ rc = compressor.EndDeflate();
+ CheckForError(compressor, rc, "EndDeflate");
+ comprLen = (int) (compressor.TotalBytesOut);
+
+ ZlibCodec decompressor = new ZlibCodec(CompressionMode.Decompress);
+
+ decompressor.InputBuffer = CompressedBytes;
+ decompressor.NextIn = 0;
+ decompressor.AvailableBytesIn = 2;
+
+ decompressor.OutputBuffer = DecompressedBytes;
+ decompressor.NextOut = 0;
+ decompressor.AvailableBytesOut = DecompressedBytes.Length;
+
+ rc = decompressor.Inflate(ZlibConstants.Z_NO_FLUSH);
+ CheckForError(decompressor, rc, "Inflate");
+
+ decompressor.AvailableBytesIn = CompressedBytes.Length - 2;
+
+ rc = decompressor.SyncInflate();
+ CheckForError(decompressor, rc, "SyncInflate");
+
+ bool gotException = false;
+ try
+ {
+ rc = decompressor.Inflate(ZlibConstants.Z_FINISH);
+ }
+ catch (ZlibException ex1)
+ {
+ Console.WriteLine("Got Expected Exception: " + ex1);
+ gotException = true;
+ }
+
+ if (!gotException)
+ {
+ System.Console.Out.WriteLine("inflate should report DATA_ERROR");
+ /* Because of incorrect adler32 */
+ System.Environment.Exit(1);
+ }
+
+ rc = decompressor.EndInflate();
+ CheckForError(decompressor, rc, "EndInflate");
+
+ int j = 0;
+ for (; j < DecompressedBytes.Length; j++)
+ if (DecompressedBytes[j] == 0)
+ break;
+
+ var result = System.Text.ASCIIEncoding.ASCII.GetString(DecompressedBytes, 0, j);
+
+ Console.WriteLine("orig length: {0}", TextToCompress.Length);
+ Console.WriteLine("compressed length: {0}", compressor.TotalBytesOut);
+ Console.WriteLine("uncompressed length: {0}", decompressor.TotalBytesOut);
+ Console.WriteLine("result length: {0}", result.Length);
+ Console.WriteLine("result of inflate:\n(Thi){0}", result);
+ }
+
+ internal static void CheckForError(ZlibCodec z, int rc, System.String msg)
+ {
+ if (rc != ZlibConstants.Z_OK)
+ {
+ if (z.Message != null)
+ System.Console.Out.Write(z.Message + " ");
+ System.Console.Out.WriteLine(msg + " error: " + rc);
+
+ System.Environment.Exit(1);
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZLIB/test_large_deflate_inflate.cs b/dotNetZip/Examples/C#/ZLIB/test_large_deflate_inflate.cs
new file mode 100644
index 0000000..2a24d82
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZLIB/test_large_deflate_inflate.cs
@@ -0,0 +1,147 @@
+using System;
+using Ionic.Zlib;
+
+// Test deflate() with large buffers and dynamic change of compression level
+class test_large_deflate_inflate
+{
+ [STAThread]
+ public static void Main(System.String[] arg)
+ {
+ try
+ {
+ var x = new test_large_deflate_inflate();
+ x.Run();
+ }
+ catch (System.Exception e1)
+ {
+ Console.WriteLine("Exception: " + e1);
+ }
+ }
+
+ private void Run()
+ {
+ int rc;
+ int j;
+ int bufferSize = 40000;
+ byte[] compressedBytes = new byte[bufferSize];
+ byte[] bufferToCompress= new byte[bufferSize];
+ byte[] decompressedBytes = new byte[bufferSize];
+
+ ZlibCodec compressingStream= new ZlibCodec();
+
+ rc = compressingStream.InitializeDeflate(CompressionLevel.BestSpeed);
+ CheckForError(compressingStream, rc, "InitializeDeflate");
+
+ compressingStream.OutputBuffer = compressedBytes;
+ compressingStream.NextOut = 0;
+ compressingStream.AvailableBytesOut = compressedBytes.Length;
+
+ // At this point, bufferToCompress is all zeroes, so it should compress
+ // very well:
+ compressingStream.InputBuffer = bufferToCompress;
+ compressingStream.AvailableBytesIn = bufferToCompress.Length;
+ rc = compressingStream.Deflate(FlushType.None);
+ CheckForError(compressingStream, rc, "deflate");
+ if (compressingStream.AvailableBytesIn != 0)
+ {
+ System.Console.Out.WriteLine("deflate not greedy");
+ System.Environment.Exit(1);
+ }
+
+ Console.WriteLine("Stage 1: uncompressed bytes in so far: {0,6}", compressingStream.TotalBytesIn);
+ Console.WriteLine(" compressed bytes out so far: {0,6}", compressingStream.TotalBytesOut);
+
+
+ // Feed in already compressed data and switch to no compression:
+ compressingStream.SetDeflateParams(CompressionLevel.None, CompressionStrategy.Default);
+ compressingStream.InputBuffer = compressedBytes;
+ compressingStream.NextIn = 0;
+ compressingStream.AvailableBytesIn = bufferSize / 2; // why? - for fun
+ rc = compressingStream.Deflate(FlushType.None);
+ CheckForError(compressingStream, rc, "Deflate");
+
+ Console.WriteLine("Stage 2: uncompressed bytes in so far: {0,6}", compressingStream.TotalBytesIn);
+ Console.WriteLine(" compressed bytes out so far: {0,6}", compressingStream.TotalBytesOut);
+
+ // Insert data into bufferToCompress, and Switch back to compressing mode:
+ System.Random rnd = new Random();
+
+ for (int i = 0; i < bufferToCompress.Length / 1000; i++)
+ {
+ byte b = (byte) rnd.Next();
+ int n = 500 + rnd.Next(500);
+ for (j = 0; j < n; j++)
+ bufferToCompress[j + i] = b;
+ i += j-1;
+ }
+
+ compressingStream.SetDeflateParams(CompressionLevel.BestCompression, CompressionStrategy.Filtered);
+ compressingStream.InputBuffer = bufferToCompress;
+ compressingStream.NextIn = 0;
+ compressingStream.AvailableBytesIn = bufferToCompress.Length;
+ rc = compressingStream.Deflate(FlushType.None);
+ CheckForError(compressingStream, rc, "Deflate");
+
+ Console.WriteLine("Stage 3: uncompressed bytes in so far: {0,6}", compressingStream.TotalBytesIn);
+ Console.WriteLine(" compressed bytes out so far: {0,6}", compressingStream.TotalBytesOut);
+
+ rc = compressingStream.Deflate(FlushType.Finish);
+ if (rc != ZlibConstants.Z_STREAM_END)
+ {
+ Console.WriteLine("deflate reported {0}, should report Z_STREAM_END", rc);
+ Environment.Exit(1);
+ }
+ rc = compressingStream.EndDeflate();
+ CheckForError(compressingStream, rc, "EndDeflate");
+
+ Console.WriteLine("Stage 4: uncompressed bytes in (final): {0,6}", compressingStream.TotalBytesIn);
+ Console.WriteLine(" compressed bytes out (final): {0,6}", compressingStream.TotalBytesOut);
+
+ ZlibCodec decompressingStream = new ZlibCodec(CompressionMode.Decompress);
+
+ decompressingStream.InputBuffer = compressedBytes;
+ decompressingStream.NextIn = 0;
+ decompressingStream.AvailableBytesIn = bufferSize;
+
+ // upon inflating, we overwrite the decompressedBytes buffer repeatedly
+ while (true)
+ {
+ decompressingStream.OutputBuffer = decompressedBytes;
+ decompressingStream.NextOut = 0;
+ decompressingStream.AvailableBytesOut = decompressedBytes.Length;
+ rc = decompressingStream.Inflate(FlushType.None);
+ if (rc == ZlibConstants.Z_STREAM_END)
+ break;
+ CheckForError(decompressingStream, rc, "inflate large");
+ }
+
+ rc = decompressingStream.EndInflate();
+ CheckForError(decompressingStream, rc, "EndInflate");
+
+ if (decompressingStream.TotalBytesOut != 2 * decompressedBytes.Length + bufferSize / 2)
+ {
+ System.Console.WriteLine("bad large inflate: " + decompressingStream.TotalBytesOut);
+ System.Environment.Exit(1);
+ }
+
+ for (j = 0; j < decompressedBytes.Length; j++)
+ if (decompressedBytes[j] == 0)
+ break;
+
+ Console.WriteLine("compressed length: {0}", compressingStream.TotalBytesOut);
+ Console.WriteLine("decompressed length (expected): {0}", 2 * decompressedBytes.Length + bufferSize / 2);
+ Console.WriteLine("decompressed length (actual) : {0}", decompressingStream.TotalBytesOut);
+ }
+
+ internal static void CheckForError(ZlibCodec z, int rc, System.String msg)
+ {
+ if (rc != ZlibConstants.Z_OK)
+ {
+ if (z.Message != null)
+ System.Console.Out.Write(z.Message + " ");
+ System.Console.Out.WriteLine(msg + " error: " + rc);
+
+ System.Environment.Exit(1);
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZipDir/Properties/AssemblyInfo.cs b/dotNetZip/Examples/C#/ZipDir/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..3d5a6fa
Binary files /dev/null and b/dotNetZip/Examples/C#/ZipDir/Properties/AssemblyInfo.cs differ
diff --git a/dotNetZip/Examples/C#/ZipDir/ZipDir.cs b/dotNetZip/Examples/C#/ZipDir/ZipDir.cs
new file mode 100644
index 0000000..c5fcdd2
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipDir/ZipDir.cs
@@ -0,0 +1,73 @@
+// ZipDir.cs
+//
+// ----------------------------------------------------------------------
+// Copyright (c) 2006, 2007, 2008 Microsoft Corporation. All rights reserved.
+//
+// This example is released under the Microsoft Permissive License of
+// October 2006. See the license.txt file accompanying this release for
+// full details.
+//
+// ----------------------------------------------------------------------
+//
+// This utility zips up a single directory specified on the command line.
+// It is like a specialized ZipIt tool (See ZipIt.cs).
+//
+// compile with:
+// csc /debug+ /target:exe /r:Zip.dll /out:ZipDir.exe ZipDir.cs
+//
+// Wed, 29 Mar 2006 14:36
+//
+
+using System;
+using Ionic.Zip;
+
+namespace Ionic.Zip.Examples
+{
+
+ public class ZipDir
+ {
+
+ private static void Usage()
+ {
+ Console.WriteLine("usage:\n ZipDir ");
+ Environment.Exit(1);
+ }
+
+ public static void Main(String[] args)
+ {
+ if (args.Length != 2) Usage();
+ if (!System.IO.Directory.Exists(args[1]))
+ {
+ Console.WriteLine("The directory does not exist!\n");
+ Usage();
+ }
+ if (System.IO.File.Exists(args[0]))
+ {
+ Console.WriteLine("That zipfile already exists!\n");
+ Usage();
+ }
+ if (!args[0].EndsWith(".zip"))
+ {
+ Console.WriteLine("The filename must end with .zip!\n");
+ Usage();
+ }
+
+ string ZipFileToCreate = args[0];
+ string DirectoryToZip = args[1];
+ try
+ {
+ using (ZipFile zip = new ZipFile())
+ {
+ zip.StatusMessageTextWriter = System.Console.Out;
+ zip.AddDirectory(DirectoryToZip); // recurses subdirectories
+ zip.Save(ZipFileToCreate);
+ }
+ }
+ catch (System.Exception ex1)
+ {
+ System.Console.Error.WriteLine("exception: " + ex1);
+ }
+
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZipDir/ZipDir.csproj b/dotNetZip/Examples/C#/ZipDir/ZipDir.csproj
new file mode 100644
index 0000000..d5e3bb4
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipDir/ZipDir.csproj
@@ -0,0 +1,101 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {E04C2A53-3981-44D4-94AF-6AC07D97CDE8}
+ Exe
+ Properties
+ ZipDir
+ ZipDir
+
+
+
+
+ 3.5
+ SAK
+ SAK
+ SAK
+ SAK
+ v2.0
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+
+
+
+
+
+
+ Properties\SolutionInfo.cs
+
+
+
+
+
+
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}
+ Zip DLL
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Form1.Designer.cs b/dotNetZip/Examples/C#/ZipTreeView/Form1.Designer.cs
new file mode 100644
index 0000000..029f6c6
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Form1.Designer.cs
@@ -0,0 +1,92 @@
+namespace ZipTreeView
+{
+ partial class Form1
+ {
+ ///
+ /// Required designer variable.
+ ///
+ private System.ComponentModel.IContainer components = null;
+
+ ///
+ /// Clean up any resources being used.
+ ///
+ /// true if managed resources should be disposed; otherwise, false.
+ protected override void Dispose(bool disposing)
+ {
+ if (disposing && (components != null))
+ {
+ components.Dispose();
+ }
+ base.Dispose(disposing);
+ }
+
+ #region Windows Form Designer generated code
+
+ ///
+ /// Required method for Designer support - do not modify
+ /// the contents of this method with the code editor.
+ ///
+ private void InitializeComponent()
+ {
+ System.ComponentModel.ComponentResourceManager resources = new System.ComponentModel.ComponentResourceManager(typeof(Form1));
+ this.treeView1 = new System.Windows.Forms.TreeView();
+ this.textBox1 = new System.Windows.Forms.TextBox();
+ this.button1 = new System.Windows.Forms.Button();
+ this.SuspendLayout();
+ //
+ // treeView1
+ //
+ this.treeView1.Anchor = ((System.Windows.Forms.AnchorStyles)((((System.Windows.Forms.AnchorStyles.Top | System.Windows.Forms.AnchorStyles.Bottom)
+ | System.Windows.Forms.AnchorStyles.Left)
+ | System.Windows.Forms.AnchorStyles.Right)));
+ this.treeView1.Location = new System.Drawing.Point(12, 39);
+ this.treeView1.Name = "treeView1";
+ this.treeView1.Size = new System.Drawing.Size(260, 213);
+ this.treeView1.TabIndex = 0;
+ //
+ // textBox1
+ //
+ this.textBox1.Anchor = ((System.Windows.Forms.AnchorStyles)(((System.Windows.Forms.AnchorStyles.Top | System.Windows.Forms.AnchorStyles.Left)
+ | System.Windows.Forms.AnchorStyles.Right)));
+ this.textBox1.AutoCompleteMode = System.Windows.Forms.AutoCompleteMode.Suggest;
+ this.textBox1.AutoCompleteSource = System.Windows.Forms.AutoCompleteSource.FileSystem;
+ this.textBox1.Location = new System.Drawing.Point(12, 12);
+ this.textBox1.Name = "textBox1";
+ this.textBox1.Size = new System.Drawing.Size(206, 20);
+ this.textBox1.TabIndex = 1;
+ //
+ // button1
+ //
+ this.button1.Anchor = ((System.Windows.Forms.AnchorStyles)((System.Windows.Forms.AnchorStyles.Top | System.Windows.Forms.AnchorStyles.Right)));
+ this.button1.Location = new System.Drawing.Point(225, 11);
+ this.button1.Name = "button1";
+ this.button1.Size = new System.Drawing.Size(47, 23);
+ this.button1.TabIndex = 2;
+ this.button1.Text = "open";
+ this.button1.UseVisualStyleBackColor = true;
+ this.button1.Click += new System.EventHandler(this.button1_Click);
+ //
+ // Form1
+ //
+ this.AutoScaleDimensions = new System.Drawing.SizeF(6F, 13F);
+ this.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Font;
+ this.ClientSize = new System.Drawing.Size(284, 264);
+ this.Controls.Add(this.button1);
+ this.Controls.Add(this.textBox1);
+ this.Controls.Add(this.treeView1);
+ this.Icon = ((System.Drawing.Icon)(resources.GetObject("$this.Icon")));
+ this.Name = "Form1";
+ this.Text = "Zip TreeView (C#)";
+ this.ResumeLayout(false);
+ this.PerformLayout();
+
+ }
+
+ #endregion
+
+ private System.Windows.Forms.TreeView treeView1;
+ private System.Windows.Forms.TextBox textBox1;
+ private System.Windows.Forms.Button button1;
+ }
+}
+
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Form1.cs b/dotNetZip/Examples/C#/ZipTreeView/Form1.cs
new file mode 100644
index 0000000..1d05b92
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Form1.cs
@@ -0,0 +1,77 @@
+using System;
+using System.Collections.Generic;
+using System.ComponentModel;
+using System.Drawing;
+using System.Text;
+using System.IO;
+using System.Windows.Forms;
+using Ionic.Zip;
+
+namespace ZipTreeView
+{
+ public partial class Form1 : Form
+ {
+ public Form1()
+ {
+ InitializeComponent();
+ }
+
+ private void button1_Click(object sender, EventArgs e)
+ {
+ this.textBox1.BackColor = System.Drawing.Color.White;
+ string txt = this.textBox1.Text;
+ try
+ {
+ this.treeView1.Nodes.Clear();
+ using (var zip = ZipFile.Read(txt))
+ {
+ foreach (var entry in zip)
+ {
+ AddTreeNode(entry.FileName);
+ }
+ }
+ }
+ catch
+ {
+ this.textBox1.BackColor = System.Drawing.Color.MistyRose;
+ MessageBox.Show("Exception reading that zip file.");
+ }
+ }
+
+ private TreeNode AddTreeNode(string name)
+ {
+ if (name.EndsWith("/"))
+ name = name.Substring(0, name.Length - 1);
+
+ TreeNode node = FindNodeForTag(name, this.treeView1.Nodes);
+ if (node != null)
+ return node;
+ String parent = Path.GetDirectoryName(name);
+ TreeNodeCollection pnodeCollection = (parent == "")
+ ? this.treeView1.Nodes
+ : AddTreeNode(parent.Replace("\\", "/")).Nodes;
+
+ node = new TreeNode()
+ {
+ Text = Path.GetFileName(name),
+ Tag = name // ' full path
+ };
+ pnodeCollection.Add(node);
+ return node;
+ }
+
+ // Returns the TreeNode for a given name
+ private TreeNode FindNodeForTag(string name, TreeNodeCollection nodes)
+ {
+ foreach (TreeNode node in nodes)
+ {
+ if (name == (string) node.Tag)
+ return node;
+ else if (name.StartsWith(node.Tag + "/"))
+ return FindNodeForTag(name, node.Nodes);
+ }
+ return null;
+ }
+
+ }
+}
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Form1.resx b/dotNetZip/Examples/C#/ZipTreeView/Form1.resx
new file mode 100644
index 0000000..e3fee67
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Form1.resx
@@ -0,0 +1,1119 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ text/microsoft-resx
+
+
+ 2.0
+
+
+ System.Resources.ResXResourceReader, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
+ System.Resources.ResXResourceWriter, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
+
+
+ AAABAAoAMDAQAAEABABoBgAApgAAACAgEAABAAQA6AIAAA4HAAAQEBAAAQAEACgBAAD2CQAAMDAAAAEA
+ CACoDgAAHgsAACAgAAABAAgAqAgAAMYZAAAQEAAAAQAIAGgFAABuIgAAAAAAAAEAIABJhgAA1icAADAw
+ AAABACAAqCUAAB+uAAAgIAAAAQAgAKgQAADH0wAAEBAAAAEAIABoBAAAb+QAACgAAAAwAAAAYAAAAAEA
+ BAAAAAAAgAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAACAAAAAgIAAgAAAAIAAgACAgAAAgICAAMDA
+ wAAAAP8AAP8AAAD//wD/AAAA/wD/AP//AAD///8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIuIAAAAAAAAAAAAAAAAAAAAAA
+ AAAAB4uLiLgAAAAAAAAAAAAAAAAAAAAAAAiLiHeIuIuIgAAAAAAAAAAAAAAAAAAIi4uIiHi4uLiLgAAA
+ AAAAAAAAAAAACIi4iL+4t4e4i4iIgAAAAAAAAAAAAAiIi4v7i4iLiHeLiLiIsAAAAAAAAAAACIi4v4iL
+ +Li/eIiLi4iIgAAAAAAAAAAACL+Ii4v4uIi4h3OIuLj4sAAAAAAAAAAACIuL+IuL+4v7iIi4i4j4gAAA
+ AAAAAAAACIiIuIiIiIiIt3iLiLj7gAAAAAAAAAAACLi/i4uLi4uLiIe4uLj4gAAAAAAAAAAACPiL+IiI
+ iL+IiHiIi4j7gAAAAAAAAAAACLiIuLi4v4uLh4O4uLj/gAAAAAAAAAAACPuIiIiIi/i/iIeIi4iLgAAA
+ AAAAAAAACIi/v7+4iL+Lh3i4uLi/gAAAAAAAAAAACL+IiIiLiIuIiIOIiIiL8AAAAAAAAAAAD4v7+4v4
+ i/i4uHi4uLiAAAAAAAAAAAAACIiIiIiL+L+IiIeL+/uAAAAAAAAAAAAACIuL+/v4v4uLiIe4iIiwAAAA
+ AAAAAAAACIiPiIi/i/iIiHuIuLiAAAAAAAAAAAAACIv7+/iIiL+4h4V4iPvwAAAAAAAAAAAACIiIiL+/
+ v4iLd397i/iwAAAAAAAAAAAACIv7+IiIiL+3R3hoiPuAAAAAAAAAAAAACIiIi/v7+IiHGHh4v4iAAAAA
+ AAAAAAAACIv7+PiIv7+4d3hoi/vwAAAAAAAAAAAACIiPi/v4iIiIiIgIv/iAAAAAAAAAAAAAD4v7+I+/
+ v7+IiOhYiPuAAAAAAAAAAAAACIiPiL+I+Ii4iIgov/iAAAAAAAAAAAAACIv7+PiL+/iIiIhYiIuAAAAA
+ AAAAAAAAD4iPv7+Ij7+4+I8oiPiAAAAAAAAAAAAACIv4+Ii/iIj4j/h4v/uAAAAAAAAAAAAACIiL+/j7
+ +/v4j/84+PiAAAAAAAAAAAAAD4v/j4v/j4+/j494v/vwAAAAAAAAAAAACIiIv4+L+/iIhnh4j/iwAAAA
+ AAAAAAAAD4v4+L+Pj7+/h3h4v/iAAAAAAAAAAAAACIiIv/i/v4+IiHeP//vwAAAAAAAAAAAAD4v4+L/4
+ +Iv4+HeI+PiwAAAAAAAAAAAACIiL+Pi/v4+IiHh4i4jwAAAAAAAAAAAAD4v/i/j4+L+/iDeL/wAAAAAA
+ AAAAAAAACIiL/4v4v4+IgAAAAAAAAAAAAAAAAAAACIiPiI+P8AAAAAAAAAAAAAAAAAAAAAAAD4iIAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA////////AAD///////8AAP//
+ /////wAA////////AAD///////8AAP///h///wAA///gD///AAD//gAB//8AAP/gAAH//wAA/gAAAf//
+ AADgAAAB//8AAIAAAAH//wAAgAAAAf//AACAAAAB//8AAIAAAAH//wAAgAAAAf//AACAAAAB//8AAIAA
+ AAH//wAAgAAAAf//AACAAAAB//8AAIAAAAH//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///
+ AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAA
+ AAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///
+ AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAA///8AAIAAH////wAAgAf/////AACD//////8AAP//
+ /////wAAKAAAACAAAABAAAAAAQAEAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAIAAAACA
+ gACAAAAAgACAAICAAACAgIAAwMDAAAAA/wAA/wAAAP//AP8AAAD/AP8A//8AAP///wAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAh4uIgAAAAAAAAAAAAAAI
+ i4eLi7gAAAAAAAAAAIiLi4iHeLh4gAAAAAAACIi4v4i4h7iLiIAAAAAACIuL+IuLi4h7iPuAAAAAAAiI
+ iLi/v4iHiLv4gAAAAAAIuL+IiIuLhziI+4AAAAAACPiLi4uIv3iLuPiAAAAAAAi4iIiIv4uHeIv4gAAA
+ AAAPi4uLi/uIh4uLiwAAAAAACIiIiIiIuIg4iIgAAAAAAAiL+/uLiIuHi4uAAAAAAAAIiIiIiIv4iHiL
+ gAAAAAAACIv7+/v4uIeL+LAAAAAAAAiIiIiIv4t4eLiAAAAAAAAIi/v7+Iv3eHv4sAAAAAAACIiIiL+I
+ h3d4iIAAAAAAAA+L+/iL+/iHeIuAAAAAAAAIiI+/iIiIiHv4sAAAAAAACIv4iL+/v/h4+IAAAAAAAA+I
+ iL/4iPj/ePuAAAAAAAAIi/j4v4v4iHv4sAAAAAAAD4iL+IiIi4Z4+IAAAAAAAAiL/7+L+I+FePuAAAAA
+ AAAPiIj4j7+/h4j4gAAAAAAACIv4v7///4eIi/AAAAAAAA+PiPj4iIj3ewAAAAAAAAAIi/iIiIAAAAAA
+ AAAAAAAAAP+AAAAAAAAAAAAAAAAAAP/////////////////8B///4AP//AAB/+AAAf+AAAH/gAAB/4AA
+ Af+AAAH/gAAB/4AAA/+AAAP/gAAH/4AAB/+AAAf/gAAH/4AAB/+AAAf/gAAH/4AAB/+AAAf/gAAH/4AA
+ B/+AAAf/gAAH/4AAB/+AAAf/gAA//4Af///H////KAAAABAAAAAgAAAAAQAEAAAAAACAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAIAAAIAAAACAgACAAAAAgACAAICAAACAgIAAwMDAAAAA/wAA/wAAAP//AP8A
+ AAD/AP8A//8AAP///wADMzMzMzMzAAO7u7t4s7swA7u7u4ezvDADu7u7eLO8MAO7u7uHs78wA7u7u3iz
+ vzADu7u7h7O/MAO7u7t4uzswA7u7u4e7swADu7u7eLswAAO7u7uHuzAAA7u7u3i7MAADu7u7d7swAAO7
+ u7t3uzAAAzMzMzMzAAAAAAAAAAAAAIADAACAAQAAgAEAAIABAACAAQAAgAEAAIABAACAAQAAgAMAAIAH
+ AACABwAAgAcAAIAHAACABwAAgA8AAP//AAAoAAAAMAAAAGAAAAABAAgAAAAAAAAJAAAAAAAAAAAAAAAB
+ AAAAAQAAAAAAABssNQA5NTgAOzs+AEY+PwBJOzoAQEJGAEFESgBTUE0AXFBJAEJNVQBNTlIAaFdKAGNa
+ WQBoXlgARlliAExibQBecXkAWXJ/AH9qZAB/cmwAYnR+AHV0dgB8c3AAhGNZAIduYwCAeXMAjn54AH6C
+ fACGgH4ApIFvAP+hYwD/tX8AUXWGAFl9jwB6hYgAZI6dAFeNpQB8m6cAep+tAHmltwB2p7wAeKe7AF+n
+ xgBrp8QAaq7MAHKtxQB0rcQAdLDLAHqzzAB2u9UAfrnSAHK72QBtxd4AWs/sAFzQ7ABsxekAcMbhAHTJ
+ 5QB3z+oAcs/vAGLT7QBs1+8AdNHrAHjS7QBy2e8Acc3xAHXO8QB1zvQAeM7xAHfQ8QB31PAAdNf1AHzS
+ 8QB12/YAd973AHrd9QB84PcAfuD4AIGJjwCQh4MAkIiGAJ6UjACDj5QAhZKXAIyYngCSkpIAkZqeAKqR
+ gwCjlo4AsJWLALGcigC7n4gApZqUAKuckACgnpoAs56TALKflgC1npQApqCcAKuinQC2oJYAu6WbAIud
+ pQCInKgAi6CoAJehpQCZpKkAkqivAJWttwCNsbwAnbC3AKinpAChqq4AqqyrALGurwChr7QAq7e5AMCf
+ kgDBqpYAxKybAMuxnADStJ8AyK6iAMy2ogDOuKMAyLKqAM27qQDUt6AA1rykANO7qQDAurQAncS/ANrB
+ qwDHxL4A1MKzAN/ItgDXx7gA3Mq6AODHsgDgy7oAhK/BAIO6zACOu84AkbfGAJi1wQCfu8UAob7GAKG+
+ yACbycYAisPaAJ/I1wCVxNgAmMnbAJvK3QCc0tMArcPLAK7IyQCpytUApsvcAKjO3ACxz9oAhcvgAIzO
+ 5gCEzusAhdfnAInY5ACE0OoAjtHoAJXQ4ACd1eEAldnjAJDV6wCU3O8Ags/wAIHS8gCF0vEAhtTyAIvV
+ 8gCD2vQAjdv1AI3e/ACS1vEAkNjzAJXY8gCQ3vAAld3wAJLY9ACV2fQAl9z1AJzc8wCR3/wAo9LkAKbd
+ 8gCi3fUApd71AKjf9QCM4vUAg+P4AIvm+QCO6PoAleP0AJrj9ACU4vwAm+D4AJPp+gCb7PsAuuTvAKHh
+ 9wCr4fUApOb5AKHu/ACu6voAs+P1ALzm9gC26PcAv+z1ALTs+gC76vgApPD9AKv0/gCy9f4AvPX9AMXC
+ wADWycMA0c7LAOrUxwDl2MwA6NrNAOTb1QDt3tQA8tzSAPPd2AD54dEA9eXcAMPu+gDa7vMAxfL8AM30
+ /ADR9PwA1Pj9ANr4/gDs5+QA6u/pAPrn4ADz6+MA/OvmAPPu6QD/8eoA5Pr+AOn7/gD18/AA///5AP7+
+ /gAAAAAA////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAuEWkwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAnLzg8SEpDuJoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AMGwSJFgVBI1SktDQTs6lpwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0bKvr0uzTjOYZnM/S0tD
+ PkGmpZoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADVuLCzs7PGxsZOTilYaC0/TkpDPYQfm6MAAAAAAAAA
+ AAAAAAAAAAAAAAAAANa+uLS0xcfHxsbGxsbGTpTfZB05TU1CN5Ugm6gAAAAAAAAAAAAAAAAAAAAAAADB
+ uMzHx8fHx8fHx8fGxsbGxi9vY59IS01DN6vzyqgAAAAAAAAAAAAAAAAAAAAAAAC+zsvLzc3Ix8fHx8bH
+ xsbGxm52VSE6TU1DNsn9yqgAAAAAAAAAAAAAAAAAAAAAAAC+zrXNyM3IyMfHx8fHx8fGxjGhYHI8xk1D
+ N8r9yagAAAAAAAAAAAAAAAAAAAAAAAC+zrXNzc3NzcjHx8fHx8bHxipWZzRAxk5DN8r9yqgAAAAAAAAA
+ AAAAAAAAAAAAAADBzrXNzc3Nzc3NyMfHx8fHx5DfZBY6xk5DN8r9yqgAAAAAAAAAAAAAAAAAAAAAAADB
+ zrXOzs3NzcjNzcjHx8fHxjCTXaBLxsZDPcr9yqwAAAAAAAAAAAAAAAAAAAAAAADC07XOzc7Nzc3NyM3N
+ yMfHx21gayVAx8ZFPcr9yqwAAAAAAAAAAAAAAAAAAAAAAADB07XOzs7Nzs3Nzc3IzcjHxzOgYFc7xsZF
+ PsnvyqwAAAAAAAAAAAAAAAAAAAAAAADR07/Ozs7Ozs7Nzc3NyM3Ix41waa6zx8ZFP0vFyawAAAAAAAAA
+ AAAAAAAAAAAAAADR07/Ozs7Ozs7Ozc3Nzc3NyJJ+ZBU5x8evs8rKus8AAAAAAAAAAAAAAAAAAAAAAADR
+ 27/TztvOzs7Ozs7Nzc3NzTSeX4+vxs2zr7O6AAAAAAAAAAAAAAAAAAAAAAAAAADR27/bztvOzs7Ozs7O
+ zs3NzZN7bCuvyMfHxbCsAAAAAAAAAAAAAAAAAAAAAAAAAADR28vT287bztPOzs7Nzs3NzZaXYE86yMfH
+ za+4AAAAAAAAAAAAAAAAAAAAAAAAAADV28vb29vO29POzs7Ozs7OyJZyaixDyMjN06+5AAAAAAAAAAAA
+ AAAAAAAAAAAAAADV28vb29vb09PT087Ozs7NxnVlWRkiy8jN2a+4AAAAAAAAAAAAAAAAAAAAAAAAAADV
+ 28zb29vb09PT087Ozs7OkBsXUOkTxc3N7a/JAAAAAAAAAAAAAAAAAAAAAAAAAADV3cvb29vb29vT09PT
+ zs5HHgULUYsMyc3O77DJAAAAAAAAAAAAAAAAAAAAAAAAAADV28vb3Nzb29vT09PTztOlGAExY4EJxc3T
+ 7rDJAAAAAAAAAAAAAAAAAAAAAAAAAADW3cvb3Nvc29vb29PT09OpdxojW4AJzc3T8LDJAAAAAAAAAAAA
+ AAAAAAAAAAAAAADV3cvb3Nzc3Nvb29vb09O5fYp9XHkEzc7T8bDKAAAAAAAAAAAAAAAAAAAAAAAAAADW
+ 3cvb3dzc3Nzb29vb29vOeX15d4ICzs7d8bLLAAAAAAAAAAAAAAAAAAAAAAAAAADW3cvc3Nzc3Nzc3Nvb
+ 29vNf4mDfYwDzs7d77LNAAAAAAAAAAAAAAAAAAAAAAAAAADW3czc3N3c3Nzc29zc29vNieOJieIGzs7d
+ 8bLNAAAAAAAAAAAAAAAAAAAAAAAAAADW3cvc3dzc3Nzc3Nzb3NvThubm5uYHzs7t+bjNAAAAAAAAAAAA
+ AAAAAAAAAAAAAADW3czc3d3c3dzc3Nzc3NvbnePz8vQKztPu+bjNAAAAAAAAAAAAAAAAAAAAAAAAAADW
+ 3cvd3d3c3dzd3Nzc3Nzbq4r7/PgP09Pw+bjOAAAAAAAAAAAAAAAAAAAAAAAAAADW3svd3d3d3N3c3Nzc
+ 3NzczYX1+/YQ09vu+rjOAAAAAAAAAAAAAAAAAAAAAAAAAADW3czc3d3d3dzd3dzc3Nzc3IAOCOgo29vw
+ +bjOAAAAAAAAAAAAAAAAAAAAAAAAAADY3c7d3d3d3d3d3N3d3Nzc3HlSGuBTztvx+bjOAAAAAAAAAAAA
+ AAAAAAAAAAAAAADW3czc3d3d3d3d3d3c3dzd23mDF11a2Pr9+b7OAAAAAAAAAAAAAAAAAAAAAAAAAADW
+ 3svd3d3d3d3d3dzd3dzd3erhDl5m7PHw3r7OAAAAAAAAAAAAAAAAAAAAAAAAAADW3czc3d3d3d3d3d3d
+ 3dze3t7lHHQn0NLQyszuAAAAAAAAAAAAAAAAAAAAAAAAAADW3c7d3d3d3d3d3d3d3d3d3dRxEiSO0dbu
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAADW3tPd3d3d3d3d3t3X19fX2u0AAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAADa3d3e3dje1t7W7e4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADW
+ 1trW7gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP///////wAA////////AAD///////8AAP//
+ /////wAA////////AAD///4f//8AAP//4A///wAA//4AAf//AAD/4AAB//8AAP4AAAH//wAA4AAAAf//
+ AACAAAAB//8AAIAAAAH//wAAgAAAAf//AACAAAAB//8AAIAAAAH//wAAgAAAAf//AACAAAAB//8AAIAA
+ AAH//wAAgAAAAf//AACAAAAB//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///
+ AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAA
+ AAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///
+ AACAAAAH//8AAIAAAAf//wAAgAAAP///AACAAB////8AAIAH/////wAAg///////AAD///////8AACgA
+ AAAgAAAAQAAAAAEACAAAAAAAAAQAAAAAAAAAAAAAAAEAAAABAAAAAAAAWEpEAHBPQQBxY14AaWpqAHpt
+ ZQBhaXAAYnB7AJNtWwCFdWwAnYF5AJeIfwC2jnIAa3yIAHF/igBpgY4AZYSWAHeIkQBmlqgAaJaoAGeZ
+ qwBrmqsAfpmnAHecqwBvoLEAc6S2AHujswB9q7sAarHNAH25zgBayt8AYc3fAE/N6ABnzegAZ87vAHbL
+ 5QBzz+oAec3tAGPU7ABl1OwAa9btAGzX7gBx1+4AeNDrAHHZ7wB22e8Acc3xAHbO8QB50PIAfdHyAHzV
+ 8gB81fQAdNj1AHfe9wB62fUAfdv3AHne9wB83/cAf935AH/g9wB+4PkAj4WCAIuPkQCSj5EAjZCSAI+W
+ mACRkJIAlZaWAJSXmQCUmZkAlpqcAKKJgQC4loYAtZqNAKOenAC9oIkAv6mIAJueoQCIo6sAn6CgAJOl
+ rgCkq64Ava6iALesqQDKq5UA1babAM2zpgDZu68A5r+yAOLHpADlx7MA68u0AOLNvQCAr8EAiL3PAIS+
+ 0gChvMYAhMDVAIPB2ACRxdgAtsPHALjEyQClxtEApMfUAKfL1wCvydMAqc7bAL/L0QCt098AtdDZALLU
+ 3QCIzeYAhM/rAIfX6wCF1uwAiNbrAIzW6wCI0ewAhtjsAIXd7gCJ2u0AjNvuAI7c7gCW0eYAn9PiAJHU
+ 7gCf1+4AgdLxAITT8gCH1PMAitXzAI3W8gCF3/AAhtn1AITc9gCQ1/MAk97wAJLY9ACW2fQAk972AJXf
+ 9ACa3fUAndz0AKrb5QCg2e8ApNrvALHY4wC23egAod31AKbe9QCE4PEAgeD3AIHi+ACF4vgAheT5AIHh
+ /QCC5f4AiuD7AI7h+ACJ5fkAjeb5AIvg/ACN4fwAhOj+AI7o+gCR5/kAkOL8AJPk/ACV5PwAmeb9AJHo
+ +gCV6vsAnur6AJjs+wCa7PwAne78ALTh7QCm4fYApOX1AKrg9QCt4fYAouv7AKDv/ACl7PwArO37AKnu
+ /ACs7/wAseL2ALLm9wC15PYAueb3AL3m9wC27vcAuej3ALXq+QC27voAu+r5ALnt+gCi8P0ApfH9AKny
+ /gCu8P0AqvT+AK30/gCx8v0AtvH8ALH2/gC29P4AuvH8ALn0/wDd0coAw9HXAMLV2QDF1NoA4c7GAPbk
+ 3wDF2OAAxt/mANjh4wDE5vIAwej3AMHs+ADN7vgAyPT9AMD4/wDV9/0A0Pr/ANb6/gDb+/8A3Pz/APvv
+ 5gD/8eMA5Pr+AO/7/QDv/P8A+vPxAP//9wD1/P4A+v7/AP7//wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD///8AAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABtFxwlKyNpAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AH5wJUFKGjQiICJvAAAAAAAAAAAAAAAAAAAAANuQdX8xMTY2ZEMZNC4eTHJmAAAAAAAAAAAAAAAAkH2D
+ g4WFl5iYPDlRQ105Lh9ZcmYAAAAAAAAAAAAAvY6Lnp6YoJiYmJiYOWVDGDYuJu12aAAAAAAAAAAAAACO
+ taqgoKCgoJ6amJiXTUAdOS4m7XhqAAAAAAAAAAAAAJS1nqqgoKCgmqCYnphrQxQ8LinteGwAAAAAAAAA
+ AAAAlLWeqqqqoKCgoJqamEVAX5guLe14kgAAAAAAAAAAAACUuZ6qqqqqoKCgoKCa00USmDEt6XiTAAAA
+ AAAAAAAAALO5nq6uqq2tpKSgoKBDPmGYMSktegAAAAAAAAAAAAAAs7mer66uqq2kpKSgoNRFE54xNnqw
+ AAAAAAAAAAAAAACzuaavr6qvra2tpKSgQz5irpl/dQAAAAAAAAAAAAAAALPJpq+vr6+qra2tpK3YRRil
+ pTF4AAAAAAAAAAAAAAAAvcmmxq+vr6+tra2toGBHY6Wuf3UAAAAAAAAAAAAAAAC9yabGxsavr6+trapf
+ C0kRmLh/dgAAAAAAAAAAAAAAAL3JpsnGxsavr6+vrQIQUgUr0H92AAAAAAAAAAAAAAAAvcmuxsbGxsbG
+ r6+vCE9LBDbff3YAAAAAAAAAAAAAAAC+yanJycrGxsbGr69aVQwGOuGDdgAAAAAAAAAAAAAAAL7QrsnK
+ xsrGxsbGxtJbVAc86H+ZAAAAAAAAAAAAAAAAvtCmysrKycrGycbG2udcDZjtg3YAAAAAAAAAAAAAAAC/
+ 0K7KysrKycrGysbZ7OYPmO2DlwAAAAAAAAAAAAAAAL/QrsnOysrKysrGyrBXUxaa7ot2AAAAAAAAAAAA
+ AAAAv9Guyc7OysrKysrGskgDDpruh5cAAAAAAAAAAAAAAADc0K7Ozs7OzsrKysqPVgEKfe6OlgAAAAAA
+ AAAAAAAAAL/Qqc7Ozs7Ozs7KzuvWCVht7ouWAAAAAAAAAAAAAAAAv9Guzs7Ozs7g4uTk5Nc9UGGzi9wA
+ AAAAAAAAAAAAAADc0MnOzs7O0dDJv7yz1E4bfAAAAAAAAAAAAAAAAAAAANzJztDQv9y83N0AAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAANzd3gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP/////////////////8
+ B///4AP//AAB/+AAAf+AAAH/gAAB/4AAAf+AAAH/gAAB/4AAA/+AAAP/gAAH/4AAB/+AAAf/gAAH/4AA
+ B/+AAAf/gAAH/4AAB/+AAAf/gAAH/4AAB/+AAAf/gAAH/4AAB/+AAAf/gAA//4Af///H////KAAAABAA
+ AAAgAAAAAQAIAAAAAAAAAQAAAAAAAAAAAAAAAQAAAAEAAAAAAABuWFQAXmBnAIZmYQCZeHMA06VJAN25
+ XQBmn8QAQKPKAESmzABJqc4ATqzRAFOv0wBZs9YAX7fZAGWixQBlpccAZKfIAHSrwAB8q8wAa7PQAGW6
+ 3ABnvt4Aa77fAGy/4ABYxuUAVczqAFvP6wBvweEAcMLiAHbF5AB7yOcAY9LsAGvV7gB90usAdNnvAHXP
+ 9QB32/AAddzxAHjd8QB93vEAeeDyAH7g8gB94vQAg4WGAKKQgQC5lYcAqpyRAKOqpwCsrq4Ap7K1AKmy
+ tADKuasA78y7AIm1xwCjy98AgMvpAITO6wCE1egAh9DtAJPd8gCi0uYApt33AIDh8wCG4fIAgeL0AILl
+ 9QCG5PQAiOHzAIjl9ACH6PYAiej3AI3o9gCN6vgAkOf2AJDp9gCU6/cAkuv4AJHt+QCW7vkAmO74AJbw
+ +gCa8vsAnPH6AJ/0/AC75/cAven9AKDx+gCg9PwApPX8AKj2/ACn+P0Aqvj9AK35/QCx+v4AtPv/ALj8
+ /wDu3dgA7uriAOzs7AD/+esA///+AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP///wAACAgICAgICAgICAgHEwAAAAhLRT8o
+ KDEsNigIGhkTAAAKSz8/KCY+MwQmChsFBwAAC0tFQSkmMSw2JgsgBg8AAAxNRz9BKVUzBCgMIWMPAAAN
+ TU1GQUExLDZBDCZjDwAADlNNSUZCVjIEQQ4oYw8AAA5ZUE1HRjEsAj8ORT8RAAAYWVNRUUctJANJGDoU
+ NwAAHVpZU1FRNC8ESSIdAAAAAB1dWVNTUWU1BElLHgAAAAAfXl1YVFNkYQRQUB8AAAAAOF5dXVhYMAEE
+ U1k4AAAAADhgXl5eXWIuBFk8OAAAAAA7Ozs7Ozs9EhY7OwAAAAAAAAAAAAAAAAAAAAAAAAAAgAMAAIAB
+ AACAAQAAgAEAAIABAACAAQAAgAEAAIABAACAAQAAgAcAAIAHAACABwAAgAcAAIAHAACADwAA//8AAIlQ
+ TkcNChoKAAAADUlIRFIAAAEAAAABAAgGAAAAXHKoZgAAIABJREFUeJzsvXmsJdl93/c5td313bf3OvsM
+ Z4az0hyJFm2aYiTLmwItMYI4thArSBxEQGAgCUABARwgNgxE80eCAEkcw0gCZ4NlxHAEI7AVx5FMiqK4
+ z8bhDGfpmeb09N79tntvbeec/FHLPVV16r73ut99I5n3h359azlrVX1/39/5nQ2WspSlLGVRcue1l3/m
+ zmsvP/pJl2MpS1lKU8QiE7/z2sv/vTfY+jUVT1DJRAKvAO8Cl/LfV4B3N1748u4iy7GUpSzFLgtVADtv
+ vKyDwAW3jwhWEd4QjUA7Hjoek05vo+IxWqU3yRTC6/nfu2SK4d1Flm8pS/lxl4UpgDuvvbzqeu7OyrkH
+ 0TIGfxt58A4q1eg0QckE4XTB7YM/RDsBAlAqQicRMp6g4nFhNbxNphTezv9e2Xjhy3JRZV/KUn5cxFtU
+ wlpnfwgH4XWgM8JNfLzBWhZAuOCuIg/eR8sDVJKgtcJJU5TW+H4Puudc4fovaSd4Sas4sxakRIZ73Hnt
+ 5UvMFMPrwJvA2xsvfPnmouq0lKX8qyYLUwAz0YDK/zQgyQwPAWgc30V0V/LSrKHTXZAxWoFKU3S6hwoj
+ lExwtEC4HbyVbfA6jyLEo0on6CRES4mKQ+689vIumVL4DjMF8e7GC19+c/F1XcpS/mjJAhWAthxr0Co/
+ NlsfhTWvQKcIoRF+ByfoAKMsrHDRUqJljJYJKhmj0hiRRCipwOng9kfgBKsI5yWt05eUDEEptFTcfu1l
+ mDkhi+bE68Cbmy98ebqop7CUpfxhllOyALTlWm4RaDVTCloZ99I8WprfEwjhIHwP/AC3N8qKLxzQEp3G
+ qDRCpRE6naCTEJkm4HbB6+B1z4MQn9FafUbpCKRGpxIVTbj96suXmSmG0nLYfPHLVxb8cJaylE9UTkEB
+ 1MWmDOqXbJaCAJFZCODk0Yp7HsJ1cL0BLiPAzXwMQqOTEJXGaBmh0hCdhsgkAscDtwMrm2jHewihHkIl
+ P6OkREuFTmJuv/rylMy3ULEcNl/88usn+kiWspRPSBbnBMSE9mGdDUYTofInavcK34Gq3UvyKPEsLyEA
+ F+F6uG4XxACEB8IHLTM/g8ythiREJRNkmuBonSkGbwTeZg/BSzodvwROphjSlNuvvgyZYiiaEoXl8O7m
+ i8sxDUv5oyOLswBslv+RpQC6eak4rysG85jZsS4URWqc5+GFB8JD+AGu38cdeICfhVdJ3pwIUfEYJadI
+ maLSFMfrQGeA21tFC/UMKnxG4GYOyyRCxVNuv/ryNTKF8CbwBvAWmWK4dK9PYylLWZScQhOgzv7C8ms7
+ NqOY1+r36+AX1evakp+OQSSzZoTKf4UP+AjPww3WcAfbQJA1PVSCTsPMWkjHqHiKUoo0GiO8Po7Xw+ms
+ gMM5CM85BF9QMkWlSdGckMArWusfCCHe1Zq3QL+39Zlf/3b7s1vKUhYri1cAdYI+bmRROz+21C2GlnzQ
+ oBMgyc6loYyED8JHuD6uv4ortkEEuZ8izf0MU1QyQaUTVAxptAOuj+N0oNfHH264muQlhHiJsoszLpoT
+ ZlPiTbLeibc3X/zynXuo8FKWcmRZcDfgPSO/xvpwcoMWzTLVrIVCWej8uCiDjnPlgKUp4SO8Dq43wu1t
+ Z9fQmdWQTlHJFBWPkckYGafIJEJrjXA6OP4g680Q6RNCOE9o7WTNjzhGJRNuv/ryHWZzJgqfw7ubL375
+ 7RN6GEv5MZdTcgIaclgLAO4D/LZwtmuOcaxrYYqSO1ibFzr/FbnFoBOgGEaQV8bxybooA5zOCk53A88J
+ 8rgpqBgVT5DxGJkcoOKYNJmgkwThdRF+F7/TB4cN4TifA/E5naalw/L2q78BudORmfXwJvD65ou/Hh/x
+ YS1lKQt2At6XHJfxj6EkDg2aA7zNQihEm80LI46KQMSgJ1S0W96UQPg4wQCnu44v/DwtCTpBJgfoaEIa
+ H6CSMWk4QUVTnKCfNUG6a3jDNYRwXhLCe0mpNJ87ESLjMbde/Y3LzJoTxTyKt7de/PVrR3xAS/kxkk9g
+ HMA8lhbG3/2mWb9eNzOOKiboDYWgbb0PLcpB5HHLpkR2T6uirnn3pPBw/QEEa7giyNNJQKfoZGxYDWNU
+ PCaJpjhugHADHL+P1x/ieMFDQjgPKaV+TsVh3jsx4darv3FAPpEKY3LV1ou/vhwi/WMsn0AvgHldkJna
+ 99O+Pyb4G8EtzY3yUr15YErNxBG264UfoXAy5vdEcV5EkkCcXWIvD5aNY8gUQ4DwerjBCLe0GFLQRc/E
+ GJlMkOEB6WQfGYegBY7bQfgB/kof4ftDx3Ff0lK/pGSEiiNUMuVW1pwopmBXLIetF3/9oKXyS/lXRBbq
+ A5iJjX1Pwql3WBr1sQTHjV8TTa1p0NYlabnedsvortSN3gqZWwATNA7IIm8n64UQQdbT4J/BxYc1J1cM
+ MVpl4xLSeB8VjZHTCVE8RaUxrjfA8X2c3gh/uAWO+zw4z6dxiEojkukBKgm58s2//bHS6l0N78hUvSKV
+ ejsM03ef+7m//WGtwvfd4FvKJyML9AHoOZ/FosFva0YcMU9bt2PJyPMsgpbEtB35ujLa0TjX1MIXF4yh
+ 0SJTDFpPsktS5KGcrFdCdMDxcXrrdHpnQbiZIlEJWidZr0R0QBodEE+nRNMx8fQAJTokSoDjkKg+nW7/
+ QhAEF4RKv+jJKb6K6fViPv7m344RvOE44vU0Ue/7gftDpfTb53/iP3uFpTL4IyV/SHwAJxnfsVw7iunf
+ Ito4sEYxugsb6c6xCCzJ28NY0ii7Kal1S8rMX6CnoIQRW2TNCNEBApzOOk5nG0cJdDghme5zcOs21z++
+ xt1btwknd7h2S6JRjHdv0u93WVsdsL4+5OKFbdY2toON9eFnu777WaETVJLNsbj1ym+AZfEW4N2tz/z6
+ ckzDH0I5RQVwGib/fYLfBLK2hakD/ZgWgajifAb+wxSFeV3NiqdrYSrntaKqFM2kdEWkqSKMUvbHKXf2
+ uuxOzhBsPEHP2yPe22ezv8f7773LrbHAn6bc3pf0b+2wc/cuD5y9hr64Ra8b0B8M8btdvP4qndVzCMd9
+ CnhKJtHPq2SKjCaoJOTWK79xjUwZvELmc3hl6zNLB+QnLacwDsBhZr7eixwFYDbg53HvRe9UaFm0FENb
+ rs9TCjpv45vJ19v8jQK0X2+1GCzh8ny01mgFaSoJo5jd/QnXr9/k+Z/4DxgMNyqpjSdTbt64zn/xN/8W
+ WsFdAOFy/a7CDRRrD2zTGW2gOpCKCJXEJNNxNociSfGCPk7g43YHBKMtHDc4B/w5GU//nIwnyHjCrVd+
+ IwbeUEr9Xhgl/9dDn//Pf6el4ktZkJyOBVB6wmEGkkMjHTHx44J/DvtXilUH8iEWgWmW18JoW30bbF1v
+ 8zcC24t1WFgAVDZhSWmSJGUaRuztTbh6fZfd3S6D4UauHDTTMGR/PGFvf8yTjz9Ct9NFa41SEtf1iJVG
+ eg/y1puXuXN2n4sPXmR96wH6fQ/fF3iewkWSJlNUtIdKE6LJHioJkeEUN+ji+h5ud0iwshUg3M+i0s/6
+ 452//qM/+Fs7H129/cYrb1z6b3/tb/zWb86r5VJORj6hgUB1J9299NG3AT9PpxX8FrO6AX5LtHnXK0na
+ nH3MmhdzmvZzC9EIbxvBWD8txhuAlJI4SZlMIsZTGMfbPPjEF3l27UEApmGETCVhHBFFMUmSDX0ejUYI
+ AXGc4Ps+QsDjn/4S1z/e4/0rH/PdV17hsUfe5Kknz7N19gyDwQrd7gCvs03Qf5Bs0lWaOSBVjEwmpOEB
+ Osl6G2QyRUYhXqfPaOvi2tMb21/wXPeP/W//1V/6T/fH0//41/7Gb32t/aEs5X5lgU0AbWe++xabh792
+ /zjghwpYquHnZVUDdE2sl3WuELQt7SOAPz8pHXu2AGbzJTf9lVLEScrBQcje/hS3+yQbZ57k4gMPlHpp
+ b+8ApRVRnDANQ6ZRBMDGxgae53FwcEC328XzPHoDn7/4b/0McZTy1X/5Lb72e9/jX/7ed/jSF8/xzNNn
+ 2dpapdcPCHwP3+9mzkfhI5wOXmcFv/cQWsegIrRO0ESk033S6R7JeMKjjz868Dz303/wnbd/++/8rV/8
+ c7/2N37r99ofzlLuR065F+B+HIGHAT8Pc1zwW9vtRyln0WVngrnWxjfTKxx9DeeizaY3rjW6Ccy6tLH+
+ 7FhrTZpKJpOQuzv74D7GAw9+nuGwh9aaOE7xfY+9gwO0hiRNiaKYKMqmFAyHQ3q9Hkop+v0+vV6PO3f3
+ +P5b73Nma51/7ed+ihc/8xS/9Y+3+N//wf/DF//kAV/4E+e5cGGD4UoPSHHdCaJ8f5liEk4X4QQgOghn
+ SDDcwh/EdNd2md69wsUHLwyf3Z/uff/tD/9L4Attb2Ep9yfz7OgTlHsFvqj9zQkn5jn8jgP+2m1rPPv1
+ dqtHl973apnmtPcrt20Ox7qjb5ZPmYTWpKliEkbs7k0I4xUe+tSXSvArpSjGaxyMJ4wnE6bTkCiOieKk
+ TMN1XZTS5XGUSOIkYWd3n/cufYTjufzKr/4Sv/DLf56vfC3kd79ymysf3WJvd5/pNEImKVqlZPMd8inU
+ ah+Z3kEmV5HRh6ThD1HpbYS3Sn/r03RGZ3n8sQs94Nm/8zd/4ZdbXsBS7lM+gRWB6u19G7jrTsN5clRP
+ v8Gore3oIpzZt38E8FdcCKZjUNf8C4bToKFcTEC3t+0bCqbB+jNRShGnCeNxyGQScf6RX2Rl2EcphVIa
+ pRWJlLi+TxhmjJ8qiZKKVEqUkuzt7aGUZjzez1ZGUhq3v854EuK52dTn67fuMIqG/Mqv/gKTyZTf/Z1v
+ Mp7u8hf+TFY7R/ToBB6uqxFC5Iow/0B08SwEKt1FywOEO6K39jDh7Y/8rc2RunV77/PAP66/gaXcv5xC
+ N+D9mv1z7h05aRv4bekfYhFYxDpcACgnAzWweQjrzw1ni6atQbVWpFIxncbs749xu5/i7NmzpGmK1plT
+ MEklaZrS6QYk+fWi2eA6DlIq7ty5zWQy4eBgn8lkwmQywRtsMJ6GeJ6LQNDp+Nzd3cMRgn/vr/2bfO+7
+ b/L2OxMG3Zif+1nwPAfXdXAdUX0OZbMo7yIVWd6ke4jeOYKVDR5/5Pzo5u295w9/GEu5FzmlJsBxpc3k
+ L0z947D+UcFvBDqi6W9v61O39WvpU0u/Dn6zjd9MugzbCv6Z6k2lJAwjkigE9wIASSKJ44QoSYjimGkU
+ Z12AGhyHDKiug5eb/Xt7e9y5c5vxeFwe7x8cMJmEjCchkzBkGkZEccKdnT0c1+GX/+LPoZTile8rPv7o
+ Ttb8mMakUmUAL7eNMhtNxfLwmqzbMsLtrjBa6XnAQy0PdCn3KYtTAFrPAcI8aWkOHAp6WzxmeDgU/PVb
+ LUBEUHy6jTS12e6Z3Wx/Ckdh/haT3zrXYnZB5V1/02kMWuP5PVzXJYxiwjhmGkaEUfarlcbzXDzPK/9c
+ 182shCQhDEOSJCmPp1HEeDJlPJmWiiCKEtJU8vH1m/zMn/48a+sraC34+rcS7t7ZYzyJiJPUeEYF8Ott
+ RZX7CmK8TtZ0AD1sfYRLuS9ZmAIoX6vZN14e19v4Ii9KXpyS5cXRnP9ljmZ62LA4P7FKu98O23LSTmXY
+ MDVlZ7bra+nUm/dzdaRhMRyJ9U2TWiFl1v0XpwH9QZ8kTTMFEMZMphGTMGI8CcFUAK6L73n4npv7ARRS
+ ytJpKGVmQRTxp2FcWgBxmjIJI5RWfO6Pv4DjCD684nLn5h77B1OSKMnSqoDfrIbKy57fcxwcxwFYm/eU
+ lnLvcgpNANE8beBfVM+PnO4RWP+44C+H51Yja8z2a83RNwtE/UQ3EG8LaxNDe+lc8TRYX1f/tKiUJ/Pc
+ Kw7GIZANAZ5GEQfTKdNpBv7JNEQBnuviuQ6e5+LkwJPSPoRbSk2cJFl3YRxnSiZJSJIUrTT7BxOee/4p
+ fC/AdQM+uCwZ70+YhjFp3ptQrYjpDwC0QmuJ43iI7L30DntaS7k3OWUfQAtgj51GhRLhUNafl5egOkqv
+ 6QSsspUwsjccfWU00YhRplIvttUEaLnWau4bZSjsk7z4jgNCOERJyN7uDq7rsn8wYTqdKYHJNEQpVYI+
+ +8sSUMquAFKV9RJEUUKcpCRJSppm1kKajzg8c26TbnfIaGWDaze7jMcTwjglTVOa4DdPZ4rAMLJ8a0GW
+ ct+yQB8AtLvI4ejgF7W/InGos3Q7688Dv5mkqHx1VdY3kjMVRUPhmOA3EC/A3r3XYiEU93IHXTVM0+Sv
+ xtYIAY7r4Psurgsf/egDhHBQWnMwCQnDmPF0ysF4misAUbBtKamUsxQrloXMmxaZSS9V1tyQSpVNhdW1
+ EaPRGmvr64TJiDRJieO8CVDqLhP8hRVgKrbsGTj3whNLOZIs0AdgDoox32DR1q/7AGzn9Tc/B/j1bOwX
+ qvEFxkcoyFb7MZOst+sNR58WTbxiwrLmRyjBf1TWh6YTtQaOoiiV2Lqsjus69Ho+vV6HaPcP+MY3vsVj
+ D18kTbMJQdNpVOkFyH6zSUFSKZIkxXEcXNfNaiQEjuOglCJJ06xHIZ2xv2kxuK7LysqAtbUhfjAiTiVS
+ KrQqCm0+m5amjQaEwHX+kHZW/Ssgp+wDuF9V3hLfuoz4PPAzAz9O7oPIGN3K+qXoyk89yYbJ37hoizhX
+ ixiKqM769jxNI8NzHbqdgNVRHyEUV975R7z6yqt89oWnmYRh3hWYjfiTMh8AlEoSKfPJQwlBENDpdOl0
+ uvR6PfqDIUpp0iQlimMr+EW+5uFg0GUw6KCJstXMoAn2ipLTZL0Abc9rKSctpzQS8Miu/GOKzRdwSNhK
+ +90xWF8YYKunn1+v1Kd6aP1UtRnUFsLW1m+zekzEz9YWMO/VS+46Dt1uwOpKn63tEZcv3+TSD/5vVldX
+ eOHTT/C1b72OTLO9E5P8V2uNlBnDx3FMv9/H9zt88+tfwXEchOPw1E9sE4UhruuUTYDCeoBMAUip8DwP
+ x3WYjMc4wsERAuGIfE3Uet0L4Au00EsdcEqy0G7ATISFoe9DyrUFTHAepmAK1i9MeIEJfo1jgVDtvAX8
+ VuO9uHiUapfE3gT/bN1As61vB/+saDPz2hGCwPMYDrtsb444c2YV1C5/8LXfZtDtsLG6klkAGtIkJckt
+ giiOy3UDhsMV1tfXuHH9Gjdv3ODWjetImTANp0RRRJIkmQVggL/b6/D1r76RNRPilF4vwQ88fD/v1msF
+ v1nn2dlSFienvDfgYW19S9u/0d9eHBzFqjBYH2asX14zWd9M0wb8emVqw1rnmgItUtbFeqNWjjoYDvEZ
+ 6OzReZ6g2/EZjXqcTVaZTCOuXfuQV179Dk898Wneu3wFgChJSvZXSpV+gsFgwGg0YmW4yd2dawRBlyic
+ kiqB5zoEgU+aKwHHcXA9l9/7nW/zza+9Ra874GB/n6cf26XfWyPwXdwK5ahKVXRFa1YVwVIWI6ewN6DR
+ 5q7/tuEfmlZDA4iHyeGsb28+GOVuAb82ew+sYW1FrJkEDfDP8tc14FdD2vwGNpO5YGTwfZfBoEOc9Nna
+ HLG/P+WdH3yLn/7CT/Ps008CEEUxKvfgK6mIkoTJNKTb7TEYDHng4efY2LzI5R+9STidomOJ4wgC3yPu
+ d0Fodu7s8tXf/joff3SDJIbhcMITD19mZdVjZdCh2/FxXSf3EdRZv/asSl/BEvyLlMVNBiotURvKzd/6
+ sS2x4+RcUzgV1jcA3Mr6tnb4rBD3DX5r49ZULvNYvx6vKK+ZhG6GFdnknn6vw+qoz/pqn1u7Y3744TVW
+ V1cBiMouOk2Se/bHkylaZ9e2trYJV1bx+z2mB/soL8D3PCaBz3TQ57033+ODH17mYHeC0g5nNgXPf+oa
+ 3YHD9uaIlZUuQeDlFsBh4C+qpOevLr+U+5ZT3hloHtAtKJrrCRKWe8ICfMHxWL+9jDPwG/ErZRS1Ktby
+ mWvy11n8CO1f0zqopF1tQwsEruvg+w69btYtuLLi8qOPb3Lx4hkApmGYTRHOB/MkSYrnuUynIZ63x+07
+ lzh/4Ul6w4dIkpAbu7tMJ2O6HZ8oDPng+5fY3x3jewGPXjzggYsxnX6Pc+fW2NocsjLs0ulkjkBKUFuU
+ la0XZqkBFiantCLQUU12w1JogL+dle3NhTYPf3HN3P23jfXNXGrgtw3qsYIfS13q6R/G+pYSlQxaT9sA
+ v5GQEJlT0M0HB3V7Iy6e3WBrdSUbzhvFpEoipS7H+2drAUYcHAh29+7gee/z5Kc/h+fCI67i22+8TRxF
+ 7N65y93bd/C9AK1TNjcnDEcrnD+/wfmza2ys9+n1PDzHbdbXLLMu7rXcX8qJywKbALNuoSowbE0AMyK1
+ 5nIb8C29C5W19goj0jT3zfSMa0cCvwlSmxe+xTNfX/q7ErwGhaOAvz73QDSBXy9CHUCO0DjeCuujAUmS
+ sJ8k+YAgRZLIbDhvnCBzZ6AQcT6Sb8r+zsc889xnuXhxm42tDb7y9e+wlyiSJMERDpvrMWsbfS6cX+P8
+ 2TU2N/r0ugG+67b4bbVRrSbwdaPHYCknKafUBDisi+6IHvRWpZA7+gzgH+7hPyLrwwxk2szb1vSoVWAO
+ +I/G+qYmrDWGNeg54G+a2Nm51ipvHQUMhz0+/PgmXU+XowGLPnqlFNNpSBzHKKWRScza+jpnLl5gbzrh
+ cxfO8fRTj3Pj1h2+/+oPUCollS5nz8CZrTXObq+ysd6n3+vgew7CqevrlrKWSm0J/NOQU+4GnCN1Im1Y
+ DTXANfKZRbQ7+cxM7sXkN/M9BPxl2Dob66bP0Nq9V38IulL0prlfDWMDv9YKTTZDUOYj/lYGPaIoAgmB
+ 76O0xvPKGXikSjGZTHAch3Cyz/bZ8/yHf+3fRTgu77x7ic2tTf7sn/5pvvW175CmKY7jsbUesDrqsbLS
+ yZlfIIpRllqXowTzqteeUV2BLpXAouWUegEMMb/tun9QWE9qESu5NK5XP/421reDf/a51U3+Iq36B1kL
+ V0nkEPCX7d359WlON85rWGf/er7NAqFVMc5fo6Qm8H3SOMVFMOh3gWwCUOB7xEE25z8MQ4QQfOqZF+h2
+ u6yOVnAch16vy927u6yNhqRRgtYKKVOGwz79XkDH93E9B+Ham0Z28Bf1Lz+evBdgqQgWJZ/s5qBzwHjc
+ tJpba8/uVPOzixX82rh2GPjbcQfomtvgsO69Wv5HYP0yn1qaZRtaU87UU1LR7Q2QSuP6AVrHDAf9fMFO
+ TSIlcRTjuS7j8Rjf9/F9nx99+AEH04jRoMe5s9t879U36HU7nDm3yYeXrqC1ot9z8T0Xx82cjvU6zfSZ
+ tterogyWsmhZ8GzAXGxe+hN80U2Tty2/efFzU/5EwZ9lXIGs1eSvtX/MSxaQ6KKNXMvHWogiaD7KL05S
+ UuUxWt0iTlIc18V1XUYrK6ytrrA6WmFjdcTqaMjqaEiapvlftoDoD956B4DV0ZA3336X3f0x5y6cQ2uN
+ 40g838VxRT7gR9Osn1n22n1tezJLRbBIOX0LoEKFta6/Y1oD81m/MCXnxTfK0Qr8mmKpO6gsxF2cVLYF
+ O5T1a+VtAbdulNO4Vz9Xs7hKymy8f5wgGbC5vsV4GhF0AnZu7nBmew3P89AqW+2n0+ng+X7etp/xxN7+
+ QeYrcF3SSJEmmjNnziCEQ8dXOPmUYYGYrbOimbX926yZenu/daWlpZykLHhBEKiC3AYqm9TiWCYT6Yay
+ qDsXjgL++2R9K/gL3pqBfz7rG/k1WL9qCugizGHgz8PMAJi1+5OczSWbrK2tsT+e4joOSjv8vf/uf+H/
+ +F9/kySacnZ7k+3NddZHK8RxTJqmKJVNEQadLe4pBJ4b4LsdukGXb3zrt+l3pfGqVH5cKII21qcE+4zx
+ 6+BfaoBFyeL3BRAYu4NruxPQ9ls6wDWmr6D+yTcj2oBveJ7N8K2OPssH12by11jfZvJXxZK2uR6ekY4Z
+ p6lAWs5NwMyW3kHpzPMfhikJffq9Lrf3JgghOHP+DJ/9qZ/kf/67f5ev/O5XcB3NI088xLPPPkcqFTdu
+ 3GYwXGE4GnLh4gNEcUo38On3VlBKE/T6JElEx8+W9Z55/cmOj8D6deul9Vkt5URl8ZOBtJjh87jmfglK
+ 47QUYSHqOvirgC6thkb3nhnWEt/W+1c5L9K3qydLhOalNpAcAfzVYuRl0dW0sq3BJUmakKoeK8Med/an
+ CJEtBfbSH/8sSfJX+R//7v+AVnDl0mXefu33mU5jhOOh4j0+99IvMhgMUCpLs+N7HOxP2N7axnU9giBB
+ OI7h4S+U93xWb+52lL9H0VSoSzlZWfyCIEcdB2CLa5wCTZ1RN4V1PVARQBi3ToH1GwkdBvxZOmaA+cA3
+ wphp6KYa0hpkmu386wlNqrv0ukG+OEe25p4QDl/40p/imeee4Z//s3/OpR9eZmPtj7O38yb7O+/y7POf
+ 5S/96r+DQJSr/7iey93buwg3W7ZrbUXjOCJbjLTIuPHMD2H9xgpBbXVfyknIKWwNBvOZ39IVaFyyvvoG
+ 67ePEajqBJuiaPm4DmX97OSTYX3j2hzWL6RYzz9JJMIJCIIuILIVeoSpBARnzp7hr/zVv0wSJ9y4dpud
+ Oz/LQ4+cY3NrI1MYgCwsgCBgPMnGCQS+QxBk6xDOHIDzWL9Z58rMTeyzApZysvIJzAbUluvNOIevp1+0
+ 91vSEfUFO4rDlnSLNBusn5sxJ8H6s6i2k0aa7eno4h9N1q8H07kTMFu5N5EBK8MBUZIaS3RlwJ4pBAev
+ 5/LIYw8gHi88+JThitV/ev0gO9aabsdFSp0rEiyGmAl5G+vr2bFoxlvKYuSUtwYr2gTzBwBVgVsAMP8r
+ TQPd/DaEEbSeWhnfTNeMSIvJ3wS/yft2lrLUW5uBKydGuvU0bM+vAH+uhMyddMxfbey/o7NFP9M0JUo7
+ DAcdplGCcDIrIOsWERtxAAAgAElEQVS6y5WBI3IzfmYdzJQDkK/3B3Dm7CaO6+J4Lt1eP7MwhKnkqYDb
+ zvoKs8yzZ2GsFrTUAQuTU2oC5NfErG+4gSsjzkw12NoBNeDX9EgTRDb2rkU+sba+7aquaaTmk2mdHttI
+ p3qsG3WZAb4SU6t8IJAm0V2Ggz7jSVQyfgHuEvCiYH0x27QpVwSg8x2HNEHg43pu3gTwiOOsu3BWTV32
+ RVodfQ3g156HaeUsZSFyiqsC1+/ryuUKPqztb+OkxXhofiZ14NUSaB3Hb8u7yvpHyb1ciqxiyh7G+i1p
+ G2mocomzOtvaVZQm6wVQWhInLoN+l1TKKssL8ra7CfoCvwb4c2BrwA88HDdTAJ7nMo0SlFRoVez02wJg
+ bew4ZLMSTUttOSFooXI64wDMi4gZM5Qa3qYgbCf29rv1E5kX3+qgaot3r6wP7U0OGuna7SFRNYtLgDe7
+ Vqz77ZlnSiNThaLHoN/lIExKx1+V9XPVkmuBEvp6lr/WWXqBH+C4DsIRBIFPFGV7BJQbjFC6YY3noo3i
+ 1e/luduIYSkLkdNbFBSoftC28MZhZWxPa//fEcFvAt+SV2u8e2V9qK4FMI/1bekcFfwZW5btZWuXpkbn
+ G3coqZFiwKDfZRKnJdCrrC+aJn/O+qpQAEqjtKbXC7ImBIJef4VpGCNTRSo1Mm92lNuNHcr6Zt119dJS
+ Fian1AQwLphWuekPNB18xddoI86KUVlrK9i+GMuMtEbYE2F9mDkm2wp/xO69kh21QZgWZaLJwV/kV9/M
+ MwdSrgCkUki62Q7AhtlfkG6hCCihb24Zlv2qnN1VvqW4VhrpaIKgy3S6S5pKpJJl+PK5lEW3PNlGHWf1
+ b8ZZyknK6TgBS1CArlB7PaARQTeuVOPV75jhrT6CBbI+MBuyrLFV6nBHX70eNvCbQYtrdtYnZ+2saBlg
+ 01QyGKyQSllp92OwfyFF957WoNCgMgugWDo8VQohRLajkADf94niFJmm+eKiOmN97cyeT70SlVdiUwzG
+ /IelLEQWOg6g/AbLZp0or4NG1N5tyedatDO37VphGbeWwpKMzToxLn8yrF8kOacUBvhn/9fBP0tPa4VS
+ +d5/SjMcrhDFabnjrjAcfUVp66xfTCZSOk9Pa2QqcV0HlWYTg1zHJUxkubKwzq0AO4Mb5TtUMS7xv0g5
+ nUVBjY+rfPm27cJsloA99erpkcEvoAa2o7F+y53KWIT7BX/B1tWw1aJqmneNkutqmExEvtS3QmuP0XBA
+ GKeVtv4s+ZnzLnP0KRSUjK6UROlsJGAiJa7rZjv+Cuh0+uzcSbMmgtIt4D8K61dfpm6ksZSTlFMbCTj7
+ rmtNgPJ6PZ4N5IZCaYC4JX4F+PUP7l5Zn5lpcyKsr2u4rYG/BgI7+G2mss7XAJSkcYrwNxn2u6B1pXuv
+ YP3S5C/a+rmzTxW/MvvNphZLgm6AlBIBdPtrRFGaP5riWZum2RFYX2f3Gj0HS1mYLFwBZN9uc/Z+Qwwf
+ IEK3sPoxgF8fA/BHgvWNa2Z+1tQNa8ras5KBTylJmkiSNEW52/QHnZlnHgzGL7z9qmR5pTQ6Z31VOhKL
+ mYUpotdBKoUAPM8jjmXuh7Qxu+3pVIGfnZubtyzBv2hZ7KKg5Yo0NjS3fbRt4etR2j6OmpI4jPXLvQMP
+ SfvQtv4cZqunU4RusXp09b9a+m2sb1oks2uF8y+KUxJW6XW7JPlQ3pmjb+bg00qjKNg+7z5UZN16UpPq
+ rDsximW5hiBkMwPjJEVrmVezUFBm88/ybHS9Xi2PaykLkQWPA4D2Bnph6M1GtGXGn8gN0+Yot9rB/Gxb
+ WL88ygciHQ/81XTMOPNZPwenOS6+RZnp5k0j/QI02qLYavlq0Drf5ivf6itKXDqBTzwJS+++VlnqumR5
+ cuAbrK9BSTXbOkwpJlE2kEirzFoLOj3iRCFTY8yClfVn5WwOXiruaeMxLy2BRcqpzgU4Xsiq6Wg5sQbP
+ ju3g0OW49HqYlvSPwPpHAr/xIbexfnu5qlOO28Ffv5TFy7b6lqhUg3DR5EyvmfXrl6DXFfAXrC+1ypsE
+ KrcoFGEU4zhOOfa/NzhDFKdZmjLb/FPVyz6X9Q3CMKwfiyG0lBOUUxwIdJyI9cM2a6KuJGysT/5NiVbT
+ up312/v1Dwe+ednG+tU4TW93AQCT9e1h6nmVMTXofHsvJRxGg1UmUZyzfWH6q9LJl+0ZoLJfna0iXLC+
+ VJo0X1JcKck0hGKyUJpKXC8gSdJytSBlzvIz69PK+saDmLfi8lJOVE6hF6DtDR7C+pXbRxj8Y6LL+IAq
+ xvGRWb/eBDku+HXjm27Ls431K3kcC/ymUslAm6QKzxvRW1khTpKM8SsefmWcK8Pbn48ezHcTkrkCkEoR
+ pTFaaTodjyiOcV0362psY/a5rI9RP9v8iaUWWJQsdhxA+UJtg3rmDNGd22VgYf1KclVwVUBkS6d+qXUM
+ f3bejNUG/ntn/TIfa9deNZw5Z6BeOqV1vhR4inbWGAz7KFk4+xSyYP3S1J+xfQb07F6aZjP8UjVTCirN
+ jjvdALmzj5v3ApiLhxyL9Wv3dB5vuTnoYmWxFoDNHLcGKBxy+fG8xFrTnGmO47O+eekkWH9+Wz8rlp31
+ K+VulKl2rMtefGtJsz0As+XAw3RArxdkJn7O7uUIP1WY+gbry2IMgUIqmfkBZNENmDkHYykZDPpIdQNH
+ uNlSYQIcZx74baxffQa6YgUs+X+RckpOQPMVWgYCNUB9BJO/RaHMZ31LvDJCu7l5pHH8hgl7PPBX8y0G
+ 5NjjFoVtZ/3C+64LlpcpaSKJZEA3CIiNNr5WM+deqrLzVBZLiDdZX8vsWCmN1JIklfSHPdI0QQCB75Hm
+ ewfow5otNgWYR8mWEjfBv1QBi5LFOgGrB1Q/9jqo54D10Pc/+0xm39whoD0R1sf4kLXFpK+d63qKNTXZ
+ MPmLmX5G2JL1q2lr81nlSkTl6wBqpZFiFd93Caf5dt+mw89g/fJXy5kFIHXJ+qnWaJkNEU4Sieu4SJlN
+ LXZdF5mqkvWzmYpu9Tm0PKPKEGhdI4cl/hcmp7QegEUJVIj+OOC3g/T+WL893fb7RV73z/oFY1elDv5Z
+ mdtY3wwDefteStAS6fSRWpDmnv2SyXMlkErVUARKZf36snQSSqTKn7eCOElwHEiTFADfdwijtKWu2J+5
+ rr27xhyRJfoXKae4LHjt5lzwQ3U1HVvYGuuD3axspFk3TQ8Dvi2dk2P9Yvx9M66hOI08Kl7+WQYNcBUD
+ e9JUobWg0+kymcZ5O75w9hUOv8IKkDn7Z8Avegekzrv/8nQL51yUpARBQJomAAS+TxjGZRejuTPxXNZv
+ Ga1pi7WUk5VTGgegq+eViT1Y3QLVucKWj76SfBvrm6akNhi7mW5xfnTWt2V7TNav0F89fhGuCfzyvMH6
+ xl2dATxNJanyGPR6TOMoH+Rjmv2GQii7+nTmEygHAEk0oFQB/mywUBSl9PpdZJpZAK4fEEVp2Vxo9QPU
+ Wb9SZ1Fen9VxqQYWJQu2AGb/F9dmR/VZgrPu+2pb2A7Y+eCH2YeU/zeX9W28fxjrN1OoBp/H+m3KoXau
+ q89vdsfO+pmoMqqS+ShA3affDXLT3vTuZ6xfnKdqNg4gzQYLZM7CvLzZ5KDZ+IEojnEdhzRNAY3ruNmi
+ IHkaVoWra3VoPAM9+6sHWcqJywItgOIDsEltbEDFUtB5O9AOiqpeaEs/VzCaE2T9POyhrG9ea7J+Mw1L
+ Pe+R9c2bWme7AaUyRfvb9Lodo51fjPKTpYMvNboBi/a+1iJn/Vk3YdEs0FqXewtkTYBsy/DpNEZK3ayn
+ rg1smlt/o37LcQALlcX7AKxteculVtafnR/O+sX9o7T1s2tzwb9Q1jfDmO39JvibrF/P27iRxy/b+Kkm
+ ZQ3P9wjDNDf7ZTmvP02LGX85wMkdfXkbXsrc5M9HByqtyvkC0zAhcJxsGTCt8FyX/f24XH2oaC4Ic4b/
+ vC5ODcbyUdW6L2UhcgpDgdvEAKYBNFuYKmEeBv4izHFY3xKm0tZvt0hmRbpX1heAqgavg7/VmVYzm437
+ Smee/ThOiFUHrbMx+1Jns/m0VKRqpii0bUiwUsZaAM37kzBmOApQMkVqheP5jKcRKs3CUawMJLC8Nxv4
+ jbrUlOdSFiOn0ARoYVVhsjTNcMdmfaiDoC3do7N+y4KblSwPYf1KHe3lmYH/HlnfAn5lOPgS3SdMUlIp
+ y4E9s+m9GkUWtmB4XcwFKFlfzuYNyEwpaKWYhCHe5oBs7J7AdQOiKJlNGioV1/z3Ua1fbYi4tinrpZyU
+ LLQJYD/JL2g9pytQW+LPWSS0BP+8D83G+22sL06A9TmCo28O+O+B9bV5XZHv0qPB63EQxrkPIBvIk5Zm
+ vZwt+FHMC8i7BmdWQD61OL8mUSA10zDOvDmOg4PG8zzCcIpMVTmvoNq338b6zedTfaJLFbAoOaUmgOWj
+ rXcFGuFajYL6xRNnfQ4Hfi38vbG+KsusjfZ/hfVnmc3Nqwn+7Ecpme0EpDRBEJAkshzOm6qsHS+lYeIb
+ q//M9hGYzRPQmH6ArDdgGsaQbwsm0HQ6AXF6kPcWqFq5a8+j9SW3+VuWsghZ7JJg9Q+4/H5r5mt5JChn
+ EB4Z/PNZ/3jgP0QhVcIfhfWLG4XGq7N+7f8js37uNyivNssgpSaVKUJ4BEGQd/MV03nlbNGPsm2vym4+
+ mbN+2Z9vtPuzAUZZnPFU4Xouge8D0OkMkPEtZkuKF4VqLgxarZdRCy0qgwGXymCxcgpDgY3T+jXjZvaZ
+ lF9wbfBgPZ08TAvra9O6aGMaa1u/WYNm+S31OJT1TUff/bB+Ec6y8abxXJTMhgAnicTxNwj8gP1U5l1/
+ JrMXS35pqwLQhvNPF4uEFr4AdL4cmIMfeAgEQW/E3l6SzT/QxV/WAih6AyxPlgrrNyzDtm9mKSchp2AB
+ lFfs4YDGLkFzwV9NWM9pShwOfpOlZhk3fAVzWL8BYFt+LV7+Jutb8miAv0VxVCyLjOWTJCXWm3RdlzSc
+ ImXG+lGS5msEpiXDy2xxQIQjcPOt2Uz2b/zmXXxpKvH9TrY0eLfH1TAtHYymBWgHvzarRPPla6sfeSkn
+ JwvfGajCzMxWom8GtoO4YkUW00TnOA+bl00FYrL+/LJWM2/+zpKysVV9Bl9h39RymWvyt5TbTMFahpzV
+ ZdYM6PccEgRJmlkFYZRwbnuVi9vrPHBuA8dxAIFUilt3dvn45l1+eOkqd/fG+J6DEM5sFKCu/ynCKKHf
+ 7yKlpN/vE4YpaSrL+5mVYPerzKp9lPe4lEXI6TUBjOsVa6+4UgwOFBYGNuaHV9O3nM9l/Sp4myWphzfT
+ qQG/wfrF7D1bW79m8i+A9WdlyI/yYb6uK7g9DbMxAFLy4tMPsbE6JFHw1vtXGO/tE05jOoMho7UNNta3
+ +DMXz7O7t8d337zExzfu4nuZkihBrWdLiodRTL/fJQwjur0eYZyQJqpcT7BBAuUuwW2TvWzvdakJFiWn
+ 1ASoM5gRDovFX79wBEffkVi/PG2qoEbhbeVuZf16Wib475/1zXTaWL9afFWO74+lz34YIqXiwXMbBL7L
+ a29d4g9+5/f44NKHJOEB57cittc1D1zYYuPMA3Q3nsddeYTnn3qUB89v8J033idJJa4jsrQ1FHP+wzim
+ N1whlYper0cqIU1mIwHNF6q1ys40aFRlg5Jm3esKdymLkFPuBhTGldpuQdoC4hNi/RnwC2lZ5vsw0M1T
+ NC3AL0OZBahqk2ZaNpO/klU7+KE2RVl0soU7PMFKv8e3X3uX/++3/gk3PvoIB8VzLz7MAxdWOLc9ZHXg
+ EQSC6Z1v4I5f4SP/ORL/Ai89+zhvX7rCrbv7uI4oB/horQmjhKDbxR0f0Ol08slHhaWgLeUyaqW1ZQ9Y
+ bZ09vpTFyMItgCoHwOz1z+vruXfwV8FmsogZf77JX7FTGuBvK9fsfgPSc03+eaxvpls/hir4Z8AvTHW0
+ ZjcMSKUk8AM+vrnD1//ff8H1yx+SSM3jT2wxWhvh97fxVi4wOrvNxlqffpBy/Qf/kA2+yp3oIpfuPsXZ
+ zVWU0ty8u4sjRLa9OBAnKZ7rgIBev4eSNVAXz9OipKvgt1tlSwtgsbJYH0BtGGfTu47dnD6io0/XrxVx
+ D/14mmxsLVsloznALzMT1atmvBNl/br1UgU/eTtdo7i1O0W6A5Ik4b13r/Hx+++DgI2RwvE0d3d38YMO
+ vX6PbreDFg7xcMS+9wwXz66x1ttmfDnlwxt3Obe9hiPgxu1dhOcgyJYF00ITx1OCjo8CHM8B8u4/o+7V
+ XdhyWmg822bdllpgcXI6KwLZXqCtr78RrAm66vcyhz2toK0np9C25oBuOW6UaVbmArRHY/3ar1HWw1lf
+ V+I2LZ7ZsesIojhB+dkyXVcvXyZNEqSUnN2A/TBEOA47wS6O55HEKbu7u/T7PTxvmyv7K/TTDqtdyVY3
+ 4dKPrvPkoxeRSrG7P0E4DqlUuI5LnMR4no/QAq0MsNfew4z1beCviW6o5aWcsCx+RaC6Q604FybwZoNk
+ MsVQZwFqZiTV+ybrV/9rKVidifK/uYxrybv8acn7GKxfpnMPrF9PX1MM9c26/pSTb+YRRWX7XYmA0XDE
+ YDhgMOjjuQ5SpozHYyaTCY7j4jh38XwXNCgpeenpT/H6hzs8/ch5vvvmBwAkUuIGnWxNgSTG9b3MD6DM
+ MtvXNmyVeY9+KScqi3cCmrivsWnJXroRvBLqeKxfT6WWojZ5us7C9WNbiY7A+uXN02J9jHuzwqVSZYN/
+ nGybLq10vp+fINEBHb9HrzdkfX2TrY1Ngm6A7/tIKXFcjziOicKIVCZopfn0o+d45Xtf50r3RbY2Vrm9
+ s4+UisBxUVISxzG+HxCG6WxkYX0kzyHg19bm31ILLEoWuzNQa9utYNzDXuycefRHYv2awmmAch7jmmGN
+ sfdHYn0j/crFGsjLqDalVi9rnqtVsYA2y6dnB1KmaEei0fiBj+tmy3R3XAjid7nxUY/J/gaTgwc4e/Fx
+ Vkcder0Br33rn7G6tskDj72A7wckSUSv22Ej+g47ew/RG6zkVoPC9RzQijSN6XQ6hFFarjGgW+tWF4tz
+ mFwhLPG/MDmlvQHroMvP56wM3GryH4n1a+f3xPrmh5hPay2dfJpqtrp5bM1vpkiarF+pDPfK+sU9IQSO
+ EPh6l6ncQAgYbm7gui6O4zANUzZWxrjuGE/d5eDGJfZvfA2tfDrdAcHwU5y98AjRlX/CuP8cq2eexnVd
+ 3GCVZ87s8P1bHRzHyV05Ot9kRNLpdoiiNBsMpGSmBFS9Z6Aqh07TXsrCZPFOwMa2AIe97MNM/uOxftWR
+ ZGH9xnlddFmRe2Z9hKXsNbA36ns4+HXNKgGdDa4R4DjZFl1nOzd5L3kUoTX90Rqdbp8kDoniiKAXsL3a
+ ZdgPcF2HOEoZTyLQB2w9dJELDzzCZNRlf+c6Nz/8NpNPP44aPsf5B17g9ZvXcIRAak3Q7SPTFKkknhsQ
+ J9k8BCnzrcL9bCSh7dnWbDQa/gJLqKWcnJzioqAtjF65YgCqMqOvxvrV/+xpHsr6NMsHzD7Apsl/PNYv
+ 7i+C9evgr95zBLiOg+87PLQV8+Z7B/jdHo7j8fBzz/L+976HcH3W1+DCuRFrox5B4BHHKTt7U27c2iea
+ 3Gb/4IBY9vAGF/Ail1defY3+aJM4Faz2O0yiFDQ4jpsPNU7wA58wlKRptvZgO3gbQ6Wqz6Gs9mEKein3
+ I6fQDVhXBGB74RqMXb1NAJ0261fDFzlb89ZG+FKMse5a1cp+EqxvPptaefI4Il+koxN4REnEw4MrXJFP
+ opVi68EH2b1+g53rH3LthsvjjwSsr/UY9APSVNHpuKRpytXdPT788DJSKjzfQ+AT3d6h2+1w4+YNHOHg
+ uC5CwN7+lCSK0SiCICAMpbGlmP1d1x6icVx9LvWnu5STFWexyduAZmH+yls2gH9Pjj7TULeAv2SUOZNR
+ KqxvAb82z02Q5hOCNDn4Z+k0HH0NZadnOVasJxP8ala+hjKaxXEcge8J+v2AcZSy3XkftfsuwnFwXY+n
+ fvIn2Dj/CD+8JPjqN2KSROG6gk7Hpdfx6XUCNC4HBwckScJ0OmU6DRmPx+zc3eHjKx8TJymba0N81+Ng
+ OsFxBZ1Oj+FwRCLNuQCVt9NUzOa5jQBqz2ApJysLUwDVFoBNj+syXCNMbVScbUCJmUZxqOugqQOt1eSv
+ AmsGxaJYNtYt2L04LpKtsn7Di10p4yysnfVNVVY3+WvgN+rlCAg8j0EvYH2tT6oVT67+gGT/Cq5w8Dsd
+ nv/8T/HYc3+MSx/B7/7+DjduTdjdDTmYRKRJihcMCIKAlZURw8EKnivodLu4rofGwQv6nNtaw/ddfM9j
+ dXWdc2fPcvHig6Spajj9qmMt68Cvg7+laks5cfkEpgNn9zR1k784NNkQ44Ovp21GqbNl3fKwsX4tzRrr
+ N0aq5b0AVcau51H7xOea/DXgN+4XR01H3+ym/bkIwPMFw0FAnPSIkpSPruzwqf53+WDfY7T1GIHn8OSL
+ L/Dgo4/yzuvf4+//5gdcON/hwsVNhr1V7u5MGK10+eo//Z946LEn+fP/+q9w4/YOt3f2cIdnOXtmnV43
+ IPB9EqHZ3t5idW0NIRQfvfXDSpmyiV+HLQxqKmTzvP4ul3KScgp7A1ZfeKV7zxzxZwV+PX7tXM/g07Qe
+ zMvzl/c208nyto1cgxnT1xl4FqgJfPO8WYYm65tH7Y4++xyK2bnjZEt1jYadbB1Aqbh6bY8nvO/w0Z2Y
+ 3oUXCQKHwaDH9rk/w2Rvl7feeIN/8ZV36XY8PHdMv/8B5x98gkefeIGDKNv/b3cCF85v8rnnH+cPXnuX
+ bsdndzoh6HTpBF20htGwg+M6OK5oWRG4pfzmM6o8kqUGWJScws5AM+a0sn5bW1/UX3rzA9KV6zoHbn1B
+ jnk7ExUpmDvXmGWr1MTyO0tjFvwkWF+33mt1qJrlFtlePL4roBdUwl69tscF77tMb+0Srf4kg81NPM9h
+ tDLg/AMX0D/3s1y+9CE7t25x9aOrdEYdrt9xSIJdti88yBe++BleeOphXnnrQ1KpEFpy9YNL9Ad9ZCK5
+ 9P47/KlnNggCB891cGzbfevaeassOwAXLafTBDjCxJhCTdQCWs+tbf3KuS1udSXd7DssFFOhhIxBC/Uh
+ rHNYv1qm8oI9XoP1Z+k0Wb9WmUNY3/xfQLZkt+vQ7Xqs0UOTzdH/6MoOI/d93r864ubVPp96+ll6qyNc
+ VyCEw6df+DQd36fX8Qk8H9932NoY0Q0Cbu0c8J3vX2J3HOK5Dt/52tcZH0yI45TbN6Z46TU6g1X6/YDA
+ z60As8y2etWrVFkUeqkCFimnsB5A9tKFyaYVcJnONmtKlcNqx5CFTQ5l/Vmuzba+hU2Pzfo06jfLsV7m
+ o7J+vS5N8M8Oq+GE0NmSXl2XdfrofMOQKx/vcnE7oDc8ywfvvMr7IuDhhx/j7PnzaC2YxpJxmNINEnzP
+ 5aPreyRpihJki4jGEd/+2le5c/MmKI1MIm7ceIcvfrbDcKXDyiCg0/FypXIE1jfeS3OZgKUSWJSc0mQg
+ E7BVYGhqyqEacXbWyvpG+AZ4zGGIqhJEV/6bZ6HMY/16OTX2tu081p+Xfz1OkUc9DVvY7LiwwH3XhY5m
+ ddQhSQaEUcLVm2+Au8rDD5xHKfjog7f5/qvfYWP7LNtnz7F95hyxEMRJtsqP4zrcvnaNH31wiZtXrxJF
+ Ia7j4Hkx169+wOc+rdnY6LG50Wdl2CHwXZzKSNAWIJeKHWwjBpfwX5yc7pqANsaq3mieN1if5ofeYH0L
+ gLUwWJ/mR3ko68/O7axv2wlnHuvPtwjuh/XraQkECIXvufR7AWuriiSRpMkO1y7/Fh+PO+CvItwem/01
+ 4t3LfPPNb9HtD7LiOV2k0niuR5rGuI6DEJpukDCe3qLn3eTf/rOb3J2MOXtmmK0q1MuaDu17AZhVann/
+ xTe01AALk1PvBqwA0OrQqgK9wnFleGO4rrbFNS2O4kzVMDWP9Ss3KuU8dEbhoQCv16ker5qfWQ8z3FHB
+ X9wX+foLnucw6Pukaz2SVGYLfN7cZzzeQcfQJSCeuOyPV7l+8y6Dno/rBQivQycImI73ieOUfpDwS19Y
+ 4eObYz64OuXKnR0efmCNrY0+K8OATuCWisIq2nxG5kVRPtbZwVIDLEpOdWOQ/PXm73keE0NzHnmd9W0f
+ fnFsMAjGZ3YfrD8rU6WQljK0LOlVB/89sn7l/1blZUsrUwKuo/EDl+GgA2g6gctopcPefsiduxNu3x2T
+ ppJf+qW/wvr6Bnfu7LBz62N2rr3Jo899ge9971X+xJ/4PI8++ggeU6Jv/1MS8Trbmx7ra31GKx16gYfn
+ toDfyvq1cgvzmTeTWMrJyamsClwdVVccVENUzrQ2FMQ8NjTj2lg//9AOBdtRWL9m4t8T69vu2cpjz+O4
+ rN+UbD0BVzh0Oi6O08X3XQZ9n+l6j/XVLivDDtdu7LF791a2a7BSrKyfpTNYY3d/zLPPPYfjety6dQff
+ 93jkmb/Ak5/5Jbpc49bl/xPXcXBcxz79t5X1jfoLW92WsihZeBOgOVe9Hfxlr4GVYS3nlY//OKxfL0u7
+ YrA7+uplOG5bv16eeUrOZH2MZ3A01q+UIb8lhMZxRNYc6Pl0ApfBIDPbBRDHCXv7e4RxEV6UfwDy1i12
+ /QDf9wiCDr7v8+LzT3L1PZXvCmxb7vsQ1m/cs7zbpZy4LL4JMJf1Z0DXmJuD0mS5e2Z9I9yhrA/l1F1b
+ mY9k8tev18v/CbB+JS+NVJo0yXYKStLZ0l2OEHi+Szfw6W5cQCmXJIlJ4pgkTRDCZTqZMmWaKQRH4DoO
+ rufx7KefJIwSkjRbBKRe1Hbwz1HqWi+bAAuWU2gCmBNeoAEq00qwytHBf8+sj6Zp8h+D9WeRjIRIeVEA
+ ACAASURBVDrNKftJsn4j71oatTSV0iRxShgldFc/hzy4xXRykzi8SxglTCcJnuuwsr6N1prXv/nbpGmM
+ 57k89uxP59N803zBD0mapsRRjJSKMEpJUmNDEF0H/rxnUBxbeg2WSmBhcopOQKhr/gJGpWNwrslvB8Hs
+ Wzsu6zfvnwTrV/6/X9a3pnEvrD8TpRVxIjk4iIn651m/+EU2Ox263R5+4HLr2rvcvvxtfv+1H+J5AZd+
+ 8DWeee6z/PKv/Ee8994H3NoJGQ6HgM43Ic0siSAIkDn4C8vveCa/WSfjOS/Bv1BZqA+gBKXFe67FvA+5
+ rj3msf7svBqmOLT3z9fzPTnWb16vFqstj5Ng/bwcbXmRWwCJ5GAcceutV+mtRXQCHz8I6AQB/UGf4cWf
+ ZuOtv8cHH/yIP/Uzv8BPffHnGYzO8uRTHX77v/mvefCRxxmtrtPr9un0enS7XYJOgB+4+dj/ulV3iOVj
+ HpY7xbdMvFrKicpiJwOVL9yAqjZfLJZ3qysfQvUDmMf6dVanEc/6IZZJtCmke2X9lvzm5NGuzI7L+vX8
+ qvGllIRxyrVrH+Hu9fF9D8/36QQBnucTBD6rD/00X3x+Hd/3ubMfcv3O2zz95OPcvvp1Jne/TafTx/UH
+ dPvrrG1c5My6Sy/Ihv5aF3udx/rWoLNnokG2VHop9ymnMB2Y8kBr89uwzBJr/fgNy4F5QGHOh3YU1q/e
+ b6zl17h/v6zflsY9sH4ZvIVhjXtaZzv4IlxAM51OkQfjfBYheJ6H53lcvXoNz/PyHgB49JEHuHBuxMZa
+ j17Xzz39uwTBmCtvXebs9pAg8HAcp1qOVkefpbhm3WfxJi0VX8p9ygItgMIMzDzMM9DmEK7ME1e1D0Ex
+ W6yoSGOWbjvLmgdz2NPG+tUPjmqIOvhPmvWbac9XGrPrR2V9U4QA4QjWNs7TXz2PytvxSZKSyoQ4ionC
+ kDhOUEqWTr00Sdla73Ph3IjRSgffd9Fa47oOva7HyrBDr+uRbz1wLNafneRbiaMoBm8vZXGycAug1Qtc
+ ntaZvAmE4zn6qnHr9486gWce68+S/KPD+oUIIXAch07gkdy8ys2DBMft0u2P6HQH9Ps99Apcef81VjfO
+ 4PpDFC5JHOE4DsNhh7W1Hlvrfbodr0zf9Rw6gYvn5WsAzAN/K+sbddbG0O2lDliYnMpIwJkcDrzZsQl8
+ jgi2w1i//jXZFcrhrD+vPItn/Wqy80DWTKBYMLTX8+j7l9i//ga378bEiYfX3STortHpjbj+4Q84e3aD
+ s2e2WTn3GcRwE9fL9gl0hSDwHfp9P9sq3BHl4CJXFOb/UcBvUVw69yFos9mvp7YnsZT7lwWvCHRUVlsE
+ 6+tK2IYlciKsXyZeK0P9uiWPSvlPkPXnxs8GWwWBx8qgw9mtIb7nMByG7B2E7B9cYffme0Rhwktf+us8
+ 88yz7P3w73Pl2vdwVp5EKcU4dAkjxcEkyZSJ7xAELq7rILQAYY4CrNer9YT6s9NaIkQ+NEwQt1ZoKfcl
+ p7AxiA2YGNd05Vjn4NfCFtY8bGMZA1wlBu8V/Edl/Xr5mh/3/bF+nsY9sr5ZCuEIvJy9hdOn2/XYWOsx
+ nSbs7Yfcvjvlxs19Ll68iFIJnUf/MudvfZ8PLv2Qa9eeZuWBf4ONxy/ixu+wH36IG+4T+AmBD72uh+9b
+ ZgE2itRS/vJcABK0M1eZLeX+ZaEWQHaQA7U6LpjmApu6dDZpFNb59XMBUGNVK/ibrHyyrD8njfLe/bB+
+ Pd7RWL9u/7iOyFjbEXQClyTJNgUZDnx8P5sPcHfnLvvjA9IkQbhnWD3j8M477zMcdJlGDv3BTxCs/Um0
+ iojDy7jqLcbjywwGPsLPuwMb1ZzP+pkU8VI0HlIqlEwVS1mInI4PoLWtn50XU39FEbYgATP8XLP35Fl/
+ luUnzPqzgjTu0XrPWooynMpH62mdPXPfc/FcgVIdJtOElUHA1avXcD0Xmaa4rofnBwhCpNbcuHGDILib
+ dRe6Hn4w4uEX/33e+8aXcb1sVyLX2s1rO7bd02ilEEIV5Vw2ARYki98efN57p/gIC9P/iGArz2vgvRfW
+ t7C5HXQLYP1W8Otasm2sb0tzdlPXziEbCShTSRimoLuE0RSpUrRWhHFKkiiiWBIMA9I0xfM6SCWZTCag
+ FePJJNsWzHFwXQfP8/F8n6c+9QR7+xGDfoDqKHCdSr7W8lvvFRuJapRKi+cwzwk4Z99hayZLMeRUtge3
+ ed/LMeNAcwupMhjtH1CV9YucqkGPyvq1O0c1+VucmeX/lfKfHutXn0Q1nNKKMEzZO4h48if+E6KD69y9
+ 8QbhwVWI7qCVxHN9RltbuK7Djz54mzRNGQ5HaKeXDSJKZxOBoihBa0WcxIwnCXGcrR9orbOtLpV6FfsI
+ ZAogTlQxqKhXiyyM3zlrjqEPuf9jL6czDqDyQeRML4oPvWn+lYf3zPrNdO+f9Wv3DjX5j8v6eRr3xfp1
+ Jdisi0oVUZyyuzfl+l1Fr/cI6489TRAE2VoABx9z/YNv8N0f7gCC177+j/nU0y/y7Es/z0HocvPuHr7n
+ ZaCPE9I0JU1THMchjiVStqyhYD02zovuP4rlywThJMRzXIBicwNBFfRt7K+N+7oWdqkIDDmF3YHNazNl
+ ULT7ZypaVyNaV4axsb55v3rPyNVI/35Z35KfeaUV/EdlfXv6zbK3pGGLZ+StlCKOUw7GMa+//hpB4BN0
+ OnR8n8FgQH+wQv/8l9A/+EdMpwmf/dyX+PyXfp7HnniRndvX+O4/+Ic8+sTT9Acj+oPMWSulptPplKXQ
+ 1gVS68dmuQrwuyA8tOMhgDu3x/idoIjoUgV/PVET4LZj270fezmlRUGr0zp1ZVIAs3C6Hq92boD/Dzfr
+ H5amJQ0rs9efy9wULPnWy5yFTGVmBVz/+Erm4HNdfN/H97OJQEHQYXXzPI9unGVtY4twOuW1117l8cce
+ 4ntf/0dcu/wo65vnWVnd/v/be/No2a76vvOz9xlrvPPwZr2neUKIwWCQ9ADZBjz0crq9ArFst0k3lpNO
+ YscYZwXhtbKyLLo72I693B0bMIG2jQ3dxCTGkMTGIxgxGIEQCKQn6c3TnW/dms64+49zqupU1Tl16456
+ 0qvvWlV1hn323ufU+f6+vz0zPjlHeeIAhmHGqwEJZPdc4OnPo/2TJL8EqSGEzsaGQ63mUsoXAWXQ/a5m
+ PYws8vcaibTrrkvs7XwA0VZCfFXfC5lNjh4VTVQobln1M8m/16qflreeOPZB9ZPHlVJRRWAQks/l8X0P
+ z3NxHCeqkI179hmGxeJSBV0/HVX46RpHjxxkekJhiYs465epr0gWzlnk8mM0Fr/IbNHE0LUelm3yPIQA
+ ZDQwSeoIYdKohZz6zhXGJgoQjSPx2Vzhh91up5zYv269gn1aGKRro3u/i1zJ391W/c7x9PEAqZkerPqk
+ GbSsOFPi2IHq9+WjN46M5y6EQMafsfFJNC0aERgGHq7r4nkejuOiFHh+SKNRRamAMFT4nsf8bInpyWje
+ fyEESikMI6BknWasnMM0k8uBZak+icq+SPUROkIarK66nH1ukeLkIfKFJl5doWtGcGg2p11caGT1B9iu
+ Idhs/yWPvW8GpPdpDvNs91L1N4+HrHDJIy9YRd+wqp8ehwA0TWAYGvWlJ9hwcmhGDrswhmUXKdpFymOS
+ 5779efLFcSambgClaDSqIGBiLMeBuRJjJRtDF9GKQUJgWRqFvEnO1pEy495Ub04kSB2kjgp1zp9ZZ3lh
+ GduG8vgctn4VPI+cnWvcfdNY7uJCo94T6aAmwCzypz2g69YQ7EszYL9q9210h1MMJv+uqH5/PN2bWeTf
+ DdVPj78/Txlx9F3fm3ZKHPEhIcAwNIoFE3/5CepXa1RqIV5goKSN0GykMKmuXuDGEyeQVg1RuJHZ2XlM
+ w8S2dAp5g4kxi1zOQKlolmFNiqhDkRFNFDrwmbTUX2ogDVwHnj+1QL22RrEAhWKBQrGEra8TBgbFcpmp
+ MTNHNC/AMDX/vcfTCD7II8i67iWHfTIAid82C5LHU/bb781g0u6q6vfFn0yjdW6bqp+aj8T+QNXv1f2t
+ qX4niWgsgGXplEsWTcdjetbE2nBoOk2azQ1qdZeNmsfrH/wZThw/zMKTv8va2irr/isRIsQPgqh7rooG
+ /eiaQNNaHYNILAeepvotVomowk9E5P/uUwv4zhoT4zpWziZfzFEaH0PzF/HcgPLYeK5Y0ErASuqj6Scu
+ bN876DUSvXG9pIzBPkwL3iF0f005JAnfuo52qKwXPYX4XcH3WfVTkunK566pfkocg1S/HaRzTpMSy5SU
+ SxZSCMpFE8cJcFyfesNlZa1BveZz0x2voTw2hh78KKX1Rc6de5yFq7egjBNIPYfjOoShi6YFmEY0v4Bp
+ aqCBltYI0DokIOrtpwOSZ59ewm2uMjtjY1kmhUKOfMHGtm2CWoidN5icnC6XC8YB4FwiqiyCt1LPInIW
+ +QcRP3k3GXf34sT+NAP2PS7Vf77L5e8xFFtU/c4lu636m8WZEseeqH5v2oNVP3lQyqgIIBEYmqBYMAiD
+ eKbgmouuSZx8yNWFK6ysLCGNW9DKR5idh4uXF7nhrv+RuYNH0NQaXvUMoXMFN1xBOev4QZ2cpSN0rTMY
+ qJ2VFtdavX0ktapHrbrO/KxFLm9RKNrYtoVh6ggCICSX05iZnZt62Z23PvB937P27c99ZaFGPwkHGYQs
+ DDIEWUWBtLAvauzPwiBdSp34qGTA1FgGqH7/+Va69IbL6LK7fdXvTbs/7heyoq8Vd2ocKp5sTReYQsfQ
+ FYoQO9ARAup1E00FnDt3HsPQkVLDMEw0/Tj4TfJS4+qVc+i6iWHegFm8FcO0mShXufjt30KORUWCVmOg
+ 6klbQFQHIDUadRchAuxcjmIpRy5ntecTVEEFqU+ggnUm58Y5cdPNDxTyf/9honqAFgnTiL8ZYTcLn3Vu
+ WA/hRYX9qwPoJUSfE7Bd1e8cv7Yq+jKMTl+eMuLoS7c37eFVv3tTESqF74V4vk8Qr+IThgrfD/GDEF3X
+ cOoOzWaTMIxa3jRdQ9d01isVNE3D0A0M04h+DZ0Dr/4e1jcccrYeTxXWk4/WMxFRf3+BwPVCNA3snIVt
+ m2iJAUShcxW9eCfu+pfIF/IcPHLgDe951zve/V/++n2PsDlhNyN61nnoJ3ga2TfzEF402NeuwO0TibP9
+ qk5EEBEd33XVzzi3M9WP49iR6g8g7tCqP4j80XYQhnheQL3hkcvfiFNbo9mo4Ll1ao0Ga5Umed1gbm4W
+ x3EIlcR1XaobGwS+i3AjYwHR9GJSSnRdo9GoUau7uJ5NEIYoZE82WjyJuCKEwPNCNE1gGloX+VEQuItI
+ fxXNPkbgnmd6vkgYqH/21c88kn/2zOLv/qP/7YNPZT7IwdiKR7CZBzDM/jWNfZoRKP4oOgSLCd5zUYKA
+ 15jqp2U3mc9NyT+s6qfEMUj120EyDF7PPYdhSNOJZv+Zv/MhxpWP7yzj1JdwNq4wMbMI3hpPrwvGxiZ5
+ 8mt/jm0XeNm9r+Xq0hqu68crAvnxMmEBrusTBD6uG+AH3UuDZXpC8dyBAoXURDyNWGeSmDBo4G08hVF+
+ GYb1CrzK48wfKlAcy/3jQiH3j7/86ff8+68+cebD/+y9f3ie4Vz4Qee2agheMs2H+zQpaJou9byy7eHB
+ 6cOH+0igOvEk4+hNd9C5dOL3XLeZ6reDD0fAjBhS0u3N83ZUv/c6RRgoHCdgfb3J82cvY9s5bHscqzBP
+ ceKVjB0L8RsLfPWPP87ZtQ0Wzj3JAw/+A15+zz2cPXeBJ7/zLNOTk4DC9308L1oQ1NAN/LC10Gh62t15
+ j4oBKKK5BBP3Gm2FhH4Fr/J1NPsGzPH7CRqnKOQXyJ+Yolop/8uxcuFfPv5ff/nPFpc3Pvzmn/iN/8bW
+ KgKTrQU7NQQpN9hOY9D5Fxz7UARQKX9uL8EGqH5X8KTq98Sz66rfOk8KBuRjYNrdcQyn+hlxtI1lSrgB
+ BkkRLQ1Wa3gsfPc7WEY8GtC0MC2TfD6PnStw8NANTM4G3HPvqzl07FbWNpocOniQ3/voh7jzntcwf/Ao
+ di5HLheCUlg5G01GXYxFmgFvb3Y4J3UIwqgSsjeX0U9I6FVRwXcJ3UX0/AnMidvwq9+hWF6iND5Js8kP
+ TExVf+Br//WX/2J5pfoff+Chf/+Z/oe1KbGHCZ91PukFDDIK12TRYM+LAL2vgeh9BqkvcnyilwSpqt+z
+ P4RH0PYwMkm2Q9VPTTsljr50e9PeHdVPIgwUQaBw3YA1Z72dT6lpGLqObuhYpkUuN8nYeAnLsriysILv
+ X+Xld9/B1fNforbyJPnCOPnSLJOzNzBz4CaC4GVYhoaUDJgVWHXoEa8doMKWEU6p72l1JQ9CgvAKobeC
+ rJ9Ctw+h2yfwm2exDZ/coTLlydKD9rmFB/+///DTP/nOf/Wxz6xteGnjBtIIOoz6J0meFd9mcfdef00Y
+ g32pBOxXfYbwCnrObqr6g87thupH567Zir5NDVJvHhSzMzN4nofve7E77+N6HrVqHSnXUJcUUkqkFAgh
+ uf3WG5mftRkr6RhGA98/TXXhLM2Vx/jji5/m9hMGptFZILT/mXTzQREdUihCRc9Mwsl7CUEJVOgQOAuE
+ 7hJIAyktQqEhCLFyeWYOTzK3vPRL//MPH7nwm3/0/Df6H2BXjlo1kmkPbVBLAinnB5E97dw1g72fEajr
+ xUwor2hZfZXwCpLnaW9vTfXTz7VJc0304x+UdkYcqj+GbPL3GtvOppTE/fYljUBQKI6jaQIpogpC3/fw
+ fI9GvYFu5nGbNZrNBkHgEoYhc1MFZmcLFPIGmpSEocLQBYW8RrlsYdt6VL+36TMR0WjCUMVTiAW0eZL6
+ H6nE7Ybg+4TCAc1AKQspJLl8kVKxdMfspPm/Av88EcGwzYaDvIAsbNcQXBPewL7UAXTebdV+WfvvuJcE
+ GWq7K6rfc93Q5B+WgKkxpKSbnuf0JLZm8NKjUwgEui7J5XTqC5/mu8s6PkXswgTF8hzFsSlMQ+eZr3+G
+ fC7HwRtfw4GDR3CdOrquUypZTE/kmBjPYcVrA7YWCMnZOpYpO016mzxzqUkCFc0AHA0qGvQ8Ettha9FW
+ BSEINFToomk+umFoui7ewtaJDIPL6WkEHkT+rXgEL5iHsE9dgVXPi5w4l1T9xKX7o/pdiaXknx26/Pup
+ +mn56t8R8VoAxYJJvVZh3KqzWnFYXwtYPKNwPYXrC6Ym5zk0VyLf/ArrV2uMz98RD/oBTZPYpkYhb8R9
+ AQS6FnkVmi6jHgApyt/9tkf8UWFrCrHIzc98VmmbKkAoUMpHhD5K+a1qhqlEUlvpNjyMkUgLu1NDkNzf
+ VyOw98uDd5X1k+5+T7jWTir5t6b6rbT6yb1/qt9N3UFGZ5dVv2+3O5ymgW1pjJdtlFKYlsb4eDQysNbw
+ qFQcVteafP+PvJMjhw9w9ckPsbLyTc6d3sC59QhBOIsUBs2mBwJsU8MwohFAIl5ePP1ptDZU+7WPmv+S
+ x9OEsHdcRvp9Rc80KSr0rFHe5+oPQhY5k9ubNSOmbaflJy1/vXnZM+xTMyD030ePF9DFxyFUbk9UP45h
+ R6o/gLgDDVJ33Kr/4BZVPyVtouG6hiGjMrwmKOTNuPIvoFbzWFqtk7MMCuUZmr6JnH0rE1NN/LOPc/rc
+ RY7c8T9w6MgktuEQNBdxa8/TbCzhOg0KeQPL1BC6jGf27SE+oqsDmJCCEEUYRDMOCaFS89y5vnU03hZA
+ GCJkTP7WZKSqfba1l6W0WaTrDTtsn4HNMGwRg0S4PfUK9q0jUNd2l6FOkF+pzp87SOUGqn72+eFVf9i0
+ M+LYNO39VP3u/WgMv0Ta0axA+ZxO4Cv8IKSaixfgCSUXLl7ENA1cDzStiBy7m42aQ748RT0oExg59MIx
+ 9PxdCL9CQV5l9cp/RwgTqQlk29dLM3qxMZKiewW4jPsr3/RegsZZ/MZZ/PoZ/MaZOIhKVBaHvfctEr+D
+ PIHteAS96QzjCaQRejMPIS2uXcU+TAnWr/TtbehXWxUfTJ0WvOuCThypxO+5bmjyZ8SxbdVPz3N6EsMa
+ na2pfta5aCYfiWYodF0QBDqWpWFbGhcuXEDXNYIgRNM0dMPE0D0cx2GjUsEwzHgWYRNNt5i97Y2cOfUn
+ mIaMFgjV4vQ2MXpKtboOh0DKakJKIY0JpDGBUX55fDCMDcFpguYFQucSKL/3OW1VnZMZ3ezaYT2BzeLq
+ NQppRN/TloN98gAgWRHYpfqt/fSLuq9POb7Tir4XVPXbQYY1OttT/a7npRR+EODHS4AFcd99paDe9Gg0
+ fcIQpC5x3WjJMNd1Ec0mrVmDNU2ixesC6no0XPim48fYqDqUSxYFFYKSGXlJQ0u9FcM9d4meP4GeP9E+
+ svHcv+19n7ZrALbjcm9mENK8gKzr0+JOy9euFA32vhIwMvOdg12DgVrHWhf0RtDavDZVv5u6g4zOdlS/
+ 97rdUf1QhXhuNBpw6vAPUVk+Q61yFae5Qq3m0Kh7SCWYm5vFdV003cYPAq5efJ5CaaK9LJjneTjNzlTi
+ jtOk4fj4fkAYZOVHJZ6L6H41+u5xOxwMkzqzXQOw1UQ3qyzc7NosZU8romS1KCSPbQl7XwmYofrt1oCB
+ BNwL1Y9j2FT10+Lsy0F6HAOVuRN3ahybGsNBcW9uCAJf0XQC1ioOs+OvZWbytRyQIQIP36tRXb1IbeV5
+ vvRcnfHxcT73J/8Bp1Hldfe/lUI5R6i0eF0BH9+PRgWGYYiQksAPCVOXBmvti8TrnqgjiMnbLgKkVfht
+ gpQWpr0sAmwnvjQy9x5rHSclDHRfm9xPht0S9m1loO7jPafTrsnoDdZ+aTKJMKzqZ+SrL+2MOPqu7017
+ l1W/b3dY8qvun1DhuD6VDYdnnj2NaVpYloVpmlhmEbN0O5Pjt+F89bf54ldOUTAlb37LT/Da+9/KufNn
+ +PoTzzIzPYVpmdGQYD/AD3wMw4jiV2pAXlr7qtXrJ/qoaEARPdeqgf9lb7R9705aH4BhsNVr0gzGIM9g
+ K8jyKHbNI9j7KcHSCKOAzCaf+EIBfS9DK+K+axL7W1b9nnwNeG77MWFH+rmMyFJPZpMfIFQqWvDD8bhy
+ 6lRE/vaIQLNtEA4dfzk33/UG8vk8uXyJxeUKszMH+Px/fw+Hb7ibw8fvYHxyLlpSTDOxLCvqUjxoMFBi
+ v9VjoPvv3Lryd8XdXwm422qehmGa9tLCZOVtM4MyyBD0Htv0Ie55JWBbsWMCilSVS5C7j6TDdgQh43av
+ v4q+/nx1ECoVLRDqBTT9JtVqFRVG5Xhd1yNCm9EagZ5qUndCxFoNlOLl99xB6C2ycP5vWbr4RZQyyJXm
+ KE8cJWd62GY0s4/oHQyUKlg976zqFAEGT4aahWRFYldi1wKGNUStcL0kHvba5DWt7eS5PuzjugBp+0nV
+ 7w9zLVT0XUv9+LNPbm4MW080mpIvKovPH5jH81x8PyAIfBzHxfd9XNdlI1SE4VI837+G1CR33n4zczN5
+ xsYsbFMjDCEMVzH0dZ756tPcfvM4piGRoj/l/iOJQO3hwIrB9zkIrTjayCpLb9W12EoGdurmt5CVz0Ge
+ wGYeQup9730/gC5Vb5/t5CdT9dPIP5zKtV/3TVU/Lc7OyeFUPyMONSCOQQap79TOVV8lvgUgBZiGpFbd
+ IJcvYVla1HlHyLhyL8BxHITQcJwmjtPE96PKvumJPPNzeUoFE02L1gbUpCSfMxgrm9i2Hq8NmP7+Kjpd
+ PBTxe9KTx+57G5KvisiL6DzbQWTcrHPQZimlKfOga9Ncoq22EOxkOyuN/VwctPdAGvGjbdV3vj/MjlQf
+ eClX9HVf0Z22FGDokkLepLbwKb5zJaDh2ej2OIXSHGOT8xSKY3z5cx9henqaG+96E3PzB3CaTTRdJ2fr
+ jJUspiZy7dl/hVAYusS29fakIGloV+10vjoZUyFKpXQEGtoAqJ5nPlQl4E4qCbdybZbRGJawWyF8UvXT
+ 0u+6j32cFTh5pEWi7mPtvRd1P/6MOLak+ilpb3Yu1Y70GzwhBaapUS4a1Bsuc16DysYaTecCG5e/wdXn
+ PSpVh5tufzN33X0366c/y3L1bmaO3osmBaHqTPppGBJdi0YDGrqMZvfVk8uDpd16vBFPCqqIRgP2jxLt
+ 5HkYdDUDxrc69MXdWX0hmg+ziJxVB9BL8iyPgUS41HP70BEo2ulsxq9mT1ff3vOdSBLbQ6l+ynWpcWfE
+ sWnaGXGo/hiyyb8bqt+br95Q6WlLKcjZOmFoAVDKG9SbPp4X0Gj6rG84LCzVeO0Db+HwkWNc0hZYW77M
+ ueef4M47bsacfJDJeRNdXaFeX0JKD8vSAA1dF0gl+/PS/uq8xwKZeEdaG4mBAdvoCNR5/gq2R8adqPtu
+ NDluZkSyjMGg4kLvflce96EfgKJdzu8erhlvtV5UtQvkH5aAqTGkpMuAPPUmMazHsZ+q33+dJgUYURFA
+ 1wSlgonnhwRBSK3uUVhrEIQKL4CrV5dwC68gl1PMnPs8j3/jSSbnbiY/f5xyqYCUArwVGivfwG+cot5Y
+ I5+L5wiIKxrT70PRXiG4i7TxO7pl8kM0n0CX7rSGAw/qcLMZ2TcLk+jMkHo8K/ywx5PYzDikhUt6Cqkv
+ 1L4uDBLlrPOHp6t+O2+d7dRHo3ouHZaA3XHsVPUz4xhkkPpO7a3q98ajCYEwJLpmtqfkUgps2yVUirVK
+ k6tXFzGMdVzXQdM0wtxt4LjkcjlWVteo1hpRk6FuoNmv5eiJN/PsV385Ir8mMIW2yX0ljySa8Aa+CwPQ
+ 1wFpU7KkKedWkXXtVsk6SLG3c31auNZv14PapwlBkmkOIndPuD1U/W7iDiLZLqt+3+7eq373BardQpMk
+ PyIqHkTzBeosLS1Hc/bFff1lvAR4vV5nfb0SLwumo+s6um5w6PAh97c2SgAAIABJREFUKhsu+ZxBztJB
+ T8tDQuFFssIvJn7YO5Hv8J5AdAthYi+TEGnl62ET2mkz4k6MzTBx9Kp/0kPpGy8N++UBpAifSG3+S+wP
+ Iv+OVH8AcVMNUn/Wdkf1U9LODDgE+YdKOyK+70cdgRwnwPHDaP0/pXDcgErVodn0mDo8hed5hGEY/QYB
+ gR/gOtGcAUJEy4IJKTB0A6fZpFr38LwgnuQzIw9x3Y9A0u7q2y7+7YRf8fvduXyrHsBW3PC97E8A3cQd
+ VBG4WSVhi/ip5Id9WRosmZ/EuXaWUwiYauOujwk7hjWGvc17g8nf2Q6VwvUCNmoud77xg9Qrl1m9+hSV
+ pWdouufQ5TK65jI2VkaFiqZTp1pZo7KxyMzBm+OZg6MRga1f13Xb04oHQXIeCFLzAICQiVegFT7luqF5
+ 1vfibGYAej2A3rcujeS9YffKEGzHU+i1oEniZ+ZxX3oCqsR2NkE3Uf04yGB13I7qw84r+nZD9TPODVL9
+ 9uaw9xYtDNJ0fFbXm3znu09TKOTJT97L4QOvxTRMLMtg9eop/vgzf4mhWXzuv/wmd77stfzE//IuTj13
+ muWVGoVCHoAgCNrrAxqGEfcMbBmArPy19pMVflkGYAvcSnqULSejg80qAgeFSUOWIdhOsWKYdHqRZSBa
+ eQriz6Z52NMigKCrYafnbJb69oZjCJd/j1S/HWRYo7PXqj8o7Z79jGfih4qm61OtuqyfPo1pmhi6gWmZ
+ mKaBYZgUCgVstcSVCwv8yI/9DK/+3gfRrTFO3HCcv/zLD3PTzbczMTmJbdvIuLLPNM14INBmhjE+JmT7
+ SOdc2BM25RYHQYUo2pWPu6XQg0i9GUEHGZxhkEX0tObDJPEzXf5e7GklYHtc+CCFTe0qHIXbqer3eR99
+ Gcw6l0wiy+j0Xnftqn4ylFIhvhfScHwWLlyMp/uKBwHpJoahY1kmB268n+N32OiGzuWrqyhWOXJohrNP
+ fZorz/8V5YljTM4eZ2ruGIV8merGcXS9tYpQWh5632XRDhJVSmb1BBwWYc9/ldkTLknMLIINyngv0toy
+ t6rcwyLLywjoJv/Q2Kf5ALL2s6+9LvvxpxzemuqnnU/aOYWK3fQgCCiPlXFdlyAIqLs1fL/SrtzTdA1d
+ iwxDa2mwA3PjzM8WKOR1hLxEY+k8T5/1CChx5qnP8T136eia7HnD056vivoBiNb5LCO4VbHsMwA7JVwy
+ nkEJi03C7lbRoNfYhIAff4ZW/ST2tAjQ2RpEwN7rOs1S2eS/BlW/b3eL5E/Nzu6ofjJ+IaLlwaQUTIyX
+ UUiUUu3yfDQ60KfZqON5Hs2mQxgGQLR02OxMnumJHJapE4Qhvh+iSYFlrVAsFDANGXU2yrjPzn/b6grc
+ Ctd6n9PudRjE13cuG8YFH9ZF325dwWbYbpEgSfwW+beFfeoK3HO8vd39QnfPALN1VXgpTNjR2R2S/EOo
+ fvKoEPHKPpbO5ef+llCfRzNzWFaOfL5IPmcjpGB96TQTUwcwzCIhGp7nkbOLTJRtZqfylEsmQgh8P0QA
+ pikpFkxsK2M0oAIlEnLcZyPidzu+n2wjnoF2UbL94m1Wo8+A82ll7N3sV7CVIkgSisjN9+LPUBV9g7CP
+ 6wKojNvtJX7vda3NYVW/57rNVL8dJIOo+676g9Lu2R9S9ZNHtdbSYHmDavUpLl38MqtrIV5ooFvj2KV5
+ wiCkvrFCffUMthFw4KaTFMZnovoCXWLbGqViRPYwiMRH0wSmoWHoomc+gN5sJoW0td9qw4/eky2TP75K
+ 0DWjwE5d/1Ycw2ai1wjsJJ20dJPE98iW2C1hD4sAyTH9naP94UiZJSixv23Vp0/9UhMfFMemypsSWerJ
+ XVZ92Bb5Iap8tyyNcsnC9QIQIcWSQ63uUW9cobJ4lkYz4E0/+m+46cabuPjVX2dp6Qkc5w7C8FZq9QDX
+ UXhuiKmH6LpE1ySaJtqf1qpAmXY9yklPFrdP/oyHsBsGoIXdbt7rjbd3P2lEFJGb78afHat+Evs3H0Df
+ C5lC8C4XTqSQoDuO4VQ/Iw41II5NlXdQ3C+k6vee749HkwLL0CiXDKTMUywYNB2fZtOnWvdYXmuyvNJg
+ fHyMZrPB+I3/gNz6M5x+7jGWl1/G7I0/ztjEBr53lvWNRUwjwDQDbEtiCQ3ZmhSw61ZTVF8IosVAk8qf
+ 9rJsRYC7rt8NA9Cr5oPUfadNfmkI6BDfY5sVfYOwD5OCQu8f2v2OZynsoPt8sVX0pat+Xz72SPW7PAAh
+ 0A1BTkQ19oW8ge+HeH7ARtXDNDSEgqWlFSqVDYqlMbTx7+XwTdOcOXeF2YM3UpiYoVAsYpg2tYWv0lh+
+ nKB+njBskrN10MXAikAgWhi0fUuJ+QAG/XcDkTQAURJbjCAN2ymr70ZLgCIivBN//CGu2Rb2eU7ARPOe
+ yCCxgnYzUWpsA0g2lOoPIv+wqp+S9mbnUu3IVtLuv59hVb93XwBSExhE7ntgKlSoo0mB5wVsVB0WFhaQ
+ UpLLrcUThZbRZEBlo0rTcTEMPZ5EdBZz+ke54dg8p77wzxFCkJcSrW9WoMRzEN3HOp0Bt6P8idDdl2zX
+ AAzq8DNMj8Jh4ss6r4hUvklEfJc9UP0k9m1psG5eZynisKrfG3YI5VD9MXTnY7dVvzdfvaGy0u7Z37bq
+ p+dNKUUQRgOCPE/hhwGoqGmwNYhHCkk+n8fzPKrVKgiBIOrgYxgGmqahaTqGocVrBOocPjTL2oaDZevY
+ 8QQhfflokz9NUJPHtvG+9z/H7VbIDbqm1wgMc82w6SkiwrfI36ro21Psy+KgA4nb/sm+11FFX0Y8meTP
+ zluoFJ4XUG/65Ip3UV+7SLNZIQw9PNdno+pSa3gcuGkaASwsXMVzXer1KpZdxHGc9n8rZDSRqJSSZqNB
+ reHheT5haHSn3Uq+p29H5+3YvvL3Xqc6z3Q3KwFb2IknkBWXInLxm0CDTkXfvmAfJwXt/ZOHUd/rc8KO
+ nVb0ZZ9rDQYKWK84HH/dz3FYh9rqArXKWdavfhcWnqPpnMGprRCGggvPfo18ocTRG25EmmP4gcLzvPZI
+ wNYnDAJcN4hHA/bea0peUot4uyp4WQnspIdgGvkHdf3dDCGR2jeIDMC+qH4SL9y6AO2XJOt+r8WKvhen
+ 6icRJJYG+8bjXyWXz1PIF8nljzN/210cvSfHHfUVPvUH7+fy1VWWLj3Hy191Pz/2tp/iq195jFPPX2Js
+ bBxNlwTxegJBEGKaJmF7gpEQVEoRIG2/63/cqWj33XOyTLEToqbFl+YBJMNlGYtWeJeI+HUiI7CnZf0s
+ 7FMrQPto50dk36vqehmyVL/3XPLQi3fCjswcbLGiLzUeRXtCkHrDY+n0WXRdj0YCGka8PqCFncsxOXsD
+ dmmOB3/w7Rw8fIIz5y5w5PAx/uD/+SDHb7yV+UMnKJcnMfNFVBhi5/JRF+MuSqT9x4OedxqG5URfvIM8
+ gJ1gJ3EoIvfeAWpEBmBHXXl3iv1fHPS6mbCjK1OD49zlir6+eBLPLQw7MwKtra9HsiiiUXy6HlXumaZJ
+ oXyC2dkcDU/wzLNnEITcc/cdVBa/xtMb3+bM0xPkSwcYmzhAaXyeQ/OT0bTgMpomfHjVH/w+bA8K+tU/
+ K+Be1BVkpeUREb9O5PK/IKqfxL60ArTrfrpmAup9dXtd/iyCbIf8u6H6GecGqX57c5Dh2S75h1f9rLAH
+ 5g8SBB6O4+C6Dr4f4HkNavU6GxtVlFLRJJ9SIjXJbbfcyPxMgbGyiWm4+MEZmivPUl+2+G8LX+Le2w10
+ XXbPCZDMW+uwGIZ32+dFfOWgZoa0S3ZSN7AZQiK1rxKRv9Wp5wXH3hcBhARao0BktK+6J34Yrm0/44VQ
+ /X5DtvJeR6qfkQcpo8FAhiEJ3AqaVaKcK6AJgSJEhSGe57N49Tx2roxC4DhNAschCAOmJ3PMz0Q9CEHh
+ BwopIJ/zKBejNQM7C4P057vvSGr2N7+/IZBF6L0mexocYJ2I/LvalXen2AcPQIDQ4t9oXHm0Hf2qqIWZ
+ wSTbZZf/OlZ9IUDXJTlL59K5P2Vpw8Qnh26WyRUmyOVLFArjXHz+7zl89GYK5VnGpqfxgwBd0ykWDCYn
+ bMbLJqautfsO6JqgkNfb6wzu0H3PvL9Nr+5cspN2+t7wvUZjK/EpItJve8z+XmJ/OgIJHUIVkV7qJJeC
+ FkIiWgNDVFxRq6C7mbQH8Quu+g8OobwZx/v2N3Fju45uJe0M0gK7VdE3KKwUAtuUlIsmtfoGnlenUnGp
+ VwLWL0scT+AHOgeOvoK8rVE//2eoA6+jPHs7mqYhhEKTYJsahbwRsUBEowENPR4U1DsccGj03/8O2TJM
+ 2X+YokFavMNmTQI5YIyod1SDa8gL2DMD8OM/9wfrH/vNh377S3/37X8yPTPO5NQG42PFiOwijL0BAVID
+ qSOUQggZPXEhUYkRZe2Nnah+3+5uuPz7ofqb5a03+sF5kBIsU2O8bAGKUtGgVvdoNn1qDY/VNYfFlQqv
+ ev2PcPToUS5/y+fqyjLL5x/Hv/tmmt4kXmDTdEKk9DENGU0FJqJhwHJT8qvEVtLA93Iy014OiDYZVx/B
+ WyeHyWBvmKyOP8N6AhaRITCBDaKKQJfh727PsKcewEM/97F/+rHfeOj3lxbWTwJvEEK8eWZ2nKmZMSan
+ CkyMLyGkjZDROnFC6FFxQRjxGvZBXGEU9yoUrbkDWs980Fpy14jLfw2ofvK8JiWGAQUBmmZTKpq4boDn
+ hVRqLoV8I2rO0wRLy4vYR36Y+bHTnH/6Mc6eu8DRe97BwYNjCPcsXv0svreM9CpYepOcLbGEiP7Cvo4+
+ PVzJvO9e8m/JApAwppvVAaRdnFVsSJI/GWYrnoBBxDdJZ0affevxl4U9LwI89PMfewx4DPg/PvYbD2lX
+ r6zcv3B19SRwUkr5xtm5caZmykxMFBgf3yDyJ632bLNKBaiwU4QSsWoo4mKEgqhIkVFk2HXVT4TdlHh7
+ rPrbykPkBei6JCd0TEMR2DphqLBMDaUU1ZrLpcuX45V/DHTTpnjwe7h46Qqlcpm6q2Hbd2GOvRrLsvGq
+ ZzCDZ6kufw4A29aQfVwaeCtdJ7dO/kz0Kn8vgQcp+E47DWXFmafTAeilbwCSeOjnPxYAfx1/+NhvPGRe
+ vrT8hiuXV04qpd5gGPrrZufGmZouMTlVoFS0I29ANxFooAKU8iH0AB/CaEILkPE/FRuC1F5I+6j6sAPy
+ 75Lqp+YhTl2peP6/ED9QbRpIDUwjWuZ7bXUNiJQ8mjnYRNcknr9KpVLBMKJpxKMRgSYvv+d/4tunPxNf
+ L+OxQGnpZ3EqysQukr+FrLL+Zt7BoPC9HsEgQ5KG3TYs28a+GoBePPTzH3OBP4s//N6v/cPSxYvLD1y4
+ sPRGIcSbLEu/d2Z2nMmpItMzJfJ5Eyl0kHZUnR0qQuWAciOjoOJh00rFy4/Hn62QbU9Vv/f8Xql+dlxB
+ GBG/0fBRzNFsbOB6VVTo4QUhlQ2XpuMxcWAc1/UIAhWv/uPR8FvLgoGUWjwqUEPXNW675WaqdY9S0SSf
+ 0/vz1zfEW6V/p+T9Pz62wqy1yFzB58BEicOzR7OeTPJ7ENmTxIV+Eg8yBIOwmUEI6e4E9ILjBTUAvfip
+ d/2/G8Bn3vezhz/7nt+5oH7v1942deHcwsnzZxfuF0L8UC5n3jw9M8bMbJmJyQK5nIkQOkKzo7qDMCAM
+ GxC6EDpRn/S26rS8gtb/M9wiFPs9YUdmRrqi30oeuvfDEJrNgLUNhzte9zDKb+LUF6lXLrK2fAYllmnW
+ z2EXykxOWpw7/RQblXWECJmcPd5eGqz16zouSoDruTSa0QCh4VYG6s5vFvkBasEkz9cnea4GLADfDZkx
+ zjOXrzI/ZnBkZi7tcaVV/G2V8GmE3q7qe0QdgdbptAS84LimDEAL7/mdCwrgp971iWXgj9/3s4c/BfzC
+ kZvvmz/fcO47f3bhBxDiTfm8eWJmdpyZuTLj4za2ZSGEAYaNREMpDxW6qLCJChJzK6gQ2ivItMjf/ZJu
+ yeXPcFm3rvoD4tmy6qfsKwiCkKbrs77hsFyzsO0xzMljTB+4j3JjBalcbq1c5LN/8WVqtTpf/pv/xOvu
+ fwuvef2DVJuwuLSK1CRhqOIpxKM1AjVN4vshQRh1N+6/763eX9Jrif8p1fpILgbHuNAAtQTqWfiZA6lm
+ M434rf3NxgpsleBZUESqv0FE/iZRhdY1gWvSAPSiZRDg45ff97OHPwn8J4DDt9x3sHbm6skzZxbeApws
+ Fu0js3NjTM+UGB/PYZpW5CHoEwhDi4yBclBBE9UqMrReUtGZmXb3XP5Bqt+7vxOXfwgjkuCk7wfUGx5P
+ PvmNaACQZWHbNrlcnlw+Ty53A5bxGKGl8X1v/Yfc+6r7OHHLy1hauMgXH/sSt9z+MoolG0HUOhMGAZZp
+ dSc/RJ7aj6f9ld6DMIgWLyZsGQCSxiA63h0hsLkH0Ls/DOHTwgy6ziVS/bX495rpAtzCi8IAJBEbAwXw
+ vp/9/EXgD4E/fM/vXFS//+s/fry60XzT889e/QHgZLmcm5ubH2dqqsDYuB0bBBNh5BDSiA1BExU4qLAZ
+ vU2iNb10/HZ1eXz75/IPRfzUPPSrfvJIGIYEgcJ1A1YvXUIIia7r6IbeGRFoWZSmjnOgWOTAwRuo16s8
+ +a0nOXHsCF//4ic4/8zfMjV7lOm540zPH6NUnqJQHIsWBRECmTUdWNr+IM8qhh8kyJ8gfbcBSI0ji/it
+ Y9up8Ou9kayyfgOoEJG/NervmsOLzgAk8Z7fudj1tvzkL/zhaeDDj/7soY8A6vCNr7+9Umk8eAreBJwc
+ m8hPHJgbZ3IqT7lsYxgmQloIvYAQZscg+A0Im1EfBNHyCmID0G5hyCAtbMHl31vV7yZ/95ZSimKxhO97
+ +H5As9GkXqsDcXdhw2R5dYPzF660lwk7duQQ0+MeBeMyzbUFzq08zvnvWhh2kUtPf5obprR4MFDWWIC+
+ TG1+D4DnR2d6Sd/nAWTGm9omuRn504xGb5i0Yx6Ru78a/7bKntckXtQGIAuP/M7FEODRh//uO8B3gP8b
+ UEdueeDu9dX6m4GTwP3T06Xy9GyZyckcY2M2mmZFBsEqIISBChqosIEKGhA6xK8hAKq9jFVrP/7egepD
+ i9e7q/pdfrGIOl7rmiQ3No1pSFQYEKoQp9nA9308z0NqJp7n02zW8X0PpRSu6zI/XWBqwiKX09tZMXUP
+ Xf8upWIR29LihUFS8thHm97nk8I1BV6QTvrkb49tzDYF8WNIXDFMBWEyXFqGWzloEJXz14h6+10zXX6z
+ 8JI0AC088oG2hxD//tE3gW8C7wf4vV97++sWlypvAu4TQrx5drbM1FSJyakcY+M2UhoILYcwygj0yCAE
+ 9ai4EDaiN601urFP9ffA5R/CXc5S/da+EApDl1imxvKZP6PqTaLbZfKlcUrlaYq2htQkT3zpM5h2nqM3
+ vRqlAur1KpqUTIxbHJgtUC6ZGLokCKK1AU1To1QwMA2J1OhLN438baOZxZH4fj0/nfRdBmDwU0lCJH5V
+ yvHNigbQbwx8Ind/Nf5tzfBzzeMlbQA2w0+96+NffPThQ48BzB5+mXY1CE9evbL+euCklOJNs3NlpqeL
+ TE7kKY/bCGki9CJCTiCEhvIbqLBG6NciD0ERVSaqENV6Rwb1UoyxG817/UHSw2tCYOgaxYLBRvXbeCsO
+ CxUXx1WEoY6vdITMQeBz9MgB1s+uUph/FXNzBzEMI1pWrGgwOWZjW60BXdEkIKYh2uMCsvPdof4g7ieN
+ necPVv++VsfhVXenRQNFpPRrdFR/z+bw3wtc1wYAkl7CRR/4i0cfPviXj3zg0r/9vV/7R+aVS2tvuHJ5
+ /QHgpKFr983MlSKDMJmLasGFidAK6MY0CIkKaii/Shi0DEL8ziTrEBJv/VCqDzty+XspITWBZUnGSiae
+ H2KaislxQdPxqTd9Nqp1NjZWuf+tv8CNx49y6vPvp7oMS+oBwjBu//dCwjCMOwNJpKC9LFi0lLhIyxSq
+ YxYHo+eZuMFg8od9dFPbUd+tthS0aviXidz+F43qJ3HdG4BePPKBSwrgp971R+6jDx/880c+cOnPHn34
+ oDx44+sKFy/6Jy9eXHsAeJNl6a+cmSkxNV1geipPoWCAsBFGGcOKOqaEfg0VbBB6NVAtgxAVFzo1B4Nc
+ /t1R/c7haPIO29RQBRMpoVw0cN0A1wup1l2WV5s444KjN95NrlTm+Pc8zNrSOc489zdcvnQQWXwNekHS
+ DNYINiroWhPL1DGMqFiRsZ7LYKHvO9BtwHqLAL3bfR6U2lEnm2FaA+pE7v4qkRF4Ual+EiMDMAAtY/DI
+ By6Fjz78xeojH7j0p48+fPCzgDp8y8mJCxdWT164sHof8EO5nHHr9HSRmZkik1M5craJkDbSmECzDkaO
+ gFch8KuEXgWh3E6Rgd6FVFMKtltS/bQA0Y4QAk2X5AWYhoUfRM2CnhdSqeqoEIK8wcLCImurq2jGDLKU
+ Z/aIzuLyBifu+iGmpyaQagP8VZS3ite8iO+eJwyXyVk6Im4OTMtVel6Th/u9lzQDoOgtAqjkVbtFxl6X
+ 3yWq2V+h06nnmujRt12MDMCQSBqD6MgfrQCfevThg//5kQ9cetdHf/VtB86fd+87f371+4Dvz+eN4zMz
+ JebmSoyNG1EvRZlDM6fQcochDFD+BqFfIQw24rEMCkTYHvoMxN7sIPJvrvq956UANIEho7H8KPDNED8I
+ sW0NpdmcO38O0zCQUmKaNoYxh2q65BAsLoVYloVhzKNbRzHy9zI7HnL+6/8GKUR7UpBM8qedyCA/dFoB
+ +tSf/jqAZOlql9Cr+it0OvW8KFU/iZEB2CFahuGnf/ETlx99+OAngU8+8oFL6iP/548dqdecB86eWf5B
+ 4L5i0To6NxcVGcbHo842QubRrFl0/Rgq9FHeOqG/QehVolGPBIDWqT9Q4eYu/xBFgiDuDOT7YXtKr9ZM
+ wa4XUDB0vIaH67gEQdAeESg1ia5r6JqBbugYuo4Rdx46ePBVrG+42JaGZWkpL1bsQXc51YqOmej1tjtb
+ //rWd3Kmditnazdzunorz1dva5O/fcvdTY+7ScxkWX+Nl4DqJzEyALuIljEAeMe/+uT5Rx8+8IePfODy
+ xwA++qtvP75Rdb7/2eeW3gScLJet+bm5MtPTecbLJoZpIbQCmj2HXjgBoUPgrhMGFZS3EY1rIJpxtzPI
+ KSZUu09CK/VMiY2XBgtpOj5ox6hVF/GcCp7vUW24rK07TM4bzM7O4vseQSij1X/CgEZtg6bno1QTpVS0
+ 0rCuI6WkcWeDesPH9cLOWIBkXnqr1kjWgKQrf+vchLnIhLHIveOfj+9B8nz1Np6v3sqZ2q08t3FrHHfb
+ gOxmH/41ItXf4CWi+kmMDMAe4pEPXG6/LD/9ix8/DXww/vDRX337rZXK4vefOhX1UpwYz03OzZeiTkll
+ E8OwkHoBwzgIhTwqaEaegb+O71cgjOudRIhS8cQoYvO6gzBQOG5Apepx+33/FN+LWi7Wls6wtnAawTPo
+ mouumxSLZb7wuT+i2WiyurLA/W9+CN2w8D2fMAzaowI9zyMIfZpuQBCqtEq5zPxk5bXLMPQUD6QIuan0
+ FDeVnkJIHaGZQAEVQhgESimcAYkMg1ZvvhUit/8lpfpJjAzAC4Sf/sWPP/3ozxx45pEPXv6/AD76q2+/
+ e3Wt8RaiXor3zUwXxmZmCky0DIJug15Eyx3G0IqEfpXQXyfw1gm9CtH7GYJIrs0XxmLYIU+oYgOw4XL+
+ ShXDsrDMA9gz8xyafTXH7vZRXpXvfubTLCyu8dTjf8XLX/la/sm/+DWeP32GpqchpCAMIgPQGg2oG0a0
+ NFjYWRR2eOK3zicrDtPJnw4BQhCGEtdzwiBQ1U0uyEJrae5WWf8lqfpJjAzAC4hHPtjlITwJPEncS/Gj
+ 73/79y4u1h6k3UuxyPRUnslJm7ExA03PI7QCRv4YUi8SepXIIPhrhG4FVECriKBaxgAVD+MNqTVcnjl1
+ CtM0MI14RGAuh2lZmLqF51QxdcWP/eS/4LY7X8HM/DGE0Pjd3/0gt9/1GsYmJsnlLKQUKAW2acWLiMSe
+ +JDk720r2BL5RUR8ITQQGoHScN1GGPisDvkXJHHdqH4SIwNwjeKn3/3x1lyKfOT9b9euXN04eeXqxv3A
+ SU2Tb5yZKTAznWdy0mSsZCGNAkLmMfM3IkoFAm8tanb0Vgm89XaxWKlozL7rhixeutQuxxtGq0LPwrJM
+ Zo68koOmQak0gRtaPP3MMxw7fIDT3/4sl577a3LFKcYnjzN3+BYmZ48QKrBNiSZFT2ef7PqI9KMJ8guI
+ 5tCM147oLdkLEfXOFAZCGHiOpFZdd+pucG4Lj/q6U/0kRgbgRYB3vPvjAfCX8YePvP9tuStXKvdduVI5
+ CTxo6PK1M7PF2CBYlIoGUishtAKmdTNoeUJvjdBbQ/hXCGkShJLxqbG2C+84Lo1GE9ggDEMMw0DTNVZW
+ q52a/vkZZqdNSkWBpq3hO4+z+Nw3WDqtc/brH+Q1L8th6FqnJ2AfVPfxvs0W+UXs1bfcCS3ivki6F5Hy
+ C2EgdBup2dRrsLRwsbq85n9ryEfrExG+VcN/zczUs18YGYAXId7x7k80gD+PP+/9yPvfVrx0qXLy0qXI
+ IFiW9oqZmSJTUzmmp6xoLkWtgNRL2MU7yE8dx157DnNiBk0TqDCI1wb049GAPqECz3NpNptsbGwA4Lke
+ 8zN5piZsCnkdIQRKRYOLbFOjXDKxTInWNx8AdDXzJSsJRZL8IiZ/3J1Y6FEln9BiN1/GUYiOYZAGUrNo
+ NgVra4Kzzz219M3nmt/Y5BG2VH+NiPzXleonMTIALwG8492fqAKfiT985P1vm7xwYf3khQvr9wE/nMvp
+ t0xPF5iZyZPPC1TDx9BcVp//Eza8CTR1SZlKAAAF4ElEQVR7hsnZo+i6hW0XkJrg1Le+THlyjplDR6hX
+ N2g06gghGCtbzM3kGS+Z6Lpoz/VpGRr5nIZlSkTX4iApih8vDqpU0H0itgFCiHiuRxMhTdAMUDpeIEBJ
+ TEtHCvBDjWZTo1GHlRXBV7/y5S9cXHIf//qpxpUBj6ul+q2y/nWn+kmMDMBLEO949ydWgE/Fn3d95N+9
+ bf78ufX7zp9b/37PC9+MDI8hBecvP8PlxSoSHV23mJm7gUJpEjdQLJ55nMnJAqtTJzh0833Mzs5iGAZ5
+ 22CsZDI5YWObGmEY9UGQknhpMJlYGqyH/MnOOkKkzpsikLHyGwjNwvUtlhckG1XpNBrhYqi0oFDIHxEC
+ 6breylpl49TFi1ef/du/+evvNl3P/dTfrH8l47EoIrK32vUrXKeqn8TIAFwHeMcvfeIK8Mn4o7/z7a+5
+ qZC33qyUeqsI5Ksc35uqNZqsrD1OqBQTpRxzU0XuOFHG0tdZXvgWyFejwhA7l8eyTHK2Rd6WRAOborK9
+ UIm+OKll/ZYViMrvvu8nWgxUfCou20uDEItLl0we//tvnvnmN7/5peVK8Fy9GVaCUPmOq5ymGzYrtaBa
+ bYROpRY6C6t+I+MRjFQ/AyMDcP0h/NDHv3zGMsTvO576z8DYPXccvOWGQxMPlArWK4Um7nKcsHxlucbK
+ 184wOWZTLi6zvHyZO2+eojx7N6XZGeyiiy6rKG8ZGXaPdGwPbAqhu+Ivsg5CswlDlyDw0TU65fp4+Xgh
+ NdBM1tcMnn7qGf/p7zz5xG99cuk3owBo8WcYBHRm6Wn14b8m1uS7VjAyANcfFOA5nqoRucD1J566tPLE
+ U5eeIFq80n7Ny4/ecvzI5H35nHmv5zh3r1f8omFW+dNP/jr33lECp4oszKDnDqCVb0Mpj9BZJnCXCb3V
+ aC6EUIHsNghRU55EMycIvXV8XyE1opp8GVf4SSNq2tMsNqomly8+q11Y9H4buED0vlqAHf/q8UfQPetK
+ QDQ+vzUPf4XrpF1/qxgZgOsPrV5BLh2i6ESqagD6l79x7sqXv3HuMU1iByHWg6+/6c4TRyZfK8KVe7/u
+ O/csL3mlQ4cbzE4vMj5moOkmmj6OXjiC1O5CBQ1CdyXqlOSsRhOsEk0HIrUcRuFGvNrzuG6AYWhIzUJo
+ BlJrlf1tpGbhugZOY0PcdcL66zifrTzaREtu20RGq5V/ReTuO0Sz89ToEH+k+ikYGYDrEy0yBPHHo+2D
+ tz9aEKIDxl/83bNX/wL+ishwOP/7L/3gyysb7gOndPm9QvCW2dkC01MrTI5bjJcNpG4hjTK6fRBZug2B
+ ThhUo0VbpI7vXEWFddbXHSbHLISeRxomQus06wWBpF6vEYbhufd+8KrTk98mkbJrdMjfMgCt+4n7Ro8w
+ CCMDcH2jtx6+NYFhCy2joCWOh//63332C8DfAOq3HrnfCIP5B65cqd0HnNQ08cbZmXxkECZMxso6CoXU
+ 8lGzX+ggpMHaukNlvcqhA+OE5JBGDk3TEVLih4rFq3UunjkFii8MyLvPNTrf/osFuzFscoSXNrLekT6X
+ +lfeOaeNzd5StAvT9wkhTyLkA5omXzMzk2d8zKJYNEBBveHx/Ol11pcWnpiaObg+NV2eKxWNY7qhbE36
+ OA3fOX/ufPPpb30tAN703g9dfWJvb/H6xcgAjLCr+JV3zrUq5Awgb1jFcmnq+ANSM14hhHaLUmHOc+ve
+ +tKFL6xvGH8FYd3UnOWc1dQnpuZvEVK7eWXxwjRRJd+H3/uhq8+8oDf0EsfIAIywp/iVd84ZRBV2ZaJK
+ OwlU3vuhq1fe/dAdAsDQXC1vbSg6tfzaez90dTsj+kYYYYQRRhhhhBFGGGGEEUYYYYQRRhhhhBFGGGGE
+ EUYYYYQRRhhhhBFGGGGEEUYYYYQRRhhhhBFGGGGEEUYYYYQRRhhhhBFGGGGEEUYYYYQRRhhhhBFGGGGE
+ EUYYYYQRRhhhhBFGGGGEEUYYYYQRRhhhhBFGGGGEEa4Z/P8GlX/ISWG3BgAAAABJRU5ErkJggigAAAAw
+ AAAAYAAAAAEAIAAAAAAAgCUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAARz87AW+NmgFx
+ zfEYds3ubXXM7sNzzPD1fcvq8IbE3MFxpblkAAAAHAAAABkAAAASAAAACQAAAAMAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHbO8Q9t
+ udZtXIqb0HGrw/hsxen/cs/v/3TX9f912/b/dc/x/5De8P+BvdTJAAAAOAAAADYAAAAwAAAAJAAAABQA
+ AAAHAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAfdHyBn/P711+
+ z++xe8/w63fQ8f+YtcH/tJ6U/4WSl/9Zcn//bcXe/3fe9/933vf/cc3x/3nc8P93zOb/dsnk/3O71NRe
+ ipqBAAAAOwAAAC8AAAAdAAAADAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhtHvWITR76uC
+ 0fDnftHy/33W9P992fX/ft33/37h+P9+udP/lcTY/7mkmf+xrq//dNHr/3je9/943vf/cc3x/2zX7/90
+ 2u//idjk/4XX5/+BvdTQAAAAQAAAAD8AAAA2AAAAJgAAABQAAAAGAAAAAQAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACM0+5Ii9Tvp4nT8OWH
+ 1PL+hdj0/4Tb9f+D3vf/g+P4/4Li+P+B4vj/gOL4/3/h+P92p7z/qpGD/4icqP9qrsz/c9Lt/3rf9/95
+ 3/f/cc3x/2LT7f+dxL///6Fj/53Q0P+Mzub/AAAAQAAAAEAAAAA/AAAAOQAAACsAAAAXAAAACAAAAAEA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJLV7j6V1/Glkdbx4pDW8v2O
+ 2vT/jN32/4rh9/+J5Pn/iOX5/4bk+f+F5Pn/hOP5/4Pj+P+C4/j/geL4/4Dh+P+hvsj/xsLA/66kn/+G
+ gH7/ccfh/3vf9/963/f/cc3x/13Q7P+bycb//7V//5vU1v+Nz+f/AAAAPwAAAD0AAAA7AAAAOQAAADQA
+ AAAlAAAADwAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAltfw1Jfc9f+b
+ 4Pj/kOL4/4/n+v+N5/r/jOf6/4vm+v+K5vn/ieX5/4jl+f+H5fn/huT5/4Xk+f+E4/n/g+P4/4Lh+P9y
+ rcX/nbC3/6Wgnv+my9z/d9Tw/3zg9/984Pf/cs3x/1vQ7P+V2eP/6u/p/5nk9P+Nz+f/AAAAOwAAADkA
+ AAA2AAAANAAAADEAAAAsAAAAGQAAAAYAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAnNv0/5jr+/+S4vz/kOj6/5Do+v+P6Pr/juj6/43n+v+M5/r/i+b5/4rm+f+I5fn/h+X5/4bk+f+F
+ 5Pn/hOP5/4Li+P+PsLr/wJ+S/4yYnv9RdYb/csrl/33g+P994Pf/c83x/1rP7P+Y4vP//v7+/5jk9P+O
+ 0Oj/AAAANgAAADQAAAAxAAAALgAAACwAAAApAAAAHwAAABEAAAAGAAAAAQAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAndz0/5vs+/+M3vz/kun7/5Lp+v+R6fr/kOj6/47o+v+N5/r/jOf6/4vm+v+K
+ 5vn/ieX5/4jl+f+H5Pn/huT5/4Tj+P94tM7/sc/a/7Gfl/+pqqr/d8/q/3/h+P9+4fj/c87x/1vQ7P+Z
+ 4vP//////5jj9P+O0ej/AAAAMQAAAC4AAAArAAAAKQAAACYAAAAiAAAAHwAAABgAAAAPAAAABwAAAAIA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAn931/5zs+/+M3vz/lOn7/5Pq+/+S6fv/ken6/5Do+v+P
+ 6Pr/juf6/43n+v+M5vr/iub5/4nm+f+I5fn/h+X5/4Xj+P94p7v/kpKS/4udpf9yu9n/edXx/4Di+P9/
+ 4fj/dM7x/13Q7f+Z4/P//////5nk9P+P0un/AAAALAAAACkAAAAlAAAAIwAAACAAAAAcAAAAGQAAABYA
+ AAASAAAADAAAAAYAAAACAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAod31/53s+/+N3vz/ler7/5Xq+/+U
+ 6vv/k+r7/5Lp+v+Q6fr/j+j6/47o+v+N5/r/jOf6/4vm+v+K5vn/ieX5/4fk+P+Rt8b/xcPA/6ihnf91
+ dHb/dcrk/4Hi+P+A4vj/dc7x/1/Q7f+b4/T//////5nk9P+P0+r/AAAAJQAAACIAAAAfAAAAHAAAABkA
+ AAAWAAAAEwAAABAAAAANAAAACwAAAAcAAAAEAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAo971/5/t/P+O
+ 3vz/l+v7/5fr+/+V6/v/lOr7/5Pq+/+S6fv/ken6/5Do+v+P6Pr/juf6/4zn+v+L5vr/iub5/4jk+P90
+ sMv/ob7G/6aclv+ozd3/ftj0/4Pj+P+C4vj/ds/x/2DS7f+c4/T//////5zl9P+Q1Or/AAAAHwAAABwA
+ AAAZAAAAFQAAABMAAAAQAAAADQAAAAsAAAAIAAAABgAAAAQAAAACAAAAAQAAAAAAAAAAAAAAAAAAAAAA
+ AAAApN71/6Dt/P+O3/z/mOv8/5js+/+X6/v/luv7/5Xq+/+U6vv/k+n7/5Hp+v+Q6fr/j+j6/47o+v+N
+ 5/r/jOf6/4rl+f+Vrbf/s5+V/5mkqf9XjaX/eNLt/4Tj+f+D4/j/d8/x/2PT7v+e5PT//////57m9P+Q
+ 1ev/AAAAGQAAABYAAAASAAAAEAAAAA0AAAALAAAACAAAAAYAAAAEAAAAAgAAAAEAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAApt/1/6Lu/P+P3/z/muz8/5rt/P+Z7Pv/l+z7/5br+/+V6/v/lOr7/5Pq+/+S
+ 6fr/ken6/5Do+v+P6Pr/jef6/4vm+v9/udH/qc/b/7Oek/+Rmp7/d9Dr/4bk+f+F5Pn/ec/y/2bU7v+X
+ 4vT/0fL6/5Xj9P+R1uz/AAAAEwAAABAAAAANAAAACgAAAAgAAAAGAAAABAAAAAIAAAABAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqN/1/6Pv/P+P3/z/m+38/5vt/P+a7fz/mez8/5js+/+X
+ 6/v/luv7/5Xq+/+T6vv/kun7/5Hp+v+Q6Pr/j+j6/47n+v+Er8H/qKek/4ugqP+Cz/D/gdv3/4fl+f+G
+ 5Pn/etDy/3DY7/+A2/L/ieHy/5fl9P+R1+z/AAAADQAAAAoAAAAIAAAABgAAAAQAAAACAAAAAQAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqeD1/6Tv/P+P3/z/ne38/53u/P+c
+ 7fz/m+38/5rs/P+Y7Pv/l+v7/5br+/+V6/v/lOr7/5Pq+/+S6fr/ken6/4/o+v+fu8X/yLKq/6yjnf9i
+ dH7/cMXh/4nl+f+L5vn/e9Dy/4bd8v+a5PT/mOL0/5je8P+O0+aaAAAACAAAAAYAAAAEAAAAAgAAAAEA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAq+H2/6Xw/f+P
+ 3/z/nu78/57u/P+d7vz/nO78/5vt/P+a7fz/mez7/5js+/+X6/v/luv7/5Tq+/+T6vv/kun7/5Hp+v92
+ u9X/qcrV/6Cemv+Ou87/fdTy/4rm+f+S6Pn/g9j0/3zQ8v+H2vT/lt3v/4vO4VwAAAAGAAAABAAAAAIA
+ AAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAArOH2/6fw/f+R3/z/oO/9/6Dv/P+f7/z/nu78/53u/P+c7fz/mu38/5ns/P+Y7Pv/l+v7/5br+/+V
+ 6vv/lOr7/5Pq+/+fvMX/yK6i/5Kor/9fp8b/fdTw/4zn+v+L5vr/jOb5/4vj+P9/0/L/lNzv/2aYpg0A
+ AAACAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAruL2/6jx/f+R4Pz/oe/9/6Hw/f+g7/3/n+/8/57u/P+d7vz/nO38/5vt/P+a
+ 7fz/mez7/5fr+/+W6/v/lev7/5Pp+/+Kwdn/n8jX/7aelP+BiY//c8jm/43n+v+M5/r/i+b6/5bp+v98
+ 0fL/lNzv/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr+L2/6ry/f+S4Pz/o/D9/6Pw/f+i8P3/oe/9/6Dv/P+f
+ 7/z/ne78/5zu/P+b7fz/mu38/5ns/P+Y7Pv/l+v7/5Lo+/+Lwtr/rK6t/5ehpf9rp8T/dc70/4/o+v+O
+ 6Pr/kej6/6Ts+/990fL/lN3w/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAseP2/6vy/f+S4fz/pPD9/6Tx/f+j
+ 8P3/ovD9/6Hw/f+g7/z/n+/8/57u/P+d7vz/nO38/5vt/P+a7Pz/mOz7/4fi/f+rt7n/tqCW/6OWjv+H
+ bmP/WX2P/5Dn+v+Q6Pr/k+n6/7Pv/P9/0vL/ld7x/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsuP2/6zz/v+S
+ 4fz/pfH9/6Xx/f+k8f3/o/H9/6Lw/f+h8P3/oO/9/5/v/P+e7/z/ne78/5zu/P+b7fz/l+r8/4yzvv+O
+ fnj/f3Js/5CHg//54dH/f2pk/4/k9/+R6fr/len6/8j0/f+A0vL/lt/y/wAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAs+P2/6zz/v+T4f3/p/H+/6fy/f+m8v3/pfH9/6Tx/f+j8P3/ovD9/6Hw/f+g7/z/n+/8/57u/P+b
+ 7Pz/hNDq/6SBb/9JOzr/TU5S/5CIhv/gx7L/aFdK/4/k9f+T6vv/nOv6/8/1/f+C0/L/luHz/wAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAteT2/670/v+T4f3/qPL+/6jz/v+n8v3/pvL9/6Xx/f+k8f3/o/H9/6Lw/f+h
+ 8P3/oO/9/5/v/P+b7Pz/hcvg/4RjWf8bLDX/fLLL/6ehm//WvKT/XlBI/5Hl9v+U6vv/ou38/8z0/f+D
+ 0/L/l+Lz/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAtuT2/6/0/v+U4v3/qPL+/6nz/v+o8/7/p/L+/6fy/f+m
+ 8v3/pfH9/6Tx/f+j8P3/ovD9/6Hv/f+f7vz/ldDg/8Kolv+BenX/eoWI/7Gciv/Ut6D/WlBL/5Tm9/+W
+ 6/v/o+38/9H2/v+F1PP/l+P0/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAt+X2/7D0/v+U4v3/qfP+/6r0/v+q
+ 8/7/qfP+/6jz/v+n8v3/pvL9/6Xx/f+k8f3/o/H9/6Lw/f+h8P3/l9zw/824o//eybj/z7ik/7ufiP/K
+ sJ3/Rj4//5bo+P+X7Pv/pe78/9n4/v+G1PP/mOT1/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAuOX3/7H0/v+V
+ 4v3/qvP+/6z0/v+r9P7/qvP+/6nz/v+o8/7/p/L+/6by/f+l8v3/pfH9/6Tx/f+j8P3/leb7/8ixnP/P
+ u6n/wq6c/8Gslv/Tu6n/OTU4/5fq+f+Z7Pz/sfH8/9n4/f+I1fP/meX2/wAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAueb3/7L0//+V4v3/qvT+/631/v+s9P7/q/T+/6r0/v+p8/7/qfP+/6jy/v+n8v3/pvL9/6Xx/f+k
+ 8f3/lOn+/8y2ov/ay73/y7us/868qP/gy7r/Ozs+/5nq+v+b7fz/tfH9/9f4/f+K1fP/meb2/wAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAuub3/7P1//+W4v3/q/T+/671/v+t9f7/rPT+/6v0/v+r9P7/qvP+/6nz/v+o
+ 8/7/p/L9/6by/f+l8f3/kur+/9TCs//l2Mz/18rB/9fHuP/q1Mf/QEJG/5rs+v+c7vz/tfL9/9b4/f+L
+ 1vP/muf3/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAu+b3/7P1//+W4v3/rfX//6/1//+u9f7/rfX+/631/v+s
+ 9P7/q/T+/6r0/v+p8/7/qPP+/6jy/v+n8v3/ne79/8fEvv/t3tT/5NrU/+jcz//y3NL/QURK/5zs+/+e
+ 7vz/v/T9/+P6/v+N1vP/muj4/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvOb3/7T2//+W4v3/rvX//7D2//+v
+ 9v//rvX+/671/v+t9f7/rPT+/6v0/v+q9P7/qvP+/6nz/v+o8/7/p/L9/67Iyf/o2Mv/7Ofk//Pr4//6
+ 5+D/Qk1V/53t/P+f7/z/zvb9/+j7/v+P1/P/m+n4/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvef3/7X2//+W
+ 4/3/r/X//7D2//+w9v//r/b//6/1//+u9f7/rfX+/6z0/v+s9P7/q/T+/6rz/v+p8/7/qPP+/53V4f/f
+ yLb/9/Pw////+f//8er/Rlli/5/u/P+h7/3/z/f9/+j7/v+Q2PP/m+r5/wAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAvuf3/7X2//+X4/3/sPb//7H2//+x9v//sPb//6/2//+v9f//rvX+/631/v+t9f7/rPT+/6v0/v+q
+ 9P7/qvP+/5nk9f/awav/8+7p//Tz8f/86+b/TGJt/6Du/P+i8P3/z/f+/+n7/v+S2PT/nOv6/wAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAvuf3/7X2//+X4/3/sPb//7L3//+x9///sfb//7D2//+w9v//r/b//671/v+u
+ 9f7/rfX+/6z0/v+r9P7/q/T+/6Xw/f/StJ//Y1pZ/1NQTf/z3dj/eaW3/6Hw/f+j8f3/1fj+/+b7/v+U
+ 2fT/nOz6/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvuf3/7X2//+X4/3/sPb//7L3//+y9///svf//7H2//+x
+ 9v//sPb//6/2//+v9f//rvX+/631/v+t9f7/rPT+/6v0/v/Pspz/npSM/4B4cv/VycX/g4+U/6Hu+/+l
+ 8f3/2/n+/+T7/v+W2fT/ne37/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvuf3/7X2//+X4/3/sPb//7L3//+y
+ 9///svf//7L3//+x9///sfb//7D2//+w9v//r/b//671/v+t9f7/rfX+/6fv+//Gqpv/wLq0/3xzcP+l
+ mZP/sJWL/7/s9f/s/P///////+T7/v+X2vT/ne77/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvuf3/7X2//+X
+ 4/3/sPb//7L3//+y9///svf//7L3//+y9///sff//7H2//+w9v//sPb//6/2//+v9f//r/X+/7fz/f/1
+ 5dz/0c7L/2heWP+rnJD/vaed/9ru8//d+v//0fj+/7/2/v+Z2vT/nu/8/wAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAvuf3/7X2//+X4/3/sPb//7L3//+y9///svf//7L3//+y9///svf//7L3//+x9v//sfb//7D2//+v
+ 9v//uff//733/v+79Pz/5dzW/36CfP+hr7T/fJun/57h8v+k5vn/oeH3/57e9f+d4/f/nu/8lgAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAvuf3/7X2//+X4/3/sfb//7L3//+y9///svf//7P3//+z9///tPf//7P3//+y
+ 9///sff//7H1//+x8v3/sPD8/6/s+/+u6fn/oaqu/15xef9kjp3/f7jL9p7f896h5vm5n+j6hp7q+0Ge
+ 8P0PAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvuf3/7T3//+l7v7/svf//7L3//+y9///svf//7L2//+0
+ 9P3/tfD8/7bu+/+26/r/tuj3/7Xj9f+w5vf7ruf47Kvo+c6o6fmlpur6caDw/S0AAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvOj4/bP2/v+18/3/t/H8/7nu+v+7
+ 6/n/ven4/73n9/+46fj2s+n54LDq+sGu6/qXq+v7VZ/x/g8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAtOv5wbzo+P24
+ 6fjyter51rLr+qyw7Pp+re37QwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAD///////8AAP///////wAA////////AAD///////8AAP///////wAA///gAH//AAD/
+ /4AAH/8AAP/4AAAP/wAA/8AAAAP/AAD8AAAAAf8AAMAAAAAB/wAAgAAAAAD/AACAAAAAAH8AAIAAAAAA
+ PwAAgAAAAAAPAACAAAAAAA8AAIAAAAAADwAAgAAAAAA/AACAAAAAAP8AAIAAAAAD/wAAgAAAAA//AACA
+ AAAAP/8AAIAAAAD//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf/
+ /wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACA
+ AAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAAf//wAAgAAAB///AACAAAAH//8AAIAAAA//
+ /wAAgAAH////AACAAf////8AAID//////wAA////////AAAoAAAAIAAAAEAAAAABACAAAAAAAIAQAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAFcaW5O3u0ynNSd4Y4AAAAGwAAABYA
+ AAAOAAAABgAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIfH4DKGssKbaJGi5Wmxzfx4zu7/eNDr/3bL5f9o
+ mq2HIDA2QAAAACoAAAAcAAAADAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAACKzOUwiMznfYTN6seAzuv2es3t/4+WmP+jnpz/e6Oz/3TY9f9n
+ zu//T83o/2fN6P+Izeb/IDA2TAAAADUAAAAlAAAAEwAAAAYAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAis3lMIrO54CI0OvKhdDs94LS8P990vL/fNX0/3vY9f962/X/tsPH/5eXl/9z
+ pLb/d973/3HN8f9ayt//v6mI/4TW7P9torWcAAAAQAAAADgAAAAoAAAAEgAAAAQAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAACN0epejtLszY7T7viN1fH/itbz/4bZ9f+E3Pb/guD3/4Hi+P+A4fj/fuH4/33f9/+k
+ q67/kpCR/4Cvwf943vf/cc3x/2HN3//ix6T/htfs/3KpvaQAAAA8AAAAOAAAADEAAAAfAAAACwAAAAEA
+ AAAAAAAAAAAAAAAAAAAAmNnysJrd9f+T3vb/juH4/4zk+P+J5fn/iOX5/4bk+f+F5Pn/g+P4/4Li+P+A
+ 4vj/f+D3/7jEyf+UlJT/b6Cx/3re9/9wzfH/Y9Ts//X8/v+H2O3/dK3BoQAAADUAAAAxAAAALQAAACQA
+ AAAWAAAACAAAAAIAAAAAAAAAAAAAAACd3PT/ouv7/5Do+v+O6Pr/jef6/4vm+v+K5vn/iOX5/4fk+f+F
+ 5Pn/hOP5/4Lj+P+B4ff/m56h/46Sk/99uc7/fN/3/3HO8f9l1Oz/9fz+/4ja7f91scWeAAAALQAAACgA
+ AAAkAAAAHwAAABgAAAAPAAAABwAAAAIAAAAAAAAAAKDd9f+k7Pz/iuD7/5Hp+v+P6Pr/juf6/4zn+v+L
+ 5vn/ieX5/4jl+f+G5Pn/heT5/4Pi+P+/y9H/lpeX/2eZq/9+4Pj/c87x/2vW7f/1/P7/itru/3i3y5oA
+ AAAkAAAAHwAAABsAAAAWAAAAEgAAAA0AAAAIAAAABAAAAAEAAAAAot71/6Xs/P+L4Pz/k+r7/5Lp+v+Q
+ 6Pr/juj6/43n+v+L5vr/iub5/4jl+f+H5Pn/heP4/5SXmf+OkJL/hL7S/4Dh+P92zvH/cdfu//b8/v+M
+ 2+7/fL3QlgAAABsAAAAWAAAAEgAAAA4AAAAKAAAABgAAAAMAAAABAAAAAAAAAACl3vX/p+38/4zh/P+V
+ 6/v/lOr7/5Lp+/+R6fr/j+j6/47n+v+M5/r/i+b5/4nl+f+I5Pn/w9HX/5SZmf9mlqj/guL4/3fP8f92
+ 2e//7/v9/47c7v9/w9iRAAAAEQAAAA0AAAAKAAAABgAAAAMAAAABAAAAAAAAAAAAAAAAAAAAAKff9f+p
+ 7vz/jeH8/5js+/+W6/v/ler7/5Pq+/+S6fr/kOj6/47o+v+N5/r/i+b6/4rm+f+RkZP/jZCS/4XA1v+F
+ 4/n/edDy/2zX7v9x2e//j9zu/4HH3HwAAAAKAAAABgAAAAMAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAqeD1/6ru/P+P4vz/mu38/5ns+/+X6/v/lev7/5Tq+/+S6fv/ken6/4/o+v+O5/r/jOf6/8XU2v+W
+ mpz/aJao/47m+f991PP/fNfx/5Pe8P+Fz+ObW42bEgAAAAMAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAACr4fb/rO/8/5Di/P+c7vz/m+38/5ns/P+Y7Pv/luv7/5Xq+/+T6vv/kun6/5Do+v+O
+ 6Pr/ko+R/4uPkf+Dwdj/n+r6/4bh+P9/0/L/jNbr/0xxewYAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAK7h9v+t8P3/keP8/5/v/P+d7vz/nO38/5rt/P+Z7Pv/l+v7/5Xr+/+U
+ 6vv/kun7/5Hp+v/F2OD/lZmZ/2uaq/+T6Pn/kef5/3zR8v+I1uv/AAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsOL2/6/x/f+R4/z/oe/9/5/v/P+e7vz/nO78/5vt/P+Z
+ 7Pz/mOz7/5br+/+V6vv/kun7/6G8xv+iiYH/kcXY/4/o+v+d6vv/ftHy/4fX6/8AAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACy4/b/sfL9/5Pk/P+j8P3/ofD9/6Dv/P+f
+ 7/z/ne78/5zt/P+a7fz/mez7/5fr+/+Ivc//l4h//7Wajf93iJH/huH6/6zt+/+A0vL/h9js/wAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALTk9v+x8v7/lOT8/6Xx/f+k
+ 8f3/ovD9/6Hv/f+f7/z/nu78/5zu/P+b7fz/mez8/3BPQf9lhJb/va6i/3ptZf9zz+r/uvH8/4LT8v+H
+ 2ez/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAteT2/7Py/v+V
+ 5f3/p/L9/6by/f+k8f3/o/D9/6Hw/f+g7/z/n+/8/53u/P+c7fz/k21b/5+goP+9oIn/aWpq/33b9//I
+ 9P3/hNPy/4ba7f8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3
+ 5fb/tfP+/5bl/f+p8/7/p/L+/6by/f+l8f3/pPH9/6Lw/f+h7/3/n+/8/57u/P/lx7P/1bab/7aOcv9h
+ aXD/f935/9X3/f+H1PP/htzu/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAALnl9/+39P7/l+X9/6r0/v+p8/7/qPP+/6fy/f+m8v3/pPH9/6Pw/f+h8P3/oO/8/93Ryv/r
+ y7T/yquV/2Jwe/9/4Pv/5Pr+/4nV8/+G3e7/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAuub3/7f0/v+Y5v3/rPT+/6v0/v+q8/7/qfP+/6fy/v+m8v3/pfH9/6Tx/f+i
+ 8P3/2OHj///x4//izb3/a3yI/4Hh/f/v/P//i9bz/4Xe7/8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC85vf/uPT//5nm/f+u9f7/rfX+/6z0/v+q9P7/qfP+/6jz/v+n
+ 8v3/pvL9/6Tx/f/G3+b////3//vv5v9pgY7/g+T+//X9//+O1/P/hd/w/wAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAL3n9/+59P//meb9/6/2//+u9f7/rfX+/6z0/v+r
+ 9P7/qvP+/6nz/v+n8v7/pvL9/7fe6f/Zu6//t6yp/36Zp/+E6P7/+v7//5DX8/+F4PD/AAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvuf3/7r1//+a5v3/sPb//6/2//+v
+ 9f//rvX+/631/v+s9P7/qvT+/6nz/v+o8/7/pOX1/7iWhv9xY17/cX+K/4Hn/v/9////ktj0/4Xg8f8A
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC+5/f/uvX//5rm/f+x
+ 9///sfb//7D2//+v9v//rvX+/631/v+s9P7/q/T+/6rz/v+q2+X/zbOm/1hKRP+dgXn/ltHm//3///+V
+ 2fT/hOHx/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAL7n9/+6
+ 9f//mub9/7L3//+y9///sfb//7D2//+v9v//r/X//671/v+t9f7/rPT+//rz8f/hzsb/hXVs/+a/sv+y
+ 1N3//f///5fa9P+E4vL/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAvuf3/7r1//+a5v3/svf//7L3//+y9///sff//7b3///A+P//0Pr//9b6/v/b+///3Pz///bk3/+P
+ hYL/k6Wu/4TB1f+m4fb/ld/0/4Tj8pYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAC+5/f/ufX//6vy//+y9///svf//7L3//+z9///tfT+/7fx/P+27vr/ter5/7Lm9/+s
+ 4fb/wtXZ/Yijq/94qLn1fMPYuYzh80SE4/IPAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAL3n9+2z9f7/tfP9/7fw/P+57fr/u+r5/7vm9/+15vfyreX22Kfk9bKl
+ 5PV2oeP1OQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvuf3fr3n9+225/bWtef2q7Xn9nW+5/czvef3AwAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////////////4Af//4AD//gAAP+AAAD8AAAAeA
+ AAADgAAAAYAAAACAAAABgAAAB4AAAB+AAAB/gAAB/4AAB/+AAAf/gAAH/4AAB/+AAAf/gAAH/4AAB/+A
+ AAf/gAAH/4AAB/+AAAf/gAAH/4AAB/+AAAf/gAAP/4AH//+A////KAAAABAAAAAgAAAAAQAgAAAAAABA
+ BAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAo8r/QKPK/0Cjyv9Ao8r/QKPK/0Cjyv9Ao8r/QKPK/0Cjyv9A
+ o8r/QKPK/2efxP9nnsTbZ53DcgAAAAAAAAAARKbM/5Dn9v+H5PT/gOHz/3zf8v943fH/rK6u/4OFhv+J
+ tcf/edzw/0SmzP9VzOr/WMbl/2eexNsAAAAAAAAAAEmpzv+P6Pb/huX1/3/h8/953vL/ddzx/6bd9/+p
+ srT/mXhz/3fb8P9Jqc7/W8/r/9OlSf9mn8T/AAAAAAAAAABOrNH/kOn2/4fl9f9/4vT/eeDy/3Xe8v+s
+ rq7/g4WG/4m1x/923PH/TqzR/2PS7P/duV3/ZqHF/wAAAAAAAAAAU6/T/5Pr+P+K6Pf/guX1/3zi9P95
+ 4PP/u+f3/6mytP+ZeHP/ed3x/1Ov0/9r1e7/7Ozs/2aixv8AAAAAAAAAAFmz1v+X7vn/j+r4/4fo9v+B
+ 5fX/fuP0/6yurv+DhYb/ibXH/33g8v9Zs9b/dNnv/+zs7P9lo8b/AAAAAAAAAABft9n/nPD6/5Tt+P+M
+ 6vf/h+j2/4Pm9f+96f3/p7K1/5l4c/+B4vT/X7fZ/37d8f/s7Oz/ZaXH/wAAAAAAAAAAZbrc/6Dy+/+Y
+ 7/n/ke35/4zr+P+I6ff/rK6u/4OFhv9eYGf/heX0/2W63P+I4fP/huHy/2SnyP8AAAAAAAAAAGu+3/+k
+ 9fz/nPL7/5bv+v+R7fn/jev4/6KQgf91z/X/hmZh/4jl9P9sv+D/hNXo/2uz0P9kqMmWAAAAAAAAAABw
+ wuL/qPb8/6H0/P+b8vv/lfD6/5Lu+f/Kuav/qpyR/5l4c/+N6Pf/fdLr/2/B4f9jrMtLAAAAAAAAAAAA
+ AAAAdsXk/6v4/f+l9v3/n/T8/5ry+/+X8fr////8/+/Mu/+ZeHP/kev4/5Tr9/92xeT/AAAAAAAAAAAA
+ AAAAAAAAAHvI5/+v+v7/qfj+/6T2/f+g9fz/nfP7///56//u3dj/mXhz/5fu+f+Z7vj/e8jn/wAAAAAA
+ AAAAAAAAAAAAAACAy+n/tPv//676/v+q+f7/p/j9/6T2/P+jqqf/blhU/5l4c/+e8Pr/oPH6/4DL6f8A
+ AAAAAAAAAAAAAAAAAAAAhM7r/7j8//+1+///sfr+/675/v+s+P3/7uri/7mVh/+ZeHP/pvT8/5Pd8v+E
+ zuv/AAAAAAAAAAAAAAAAAAAAAIfQ7f+H0O3/h9Dt/4fQ7f+H0O3/h9Dt/6LS5v90q8D/Z77e/4fQ7f+H
+ 0O3/X7rSdQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
+ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAQAAgAEAAIABAACAAQAAgAEAAIABAACAAQAAgAEAAIABAACA
+ AwAAgAcAAIAHAACABwAAgAcAAIAHAAD//wAA
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Program.cs b/dotNetZip/Examples/C#/ZipTreeView/Program.cs
new file mode 100644
index 0000000..af61e8f
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Program.cs
@@ -0,0 +1,21 @@
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Windows.Forms;
+
+namespace ZipTreeView
+{
+ static class Program
+ {
+ ///
+ /// The main entry point for the application.
+ ///
+ [STAThread]
+ static void Main()
+ {
+ Application.EnableVisualStyles();
+ Application.SetCompatibleTextRenderingDefault(false);
+ Application.Run(new Form1());
+ }
+ }
+}
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Properties/AssemblyInfo.cs b/dotNetZip/Examples/C#/ZipTreeView/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..236d4fd
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Properties/AssemblyInfo.cs
@@ -0,0 +1,12 @@
+using System.Reflection;
+using System.Runtime.CompilerServices;
+using System.Runtime.InteropServices;
+
+[assembly: AssemblyTitle("ZipTreeView")]
+[assembly: AssemblyDescription("Example showing a zipfile in a WinForms TreeView")]
+[assembly: AssemblyConfiguration("")]
+
+[assembly: ComVisible(false)]
+
+[assembly: Guid("c40b5ebc-ea71-420e-8f61-46582173dbb9")]
+
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Properties/Resources.Designer.cs b/dotNetZip/Examples/C#/ZipTreeView/Properties/Resources.Designer.cs
new file mode 100644
index 0000000..f134458
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Properties/Resources.Designer.cs
@@ -0,0 +1,63 @@
+//------------------------------------------------------------------------------
+//
+// This code was generated by a tool.
+// Runtime Version:4.0.30319.225
+//
+// Changes to this file may cause incorrect behavior and will be lost if
+// the code is regenerated.
+//
+//------------------------------------------------------------------------------
+
+namespace ZipTreeView.Properties {
+ using System;
+
+
+ ///
+ /// A strongly-typed resource class, for looking up localized strings, etc.
+ ///
+ // This class was auto-generated by the StronglyTypedResourceBuilder
+ // class via a tool like ResGen or Visual Studio.
+ // To add or remove a member, edit your .ResX file then rerun ResGen
+ // with the /str option, or rebuild your VS project.
+ [global::System.CodeDom.Compiler.GeneratedCodeAttribute("System.Resources.Tools.StronglyTypedResourceBuilder", "4.0.0.0")]
+ [global::System.Diagnostics.DebuggerNonUserCodeAttribute()]
+ [global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
+ internal class Resources {
+
+ private static global::System.Resources.ResourceManager resourceMan;
+
+ private static global::System.Globalization.CultureInfo resourceCulture;
+
+ [global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
+ internal Resources() {
+ }
+
+ ///
+ /// Returns the cached ResourceManager instance used by this class.
+ ///
+ [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
+ internal static global::System.Resources.ResourceManager ResourceManager {
+ get {
+ if (object.ReferenceEquals(resourceMan, null)) {
+ global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager("ZipTreeView.Properties.Resources", typeof(Resources).Assembly);
+ resourceMan = temp;
+ }
+ return resourceMan;
+ }
+ }
+
+ ///
+ /// Overrides the current thread's CurrentUICulture property for all
+ /// resource lookups using this strongly typed resource class.
+ ///
+ [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
+ internal static global::System.Globalization.CultureInfo Culture {
+ get {
+ return resourceCulture;
+ }
+ set {
+ resourceCulture = value;
+ }
+ }
+ }
+}
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Properties/Resources.resx b/dotNetZip/Examples/C#/ZipTreeView/Properties/Resources.resx
new file mode 100644
index 0000000..af7dbeb
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Properties/Resources.resx
@@ -0,0 +1,117 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ text/microsoft-resx
+
+
+ 2.0
+
+
+ System.Resources.ResXResourceReader, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
+ System.Resources.ResXResourceWriter, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Properties/Settings.Designer.cs b/dotNetZip/Examples/C#/ZipTreeView/Properties/Settings.Designer.cs
new file mode 100644
index 0000000..6c4cace
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Properties/Settings.Designer.cs
@@ -0,0 +1,26 @@
+//------------------------------------------------------------------------------
+//
+// This code was generated by a tool.
+// Runtime Version:4.0.30319.225
+//
+// Changes to this file may cause incorrect behavior and will be lost if
+// the code is regenerated.
+//
+//------------------------------------------------------------------------------
+
+namespace ZipTreeView.Properties {
+
+
+ [global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
+ [global::System.CodeDom.Compiler.GeneratedCodeAttribute("Microsoft.VisualStudio.Editors.SettingsDesigner.SettingsSingleFileGenerator", "10.0.0.0")]
+ internal sealed partial class Settings : global::System.Configuration.ApplicationSettingsBase {
+
+ private static Settings defaultInstance = ((Settings)(global::System.Configuration.ApplicationSettingsBase.Synchronized(new Settings())));
+
+ public static Settings Default {
+ get {
+ return defaultInstance;
+ }
+ }
+ }
+}
diff --git a/dotNetZip/Examples/C#/ZipTreeView/Properties/Settings.settings b/dotNetZip/Examples/C#/ZipTreeView/Properties/Settings.settings
new file mode 100644
index 0000000..3964565
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/Properties/Settings.settings
@@ -0,0 +1,7 @@
+
+
+
+
+
+
+
diff --git a/dotNetZip/Examples/C#/ZipTreeView/ZipTreeView.csproj b/dotNetZip/Examples/C#/ZipTreeView/ZipTreeView.csproj
new file mode 100644
index 0000000..7b3907e
--- /dev/null
+++ b/dotNetZip/Examples/C#/ZipTreeView/ZipTreeView.csproj
@@ -0,0 +1,138 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {1BCEC4DE-A73D-49A6-869F-EDA4AB6B41EF}
+ WinExe
+ Properties
+ ZipTreeView
+ ZipTreeView
+ v3.5
+ 512
+ SAK
+ SAK
+ SAK
+ SAK
+
+
+ 3.5
+
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE
+ prompt
+ 4
+ AllRules.ruleset
+
+
+
+
+ 3.5
+
+
+ 3.5
+
+
+ 3.5
+
+
+
+
+
+
+ Form
+
+
+ Form1.cs
+
+
+
+
+ Properties\SolutionInfo.cs
+
+
+ Form1.cs
+
+
+ ResXFileCodeGenerator
+ Resources.Designer.cs
+ Designer
+
+
+ True
+ Resources.resx
+ True
+
+
+ SettingsSingleFileGenerator
+ Settings.Designer.cs
+
+
+ True
+ Settings.settings
+ True
+
+
+
+
+ {D3B0AD67-44D8-4B3D-BED9-CE1FD6DE2C5A}
+ Zip DLL
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/C++/CreateWithProgress.cpp b/dotNetZip/Examples/C++/CreateWithProgress.cpp
new file mode 100644
index 0000000..d9b6e00
--- /dev/null
+++ b/dotNetZip/Examples/C++/CreateWithProgress.cpp
@@ -0,0 +1,127 @@
+// CreateWithProgress.cpp
+//
+// Example: creating a zip file, with progress events, from C++.
+//
+// This code is part of DotNetZip.
+//
+//
+// Last saved: <2010-June-01 10:32:21>
+//
+
+
+using namespace System;
+using namespace System::IO;
+using namespace Ionic::Zip;
+
+
+public ref class DnzHelloCppCli
+{
+
+private:
+ bool justHadByteUpdate;
+
+public:
+ DnzHelloCppCli()
+ {
+ }
+
+public:
+ void Run()
+ {
+ Console::WriteLine(L"Hello World");
+ Console::WriteLine("Using DotNetZip version {0}", ZipFile::LibraryVersion);
+ array^ filesToAdd = System::IO::Directory::GetFiles(".", "*.cpp");
+
+ ZipFile ^ zip;
+ try
+ {
+ zip = gcnew ZipFile();
+ zip->Password = "Harbinger";
+ zip->Encryption = EncryptionAlgorithm::WinZipAes128;
+ zip->SaveProgress += gcnew EventHandler(this, &DnzHelloCppCli::SaveProgress);
+ zip->AddEntry("Readme.txt", "This is the content for the Readme.txt entry.");
+ zip->AddFiles(filesToAdd, "files");
+ zip->Save("MyArchive.zip");
+ }
+ finally
+ {
+ zip->~ZipFile();
+ }
+
+ Console::WriteLine(L"Press to quit.");
+ Console::ReadLine();
+ return;
+ }
+
+public:
+ void SaveProgress(Object^ sender, SaveProgressEventArgs^ e)
+ {
+ switch (e->EventType)
+ {
+ case ZipProgressEventType::Saving_Started:
+ {
+ Console::WriteLine("Saving: {0}", e->ArchiveName);
+ break;
+ }
+ case ZipProgressEventType::Saving_BeforeWriteEntry:
+ {
+ if (this->justHadByteUpdate)
+ {
+ Console::WriteLine();
+ }
+ Console::WriteLine(" Writing: {0} ({1}/{2})",
+ e->CurrentEntry->FileName,
+ (e->EntriesSaved + 1),
+ e->EntriesTotal);
+ this->justHadByteUpdate = false;
+ break;
+ }
+ case ZipProgressEventType::Saving_AfterWriteEntry:
+ {
+ if (e->CurrentEntry->InputStreamWasJitProvided)
+ {
+ e->CurrentEntry->InputStream->Close();
+ e->CurrentEntry->InputStream = nullptr;
+ }
+ break;
+ }
+ case ZipProgressEventType::Saving_Completed:
+ {
+ this->justHadByteUpdate = false;
+ Console::WriteLine();
+ Console::WriteLine("Done: {0}", e->ArchiveName);
+ break;
+ }
+ case ZipProgressEventType::Saving_EntryBytesRead:
+ {
+ if (this->justHadByteUpdate)
+ {
+ Console::SetCursorPosition(0, Console::CursorTop);
+ }
+ Console::Write(" {0}/{1} ({2:N0}%)",
+ e->BytesTransferred,
+ e->TotalBytesToTransfer,
+ (((double) e->BytesTransferred) / (0.01 * e->TotalBytesToTransfer)));
+ this->justHadByteUpdate = true;
+ break;
+ }
+ }
+ }
+
+};
+
+
+int main(array ^args)
+{
+ try
+ {
+ DnzHelloCppCli^ me = gcnew DnzHelloCppCli();
+ me->Run();
+ }
+ catch (Exception^ ex1)
+ {
+ Console::Error->WriteLine(String::Concat("exception: ", ex1));
+ }
+ return 0;
+}
+
diff --git a/dotNetZip/Examples/C++/CreateZipfile.cpp b/dotNetZip/Examples/C++/CreateZipfile.cpp
new file mode 100644
index 0000000..c9c21ac
--- /dev/null
+++ b/dotNetZip/Examples/C++/CreateZipfile.cpp
@@ -0,0 +1,38 @@
+// CreateZipFile.cpp
+//
+// Example: creating a zip file from C++.
+//
+// This code is part of DotNetZip.
+//
+//
+// Last saved: <2010-June-01 10:32:15>
+//
+
+
+using namespace System;
+using namespace Ionic::Zip;
+
+int main(array ^args)
+{
+ Console::WriteLine(L"Hello World");
+ Console::WriteLine(L"Creating a zip file from C++/CLI using DotNetZip...");
+
+ ZipFile ^ zip;
+ try
+ {
+ zip = gcnew ZipFile();
+ zip->AddEntry("Readme.txt", "This is the content for the Readme.txt entry.");
+ zip->AddFile("CreateZipFile.cpp");
+ zip->Save("test.zip");
+ }
+ finally
+ {
+ //zip->~ZipFile();
+ delete zip;
+ }
+
+ Console::WriteLine(L"Press to quit.");
+ Console::ReadLine();
+ return 0;
+}
+
diff --git a/dotNetZip/Examples/C++/build.cmd b/dotNetZip/Examples/C++/build.cmd
new file mode 100644
index 0000000..101a7eb
--- /dev/null
+++ b/dotNetZip/Examples/C++/build.cmd
@@ -0,0 +1,35 @@
+setlocal
+
+if not exist Ionic.Zip.dll (
+ fsutil hardlink create "Ionic.Zip.dll" "c:\dinoch\dev\dotnet\zip\DotNetZip\Zip Full DLL\bin\Debug\Ionic.Zip.dll"
+)
+
+set CLCMD=\vc9\bin\cl.exe
+set LINKCMD=\vc9\bin\link.exe
+set MTCMD=c:\netsdk2.0\Bin\mt.exe
+
+for %%F in (CreateWithProgress CreateZipFile) do call :COMPILE_ONE_APP %%F
+
+goto ALL_DONE
+
+
+
+--------------------------------------------
+:COMPILE_ONE_APP
+ @REM Arg: basename
+ set fileToBuild=%1
+ %CLCMD% /Od /D "WIN32" /D "_DEBUG" /D "_UNICODE" /D "UNICODE" /FD /EHa /MDd /Fo".\\" -I\vc9\include -I\winsdk\include /W3 /c /Zi /clr /TP /FU "c:\Windows\Microsoft.NET\Framework\v2.0.50727\System.dll" /FU Ionic.Zip.dll %fileToBuild%.cpp
+
+ %LINKCMD% /OUT:%fileToBuild%.exe /MANIFEST /MANIFESTFILE:"%fileToBuild%.exe.intermediate.manifest" /MANIFESTUAC:"level='asInvoker' uiAccess='false'" /DEBUG /ASSEMBLYDEBUG /PDB:%fileToBuild%.pdb /DYNAMICBASE /FIXED:No /NXCOMPAT /MACHINE:X86 /LIBPATH:\vc9\lib /LIBPATH:\winsdk\lib %fileToBuild%.obj
+
+ %MTCMD% /outputresource:"%fileToBuild%.exe;#1" /manifest %fileToBuild%.exe.intermediate.manifest
+ del %fileToBuild%.exe.intermediate.manifest
+ @GOTO:EOF
+
+
+
+--------------------------------------------
+:ALL_DONE
+
+
+endlocal
\ No newline at end of file
diff --git a/dotNetZip/Examples/C++/clean.cmd b/dotNetZip/Examples/C++/clean.cmd
new file mode 100644
index 0000000..1011b67
--- /dev/null
+++ b/dotNetZip/Examples/C++/clean.cmd
@@ -0,0 +1,13 @@
+del *.obj
+del Ionic.Zip.dll
+del *.cpp~
+del Create*.exe
+del Create*.exp
+del Create*.ilk
+del *.pdb
+del *.exe.intermediate.manifest
+del *.idb
+del MyArchive.zip
+del test.zip
+del *.cmd~
+
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/CF-Unzipper.csproj b/dotNetZip/Examples/CompactFramework/CF-Unzipper/CF-Unzipper.csproj
new file mode 100644
index 0000000..3d7f9f7
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/CF-Unzipper.csproj
@@ -0,0 +1,146 @@
+
+
+
+ Debug
+ AnyCPU
+ 9.0.30729
+ 2.0
+ {D2E7C1EA-6FF1-4E26-96FC-24F6FB68B61B}
+ WinExe
+ Properties
+ Ionic.Examples.Smartphone.Zip
+ CF-Unzipper
+ Smartphone
+ f27da329-3269-4191-98e0-c87d3d7f1db9
+ 5.2
+ SmartDeviceProject3
+ v2.0
+ Windows Mobile 6 Standard SDK
+
+
+ SAK
+ SAK
+ SAK
+ SAK
+
+
+ 4.0
+ publish\
+ true
+ Disk
+ false
+ Foreground
+ 7
+ Days
+ false
+ false
+ true
+ 0
+ 1.0.0.%2a
+ false
+ false
+ true
+
+
+
+ true
+ full
+ false
+ bin\Debug\
+ DEBUG;TRACE;$(PlatformFamilyName); NETCF
+ true
+ true
+ prompt
+ 512
+ 4
+ Off
+ AllRules.ruleset
+
+
+ pdbonly
+ true
+ bin\Release\
+ TRACE;$(PlatformFamilyName); NETCF
+ true
+ true
+ prompt
+ 512
+ 4
+ Off
+ AllRules.ruleset
+
+
+
+
+
+
+
+
+
+
+ Form
+
+
+ Form1.cs
+
+
+
+
+ Form1.cs
+
+
+ ResXFileCodeGenerator
+ Resources.Designer.cs
+ Designer
+
+
+ True
+ Resources.resx
+ True
+
+
+
+
+
+
+
+
+
+ {051C2B3B-8CDF-42CB-9EA2-027232BFC395}
+ Zip CF DLL
+
+
+
+
+ False
+ .NET Framework 3.5 SP1 Client Profile
+ false
+
+
+ False
+ .NET Framework 3.5 SP1
+ true
+
+
+ False
+ Windows Installer 3.1
+ true
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.Designer.cs b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.Designer.cs
new file mode 100644
index 0000000..584b74a
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.Designer.cs
@@ -0,0 +1,113 @@
+namespace SmartDeviceProject3
+{
+ partial class Form1
+ {
+ ///
+ /// Required designer variable.
+ ///
+ private System.ComponentModel.IContainer components = null;
+ private System.Windows.Forms.MainMenu mainMenu1;
+
+ ///
+ /// Clean up any resources being used.
+ ///
+ /// true if managed resources should be disposed; otherwise, false.
+ protected override void Dispose(bool disposing)
+ {
+ if (disposing && (components != null))
+ {
+ components.Dispose();
+ }
+ base.Dispose(disposing);
+ }
+
+ #region Windows Form Designer generated code
+
+ ///
+ /// Required method for Designer support - do not modify
+ /// the contents of this method with the code editor.
+ ///
+ private void InitializeComponent()
+ {
+ this.mainMenu1 = new System.Windows.Forms.MainMenu();
+ this.menuItemUnzip = new System.Windows.Forms.MenuItem();
+ this.menuItem2 = new System.Windows.Forms.MenuItem();
+ this.menuItemDelete = new System.Windows.Forms.MenuItem();
+ this.menuItemAbout = new System.Windows.Forms.MenuItem();
+ this.menuItemQuit = new System.Windows.Forms.MenuItem();
+ this.tvFolders = new System.Windows.Forms.TreeView();
+ this.imageList1 = new System.Windows.Forms.ImageList();
+ this.SuspendLayout();
+ //
+ // mainMenu1
+ //
+ this.mainMenu1.MenuItems.Add(this.menuItemUnzip);
+ this.mainMenu1.MenuItems.Add(this.menuItem2);
+ //
+ // menuItemUnzip
+ //
+ this.menuItemUnzip.Text = "Unzip";
+ this.menuItemUnzip.Click += new System.EventHandler(this.menuItemUnzip_Click);
+ //
+ // menuItem2
+ //
+ this.menuItem2.MenuItems.Add(this.menuItemDelete);
+ this.menuItem2.MenuItems.Add(this.menuItemAbout);
+ this.menuItem2.MenuItems.Add(this.menuItemQuit);
+ this.menuItem2.Text = "Menu";
+ //
+ // menuItemDelete
+ //
+ this.menuItemDelete.Text = "Delete";
+ this.menuItemDelete.Click += new System.EventHandler(this.menuItemDelete_Click);
+ //
+ // menuItemAbout
+ //
+ this.menuItemAbout.Text = "About";
+ this.menuItemAbout.Click += new System.EventHandler(this.menuItemAbout_Click);
+ //
+ // menuItemQuit
+ //
+ this.menuItemQuit.Text = "Quit";
+ this.menuItemQuit.Click += new System.EventHandler(this.menuItemQuit_Click);
+ //
+ // tvFolders
+ //
+ this.tvFolders.Dock = System.Windows.Forms.DockStyle.Fill;
+ this.tvFolders.Location = new System.Drawing.Point(0, 0);
+ this.tvFolders.Name = "tvFolders";
+ this.tvFolders.Size = new System.Drawing.Size(320, 186);
+ this.tvFolders.TabIndex = 0;
+ this.tvFolders.AfterSelect += new System.Windows.Forms.TreeViewEventHandler(this.tvFolders_AfterSelect);
+ //
+ // imageList1
+ //
+ this.imageList1.ImageSize = new System.Drawing.Size(16, 16);
+ //
+ // Form1
+ //
+ this.AutoScaleDimensions = new System.Drawing.SizeF(131F, 131F);
+ this.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Dpi;
+ this.AutoScroll = true;
+ this.ClientSize = new System.Drawing.Size(320, 186);
+ this.Controls.Add(this.tvFolders);
+ this.Font = new System.Drawing.Font("Segoe Condensed", 9F, System.Drawing.FontStyle.Bold);
+ this.Menu = this.mainMenu1;
+ this.Name = "Form1";
+ this.Text = "Unzipper - browse and unzip";
+ this.ResumeLayout(false);
+
+ }
+
+ #endregion
+
+ private System.Windows.Forms.TreeView tvFolders;
+ private System.Windows.Forms.ImageList imageList1;
+ private System.Windows.Forms.MenuItem menuItemUnzip;
+ private System.Windows.Forms.MenuItem menuItem2;
+ private System.Windows.Forms.MenuItem menuItemDelete;
+ private System.Windows.Forms.MenuItem menuItemAbout;
+ private System.Windows.Forms.MenuItem menuItemQuit;
+ }
+}
+
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.cs b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.cs
new file mode 100644
index 0000000..0f3481a
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.cs
@@ -0,0 +1,279 @@
+using System;
+using System.IO;
+using System.Windows.Forms;
+using Ionic.Zip;
+
+namespace SmartDeviceProject3
+{
+ public partial class Form1 : Form
+ {
+ public Form1()
+ {
+ InitializeComponent();
+
+ CustomInit();
+ }
+
+ #region Helpers
+ private void CustomInit()
+ {
+ //add folder images to imagelist
+ this.imageList1.Images.Add(new System.Drawing.Bitmap(System.Reflection.Assembly.GetExecutingAssembly().GetManifestResourceStream("Ionic.Examples.Smartphone.Zip.Images.Folder.gif")));
+ this.imageList1.Images.Add(new System.Drawing.Bitmap(System.Reflection.Assembly.GetExecutingAssembly().GetManifestResourceStream("Ionic.Examples.Smartphone.Zip.Images.Device.gif")));
+ this.imageList1.Images.Add(new System.Drawing.Bitmap(System.Reflection.Assembly.GetExecutingAssembly().GetManifestResourceStream("Ionic.Examples.Smartphone.Zip.Images.Card.gif")));
+
+ //set default image index to 0
+ tvFolders.ImageIndex = 0;
+ tvFolders.SelectedImageIndex = 0;
+
+ //use a backslash between path levels
+ tvFolders.PathSeparator = "\\";
+
+ //setup default tree
+ Reset();
+ }
+
+ public void Reset()
+ {
+ //restores dialog to initial settings and repopulates folders
+ this._selectedpath = "";
+ tvFolders.Nodes.Clear();
+
+ //add the root (device) node to the tree
+ AddRoot();
+
+ //add root level subfolders
+ AddChildren(tvFolders.Nodes[0]);
+
+ //expand the top level folders
+ tvFolders.Nodes[0].Expand();
+ }
+
+
+ private void AddRoot()
+ {
+ //stop updates during filling
+ tvFolders.BeginUpdate();
+
+ //add an empty node (use device image)
+ TreeNode root = tvFolders.Nodes.Add("");
+ root.ImageIndex = 1;
+ root.SelectedImageIndex = 1;
+
+ tvFolders.EndUpdate();
+ }
+
+
+
+ ///
+ /// Adds subfolders to a specified node in the tree
+ ///
+ /// Node to add sub-folders to
+ private void AddChildren(TreeNode tn)
+ {
+ //stop updates during filling
+ tvFolders.BeginUpdate();
+
+ //path to query for subfolders
+ string path = (tn.FullPath == "")
+ ? "\\"
+ : tn.FullPath;
+
+ //clear any existing subnodes
+ tn.Nodes.Clear();
+
+ //get all folders beneath the selected node
+ foreach (string directory in System.IO.Directory.GetDirectories(path))
+ {
+ TreeNode node = new TreeNode();
+ //format human friendly name
+ node.Text = directory.Substring(directory.LastIndexOf("\\") + 1, directory.Length - directory.LastIndexOf("\\") - 1);
+
+ //change icon if folder is a storage card
+ DirectoryInfo di = new DirectoryInfo(directory);
+ if ((di.Attributes & FileAttributes.Temporary) == FileAttributes.Temporary)
+ {
+ node.ImageIndex = 2;
+ node.SelectedImageIndex = 2;
+ }
+
+ //add to root of tree
+ tn.Nodes.Add(node);
+ }
+
+ //get all files beneath the selected node
+ foreach (string zipfilename in System.IO.Directory.GetFiles(path))
+ {
+ TreeNode node = new TreeNode();
+ //format human friendly name
+ node.Text = System.IO.Path.GetFileName(zipfilename);
+ //node.Text = zipfile.Substring(directory.LastIndexOf("\\") + 1, directory.Length - directory.LastIndexOf("\\") - 1);
+
+ //add to root of tree
+ tn.Nodes.Add(node);
+ }
+
+ //restore events etc
+ tvFolders.EndUpdate();
+ }
+
+ #endregion
+
+ #region Public Properties
+
+ ///
+ /// Gets or sets the path selected by the user.
+ ///
+ public string SelectedPath
+ {
+ get
+ {
+ return _selectedpath;
+ }
+ set
+ {
+ //check that value passed is a valid file system path
+ if (Directory.Exists(value))
+ {
+ _selectedpath = value;
+
+ //split the path into each folder layer
+ string[] layers = value.Split('\\');
+
+ //mark the current node
+ TreeNode tn = tvFolders.Nodes[0];
+
+ //loop through the folder levels
+ foreach (string folderlevel in layers)
+ {
+ //ignore blank (top-level node)
+ if (folderlevel != "")
+ {
+ //add sub-folders
+ AddChildren(tn);
+
+ //find the required subfolder
+ foreach (TreeNode thisnode in tn.Nodes)
+ {
+ //check node text
+ if (thisnode.Text == folderlevel)
+ {
+ //if it does set it and continue processing the next level
+ tn = thisnode;
+ break;
+ }
+ }
+ }
+ }
+
+ //select the final node
+ tvFolders.SelectedNode = tn;
+
+ }
+ }
+ }
+ #endregion
+
+ #region Private Fields
+ private string _selectedpath;
+ #endregion
+
+ #region Events
+ private void tvFolders_AfterSelect(object sender, TreeViewEventArgs e)
+ {
+ //set the currently selected folder/file
+ _selectedpath = (tvFolders.SelectedNode.FullPath == "")
+ ? "\\"
+ : tvFolders.SelectedNode.FullPath;
+
+ if (System.IO.Directory.Exists(_selectedpath))
+ {
+ menuItemUnzip.Enabled = false;
+ //if there are no child nodes we will check for any and add them
+ if (tvFolders.SelectedNode.Nodes.Count == 0)
+ {
+ AddChildren(tvFolders.SelectedNode);
+ }
+ }
+ else if (Ionic.Zip.ZipFile.IsZipFile(_selectedpath))
+ {
+ menuItemUnzip.Enabled = true;
+ }
+ }
+
+
+ private void menuItemUnzip_Click(object sender, EventArgs e)
+ {
+ if (System.IO.File.Exists(_selectedpath))
+ {
+ UnzipSelectedFile();
+ }
+ }
+
+
+ private void UnzipSelectedFile()
+ {
+ string parent = System.IO.Path.GetDirectoryName(_selectedpath);
+ string dir = System.IO.Path.Combine(parent,
+ System.IO.Path.GetFileNameWithoutExtension(_selectedpath));
+ try
+ {
+ using (var zip1 = Ionic.Zip.ZipFile.Read(_selectedpath))
+ {
+ foreach (var entry in zip1)
+ {
+ entry.Extract(dir, ExtractExistingFileAction.OverwriteSilently);
+ }
+ }
+
+ // re-populate the treeview with the extracted files:
+ AddChildren(tvFolders.SelectedNode.Parent);
+ }
+ catch (Exception ex)
+ {
+ MessageBox.Show(ex.ToString());
+ }
+ }
+
+
+ private void menuItemDelete_Click(object sender, EventArgs e)
+ {
+ try
+ {
+ if (System.IO.File.Exists(_selectedpath))
+ {
+ System.IO.File.Delete(_selectedpath);
+ }
+ else if (System.IO.Directory.Exists(_selectedpath))
+ {
+ System.IO.Directory.Delete(_selectedpath, true);
+ }
+
+ // refresh the treeview
+ AddChildren(tvFolders.SelectedNode.Parent);
+ }
+ catch (Exception ex)
+ {
+ MessageBox.Show(ex.ToString());
+ }
+ }
+
+ private void menuItemQuit_Click(object sender, EventArgs e)
+ {
+ Application.Exit();
+ }
+
+ private void menuItemAbout_Click(object sender, EventArgs e)
+ {
+ MessageBox.Show("DotNetZip CF Unzipper. " +
+ "This example shows how to use the DotNetZip library in a .NET Compact Framework application. " +
+ "Built in VS2008 in December 2008.",
+ "About Unzipper",
+ MessageBoxButtons.OK,
+ MessageBoxIcon.Question,
+ MessageBoxDefaultButton.Button1);
+ }
+
+ #endregion
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.resx b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.resx
new file mode 100644
index 0000000..023f7f8
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Form1.resx
@@ -0,0 +1,132 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ text/microsoft-resx
+
+
+ 2.0
+
+
+ System.Resources.ResXResourceReader, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
+ System.Resources.ResXResourceWriter, System.Windows.Forms, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
+ 17, 17
+
+
+ 134, 17
+
+
+ Smartphone Landscape
+
+
+ True
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Card.gif b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Card.gif
new file mode 100644
index 0000000..dcc666e
Binary files /dev/null and b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Card.gif differ
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Device.gif b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Device.gif
new file mode 100644
index 0000000..2d28960
Binary files /dev/null and b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Device.gif differ
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Folder.gif b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Folder.gif
new file mode 100644
index 0000000..67bb500
Binary files /dev/null and b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Images/Folder.gif differ
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Program.cs b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Program.cs
new file mode 100644
index 0000000..d70d3a2
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Program.cs
@@ -0,0 +1,18 @@
+using System;
+using System.Collections.Generic;
+using System.Windows.Forms;
+
+namespace SmartDeviceProject3
+{
+ static class Program
+ {
+ ///
+ /// The main entry point for the application.
+ ///
+ [MTAThread]
+ static void Main()
+ {
+ Application.Run(new Form1());
+ }
+ }
+}
\ No newline at end of file
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/AssemblyInfo.cs b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/AssemblyInfo.cs
new file mode 100644
index 0000000..1c0ab5b
Binary files /dev/null and b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/AssemblyInfo.cs differ
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/Resources.Designer.cs b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/Resources.Designer.cs
new file mode 100644
index 0000000..f262864
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/Resources.Designer.cs
@@ -0,0 +1,65 @@
+//------------------------------------------------------------------------------
+//
+// This code was generated by a tool.
+// Runtime Version:4.0.30319.225
+//
+// Changes to this file may cause incorrect behavior and will be lost if
+// the code is regenerated.
+//
+//------------------------------------------------------------------------------
+
+namespace Ionic.Examples.Smartphone.Zip.Properties {
+ using System;
+
+
+ ///
+ /// A strongly-typed resource class, for looking up localized strings, etc.
+ ///
+ // This class was auto-generated by the StronglyTypedResourceBuilder
+ // class via a tool like ResGen or Visual Studio.
+ // To add or remove a member, edit your .ResX file then rerun ResGen
+ // with the /str option, or rebuild your VS project.
+ [global::System.CodeDom.Compiler.GeneratedCodeAttribute("System.Resources.Tools.StronglyTypedResourceBuilder", "4.0.0.0")]
+ [global::System.Diagnostics.DebuggerNonUserCodeAttribute()]
+ #if !NETCF
+ [global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
+ #endif
+ internal class Resources {
+
+ private static global::System.Resources.ResourceManager resourceMan;
+
+ private static global::System.Globalization.CultureInfo resourceCulture;
+
+ [global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
+ internal Resources() {
+ }
+
+ ///
+ /// Returns the cached ResourceManager instance used by this class.
+ ///
+ [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
+ internal static global::System.Resources.ResourceManager ResourceManager {
+ get {
+ if (object.ReferenceEquals(resourceMan, null)) {
+ global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager("Ionic.Examples.Smartphone.Zip.Properties.Resources", typeof(Resources).Assembly);
+ resourceMan = temp;
+ }
+ return resourceMan;
+ }
+ }
+
+ ///
+ /// Overrides the current thread's CurrentUICulture property for all
+ /// resource lookups using this strongly typed resource class.
+ ///
+ [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
+ internal static global::System.Globalization.CultureInfo Culture {
+ get {
+ return resourceCulture;
+ }
+ set {
+ resourceCulture = value;
+ }
+ }
+ }
+}
diff --git a/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/Resources.resx b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/Resources.resx
new file mode 100644
index 0000000..3e18af9
--- /dev/null
+++ b/dotNetZip/Examples/CompactFramework/CF-Unzipper/Properties/Resources.resx
@@ -0,0 +1,117 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ text/microsoft-resx
+
+
+ 2.0
+
+
+ System.Resources.ResXResourceReader, System.Windows.Forms, Version=2.0.3600.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
+ System.Resources.ResXResourceWriter, System.Windows.Forms, Version=2.0.3600.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
+
+
\ No newline at end of file
diff --git a/dotNetZip/Examples/PHP/CreateZip-DotNetZip.php b/dotNetZip/Examples/PHP/CreateZip-DotNetZip.php
new file mode 100644
index 0000000..0c37236
--- /dev/null
+++ b/dotNetZip/Examples/PHP/CreateZip-DotNetZip.php
@@ -0,0 +1,43 @@
+';
+echo ' ';
+echo ' Calling .NET from PHP through COM';
+echo ' ';
+echo ' ';
+echo '';
+
+ echo '