[ { "path": ".gitattributes", "content": "###############################################################################\n# Set default behavior to automatically normalize line endings.\n###############################################################################\n* text=auto\n\n###############################################################################\n# Set default behavior for command prompt diff.\n#\n# This is need for earlier builds of msysgit that does not have it on by\n# default for csharp files.\n# Note: This is only used by command line\n###############################################################################\n#*.cs diff=csharp\n\n###############################################################################\n# Set the merge driver for project and solution files\n#\n# Merging from the command prompt will add diff markers to the files if there\n# are conflicts (Merging from VS is not affected by the settings below, in VS\n# the diff markers are never inserted). Diff markers may cause the following \n# file extensions to fail to load in VS. An alternative would be to treat\n# these files as binary and thus will always conflict and require user\n# intervention with every merge. To do so, just uncomment the entries below\n###############################################################################\n#*.sln merge=binary\n#*.csproj merge=binary\n#*.vbproj merge=binary\n#*.vcxproj merge=binary\n#*.vcproj merge=binary\n#*.dbproj merge=binary\n#*.fsproj merge=binary\n#*.lsproj merge=binary\n#*.wixproj merge=binary\n#*.modelproj merge=binary\n#*.sqlproj merge=binary\n#*.wwaproj merge=binary\n\n###############################################################################\n# behavior for image files\n#\n# image files are treated as binary by default.\n###############################################################################\n#*.jpg binary\n#*.png binary\n#*.gif binary\n\n###############################################################################\n# diff behavior for common document formats\n# \n# Convert binary document formats to text before diffing them. This feature\n# is only available from the command line. Turn it on by uncommenting the \n# entries below.\n###############################################################################\n#*.doc diff=astextplain\n#*.DOC diff=astextplain\n#*.docx diff=astextplain\n#*.DOCX diff=astextplain\n#*.dot diff=astextplain\n#*.DOT diff=astextplain\n#*.pdf diff=astextplain\n#*.PDF diff=astextplain\n#*.rtf diff=astextplain\n#*.RTF diff=astextplain\n" }, { "path": ".github/workflows/build.yml", "content": "name: AssetStudioBuild\n\non:\n push:\n branches: [ master ]\n pull_request:\n branches: [ master ]\n\n workflow_dispatch:\n\njobs:\n build:\n runs-on: windows-latest\n\n steps:\n - uses: actions/checkout@v2\n - uses: microsoft/setup-msbuild@v1.1\n \n - name: Download FBX SDK\n run: |\n md fbx\n cd fbx\n Invoke-WebRequest \"https://damassets.autodesk.net/content/dam/autodesk/www/adn/fbx/2020-2-1/fbx202021_fbxsdk_vs2019_win.exe\" -OutFile \"fbxsdk.exe\"\n Start-Process -FilePath \"fbxsdk.exe\" /S -Wait\n Invoke-WebRequest \"https://damassets.autodesk.net/content/dam/autodesk/www/adn/fbx/2020-2-1/fbx202021_fbxsdk_vs2019_pdbs.exe\" -OutFile \"fbxpdb.exe\"\n Start-Process -FilePath \"fbxpdb.exe\" /S -Wait\n cd ..\n\n - name: Nuget Restore\n run: nuget restore\n \n - name: Build .Net472\n run: msbuild /p:Configuration=Release /p:TargetFramework=net472 /verbosity:minimal\n\n - name: Build .Net5\n run: msbuild /t:AssetStudioGUI:publish /p:Configuration=Release /p:TargetFramework=net5.0-windows /p:SelfContained=false /verbosity:minimal\n\n - name: Build .Net6\n run: msbuild /t:AssetStudioGUI:publish /p:Configuration=Release /p:TargetFramework=net6.0-windows /p:SelfContained=false /verbosity:minimal\n\n - name: Upload .Net472 Artifact\n uses: actions/upload-artifact@v2\n with:\n name: AssetStudio.net472\n path: AssetStudioGUI/bin/Release/net472\n\n - name: Upload .Net5 Artifact\n uses: actions/upload-artifact@v2\n with:\n name: AssetStudio.net5\n path: AssetStudioGUI/bin/Release/net5.0-windows/publish\n\n - name: Upload .Net6 Artifact\n uses: actions/upload-artifact@v2\n with:\n name: AssetStudio.net6\n path: AssetStudioGUI/bin/Release/net6.0-windows/publish\n" }, { "path": ".gitignore", "content": "## Ignore Visual Studio temporary files, build results, and\n## files generated by popular Visual Studio add-ons.\n##\n## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore\n\n# User-specific files\n*.rsuser\n*.suo\n*.user\n*.userosscache\n*.sln.docstates\n\n# User-specific files (MonoDevelop/Xamarin Studio)\n*.userprefs\n\n# Build results\n[Dd]ebug/\n[Dd]ebugPublic/\n[Rr]elease/\n[Rr]eleases/\nx64/\nx86/\n[Aa][Rr][Mm]/\n[Aa][Rr][Mm]64/\nbld/\n[Bb]in/\n[Oo]bj/\n[Ll]og/\n\n# Visual Studio 2015/2017 cache/options directory\n.vs/\n# Uncomment if you have tasks that create the project's static files in wwwroot\n#wwwroot/\n\n# Visual Studio 2017 auto generated files\nGenerated\\ Files/\n\n# MSTest test Results\n[Tt]est[Rr]esult*/\n[Bb]uild[Ll]og.*\n\n# NUNIT\n*.VisualState.xml\nTestResult.xml\n\n# Build Results of an ATL Project\n[Dd]ebugPS/\n[Rr]eleasePS/\ndlldata.c\n\n# Benchmark Results\nBenchmarkDotNet.Artifacts/\n\n# .NET Core\nproject.lock.json\nproject.fragment.lock.json\nartifacts/\n\n# StyleCop\nStyleCopReport.xml\n\n# Files built by Visual Studio\n*_i.c\n*_p.c\n*_h.h\n*.ilk\n*.meta\n*.obj\n*.iobj\n*.pch\n*.pdb\n*.ipdb\n*.pgc\n*.pgd\n*.rsp\n*.sbr\n*.tlb\n*.tli\n*.tlh\n*.tmp\n*.tmp_proj\n*_wpftmp.csproj\n*.log\n*.vspscc\n*.vssscc\n.builds\n*.pidb\n*.svclog\n*.scc\n\n# Chutzpah Test files\n_Chutzpah*\n\n# Visual C++ cache files\nipch/\n*.aps\n*.ncb\n*.opendb\n*.opensdf\n*.sdf\n*.cachefile\n*.VC.db\n*.VC.VC.opendb\n\n# Visual Studio profiler\n*.psess\n*.vsp\n*.vspx\n*.sap\n\n# Visual Studio Trace Files\n*.e2e\n\n# TFS 2012 Local Workspace\n$tf/\n\n# Guidance Automation Toolkit\n*.gpState\n\n# ReSharper is a .NET coding add-in\n_ReSharper*/\n*.[Rr]e[Ss]harper\n*.DotSettings.user\n\n# JustCode is a .NET coding add-in\n.JustCode\n\n# TeamCity is a build add-in\n_TeamCity*\n\n# DotCover is a Code Coverage Tool\n*.dotCover\n\n# AxoCover is a Code Coverage Tool\n.axoCover/*\n!.axoCover/settings.json\n\n# Visual Studio code coverage results\n*.coverage\n*.coveragexml\n\n# NCrunch\n_NCrunch_*\n.*crunch*.local.xml\nnCrunchTemp_*\n\n# MightyMoose\n*.mm.*\nAutoTest.Net/\n\n# Web workbench (sass)\n.sass-cache/\n\n# Installshield output folder\n[Ee]xpress/\n\n# DocProject is a documentation generator add-in\nDocProject/buildhelp/\nDocProject/Help/*.HxT\nDocProject/Help/*.HxC\nDocProject/Help/*.hhc\nDocProject/Help/*.hhk\nDocProject/Help/*.hhp\nDocProject/Help/Html2\nDocProject/Help/html\n\n# Click-Once directory\npublish/\n\n# Publish Web Output\n*.[Pp]ublish.xml\n*.azurePubxml\n# Note: Comment the next line if you want to checkin your web deploy settings,\n# but database connection strings (with potential passwords) will be unencrypted\n*.pubxml\n*.publishproj\n\n# Microsoft Azure Web App publish settings. Comment the next line if you want to\n# checkin your Azure Web App publish settings, but sensitive information contained\n# in these scripts will be unencrypted\nPublishScripts/\n\n# NuGet Packages\n*.nupkg\n# The packages folder can be ignored because of Package Restore\n**/[Pp]ackages/*\n# except build/, which is used as an MSBuild target.\n!**/[Pp]ackages/build/\n# Uncomment if necessary however generally it will be regenerated when needed\n#!**/[Pp]ackages/repositories.config\n# NuGet v3's project.json files produces more ignorable files\n*.nuget.props\n*.nuget.targets\n\n# Microsoft Azure Build Output\ncsx/\n*.build.csdef\n\n# Microsoft Azure Emulator\necf/\nrcf/\n\n# Windows Store app package directories and files\nAppPackages/\nBundleArtifacts/\nPackage.StoreAssociation.xml\n_pkginfo.txt\n*.appx\n\n# Visual Studio cache files\n# files ending in .cache can be ignored\n*.[Cc]ache\n# but keep track of directories ending in .cache\n!?*.[Cc]ache/\n\n# Others\nClientBin/\n~$*\n*~\n*.dbmdl\n*.dbproj.schemaview\n*.jfm\n*.pfx\n*.publishsettings\norleans.codegen.cs\n\n# Including strong name files can present a security risk\n# (https://github.com/github/gitignore/pull/2483#issue-259490424)\n#*.snk\n\n# Since there are multiple workflows, uncomment next line to ignore bower_components\n# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)\n#bower_components/\n\n# RIA/Silverlight projects\nGenerated_Code/\n\n# Backup & report files from converting an old project file\n# to a newer Visual Studio version. Backup files are not needed,\n# because we have git ;-)\n_UpgradeReport_Files/\nBackup*/\nUpgradeLog*.XML\nUpgradeLog*.htm\nServiceFabricBackup/\n*.rptproj.bak\n\n# SQL Server files\n*.mdf\n*.ldf\n*.ndf\n\n# Business Intelligence projects\n*.rdl.data\n*.bim.layout\n*.bim_*.settings\n*.rptproj.rsuser\n*- Backup*.rdl\n\n# Microsoft Fakes\nFakesAssemblies/\n\n# GhostDoc plugin setting file\n*.GhostDoc.xml\n\n# Node.js Tools for Visual Studio\n.ntvs_analysis.dat\nnode_modules/\n\n# Visual Studio 6 build log\n*.plg\n\n# Visual Studio 6 workspace options file\n*.opt\n\n# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)\n*.vbw\n\n# Visual Studio LightSwitch build output\n**/*.HTMLClient/GeneratedArtifacts\n**/*.DesktopClient/GeneratedArtifacts\n**/*.DesktopClient/ModelManifest.xml\n**/*.Server/GeneratedArtifacts\n**/*.Server/ModelManifest.xml\n_Pvt_Extensions\n\n# Paket dependency manager\n.paket/paket.exe\npaket-files/\n\n# FAKE - F# Make\n.fake/\n\n# JetBrains Rider\n.idea/\n*.sln.iml\n\n# CodeRush personal settings\n.cr/personal\n\n# Python Tools for Visual Studio (PTVS)\n__pycache__/\n*.pyc\n\n# Cake - Uncomment if you are using it\n# tools/**\n# !tools/packages.config\n\n# Tabs Studio\n*.tss\n\n# Telerik's JustMock configuration file\n*.jmconfig\n\n# BizTalk build output\n*.btp.cs\n*.btm.cs\n*.odx.cs\n*.xsd.cs\n\n# OpenCover UI analysis results\nOpenCover/\n\n# Azure Stream Analytics local run output\nASALocalRun/\n\n# MSBuild Binary and Structured Log\n*.binlog\n\n# NVidia Nsight GPU debugger configuration file\n*.nvuser\n\n# MFractors (Xamarin productivity tool) working folder\n.mfractor/\n\n# Local History for Visual Studio\n.localhistory/\n\n# BeatPulse healthcheck temp database\nhealthchecksdb" }, { "path": "AssetStudio/7zip/Common/CRC.cs", "content": "// Common/CRC.cs\n\nnamespace SevenZip\n{\n\tpublic class CRC\n\t{\n\t\tpublic static readonly uint[] Table;\n\n\t\tstatic CRC()\n\t\t{\n\t\t\tTable = new uint[256];\n\t\t\tconst uint kPoly = 0xEDB88320;\n\t\t\tfor (uint i = 0; i < 256; i++)\n\t\t\t{\n\t\t\t\tuint r = i;\n\t\t\t\tfor (int j = 0; j < 8; j++)\n\t\t\t\t\tif ((r & 1) != 0)\n\t\t\t\t\t\tr = (r >> 1) ^ kPoly;\n\t\t\t\t\telse\n\t\t\t\t\t\tr >>= 1;\n\t\t\t\tTable[i] = r;\n\t\t\t}\n\t\t}\n\n\t\tuint _value = 0xFFFFFFFF;\n\n\t\tpublic void Init() { _value = 0xFFFFFFFF; }\n\n\t\tpublic void UpdateByte(byte b)\n\t\t{\n\t\t\t_value = Table[(((byte)(_value)) ^ b)] ^ (_value >> 8);\n\t\t}\n\n\t\tpublic void Update(byte[] data, uint offset, uint size)\n\t\t{\n\t\t\tfor (uint i = 0; i < size; i++)\n\t\t\t\t_value = Table[(((byte)(_value)) ^ data[offset + i])] ^ (_value >> 8);\n\t\t}\n\n\t\tpublic uint GetDigest() { return _value ^ 0xFFFFFFFF; }\n\n\t\tstatic uint CalculateDigest(byte[] data, uint offset, uint size)\n\t\t{\n\t\t\tCRC crc = new CRC();\n\t\t\t// crc.Init();\n\t\t\tcrc.Update(data, offset, size);\n\t\t\treturn crc.GetDigest();\n\t\t}\n\n\t\tstatic bool VerifyDigest(uint digest, byte[] data, uint offset, uint size)\n\t\t{\n\t\t\treturn (CalculateDigest(data, offset, size) == digest);\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Common/CommandLineParser.cs", "content": "// CommandLineParser.cs\n\nusing System;\nusing System.Collections;\n\nnamespace SevenZip.CommandLineParser\n{\n\tpublic enum SwitchType\n\t{\n\t\tSimple,\n\t\tPostMinus,\n\t\tLimitedPostString,\n\t\tUnLimitedPostString,\n\t\tPostChar\n\t}\n\n\tpublic class SwitchForm\n\t{\n\t\tpublic string IDString;\n\t\tpublic SwitchType Type;\n\t\tpublic bool Multi;\n\t\tpublic int MinLen;\n\t\tpublic int MaxLen;\n\t\tpublic string PostCharSet;\n\n\t\tpublic SwitchForm(string idString, SwitchType type, bool multi,\n\t\t\tint minLen, int maxLen, string postCharSet)\n\t\t{\n\t\t\tIDString = idString;\n\t\t\tType = type;\n\t\t\tMulti = multi;\n\t\t\tMinLen = minLen;\n\t\t\tMaxLen = maxLen;\n\t\t\tPostCharSet = postCharSet;\n\t\t}\n\t\tpublic SwitchForm(string idString, SwitchType type, bool multi, int minLen):\n\t\t\tthis(idString, type, multi, minLen, 0, \"\")\n\t\t{\n\t\t}\n\t\tpublic SwitchForm(string idString, SwitchType type, bool multi):\n\t\t\tthis(idString, type, multi, 0)\n\t\t{\n\t\t}\n\t}\n\n\tpublic class SwitchResult\n\t{\n\t\tpublic bool ThereIs;\n\t\tpublic bool WithMinus;\n\t\tpublic ArrayList PostStrings = new ArrayList();\n\t\tpublic int PostCharIndex;\n\t\tpublic SwitchResult()\n\t\t{\n\t\t\tThereIs = false;\n\t\t}\n\t}\n\n\tpublic class Parser\n\t{\n\t\tpublic ArrayList NonSwitchStrings = new ArrayList();\n\t\tSwitchResult[] _switches;\n\n\t\tpublic Parser(int numSwitches)\n\t\t{\n\t\t\t_switches = new SwitchResult[numSwitches];\n\t\t\tfor (int i = 0; i < numSwitches; i++)\n\t\t\t\t_switches[i] = new SwitchResult();\n\t\t}\n\n\t\tbool ParseString(string srcString, SwitchForm[] switchForms)\n\t\t{\n\t\t\tint len = srcString.Length;\n\t\t\tif (len == 0)\n\t\t\t\treturn false;\n\t\t\tint pos = 0;\n\t\t\tif (!IsItSwitchChar(srcString[pos]))\n\t\t\t\treturn false;\n\t\t\twhile (pos < len)\n\t\t\t{\n\t\t\t\tif (IsItSwitchChar(srcString[pos]))\n\t\t\t\t\tpos++;\n\t\t\t\tconst int kNoLen = -1;\n\t\t\t\tint matchedSwitchIndex = 0;\n\t\t\t\tint maxLen = kNoLen;\n\t\t\t\tfor (int switchIndex = 0; switchIndex < _switches.Length; switchIndex++)\n\t\t\t\t{\n\t\t\t\t\tint switchLen = switchForms[switchIndex].IDString.Length;\n\t\t\t\t\tif (switchLen <= maxLen || pos + switchLen > len)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tif (String.Compare(switchForms[switchIndex].IDString, 0,\n\t\t\t\t\t\t\tsrcString, pos, switchLen, true) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tmatchedSwitchIndex = switchIndex;\n\t\t\t\t\t\tmaxLen = switchLen;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (maxLen == kNoLen)\n\t\t\t\t\tthrow new Exception(\"maxLen == kNoLen\");\n\t\t\t\tSwitchResult matchedSwitch = _switches[matchedSwitchIndex];\n\t\t\t\tSwitchForm switchForm = switchForms[matchedSwitchIndex];\n\t\t\t\tif ((!switchForm.Multi) && matchedSwitch.ThereIs)\n\t\t\t\t\tthrow new Exception(\"switch must be single\");\n\t\t\t\tmatchedSwitch.ThereIs = true;\n\t\t\t\tpos += maxLen;\n\t\t\t\tint tailSize = len - pos;\n\t\t\t\tSwitchType type = switchForm.Type;\n\t\t\t\tswitch (type)\n\t\t\t\t{\n\t\t\t\t\tcase SwitchType.PostMinus:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (tailSize == 0)\n\t\t\t\t\t\t\t\tmatchedSwitch.WithMinus = false;\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmatchedSwitch.WithMinus = (srcString[pos] == kSwitchMinus);\n\t\t\t\t\t\t\t\tif (matchedSwitch.WithMinus)\n\t\t\t\t\t\t\t\t\tpos++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\tcase SwitchType.PostChar:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (tailSize < switchForm.MinLen)\n\t\t\t\t\t\t\t\tthrow new Exception(\"switch is not full\");\n\t\t\t\t\t\t\tstring charSet = switchForm.PostCharSet;\n\t\t\t\t\t\t\tconst int kEmptyCharValue = -1;\n\t\t\t\t\t\t\tif (tailSize == 0)\n\t\t\t\t\t\t\t\tmatchedSwitch.PostCharIndex = kEmptyCharValue;\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tint index = charSet.IndexOf(srcString[pos]);\n\t\t\t\t\t\t\t\tif (index < 0)\n\t\t\t\t\t\t\t\t\tmatchedSwitch.PostCharIndex = kEmptyCharValue;\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tmatchedSwitch.PostCharIndex = index;\n\t\t\t\t\t\t\t\t\tpos++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\tcase SwitchType.LimitedPostString:\n\t\t\t\t\tcase SwitchType.UnLimitedPostString:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint minLen = switchForm.MinLen;\n\t\t\t\t\t\t\tif (tailSize < minLen)\n\t\t\t\t\t\t\t\tthrow new Exception(\"switch is not full\");\n\t\t\t\t\t\t\tif (type == SwitchType.UnLimitedPostString)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tmatchedSwitch.PostStrings.Add(srcString.Substring(pos));\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tString stringSwitch = srcString.Substring(pos, minLen);\n\t\t\t\t\t\t\tpos += minLen;\n\t\t\t\t\t\t\tfor (int i = minLen; i < switchForm.MaxLen && pos < len; i++, pos++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tchar c = srcString[pos];\n\t\t\t\t\t\t\t\tif (IsItSwitchChar(c))\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tstringSwitch += c;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmatchedSwitch.PostStrings.Add(stringSwitch);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\n\t\t}\n\n\t\tpublic void ParseStrings(SwitchForm[] switchForms, string[] commandStrings)\n\t\t{\n\t\t\tint numCommandStrings = commandStrings.Length;\n\t\t\tbool stopSwitch = false;\n\t\t\tfor (int i = 0; i < numCommandStrings; i++)\n\t\t\t{\n\t\t\t\tstring s = commandStrings[i];\n\t\t\t\tif (stopSwitch)\n\t\t\t\t\tNonSwitchStrings.Add(s);\n\t\t\t\telse\n\t\t\t\t\tif (s == kStopSwitchParsing)\n\t\t\t\t\tstopSwitch = true;\n\t\t\t\telse\n\t\t\t\t\tif (!ParseString(s, switchForms))\n\t\t\t\t\tNonSwitchStrings.Add(s);\n\t\t\t}\n\t\t}\n\n\t\tpublic SwitchResult this[int index] { get { return _switches[index]; } }\n\n\t\tpublic static int ParseCommand(CommandForm[] commandForms, string commandString,\n\t\t\tout string postString)\n\t\t{\n\t\t\tfor (int i = 0; i < commandForms.Length; i++)\n\t\t\t{\n\t\t\t\tstring id = commandForms[i].IDString;\n\t\t\t\tif (commandForms[i].PostStringMode)\n\t\t\t\t{\n\t\t\t\t\tif (commandString.IndexOf(id) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tpostString = commandString.Substring(id.Length);\n\t\t\t\t\t\treturn i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tif (commandString == id)\n\t\t\t\t{\n\t\t\t\t\tpostString = \"\";\n\t\t\t\t\treturn i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tpostString = \"\";\n\t\t\treturn -1;\n\t\t}\n\n\t\tstatic bool ParseSubCharsCommand(int numForms, CommandSubCharsSet[] forms,\n\t\t\tstring commandString, ArrayList indices)\n\t\t{\n\t\t\tindices.Clear();\n\t\t\tint numUsedChars = 0;\n\t\t\tfor (int i = 0; i < numForms; i++)\n\t\t\t{\n\t\t\t\tCommandSubCharsSet charsSet = forms[i];\n\t\t\t\tint currentIndex = -1;\n\t\t\t\tint len = charsSet.Chars.Length;\n\t\t\t\tfor (int j = 0; j < len; j++)\n\t\t\t\t{\n\t\t\t\t\tchar c = charsSet.Chars[j];\n\t\t\t\t\tint newIndex = commandString.IndexOf(c);\n\t\t\t\t\tif (newIndex >= 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (currentIndex >= 0)\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\tif (commandString.IndexOf(c, newIndex + 1) >= 0)\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\tcurrentIndex = j;\n\t\t\t\t\t\tnumUsedChars++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (currentIndex == -1 && !charsSet.EmptyAllowed)\n\t\t\t\t\treturn false;\n\t\t\t\tindices.Add(currentIndex);\n\t\t\t}\n\t\t\treturn (numUsedChars == commandString.Length);\n\t\t}\n\t\tconst char kSwitchID1 = '-';\n\t\tconst char kSwitchID2 = '/';\n\n\t\tconst char kSwitchMinus = '-';\n\t\tconst string kStopSwitchParsing = \"--\";\n\n\t\tstatic bool IsItSwitchChar(char c)\n\t\t{\n\t\t\treturn (c == kSwitchID1 || c == kSwitchID2);\n\t\t}\n\t}\n\n\tpublic class CommandForm\n\t{\n\t\tpublic string IDString = \"\";\n\t\tpublic bool PostStringMode = false;\n\t\tpublic CommandForm(string idString, bool postStringMode)\n\t\t{\n\t\t\tIDString = idString;\n\t\t\tPostStringMode = postStringMode;\n\t\t}\n\t}\n\n\tclass CommandSubCharsSet\n\t{\n\t\tpublic string Chars = \"\";\n\t\tpublic bool EmptyAllowed = false;\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Common/InBuffer.cs", "content": "// InBuffer.cs\n\nnamespace SevenZip.Buffer\n{\n\tpublic class InBuffer\n\t{\n\t\tbyte[] m_Buffer;\n\t\tuint m_Pos;\n\t\tuint m_Limit;\n\t\tuint m_BufferSize;\n\t\tSystem.IO.Stream m_Stream;\n\t\tbool m_StreamWasExhausted;\n\t\tulong m_ProcessedSize;\n\n\t\tpublic InBuffer(uint bufferSize)\n\t\t{\n\t\t\tm_Buffer = new byte[bufferSize];\n\t\t\tm_BufferSize = bufferSize;\n\t\t}\n\n\t\tpublic void Init(System.IO.Stream stream)\n\t\t{\n\t\t\tm_Stream = stream;\n\t\t\tm_ProcessedSize = 0;\n\t\t\tm_Limit = 0;\n\t\t\tm_Pos = 0;\n\t\t\tm_StreamWasExhausted = false;\n\t\t}\n\n\t\tpublic bool ReadBlock()\n\t\t{\n\t\t\tif (m_StreamWasExhausted)\n\t\t\t\treturn false;\n\t\t\tm_ProcessedSize += m_Pos;\n\t\t\tint aNumProcessedBytes = m_Stream.Read(m_Buffer, 0, (int)m_BufferSize);\n\t\t\tm_Pos = 0;\n\t\t\tm_Limit = (uint)aNumProcessedBytes;\n\t\t\tm_StreamWasExhausted = (aNumProcessedBytes == 0);\n\t\t\treturn (!m_StreamWasExhausted);\n\t\t}\n\n\n\t\tpublic void ReleaseStream()\n\t\t{\n\t\t\t// m_Stream.Close(); \n\t\t\tm_Stream = null;\n\t\t}\n\n\t\tpublic bool ReadByte(byte b) // check it\n\t\t{\n\t\t\tif (m_Pos >= m_Limit)\n\t\t\t\tif (!ReadBlock())\n\t\t\t\t\treturn false;\n\t\t\tb = m_Buffer[m_Pos++];\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic byte ReadByte()\n\t\t{\n\t\t\t// return (byte)m_Stream.ReadByte();\n\t\t\tif (m_Pos >= m_Limit)\n\t\t\t\tif (!ReadBlock())\n\t\t\t\t\treturn 0xFF;\n\t\t\treturn m_Buffer[m_Pos++];\n\t\t}\n\n\t\tpublic ulong GetProcessedSize()\n\t\t{\n\t\t\treturn m_ProcessedSize + m_Pos;\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Common/OutBuffer.cs", "content": "// OutBuffer.cs\n\nnamespace SevenZip.Buffer\n{\n\tpublic class OutBuffer\n\t{\n\t\tbyte[] m_Buffer;\n\t\tuint m_Pos;\n\t\tuint m_BufferSize;\n\t\tSystem.IO.Stream m_Stream;\n\t\tulong m_ProcessedSize;\n\n\t\tpublic OutBuffer(uint bufferSize)\n\t\t{\n\t\t\tm_Buffer = new byte[bufferSize];\n\t\t\tm_BufferSize = bufferSize;\n\t\t}\n\n\t\tpublic void SetStream(System.IO.Stream stream) { m_Stream = stream; }\n\t\tpublic void FlushStream() { m_Stream.Flush(); }\n\t\tpublic void CloseStream() { m_Stream.Close(); }\n\t\tpublic void ReleaseStream() { m_Stream = null; }\n\n\t\tpublic void Init()\n\t\t{\n\t\t\tm_ProcessedSize = 0;\n\t\t\tm_Pos = 0;\n\t\t}\n\n\t\tpublic void WriteByte(byte b)\n\t\t{\n\t\t\tm_Buffer[m_Pos++] = b;\n\t\t\tif (m_Pos >= m_BufferSize)\n\t\t\t\tFlushData();\n\t\t}\n\n\t\tpublic void FlushData()\n\t\t{\n\t\t\tif (m_Pos == 0)\n\t\t\t\treturn;\n\t\t\tm_Stream.Write(m_Buffer, 0, (int)m_Pos);\n\t\t\tm_Pos = 0;\n\t\t}\n\n\t\tpublic ulong GetProcessedSize() { return m_ProcessedSize + m_Pos; }\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZ/IMatchFinder.cs", "content": "// IMatchFinder.cs\n\nusing System;\n\nnamespace SevenZip.Compression.LZ\n{\n\tinterface IInWindowStream\n\t{\n\t\tvoid SetStream(System.IO.Stream inStream);\n\t\tvoid Init();\n\t\tvoid ReleaseStream();\n\t\tByte GetIndexByte(Int32 index);\n\t\tUInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit);\n\t\tUInt32 GetNumAvailableBytes();\n\t}\n\n\tinterface IMatchFinder : IInWindowStream\n\t{\n\t\tvoid Create(UInt32 historySize, UInt32 keepAddBufferBefore,\n\t\t\t\tUInt32 matchMaxLen, UInt32 keepAddBufferAfter);\n\t\tUInt32 GetMatches(UInt32[] distances);\n\t\tvoid Skip(UInt32 num);\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZ/LzBinTree.cs", "content": "// LzBinTree.cs\n\nusing System;\n\nnamespace SevenZip.Compression.LZ\n{\n\tpublic class BinTree : InWindow, IMatchFinder\n\t{\n\t\tUInt32 _cyclicBufferPos;\n\t\tUInt32 _cyclicBufferSize = 0;\n\t\tUInt32 _matchMaxLen;\n\n\t\tUInt32[] _son;\n\t\tUInt32[] _hash;\n\n\t\tUInt32 _cutValue = 0xFF;\n\t\tUInt32 _hashMask;\n\t\tUInt32 _hashSizeSum = 0;\n\n\t\tbool HASH_ARRAY = true;\n\n\t\tconst UInt32 kHash2Size = 1 << 10;\n\t\tconst UInt32 kHash3Size = 1 << 16;\n\t\tconst UInt32 kBT2HashSize = 1 << 16;\n\t\tconst UInt32 kStartMaxLen = 1;\n\t\tconst UInt32 kHash3Offset = kHash2Size;\n\t\tconst UInt32 kEmptyHashValue = 0;\n\t\tconst UInt32 kMaxValForNormalize = ((UInt32)1 << 31) - 1;\n\t\n\t\tUInt32 kNumHashDirectBytes = 0;\n\t\tUInt32 kMinMatchCheck = 4;\n\t\tUInt32 kFixHashSize = kHash2Size + kHash3Size;\n\t\t\n\t\tpublic void SetType(int numHashBytes)\n\t\t{\n\t\t\tHASH_ARRAY = (numHashBytes > 2);\n\t\t\tif (HASH_ARRAY)\n\t\t\t{\n\t\t\t\tkNumHashDirectBytes = 0;\n\t\t\t\tkMinMatchCheck = 4;\n\t\t\t\tkFixHashSize = kHash2Size + kHash3Size;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tkNumHashDirectBytes = 2;\n\t\t\t\tkMinMatchCheck = 2 + 1;\n\t\t\t\tkFixHashSize = 0;\n\t\t\t}\n\t\t}\n\n\t\tpublic new void SetStream(System.IO.Stream stream) { base.SetStream(stream); }\n\t\tpublic new void ReleaseStream() { base.ReleaseStream(); }\n\t\t\n\t\tpublic new void Init()\n\t\t{\n\t\t\tbase.Init();\n\t\t\tfor (UInt32 i = 0; i < _hashSizeSum; i++)\n\t\t\t\t_hash[i] = kEmptyHashValue;\n\t\t\t_cyclicBufferPos = 0;\n\t\t\tReduceOffsets(-1);\n\t\t}\n\n\t\tpublic new void MovePos()\n\t\t{\n\t\t\tif (++_cyclicBufferPos >= _cyclicBufferSize)\n\t\t\t\t_cyclicBufferPos = 0;\n\t\t\tbase.MovePos();\n\t\t\tif (_pos == kMaxValForNormalize)\n\t\t\t\tNormalize();\n\t\t}\n\n\t\tpublic new Byte GetIndexByte(Int32 index) { return base.GetIndexByte(index); }\n\n\t\tpublic new UInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit)\n\t\t{ return base.GetMatchLen(index, distance, limit); }\n\n\t\tpublic new UInt32 GetNumAvailableBytes() { return base.GetNumAvailableBytes(); }\n\n\t\tpublic void Create(UInt32 historySize, UInt32 keepAddBufferBefore,\n\t\t\t\tUInt32 matchMaxLen, UInt32 keepAddBufferAfter)\n\t\t{\n\t\t\tif (historySize > kMaxValForNormalize - 256)\n\t\t\t\tthrow new Exception();\n\t\t\t_cutValue = 16 + (matchMaxLen >> 1);\n\t\t\t\t\n\t\t\tUInt32 windowReservSize = (historySize + keepAddBufferBefore +\n\t\t\t\t\tmatchMaxLen + keepAddBufferAfter) / 2 + 256;\n\n\t\t\tbase.Create(historySize + keepAddBufferBefore, matchMaxLen + keepAddBufferAfter, windowReservSize);\n\n\t\t\t_matchMaxLen = matchMaxLen;\n\n\t\t\tUInt32 cyclicBufferSize = historySize + 1;\n\t\t\tif (_cyclicBufferSize != cyclicBufferSize)\n\t\t\t\t_son = new UInt32[(_cyclicBufferSize = cyclicBufferSize) * 2];\n\n\t\t\tUInt32 hs = kBT2HashSize;\n\n\t\t\tif (HASH_ARRAY)\n\t\t\t{\n\t\t\t\ths = historySize - 1;\n\t\t\t\ths |= (hs >> 1);\n\t\t\t\ths |= (hs >> 2);\n\t\t\t\ths |= (hs >> 4);\n\t\t\t\ths |= (hs >> 8);\n\t\t\t\ths >>= 1;\n\t\t\t\ths |= 0xFFFF;\n\t\t\t\tif (hs > (1 << 24))\n\t\t\t\t\ths >>= 1;\n\t\t\t\t_hashMask = hs;\n\t\t\t\ths++;\n\t\t\t\ths += kFixHashSize;\n\t\t\t}\n\t\t\tif (hs != _hashSizeSum)\n\t\t\t\t_hash = new UInt32[_hashSizeSum = hs];\n\t\t}\n\n\t\tpublic UInt32 GetMatches(UInt32[] distances)\n\t\t{\n\t\t\tUInt32 lenLimit;\n\t\t\tif (_pos + _matchMaxLen <= _streamPos)\n\t\t\t\tlenLimit = _matchMaxLen;\n\t\t\telse\n\t\t\t{\n\t\t\t\tlenLimit = _streamPos - _pos;\n\t\t\t\tif (lenLimit < kMinMatchCheck)\n\t\t\t\t{\n\t\t\t\t\tMovePos();\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tUInt32 offset = 0;\n\t\t\tUInt32 matchMinPos = (_pos > _cyclicBufferSize) ? (_pos - _cyclicBufferSize) : 0;\n\t\t\tUInt32 cur = _bufferOffset + _pos;\n\t\t\tUInt32 maxLen = kStartMaxLen; // to avoid items for len < hashSize;\n\t\t\tUInt32 hashValue, hash2Value = 0, hash3Value = 0;\n\n\t\t\tif (HASH_ARRAY)\n\t\t\t{\n\t\t\t\tUInt32 temp = CRC.Table[_bufferBase[cur]] ^ _bufferBase[cur + 1];\n\t\t\t\thash2Value = temp & (kHash2Size - 1);\n\t\t\t\ttemp ^= ((UInt32)(_bufferBase[cur + 2]) << 8);\n\t\t\t\thash3Value = temp & (kHash3Size - 1);\n\t\t\t\thashValue = (temp ^ (CRC.Table[_bufferBase[cur + 3]] << 5)) & _hashMask;\n\t\t\t}\n\t\t\telse\n\t\t\t\thashValue = _bufferBase[cur] ^ ((UInt32)(_bufferBase[cur + 1]) << 8);\n\n\t\t\tUInt32 curMatch = _hash[kFixHashSize + hashValue];\n\t\t\tif (HASH_ARRAY)\n\t\t\t{\n\t\t\t\tUInt32 curMatch2 = _hash[hash2Value];\n\t\t\t\tUInt32 curMatch3 = _hash[kHash3Offset + hash3Value];\n\t\t\t\t_hash[hash2Value] = _pos;\n\t\t\t\t_hash[kHash3Offset + hash3Value] = _pos;\n\t\t\t\tif (curMatch2 > matchMinPos)\n\t\t\t\t\tif (_bufferBase[_bufferOffset + curMatch2] == _bufferBase[cur])\n\t\t\t\t\t{\n\t\t\t\t\t\tdistances[offset++] = maxLen = 2;\n\t\t\t\t\t\tdistances[offset++] = _pos - curMatch2 - 1;\n\t\t\t\t\t}\n\t\t\t\tif (curMatch3 > matchMinPos)\n\t\t\t\t\tif (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur])\n\t\t\t\t\t{\n\t\t\t\t\t\tif (curMatch3 == curMatch2)\n\t\t\t\t\t\t\toffset -= 2;\n\t\t\t\t\t\tdistances[offset++] = maxLen = 3;\n\t\t\t\t\t\tdistances[offset++] = _pos - curMatch3 - 1;\n\t\t\t\t\t\tcurMatch2 = curMatch3;\n\t\t\t\t\t}\n\t\t\t\tif (offset != 0 && curMatch2 == curMatch)\n\t\t\t\t{\n\t\t\t\t\toffset -= 2;\n\t\t\t\t\tmaxLen = kStartMaxLen;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t_hash[kFixHashSize + hashValue] = _pos;\n\n\t\t\tUInt32 ptr0 = (_cyclicBufferPos << 1) + 1;\n\t\t\tUInt32 ptr1 = (_cyclicBufferPos << 1);\n\n\t\t\tUInt32 len0, len1;\n\t\t\tlen0 = len1 = kNumHashDirectBytes;\n\t\t\t\n\t\t\tif (kNumHashDirectBytes != 0)\n\t\t\t{\n\t\t\t\tif (curMatch > matchMinPos)\n\t\t\t\t{\n\t\t\t\t\tif (_bufferBase[_bufferOffset + curMatch + kNumHashDirectBytes] !=\n\t\t\t\t\t\t\t_bufferBase[cur + kNumHashDirectBytes])\n\t\t\t\t\t{\n\t\t\t\t\t\tdistances[offset++] = maxLen = kNumHashDirectBytes;\n\t\t\t\t\t\tdistances[offset++] = _pos - curMatch - 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tUInt32 count = _cutValue;\n\t\t\t\n\t\t\twhile(true)\n\t\t\t{\n\t\t\t\tif(curMatch <= matchMinPos || count-- == 0)\n\t\t\t\t{\n\t\t\t\t\t_son[ptr0] = _son[ptr1] = kEmptyHashValue;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tUInt32 delta = _pos - curMatch;\n\t\t\t\tUInt32 cyclicPos = ((delta <= _cyclicBufferPos) ?\n\t\t\t\t\t\t\t(_cyclicBufferPos - delta) :\n\t\t\t\t\t\t\t(_cyclicBufferPos - delta + _cyclicBufferSize)) << 1;\n\n\t\t\t\tUInt32 pby1 = _bufferOffset + curMatch;\n\t\t\t\tUInt32 len = Math.Min(len0, len1);\n\t\t\t\tif (_bufferBase[pby1 + len] == _bufferBase[cur + len])\n\t\t\t\t{\n\t\t\t\t\twhile(++len != lenLimit)\n\t\t\t\t\t\tif (_bufferBase[pby1 + len] != _bufferBase[cur + len])\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\tif (maxLen < len)\n\t\t\t\t\t{\n\t\t\t\t\t\tdistances[offset++] = maxLen = len;\n\t\t\t\t\t\tdistances[offset++] = delta - 1;\n\t\t\t\t\t\tif (len == lenLimit)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_son[ptr1] = _son[cyclicPos];\n\t\t\t\t\t\t\t_son[ptr0] = _son[cyclicPos + 1];\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (_bufferBase[pby1 + len] < _bufferBase[cur + len])\n\t\t\t\t{\n\t\t\t\t\t_son[ptr1] = curMatch;\n\t\t\t\t\tptr1 = cyclicPos + 1;\n\t\t\t\t\tcurMatch = _son[ptr1];\n\t\t\t\t\tlen1 = len;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t_son[ptr0] = curMatch;\n\t\t\t\t\tptr0 = cyclicPos;\n\t\t\t\t\tcurMatch = _son[ptr0];\n\t\t\t\t\tlen0 = len;\n\t\t\t\t}\n\t\t\t}\n\t\t\tMovePos();\n\t\t\treturn offset;\n\t\t}\n\n\t\tpublic void Skip(UInt32 num)\n\t\t{\n\t\t\tdo\n\t\t\t{\n\t\t\t\tUInt32 lenLimit;\n\t\t\t\tif (_pos + _matchMaxLen <= _streamPos)\n\t\t\t\t\tlenLimit = _matchMaxLen;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tlenLimit = _streamPos - _pos;\n\t\t\t\t\tif (lenLimit < kMinMatchCheck)\n\t\t\t\t\t{\n\t\t\t\t\t\tMovePos();\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tUInt32 matchMinPos = (_pos > _cyclicBufferSize) ? (_pos - _cyclicBufferSize) : 0;\n\t\t\t\tUInt32 cur = _bufferOffset + _pos;\n\n\t\t\t\tUInt32 hashValue;\n\n\t\t\t\tif (HASH_ARRAY)\n\t\t\t\t{\n\t\t\t\t\tUInt32 temp = CRC.Table[_bufferBase[cur]] ^ _bufferBase[cur + 1];\n\t\t\t\t\tUInt32 hash2Value = temp & (kHash2Size - 1);\n\t\t\t\t\t_hash[hash2Value] = _pos;\n\t\t\t\t\ttemp ^= ((UInt32)(_bufferBase[cur + 2]) << 8);\n\t\t\t\t\tUInt32 hash3Value = temp & (kHash3Size - 1);\n\t\t\t\t\t_hash[kHash3Offset + hash3Value] = _pos;\n\t\t\t\t\thashValue = (temp ^ (CRC.Table[_bufferBase[cur + 3]] << 5)) & _hashMask;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\thashValue = _bufferBase[cur] ^ ((UInt32)(_bufferBase[cur + 1]) << 8);\n\n\t\t\t\tUInt32 curMatch = _hash[kFixHashSize + hashValue];\n\t\t\t\t_hash[kFixHashSize + hashValue] = _pos;\n\n\t\t\t\tUInt32 ptr0 = (_cyclicBufferPos << 1) + 1;\n\t\t\t\tUInt32 ptr1 = (_cyclicBufferPos << 1);\n\n\t\t\t\tUInt32 len0, len1;\n\t\t\t\tlen0 = len1 = kNumHashDirectBytes;\n\n\t\t\t\tUInt32 count = _cutValue;\n\t\t\t\twhile (true)\n\t\t\t\t{\n\t\t\t\t\tif (curMatch <= matchMinPos || count-- == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\t_son[ptr0] = _son[ptr1] = kEmptyHashValue;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tUInt32 delta = _pos - curMatch;\n\t\t\t\t\tUInt32 cyclicPos = ((delta <= _cyclicBufferPos) ?\n\t\t\t\t\t\t\t\t(_cyclicBufferPos - delta) :\n\t\t\t\t\t\t\t\t(_cyclicBufferPos - delta + _cyclicBufferSize)) << 1;\n\n\t\t\t\t\tUInt32 pby1 = _bufferOffset + curMatch;\n\t\t\t\t\tUInt32 len = Math.Min(len0, len1);\n\t\t\t\t\tif (_bufferBase[pby1 + len] == _bufferBase[cur + len])\n\t\t\t\t\t{\n\t\t\t\t\t\twhile (++len != lenLimit)\n\t\t\t\t\t\t\tif (_bufferBase[pby1 + len] != _bufferBase[cur + len])\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tif (len == lenLimit)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_son[ptr1] = _son[cyclicPos];\n\t\t\t\t\t\t\t_son[ptr0] = _son[cyclicPos + 1];\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (_bufferBase[pby1 + len] < _bufferBase[cur + len])\n\t\t\t\t\t{\n\t\t\t\t\t\t_son[ptr1] = curMatch;\n\t\t\t\t\t\tptr1 = cyclicPos + 1;\n\t\t\t\t\t\tcurMatch = _son[ptr1];\n\t\t\t\t\t\tlen1 = len;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t_son[ptr0] = curMatch;\n\t\t\t\t\t\tptr0 = cyclicPos;\n\t\t\t\t\t\tcurMatch = _son[ptr0];\n\t\t\t\t\t\tlen0 = len;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tMovePos();\n\t\t\t}\n\t\t\twhile (--num != 0);\n\t\t}\n\n\t\tvoid NormalizeLinks(UInt32[] items, UInt32 numItems, UInt32 subValue)\n\t\t{\n\t\t\tfor (UInt32 i = 0; i < numItems; i++)\n\t\t\t{\n\t\t\t\tUInt32 value = items[i];\n\t\t\t\tif (value <= subValue)\n\t\t\t\t\tvalue = kEmptyHashValue;\n\t\t\t\telse\n\t\t\t\t\tvalue -= subValue;\n\t\t\t\titems[i] = value;\n\t\t\t}\n\t\t}\n\n\t\tvoid Normalize()\n\t\t{\n\t\t\tUInt32 subValue = _pos - _cyclicBufferSize;\n\t\t\tNormalizeLinks(_son, _cyclicBufferSize * 2, subValue);\n\t\t\tNormalizeLinks(_hash, _hashSizeSum, subValue);\n\t\t\tReduceOffsets((Int32)subValue);\n\t\t}\n\n\t\tpublic void SetCutValue(UInt32 cutValue) { _cutValue = cutValue; }\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZ/LzInWindow.cs", "content": "// LzInWindow.cs\n\nusing System;\n\nnamespace SevenZip.Compression.LZ\n{\n\tpublic class InWindow\n\t{\n\t\tpublic Byte[] _bufferBase = null; // pointer to buffer with data\n\t\tSystem.IO.Stream _stream;\n\t\tUInt32 _posLimit; // offset (from _buffer) of first byte when new block reading must be done\n\t\tbool _streamEndWasReached; // if (true) then _streamPos shows real end of stream\n\n\t\tUInt32 _pointerToLastSafePosition;\n\n\t\tpublic UInt32 _bufferOffset;\n\n\t\tpublic UInt32 _blockSize; // Size of Allocated memory block\n\t\tpublic UInt32 _pos; // offset (from _buffer) of curent byte\n\t\tUInt32 _keepSizeBefore; // how many BYTEs must be kept in buffer before _pos\n\t\tUInt32 _keepSizeAfter; // how many BYTEs must be kept buffer after _pos\n\t\tpublic UInt32 _streamPos; // offset (from _buffer) of first not read byte from Stream\n\n\t\tpublic void MoveBlock()\n\t\t{\n\t\t\tUInt32 offset = (UInt32)(_bufferOffset) + _pos - _keepSizeBefore;\n\t\t\t// we need one additional byte, since MovePos moves on 1 byte.\n\t\t\tif (offset > 0)\n\t\t\t\toffset--;\n\t\t\t\n\t\t\tUInt32 numBytes = (UInt32)(_bufferOffset) + _streamPos - offset;\n\n\t\t\t// check negative offset ????\n\t\t\tfor (UInt32 i = 0; i < numBytes; i++)\n\t\t\t\t_bufferBase[i] = _bufferBase[offset + i];\n\t\t\t_bufferOffset -= offset;\n\t\t}\n\n\t\tpublic virtual void ReadBlock()\n\t\t{\n\t\t\tif (_streamEndWasReached)\n\t\t\t\treturn;\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tint size = (int)((0 - _bufferOffset) + _blockSize - _streamPos);\n\t\t\t\tif (size == 0)\n\t\t\t\t\treturn;\n\t\t\t\tint numReadBytes = _stream.Read(_bufferBase, (int)(_bufferOffset + _streamPos), size);\n\t\t\t\tif (numReadBytes == 0)\n\t\t\t\t{\n\t\t\t\t\t_posLimit = _streamPos;\n\t\t\t\t\tUInt32 pointerToPostion = _bufferOffset + _posLimit;\n\t\t\t\t\tif (pointerToPostion > _pointerToLastSafePosition)\n\t\t\t\t\t\t_posLimit = (UInt32)(_pointerToLastSafePosition - _bufferOffset);\n\n\t\t\t\t\t_streamEndWasReached = true;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t_streamPos += (UInt32)numReadBytes;\n\t\t\t\tif (_streamPos >= _pos + _keepSizeAfter)\n\t\t\t\t\t_posLimit = _streamPos - _keepSizeAfter;\n\t\t\t}\n\t\t}\n\n\t\tvoid Free() { _bufferBase = null; }\n\n\t\tpublic void Create(UInt32 keepSizeBefore, UInt32 keepSizeAfter, UInt32 keepSizeReserv)\n\t\t{\n\t\t\t_keepSizeBefore = keepSizeBefore;\n\t\t\t_keepSizeAfter = keepSizeAfter;\n\t\t\tUInt32 blockSize = keepSizeBefore + keepSizeAfter + keepSizeReserv;\n\t\t\tif (_bufferBase == null || _blockSize != blockSize)\n\t\t\t{\n\t\t\t\tFree();\n\t\t\t\t_blockSize = blockSize;\n\t\t\t\t_bufferBase = new Byte[_blockSize];\n\t\t\t}\n\t\t\t_pointerToLastSafePosition = _blockSize - keepSizeAfter;\n\t\t}\n\n\t\tpublic void SetStream(System.IO.Stream stream) { _stream = stream; }\n\t\tpublic void ReleaseStream() { _stream = null; }\n\n\t\tpublic void Init()\n\t\t{\n\t\t\t_bufferOffset = 0;\n\t\t\t_pos = 0;\n\t\t\t_streamPos = 0;\n\t\t\t_streamEndWasReached = false;\n\t\t\tReadBlock();\n\t\t}\n\n\t\tpublic void MovePos()\n\t\t{\n\t\t\t_pos++;\n\t\t\tif (_pos > _posLimit)\n\t\t\t{\n\t\t\t\tUInt32 pointerToPostion = _bufferOffset + _pos;\n\t\t\t\tif (pointerToPostion > _pointerToLastSafePosition)\n\t\t\t\t\tMoveBlock();\n\t\t\t\tReadBlock();\n\t\t\t}\n\t\t}\n\n\t\tpublic Byte GetIndexByte(Int32 index) { return _bufferBase[_bufferOffset + _pos + index]; }\n\n\t\t// index + limit have not to exceed _keepSizeAfter;\n\t\tpublic UInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit)\n\t\t{\n\t\t\tif (_streamEndWasReached)\n\t\t\t\tif ((_pos + index) + limit > _streamPos)\n\t\t\t\t\tlimit = _streamPos - (UInt32)(_pos + index);\n\t\t\tdistance++;\n\t\t\t// Byte *pby = _buffer + (size_t)_pos + index;\n\t\t\tUInt32 pby = _bufferOffset + _pos + (UInt32)index;\n\n\t\t\tUInt32 i;\n\t\t\tfor (i = 0; i < limit && _bufferBase[pby + i] == _bufferBase[pby + i - distance]; i++);\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic UInt32 GetNumAvailableBytes() { return _streamPos - _pos; }\n\n\t\tpublic void ReduceOffsets(Int32 subValue)\n\t\t{\n\t\t\t_bufferOffset += (UInt32)subValue;\n\t\t\t_posLimit -= (UInt32)subValue;\n\t\t\t_pos -= (UInt32)subValue;\n\t\t\t_streamPos -= (UInt32)subValue;\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZ/LzOutWindow.cs", "content": "// LzOutWindow.cs\n\nnamespace SevenZip.Compression.LZ\n{\n\tpublic class OutWindow\n\t{\n\t\tbyte[] _buffer = null;\n\t\tuint _pos;\n\t\tuint _windowSize = 0;\n\t\tuint _streamPos;\n\t\tSystem.IO.Stream _stream;\n\n\t\tpublic uint TrainSize = 0;\n\n\t\tpublic void Create(uint windowSize)\n\t\t{\n\t\t\tif (_windowSize != windowSize)\n\t\t\t{\n\t\t\t\t// System.GC.Collect();\n\t\t\t\t_buffer = new byte[windowSize];\n\t\t\t}\n\t\t\t_windowSize = windowSize;\n\t\t\t_pos = 0;\n\t\t\t_streamPos = 0;\n\t\t}\n\n\t\tpublic void Init(System.IO.Stream stream, bool solid)\n\t\t{\n\t\t\tReleaseStream();\n\t\t\t_stream = stream;\n\t\t\tif (!solid)\n\t\t\t{\n\t\t\t\t_streamPos = 0;\n\t\t\t\t_pos = 0;\n\t\t\t\tTrainSize = 0;\n\t\t\t}\n\t\t}\n\t\n\t\tpublic bool Train(System.IO.Stream stream)\n\t\t{\n\t\t\tlong len = stream.Length;\n\t\t\tuint size = (len < _windowSize) ? (uint)len : _windowSize;\n\t\t\tTrainSize = size;\n\t\t\tstream.Position = len - size;\n\t\t\t_streamPos = _pos = 0;\n\t\t\twhile (size > 0)\n\t\t\t{\n\t\t\t\tuint curSize = _windowSize - _pos;\n\t\t\t\tif (size < curSize)\n\t\t\t\t\tcurSize = size;\n\t\t\t\tint numReadBytes = stream.Read(_buffer, (int)_pos, (int)curSize);\n\t\t\t\tif (numReadBytes == 0)\n\t\t\t\t\treturn false;\n\t\t\t\tsize -= (uint)numReadBytes;\n\t\t\t\t_pos += (uint)numReadBytes;\n\t\t\t\t_streamPos += (uint)numReadBytes;\n\t\t\t\tif (_pos == _windowSize)\n\t\t\t\t\t_streamPos = _pos = 0;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic void ReleaseStream()\n\t\t{\n\t\t\tFlush();\n\t\t\t_stream = null;\n\t\t}\n\n\t\tpublic void Flush()\n\t\t{\n\t\t\tuint size = _pos - _streamPos;\n\t\t\tif (size == 0)\n\t\t\t\treturn;\n\t\t\t_stream.Write(_buffer, (int)_streamPos, (int)size);\n\t\t\tif (_pos >= _windowSize)\n\t\t\t\t_pos = 0;\n\t\t\t_streamPos = _pos;\n\t\t}\n\n\t\tpublic void CopyBlock(uint distance, uint len)\n\t\t{\n\t\t\tuint pos = _pos - distance - 1;\n\t\t\tif (pos >= _windowSize)\n\t\t\t\tpos += _windowSize;\n\t\t\tfor (; len > 0; len--)\n\t\t\t{\n\t\t\t\tif (pos >= _windowSize)\n\t\t\t\t\tpos = 0;\n\t\t\t\t_buffer[_pos++] = _buffer[pos++];\n\t\t\t\tif (_pos >= _windowSize)\n\t\t\t\t\tFlush();\n\t\t\t}\n\t\t}\n\n\t\tpublic void PutByte(byte b)\n\t\t{\n\t\t\t_buffer[_pos++] = b;\n\t\t\tif (_pos >= _windowSize)\n\t\t\t\tFlush();\n\t\t}\n\n\t\tpublic byte GetByte(uint distance)\n\t\t{\n\t\t\tuint pos = _pos - distance - 1;\n\t\t\tif (pos >= _windowSize)\n\t\t\t\tpos += _windowSize;\n\t\t\treturn _buffer[pos];\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZMA/LzmaBase.cs", "content": "// LzmaBase.cs\n\nnamespace SevenZip.Compression.LZMA\n{\n\tinternal abstract class Base\n\t{\n\t\tpublic const uint kNumRepDistances = 4;\n\t\tpublic const uint kNumStates = 12;\n\n\t\t// static byte []kLiteralNextStates = {0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5};\n\t\t// static byte []kMatchNextStates = {7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10};\n\t\t// static byte []kRepNextStates = {8, 8, 8, 8, 8, 8, 8, 11, 11, 11, 11, 11};\n\t\t// static byte []kShortRepNextStates = {9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11};\n\n\t\tpublic struct State\n\t\t{\n\t\t\tpublic uint Index;\n\t\t\tpublic void Init() { Index = 0; }\n\t\t\tpublic void UpdateChar()\n\t\t\t{\n\t\t\t\tif (Index < 4) Index = 0;\n\t\t\t\telse if (Index < 10) Index -= 3;\n\t\t\t\telse Index -= 6;\n\t\t\t}\n\t\t\tpublic void UpdateMatch() { Index = (uint)(Index < 7 ? 7 : 10); }\n\t\t\tpublic void UpdateRep() { Index = (uint)(Index < 7 ? 8 : 11); }\n\t\t\tpublic void UpdateShortRep() { Index = (uint)(Index < 7 ? 9 : 11); }\n\t\t\tpublic bool IsCharState() { return Index < 7; }\n\t\t}\n\n\t\tpublic const int kNumPosSlotBits = 6;\n\t\tpublic const int kDicLogSizeMin = 0;\n\t\t// public const int kDicLogSizeMax = 30;\n\t\t// public const uint kDistTableSizeMax = kDicLogSizeMax * 2;\n\n\t\tpublic const int kNumLenToPosStatesBits = 2; // it's for speed optimization\n\t\tpublic const uint kNumLenToPosStates = 1 << kNumLenToPosStatesBits;\n\n\t\tpublic const uint kMatchMinLen = 2;\n\n\t\tpublic static uint GetLenToPosState(uint len)\n\t\t{\n\t\t\tlen -= kMatchMinLen;\n\t\t\tif (len < kNumLenToPosStates)\n\t\t\t\treturn len;\n\t\t\treturn (uint)(kNumLenToPosStates - 1);\n\t\t}\n\n\t\tpublic const int kNumAlignBits = 4;\n\t\tpublic const uint kAlignTableSize = 1 << kNumAlignBits;\n\t\tpublic const uint kAlignMask = (kAlignTableSize - 1);\n\n\t\tpublic const uint kStartPosModelIndex = 4;\n\t\tpublic const uint kEndPosModelIndex = 14;\n\t\tpublic const uint kNumPosModels = kEndPosModelIndex - kStartPosModelIndex;\n\n\t\tpublic const uint kNumFullDistances = 1 << ((int)kEndPosModelIndex / 2);\n\n\t\tpublic const uint kNumLitPosStatesBitsEncodingMax = 4;\n\t\tpublic const uint kNumLitContextBitsMax = 8;\n\n\t\tpublic const int kNumPosStatesBitsMax = 4;\n\t\tpublic const uint kNumPosStatesMax = (1 << kNumPosStatesBitsMax);\n\t\tpublic const int kNumPosStatesBitsEncodingMax = 4;\n\t\tpublic const uint kNumPosStatesEncodingMax = (1 << kNumPosStatesBitsEncodingMax);\n\n\t\tpublic const int kNumLowLenBits = 3;\n\t\tpublic const int kNumMidLenBits = 3;\n\t\tpublic const int kNumHighLenBits = 8;\n\t\tpublic const uint kNumLowLenSymbols = 1 << kNumLowLenBits;\n\t\tpublic const uint kNumMidLenSymbols = 1 << kNumMidLenBits;\n\t\tpublic const uint kNumLenSymbols = kNumLowLenSymbols + kNumMidLenSymbols +\n\t\t\t\t(1 << kNumHighLenBits);\n\t\tpublic const uint kMatchMaxLen = kMatchMinLen + kNumLenSymbols - 1;\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZMA/LzmaDecoder.cs", "content": "// LzmaDecoder.cs\n\nusing System;\n\nnamespace SevenZip.Compression.LZMA\n{\n\tusing RangeCoder;\n\n\tpublic class Decoder : ICoder, ISetDecoderProperties // ,System.IO.Stream\n\t{\n\t\tclass LenDecoder\n\t\t{\n\t\t\tBitDecoder m_Choice = new BitDecoder();\n\t\t\tBitDecoder m_Choice2 = new BitDecoder();\n\t\t\tBitTreeDecoder[] m_LowCoder = new BitTreeDecoder[Base.kNumPosStatesMax];\n\t\t\tBitTreeDecoder[] m_MidCoder = new BitTreeDecoder[Base.kNumPosStatesMax];\n\t\t\tBitTreeDecoder m_HighCoder = new BitTreeDecoder(Base.kNumHighLenBits);\n\t\t\tuint m_NumPosStates = 0;\n\n\t\t\tpublic void Create(uint numPosStates)\n\t\t\t{\n\t\t\t\tfor (uint posState = m_NumPosStates; posState < numPosStates; posState++)\n\t\t\t\t{\n\t\t\t\t\tm_LowCoder[posState] = new BitTreeDecoder(Base.kNumLowLenBits);\n\t\t\t\t\tm_MidCoder[posState] = new BitTreeDecoder(Base.kNumMidLenBits);\n\t\t\t\t}\n\t\t\t\tm_NumPosStates = numPosStates;\n\t\t\t}\n\n\t\t\tpublic void Init()\n\t\t\t{\n\t\t\t\tm_Choice.Init();\n\t\t\t\tfor (uint posState = 0; posState < m_NumPosStates; posState++)\n\t\t\t\t{\n\t\t\t\t\tm_LowCoder[posState].Init();\n\t\t\t\t\tm_MidCoder[posState].Init();\n\t\t\t\t}\n\t\t\t\tm_Choice2.Init();\n\t\t\t\tm_HighCoder.Init();\n\t\t\t}\n\n\t\t\tpublic uint Decode(RangeCoder.Decoder rangeDecoder, uint posState)\n\t\t\t{\n\t\t\t\tif (m_Choice.Decode(rangeDecoder) == 0)\n\t\t\t\t\treturn m_LowCoder[posState].Decode(rangeDecoder);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tuint symbol = Base.kNumLowLenSymbols;\n\t\t\t\t\tif (m_Choice2.Decode(rangeDecoder) == 0)\n\t\t\t\t\t\tsymbol += m_MidCoder[posState].Decode(rangeDecoder);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tsymbol += Base.kNumMidLenSymbols;\n\t\t\t\t\t\tsymbol += m_HighCoder.Decode(rangeDecoder);\n\t\t\t\t\t}\n\t\t\t\t\treturn symbol;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tclass LiteralDecoder\n\t\t{\n\t\t\tstruct Decoder2\n\t\t\t{\n\t\t\t\tBitDecoder[] m_Decoders;\n\t\t\t\tpublic void Create() { m_Decoders = new BitDecoder[0x300]; }\n\t\t\t\tpublic void Init() { for (int i = 0; i < 0x300; i++) m_Decoders[i].Init(); }\n\n\t\t\t\tpublic byte DecodeNormal(RangeCoder.Decoder rangeDecoder)\n\t\t\t\t{\n\t\t\t\t\tuint symbol = 1;\n\t\t\t\t\tdo\n\t\t\t\t\t\tsymbol = (symbol << 1) | m_Decoders[symbol].Decode(rangeDecoder);\n\t\t\t\t\twhile (symbol < 0x100);\n\t\t\t\t\treturn (byte)symbol;\n\t\t\t\t}\n\n\t\t\t\tpublic byte DecodeWithMatchByte(RangeCoder.Decoder rangeDecoder, byte matchByte)\n\t\t\t\t{\n\t\t\t\t\tuint symbol = 1;\n\t\t\t\t\tdo\n\t\t\t\t\t{\n\t\t\t\t\t\tuint matchBit = (uint)(matchByte >> 7) & 1;\n\t\t\t\t\t\tmatchByte <<= 1;\n\t\t\t\t\t\tuint bit = m_Decoders[((1 + matchBit) << 8) + symbol].Decode(rangeDecoder);\n\t\t\t\t\t\tsymbol = (symbol << 1) | bit;\n\t\t\t\t\t\tif (matchBit != bit)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\twhile (symbol < 0x100)\n\t\t\t\t\t\t\t\tsymbol = (symbol << 1) | m_Decoders[symbol].Decode(rangeDecoder);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\twhile (symbol < 0x100);\n\t\t\t\t\treturn (byte)symbol;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tDecoder2[] m_Coders;\n\t\t\tint m_NumPrevBits;\n\t\t\tint m_NumPosBits;\n\t\t\tuint m_PosMask;\n\n\t\t\tpublic void Create(int numPosBits, int numPrevBits)\n\t\t\t{\n\t\t\t\tif (m_Coders != null && m_NumPrevBits == numPrevBits &&\n\t\t\t\t\tm_NumPosBits == numPosBits)\n\t\t\t\t\treturn;\n\t\t\t\tm_NumPosBits = numPosBits;\n\t\t\t\tm_PosMask = ((uint)1 << numPosBits) - 1;\n\t\t\t\tm_NumPrevBits = numPrevBits;\n\t\t\t\tuint numStates = (uint)1 << (m_NumPrevBits + m_NumPosBits);\n\t\t\t\tm_Coders = new Decoder2[numStates];\n\t\t\t\tfor (uint i = 0; i < numStates; i++)\n\t\t\t\t\tm_Coders[i].Create();\n\t\t\t}\n\n\t\t\tpublic void Init()\n\t\t\t{\n\t\t\t\tuint numStates = (uint)1 << (m_NumPrevBits + m_NumPosBits);\n\t\t\t\tfor (uint i = 0; i < numStates; i++)\n\t\t\t\t\tm_Coders[i].Init();\n\t\t\t}\n\n\t\t\tuint GetState(uint pos, byte prevByte)\n\t\t\t{ return ((pos & m_PosMask) << m_NumPrevBits) + (uint)(prevByte >> (8 - m_NumPrevBits)); }\n\n\t\t\tpublic byte DecodeNormal(RangeCoder.Decoder rangeDecoder, uint pos, byte prevByte)\n\t\t\t{ return m_Coders[GetState(pos, prevByte)].DecodeNormal(rangeDecoder); }\n\n\t\t\tpublic byte DecodeWithMatchByte(RangeCoder.Decoder rangeDecoder, uint pos, byte prevByte, byte matchByte)\n\t\t\t{ return m_Coders[GetState(pos, prevByte)].DecodeWithMatchByte(rangeDecoder, matchByte); }\n\t\t};\n\n\t\tLZ.OutWindow m_OutWindow = new LZ.OutWindow();\n\t\tRangeCoder.Decoder m_RangeDecoder = new RangeCoder.Decoder();\n\n\t\tBitDecoder[] m_IsMatchDecoders = new BitDecoder[Base.kNumStates << Base.kNumPosStatesBitsMax];\n\t\tBitDecoder[] m_IsRepDecoders = new BitDecoder[Base.kNumStates];\n\t\tBitDecoder[] m_IsRepG0Decoders = new BitDecoder[Base.kNumStates];\n\t\tBitDecoder[] m_IsRepG1Decoders = new BitDecoder[Base.kNumStates];\n\t\tBitDecoder[] m_IsRepG2Decoders = new BitDecoder[Base.kNumStates];\n\t\tBitDecoder[] m_IsRep0LongDecoders = new BitDecoder[Base.kNumStates << Base.kNumPosStatesBitsMax];\n\n\t\tBitTreeDecoder[] m_PosSlotDecoder = new BitTreeDecoder[Base.kNumLenToPosStates];\n\t\tBitDecoder[] m_PosDecoders = new BitDecoder[Base.kNumFullDistances - Base.kEndPosModelIndex];\n\n\t\tBitTreeDecoder m_PosAlignDecoder = new BitTreeDecoder(Base.kNumAlignBits);\n\n\t\tLenDecoder m_LenDecoder = new LenDecoder();\n\t\tLenDecoder m_RepLenDecoder = new LenDecoder();\n\n\t\tLiteralDecoder m_LiteralDecoder = new LiteralDecoder();\n\n\t\tuint m_DictionarySize;\n\t\tuint m_DictionarySizeCheck;\n\n\t\tuint m_PosStateMask;\n\n\t\tpublic Decoder()\n\t\t{\n\t\t\tm_DictionarySize = 0xFFFFFFFF;\n\t\t\tfor (int i = 0; i < Base.kNumLenToPosStates; i++)\n\t\t\t\tm_PosSlotDecoder[i] = new BitTreeDecoder(Base.kNumPosSlotBits);\n\t\t}\n\n\t\tvoid SetDictionarySize(uint dictionarySize)\n\t\t{\n\t\t\tif (m_DictionarySize != dictionarySize)\n\t\t\t{\n\t\t\t\tm_DictionarySize = dictionarySize;\n\t\t\t\tm_DictionarySizeCheck = Math.Max(m_DictionarySize, 1);\n\t\t\t\tuint blockSize = Math.Max(m_DictionarySizeCheck, (1 << 12));\n\t\t\t\tm_OutWindow.Create(blockSize);\n\t\t\t}\n\t\t}\n\n\t\tvoid SetLiteralProperties(int lp, int lc)\n\t\t{\n\t\t\tif (lp > 8)\n\t\t\t\tthrow new InvalidParamException();\n\t\t\tif (lc > 8)\n\t\t\t\tthrow new InvalidParamException();\n\t\t\tm_LiteralDecoder.Create(lp, lc);\n\t\t}\n\n\t\tvoid SetPosBitsProperties(int pb)\n\t\t{\n\t\t\tif (pb > Base.kNumPosStatesBitsMax)\n\t\t\t\tthrow new InvalidParamException();\n\t\t\tuint numPosStates = (uint)1 << pb;\n\t\t\tm_LenDecoder.Create(numPosStates);\n\t\t\tm_RepLenDecoder.Create(numPosStates);\n\t\t\tm_PosStateMask = numPosStates - 1;\n\t\t}\n\n\t\tbool _solid = false;\n\t\tvoid Init(System.IO.Stream inStream, System.IO.Stream outStream)\n\t\t{\n\t\t\tm_RangeDecoder.Init(inStream);\n\t\t\tm_OutWindow.Init(outStream, _solid);\n\n\t\t\tuint i;\n\t\t\tfor (i = 0; i < Base.kNumStates; i++)\n\t\t\t{\n\t\t\t\tfor (uint j = 0; j <= m_PosStateMask; j++)\n\t\t\t\t{\n\t\t\t\t\tuint index = (i << Base.kNumPosStatesBitsMax) + j;\n\t\t\t\t\tm_IsMatchDecoders[index].Init();\n\t\t\t\t\tm_IsRep0LongDecoders[index].Init();\n\t\t\t\t}\n\t\t\t\tm_IsRepDecoders[i].Init();\n\t\t\t\tm_IsRepG0Decoders[i].Init();\n\t\t\t\tm_IsRepG1Decoders[i].Init();\n\t\t\t\tm_IsRepG2Decoders[i].Init();\n\t\t\t}\n\n\t\t\tm_LiteralDecoder.Init();\n\t\t\tfor (i = 0; i < Base.kNumLenToPosStates; i++)\n\t\t\t\tm_PosSlotDecoder[i].Init();\n\t\t\t// m_PosSpecDecoder.Init();\n\t\t\tfor (i = 0; i < Base.kNumFullDistances - Base.kEndPosModelIndex; i++)\n\t\t\t\tm_PosDecoders[i].Init();\n\n\t\t\tm_LenDecoder.Init();\n\t\t\tm_RepLenDecoder.Init();\n\t\t\tm_PosAlignDecoder.Init();\n\t\t}\n\n\t\tpublic void Code(System.IO.Stream inStream, System.IO.Stream outStream,\n\t\t\tInt64 inSize, Int64 outSize, ICodeProgress progress)\n\t\t{\n\t\t\tInit(inStream, outStream);\n\n\t\t\tBase.State state = new Base.State();\n\t\t\tstate.Init();\n\t\t\tuint rep0 = 0, rep1 = 0, rep2 = 0, rep3 = 0;\n\n\t\t\tUInt64 nowPos64 = 0;\n\t\t\tUInt64 outSize64 = (UInt64)outSize;\n\t\t\tif (nowPos64 < outSize64)\n\t\t\t{\n\t\t\t\tif (m_IsMatchDecoders[state.Index << Base.kNumPosStatesBitsMax].Decode(m_RangeDecoder) != 0)\n\t\t\t\t\tthrow new DataErrorException();\n\t\t\t\tstate.UpdateChar();\n\t\t\t\tbyte b = m_LiteralDecoder.DecodeNormal(m_RangeDecoder, 0, 0);\n\t\t\t\tm_OutWindow.PutByte(b);\n\t\t\t\tnowPos64++;\n\t\t\t}\n\t\t\twhile (nowPos64 < outSize64)\n\t\t\t{\n\t\t\t\t// UInt64 next = Math.Min(nowPos64 + (1 << 18), outSize64);\n\t\t\t\t\t// while(nowPos64 < next)\n\t\t\t\t{\n\t\t\t\t\tuint posState = (uint)nowPos64 & m_PosStateMask;\n\t\t\t\t\tif (m_IsMatchDecoders[(state.Index << Base.kNumPosStatesBitsMax) + posState].Decode(m_RangeDecoder) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tbyte b;\n\t\t\t\t\t\tbyte prevByte = m_OutWindow.GetByte(0);\n\t\t\t\t\t\tif (!state.IsCharState())\n\t\t\t\t\t\t\tb = m_LiteralDecoder.DecodeWithMatchByte(m_RangeDecoder,\n\t\t\t\t\t\t\t\t(uint)nowPos64, prevByte, m_OutWindow.GetByte(rep0));\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tb = m_LiteralDecoder.DecodeNormal(m_RangeDecoder, (uint)nowPos64, prevByte);\n\t\t\t\t\t\tm_OutWindow.PutByte(b);\n\t\t\t\t\t\tstate.UpdateChar();\n\t\t\t\t\t\tnowPos64++;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tuint len;\n\t\t\t\t\t\tif (m_IsRepDecoders[state.Index].Decode(m_RangeDecoder) == 1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (m_IsRepG0Decoders[state.Index].Decode(m_RangeDecoder) == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (m_IsRep0LongDecoders[(state.Index << Base.kNumPosStatesBitsMax) + posState].Decode(m_RangeDecoder) == 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tstate.UpdateShortRep();\n\t\t\t\t\t\t\t\t\tm_OutWindow.PutByte(m_OutWindow.GetByte(rep0));\n\t\t\t\t\t\t\t\t\tnowPos64++;\n\t\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tUInt32 distance;\n\t\t\t\t\t\t\t\tif (m_IsRepG1Decoders[state.Index].Decode(m_RangeDecoder) == 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tdistance = rep1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (m_IsRepG2Decoders[state.Index].Decode(m_RangeDecoder) == 0)\n\t\t\t\t\t\t\t\t\t\tdistance = rep2;\n\t\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tdistance = rep3;\n\t\t\t\t\t\t\t\t\t\trep3 = rep2;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\trep2 = rep1;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\trep1 = rep0;\n\t\t\t\t\t\t\t\trep0 = distance;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlen = m_RepLenDecoder.Decode(m_RangeDecoder, posState) + Base.kMatchMinLen;\n\t\t\t\t\t\t\tstate.UpdateRep();\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\trep3 = rep2;\n\t\t\t\t\t\t\trep2 = rep1;\n\t\t\t\t\t\t\trep1 = rep0;\n\t\t\t\t\t\t\tlen = Base.kMatchMinLen + m_LenDecoder.Decode(m_RangeDecoder, posState);\n\t\t\t\t\t\t\tstate.UpdateMatch();\n\t\t\t\t\t\t\tuint posSlot = m_PosSlotDecoder[Base.GetLenToPosState(len)].Decode(m_RangeDecoder);\n\t\t\t\t\t\t\tif (posSlot >= Base.kStartPosModelIndex)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tint numDirectBits = (int)((posSlot >> 1) - 1);\n\t\t\t\t\t\t\t\trep0 = ((2 | (posSlot & 1)) << numDirectBits);\n\t\t\t\t\t\t\t\tif (posSlot < Base.kEndPosModelIndex)\n\t\t\t\t\t\t\t\t\trep0 += BitTreeDecoder.ReverseDecode(m_PosDecoders,\n\t\t\t\t\t\t\t\t\t\t\trep0 - posSlot - 1, m_RangeDecoder, numDirectBits);\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\trep0 += (m_RangeDecoder.DecodeDirectBits(\n\t\t\t\t\t\t\t\t\t\tnumDirectBits - Base.kNumAlignBits) << Base.kNumAlignBits);\n\t\t\t\t\t\t\t\t\trep0 += m_PosAlignDecoder.ReverseDecode(m_RangeDecoder);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\trep0 = posSlot;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (rep0 >= m_OutWindow.TrainSize + nowPos64 || rep0 >= m_DictionarySizeCheck)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (rep0 == 0xFFFFFFFF)\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tthrow new DataErrorException();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tm_OutWindow.CopyBlock(rep0, len);\n\t\t\t\t\t\tnowPos64 += len;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tm_OutWindow.Flush();\n\t\t\tm_OutWindow.ReleaseStream();\n\t\t\tm_RangeDecoder.ReleaseStream();\n\t\t}\n\n\t\tpublic void SetDecoderProperties(byte[] properties)\n\t\t{\n\t\t\tif (properties.Length < 5)\n\t\t\t\tthrow new InvalidParamException();\n\t\t\tint lc = properties[0] % 9;\n\t\t\tint remainder = properties[0] / 9;\n\t\t\tint lp = remainder % 5;\n\t\t\tint pb = remainder / 5;\n\t\t\tif (pb > Base.kNumPosStatesBitsMax)\n\t\t\t\tthrow new InvalidParamException();\n\t\t\tUInt32 dictionarySize = 0;\n\t\t\tfor (int i = 0; i < 4; i++)\n\t\t\t\tdictionarySize += ((UInt32)(properties[1 + i])) << (i * 8);\n\t\t\tSetDictionarySize(dictionarySize);\n\t\t\tSetLiteralProperties(lp, lc);\n\t\t\tSetPosBitsProperties(pb);\n\t\t}\n\n\t\tpublic bool Train(System.IO.Stream stream)\n\t\t{\n\t\t\t_solid = true;\n\t\t\treturn m_OutWindow.Train(stream);\n\t\t}\n\n\t\t/*\n\t\tpublic override bool CanRead { get { return true; }}\n\t\tpublic override bool CanWrite { get { return true; }}\n\t\tpublic override bool CanSeek { get { return true; }}\n\t\tpublic override long Length { get { return 0; }}\n\t\tpublic override long Position\n\t\t{\n\t\t\tget { return 0;\t}\n\t\t\tset { }\n\t\t}\n\t\tpublic override void Flush() { }\n\t\tpublic override int Read(byte[] buffer, int offset, int count) \n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tpublic override void Write(byte[] buffer, int offset, int count)\n\t\t{\n\t\t}\n\t\tpublic override long Seek(long offset, System.IO.SeekOrigin origin)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t\tpublic override void SetLength(long value) {}\n\t\t*/\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/LZMA/LzmaEncoder.cs", "content": "// LzmaEncoder.cs\n\nusing System;\n\nnamespace SevenZip.Compression.LZMA\n{\n\tusing RangeCoder;\n\n\tpublic class Encoder : ICoder, ISetCoderProperties, IWriteCoderProperties\n\t{\n\t\tenum EMatchFinderType\n\t\t{\n\t\t\tBT2,\n\t\t\tBT4,\n\t\t};\n\n\t\tconst UInt32 kIfinityPrice = 0xFFFFFFF;\n\n\t\tstatic Byte[] g_FastPos = new Byte[1 << 11];\n\n\t\tstatic Encoder()\n\t\t{\n\t\t\tconst Byte kFastSlots = 22;\n\t\t\tint c = 2;\n\t\t\tg_FastPos[0] = 0;\n\t\t\tg_FastPos[1] = 1;\n\t\t\tfor (Byte slotFast = 2; slotFast < kFastSlots; slotFast++)\n\t\t\t{\n\t\t\t\tUInt32 k = ((UInt32)1 << ((slotFast >> 1) - 1));\n\t\t\t\tfor (UInt32 j = 0; j < k; j++, c++)\n\t\t\t\t\tg_FastPos[c] = slotFast;\n\t\t\t}\n\t\t}\n\n\t\tstatic UInt32 GetPosSlot(UInt32 pos)\n\t\t{\n\t\t\tif (pos < (1 << 11))\n\t\t\t\treturn g_FastPos[pos];\n\t\t\tif (pos < (1 << 21))\n\t\t\t\treturn (UInt32)(g_FastPos[pos >> 10] + 20);\n\t\t\treturn (UInt32)(g_FastPos[pos >> 20] + 40);\n\t\t}\n\n\t\tstatic UInt32 GetPosSlot2(UInt32 pos)\n\t\t{\n\t\t\tif (pos < (1 << 17))\n\t\t\t\treturn (UInt32)(g_FastPos[pos >> 6] + 12);\n\t\t\tif (pos < (1 << 27))\n\t\t\t\treturn (UInt32)(g_FastPos[pos >> 16] + 32);\n\t\t\treturn (UInt32)(g_FastPos[pos >> 26] + 52);\n\t\t}\n\n\t\tBase.State _state = new Base.State();\n\t\tByte _previousByte;\n\t\tUInt32[] _repDistances = new UInt32[Base.kNumRepDistances];\n\n\t\tvoid BaseInit()\n\t\t{\n\t\t\t_state.Init();\n\t\t\t_previousByte = 0;\n\t\t\tfor (UInt32 i = 0; i < Base.kNumRepDistances; i++)\n\t\t\t\t_repDistances[i] = 0;\n\t\t}\n\n\t\tconst int kDefaultDictionaryLogSize = 22;\n\t\tconst UInt32 kNumFastBytesDefault = 0x20;\n\n\t\tclass LiteralEncoder\n\t\t{\n\t\t\tpublic struct Encoder2\n\t\t\t{\n\t\t\t\tBitEncoder[] m_Encoders;\n\n\t\t\t\tpublic void Create() { m_Encoders = new BitEncoder[0x300]; }\n\n\t\t\t\tpublic void Init() { for (int i = 0; i < 0x300; i++) m_Encoders[i].Init(); }\n\n\t\t\t\tpublic void Encode(RangeCoder.Encoder rangeEncoder, byte symbol)\n\t\t\t\t{\n\t\t\t\t\tuint context = 1;\n\t\t\t\t\tfor (int i = 7; i >= 0; i--)\n\t\t\t\t\t{\n\t\t\t\t\t\tuint bit = (uint)((symbol >> i) & 1);\n\t\t\t\t\t\tm_Encoders[context].Encode(rangeEncoder, bit);\n\t\t\t\t\t\tcontext = (context << 1) | bit;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tpublic void EncodeMatched(RangeCoder.Encoder rangeEncoder, byte matchByte, byte symbol)\n\t\t\t\t{\n\t\t\t\t\tuint context = 1;\n\t\t\t\t\tbool same = true;\n\t\t\t\t\tfor (int i = 7; i >= 0; i--)\n\t\t\t\t\t{\n\t\t\t\t\t\tuint bit = (uint)((symbol >> i) & 1);\n\t\t\t\t\t\tuint state = context;\n\t\t\t\t\t\tif (same)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tuint matchBit = (uint)((matchByte >> i) & 1);\n\t\t\t\t\t\t\tstate += ((1 + matchBit) << 8);\n\t\t\t\t\t\t\tsame = (matchBit == bit);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tm_Encoders[state].Encode(rangeEncoder, bit);\n\t\t\t\t\t\tcontext = (context << 1) | bit;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tpublic uint GetPrice(bool matchMode, byte matchByte, byte symbol)\n\t\t\t\t{\n\t\t\t\t\tuint price = 0;\n\t\t\t\t\tuint context = 1;\n\t\t\t\t\tint i = 7;\n\t\t\t\t\tif (matchMode)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (; i >= 0; i--)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tuint matchBit = (uint)(matchByte >> i) & 1;\n\t\t\t\t\t\t\tuint bit = (uint)(symbol >> i) & 1;\n\t\t\t\t\t\t\tprice += m_Encoders[((1 + matchBit) << 8) + context].GetPrice(bit);\n\t\t\t\t\t\t\tcontext = (context << 1) | bit;\n\t\t\t\t\t\t\tif (matchBit != bit)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ti--;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor (; i >= 0; i--)\n\t\t\t\t\t{\n\t\t\t\t\t\tuint bit = (uint)(symbol >> i) & 1;\n\t\t\t\t\t\tprice += m_Encoders[context].GetPrice(bit);\n\t\t\t\t\t\tcontext = (context << 1) | bit;\n\t\t\t\t\t}\n\t\t\t\t\treturn price;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tEncoder2[] m_Coders;\n\t\t\tint m_NumPrevBits;\n\t\t\tint m_NumPosBits;\n\t\t\tuint m_PosMask;\n\n\t\t\tpublic void Create(int numPosBits, int numPrevBits)\n\t\t\t{\n\t\t\t\tif (m_Coders != null && m_NumPrevBits == numPrevBits && m_NumPosBits == numPosBits)\n\t\t\t\t\treturn;\n\t\t\t\tm_NumPosBits = numPosBits;\n\t\t\t\tm_PosMask = ((uint)1 << numPosBits) - 1;\n\t\t\t\tm_NumPrevBits = numPrevBits;\n\t\t\t\tuint numStates = (uint)1 << (m_NumPrevBits + m_NumPosBits);\n\t\t\t\tm_Coders = new Encoder2[numStates];\n\t\t\t\tfor (uint i = 0; i < numStates; i++)\n\t\t\t\t\tm_Coders[i].Create();\n\t\t\t}\n\n\t\t\tpublic void Init()\n\t\t\t{\n\t\t\t\tuint numStates = (uint)1 << (m_NumPrevBits + m_NumPosBits);\n\t\t\t\tfor (uint i = 0; i < numStates; i++)\n\t\t\t\t\tm_Coders[i].Init();\n\t\t\t}\n\n\t\t\tpublic Encoder2 GetSubCoder(UInt32 pos, Byte prevByte)\n\t\t\t{ return m_Coders[((pos & m_PosMask) << m_NumPrevBits) + (uint)(prevByte >> (8 - m_NumPrevBits))]; }\n\t\t}\n\n\t\tclass LenEncoder\n\t\t{\n\t\t\tRangeCoder.BitEncoder _choice = new RangeCoder.BitEncoder();\n\t\t\tRangeCoder.BitEncoder _choice2 = new RangeCoder.BitEncoder();\n\t\t\tRangeCoder.BitTreeEncoder[] _lowCoder = new RangeCoder.BitTreeEncoder[Base.kNumPosStatesEncodingMax];\n\t\t\tRangeCoder.BitTreeEncoder[] _midCoder = new RangeCoder.BitTreeEncoder[Base.kNumPosStatesEncodingMax];\n\t\t\tRangeCoder.BitTreeEncoder _highCoder = new RangeCoder.BitTreeEncoder(Base.kNumHighLenBits);\n\n\t\t\tpublic LenEncoder()\n\t\t\t{\n\t\t\t\tfor (UInt32 posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++)\n\t\t\t\t{\n\t\t\t\t\t_lowCoder[posState] = new RangeCoder.BitTreeEncoder(Base.kNumLowLenBits);\n\t\t\t\t\t_midCoder[posState] = new RangeCoder.BitTreeEncoder(Base.kNumMidLenBits);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpublic void Init(UInt32 numPosStates)\n\t\t\t{\n\t\t\t\t_choice.Init();\n\t\t\t\t_choice2.Init();\n\t\t\t\tfor (UInt32 posState = 0; posState < numPosStates; posState++)\n\t\t\t\t{\n\t\t\t\t\t_lowCoder[posState].Init();\n\t\t\t\t\t_midCoder[posState].Init();\n\t\t\t\t}\n\t\t\t\t_highCoder.Init();\n\t\t\t}\n\n\t\t\tpublic void Encode(RangeCoder.Encoder rangeEncoder, UInt32 symbol, UInt32 posState)\n\t\t\t{\n\t\t\t\tif (symbol < Base.kNumLowLenSymbols)\n\t\t\t\t{\n\t\t\t\t\t_choice.Encode(rangeEncoder, 0);\n\t\t\t\t\t_lowCoder[posState].Encode(rangeEncoder, symbol);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsymbol -= Base.kNumLowLenSymbols;\n\t\t\t\t\t_choice.Encode(rangeEncoder, 1);\n\t\t\t\t\tif (symbol < Base.kNumMidLenSymbols)\n\t\t\t\t\t{\n\t\t\t\t\t\t_choice2.Encode(rangeEncoder, 0);\n\t\t\t\t\t\t_midCoder[posState].Encode(rangeEncoder, symbol);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t_choice2.Encode(rangeEncoder, 1);\n\t\t\t\t\t\t_highCoder.Encode(rangeEncoder, symbol - Base.kNumMidLenSymbols);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpublic void SetPrices(UInt32 posState, UInt32 numSymbols, UInt32[] prices, UInt32 st)\n\t\t\t{\n\t\t\t\tUInt32 a0 = _choice.GetPrice0();\n\t\t\t\tUInt32 a1 = _choice.GetPrice1();\n\t\t\t\tUInt32 b0 = a1 + _choice2.GetPrice0();\n\t\t\t\tUInt32 b1 = a1 + _choice2.GetPrice1();\n\t\t\t\tUInt32 i = 0;\n\t\t\t\tfor (i = 0; i < Base.kNumLowLenSymbols; i++)\n\t\t\t\t{\n\t\t\t\t\tif (i >= numSymbols)\n\t\t\t\t\t\treturn;\n\t\t\t\t\tprices[st + i] = a0 + _lowCoder[posState].GetPrice(i);\n\t\t\t\t}\n\t\t\t\tfor (; i < Base.kNumLowLenSymbols + Base.kNumMidLenSymbols; i++)\n\t\t\t\t{\n\t\t\t\t\tif (i >= numSymbols)\n\t\t\t\t\t\treturn;\n\t\t\t\t\tprices[st + i] = b0 + _midCoder[posState].GetPrice(i - Base.kNumLowLenSymbols);\n\t\t\t\t}\n\t\t\t\tfor (; i < numSymbols; i++)\n\t\t\t\t\tprices[st + i] = b1 + _highCoder.GetPrice(i - Base.kNumLowLenSymbols - Base.kNumMidLenSymbols);\n\t\t\t}\n\t\t};\n\n\t\tconst UInt32 kNumLenSpecSymbols = Base.kNumLowLenSymbols + Base.kNumMidLenSymbols;\n\n\t\tclass LenPriceTableEncoder : LenEncoder\n\t\t{\n\t\t\tUInt32[] _prices = new UInt32[Base.kNumLenSymbols << Base.kNumPosStatesBitsEncodingMax];\n\t\t\tUInt32 _tableSize;\n\t\t\tUInt32[] _counters = new UInt32[Base.kNumPosStatesEncodingMax];\n\n\t\t\tpublic void SetTableSize(UInt32 tableSize) { _tableSize = tableSize; }\n\n\t\t\tpublic UInt32 GetPrice(UInt32 symbol, UInt32 posState)\n\t\t\t{\n\t\t\t\treturn _prices[posState * Base.kNumLenSymbols + symbol];\n\t\t\t}\n\n\t\t\tvoid UpdateTable(UInt32 posState)\n\t\t\t{\n\t\t\t\tSetPrices(posState, _tableSize, _prices, posState * Base.kNumLenSymbols);\n\t\t\t\t_counters[posState] = _tableSize;\n\t\t\t}\n\n\t\t\tpublic void UpdateTables(UInt32 numPosStates)\n\t\t\t{\n\t\t\t\tfor (UInt32 posState = 0; posState < numPosStates; posState++)\n\t\t\t\t\tUpdateTable(posState);\n\t\t\t}\n\n\t\t\tpublic new void Encode(RangeCoder.Encoder rangeEncoder, UInt32 symbol, UInt32 posState)\n\t\t\t{\n\t\t\t\tbase.Encode(rangeEncoder, symbol, posState);\n\t\t\t\tif (--_counters[posState] == 0)\n\t\t\t\t\tUpdateTable(posState);\n\t\t\t}\n\t\t}\n\n\t\tconst UInt32 kNumOpts = 1 << 12;\n\t\tclass Optimal\n\t\t{\n\t\t\tpublic Base.State State;\n\n\t\t\tpublic bool Prev1IsChar;\n\t\t\tpublic bool Prev2;\n\n\t\t\tpublic UInt32 PosPrev2;\n\t\t\tpublic UInt32 BackPrev2;\n\n\t\t\tpublic UInt32 Price;\n\t\t\tpublic UInt32 PosPrev;\n\t\t\tpublic UInt32 BackPrev;\n\n\t\t\tpublic UInt32 Backs0;\n\t\t\tpublic UInt32 Backs1;\n\t\t\tpublic UInt32 Backs2;\n\t\t\tpublic UInt32 Backs3;\n\n\t\t\tpublic void MakeAsChar() { BackPrev = 0xFFFFFFFF; Prev1IsChar = false; }\n\t\t\tpublic void MakeAsShortRep() { BackPrev = 0; ; Prev1IsChar = false; }\n\t\t\tpublic bool IsShortRep() { return (BackPrev == 0); }\n\t\t};\n\t\tOptimal[] _optimum = new Optimal[kNumOpts];\n\t\tLZ.IMatchFinder _matchFinder = null;\n\t\tRangeCoder.Encoder _rangeEncoder = new RangeCoder.Encoder();\n\n\t\tRangeCoder.BitEncoder[] _isMatch = new RangeCoder.BitEncoder[Base.kNumStates << Base.kNumPosStatesBitsMax];\n\t\tRangeCoder.BitEncoder[] _isRep = new RangeCoder.BitEncoder[Base.kNumStates];\n\t\tRangeCoder.BitEncoder[] _isRepG0 = new RangeCoder.BitEncoder[Base.kNumStates];\n\t\tRangeCoder.BitEncoder[] _isRepG1 = new RangeCoder.BitEncoder[Base.kNumStates];\n\t\tRangeCoder.BitEncoder[] _isRepG2 = new RangeCoder.BitEncoder[Base.kNumStates];\n\t\tRangeCoder.BitEncoder[] _isRep0Long = new RangeCoder.BitEncoder[Base.kNumStates << Base.kNumPosStatesBitsMax];\n\n\t\tRangeCoder.BitTreeEncoder[] _posSlotEncoder = new RangeCoder.BitTreeEncoder[Base.kNumLenToPosStates];\n\t\t\n\t\tRangeCoder.BitEncoder[] _posEncoders = new RangeCoder.BitEncoder[Base.kNumFullDistances - Base.kEndPosModelIndex];\n\t\tRangeCoder.BitTreeEncoder _posAlignEncoder = new RangeCoder.BitTreeEncoder(Base.kNumAlignBits);\n\n\t\tLenPriceTableEncoder _lenEncoder = new LenPriceTableEncoder();\n\t\tLenPriceTableEncoder _repMatchLenEncoder = new LenPriceTableEncoder();\n\n\t\tLiteralEncoder _literalEncoder = new LiteralEncoder();\n\n\t\tUInt32[] _matchDistances = new UInt32[Base.kMatchMaxLen * 2 + 2];\n\t\t\n\t\tUInt32 _numFastBytes = kNumFastBytesDefault;\n\t\tUInt32 _longestMatchLength;\n\t\tUInt32 _numDistancePairs;\n\n\t\tUInt32 _additionalOffset;\n\n\t\tUInt32 _optimumEndIndex;\n\t\tUInt32 _optimumCurrentIndex;\n\n\t\tbool _longestMatchWasFound;\n\n\t\tUInt32[] _posSlotPrices = new UInt32[1 << (Base.kNumPosSlotBits + Base.kNumLenToPosStatesBits)];\n\t\tUInt32[] _distancesPrices = new UInt32[Base.kNumFullDistances << Base.kNumLenToPosStatesBits];\n\t\tUInt32[] _alignPrices = new UInt32[Base.kAlignTableSize];\n\t\tUInt32 _alignPriceCount;\n\n\t\tUInt32 _distTableSize = (kDefaultDictionaryLogSize * 2);\n\n\t\tint _posStateBits = 2;\n\t\tUInt32 _posStateMask = (4 - 1);\n\t\tint _numLiteralPosStateBits = 0;\n\t\tint _numLiteralContextBits = 3;\n\n\t\tUInt32 _dictionarySize = (1 << kDefaultDictionaryLogSize);\n\t\tUInt32 _dictionarySizePrev = 0xFFFFFFFF;\n\t\tUInt32 _numFastBytesPrev = 0xFFFFFFFF;\n\n\t\tInt64 nowPos64;\n\t\tbool _finished;\n\t\tSystem.IO.Stream _inStream;\n\n\t\tEMatchFinderType _matchFinderType = EMatchFinderType.BT4;\n\t\tbool _writeEndMark = false;\n\t\t\n\t\tbool _needReleaseMFStream;\n\n\t\tvoid Create()\n\t\t{\n\t\t\tif (_matchFinder == null)\n\t\t\t{\n\t\t\t\tLZ.BinTree bt = new LZ.BinTree();\n\t\t\t\tint numHashBytes = 4;\n\t\t\t\tif (_matchFinderType == EMatchFinderType.BT2)\n\t\t\t\t\tnumHashBytes = 2;\n\t\t\t\tbt.SetType(numHashBytes);\n\t\t\t\t_matchFinder = bt;\n\t\t\t}\n\t\t\t_literalEncoder.Create(_numLiteralPosStateBits, _numLiteralContextBits);\n\n\t\t\tif (_dictionarySize == _dictionarySizePrev && _numFastBytesPrev == _numFastBytes)\n\t\t\t\treturn;\n\t\t\t_matchFinder.Create(_dictionarySize, kNumOpts, _numFastBytes, Base.kMatchMaxLen + 1);\n\t\t\t_dictionarySizePrev = _dictionarySize;\n\t\t\t_numFastBytesPrev = _numFastBytes;\n\t\t}\n\n\t\tpublic Encoder()\n\t\t{\n\t\t\tfor (int i = 0; i < kNumOpts; i++)\n\t\t\t\t_optimum[i] = new Optimal();\n\t\t\tfor (int i = 0; i < Base.kNumLenToPosStates; i++)\n\t\t\t\t_posSlotEncoder[i] = new RangeCoder.BitTreeEncoder(Base.kNumPosSlotBits);\n\t\t}\n\n\t\tvoid SetWriteEndMarkerMode(bool writeEndMarker)\n\t\t{\n\t\t\t_writeEndMark = writeEndMarker;\n\t\t}\n\n\t\tvoid Init()\n\t\t{\n\t\t\tBaseInit();\n\t\t\t_rangeEncoder.Init();\n\n\t\t\tuint i;\n\t\t\tfor (i = 0; i < Base.kNumStates; i++)\n\t\t\t{\n\t\t\t\tfor (uint j = 0; j <= _posStateMask; j++)\n\t\t\t\t{\n\t\t\t\t\tuint complexState = (i << Base.kNumPosStatesBitsMax) + j;\n\t\t\t\t\t_isMatch[complexState].Init();\n\t\t\t\t\t_isRep0Long[complexState].Init();\n\t\t\t\t}\n\t\t\t\t_isRep[i].Init();\n\t\t\t\t_isRepG0[i].Init();\n\t\t\t\t_isRepG1[i].Init();\n\t\t\t\t_isRepG2[i].Init();\n\t\t\t}\n\t\t\t_literalEncoder.Init();\n\t\t\tfor (i = 0; i < Base.kNumLenToPosStates; i++)\n\t\t\t\t_posSlotEncoder[i].Init();\n\t\t\tfor (i = 0; i < Base.kNumFullDistances - Base.kEndPosModelIndex; i++)\n\t\t\t\t_posEncoders[i].Init();\n\n\t\t\t_lenEncoder.Init((UInt32)1 << _posStateBits);\n\t\t\t_repMatchLenEncoder.Init((UInt32)1 << _posStateBits);\n\n\t\t\t_posAlignEncoder.Init();\n\n\t\t\t_longestMatchWasFound = false;\n\t\t\t_optimumEndIndex = 0;\n\t\t\t_optimumCurrentIndex = 0;\n\t\t\t_additionalOffset = 0;\n\t\t}\n\n\t\tvoid ReadMatchDistances(out UInt32 lenRes, out UInt32 numDistancePairs)\n\t\t{\n\t\t\tlenRes = 0;\n\t\t\tnumDistancePairs = _matchFinder.GetMatches(_matchDistances);\n\t\t\tif (numDistancePairs > 0)\n\t\t\t{\n\t\t\t\tlenRes = _matchDistances[numDistancePairs - 2];\n\t\t\t\tif (lenRes == _numFastBytes)\n\t\t\t\t\tlenRes += _matchFinder.GetMatchLen((int)lenRes - 1, _matchDistances[numDistancePairs - 1],\n\t\t\t\t\t\tBase.kMatchMaxLen - lenRes);\n\t\t\t}\n\t\t\t_additionalOffset++;\n\t\t}\n\n\n\t\tvoid MovePos(UInt32 num)\n\t\t{\n\t\t\tif (num > 0)\n\t\t\t{\n\t\t\t\t_matchFinder.Skip(num);\n\t\t\t\t_additionalOffset += num;\n\t\t\t}\n\t\t}\n\n\t\tUInt32 GetRepLen1Price(Base.State state, UInt32 posState)\n\t\t{\n\t\t\treturn _isRepG0[state.Index].GetPrice0() +\n\t\t\t\t\t_isRep0Long[(state.Index << Base.kNumPosStatesBitsMax) + posState].GetPrice0();\n\t\t}\n\n\t\tUInt32 GetPureRepPrice(UInt32 repIndex, Base.State state, UInt32 posState)\n\t\t{\n\t\t\tUInt32 price;\n\t\t\tif (repIndex == 0)\n\t\t\t{\n\t\t\t\tprice = _isRepG0[state.Index].GetPrice0();\n\t\t\t\tprice += _isRep0Long[(state.Index << Base.kNumPosStatesBitsMax) + posState].GetPrice1();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprice = _isRepG0[state.Index].GetPrice1();\n\t\t\t\tif (repIndex == 1)\n\t\t\t\t\tprice += _isRepG1[state.Index].GetPrice0();\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tprice += _isRepG1[state.Index].GetPrice1();\n\t\t\t\t\tprice += _isRepG2[state.Index].GetPrice(repIndex - 2);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn price;\n\t\t}\n\n\t\tUInt32 GetRepPrice(UInt32 repIndex, UInt32 len, Base.State state, UInt32 posState)\n\t\t{\n\t\t\tUInt32 price = _repMatchLenEncoder.GetPrice(len - Base.kMatchMinLen, posState);\n\t\t\treturn price + GetPureRepPrice(repIndex, state, posState);\n\t\t}\n\t\n\t\tUInt32 GetPosLenPrice(UInt32 pos, UInt32 len, UInt32 posState)\n\t\t{\n\t\t\tUInt32 price;\n\t\t\tUInt32 lenToPosState = Base.GetLenToPosState(len);\n\t\t\tif (pos < Base.kNumFullDistances)\n\t\t\t\tprice = _distancesPrices[(lenToPosState * Base.kNumFullDistances) + pos];\n\t\t\telse\n\t\t\t\tprice = _posSlotPrices[(lenToPosState << Base.kNumPosSlotBits) + GetPosSlot2(pos)] +\n\t\t\t\t\t_alignPrices[pos & Base.kAlignMask];\n\t\t\treturn price + _lenEncoder.GetPrice(len - Base.kMatchMinLen, posState);\n\t\t}\n\n\t\tUInt32 Backward(out UInt32 backRes, UInt32 cur)\n\t\t{\n\t\t\t_optimumEndIndex = cur;\n\t\t\tUInt32 posMem = _optimum[cur].PosPrev;\n\t\t\tUInt32 backMem = _optimum[cur].BackPrev;\n\t\t\tdo\n\t\t\t{\n\t\t\t\tif (_optimum[cur].Prev1IsChar)\n\t\t\t\t{\n\t\t\t\t\t_optimum[posMem].MakeAsChar();\n\t\t\t\t\t_optimum[posMem].PosPrev = posMem - 1;\n\t\t\t\t\tif (_optimum[cur].Prev2)\n\t\t\t\t\t{\n\t\t\t\t\t\t_optimum[posMem - 1].Prev1IsChar = false;\n\t\t\t\t\t\t_optimum[posMem - 1].PosPrev = _optimum[cur].PosPrev2;\n\t\t\t\t\t\t_optimum[posMem - 1].BackPrev = _optimum[cur].BackPrev2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tUInt32 posPrev = posMem;\n\t\t\t\tUInt32 backCur = backMem;\n\n\t\t\t\tbackMem = _optimum[posPrev].BackPrev;\n\t\t\t\tposMem = _optimum[posPrev].PosPrev;\n\n\t\t\t\t_optimum[posPrev].BackPrev = backCur;\n\t\t\t\t_optimum[posPrev].PosPrev = cur;\n\t\t\t\tcur = posPrev;\n\t\t\t}\n\t\t\twhile (cur > 0);\n\t\t\tbackRes = _optimum[0].BackPrev;\n\t\t\t_optimumCurrentIndex = _optimum[0].PosPrev;\n\t\t\treturn _optimumCurrentIndex;\n\t\t}\n\n\t\tUInt32[] reps = new UInt32[Base.kNumRepDistances];\n\t\tUInt32[] repLens = new UInt32[Base.kNumRepDistances];\n\n\n\t\tUInt32 GetOptimum(UInt32 position, out UInt32 backRes)\n\t\t{\n\t\t\tif (_optimumEndIndex != _optimumCurrentIndex)\n\t\t\t{\n\t\t\t\tUInt32 lenRes = _optimum[_optimumCurrentIndex].PosPrev - _optimumCurrentIndex;\n\t\t\t\tbackRes = _optimum[_optimumCurrentIndex].BackPrev;\n\t\t\t\t_optimumCurrentIndex = _optimum[_optimumCurrentIndex].PosPrev;\n\t\t\t\treturn lenRes;\n\t\t\t}\n\t\t\t_optimumCurrentIndex = _optimumEndIndex = 0;\n\n\t\t\tUInt32 lenMain, numDistancePairs;\n\t\t\tif (!_longestMatchWasFound)\n\t\t\t{\n\t\t\t\tReadMatchDistances(out lenMain, out numDistancePairs);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlenMain = _longestMatchLength;\n\t\t\t\tnumDistancePairs = _numDistancePairs;\n\t\t\t\t_longestMatchWasFound = false;\n\t\t\t}\n\n\t\t\tUInt32 numAvailableBytes = _matchFinder.GetNumAvailableBytes() + 1;\n\t\t\tif (numAvailableBytes < 2)\n\t\t\t{\n\t\t\t\tbackRes = 0xFFFFFFFF;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif (numAvailableBytes > Base.kMatchMaxLen)\n\t\t\t\tnumAvailableBytes = Base.kMatchMaxLen;\n\n\t\t\tUInt32 repMaxIndex = 0;\n\t\t\tUInt32 i;\t\t\t\n\t\t\tfor (i = 0; i < Base.kNumRepDistances; i++)\n\t\t\t{\n\t\t\t\treps[i] = _repDistances[i];\n\t\t\t\trepLens[i] = _matchFinder.GetMatchLen(0 - 1, reps[i], Base.kMatchMaxLen);\n\t\t\t\tif (repLens[i] > repLens[repMaxIndex])\n\t\t\t\t\trepMaxIndex = i;\n\t\t\t}\n\t\t\tif (repLens[repMaxIndex] >= _numFastBytes)\n\t\t\t{\n\t\t\t\tbackRes = repMaxIndex;\n\t\t\t\tUInt32 lenRes = repLens[repMaxIndex];\n\t\t\t\tMovePos(lenRes - 1);\n\t\t\t\treturn lenRes;\n\t\t\t}\n\n\t\t\tif (lenMain >= _numFastBytes)\n\t\t\t{\n\t\t\t\tbackRes = _matchDistances[numDistancePairs - 1] + Base.kNumRepDistances;\n\t\t\t\tMovePos(lenMain - 1);\n\t\t\t\treturn lenMain;\n\t\t\t}\n\t\t\t\n\t\t\tByte currentByte = _matchFinder.GetIndexByte(0 - 1);\n\t\t\tByte matchByte = _matchFinder.GetIndexByte((Int32)(0 - _repDistances[0] - 1 - 1));\n\n\t\t\tif (lenMain < 2 && currentByte != matchByte && repLens[repMaxIndex] < 2)\n\t\t\t{\n\t\t\t\tbackRes = (UInt32)0xFFFFFFFF;\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\t_optimum[0].State = _state;\n\n\t\t\tUInt32 posState = (position & _posStateMask);\n\n\t\t\t_optimum[1].Price = _isMatch[(_state.Index << Base.kNumPosStatesBitsMax) + posState].GetPrice0() +\n\t\t\t\t\t_literalEncoder.GetSubCoder(position, _previousByte).GetPrice(!_state.IsCharState(), matchByte, currentByte);\n\t\t\t_optimum[1].MakeAsChar();\n\n\t\t\tUInt32 matchPrice = _isMatch[(_state.Index << Base.kNumPosStatesBitsMax) + posState].GetPrice1();\n\t\t\tUInt32 repMatchPrice = matchPrice + _isRep[_state.Index].GetPrice1();\n\n\t\t\tif (matchByte == currentByte)\n\t\t\t{\n\t\t\t\tUInt32 shortRepPrice = repMatchPrice + GetRepLen1Price(_state, posState);\n\t\t\t\tif (shortRepPrice < _optimum[1].Price)\n\t\t\t\t{\n\t\t\t\t\t_optimum[1].Price = shortRepPrice;\n\t\t\t\t\t_optimum[1].MakeAsShortRep();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tUInt32 lenEnd = ((lenMain >= repLens[repMaxIndex]) ? lenMain : repLens[repMaxIndex]);\n\n\t\t\tif(lenEnd < 2)\n\t\t\t{\n\t\t\t\tbackRes = _optimum[1].BackPrev;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\t\n\t\t\t_optimum[1].PosPrev = 0;\n\n\t\t\t_optimum[0].Backs0 = reps[0];\n\t\t\t_optimum[0].Backs1 = reps[1];\n\t\t\t_optimum[0].Backs2 = reps[2];\n\t\t\t_optimum[0].Backs3 = reps[3];\n\n\t\t\tUInt32 len = lenEnd;\n\t\t\tdo\n\t\t\t\t_optimum[len--].Price = kIfinityPrice;\n\t\t\twhile (len >= 2);\n\n\t\t\tfor (i = 0; i < Base.kNumRepDistances; i++)\n\t\t\t{\n\t\t\t\tUInt32 repLen = repLens[i];\n\t\t\t\tif (repLen < 2)\n\t\t\t\t\tcontinue;\n\t\t\t\tUInt32 price = repMatchPrice + GetPureRepPrice(i, _state, posState);\n\t\t\t\tdo\n\t\t\t\t{\n\t\t\t\t\tUInt32 curAndLenPrice = price + _repMatchLenEncoder.GetPrice(repLen - 2, posState);\n\t\t\t\t\tOptimal optimum = _optimum[repLen];\n\t\t\t\t\tif (curAndLenPrice < optimum.Price)\n\t\t\t\t\t{\n\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\toptimum.PosPrev = 0;\n\t\t\t\t\t\toptimum.BackPrev = i;\n\t\t\t\t\t\toptimum.Prev1IsChar = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\twhile (--repLen >= 2);\n\t\t\t}\n\n\t\t\tUInt32 normalMatchPrice = matchPrice + _isRep[_state.Index].GetPrice0();\n\t\t\t\n\t\t\tlen = ((repLens[0] >= 2) ? repLens[0] + 1 : 2);\n\t\t\tif (len <= lenMain)\n\t\t\t{\n\t\t\t\tUInt32 offs = 0;\n\t\t\t\twhile (len > _matchDistances[offs])\n\t\t\t\t\toffs += 2;\n\t\t\t\tfor (; ; len++)\n\t\t\t\t{\n\t\t\t\t\tUInt32 distance = _matchDistances[offs + 1];\n\t\t\t\t\tUInt32 curAndLenPrice = normalMatchPrice + GetPosLenPrice(distance, len, posState);\n\t\t\t\t\tOptimal optimum = _optimum[len];\n\t\t\t\t\tif (curAndLenPrice < optimum.Price)\n\t\t\t\t\t{\n\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\toptimum.PosPrev = 0;\n\t\t\t\t\t\toptimum.BackPrev = distance + Base.kNumRepDistances;\n\t\t\t\t\t\toptimum.Prev1IsChar = false;\n\t\t\t\t\t}\n\t\t\t\t\tif (len == _matchDistances[offs])\n\t\t\t\t\t{\n\t\t\t\t\t\toffs += 2;\n\t\t\t\t\t\tif (offs == numDistancePairs)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tUInt32 cur = 0;\n\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tcur++;\n\t\t\t\tif (cur == lenEnd)\n\t\t\t\t\treturn Backward(out backRes, cur);\n\t\t\t\tUInt32 newLen;\n\t\t\t\tReadMatchDistances(out newLen, out numDistancePairs);\n\t\t\t\tif (newLen >= _numFastBytes)\n\t\t\t\t{\n\t\t\t\t\t_numDistancePairs = numDistancePairs;\n\t\t\t\t\t_longestMatchLength = newLen;\n\t\t\t\t\t_longestMatchWasFound = true;\n\t\t\t\t\treturn Backward(out backRes, cur);\n\t\t\t\t}\n\t\t\t\tposition++;\n\t\t\t\tUInt32 posPrev = _optimum[cur].PosPrev;\n\t\t\t\tBase.State state;\n\t\t\t\tif (_optimum[cur].Prev1IsChar)\n\t\t\t\t{\n\t\t\t\t\tposPrev--;\n\t\t\t\t\tif (_optimum[cur].Prev2)\n\t\t\t\t\t{\n\t\t\t\t\t\tstate = _optimum[_optimum[cur].PosPrev2].State;\n\t\t\t\t\t\tif (_optimum[cur].BackPrev2 < Base.kNumRepDistances)\n\t\t\t\t\t\t\tstate.UpdateRep();\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tstate.UpdateMatch();\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tstate = _optimum[posPrev].State;\n\t\t\t\t\tstate.UpdateChar();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tstate = _optimum[posPrev].State;\n\t\t\t\tif (posPrev == cur - 1)\n\t\t\t\t{\n\t\t\t\t\tif (_optimum[cur].IsShortRep())\n\t\t\t\t\t\tstate.UpdateShortRep();\n\t\t\t\t\telse\n\t\t\t\t\t\tstate.UpdateChar();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tUInt32 pos;\n\t\t\t\t\tif (_optimum[cur].Prev1IsChar && _optimum[cur].Prev2)\n\t\t\t\t\t{\n\t\t\t\t\t\tposPrev = _optimum[cur].PosPrev2;\n\t\t\t\t\t\tpos = _optimum[cur].BackPrev2;\n\t\t\t\t\t\tstate.UpdateRep();\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tpos = _optimum[cur].BackPrev;\n\t\t\t\t\t\tif (pos < Base.kNumRepDistances)\n\t\t\t\t\t\t\tstate.UpdateRep();\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tstate.UpdateMatch();\n\t\t\t\t\t}\n\t\t\t\t\tOptimal opt = _optimum[posPrev];\n\t\t\t\t\tif (pos < Base.kNumRepDistances)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (pos == 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treps[0] = opt.Backs0;\n\t\t\t\t\t\t\treps[1] = opt.Backs1;\n\t\t\t\t\t\t\treps[2] = opt.Backs2;\n\t\t\t\t\t\t\treps[3] = opt.Backs3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (pos == 1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treps[0] = opt.Backs1;\n\t\t\t\t\t\t\treps[1] = opt.Backs0;\n\t\t\t\t\t\t\treps[2] = opt.Backs2;\n\t\t\t\t\t\t\treps[3] = opt.Backs3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (pos == 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treps[0] = opt.Backs2;\n\t\t\t\t\t\t\treps[1] = opt.Backs0;\n\t\t\t\t\t\t\treps[2] = opt.Backs1;\n\t\t\t\t\t\t\treps[3] = opt.Backs3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treps[0] = opt.Backs3;\n\t\t\t\t\t\t\treps[1] = opt.Backs0;\n\t\t\t\t\t\t\treps[2] = opt.Backs1;\n\t\t\t\t\t\t\treps[3] = opt.Backs2;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\treps[0] = (pos - Base.kNumRepDistances);\n\t\t\t\t\t\treps[1] = opt.Backs0;\n\t\t\t\t\t\treps[2] = opt.Backs1;\n\t\t\t\t\t\treps[3] = opt.Backs2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t_optimum[cur].State = state;\n\t\t\t\t_optimum[cur].Backs0 = reps[0];\n\t\t\t\t_optimum[cur].Backs1 = reps[1];\n\t\t\t\t_optimum[cur].Backs2 = reps[2];\n\t\t\t\t_optimum[cur].Backs3 = reps[3];\n\t\t\t\tUInt32 curPrice = _optimum[cur].Price;\n\n\t\t\t\tcurrentByte = _matchFinder.GetIndexByte(0 - 1);\n\t\t\t\tmatchByte = _matchFinder.GetIndexByte((Int32)(0 - reps[0] - 1 - 1));\n\n\t\t\t\tposState = (position & _posStateMask);\n\n\t\t\t\tUInt32 curAnd1Price = curPrice +\n\t\t\t\t\t_isMatch[(state.Index << Base.kNumPosStatesBitsMax) + posState].GetPrice0() +\n\t\t\t\t\t_literalEncoder.GetSubCoder(position, _matchFinder.GetIndexByte(0 - 2)).\n\t\t\t\t\tGetPrice(!state.IsCharState(), matchByte, currentByte);\n\n\t\t\t\tOptimal nextOptimum = _optimum[cur + 1];\n\n\t\t\t\tbool nextIsChar = false;\n\t\t\t\tif (curAnd1Price < nextOptimum.Price)\n\t\t\t\t{\n\t\t\t\t\tnextOptimum.Price = curAnd1Price;\n\t\t\t\t\tnextOptimum.PosPrev = cur;\n\t\t\t\t\tnextOptimum.MakeAsChar();\n\t\t\t\t\tnextIsChar = true;\n\t\t\t\t}\n\n\t\t\t\tmatchPrice = curPrice + _isMatch[(state.Index << Base.kNumPosStatesBitsMax) + posState].GetPrice1();\n\t\t\t\trepMatchPrice = matchPrice + _isRep[state.Index].GetPrice1();\n\n\t\t\t\tif (matchByte == currentByte &&\n\t\t\t\t\t!(nextOptimum.PosPrev < cur && nextOptimum.BackPrev == 0))\n\t\t\t\t{\n\t\t\t\t\tUInt32 shortRepPrice = repMatchPrice + GetRepLen1Price(state, posState);\n\t\t\t\t\tif (shortRepPrice <= nextOptimum.Price)\n\t\t\t\t\t{\n\t\t\t\t\t\tnextOptimum.Price = shortRepPrice;\n\t\t\t\t\t\tnextOptimum.PosPrev = cur;\n\t\t\t\t\t\tnextOptimum.MakeAsShortRep();\n\t\t\t\t\t\tnextIsChar = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tUInt32 numAvailableBytesFull = _matchFinder.GetNumAvailableBytes() + 1;\n\t\t\t\tnumAvailableBytesFull = Math.Min(kNumOpts - 1 - cur, numAvailableBytesFull);\n\t\t\t\tnumAvailableBytes = numAvailableBytesFull;\n\n\t\t\t\tif (numAvailableBytes < 2)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (numAvailableBytes > _numFastBytes)\n\t\t\t\t\tnumAvailableBytes = _numFastBytes;\n\t\t\t\tif (!nextIsChar && matchByte != currentByte)\n\t\t\t\t{\n\t\t\t\t\t// try Literal + rep0\n\t\t\t\t\tUInt32 t = Math.Min(numAvailableBytesFull - 1, _numFastBytes);\n\t\t\t\t\tUInt32 lenTest2 = _matchFinder.GetMatchLen(0, reps[0], t);\n\t\t\t\t\tif (lenTest2 >= 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tBase.State state2 = state;\n\t\t\t\t\t\tstate2.UpdateChar();\n\t\t\t\t\t\tUInt32 posStateNext = (position + 1) & _posStateMask;\n\t\t\t\t\t\tUInt32 nextRepMatchPrice = curAnd1Price +\n\t\t\t\t\t\t\t_isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice1() +\n\t\t\t\t\t\t\t_isRep[state2.Index].GetPrice1();\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tUInt32 offset = cur + 1 + lenTest2;\n\t\t\t\t\t\t\twhile (lenEnd < offset)\n\t\t\t\t\t\t\t\t_optimum[++lenEnd].Price = kIfinityPrice;\n\t\t\t\t\t\t\tUInt32 curAndLenPrice = nextRepMatchPrice + GetRepPrice(\n\t\t\t\t\t\t\t\t0, lenTest2, state2, posStateNext);\n\t\t\t\t\t\t\tOptimal optimum = _optimum[offset];\n\t\t\t\t\t\t\tif (curAndLenPrice < optimum.Price)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\t\t\toptimum.PosPrev = cur + 1;\n\t\t\t\t\t\t\t\toptimum.BackPrev = 0;\n\t\t\t\t\t\t\t\toptimum.Prev1IsChar = true;\n\t\t\t\t\t\t\t\toptimum.Prev2 = false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tUInt32 startLen = 2; // speed optimization \n\n\t\t\t\tfor (UInt32 repIndex = 0; repIndex < Base.kNumRepDistances; repIndex++)\n\t\t\t\t{\n\t\t\t\t\tUInt32 lenTest = _matchFinder.GetMatchLen(0 - 1, reps[repIndex], numAvailableBytes);\n\t\t\t\t\tif (lenTest < 2)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tUInt32 lenTestTemp = lenTest;\n\t\t\t\t\tdo\n\t\t\t\t\t{\n\t\t\t\t\t\twhile (lenEnd < cur + lenTest)\n\t\t\t\t\t\t\t_optimum[++lenEnd].Price = kIfinityPrice;\n\t\t\t\t\t\tUInt32 curAndLenPrice = repMatchPrice + GetRepPrice(repIndex, lenTest, state, posState);\n\t\t\t\t\t\tOptimal optimum = _optimum[cur + lenTest];\n\t\t\t\t\t\tif (curAndLenPrice < optimum.Price)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\t\toptimum.PosPrev = cur;\n\t\t\t\t\t\t\toptimum.BackPrev = repIndex;\n\t\t\t\t\t\t\toptimum.Prev1IsChar = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\twhile(--lenTest >= 2);\n\t\t\t\t\tlenTest = lenTestTemp;\n\n\t\t\t\t\tif (repIndex == 0)\n\t\t\t\t\t\tstartLen = lenTest + 1;\n\n\t\t\t\t\t// if (_maxMode)\n\t\t\t\t\tif (lenTest < numAvailableBytesFull)\n\t\t\t\t\t{\n\t\t\t\t\t\tUInt32 t = Math.Min(numAvailableBytesFull - 1 - lenTest, _numFastBytes);\n\t\t\t\t\t\tUInt32 lenTest2 = _matchFinder.GetMatchLen((Int32)lenTest, reps[repIndex], t);\n\t\t\t\t\t\tif (lenTest2 >= 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tBase.State state2 = state;\n\t\t\t\t\t\t\tstate2.UpdateRep();\n\t\t\t\t\t\t\tUInt32 posStateNext = (position + lenTest) & _posStateMask;\n\t\t\t\t\t\t\tUInt32 curAndLenCharPrice = \n\t\t\t\t\t\t\t\t\trepMatchPrice + GetRepPrice(repIndex, lenTest, state, posState) + \n\t\t\t\t\t\t\t\t\t_isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice0() +\n\t\t\t\t\t\t\t\t\t_literalEncoder.GetSubCoder(position + lenTest, \n\t\t\t\t\t\t\t\t\t_matchFinder.GetIndexByte((Int32)lenTest - 1 - 1)).GetPrice(true,\n\t\t\t\t\t\t\t\t\t_matchFinder.GetIndexByte((Int32)((Int32)lenTest - 1 - (Int32)(reps[repIndex] + 1))), \n\t\t\t\t\t\t\t\t\t_matchFinder.GetIndexByte((Int32)lenTest - 1));\n\t\t\t\t\t\t\tstate2.UpdateChar();\n\t\t\t\t\t\t\tposStateNext = (position + lenTest + 1) & _posStateMask;\n\t\t\t\t\t\t\tUInt32 nextMatchPrice = curAndLenCharPrice + _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice1();\n\t\t\t\t\t\t\tUInt32 nextRepMatchPrice = nextMatchPrice + _isRep[state2.Index].GetPrice1();\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// for(; lenTest2 >= 2; lenTest2--)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tUInt32 offset = lenTest + 1 + lenTest2;\n\t\t\t\t\t\t\t\twhile(lenEnd < cur + offset)\n\t\t\t\t\t\t\t\t\t_optimum[++lenEnd].Price = kIfinityPrice;\n\t\t\t\t\t\t\t\tUInt32 curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext);\n\t\t\t\t\t\t\t\tOptimal optimum = _optimum[cur + offset];\n\t\t\t\t\t\t\t\tif (curAndLenPrice < optimum.Price) \n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\t\t\t\toptimum.PosPrev = cur + lenTest + 1;\n\t\t\t\t\t\t\t\t\toptimum.BackPrev = 0;\n\t\t\t\t\t\t\t\t\toptimum.Prev1IsChar = true;\n\t\t\t\t\t\t\t\t\toptimum.Prev2 = true;\n\t\t\t\t\t\t\t\t\toptimum.PosPrev2 = cur;\n\t\t\t\t\t\t\t\t\toptimum.BackPrev2 = repIndex;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (newLen > numAvailableBytes)\n\t\t\t\t{\n\t\t\t\t\tnewLen = numAvailableBytes;\n\t\t\t\t\tfor (numDistancePairs = 0; newLen > _matchDistances[numDistancePairs]; numDistancePairs += 2) ;\n\t\t\t\t\t_matchDistances[numDistancePairs] = newLen;\n\t\t\t\t\tnumDistancePairs += 2;\n\t\t\t\t}\n\t\t\t\tif (newLen >= startLen)\n\t\t\t\t{\n\t\t\t\t\tnormalMatchPrice = matchPrice + _isRep[state.Index].GetPrice0();\n\t\t\t\t\twhile (lenEnd < cur + newLen)\n\t\t\t\t\t\t_optimum[++lenEnd].Price = kIfinityPrice;\n\n\t\t\t\t\tUInt32 offs = 0;\n\t\t\t\t\twhile (startLen > _matchDistances[offs])\n\t\t\t\t\t\toffs += 2;\n\n\t\t\t\t\tfor (UInt32 lenTest = startLen; ; lenTest++)\n\t\t\t\t\t{\n\t\t\t\t\t\tUInt32 curBack = _matchDistances[offs + 1];\n\t\t\t\t\t\tUInt32 curAndLenPrice = normalMatchPrice + GetPosLenPrice(curBack, lenTest, posState);\n\t\t\t\t\t\tOptimal optimum = _optimum[cur + lenTest];\n\t\t\t\t\t\tif (curAndLenPrice < optimum.Price)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\t\toptimum.PosPrev = cur;\n\t\t\t\t\t\t\toptimum.BackPrev = curBack + Base.kNumRepDistances;\n\t\t\t\t\t\t\toptimum.Prev1IsChar = false;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (lenTest == _matchDistances[offs])\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (lenTest < numAvailableBytesFull)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tUInt32 t = Math.Min(numAvailableBytesFull - 1 - lenTest, _numFastBytes);\n\t\t\t\t\t\t\t\tUInt32 lenTest2 = _matchFinder.GetMatchLen((Int32)lenTest, curBack, t);\n\t\t\t\t\t\t\t\tif (lenTest2 >= 2)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tBase.State state2 = state;\n\t\t\t\t\t\t\t\t\tstate2.UpdateMatch();\n\t\t\t\t\t\t\t\t\tUInt32 posStateNext = (position + lenTest) & _posStateMask;\n\t\t\t\t\t\t\t\t\tUInt32 curAndLenCharPrice = curAndLenPrice +\n\t\t\t\t\t\t\t\t\t\t_isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice0() +\n\t\t\t\t\t\t\t\t\t\t_literalEncoder.GetSubCoder(position + lenTest,\n\t\t\t\t\t\t\t\t\t\t_matchFinder.GetIndexByte((Int32)lenTest - 1 - 1)).\n\t\t\t\t\t\t\t\t\t\tGetPrice(true,\n\t\t\t\t\t\t\t\t\t\t_matchFinder.GetIndexByte((Int32)lenTest - (Int32)(curBack + 1) - 1),\n\t\t\t\t\t\t\t\t\t\t_matchFinder.GetIndexByte((Int32)lenTest - 1));\n\t\t\t\t\t\t\t\t\tstate2.UpdateChar();\n\t\t\t\t\t\t\t\t\tposStateNext = (position + lenTest + 1) & _posStateMask;\n\t\t\t\t\t\t\t\t\tUInt32 nextMatchPrice = curAndLenCharPrice + _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice1();\n\t\t\t\t\t\t\t\t\tUInt32 nextRepMatchPrice = nextMatchPrice + _isRep[state2.Index].GetPrice1();\n\n\t\t\t\t\t\t\t\t\tUInt32 offset = lenTest + 1 + lenTest2;\n\t\t\t\t\t\t\t\t\twhile (lenEnd < cur + offset)\n\t\t\t\t\t\t\t\t\t\t_optimum[++lenEnd].Price = kIfinityPrice;\n\t\t\t\t\t\t\t\t\tcurAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext);\n\t\t\t\t\t\t\t\t\toptimum = _optimum[cur + offset];\n\t\t\t\t\t\t\t\t\tif (curAndLenPrice < optimum.Price)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\toptimum.Price = curAndLenPrice;\n\t\t\t\t\t\t\t\t\t\toptimum.PosPrev = cur + lenTest + 1;\n\t\t\t\t\t\t\t\t\t\toptimum.BackPrev = 0;\n\t\t\t\t\t\t\t\t\t\toptimum.Prev1IsChar = true;\n\t\t\t\t\t\t\t\t\t\toptimum.Prev2 = true;\n\t\t\t\t\t\t\t\t\t\toptimum.PosPrev2 = cur;\n\t\t\t\t\t\t\t\t\t\toptimum.BackPrev2 = curBack + Base.kNumRepDistances;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\toffs += 2;\n\t\t\t\t\t\t\tif (offs == numDistancePairs)\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbool ChangePair(UInt32 smallDist, UInt32 bigDist)\n\t\t{\n\t\t\tconst int kDif = 7;\n\t\t\treturn (smallDist < ((UInt32)(1) << (32 - kDif)) && bigDist >= (smallDist << kDif));\n\t\t}\n\n\t\tvoid WriteEndMarker(UInt32 posState)\n\t\t{\n\t\t\tif (!_writeEndMark)\n\t\t\t\treturn;\n\n\t\t\t_isMatch[(_state.Index << Base.kNumPosStatesBitsMax) + posState].Encode(_rangeEncoder, 1);\n\t\t\t_isRep[_state.Index].Encode(_rangeEncoder, 0);\n\t\t\t_state.UpdateMatch();\n\t\t\tUInt32 len = Base.kMatchMinLen;\n\t\t\t_lenEncoder.Encode(_rangeEncoder, len - Base.kMatchMinLen, posState);\n\t\t\tUInt32 posSlot = (1 << Base.kNumPosSlotBits) - 1;\n\t\t\tUInt32 lenToPosState = Base.GetLenToPosState(len);\n\t\t\t_posSlotEncoder[lenToPosState].Encode(_rangeEncoder, posSlot);\n\t\t\tint footerBits = 30;\n\t\t\tUInt32 posReduced = (((UInt32)1) << footerBits) - 1;\n\t\t\t_rangeEncoder.EncodeDirectBits(posReduced >> Base.kNumAlignBits, footerBits - Base.kNumAlignBits);\n\t\t\t_posAlignEncoder.ReverseEncode(_rangeEncoder, posReduced & Base.kAlignMask);\n\t\t}\n\n\t\tvoid Flush(UInt32 nowPos)\n\t\t{\n\t\t\tReleaseMFStream();\n\t\t\tWriteEndMarker(nowPos & _posStateMask);\n\t\t\t_rangeEncoder.FlushData();\n\t\t\t_rangeEncoder.FlushStream();\n\t\t}\n\n\t\tpublic void CodeOneBlock(out Int64 inSize, out Int64 outSize, out bool finished)\n\t\t{\n\t\t\tinSize = 0;\n\t\t\toutSize = 0;\n\t\t\tfinished = true;\n\n\t\t\tif (_inStream != null)\n\t\t\t{\n\t\t\t\t_matchFinder.SetStream(_inStream);\n\t\t\t\t_matchFinder.Init();\n\t\t\t\t_needReleaseMFStream = true;\n\t\t\t\t_inStream = null;\n\t\t\t\tif (_trainSize > 0)\n\t\t\t\t\t_matchFinder.Skip(_trainSize);\n\t\t\t}\n\n\t\t\tif (_finished)\n\t\t\t\treturn;\n\t\t\t_finished = true;\n\n\n\t\t\tInt64 progressPosValuePrev = nowPos64;\n\t\t\tif (nowPos64 == 0)\n\t\t\t{\n\t\t\t\tif (_matchFinder.GetNumAvailableBytes() == 0)\n\t\t\t\t{\n\t\t\t\t\tFlush((UInt32)nowPos64);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tUInt32 len, numDistancePairs; // it's not used\n\t\t\t\tReadMatchDistances(out len, out numDistancePairs);\n\t\t\t\tUInt32 posState = (UInt32)(nowPos64) & _posStateMask;\n\t\t\t\t_isMatch[(_state.Index << Base.kNumPosStatesBitsMax) + posState].Encode(_rangeEncoder, 0);\n\t\t\t\t_state.UpdateChar();\n\t\t\t\tByte curByte = _matchFinder.GetIndexByte((Int32)(0 - _additionalOffset));\n\t\t\t\t_literalEncoder.GetSubCoder((UInt32)(nowPos64), _previousByte).Encode(_rangeEncoder, curByte);\n\t\t\t\t_previousByte = curByte;\n\t\t\t\t_additionalOffset--;\n\t\t\t\tnowPos64++;\n\t\t\t}\n\t\t\tif (_matchFinder.GetNumAvailableBytes() == 0)\n\t\t\t{\n\t\t\t\tFlush((UInt32)nowPos64);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tUInt32 pos;\n\t\t\t\tUInt32 len = GetOptimum((UInt32)nowPos64, out pos);\n\t\t\t\t\n\t\t\t\tUInt32 posState = ((UInt32)nowPos64) & _posStateMask;\n\t\t\t\tUInt32 complexState = (_state.Index << Base.kNumPosStatesBitsMax) + posState;\n\t\t\t\tif (len == 1 && pos == 0xFFFFFFFF)\n\t\t\t\t{\n\t\t\t\t\t_isMatch[complexState].Encode(_rangeEncoder, 0);\n\t\t\t\t\tByte curByte = _matchFinder.GetIndexByte((Int32)(0 - _additionalOffset));\n\t\t\t\t\tLiteralEncoder.Encoder2 subCoder = _literalEncoder.GetSubCoder((UInt32)nowPos64, _previousByte);\n\t\t\t\t\tif (!_state.IsCharState())\n\t\t\t\t\t{\n\t\t\t\t\t\tByte matchByte = _matchFinder.GetIndexByte((Int32)(0 - _repDistances[0] - 1 - _additionalOffset));\n\t\t\t\t\t\tsubCoder.EncodeMatched(_rangeEncoder, matchByte, curByte);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tsubCoder.Encode(_rangeEncoder, curByte);\n\t\t\t\t\t_previousByte = curByte;\n\t\t\t\t\t_state.UpdateChar();\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t_isMatch[complexState].Encode(_rangeEncoder, 1);\n\t\t\t\t\tif (pos < Base.kNumRepDistances)\n\t\t\t\t\t{\n\t\t\t\t\t\t_isRep[_state.Index].Encode(_rangeEncoder, 1);\n\t\t\t\t\t\tif (pos == 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_isRepG0[_state.Index].Encode(_rangeEncoder, 0);\n\t\t\t\t\t\t\tif (len == 1)\n\t\t\t\t\t\t\t\t_isRep0Long[complexState].Encode(_rangeEncoder, 0);\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t_isRep0Long[complexState].Encode(_rangeEncoder, 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_isRepG0[_state.Index].Encode(_rangeEncoder, 1);\n\t\t\t\t\t\t\tif (pos == 1)\n\t\t\t\t\t\t\t\t_isRepG1[_state.Index].Encode(_rangeEncoder, 0);\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t_isRepG1[_state.Index].Encode(_rangeEncoder, 1);\n\t\t\t\t\t\t\t\t_isRepG2[_state.Index].Encode(_rangeEncoder, pos - 2);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (len == 1)\n\t\t\t\t\t\t\t_state.UpdateShortRep();\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_repMatchLenEncoder.Encode(_rangeEncoder, len - Base.kMatchMinLen, posState);\n\t\t\t\t\t\t\t_state.UpdateRep();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tUInt32 distance = _repDistances[pos];\n\t\t\t\t\t\tif (pos != 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor (UInt32 i = pos; i >= 1; i--)\n\t\t\t\t\t\t\t\t_repDistances[i] = _repDistances[i - 1];\n\t\t\t\t\t\t\t_repDistances[0] = distance;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t_isRep[_state.Index].Encode(_rangeEncoder, 0);\n\t\t\t\t\t\t_state.UpdateMatch();\n\t\t\t\t\t\t_lenEncoder.Encode(_rangeEncoder, len - Base.kMatchMinLen, posState);\n\t\t\t\t\t\tpos -= Base.kNumRepDistances;\n\t\t\t\t\t\tUInt32 posSlot = GetPosSlot(pos);\n\t\t\t\t\t\tUInt32 lenToPosState = Base.GetLenToPosState(len);\n\t\t\t\t\t\t_posSlotEncoder[lenToPosState].Encode(_rangeEncoder, posSlot);\n\n\t\t\t\t\t\tif (posSlot >= Base.kStartPosModelIndex)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint footerBits = (int)((posSlot >> 1) - 1);\n\t\t\t\t\t\t\tUInt32 baseVal = ((2 | (posSlot & 1)) << footerBits);\n\t\t\t\t\t\t\tUInt32 posReduced = pos - baseVal;\n\n\t\t\t\t\t\t\tif (posSlot < Base.kEndPosModelIndex)\n\t\t\t\t\t\t\t\tRangeCoder.BitTreeEncoder.ReverseEncode(_posEncoders,\n\t\t\t\t\t\t\t\t\t\tbaseVal - posSlot - 1, _rangeEncoder, footerBits, posReduced);\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t_rangeEncoder.EncodeDirectBits(posReduced >> Base.kNumAlignBits, footerBits - Base.kNumAlignBits);\n\t\t\t\t\t\t\t\t_posAlignEncoder.ReverseEncode(_rangeEncoder, posReduced & Base.kAlignMask);\n\t\t\t\t\t\t\t\t_alignPriceCount++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tUInt32 distance = pos;\n\t\t\t\t\t\tfor (UInt32 i = Base.kNumRepDistances - 1; i >= 1; i--)\n\t\t\t\t\t\t\t_repDistances[i] = _repDistances[i - 1];\n\t\t\t\t\t\t_repDistances[0] = distance;\n\t\t\t\t\t\t_matchPriceCount++;\n\t\t\t\t\t}\n\t\t\t\t\t_previousByte = _matchFinder.GetIndexByte((Int32)(len - 1 - _additionalOffset));\n\t\t\t\t}\n\t\t\t\t_additionalOffset -= len;\n\t\t\t\tnowPos64 += len;\n\t\t\t\tif (_additionalOffset == 0)\n\t\t\t\t{\n\t\t\t\t\t// if (!_fastMode)\n\t\t\t\t\tif (_matchPriceCount >= (1 << 7))\n\t\t\t\t\t\tFillDistancesPrices();\n\t\t\t\t\tif (_alignPriceCount >= Base.kAlignTableSize)\n\t\t\t\t\t\tFillAlignPrices();\n\t\t\t\t\tinSize = nowPos64;\n\t\t\t\t\toutSize = _rangeEncoder.GetProcessedSizeAdd();\n\t\t\t\t\tif (_matchFinder.GetNumAvailableBytes() == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tFlush((UInt32)nowPos64);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (nowPos64 - progressPosValuePrev >= (1 << 12))\n\t\t\t\t\t{\n\t\t\t\t\t\t_finished = false;\n\t\t\t\t\t\tfinished = false;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvoid ReleaseMFStream()\n\t\t{\n\t\t\tif (_matchFinder != null && _needReleaseMFStream)\n\t\t\t{\n\t\t\t\t_matchFinder.ReleaseStream();\n\t\t\t\t_needReleaseMFStream = false;\n\t\t\t}\n\t\t}\n\n\t\tvoid SetOutStream(System.IO.Stream outStream) { _rangeEncoder.SetStream(outStream); }\n\t\tvoid ReleaseOutStream() { _rangeEncoder.ReleaseStream(); }\n\n\t\tvoid ReleaseStreams()\n\t\t{\n\t\t\tReleaseMFStream();\n\t\t\tReleaseOutStream();\n\t\t}\n\n\t\tvoid SetStreams(System.IO.Stream inStream, System.IO.Stream outStream,\n\t\t\t\tInt64 inSize, Int64 outSize)\n\t\t{\n\t\t\t_inStream = inStream;\n\t\t\t_finished = false;\n\t\t\tCreate();\n\t\t\tSetOutStream(outStream);\n\t\t\tInit();\n\n\t\t\t// if (!_fastMode)\n\t\t\t{\n\t\t\t\tFillDistancesPrices();\n\t\t\t\tFillAlignPrices();\n\t\t\t}\n\n\t\t\t_lenEncoder.SetTableSize(_numFastBytes + 1 - Base.kMatchMinLen);\n\t\t\t_lenEncoder.UpdateTables((UInt32)1 << _posStateBits);\n\t\t\t_repMatchLenEncoder.SetTableSize(_numFastBytes + 1 - Base.kMatchMinLen);\n\t\t\t_repMatchLenEncoder.UpdateTables((UInt32)1 << _posStateBits);\n\n\t\t\tnowPos64 = 0;\n\t\t}\n\n\n\t\tpublic void Code(System.IO.Stream inStream, System.IO.Stream outStream,\n\t\t\tInt64 inSize, Int64 outSize, ICodeProgress progress)\n\t\t{\n\t\t\t_needReleaseMFStream = false;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tSetStreams(inStream, outStream, inSize, outSize);\n\t\t\t\twhile (true)\n\t\t\t\t{\n\t\t\t\t\tInt64 processedInSize;\n\t\t\t\t\tInt64 processedOutSize;\n\t\t\t\t\tbool finished;\n\t\t\t\t\tCodeOneBlock(out processedInSize, out processedOutSize, out finished);\n\t\t\t\t\tif (finished)\n\t\t\t\t\t\treturn;\n\t\t\t\t\tif (progress != null)\n\t\t\t\t\t{\n\t\t\t\t\t\tprogress.SetProgress(processedInSize, processedOutSize);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfinally\n\t\t\t{\n\t\t\t\tReleaseStreams();\n\t\t\t}\n\t\t}\n\n\t\tconst int kPropSize = 5;\n\t\tByte[] properties = new Byte[kPropSize];\n\n\t\tpublic void WriteCoderProperties(System.IO.Stream outStream)\n\t\t{\n\t\t\tproperties[0] = (Byte)((_posStateBits * 5 + _numLiteralPosStateBits) * 9 + _numLiteralContextBits);\n\t\t\tfor (int i = 0; i < 4; i++)\n\t\t\t\tproperties[1 + i] = (Byte)((_dictionarySize >> (8 * i)) & 0xFF);\n\t\t\toutStream.Write(properties, 0, kPropSize);\n\t\t}\n\t\t\n\t\tUInt32[] tempPrices = new UInt32[Base.kNumFullDistances];\n\t\tUInt32 _matchPriceCount;\n\n\t\tvoid FillDistancesPrices()\n\t\t{\n\t\t\tfor (UInt32 i = Base.kStartPosModelIndex; i < Base.kNumFullDistances; i++)\n\t\t\t{ \n\t\t\t\tUInt32 posSlot = GetPosSlot(i);\n\t\t\t\tint footerBits = (int)((posSlot >> 1) - 1);\n\t\t\t\tUInt32 baseVal = ((2 | (posSlot & 1)) << footerBits);\n\t\t\t\ttempPrices[i] = BitTreeEncoder.ReverseGetPrice(_posEncoders, \n\t\t\t\t\tbaseVal - posSlot - 1, footerBits, i - baseVal);\n\t\t\t}\n\n\t\t\tfor (UInt32 lenToPosState = 0; lenToPosState < Base.kNumLenToPosStates; lenToPosState++)\n\t\t\t{\n\t\t\t\tUInt32 posSlot;\n\t\t\t\tRangeCoder.BitTreeEncoder encoder = _posSlotEncoder[lenToPosState];\n\t\t\t\n\t\t\t\tUInt32 st = (lenToPosState << Base.kNumPosSlotBits);\n\t\t\t\tfor (posSlot = 0; posSlot < _distTableSize; posSlot++)\n\t\t\t\t\t_posSlotPrices[st + posSlot] = encoder.GetPrice(posSlot);\n\t\t\t\tfor (posSlot = Base.kEndPosModelIndex; posSlot < _distTableSize; posSlot++)\n\t\t\t\t\t_posSlotPrices[st + posSlot] += ((((posSlot >> 1) - 1) - Base.kNumAlignBits) << RangeCoder.BitEncoder.kNumBitPriceShiftBits);\n\n\t\t\t\tUInt32 st2 = lenToPosState * Base.kNumFullDistances;\n\t\t\t\tUInt32 i;\n\t\t\t\tfor (i = 0; i < Base.kStartPosModelIndex; i++)\n\t\t\t\t\t_distancesPrices[st2 + i] = _posSlotPrices[st + i];\n\t\t\t\tfor (; i < Base.kNumFullDistances; i++)\n\t\t\t\t\t_distancesPrices[st2 + i] = _posSlotPrices[st + GetPosSlot(i)] + tempPrices[i];\n\t\t\t}\n\t\t\t_matchPriceCount = 0;\n\t\t}\n\n\t\tvoid FillAlignPrices()\n\t\t{\n\t\t\tfor (UInt32 i = 0; i < Base.kAlignTableSize; i++)\n\t\t\t\t_alignPrices[i] = _posAlignEncoder.ReverseGetPrice(i);\n\t\t\t_alignPriceCount = 0;\n\t\t}\n\n\n\t\tstatic string[] kMatchFinderIDs = \n\t\t{\n\t\t\t\"BT2\",\n\t\t\t\"BT4\",\n\t\t};\n\n\t\tstatic int FindMatchFinder(string s)\n\t\t{\n\t\t\tfor (int m = 0; m < kMatchFinderIDs.Length; m++)\n\t\t\t\tif (s == kMatchFinderIDs[m])\n\t\t\t\t\treturn m;\n\t\t\treturn -1;\n\t\t}\n\t\n\t\tpublic void SetCoderProperties(CoderPropID[] propIDs, object[] properties)\n\t\t{\n\t\t\tfor (UInt32 i = 0; i < properties.Length; i++)\n\t\t\t{\n\t\t\t\tobject prop = properties[i];\n\t\t\t\tswitch (propIDs[i])\n\t\t\t\t{\n\t\t\t\t\tcase CoderPropID.NumFastBytes:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!(prop is Int32))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tInt32 numFastBytes = (Int32)prop;\n\t\t\t\t\t\tif (numFastBytes < 5 || numFastBytes > Base.kMatchMaxLen)\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\t_numFastBytes = (UInt32)numFastBytes;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.Algorithm:\n\t\t\t\t\t{\n\t\t\t\t\t\t/*\n\t\t\t\t\t\tif (!(prop is Int32))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tInt32 maximize = (Int32)prop;\n\t\t\t\t\t\t_fastMode = (maximize == 0);\n\t\t\t\t\t\t_maxMode = (maximize >= 2);\n\t\t\t\t\t\t*/\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.MatchFinder:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!(prop is String))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tEMatchFinderType matchFinderIndexPrev = _matchFinderType;\n\t\t\t\t\t\tint m = FindMatchFinder(((string)prop).ToUpper());\n\t\t\t\t\t\tif (m < 0)\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\t_matchFinderType = (EMatchFinderType)m;\n\t\t\t\t\t\tif (_matchFinder != null && matchFinderIndexPrev != _matchFinderType)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t_dictionarySizePrev = 0xFFFFFFFF;\n\t\t\t\t\t\t\t_matchFinder = null;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.DictionarySize:\n\t\t\t\t\t{\n\t\t\t\t\t\tconst int kDicLogSizeMaxCompress = 30;\n\t\t\t\t\t\tif (!(prop is Int32))\n\t\t\t\t\t\t\tthrow new InvalidParamException(); ;\n\t\t\t\t\t\tInt32 dictionarySize = (Int32)prop;\n\t\t\t\t\t\tif (dictionarySize < (UInt32)(1 << Base.kDicLogSizeMin) ||\n\t\t\t\t\t\t\tdictionarySize > (UInt32)(1 << kDicLogSizeMaxCompress))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\t_dictionarySize = (UInt32)dictionarySize;\n\t\t\t\t\t\tint dicLogSize;\n\t\t\t\t\t\tfor (dicLogSize = 0; dicLogSize < (UInt32)kDicLogSizeMaxCompress; dicLogSize++)\n\t\t\t\t\t\t\tif (dictionarySize <= ((UInt32)(1) << dicLogSize))\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t_distTableSize = (UInt32)dicLogSize * 2;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.PosStateBits:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!(prop is Int32))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tInt32 v = (Int32)prop;\n\t\t\t\t\t\tif (v < 0 || v > (UInt32)Base.kNumPosStatesBitsEncodingMax)\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\t_posStateBits = (int)v;\n\t\t\t\t\t\t_posStateMask = (((UInt32)1) << (int)_posStateBits) - 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.LitPosBits:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!(prop is Int32))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tInt32 v = (Int32)prop;\n\t\t\t\t\t\tif (v < 0 || v > (UInt32)Base.kNumLitPosStatesBitsEncodingMax)\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\t_numLiteralPosStateBits = (int)v;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.LitContextBits:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!(prop is Int32))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tInt32 v = (Int32)prop;\n\t\t\t\t\t\tif (v < 0 || v > (UInt32)Base.kNumLitContextBitsMax)\n\t\t\t\t\t\t\tthrow new InvalidParamException(); ;\n\t\t\t\t\t\t_numLiteralContextBits = (int)v;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase CoderPropID.EndMarker:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!(prop is Boolean))\n\t\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t\t\tSetWriteEndMarkerMode((Boolean)prop);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tthrow new InvalidParamException();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tuint _trainSize = 0;\n\t\tpublic void SetTrainSize(uint trainSize)\n\t\t{\n\t\t\t_trainSize = trainSize;\n\t\t}\n\t\t\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/RangeCoder/RangeCoder.cs", "content": "using System;\n\nnamespace SevenZip.Compression.RangeCoder\n{\n\tclass Encoder\n\t{\n\t\tpublic const uint kTopValue = (1 << 24);\n\n\t\tSystem.IO.Stream Stream;\n\n\t\tpublic UInt64 Low;\n\t\tpublic uint Range;\n\t\tuint _cacheSize;\n\t\tbyte _cache;\n\n\t\tlong StartPosition;\n\n\t\tpublic void SetStream(System.IO.Stream stream)\n\t\t{\n\t\t\tStream = stream;\n\t\t}\n\n\t\tpublic void ReleaseStream()\n\t\t{\n\t\t\tStream = null;\n\t\t}\n\n\t\tpublic void Init()\n\t\t{\n\t\t\tStartPosition = Stream.Position;\n\n\t\t\tLow = 0;\n\t\t\tRange = 0xFFFFFFFF;\n\t\t\t_cacheSize = 1;\n\t\t\t_cache = 0;\n\t\t}\n\n\t\tpublic void FlushData()\n\t\t{\n\t\t\tfor (int i = 0; i < 5; i++)\n\t\t\t\tShiftLow();\n\t\t}\n\n\t\tpublic void FlushStream()\n\t\t{\n\t\t\tStream.Flush();\n\t\t}\n\n\t\tpublic void CloseStream()\n\t\t{\n\t\t\tStream.Close();\n\t\t}\n\n\t\tpublic void Encode(uint start, uint size, uint total)\n\t\t{\n\t\t\tLow += start * (Range /= total);\n\t\t\tRange *= size;\n\t\t\twhile (Range < kTopValue)\n\t\t\t{\n\t\t\t\tRange <<= 8;\n\t\t\t\tShiftLow();\n\t\t\t}\n\t\t}\n\n\t\tpublic void ShiftLow()\n\t\t{\n\t\t\tif ((uint)Low < (uint)0xFF000000 || (uint)(Low >> 32) == 1)\n\t\t\t{\n\t\t\t\tbyte temp = _cache;\n\t\t\t\tdo\n\t\t\t\t{\n\t\t\t\t\tStream.WriteByte((byte)(temp + (Low >> 32)));\n\t\t\t\t\ttemp = 0xFF;\n\t\t\t\t}\n\t\t\t\twhile (--_cacheSize != 0);\n\t\t\t\t_cache = (byte)(((uint)Low) >> 24);\n\t\t\t}\n\t\t\t_cacheSize++;\n\t\t\tLow = ((uint)Low) << 8;\n\t\t}\n\n\t\tpublic void EncodeDirectBits(uint v, int numTotalBits)\n\t\t{\n\t\t\tfor (int i = numTotalBits - 1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tRange >>= 1;\n\t\t\t\tif (((v >> i) & 1) == 1)\n\t\t\t\t\tLow += Range;\n\t\t\t\tif (Range < kTopValue)\n\t\t\t\t{\n\t\t\t\t\tRange <<= 8;\n\t\t\t\t\tShiftLow();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic void EncodeBit(uint size0, int numTotalBits, uint symbol)\n\t\t{\n\t\t\tuint newBound = (Range >> numTotalBits) * size0;\n\t\t\tif (symbol == 0)\n\t\t\t\tRange = newBound;\n\t\t\telse\n\t\t\t{\n\t\t\t\tLow += newBound;\n\t\t\t\tRange -= newBound;\n\t\t\t}\n\t\t\twhile (Range < kTopValue)\n\t\t\t{\n\t\t\t\tRange <<= 8;\n\t\t\t\tShiftLow();\n\t\t\t}\n\t\t}\n\n\t\tpublic long GetProcessedSizeAdd()\n\t\t{\n\t\t\treturn _cacheSize +\n\t\t\t\tStream.Position - StartPosition + 4;\n\t\t\t// (long)Stream.GetProcessedSize();\n\t\t}\n\t}\n\n\tclass Decoder\n\t{\n\t\tpublic const uint kTopValue = (1 << 24);\n\t\tpublic uint Range;\n\t\tpublic uint Code;\n\t\t// public Buffer.InBuffer Stream = new Buffer.InBuffer(1 << 16);\n\t\tpublic System.IO.Stream Stream;\n\n\t\tpublic void Init(System.IO.Stream stream)\n\t\t{\n\t\t\t// Stream.Init(stream);\n\t\t\tStream = stream;\n\n\t\t\tCode = 0;\n\t\t\tRange = 0xFFFFFFFF;\n\t\t\tfor (int i = 0; i < 5; i++)\n\t\t\t\tCode = (Code << 8) | (byte)Stream.ReadByte();\n\t\t}\n\n\t\tpublic void ReleaseStream()\n\t\t{\n\t\t\t// Stream.ReleaseStream();\n\t\t\tStream = null;\n\t\t}\n\n\t\tpublic void CloseStream()\n\t\t{\n\t\t\tStream.Close();\n\t\t}\n\n\t\tpublic void Normalize()\n\t\t{\n\t\t\twhile (Range < kTopValue)\n\t\t\t{\n\t\t\t\tCode = (Code << 8) | (byte)Stream.ReadByte();\n\t\t\t\tRange <<= 8;\n\t\t\t}\n\t\t}\n\n\t\tpublic void Normalize2()\n\t\t{\n\t\t\tif (Range < kTopValue)\n\t\t\t{\n\t\t\t\tCode = (Code << 8) | (byte)Stream.ReadByte();\n\t\t\t\tRange <<= 8;\n\t\t\t}\n\t\t}\n\n\t\tpublic uint GetThreshold(uint total)\n\t\t{\n\t\t\treturn Code / (Range /= total);\n\t\t}\n\n\t\tpublic void Decode(uint start, uint size, uint total)\n\t\t{\n\t\t\tCode -= start * Range;\n\t\t\tRange *= size;\n\t\t\tNormalize();\n\t\t}\n\n\t\tpublic uint DecodeDirectBits(int numTotalBits)\n\t\t{\n\t\t\tuint range = Range;\n\t\t\tuint code = Code;\n\t\t\tuint result = 0;\n\t\t\tfor (int i = numTotalBits; i > 0; i--)\n\t\t\t{\n\t\t\t\trange >>= 1;\n\t\t\t\t/*\n\t\t\t\tresult <<= 1;\n\t\t\t\tif (code >= range)\n\t\t\t\t{\n\t\t\t\t\tcode -= range;\n\t\t\t\t\tresult |= 1;\n\t\t\t\t}\n\t\t\t\t*/\n\t\t\t\tuint t = (code - range) >> 31;\n\t\t\t\tcode -= range & (t - 1);\n\t\t\t\tresult = (result << 1) | (1 - t);\n\n\t\t\t\tif (range < kTopValue)\n\t\t\t\t{\n\t\t\t\t\tcode = (code << 8) | (byte)Stream.ReadByte();\n\t\t\t\t\trange <<= 8;\n\t\t\t\t}\n\t\t\t}\n\t\t\tRange = range;\n\t\t\tCode = code;\n\t\t\treturn result;\n\t\t}\n\n\t\tpublic uint DecodeBit(uint size0, int numTotalBits)\n\t\t{\n\t\t\tuint newBound = (Range >> numTotalBits) * size0;\n\t\t\tuint symbol;\n\t\t\tif (Code < newBound)\n\t\t\t{\n\t\t\t\tsymbol = 0;\n\t\t\t\tRange = newBound;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsymbol = 1;\n\t\t\t\tCode -= newBound;\n\t\t\t\tRange -= newBound;\n\t\t\t}\n\t\t\tNormalize();\n\t\t\treturn symbol;\n\t\t}\n\n\t\t// ulong GetProcessedSize() {return Stream.GetProcessedSize(); }\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/RangeCoder/RangeCoderBit.cs", "content": "using System;\n\nnamespace SevenZip.Compression.RangeCoder\n{\n\tstruct BitEncoder\n\t{\n\t\tpublic const int kNumBitModelTotalBits = 11;\n\t\tpublic const uint kBitModelTotal = (1 << kNumBitModelTotalBits);\n\t\tconst int kNumMoveBits = 5;\n\t\tconst int kNumMoveReducingBits = 2;\n\t\tpublic const int kNumBitPriceShiftBits = 6;\n\n\t\tuint Prob;\n\n\t\tpublic void Init() { Prob = kBitModelTotal >> 1; }\n\n\t\tpublic void UpdateModel(uint symbol)\n\t\t{\n\t\t\tif (symbol == 0)\n\t\t\t\tProb += (kBitModelTotal - Prob) >> kNumMoveBits;\n\t\t\telse\n\t\t\t\tProb -= (Prob) >> kNumMoveBits;\n\t\t}\n\n\t\tpublic void Encode(Encoder encoder, uint symbol)\n\t\t{\n\t\t\t// encoder.EncodeBit(Prob, kNumBitModelTotalBits, symbol);\n\t\t\t// UpdateModel(symbol);\n\t\t\tuint newBound = (encoder.Range >> kNumBitModelTotalBits) * Prob;\n\t\t\tif (symbol == 0)\n\t\t\t{\n\t\t\t\tencoder.Range = newBound;\n\t\t\t\tProb += (kBitModelTotal - Prob) >> kNumMoveBits;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tencoder.Low += newBound;\n\t\t\t\tencoder.Range -= newBound;\n\t\t\t\tProb -= (Prob) >> kNumMoveBits;\n\t\t\t}\n\t\t\tif (encoder.Range < Encoder.kTopValue)\n\t\t\t{\n\t\t\t\tencoder.Range <<= 8;\n\t\t\t\tencoder.ShiftLow();\n\t\t\t}\n\t\t}\n\n\t\tprivate static UInt32[] ProbPrices = new UInt32[kBitModelTotal >> kNumMoveReducingBits];\n\n\t\tstatic BitEncoder()\n\t\t{\n\t\t\tconst int kNumBits = (kNumBitModelTotalBits - kNumMoveReducingBits);\n\t\t\tfor (int i = kNumBits - 1; i >= 0; i--)\n\t\t\t{\n\t\t\t\tUInt32 start = (UInt32)1 << (kNumBits - i - 1);\n\t\t\t\tUInt32 end = (UInt32)1 << (kNumBits - i);\n\t\t\t\tfor (UInt32 j = start; j < end; j++)\n\t\t\t\t\tProbPrices[j] = ((UInt32)i << kNumBitPriceShiftBits) +\n\t\t\t\t\t\t(((end - j) << kNumBitPriceShiftBits) >> (kNumBits - i - 1));\n\t\t\t}\n\t\t}\n\n\t\tpublic uint GetPrice(uint symbol)\n\t\t{\n\t\t\treturn ProbPrices[(((Prob - symbol) ^ ((-(int)symbol))) & (kBitModelTotal - 1)) >> kNumMoveReducingBits];\n\t\t}\n\t public uint GetPrice0() { return ProbPrices[Prob >> kNumMoveReducingBits]; }\n\t\tpublic uint GetPrice1() { return ProbPrices[(kBitModelTotal - Prob) >> kNumMoveReducingBits]; }\n\t}\n\n\tstruct BitDecoder\n\t{\n\t\tpublic const int kNumBitModelTotalBits = 11;\n\t\tpublic const uint kBitModelTotal = (1 << kNumBitModelTotalBits);\n\t\tconst int kNumMoveBits = 5;\n\n\t\tuint Prob;\n\n\t\tpublic void UpdateModel(int numMoveBits, uint symbol)\n\t\t{\n\t\t\tif (symbol == 0)\n\t\t\t\tProb += (kBitModelTotal - Prob) >> numMoveBits;\n\t\t\telse\n\t\t\t\tProb -= (Prob) >> numMoveBits;\n\t\t}\n\n\t\tpublic void Init() { Prob = kBitModelTotal >> 1; }\n\n\t\tpublic uint Decode(RangeCoder.Decoder rangeDecoder)\n\t\t{\n\t\t\tuint newBound = (uint)(rangeDecoder.Range >> kNumBitModelTotalBits) * (uint)Prob;\n\t\t\tif (rangeDecoder.Code < newBound)\n\t\t\t{\n\t\t\t\trangeDecoder.Range = newBound;\n\t\t\t\tProb += (kBitModelTotal - Prob) >> kNumMoveBits;\n\t\t\t\tif (rangeDecoder.Range < Decoder.kTopValue)\n\t\t\t\t{\n\t\t\t\t\trangeDecoder.Code = (rangeDecoder.Code << 8) | (byte)rangeDecoder.Stream.ReadByte();\n\t\t\t\t\trangeDecoder.Range <<= 8;\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\trangeDecoder.Range -= newBound;\n\t\t\t\trangeDecoder.Code -= newBound;\n\t\t\t\tProb -= (Prob) >> kNumMoveBits;\n\t\t\t\tif (rangeDecoder.Range < Decoder.kTopValue)\n\t\t\t\t{\n\t\t\t\t\trangeDecoder.Code = (rangeDecoder.Code << 8) | (byte)rangeDecoder.Stream.ReadByte();\n\t\t\t\t\trangeDecoder.Range <<= 8;\n\t\t\t\t}\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/7zip/Compress/RangeCoder/RangeCoderBitTree.cs", "content": "using System;\n\nnamespace SevenZip.Compression.RangeCoder\n{\n\tstruct BitTreeEncoder\n\t{\n\t\tBitEncoder[] Models;\n\t\tint NumBitLevels;\n\n\t\tpublic BitTreeEncoder(int numBitLevels)\n\t\t{\n\t\t\tNumBitLevels = numBitLevels;\n\t\t\tModels = new BitEncoder[1 << numBitLevels];\n\t\t}\n\n\t\tpublic void Init()\n\t\t{\n\t\t\tfor (uint i = 1; i < (1 << NumBitLevels); i++)\n\t\t\t\tModels[i].Init();\n\t\t}\n\n\t\tpublic void Encode(Encoder rangeEncoder, UInt32 symbol)\n\t\t{\n\t\t\tUInt32 m = 1;\n\t\t\tfor (int bitIndex = NumBitLevels; bitIndex > 0; )\n\t\t\t{\n\t\t\t\tbitIndex--;\n\t\t\t\tUInt32 bit = (symbol >> bitIndex) & 1;\n\t\t\t\tModels[m].Encode(rangeEncoder, bit);\n\t\t\t\tm = (m << 1) | bit;\n\t\t\t}\n\t\t}\n\n\t\tpublic void ReverseEncode(Encoder rangeEncoder, UInt32 symbol)\n\t\t{\n\t\t\tUInt32 m = 1;\n\t\t\tfor (UInt32 i = 0; i < NumBitLevels; i++)\n\t\t\t{\n\t\t\t\tUInt32 bit = symbol & 1;\n\t\t\t\tModels[m].Encode(rangeEncoder, bit);\n\t\t\t\tm = (m << 1) | bit;\n\t\t\t\tsymbol >>= 1;\n\t\t\t}\n\t\t}\n\n\t\tpublic UInt32 GetPrice(UInt32 symbol)\n\t\t{\n\t\t\tUInt32 price = 0;\n\t\t\tUInt32 m = 1;\n\t\t\tfor (int bitIndex = NumBitLevels; bitIndex > 0; )\n\t\t\t{\n\t\t\t\tbitIndex--;\n\t\t\t\tUInt32 bit = (symbol >> bitIndex) & 1;\n\t\t\t\tprice += Models[m].GetPrice(bit);\n\t\t\t\tm = (m << 1) + bit;\n\t\t\t}\n\t\t\treturn price;\n\t\t}\n\n\t\tpublic UInt32 ReverseGetPrice(UInt32 symbol)\n\t\t{\n\t\t\tUInt32 price = 0;\n\t\t\tUInt32 m = 1;\n\t\t\tfor (int i = NumBitLevels; i > 0; i--)\n\t\t\t{\n\t\t\t\tUInt32 bit = symbol & 1;\n\t\t\t\tsymbol >>= 1;\n\t\t\t\tprice += Models[m].GetPrice(bit);\n\t\t\t\tm = (m << 1) | bit;\n\t\t\t}\n\t\t\treturn price;\n\t\t}\n\n\t\tpublic static UInt32 ReverseGetPrice(BitEncoder[] Models, UInt32 startIndex,\n\t\t\tint NumBitLevels, UInt32 symbol)\n\t\t{\n\t\t\tUInt32 price = 0;\n\t\t\tUInt32 m = 1;\n\t\t\tfor (int i = NumBitLevels; i > 0; i--)\n\t\t\t{\n\t\t\t\tUInt32 bit = symbol & 1;\n\t\t\t\tsymbol >>= 1;\n\t\t\t\tprice += Models[startIndex + m].GetPrice(bit);\n\t\t\t\tm = (m << 1) | bit;\n\t\t\t}\n\t\t\treturn price;\n\t\t}\n\n\t\tpublic static void ReverseEncode(BitEncoder[] Models, UInt32 startIndex,\n\t\t\tEncoder rangeEncoder, int NumBitLevels, UInt32 symbol)\n\t\t{\n\t\t\tUInt32 m = 1;\n\t\t\tfor (int i = 0; i < NumBitLevels; i++)\n\t\t\t{\n\t\t\t\tUInt32 bit = symbol & 1;\n\t\t\t\tModels[startIndex + m].Encode(rangeEncoder, bit);\n\t\t\t\tm = (m << 1) | bit;\n\t\t\t\tsymbol >>= 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tstruct BitTreeDecoder\n\t{\n\t\tBitDecoder[] Models;\n\t\tint NumBitLevels;\n\n\t\tpublic BitTreeDecoder(int numBitLevels)\n\t\t{\n\t\t\tNumBitLevels = numBitLevels;\n\t\t\tModels = new BitDecoder[1 << numBitLevels];\n\t\t}\n\n\t\tpublic void Init()\n\t\t{\n\t\t\tfor (uint i = 1; i < (1 << NumBitLevels); i++)\n\t\t\t\tModels[i].Init();\n\t\t}\n\n\t\tpublic uint Decode(RangeCoder.Decoder rangeDecoder)\n\t\t{\n\t\t\tuint m = 1;\n\t\t\tfor (int bitIndex = NumBitLevels; bitIndex > 0; bitIndex--)\n\t\t\t\tm = (m << 1) + Models[m].Decode(rangeDecoder);\n\t\t\treturn m - ((uint)1 << NumBitLevels);\n\t\t}\n\n\t\tpublic uint ReverseDecode(RangeCoder.Decoder rangeDecoder)\n\t\t{\n\t\t\tuint m = 1;\n\t\t\tuint symbol = 0;\n\t\t\tfor (int bitIndex = 0; bitIndex < NumBitLevels; bitIndex++)\n\t\t\t{\n\t\t\t\tuint bit = Models[m].Decode(rangeDecoder);\n\t\t\t\tm <<= 1;\n\t\t\t\tm += bit;\n\t\t\t\tsymbol |= (bit << bitIndex);\n\t\t\t}\n\t\t\treturn symbol;\n\t\t}\n\n\t\tpublic static uint ReverseDecode(BitDecoder[] Models, UInt32 startIndex,\n\t\t\tRangeCoder.Decoder rangeDecoder, int NumBitLevels)\n\t\t{\n\t\t\tuint m = 1;\n\t\t\tuint symbol = 0;\n\t\t\tfor (int bitIndex = 0; bitIndex < NumBitLevels; bitIndex++)\n\t\t\t{\n\t\t\t\tuint bit = Models[startIndex + m].Decode(rangeDecoder);\n\t\t\t\tm <<= 1;\n\t\t\t\tm += bit;\n\t\t\t\tsymbol |= (bit << bitIndex);\n\t\t\t}\n\t\t\treturn symbol;\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/7zip/ICoder.cs", "content": "// ICoder.h\n\nusing System;\n\nnamespace SevenZip\n{\n\t/// \n\t/// The exception that is thrown when an error in input stream occurs during decoding.\n\t/// \n\tclass DataErrorException : ApplicationException\n\t{\n\t\tpublic DataErrorException(): base(\"Data Error\") { }\n\t}\n\n\t/// \n\t/// The exception that is thrown when the value of an argument is outside the allowable range.\n\t/// \n\tclass InvalidParamException : ApplicationException\n\t{\n\t\tpublic InvalidParamException(): base(\"Invalid Parameter\") { }\n\t}\n\n\tpublic interface ICodeProgress\n\t{\n\t\t/// \n\t\t/// Callback progress.\n\t\t/// \n\t\t/// \n\t\t/// input size. -1 if unknown.\n\t\t/// \n\t\t/// \n\t\t/// output size. -1 if unknown.\n\t\t/// \n\t\tvoid SetProgress(Int64 inSize, Int64 outSize);\n\t};\n\n\tpublic interface ICoder\n\t{\n\t\t/// \n\t\t/// Codes streams.\n\t\t/// \n\t\t/// \n\t\t/// input Stream.\n\t\t/// \n\t\t/// \n\t\t/// output Stream.\n\t\t/// \n\t\t/// \n\t\t/// input Size. -1 if unknown.\n\t\t/// \n\t\t/// \n\t\t/// output Size. -1 if unknown.\n\t\t/// \n\t\t/// \n\t\t/// callback progress reference.\n\t\t/// \n\t\t/// \n\t\t/// if input stream is not valid\n\t\t/// \n\t\tvoid Code(System.IO.Stream inStream, System.IO.Stream outStream,\n\t\t\tInt64 inSize, Int64 outSize, ICodeProgress progress);\n\t};\n\n\t/*\n\tpublic interface ICoder2\n\t{\n\t\t void Code(ISequentialInStream []inStreams,\n\t\t\t\tconst UInt64 []inSizes, \n\t\t\t\tISequentialOutStream []outStreams, \n\t\t\t\tUInt64 []outSizes,\n\t\t\t\tICodeProgress progress);\n\t};\n */\n\n\t/// \n\t/// Provides the fields that represent properties idenitifiers for compressing.\n\t/// \n\tpublic enum CoderPropID\n\t{\n\t\t/// \n\t\t/// Specifies default property.\n\t\t/// \n\t\tDefaultProp = 0,\n\t\t/// \n\t\t/// Specifies size of dictionary.\n\t\t/// \n\t\tDictionarySize,\n\t\t/// \n\t\t/// Specifies size of memory for PPM*.\n\t\t/// \n\t\tUsedMemorySize,\n\t\t/// \n\t\t/// Specifies order for PPM methods.\n\t\t/// \n\t\tOrder,\n\t\t/// \n\t\t/// Specifies Block Size.\n\t\t/// \n\t\tBlockSize,\n\t\t/// \n\t\t/// Specifies number of postion state bits for LZMA (0 <= x <= 4).\n\t\t/// \n\t\tPosStateBits,\n\t\t/// \n\t\t/// Specifies number of literal context bits for LZMA (0 <= x <= 8).\n\t\t/// \n\t\tLitContextBits,\n\t\t/// \n\t\t/// Specifies number of literal position bits for LZMA (0 <= x <= 4).\n\t\t/// \n\t\tLitPosBits,\n\t\t/// \n\t\t/// Specifies number of fast bytes for LZ*.\n\t\t/// \n\t\tNumFastBytes,\n\t\t/// \n\t\t/// Specifies match finder. LZMA: \"BT2\", \"BT4\" or \"BT4B\".\n\t\t/// \n\t\tMatchFinder,\n\t\t/// \n\t\t/// Specifies the number of match finder cyckes.\n\t\t/// \n\t\tMatchFinderCycles,\n\t\t/// \n\t\t/// Specifies number of passes.\n\t\t/// \n\t\tNumPasses,\n\t\t/// \n\t\t/// Specifies number of algorithm.\n\t\t/// \n\t\tAlgorithm,\n\t\t/// \n\t\t/// Specifies the number of threads.\n\t\t/// \n\t\tNumThreads,\n\t\t/// \n\t\t/// Specifies mode with end marker.\n\t\t/// \n\t\tEndMarker\n\t};\n\n\n\tpublic interface ISetCoderProperties\n\t{\n\t\tvoid SetCoderProperties(CoderPropID[] propIDs, object[] properties);\n\t};\n\n\tpublic interface IWriteCoderProperties\n\t{\n\t\tvoid WriteCoderProperties(System.IO.Stream outStream);\n\t}\n\n\tpublic interface ISetDecoderProperties\n\t{\n\t\tvoid SetDecoderProperties(byte[] properties);\n\t}\n}\n" }, { "path": "AssetStudio/AssetStudio.csproj", "content": "\n\n \n net472;netstandard2.0;net5.0;net6.0\n 0.16.0.0\n 0.16.0.0\n 0.16.0.0\n Copyright © Perfare 2018-2022\n embedded\n \n\n \n \n \n\n \n \n \n \n \n\n\n" }, { "path": "AssetStudio/AssetsManager.cs", "content": "using System;\nusing System.Collections.Generic;\nusing System.IO;\nusing System.IO.Compression;\nusing System.Linq;\nusing System.Text;\nusing static AssetStudio.ImportHelper;\n\nnamespace AssetStudio\n{\n public class AssetsManager\n {\n public string SpecifyUnityVersion;\n public List assetsFileList = new List();\n\n internal Dictionary assetsFileIndexCache = new Dictionary(StringComparer.OrdinalIgnoreCase);\n internal Dictionary resourceFileReaders = new Dictionary(StringComparer.OrdinalIgnoreCase);\n\n private List importFiles = new List();\n private HashSet importFilesHash = new HashSet(StringComparer.OrdinalIgnoreCase);\n private HashSet noexistFiles = new HashSet(StringComparer.OrdinalIgnoreCase);\n private HashSet assetsFileListHash = new HashSet(StringComparer.OrdinalIgnoreCase);\n\n public void LoadFiles(params string[] files)\n {\n var path = Path.GetDirectoryName(Path.GetFullPath(files[0]));\n MergeSplitAssets(path);\n var toReadFile = ProcessingSplitFiles(files.ToList());\n Load(toReadFile);\n }\n\n public void LoadFolder(string path)\n {\n MergeSplitAssets(path, true);\n var files = Directory.GetFiles(path, \"*.*\", SearchOption.AllDirectories).ToList();\n var toReadFile = ProcessingSplitFiles(files);\n Load(toReadFile);\n }\n\n private void Load(string[] files)\n {\n foreach (var file in files)\n {\n importFiles.Add(file);\n importFilesHash.Add(Path.GetFileName(file));\n }\n\n Progress.Reset();\n //use a for loop because list size can change\n for (var i = 0; i < importFiles.Count; i++)\n {\n LoadFile(importFiles[i]);\n Progress.Report(i + 1, importFiles.Count);\n }\n\n importFiles.Clear();\n importFilesHash.Clear();\n noexistFiles.Clear();\n assetsFileListHash.Clear();\n\n ReadAssets();\n ProcessAssets();\n }\n\n private void LoadFile(string fullName)\n {\n var reader = new FileReader(fullName);\n LoadFile(reader);\n }\n\n private void LoadFile(FileReader reader)\n {\n switch (reader.FileType)\n {\n case FileType.AssetsFile:\n LoadAssetsFile(reader);\n break;\n case FileType.BundleFile:\n LoadBundleFile(reader);\n break;\n case FileType.WebFile:\n LoadWebFile(reader);\n break;\n case FileType.GZipFile:\n LoadFile(DecompressGZip(reader));\n break;\n case FileType.BrotliFile:\n LoadFile(DecompressBrotli(reader));\n break;\n case FileType.ZipFile:\n LoadZipFile(reader);\n break;\n }\n }\n\n private void LoadAssetsFile(FileReader reader)\n {\n if (!assetsFileListHash.Contains(reader.FileName))\n {\n Logger.Info($\"Loading {reader.FullPath}\");\n try\n {\n var assetsFile = new SerializedFile(reader, this);\n CheckStrippedVersion(assetsFile);\n assetsFileList.Add(assetsFile);\n assetsFileListHash.Add(assetsFile.fileName);\n\n foreach (var sharedFile in assetsFile.m_Externals)\n {\n var sharedFileName = sharedFile.fileName;\n\n if (!importFilesHash.Contains(sharedFileName))\n {\n var sharedFilePath = Path.Combine(Path.GetDirectoryName(reader.FullPath), sharedFileName);\n if (!noexistFiles.Contains(sharedFilePath))\n {\n if (!File.Exists(sharedFilePath))\n {\n var findFiles = Directory.GetFiles(Path.GetDirectoryName(reader.FullPath), sharedFileName, SearchOption.AllDirectories);\n if (findFiles.Length > 0)\n {\n sharedFilePath = findFiles[0];\n }\n }\n if (File.Exists(sharedFilePath))\n {\n importFiles.Add(sharedFilePath);\n importFilesHash.Add(sharedFileName);\n }\n else\n {\n noexistFiles.Add(sharedFilePath);\n }\n }\n }\n }\n }\n catch (Exception e)\n {\n Logger.Error($\"Error while reading assets file {reader.FullPath}\", e);\n reader.Dispose();\n }\n }\n else\n {\n Logger.Info($\"Skipping {reader.FullPath}\");\n reader.Dispose();\n }\n }\n\n private void LoadAssetsFromMemory(FileReader reader, string originalPath, string unityVersion = null)\n {\n if (!assetsFileListHash.Contains(reader.FileName))\n {\n try\n {\n var assetsFile = new SerializedFile(reader, this);\n assetsFile.originalPath = originalPath;\n if (!string.IsNullOrEmpty(unityVersion) && assetsFile.header.m_Version < SerializedFileFormatVersion.Unknown_7)\n {\n assetsFile.SetVersion(unityVersion);\n }\n CheckStrippedVersion(assetsFile);\n assetsFileList.Add(assetsFile);\n assetsFileListHash.Add(assetsFile.fileName);\n }\n catch (Exception e)\n {\n Logger.Error($\"Error while reading assets file {reader.FullPath} from {Path.GetFileName(originalPath)}\", e);\n resourceFileReaders.Add(reader.FileName, reader);\n }\n }\n else\n Logger.Info($\"Skipping {originalPath} ({reader.FileName})\");\n }\n\n private void LoadBundleFile(FileReader reader, string originalPath = null)\n {\n Logger.Info(\"Loading \" + reader.FullPath);\n try\n {\n var bundleFile = new BundleFile(reader);\n foreach (var file in bundleFile.fileList)\n {\n var dummyPath = Path.Combine(Path.GetDirectoryName(reader.FullPath), file.fileName);\n var subReader = new FileReader(dummyPath, file.stream);\n if (subReader.FileType == FileType.AssetsFile)\n {\n LoadAssetsFromMemory(subReader, originalPath ?? reader.FullPath, bundleFile.m_Header.unityRevision);\n }\n else\n {\n resourceFileReaders[file.fileName] = subReader; //TODO\n }\n }\n }\n catch (Exception e)\n {\n var str = $\"Error while reading bundle file {reader.FullPath}\";\n if (originalPath != null)\n {\n str += $\" from {Path.GetFileName(originalPath)}\";\n }\n Logger.Error(str, e);\n }\n finally\n {\n reader.Dispose();\n }\n }\n\n private void LoadWebFile(FileReader reader)\n {\n Logger.Info(\"Loading \" + reader.FullPath);\n try\n {\n var webFile = new WebFile(reader);\n foreach (var file in webFile.fileList)\n {\n var dummyPath = Path.Combine(Path.GetDirectoryName(reader.FullPath), file.fileName);\n var subReader = new FileReader(dummyPath, file.stream);\n switch (subReader.FileType)\n {\n case FileType.AssetsFile:\n LoadAssetsFromMemory(subReader, reader.FullPath);\n break;\n case FileType.BundleFile:\n LoadBundleFile(subReader, reader.FullPath);\n break;\n case FileType.WebFile:\n LoadWebFile(subReader);\n break;\n case FileType.ResourceFile:\n resourceFileReaders[file.fileName] = subReader; //TODO\n break;\n }\n }\n }\n catch (Exception e)\n {\n Logger.Error($\"Error while reading web file {reader.FullPath}\", e);\n }\n finally\n {\n reader.Dispose();\n }\n }\n\n private void LoadZipFile(FileReader reader)\n {\n Logger.Info(\"Loading \" + reader.FileName);\n try\n {\n using (ZipArchive archive = new ZipArchive(reader.BaseStream, ZipArchiveMode.Read))\n {\n List splitFiles = new List();\n // register all files before parsing the assets so that the external references can be found\n // and find split files\n foreach (ZipArchiveEntry entry in archive.Entries)\n {\n if (entry.Name.Contains(\".split\"))\n {\n string baseName = Path.GetFileNameWithoutExtension(entry.Name);\n string basePath = Path.Combine(Path.GetDirectoryName(entry.FullName), baseName);\n if (!splitFiles.Contains(basePath))\n {\n splitFiles.Add(basePath);\n importFilesHash.Add(baseName);\n }\n }\n else\n {\n importFilesHash.Add(entry.Name);\n }\n }\n\n // merge split files and load the result\n foreach (string basePath in splitFiles)\n {\n try\n {\n Stream splitStream = new MemoryStream();\n int i = 0;\n while (true)\n {\n string path = $\"{basePath}.split{i++}\";\n ZipArchiveEntry entry = archive.GetEntry(path);\n if (entry == null)\n break;\n using (Stream entryStream = entry.Open())\n {\n entryStream.CopyTo(splitStream);\n }\n }\n splitStream.Seek(0, SeekOrigin.Begin);\n FileReader entryReader = new FileReader(basePath, splitStream);\n LoadFile(entryReader);\n }\n catch (Exception e)\n {\n Logger.Error($\"Error while reading zip split file {basePath}\", e);\n }\n }\n\n // load all entries\n foreach (ZipArchiveEntry entry in archive.Entries)\n {\n try\n {\n string dummyPath = Path.Combine(Path.GetDirectoryName(reader.FullPath), reader.FileName, entry.FullName);\n // create a new stream\n // - to store the deflated stream in\n // - to keep the data for later extraction\n Stream streamReader = new MemoryStream();\n using (Stream entryStream = entry.Open())\n {\n entryStream.CopyTo(streamReader);\n }\n streamReader.Position = 0;\n\n FileReader entryReader = new FileReader(dummyPath, streamReader);\n LoadFile(entryReader);\n if (entryReader.FileType == FileType.ResourceFile)\n {\n entryReader.Position = 0;\n if (!resourceFileReaders.ContainsKey(entry.Name))\n {\n resourceFileReaders.Add(entry.Name, entryReader);\n }\n }\n }\n catch (Exception e)\n {\n Logger.Error($\"Error while reading zip entry {entry.FullName}\", e);\n }\n }\n }\n }\n catch (Exception e)\n {\n Logger.Error($\"Error while reading zip file {reader.FileName}\", e);\n }\n finally\n {\n reader.Dispose();\n }\n }\n\n public void CheckStrippedVersion(SerializedFile assetsFile)\n {\n if (assetsFile.IsVersionStripped && string.IsNullOrEmpty(SpecifyUnityVersion))\n {\n throw new Exception(\"The Unity version has been stripped, please set the version in the options\");\n }\n if (!string.IsNullOrEmpty(SpecifyUnityVersion))\n {\n assetsFile.SetVersion(SpecifyUnityVersion);\n }\n }\n\n public void Clear()\n {\n foreach (var assetsFile in assetsFileList)\n {\n assetsFile.Objects.Clear();\n assetsFile.reader.Close();\n }\n assetsFileList.Clear();\n\n foreach (var resourceFileReader in resourceFileReaders)\n {\n resourceFileReader.Value.Close();\n }\n resourceFileReaders.Clear();\n\n assetsFileIndexCache.Clear();\n }\n\n private void ReadAssets()\n {\n Logger.Info(\"Read assets...\");\n\n var progressCount = assetsFileList.Sum(x => x.m_Objects.Count);\n int i = 0;\n Progress.Reset();\n foreach (var assetsFile in assetsFileList)\n {\n foreach (var objectInfo in assetsFile.m_Objects)\n {\n var objectReader = new ObjectReader(assetsFile.reader, assetsFile, objectInfo);\n try\n {\n Object obj;\n switch (objectReader.type)\n {\n case ClassIDType.Animation:\n obj = new Animation(objectReader);\n break;\n case ClassIDType.AnimationClip:\n obj = new AnimationClip(objectReader);\n break;\n case ClassIDType.Animator:\n obj = new Animator(objectReader);\n break;\n case ClassIDType.AnimatorController:\n obj = new AnimatorController(objectReader);\n break;\n case ClassIDType.AnimatorOverrideController:\n obj = new AnimatorOverrideController(objectReader);\n break;\n case ClassIDType.AssetBundle:\n obj = new AssetBundle(objectReader);\n break;\n case ClassIDType.AudioClip:\n obj = new AudioClip(objectReader);\n break;\n case ClassIDType.Avatar:\n obj = new Avatar(objectReader);\n break;\n case ClassIDType.Font:\n obj = new Font(objectReader);\n break;\n case ClassIDType.GameObject:\n obj = new GameObject(objectReader);\n break;\n case ClassIDType.Material:\n obj = new Material(objectReader);\n break;\n case ClassIDType.Mesh:\n obj = new Mesh(objectReader);\n break;\n case ClassIDType.MeshFilter:\n obj = new MeshFilter(objectReader);\n break;\n case ClassIDType.MeshRenderer:\n obj = new MeshRenderer(objectReader);\n break;\n case ClassIDType.MonoBehaviour:\n obj = new MonoBehaviour(objectReader);\n break;\n case ClassIDType.MonoScript:\n obj = new MonoScript(objectReader);\n break;\n case ClassIDType.MovieTexture:\n obj = new MovieTexture(objectReader);\n break;\n case ClassIDType.PlayerSettings:\n obj = new PlayerSettings(objectReader);\n break;\n case ClassIDType.RectTransform:\n obj = new RectTransform(objectReader);\n break;\n case ClassIDType.Shader:\n obj = new Shader(objectReader);\n break;\n case ClassIDType.SkinnedMeshRenderer:\n obj = new SkinnedMeshRenderer(objectReader);\n break;\n case ClassIDType.Sprite:\n obj = new Sprite(objectReader);\n break;\n case ClassIDType.SpriteAtlas:\n obj = new SpriteAtlas(objectReader);\n break;\n case ClassIDType.TextAsset:\n obj = new TextAsset(objectReader);\n break;\n case ClassIDType.Texture2D:\n obj = new Texture2D(objectReader);\n break;\n case ClassIDType.Transform:\n obj = new Transform(objectReader);\n break;\n case ClassIDType.VideoClip:\n obj = new VideoClip(objectReader);\n break;\n case ClassIDType.ResourceManager:\n obj = new ResourceManager(objectReader);\n break;\n default:\n obj = new Object(objectReader);\n break;\n }\n assetsFile.AddObject(obj);\n }\n catch (Exception e)\n {\n var sb = new StringBuilder();\n sb.AppendLine(\"Unable to load object\")\n .AppendLine($\"Assets {assetsFile.fileName}\")\n .AppendLine($\"Path {assetsFile.originalPath}\")\n .AppendLine($\"Type {objectReader.type}\")\n .AppendLine($\"PathID {objectInfo.m_PathID}\")\n .Append(e);\n Logger.Error(sb.ToString());\n }\n\n Progress.Report(++i, progressCount);\n }\n }\n }\n\n private void ProcessAssets()\n {\n Logger.Info(\"Process Assets...\");\n\n foreach (var assetsFile in assetsFileList)\n {\n foreach (var obj in assetsFile.Objects)\n {\n if (obj is GameObject m_GameObject)\n {\n foreach (var pptr in m_GameObject.m_Components)\n {\n if (pptr.TryGet(out var m_Component))\n {\n switch (m_Component)\n {\n case Transform m_Transform:\n m_GameObject.m_Transform = m_Transform;\n break;\n case MeshRenderer m_MeshRenderer:\n m_GameObject.m_MeshRenderer = m_MeshRenderer;\n break;\n case MeshFilter m_MeshFilter:\n m_GameObject.m_MeshFilter = m_MeshFilter;\n break;\n case SkinnedMeshRenderer m_SkinnedMeshRenderer:\n m_GameObject.m_SkinnedMeshRenderer = m_SkinnedMeshRenderer;\n break;\n case Animator m_Animator:\n m_GameObject.m_Animator = m_Animator;\n break;\n case Animation m_Animation:\n m_GameObject.m_Animation = m_Animation;\n break;\n }\n }\n }\n }\n else if (obj is SpriteAtlas m_SpriteAtlas)\n {\n foreach (var m_PackedSprite in m_SpriteAtlas.m_PackedSprites)\n {\n if (m_PackedSprite.TryGet(out var m_Sprite))\n {\n if (m_Sprite.m_SpriteAtlas.IsNull)\n {\n m_Sprite.m_SpriteAtlas.Set(m_SpriteAtlas);\n }\n else\n {\n m_Sprite.m_SpriteAtlas.TryGet(out var m_SpriteAtlaOld);\n if (m_SpriteAtlaOld.m_IsVariant)\n {\n m_Sprite.m_SpriteAtlas.Set(m_SpriteAtlas);\n }\n }\n }\n }\n }\n }\n }\n }\n }\n}\n" }, { "path": "AssetStudio/BigArrayPool.cs", "content": "using System.Buffers;\n\nnamespace AssetStudio\n{\n public static class BigArrayPool\n {\n private static readonly ArrayPool s_shared = ArrayPool.Create(64 * 1024 * 1024, 3);\n public static ArrayPool Shared => s_shared;\n }\n}\n" }, { "path": "AssetStudio/Brotli/BitReader.cs", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\nDistributed under MIT license.\nSee file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\nnamespace Org.Brotli.Dec\n{\n\t/// Bit reading helpers.\n\tinternal sealed class BitReader\n\t{\n\t\t/// \n\t\t/// Input byte buffer, consist of a ring-buffer and a \"slack\" region where bytes from the start of\n\t\t/// the ring-buffer are copied.\n\t\t/// \n\t\tprivate const int Capacity = 1024;\n\n\t\tprivate const int Slack = 16;\n\n\t\tprivate const int IntBufferSize = Capacity + Slack;\n\n\t\tprivate const int ByteReadSize = Capacity << 2;\n\n\t\tprivate const int ByteBufferSize = IntBufferSize << 2;\n\n\t\tprivate readonly byte[] byteBuffer = new byte[ByteBufferSize];\n\n\t\tprivate readonly int[] intBuffer = new int[IntBufferSize];\n\n\t\tprivate readonly Org.Brotli.Dec.IntReader intReader = new Org.Brotli.Dec.IntReader();\n\n\t\tprivate System.IO.Stream input;\n\n\t\t/// Input stream is finished.\n\t\tprivate bool endOfStreamReached;\n\n\t\t/// Pre-fetched bits.\n\t\tinternal long accumulator;\n\n\t\t/// Current bit-reading position in accumulator.\n\t\tinternal int bitOffset;\n\n\t\t/// Offset of next item in intBuffer.\n\t\tprivate int intOffset;\n\n\t\tprivate int tailBytes = 0;\n\n\t\t/* Number of bytes in unfinished \"int\" item. */\n\t\t/// Fills up the input buffer.\n\t\t/// \n\t\t/// Fills up the input buffer.\n\t\t///

No-op if there are at least 36 bytes present after current position.\n\t\t///

After encountering the end of the input stream, 64 additional zero bytes are copied to the\n\t\t/// buffer.\n\t\t/// \n\t\tinternal static void ReadMoreInput(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\t// TODO: Split to check and read; move read outside of decoding loop.\n\t\t\tif (br.intOffset <= Capacity - 9)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (br.endOfStreamReached)\n\t\t\t{\n\t\t\t\tif (IntAvailable(br) >= -2)\n\t\t\t\t{\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"No more input\");\n\t\t\t}\n\t\t\tint readOffset = br.intOffset << 2;\n\t\t\tint bytesRead = ByteReadSize - readOffset;\n\t\t\tSystem.Array.Copy(br.byteBuffer, readOffset, br.byteBuffer, 0, bytesRead);\n\t\t\tbr.intOffset = 0;\n\t\t\ttry\n\t\t\t{\n\t\t\t\twhile (bytesRead < ByteReadSize)\n\t\t\t\t{\n\t\t\t\t\tint len = br.input.Read(br.byteBuffer, bytesRead, ByteReadSize - bytesRead);\n\t\t\t\t\t// EOF is -1 in Java, but 0 in C#.\n\t\t\t\t\tif (len <= 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tbr.endOfStreamReached = true;\n\t\t\t\t\t\tbr.tailBytes = bytesRead;\n\t\t\t\t\t\tbytesRead += 3;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tbytesRead += len;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (System.IO.IOException e)\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Failed to read input\", e);\n\t\t\t}\n\t\t\tOrg.Brotli.Dec.IntReader.Convert(br.intReader, bytesRead >> 2);\n\t\t}\n\n\t\tinternal static void CheckHealth(Org.Brotli.Dec.BitReader br, bool endOfStream)\n\t\t{\n\t\t\tif (!br.endOfStreamReached)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint byteOffset = (br.intOffset << 2) + ((br.bitOffset + 7) >> 3) - 8;\n\t\t\tif (byteOffset > br.tailBytes)\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Read after end\");\n\t\t\t}\n\t\t\tif (endOfStream && (byteOffset != br.tailBytes))\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Unused bytes after end\");\n\t\t\t}\n\t\t}\n\n\t\t///

Advances the Read buffer by 5 bytes to make room for reading next 24 bits.\n\t\tinternal static void FillBitWindow(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tif (br.bitOffset >= 32)\n\t\t\t{\n\t\t\t\tbr.accumulator = ((long)br.intBuffer[br.intOffset++] << 32) | ((long)(((ulong)br.accumulator) >> 32));\n\t\t\t\tbr.bitOffset -= 32;\n\t\t\t}\n\t\t}\n\n\t\t/// Reads the specified number of bits from Read Buffer.\n\t\tinternal static int ReadBits(Org.Brotli.Dec.BitReader br, int n)\n\t\t{\n\t\t\tFillBitWindow(br);\n\t\t\tint val = (int)((long)(((ulong)br.accumulator) >> br.bitOffset)) & ((1 << n) - 1);\n\t\t\tbr.bitOffset += n;\n\t\t\treturn val;\n\t\t}\n\n\t\t/// Initialize bit reader.\n\t\t/// \n\t\t/// Initialize bit reader.\n\t\t///

Initialisation turns bit reader to a ready state. Also a number of bytes is prefetched to\n\t\t/// accumulator. Because of that this method may block until enough data could be read from input.\n\t\t/// \n\t\t/// BitReader POJO\n\t\t/// data source\n\t\tinternal static void Init(Org.Brotli.Dec.BitReader br, System.IO.Stream input)\n\t\t{\n\t\t\tif (br.input != null)\n\t\t\t{\n\t\t\t\tthrow new System.InvalidOperationException(\"Bit reader already has associated input stream\");\n\t\t\t}\n\t\t\tOrg.Brotli.Dec.IntReader.Init(br.intReader, br.byteBuffer, br.intBuffer);\n\t\t\tbr.input = input;\n\t\t\tbr.accumulator = 0;\n\t\t\tbr.bitOffset = 64;\n\t\t\tbr.intOffset = Capacity;\n\t\t\tbr.endOfStreamReached = false;\n\t\t\tPrepare(br);\n\t\t}\n\n\t\tprivate static void Prepare(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tReadMoreInput(br);\n\t\t\tCheckHealth(br, false);\n\t\t\tFillBitWindow(br);\n\t\t\tFillBitWindow(br);\n\t\t}\n\n\t\tinternal static void Reload(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tif (br.bitOffset == 64)\n\t\t\t{\n\t\t\t\tPrepare(br);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\tinternal static void Close(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tSystem.IO.Stream @is = br.input;\n\t\t\tbr.input = null;\n\t\t\tif (@is != null)\n\t\t\t{\n\t\t\t\t@is.Close();\n\t\t\t}\n\t\t}\n\n\t\tinternal static void JumpToByteBoundary(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tint padding = (64 - br.bitOffset) & 7;\n\t\t\tif (padding != 0)\n\t\t\t{\n\t\t\t\tint paddingBits = Org.Brotli.Dec.BitReader.ReadBits(br, padding);\n\t\t\t\tif (paddingBits != 0)\n\t\t\t\t{\n\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Corrupted padding bits\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tinternal static int IntAvailable(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tint limit = Capacity;\n\t\t\tif (br.endOfStreamReached)\n\t\t\t{\n\t\t\t\tlimit = (br.tailBytes + 3) >> 2;\n\t\t\t}\n\t\t\treturn limit - br.intOffset;\n\t\t}\n\n\t\tinternal static void CopyBytes(Org.Brotli.Dec.BitReader br, byte[] data, int offset, int length)\n\t\t{\n\t\t\tif ((br.bitOffset & 7) != 0)\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Unaligned copyBytes\");\n\t\t\t}\n\t\t\t// Drain accumulator.\n\t\t\twhile ((br.bitOffset != 64) && (length != 0))\n\t\t\t{\n\t\t\t\tdata[offset++] = unchecked((byte)((long)(((ulong)br.accumulator) >> br.bitOffset)));\n\t\t\t\tbr.bitOffset += 8;\n\t\t\t\tlength--;\n\t\t\t}\n\t\t\tif (length == 0)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Get data from shadow buffer with \"sizeof(int)\" granularity.\n\t\t\tint copyInts = System.Math.Min(IntAvailable(br), length >> 2);\n\t\t\tif (copyInts > 0)\n\t\t\t{\n\t\t\t\tint readOffset = br.intOffset << 2;\n\t\t\t\tSystem.Array.Copy(br.byteBuffer, readOffset, data, offset, copyInts << 2);\n\t\t\t\toffset += copyInts << 2;\n\t\t\t\tlength -= copyInts << 2;\n\t\t\t\tbr.intOffset += copyInts;\n\t\t\t}\n\t\t\tif (length == 0)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Read tail bytes.\n\t\t\tif (IntAvailable(br) > 0)\n\t\t\t{\n\t\t\t\t// length = 1..3\n\t\t\t\tFillBitWindow(br);\n\t\t\t\twhile (length != 0)\n\t\t\t\t{\n\t\t\t\t\tdata[offset++] = unchecked((byte)((long)(((ulong)br.accumulator) >> br.bitOffset)));\n\t\t\t\t\tbr.bitOffset += 8;\n\t\t\t\t\tlength--;\n\t\t\t\t}\n\t\t\t\tCheckHealth(br, false);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Now it is possible to copy bytes directly.\n\t\t\ttry\n\t\t\t{\n\t\t\t\twhile (length > 0)\n\t\t\t\t{\n\t\t\t\t\tint len = br.input.Read(data, offset, length);\n\t\t\t\t\tif (len == -1)\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Unexpected end of input\");\n\t\t\t\t\t}\n\t\t\t\t\toffset += len;\n\t\t\t\t\tlength -= len;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (System.IO.IOException e)\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Failed to read input\", e);\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/Brotli/BrotliInputStream.cs", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\nDistributed under MIT license.\nSee file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\nnamespace Org.Brotli.Dec\n{\n\t///

\n\t/// \n\t/// decorator that decompresses brotli data.\n\t///

Not thread-safe.\n\t///

\n\tpublic class BrotliInputStream : System.IO.Stream\n\t{\n\t\tpublic const int DefaultInternalBufferSize = 16384;\n\n\t\t/// Internal buffer used for efficient byte-by-byte reading.\n\t\tprivate byte[] buffer;\n\n\t\t/// Number of decoded but still unused bytes in internal buffer.\n\t\tprivate int remainingBufferBytes;\n\n\t\t/// Next unused byte offset.\n\t\tprivate int bufferOffset;\n\n\t\t/// Decoder state.\n\t\tprivate readonly Org.Brotli.Dec.State state = new Org.Brotli.Dec.State();\n\n\t\t/// \n\t\t/// Creates a\n\t\t/// \n\t\t/// wrapper that decompresses brotli data.\n\t\t///

For byte-by-byte reading (\n\t\t/// \n\t\t/// ) internal buffer with\n\t\t/// \n\t\t/// size is allocated and used.\n\t\t///

Will block the thread until first kilobyte of data of source is available.\n\t\t///

\n\t\t/// underlying data source\n\t\t/// in case of corrupted data or source stream problems\n\t\tpublic BrotliInputStream(System.IO.Stream source)\n\t\t\t: this(source, DefaultInternalBufferSize, null)\n\t\t{\n\t\t}\n\n\t\t/// \n\t\t/// Creates a\n\t\t/// \n\t\t/// wrapper that decompresses brotli data.\n\t\t///

For byte-by-byte reading (\n\t\t/// \n\t\t/// ) internal buffer of specified size is\n\t\t/// allocated and used.\n\t\t///

Will block the thread until first kilobyte of data of source is available.\n\t\t///

\n\t\t/// compressed data source\n\t\t/// \n\t\t/// size of internal buffer used in case of\n\t\t/// byte-by-byte reading\n\t\t/// \n\t\t/// in case of corrupted data or source stream problems\n\t\tpublic BrotliInputStream(System.IO.Stream source, int byteReadBufferSize)\n\t\t\t: this(source, byteReadBufferSize, null)\n\t\t{\n\t\t}\n\n\t\t/// \n\t\t/// Creates a\n\t\t/// \n\t\t/// wrapper that decompresses brotli data.\n\t\t///

For byte-by-byte reading (\n\t\t/// \n\t\t/// ) internal buffer of specified size is\n\t\t/// allocated and used.\n\t\t///

Will block the thread until first kilobyte of data of source is available.\n\t\t///

\n\t\t/// compressed data source\n\t\t/// \n\t\t/// size of internal buffer used in case of\n\t\t/// byte-by-byte reading\n\t\t/// \n\t\t/// \n\t\t/// custom dictionary data;\n\t\t/// \n\t\t/// if not used\n\t\t/// \n\t\t/// in case of corrupted data or source stream problems\n\t\tpublic BrotliInputStream(System.IO.Stream source, int byteReadBufferSize, byte[] customDictionary)\n\t\t{\n\t\t\tif (byteReadBufferSize <= 0)\n\t\t\t{\n\t\t\t\tthrow new System.ArgumentException(\"Bad buffer size:\" + byteReadBufferSize);\n\t\t\t}\n\t\t\telse if (source == null)\n\t\t\t{\n\t\t\t\tthrow new System.ArgumentException(\"source is null\");\n\t\t\t}\n\t\t\tthis.buffer = new byte[byteReadBufferSize];\n\t\t\tthis.remainingBufferBytes = 0;\n\t\t\tthis.bufferOffset = 0;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.State.SetInput(state, source);\n\t\t\t}\n\t\t\tcatch (Org.Brotli.Dec.BrotliRuntimeException ex)\n\t\t\t{\n\t\t\t\tthrow new System.IO.IOException(\"Brotli decoder initialization failed\", ex);\n\t\t\t}\n\t\t\tif (customDictionary != null)\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.Decode.SetCustomDictionary(state, customDictionary);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\tpublic override void Close()\n\t\t{\n\t\t\tOrg.Brotli.Dec.State.Close(state);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\tpublic override int ReadByte()\n\t\t{\n\t\t\tif (bufferOffset >= remainingBufferBytes)\n\t\t\t{\n\t\t\t\tremainingBufferBytes = Read(buffer, 0, buffer.Length);\n\t\t\t\tbufferOffset = 0;\n\t\t\t\tif (remainingBufferBytes == -1)\n\t\t\t\t{\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn buffer[bufferOffset++] & unchecked((int)(0xFF));\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\tpublic override int Read(byte[] destBuffer, int destOffset, int destLen)\n\t\t{\n\t\t\tif (destOffset < 0)\n\t\t\t{\n\t\t\t\tthrow new System.ArgumentException(\"Bad offset: \" + destOffset);\n\t\t\t}\n\t\t\telse if (destLen < 0)\n\t\t\t{\n\t\t\t\tthrow new System.ArgumentException(\"Bad length: \" + destLen);\n\t\t\t}\n\t\t\telse if (destOffset + destLen > destBuffer.Length)\n\t\t\t{\n\t\t\t\tthrow new System.ArgumentException(\"Buffer overflow: \" + (destOffset + destLen) + \" > \" + destBuffer.Length);\n\t\t\t}\n\t\t\telse if (destLen == 0)\n\t\t\t{\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tint copyLen = System.Math.Max(remainingBufferBytes - bufferOffset, 0);\n\t\t\tif (copyLen != 0)\n\t\t\t{\n\t\t\t\tcopyLen = System.Math.Min(copyLen, destLen);\n\t\t\t\tSystem.Array.Copy(buffer, bufferOffset, destBuffer, destOffset, copyLen);\n\t\t\t\tbufferOffset += copyLen;\n\t\t\t\tdestOffset += copyLen;\n\t\t\t\tdestLen -= copyLen;\n\t\t\t\tif (destLen == 0)\n\t\t\t\t{\n\t\t\t\t\treturn copyLen;\n\t\t\t\t}\n\t\t\t}\n\t\t\ttry\n\t\t\t{\n\t\t\t\tstate.output = destBuffer;\n\t\t\t\tstate.outputOffset = destOffset;\n\t\t\t\tstate.outputLength = destLen;\n\t\t\t\tstate.outputUsed = 0;\n\t\t\t\tOrg.Brotli.Dec.Decode.Decompress(state);\n\t\t\t\tif (state.outputUsed == 0)\n\t\t\t\t{\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\treturn state.outputUsed + copyLen;\n\t\t\t}\n\t\t\tcatch (Org.Brotli.Dec.BrotliRuntimeException ex)\n\t\t\t{\n\t\t\t\tthrow new System.IO.IOException(\"Brotli stream decoding failed\", ex);\n\t\t\t}\n\t\t}\n\t\t// <{[INJECTED CODE]}>\n\t\tpublic override bool CanRead {\n\t\t\tget {return true;}\n\t\t}\n\n\t\tpublic override bool CanSeek {\n\t\t\tget {return false;}\n\t\t}\n\t\tpublic override long Length {\n\t\t\tget {throw new System.NotSupportedException();}\n\t\t}\n\t\tpublic override long Position {\n\t\t\tget {throw new System.NotSupportedException();}\n\t\t\tset {throw new System.NotSupportedException();}\n\t\t}\n\t\tpublic override long Seek(long offset, System.IO.SeekOrigin origin) {\n\t\t\tthrow new System.NotSupportedException();\n\t\t}\n\t\tpublic override void SetLength(long value){\n\t\t\tthrow new System.NotSupportedException();\n\t\t}\n\n\t\tpublic override bool CanWrite{get{return false;}}\n\t\tpublic override System.IAsyncResult BeginWrite(byte[] buffer, int offset,\n\t\t\t\tint count, System.AsyncCallback callback, object state) {\n\t\t\tthrow new System.NotSupportedException();\n\t\t}\n\t\tpublic override void Write(byte[] buffer, int offset, int count) {\n\t\t\tthrow new System.NotSupportedException();\n\t\t}\n\n\t\tpublic override void Flush() {}\n\t}\n}\n" }, { "path": "AssetStudio/Brotli/BrotliRuntimeException.cs", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\nDistributed under MIT license.\nSee file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\nnamespace Org.Brotli.Dec\n{\n\t/// Unchecked exception used internally.\n\t[System.Serializable]\n\tinternal class BrotliRuntimeException : System.Exception\n\t{\n\t\tinternal BrotliRuntimeException(string message)\n\t\t\t: base(message)\n\t\t{\n\t\t}\n\n\t\tinternal BrotliRuntimeException(string message, System.Exception cause)\n\t\t\t: base(message, cause)\n\t\t{\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/Brotli/Context.cs", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\nDistributed under MIT license.\nSee file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\nnamespace Org.Brotli.Dec\n{\n\t/// Common context lookup table for all context modes.\n\tinternal sealed class Context\n\t{\n\t\tinternal static readonly int[] Lookup = new int[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 12, 16, 12, 12, 20, 12, 16, 24, 28, 12, 12, 32, 12, 36, 12, 44, 44, 44, 44, 44, 44, 44, 44\n\t\t\t, 44, 44, 32, 32, 24, 40, 28, 12, 12, 48, 52, 52, 52, 48, 52, 52, 52, 48, 52, 52, 52, 52, 52, 48, 52, 52, 52, 52, 52, 48, 52, 52, 52, 52, 52, 24, 12, 28, 12, 12, 12, 56, 60, 60, 60, 56, 60, 60, 60, 56, 60, 60, 60, 60, 60, 56, 60, 60, 60, 60\n\t\t\t, 60, 56, 60, 60, 60, 60, 60, 24, 12, 28, 12, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, \n\t\t\t2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \n\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, \n\t\t\t1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \n\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, \n\t\t\t0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, \n\t\t\t3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, \n\t\t\t4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, \n\t\t\t6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, \n\t\t\t16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, \n\t\t\t24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, \n\t\t\t32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, \n\t\t\t40, 40, 40, 40, 40, 40, 40, 40, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 56, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38\n\t\t\t, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, \n\t\t\t37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35\n\t\t\t, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, \n\t\t\t34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, \n\t\t\t10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, \n\t\t\t25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27, 28, 28, 28, 28, 29, 29, 29, 29, 30, 30, 30, 30, 31, 31, 31, 31, 32, 32, 32, 32, 33, 33, 33, 33, 34, 34, 34, 34, 35, 35, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37, 38, 38, 38, 38, 39, 39, 39, 39, \n\t\t\t40, 40, 40, 40, 41, 41, 41, 41, 42, 42, 42, 42, 43, 43, 43, 43, 44, 44, 44, 44, 45, 45, 45, 45, 46, 46, 46, 46, 47, 47, 47, 47, 48, 48, 48, 48, 49, 49, 49, 49, 50, 50, 50, 50, 51, 51, 51, 51, 52, 52, 52, 52, 53, 53, 53, 53, 54, 54, 54, 54, \n\t\t\t55, 55, 55, 55, 56, 56, 56, 56, 57, 57, 57, 57, 58, 58, 58, 58, 59, 59, 59, 59, 60, 60, 60, 60, 61, 61, 61, 61, 62, 62, 62, 62, 63, 63, 63, 63, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \n\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \n\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, \n\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };\n\n\t\tinternal static readonly int[] LookupOffsets = new int[] { 1024, 1536, 1280, 1536, 0, 256, 768, 512 };\n\t\t// CONTEXT_UTF8, last byte.\n\t\t// ASCII range.\n\t\t// UTF8 continuation byte range.\n\t\t// UTF8 lead byte range.\n\t\t// CONTEXT_UTF8 second last byte.\n\t\t// ASCII range.\n\t\t// UTF8 continuation byte range.\n\t\t// UTF8 lead byte range.\n\t\t// CONTEXT_SIGNED, second last byte.\n\t\t// CONTEXT_SIGNED, last byte, same as the above values shifted by 3 bits.\n\t\t// CONTEXT_LSB6, last byte.\n\t\t// CONTEXT_MSB6, last byte.\n\t\t// CONTEXT_{M,L}SB6, second last byte,\n\t\t// CONTEXT_LSB6\n\t\t// CONTEXT_MSB6\n\t\t// CONTEXT_UTF8\n\t\t// CONTEXT_SIGNED\n\t}\n}\n" }, { "path": "AssetStudio/Brotli/Decode.cs", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\nDistributed under MIT license.\nSee file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\nnamespace Org.Brotli.Dec\n{\n\t/// API for Brotli decompression.\n\tinternal sealed class Decode\n\t{\n\t\tprivate const int DefaultCodeLength = 8;\n\n\t\tprivate const int CodeLengthRepeatCode = 16;\n\n\t\tprivate const int NumLiteralCodes = 256;\n\n\t\tprivate const int NumInsertAndCopyCodes = 704;\n\n\t\tprivate const int NumBlockLengthCodes = 26;\n\n\t\tprivate const int LiteralContextBits = 6;\n\n\t\tprivate const int DistanceContextBits = 2;\n\n\t\tprivate const int HuffmanTableBits = 8;\n\n\t\tprivate const int HuffmanTableMask = unchecked((int)(0xFF));\n\n\t\tprivate const int CodeLengthCodes = 18;\n\n\t\tprivate static readonly int[] CodeLengthCodeOrder = new int[] { 1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15 };\n\n\t\tprivate const int NumDistanceShortCodes = 16;\n\n\t\tprivate static readonly int[] DistanceShortCodeIndexOffset = new int[] { 3, 2, 1, 0, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2 };\n\n\t\tprivate static readonly int[] DistanceShortCodeValueOffset = new int[] { 0, 0, 0, 0, -1, 1, -2, 2, -3, 3, -1, 1, -2, 2, -3, 3 };\n\n\t\t/// Static Huffman code for the code length code lengths.\n\t\tprivate static readonly int[] FixedTable = new int[] { unchecked((int)(0x020000)), unchecked((int)(0x020004)), unchecked((int)(0x020003)), unchecked((int)(0x030002)), unchecked((int)(0x020000)), unchecked((int)(0x020004)), unchecked((int)(0x020003\n\t\t\t)), unchecked((int)(0x040001)), unchecked((int)(0x020000)), unchecked((int)(0x020004)), unchecked((int)(0x020003)), unchecked((int)(0x030002)), unchecked((int)(0x020000)), unchecked((int)(0x020004)), unchecked((int)(0x020003)), unchecked((int\n\t\t\t)(0x040005)) };\n\n\t\t/// Decodes a number in the range [0..255], by reading 1 - 11 bits.\n\t\tprivate static int DecodeVarLenUnsignedByte(Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tif (Org.Brotli.Dec.BitReader.ReadBits(br, 1) != 0)\n\t\t\t{\n\t\t\t\tint n = Org.Brotli.Dec.BitReader.ReadBits(br, 3);\n\t\t\t\tif (n == 0)\n\t\t\t\t{\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\treturn Org.Brotli.Dec.BitReader.ReadBits(br, n) + (1 << n);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tprivate static void DecodeMetaBlockLength(Org.Brotli.Dec.BitReader br, Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tstate.inputEnd = Org.Brotli.Dec.BitReader.ReadBits(br, 1) == 1;\n\t\t\tstate.metaBlockLength = 0;\n\t\t\tstate.isUncompressed = false;\n\t\t\tstate.isMetadata = false;\n\t\t\tif (state.inputEnd && Org.Brotli.Dec.BitReader.ReadBits(br, 1) != 0)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint sizeNibbles = Org.Brotli.Dec.BitReader.ReadBits(br, 2) + 4;\n\t\t\tif (sizeNibbles == 7)\n\t\t\t{\n\t\t\t\tstate.isMetadata = true;\n\t\t\t\tif (Org.Brotli.Dec.BitReader.ReadBits(br, 1) != 0)\n\t\t\t\t{\n\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Corrupted reserved bit\");\n\t\t\t\t}\n\t\t\t\tint sizeBytes = Org.Brotli.Dec.BitReader.ReadBits(br, 2);\n\t\t\t\tif (sizeBytes == 0)\n\t\t\t\t{\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < sizeBytes; i++)\n\t\t\t\t{\n\t\t\t\t\tint bits = Org.Brotli.Dec.BitReader.ReadBits(br, 8);\n\t\t\t\t\tif (bits == 0 && i + 1 == sizeBytes && sizeBytes > 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Exuberant nibble\");\n\t\t\t\t\t}\n\t\t\t\t\tstate.metaBlockLength |= bits << (i * 8);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < sizeNibbles; i++)\n\t\t\t\t{\n\t\t\t\t\tint bits = Org.Brotli.Dec.BitReader.ReadBits(br, 4);\n\t\t\t\t\tif (bits == 0 && i + 1 == sizeNibbles && sizeNibbles > 4)\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Exuberant nibble\");\n\t\t\t\t\t}\n\t\t\t\t\tstate.metaBlockLength |= bits << (i * 4);\n\t\t\t\t}\n\t\t\t}\n\t\t\tstate.metaBlockLength++;\n\t\t\tif (!state.inputEnd)\n\t\t\t{\n\t\t\t\tstate.isUncompressed = Org.Brotli.Dec.BitReader.ReadBits(br, 1) == 1;\n\t\t\t}\n\t\t}\n\n\t\t/// Decodes the next Huffman code from bit-stream.\n\t\tprivate static int ReadSymbol(int[] table, int offset, Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tint val = (int)((long)(((ulong)br.accumulator) >> br.bitOffset));\n\t\t\toffset += val & HuffmanTableMask;\n\t\t\tint bits = table[offset] >> 16;\n\t\t\tint sym = table[offset] & unchecked((int)(0xFFFF));\n\t\t\tif (bits <= HuffmanTableBits)\n\t\t\t{\n\t\t\t\tbr.bitOffset += bits;\n\t\t\t\treturn sym;\n\t\t\t}\n\t\t\toffset += sym;\n\t\t\tint mask = (1 << bits) - 1;\n\t\t\toffset += (int)(((uint)(val & mask)) >> HuffmanTableBits);\n\t\t\tbr.bitOffset += ((table[offset] >> 16) + HuffmanTableBits);\n\t\t\treturn table[offset] & unchecked((int)(0xFFFF));\n\t\t}\n\n\t\tprivate static int ReadBlockLength(int[] table, int offset, Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\tint code = ReadSymbol(table, offset, br);\n\t\t\tint n = Org.Brotli.Dec.Prefix.BlockLengthNBits[code];\n\t\t\treturn Org.Brotli.Dec.Prefix.BlockLengthOffset[code] + Org.Brotli.Dec.BitReader.ReadBits(br, n);\n\t\t}\n\n\t\tprivate static int TranslateShortCodes(int code, int[] ringBuffer, int index)\n\t\t{\n\t\t\tif (code < NumDistanceShortCodes)\n\t\t\t{\n\t\t\t\tindex += DistanceShortCodeIndexOffset[code];\n\t\t\t\tindex &= 3;\n\t\t\t\treturn ringBuffer[index] + DistanceShortCodeValueOffset[code];\n\t\t\t}\n\t\t\treturn code - NumDistanceShortCodes + 1;\n\t\t}\n\n\t\tprivate static void MoveToFront(int[] v, int index)\n\t\t{\n\t\t\tint value = v[index];\n\t\t\tfor (; index > 0; index--)\n\t\t\t{\n\t\t\t\tv[index] = v[index - 1];\n\t\t\t}\n\t\t\tv[0] = value;\n\t\t}\n\n\t\tprivate static void InverseMoveToFrontTransform(byte[] v, int vLen)\n\t\t{\n\t\t\tint[] mtf = new int[256];\n\t\t\tfor (int i = 0; i < 256; i++)\n\t\t\t{\n\t\t\t\tmtf[i] = i;\n\t\t\t}\n\t\t\tfor (int i = 0; i < vLen; i++)\n\t\t\t{\n\t\t\t\tint index = v[i] & unchecked((int)(0xFF));\n\t\t\t\tv[i] = unchecked((byte)mtf[index]);\n\t\t\t\tif (index != 0)\n\t\t\t\t{\n\t\t\t\t\tMoveToFront(mtf, index);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprivate static void ReadHuffmanCodeLengths(int[] codeLengthCodeLengths, int numSymbols, int[] codeLengths, Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tint symbol = 0;\n\t\t\tint prevCodeLen = DefaultCodeLength;\n\t\t\tint repeat = 0;\n\t\t\tint repeatCodeLen = 0;\n\t\t\tint space = 32768;\n\t\t\tint[] table = new int[32];\n\t\t\tOrg.Brotli.Dec.Huffman.BuildHuffmanTable(table, 0, 5, codeLengthCodeLengths, CodeLengthCodes);\n\t\t\twhile (symbol < numSymbols && space > 0)\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\tint p = (int)(((long)(((ulong)br.accumulator) >> br.bitOffset))) & 31;\n\t\t\t\tbr.bitOffset += table[p] >> 16;\n\t\t\t\tint codeLen = table[p] & unchecked((int)(0xFFFF));\n\t\t\t\tif (codeLen < CodeLengthRepeatCode)\n\t\t\t\t{\n\t\t\t\t\trepeat = 0;\n\t\t\t\t\tcodeLengths[symbol++] = codeLen;\n\t\t\t\t\tif (codeLen != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tprevCodeLen = codeLen;\n\t\t\t\t\t\tspace -= 32768 >> codeLen;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint extraBits = codeLen - 14;\n\t\t\t\t\tint newLen = 0;\n\t\t\t\t\tif (codeLen == CodeLengthRepeatCode)\n\t\t\t\t\t{\n\t\t\t\t\t\tnewLen = prevCodeLen;\n\t\t\t\t\t}\n\t\t\t\t\tif (repeatCodeLen != newLen)\n\t\t\t\t\t{\n\t\t\t\t\t\trepeat = 0;\n\t\t\t\t\t\trepeatCodeLen = newLen;\n\t\t\t\t\t}\n\t\t\t\t\tint oldRepeat = repeat;\n\t\t\t\t\tif (repeat > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\trepeat -= 2;\n\t\t\t\t\t\trepeat <<= extraBits;\n\t\t\t\t\t}\n\t\t\t\t\trepeat += Org.Brotli.Dec.BitReader.ReadBits(br, extraBits) + 3;\n\t\t\t\t\tint repeatDelta = repeat - oldRepeat;\n\t\t\t\t\tif (symbol + repeatDelta > numSymbols)\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"symbol + repeatDelta > numSymbols\");\n\t\t\t\t\t}\n\t\t\t\t\t// COV_NF_LINE\n\t\t\t\t\tfor (int i = 0; i < repeatDelta; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tcodeLengths[symbol++] = repeatCodeLen;\n\t\t\t\t\t}\n\t\t\t\t\tif (repeatCodeLen != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tspace -= repeatDelta << (15 - repeatCodeLen);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (space != 0)\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Unused space\");\n\t\t\t}\n\t\t\t// COV_NF_LINE\n\t\t\t// TODO: Pass max_symbol to Huffman table builder instead?\n\t\t\tOrg.Brotli.Dec.Utils.FillWithZeroes(codeLengths, symbol, numSymbols - symbol);\n\t\t}\n\n\t\t// TODO: Use specialized versions for smaller tables.\n\t\tinternal static void ReadHuffmanCode(int alphabetSize, int[] table, int offset, Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tbool ok = true;\n\t\t\tint simpleCodeOrSkip;\n\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t// TODO: Avoid allocation.\n\t\t\tint[] codeLengths = new int[alphabetSize];\n\t\t\tsimpleCodeOrSkip = Org.Brotli.Dec.BitReader.ReadBits(br, 2);\n\t\t\tif (simpleCodeOrSkip == 1)\n\t\t\t{\n\t\t\t\t// Read symbols, codes & code lengths directly.\n\t\t\t\tint maxBitsCounter = alphabetSize - 1;\n\t\t\t\tint maxBits = 0;\n\t\t\t\tint[] symbols = new int[4];\n\t\t\t\tint numSymbols = Org.Brotli.Dec.BitReader.ReadBits(br, 2) + 1;\n\t\t\t\twhile (maxBitsCounter != 0)\n\t\t\t\t{\n\t\t\t\t\tmaxBitsCounter >>= 1;\n\t\t\t\t\tmaxBits++;\n\t\t\t\t}\n\t\t\t\t// TODO: uncomment when codeLengths is reused.\n\t\t\t\t// Utils.fillWithZeroes(codeLengths, 0, alphabetSize);\n\t\t\t\tfor (int i = 0; i < numSymbols; i++)\n\t\t\t\t{\n\t\t\t\t\tsymbols[i] = Org.Brotli.Dec.BitReader.ReadBits(br, maxBits) % alphabetSize;\n\t\t\t\t\tcodeLengths[symbols[i]] = 2;\n\t\t\t\t}\n\t\t\t\tcodeLengths[symbols[0]] = 1;\n\t\t\t\tswitch (numSymbols)\n\t\t\t\t{\n\t\t\t\t\tcase 1:\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase 2:\n\t\t\t\t\t{\n\t\t\t\t\t\tok = symbols[0] != symbols[1];\n\t\t\t\t\t\tcodeLengths[symbols[1]] = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase 3:\n\t\t\t\t\t{\n\t\t\t\t\t\tok = symbols[0] != symbols[1] && symbols[0] != symbols[2] && symbols[1] != symbols[2];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase 4:\n\t\t\t\t\tdefault:\n\t\t\t\t\t{\n\t\t\t\t\t\tok = symbols[0] != symbols[1] && symbols[0] != symbols[2] && symbols[0] != symbols[3] && symbols[1] != symbols[2] && symbols[1] != symbols[3] && symbols[2] != symbols[3];\n\t\t\t\t\t\tif (Org.Brotli.Dec.BitReader.ReadBits(br, 1) == 1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcodeLengths[symbols[2]] = 3;\n\t\t\t\t\t\t\tcodeLengths[symbols[3]] = 3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcodeLengths[symbols[0]] = 2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// Decode Huffman-coded code lengths.\n\t\t\t\tint[] codeLengthCodeLengths = new int[CodeLengthCodes];\n\t\t\t\tint space = 32;\n\t\t\t\tint numCodes = 0;\n\t\t\t\tfor (int i = simpleCodeOrSkip; i < CodeLengthCodes && space > 0; i++)\n\t\t\t\t{\n\t\t\t\t\tint codeLenIdx = CodeLengthCodeOrder[i];\n\t\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\t\tint p = (int)((long)(((ulong)br.accumulator) >> br.bitOffset)) & 15;\n\t\t\t\t\t// TODO: Demultiplex FIXED_TABLE.\n\t\t\t\t\tbr.bitOffset += FixedTable[p] >> 16;\n\t\t\t\t\tint v = FixedTable[p] & unchecked((int)(0xFFFF));\n\t\t\t\t\tcodeLengthCodeLengths[codeLenIdx] = v;\n\t\t\t\t\tif (v != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tspace -= (32 >> v);\n\t\t\t\t\t\tnumCodes++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tok = (numCodes == 1 || space == 0);\n\t\t\t\tReadHuffmanCodeLengths(codeLengthCodeLengths, alphabetSize, codeLengths, br);\n\t\t\t}\n\t\t\tif (!ok)\n\t\t\t{\n\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Can't readHuffmanCode\");\n\t\t\t}\n\t\t\t// COV_NF_LINE\n\t\t\tOrg.Brotli.Dec.Huffman.BuildHuffmanTable(table, offset, HuffmanTableBits, codeLengths, alphabetSize);\n\t\t}\n\n\t\tprivate static int DecodeContextMap(int contextMapSize, byte[] contextMap, Org.Brotli.Dec.BitReader br)\n\t\t{\n\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\tint numTrees = DecodeVarLenUnsignedByte(br) + 1;\n\t\t\tif (numTrees == 1)\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.Utils.FillWithZeroes(contextMap, 0, contextMapSize);\n\t\t\t\treturn numTrees;\n\t\t\t}\n\t\t\tbool useRleForZeros = Org.Brotli.Dec.BitReader.ReadBits(br, 1) == 1;\n\t\t\tint maxRunLengthPrefix = 0;\n\t\t\tif (useRleForZeros)\n\t\t\t{\n\t\t\t\tmaxRunLengthPrefix = Org.Brotli.Dec.BitReader.ReadBits(br, 4) + 1;\n\t\t\t}\n\t\t\tint[] table = new int[Org.Brotli.Dec.Huffman.HuffmanMaxTableSize];\n\t\t\tReadHuffmanCode(numTrees + maxRunLengthPrefix, table, 0, br);\n\t\t\tfor (int i = 0; i < contextMapSize; )\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\tint code = ReadSymbol(table, 0, br);\n\t\t\t\tif (code == 0)\n\t\t\t\t{\n\t\t\t\t\tcontextMap[i] = 0;\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\telse if (code <= maxRunLengthPrefix)\n\t\t\t\t{\n\t\t\t\t\tint reps = (1 << code) + Org.Brotli.Dec.BitReader.ReadBits(br, code);\n\t\t\t\t\twhile (reps != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (i >= contextMapSize)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Corrupted context map\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// COV_NF_LINE\n\t\t\t\t\t\tcontextMap[i] = 0;\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\treps--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcontextMap[i] = unchecked((byte)(code - maxRunLengthPrefix));\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (Org.Brotli.Dec.BitReader.ReadBits(br, 1) == 1)\n\t\t\t{\n\t\t\t\tInverseMoveToFrontTransform(contextMap, contextMapSize);\n\t\t\t}\n\t\t\treturn numTrees;\n\t\t}\n\n\t\tprivate static void DecodeBlockTypeAndLength(Org.Brotli.Dec.State state, int treeType)\n\t\t{\n\t\t\tOrg.Brotli.Dec.BitReader br = state.br;\n\t\t\tint[] ringBuffers = state.blockTypeRb;\n\t\t\tint offset = treeType * 2;\n\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\tint blockType = ReadSymbol(state.blockTypeTrees, treeType * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize, br);\n\t\t\tstate.blockLength[treeType] = ReadBlockLength(state.blockLenTrees, treeType * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize, br);\n\t\t\tif (blockType == 1)\n\t\t\t{\n\t\t\t\tblockType = ringBuffers[offset + 1] + 1;\n\t\t\t}\n\t\t\telse if (blockType == 0)\n\t\t\t{\n\t\t\t\tblockType = ringBuffers[offset];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tblockType -= 2;\n\t\t\t}\n\t\t\tif (blockType >= state.numBlockTypes[treeType])\n\t\t\t{\n\t\t\t\tblockType -= state.numBlockTypes[treeType];\n\t\t\t}\n\t\t\tringBuffers[offset] = ringBuffers[offset + 1];\n\t\t\tringBuffers[offset + 1] = blockType;\n\t\t}\n\n\t\tprivate static void DecodeLiteralBlockSwitch(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tDecodeBlockTypeAndLength(state, 0);\n\t\t\tint literalBlockType = state.blockTypeRb[1];\n\t\t\tstate.contextMapSlice = literalBlockType << LiteralContextBits;\n\t\t\tstate.literalTreeIndex = state.contextMap[state.contextMapSlice] & unchecked((int)(0xFF));\n\t\t\tstate.literalTree = state.hGroup0.trees[state.literalTreeIndex];\n\t\t\tint contextMode = state.contextModes[literalBlockType];\n\t\t\tstate.contextLookupOffset1 = Org.Brotli.Dec.Context.LookupOffsets[contextMode];\n\t\t\tstate.contextLookupOffset2 = Org.Brotli.Dec.Context.LookupOffsets[contextMode + 1];\n\t\t}\n\n\t\tprivate static void DecodeCommandBlockSwitch(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tDecodeBlockTypeAndLength(state, 1);\n\t\t\tstate.treeCommandOffset = state.hGroup1.trees[state.blockTypeRb[3]];\n\t\t}\n\n\t\tprivate static void DecodeDistanceBlockSwitch(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tDecodeBlockTypeAndLength(state, 2);\n\t\t\tstate.distContextMapSlice = state.blockTypeRb[5] << DistanceContextBits;\n\t\t}\n\n\t\tprivate static void MaybeReallocateRingBuffer(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tint newSize = state.maxRingBufferSize;\n\t\t\tif ((long)newSize > state.expectedTotalSize)\n\t\t\t{\n\t\t\t\t/* TODO: Handle 2GB+ cases more gracefully. */\n\t\t\t\tint minimalNewSize = (int)state.expectedTotalSize + state.customDictionary.Length;\n\t\t\t\twhile ((newSize >> 1) > minimalNewSize)\n\t\t\t\t{\n\t\t\t\t\tnewSize >>= 1;\n\t\t\t\t}\n\t\t\t\tif (!state.inputEnd && newSize < 16384 && state.maxRingBufferSize >= 16384)\n\t\t\t\t{\n\t\t\t\t\tnewSize = 16384;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (newSize <= state.ringBufferSize)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint ringBufferSizeWithSlack = newSize + Org.Brotli.Dec.Dictionary.MaxTransformedWordLength;\n\t\t\tbyte[] newBuffer = new byte[ringBufferSizeWithSlack];\n\t\t\tif (state.ringBuffer != null)\n\t\t\t{\n\t\t\t\tSystem.Array.Copy(state.ringBuffer, 0, newBuffer, 0, state.ringBufferSize);\n\t\t\t}\n\t\t\telse if (state.customDictionary.Length != 0)\n\t\t\t{\n\t\t\t\t/* Prepend custom dictionary, if any. */\n\t\t\t\tint length = state.customDictionary.Length;\n\t\t\t\tint offset = 0;\n\t\t\t\tif (length > state.maxBackwardDistance)\n\t\t\t\t{\n\t\t\t\t\toffset = length - state.maxBackwardDistance;\n\t\t\t\t\tlength = state.maxBackwardDistance;\n\t\t\t\t}\n\t\t\t\tSystem.Array.Copy(state.customDictionary, offset, newBuffer, 0, length);\n\t\t\t\tstate.pos = length;\n\t\t\t\tstate.bytesToIgnore = length;\n\t\t\t}\n\t\t\tstate.ringBuffer = newBuffer;\n\t\t\tstate.ringBufferSize = newSize;\n\t\t}\n\n\t\t/// Reads next metablock header.\n\t\t/// decoding state\n\t\tprivate static void ReadMetablockInfo(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tOrg.Brotli.Dec.BitReader br = state.br;\n\t\t\tif (state.inputEnd)\n\t\t\t{\n\t\t\t\tstate.nextRunningState = Org.Brotli.Dec.RunningState.Finished;\n\t\t\t\tstate.bytesToWrite = state.pos;\n\t\t\t\tstate.bytesWritten = 0;\n\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Write;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// TODO: Reset? Do we need this?\n\t\t\tstate.hGroup0.codes = null;\n\t\t\tstate.hGroup0.trees = null;\n\t\t\tstate.hGroup1.codes = null;\n\t\t\tstate.hGroup1.trees = null;\n\t\t\tstate.hGroup2.codes = null;\n\t\t\tstate.hGroup2.trees = null;\n\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\tDecodeMetaBlockLength(br, state);\n\t\t\tif (state.metaBlockLength == 0 && !state.isMetadata)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (state.isUncompressed || state.isMetadata)\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.BitReader.JumpToByteBoundary(br);\n\t\t\t\tstate.runningState = state.isMetadata ? Org.Brotli.Dec.RunningState.ReadMetadata : Org.Brotli.Dec.RunningState.CopyUncompressed;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.CompressedBlockStart;\n\t\t\t}\n\t\t\tif (state.isMetadata)\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tstate.expectedTotalSize += state.metaBlockLength;\n\t\t\tif (state.ringBufferSize < state.maxRingBufferSize)\n\t\t\t{\n\t\t\t\tMaybeReallocateRingBuffer(state);\n\t\t\t}\n\t\t}\n\n\t\tprivate static void ReadMetablockHuffmanCodesAndContextMaps(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tOrg.Brotli.Dec.BitReader br = state.br;\n\t\t\tfor (int i = 0; i < 3; i++)\n\t\t\t{\n\t\t\t\tstate.numBlockTypes[i] = DecodeVarLenUnsignedByte(br) + 1;\n\t\t\t\tstate.blockLength[i] = 1 << 28;\n\t\t\t\tif (state.numBlockTypes[i] > 1)\n\t\t\t\t{\n\t\t\t\t\tReadHuffmanCode(state.numBlockTypes[i] + 2, state.blockTypeTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize, br);\n\t\t\t\t\tReadHuffmanCode(NumBlockLengthCodes, state.blockLenTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize, br);\n\t\t\t\t\tstate.blockLength[i] = ReadBlockLength(state.blockLenTrees, i * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize, br);\n\t\t\t\t}\n\t\t\t}\n\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\tstate.distancePostfixBits = Org.Brotli.Dec.BitReader.ReadBits(br, 2);\n\t\t\tstate.numDirectDistanceCodes = NumDistanceShortCodes + (Org.Brotli.Dec.BitReader.ReadBits(br, 4) << state.distancePostfixBits);\n\t\t\tstate.distancePostfixMask = (1 << state.distancePostfixBits) - 1;\n\t\t\tint numDistanceCodes = state.numDirectDistanceCodes + (48 << state.distancePostfixBits);\n\t\t\t// TODO: Reuse?\n\t\t\tstate.contextModes = new byte[state.numBlockTypes[0]];\n\t\t\tfor (int i = 0; i < state.numBlockTypes[0]; )\n\t\t\t{\n\t\t\t\t/* Ensure that less than 256 bits read between readMoreInput. */\n\t\t\t\tint limit = System.Math.Min(i + 96, state.numBlockTypes[0]);\n\t\t\t\tfor (; i < limit; ++i)\n\t\t\t\t{\n\t\t\t\t\tstate.contextModes[i] = unchecked((byte)(Org.Brotli.Dec.BitReader.ReadBits(br, 2) << 1));\n\t\t\t\t}\n\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t}\n\t\t\t// TODO: Reuse?\n\t\t\tstate.contextMap = new byte[state.numBlockTypes[0] << LiteralContextBits];\n\t\t\tint numLiteralTrees = DecodeContextMap(state.numBlockTypes[0] << LiteralContextBits, state.contextMap, br);\n\t\t\tstate.trivialLiteralContext = true;\n\t\t\tfor (int j = 0; j < state.numBlockTypes[0] << LiteralContextBits; j++)\n\t\t\t{\n\t\t\t\tif (state.contextMap[j] != j >> LiteralContextBits)\n\t\t\t\t{\n\t\t\t\t\tstate.trivialLiteralContext = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// TODO: Reuse?\n\t\t\tstate.distContextMap = new byte[state.numBlockTypes[2] << DistanceContextBits];\n\t\t\tint numDistTrees = DecodeContextMap(state.numBlockTypes[2] << DistanceContextBits, state.distContextMap, br);\n\t\t\tOrg.Brotli.Dec.HuffmanTreeGroup.Init(state.hGroup0, NumLiteralCodes, numLiteralTrees);\n\t\t\tOrg.Brotli.Dec.HuffmanTreeGroup.Init(state.hGroup1, NumInsertAndCopyCodes, state.numBlockTypes[1]);\n\t\t\tOrg.Brotli.Dec.HuffmanTreeGroup.Init(state.hGroup2, numDistanceCodes, numDistTrees);\n\t\t\tOrg.Brotli.Dec.HuffmanTreeGroup.Decode(state.hGroup0, br);\n\t\t\tOrg.Brotli.Dec.HuffmanTreeGroup.Decode(state.hGroup1, br);\n\t\t\tOrg.Brotli.Dec.HuffmanTreeGroup.Decode(state.hGroup2, br);\n\t\t\tstate.contextMapSlice = 0;\n\t\t\tstate.distContextMapSlice = 0;\n\t\t\tstate.contextLookupOffset1 = Org.Brotli.Dec.Context.LookupOffsets[state.contextModes[0]];\n\t\t\tstate.contextLookupOffset2 = Org.Brotli.Dec.Context.LookupOffsets[state.contextModes[0] + 1];\n\t\t\tstate.literalTreeIndex = 0;\n\t\t\tstate.literalTree = state.hGroup0.trees[0];\n\t\t\tstate.treeCommandOffset = state.hGroup1.trees[0];\n\t\t\t// TODO: == 0?\n\t\t\tstate.blockTypeRb[0] = state.blockTypeRb[2] = state.blockTypeRb[4] = 1;\n\t\t\tstate.blockTypeRb[1] = state.blockTypeRb[3] = state.blockTypeRb[5] = 0;\n\t\t}\n\n\t\tprivate static void CopyUncompressedData(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tOrg.Brotli.Dec.BitReader br = state.br;\n\t\t\tbyte[] ringBuffer = state.ringBuffer;\n\t\t\t// Could happen if block ends at ring buffer end.\n\t\t\tif (state.metaBlockLength <= 0)\n\t\t\t{\n\t\t\t\tOrg.Brotli.Dec.BitReader.Reload(br);\n\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.BlockStart;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tint chunkLength = System.Math.Min(state.ringBufferSize - state.pos, state.metaBlockLength);\n\t\t\tOrg.Brotli.Dec.BitReader.CopyBytes(br, ringBuffer, state.pos, chunkLength);\n\t\t\tstate.metaBlockLength -= chunkLength;\n\t\t\tstate.pos += chunkLength;\n\t\t\tif (state.pos == state.ringBufferSize)\n\t\t\t{\n\t\t\t\tstate.nextRunningState = Org.Brotli.Dec.RunningState.CopyUncompressed;\n\t\t\t\tstate.bytesToWrite = state.ringBufferSize;\n\t\t\t\tstate.bytesWritten = 0;\n\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Write;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tOrg.Brotli.Dec.BitReader.Reload(br);\n\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.BlockStart;\n\t\t}\n\n\t\tprivate static bool WriteRingBuffer(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\t/* Ignore custom dictionary bytes. */\n\t\t\tif (state.bytesToIgnore != 0)\n\t\t\t{\n\t\t\t\tstate.bytesWritten += state.bytesToIgnore;\n\t\t\t\tstate.bytesToIgnore = 0;\n\t\t\t}\n\t\t\tint toWrite = System.Math.Min(state.outputLength - state.outputUsed, state.bytesToWrite - state.bytesWritten);\n\t\t\tif (toWrite != 0)\n\t\t\t{\n\t\t\t\tSystem.Array.Copy(state.ringBuffer, state.bytesWritten, state.output, state.outputOffset + state.outputUsed, toWrite);\n\t\t\t\tstate.outputUsed += toWrite;\n\t\t\t\tstate.bytesWritten += toWrite;\n\t\t\t}\n\t\t\treturn state.outputUsed < state.outputLength;\n\t\t}\n\n\t\tinternal static void SetCustomDictionary(Org.Brotli.Dec.State state, byte[] data)\n\t\t{\n\t\t\tstate.customDictionary = (data == null) ? new byte[0] : data;\n\t\t}\n\n\t\t/// Actual decompress implementation.\n\t\tinternal static void Decompress(Org.Brotli.Dec.State state)\n\t\t{\n\t\t\tif (state.runningState == Org.Brotli.Dec.RunningState.Uninitialized)\n\t\t\t{\n\t\t\t\tthrow new System.InvalidOperationException(\"Can't decompress until initialized\");\n\t\t\t}\n\t\t\tif (state.runningState == Org.Brotli.Dec.RunningState.Closed)\n\t\t\t{\n\t\t\t\tthrow new System.InvalidOperationException(\"Can't decompress after close\");\n\t\t\t}\n\t\t\tOrg.Brotli.Dec.BitReader br = state.br;\n\t\t\tint ringBufferMask = state.ringBufferSize - 1;\n\t\t\tbyte[] ringBuffer = state.ringBuffer;\n\t\t\twhile (state.runningState != Org.Brotli.Dec.RunningState.Finished)\n\t\t\t{\n\t\t\t\tswitch (state.runningState)\n\t\t\t\t{\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.BlockStart:\n\t\t\t\t\t{\n\t\t\t\t\t\t// TODO: extract cases to methods for the better readability.\n\t\t\t\t\t\tif (state.metaBlockLength < 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Invalid metablock length\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\tReadMetablockInfo(state);\n\t\t\t\t\t\t/* Ring-buffer would be reallocated here. */\n\t\t\t\t\t\tringBufferMask = state.ringBufferSize - 1;\n\t\t\t\t\t\tringBuffer = state.ringBuffer;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.CompressedBlockStart:\n\t\t\t\t\t{\n\t\t\t\t\t\tReadMetablockHuffmanCodesAndContextMaps(state);\n\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.MainLoop;\n\t\t\t\t\t\tgoto case Org.Brotli.Dec.RunningState.MainLoop;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.MainLoop:\n\t\t\t\t\t{\n\t\t\t\t\t\t// Fall through\n\t\t\t\t\t\tif (state.metaBlockLength <= 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.BlockStart;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\t\t\tif (state.blockLength[1] == 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDecodeCommandBlockSwitch(state);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate.blockLength[1]--;\n\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\t\t\tint cmdCode = ReadSymbol(state.hGroup1.codes, state.treeCommandOffset, br);\n\t\t\t\t\t\tint rangeIdx = (int)(((uint)cmdCode) >> 6);\n\t\t\t\t\t\tstate.distanceCode = 0;\n\t\t\t\t\t\tif (rangeIdx >= 2)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\trangeIdx -= 2;\n\t\t\t\t\t\t\tstate.distanceCode = -1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint insertCode = Org.Brotli.Dec.Prefix.InsertRangeLut[rangeIdx] + (((int)(((uint)cmdCode) >> 3)) & 7);\n\t\t\t\t\t\tint copyCode = Org.Brotli.Dec.Prefix.CopyRangeLut[rangeIdx] + (cmdCode & 7);\n\t\t\t\t\t\tstate.insertLength = Org.Brotli.Dec.Prefix.InsertLengthOffset[insertCode] + Org.Brotli.Dec.BitReader.ReadBits(br, Org.Brotli.Dec.Prefix.InsertLengthNBits[insertCode]);\n\t\t\t\t\t\tstate.copyLength = Org.Brotli.Dec.Prefix.CopyLengthOffset[copyCode] + Org.Brotli.Dec.BitReader.ReadBits(br, Org.Brotli.Dec.Prefix.CopyLengthNBits[copyCode]);\n\t\t\t\t\t\tstate.j = 0;\n\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.InsertLoop;\n\t\t\t\t\t\tgoto case Org.Brotli.Dec.RunningState.InsertLoop;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.InsertLoop:\n\t\t\t\t\t{\n\t\t\t\t\t\t// Fall through\n\t\t\t\t\t\tif (state.trivialLiteralContext)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\twhile (state.j < state.insertLength)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\t\t\t\t\tif (state.blockLength[0] == 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tDecodeLiteralBlockSwitch(state);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tstate.blockLength[0]--;\n\t\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\t\t\t\t\tringBuffer[state.pos] = unchecked((byte)ReadSymbol(state.hGroup0.codes, state.literalTree, br));\n\t\t\t\t\t\t\t\tstate.j++;\n\t\t\t\t\t\t\t\tif (state.pos++ == ringBufferMask)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tstate.nextRunningState = Org.Brotli.Dec.RunningState.InsertLoop;\n\t\t\t\t\t\t\t\t\tstate.bytesToWrite = state.ringBufferSize;\n\t\t\t\t\t\t\t\t\tstate.bytesWritten = 0;\n\t\t\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Write;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint prevByte1 = ringBuffer[(state.pos - 1) & ringBufferMask] & unchecked((int)(0xFF));\n\t\t\t\t\t\t\tint prevByte2 = ringBuffer[(state.pos - 2) & ringBufferMask] & unchecked((int)(0xFF));\n\t\t\t\t\t\t\twhile (state.j < state.insertLength)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\t\t\t\t\tif (state.blockLength[0] == 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tDecodeLiteralBlockSwitch(state);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tint literalTreeIndex = state.contextMap[state.contextMapSlice + (Org.Brotli.Dec.Context.Lookup[state.contextLookupOffset1 + prevByte1] | Org.Brotli.Dec.Context.Lookup[state.contextLookupOffset2 + prevByte2])] & unchecked((int)(0xFF));\n\t\t\t\t\t\t\t\tstate.blockLength[0]--;\n\t\t\t\t\t\t\t\tprevByte2 = prevByte1;\n\t\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\t\t\t\t\tprevByte1 = ReadSymbol(state.hGroup0.codes, state.hGroup0.trees[literalTreeIndex], br);\n\t\t\t\t\t\t\t\tringBuffer[state.pos] = unchecked((byte)prevByte1);\n\t\t\t\t\t\t\t\tstate.j++;\n\t\t\t\t\t\t\t\tif (state.pos++ == ringBufferMask)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tstate.nextRunningState = Org.Brotli.Dec.RunningState.InsertLoop;\n\t\t\t\t\t\t\t\t\tstate.bytesToWrite = state.ringBufferSize;\n\t\t\t\t\t\t\t\t\tstate.bytesWritten = 0;\n\t\t\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Write;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (state.runningState != Org.Brotli.Dec.RunningState.InsertLoop)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate.metaBlockLength -= state.insertLength;\n\t\t\t\t\t\tif (state.metaBlockLength <= 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.MainLoop;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (state.distanceCode < 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\t\t\t\tif (state.blockLength[2] == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tDecodeDistanceBlockSwitch(state);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstate.blockLength[2]--;\n\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.FillBitWindow(br);\n\t\t\t\t\t\t\tstate.distanceCode = ReadSymbol(state.hGroup2.codes, state.hGroup2.trees[state.distContextMap[state.distContextMapSlice + (state.copyLength > 4 ? 3 : state.copyLength - 2)] & unchecked((int)(0xFF))], br);\n\t\t\t\t\t\t\tif (state.distanceCode >= state.numDirectDistanceCodes)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tstate.distanceCode -= state.numDirectDistanceCodes;\n\t\t\t\t\t\t\t\tint postfix = state.distanceCode & state.distancePostfixMask;\n\t\t\t\t\t\t\t\tstate.distanceCode = (int)(((uint)state.distanceCode) >> state.distancePostfixBits);\n\t\t\t\t\t\t\t\tint n = ((int)(((uint)state.distanceCode) >> 1)) + 1;\n\t\t\t\t\t\t\t\tint offset = ((2 + (state.distanceCode & 1)) << n) - 4;\n\t\t\t\t\t\t\t\tstate.distanceCode = state.numDirectDistanceCodes + postfix + ((offset + Org.Brotli.Dec.BitReader.ReadBits(br, n)) << state.distancePostfixBits);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Convert the distance code to the actual distance by possibly looking up past distances\n\t\t\t\t\t\t// from the ringBuffer.\n\t\t\t\t\t\tstate.distance = TranslateShortCodes(state.distanceCode, state.distRb, state.distRbIdx);\n\t\t\t\t\t\tif (state.distance < 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Negative distance\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// COV_NF_LINE\n\t\t\t\t\t\tif (state.maxDistance != state.maxBackwardDistance && state.pos < state.maxBackwardDistance)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.maxDistance = state.pos;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.maxDistance = state.maxBackwardDistance;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate.copyDst = state.pos;\n\t\t\t\t\t\tif (state.distance > state.maxDistance)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Transform;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (state.distanceCode > 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.distRb[state.distRbIdx & 3] = state.distance;\n\t\t\t\t\t\t\tstate.distRbIdx++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (state.copyLength > state.metaBlockLength)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Invalid backward reference\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// COV_NF_LINE\n\t\t\t\t\t\tstate.j = 0;\n\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.CopyLoop;\n\t\t\t\t\t\tgoto case Org.Brotli.Dec.RunningState.CopyLoop;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.CopyLoop:\n\t\t\t\t\t{\n\t\t\t\t\t\t// fall through\n\t\t\t\t\t\tint src = (state.pos - state.distance) & ringBufferMask;\n\t\t\t\t\t\tint dst = state.pos;\n\t\t\t\t\t\tint copyLength = state.copyLength - state.j;\n\t\t\t\t\t\tif ((src + copyLength < ringBufferMask) && (dst + copyLength < ringBufferMask))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor (int k = 0; k < copyLength; ++k)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tringBuffer[dst++] = ringBuffer[src++];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tstate.j += copyLength;\n\t\t\t\t\t\t\tstate.metaBlockLength -= copyLength;\n\t\t\t\t\t\t\tstate.pos += copyLength;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor (; state.j < state.copyLength; )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tringBuffer[state.pos] = ringBuffer[(state.pos - state.distance) & ringBufferMask];\n\t\t\t\t\t\t\t\tstate.metaBlockLength--;\n\t\t\t\t\t\t\t\tstate.j++;\n\t\t\t\t\t\t\t\tif (state.pos++ == ringBufferMask)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tstate.nextRunningState = Org.Brotli.Dec.RunningState.CopyLoop;\n\t\t\t\t\t\t\t\t\tstate.bytesToWrite = state.ringBufferSize;\n\t\t\t\t\t\t\t\t\tstate.bytesWritten = 0;\n\t\t\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Write;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (state.runningState == Org.Brotli.Dec.RunningState.CopyLoop)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.MainLoop;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.Transform:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (state.copyLength >= Org.Brotli.Dec.Dictionary.MinWordLength && state.copyLength <= Org.Brotli.Dec.Dictionary.MaxWordLength)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint offset = Org.Brotli.Dec.Dictionary.OffsetsByLength[state.copyLength];\n\t\t\t\t\t\t\tint wordId = state.distance - state.maxDistance - 1;\n\t\t\t\t\t\t\tint shift = Org.Brotli.Dec.Dictionary.SizeBitsByLength[state.copyLength];\n\t\t\t\t\t\t\tint mask = (1 << shift) - 1;\n\t\t\t\t\t\t\tint wordIdx = wordId & mask;\n\t\t\t\t\t\t\tint transformIdx = (int)(((uint)wordId) >> shift);\n\t\t\t\t\t\t\toffset += wordIdx * state.copyLength;\n\t\t\t\t\t\t\tif (transformIdx < Org.Brotli.Dec.Transform.Transforms.Length)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tint len = Org.Brotli.Dec.Transform.TransformDictionaryWord(ringBuffer, state.copyDst, Org.Brotli.Dec.Dictionary.GetData(), offset, state.copyLength, Org.Brotli.Dec.Transform.Transforms[transformIdx]);\n\t\t\t\t\t\t\t\tstate.copyDst += len;\n\t\t\t\t\t\t\t\tstate.pos += len;\n\t\t\t\t\t\t\t\tstate.metaBlockLength -= len;\n\t\t\t\t\t\t\t\tif (state.copyDst >= state.ringBufferSize)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tstate.nextRunningState = Org.Brotli.Dec.RunningState.CopyWrapBuffer;\n\t\t\t\t\t\t\t\t\tstate.bytesToWrite = state.ringBufferSize;\n\t\t\t\t\t\t\t\t\tstate.bytesWritten = 0;\n\t\t\t\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.Write;\n\t\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Invalid backward reference\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// COV_NF_LINE\n\t\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Invalid backward reference\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// COV_NF_LINE\n\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.MainLoop;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.CopyWrapBuffer:\n\t\t\t\t\t{\n\t\t\t\t\t\tSystem.Array.Copy(ringBuffer, state.ringBufferSize, ringBuffer, 0, state.copyDst - state.ringBufferSize);\n\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.MainLoop;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.ReadMetadata:\n\t\t\t\t\t{\n\t\t\t\t\t\twhile (state.metaBlockLength > 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.ReadMoreInput(br);\n\t\t\t\t\t\t\t// Optimize\n\t\t\t\t\t\t\tOrg.Brotli.Dec.BitReader.ReadBits(br, 8);\n\t\t\t\t\t\t\tstate.metaBlockLength--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate.runningState = Org.Brotli.Dec.RunningState.BlockStart;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.CopyUncompressed:\n\t\t\t\t\t{\n\t\t\t\t\t\tCopyUncompressedData(state);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tcase Org.Brotli.Dec.RunningState.Write:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!WriteRingBuffer(state))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// Output buffer is full.\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (state.pos >= state.maxBackwardDistance)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstate.maxDistance = state.maxBackwardDistance;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tstate.pos &= ringBufferMask;\n\t\t\t\t\t\tstate.runningState = state.nextRunningState;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tdefault:\n\t\t\t\t\t{\n\t\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Unexpected state \" + state.runningState);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (state.runningState == Org.Brotli.Dec.RunningState.Finished)\n\t\t\t{\n\t\t\t\tif (state.metaBlockLength < 0)\n\t\t\t\t{\n\t\t\t\t\tthrow new Org.Brotli.Dec.BrotliRuntimeException(\"Invalid metablock length\");\n\t\t\t\t}\n\t\t\t\tOrg.Brotli.Dec.BitReader.JumpToByteBoundary(br);\n\t\t\t\tOrg.Brotli.Dec.BitReader.CheckHealth(state.br, true);\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "AssetStudio/Brotli/Dictionary.cs", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\nDistributed under MIT license.\nSee file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\nnamespace Org.Brotli.Dec\n{\n\t/// Collection of static dictionary words.\n\t/// \n\t/// Collection of static dictionary words.\n\t///

Dictionary content is loaded from binary resource when\n\t/// \n\t/// is executed for the\n\t/// first time. Consequently, it saves memory and CPU in case dictionary is not required.\n\t///

One possible drawback is that multiple threads that need dictionary data may be blocked (only\n\t/// once in each classworld). To avoid this, it is enough to call\n\t/// \n\t/// proactively.\n\t/// \n\tinternal sealed class Dictionary\n\t{\n\t\t///

\"Initialization-on-demand holder idiom\" implementation.\n\t\t/// \n\t\t/// \"Initialization-on-demand holder idiom\" implementation.\n\t\t///

This static class definition is not initialized until the JVM determines that it must be\n\t\t/// executed (when the static method\n\t\t/// \n\t\t/// is invoked).\n\t\t/// \n\t\tprivate class DataHolder0\n\t\t{\n\t\t\tinternal static string GetData()\n\t\t\t{\n\t\t\t\treturn \"timedownlifeleftbackcodedatashowonlysitecityopenjustlikefreeworktextyearoverbodyloveformbookplaylivelinehelphomesidemorewordlongthemviewfindpagedaysfullheadtermeachareafromtruemarkableuponhighdatelandnewsevennextcasebothpostusedmadehandherewhatnameLinkblogsizebaseheldmakemainuser') +holdendswithNewsreadweresigntakehavegameseencallpathwellplusmenufilmpartjointhislistgoodneedwayswestjobsmindalsologorichuseslastteamarmyfoodkingwilleastwardbestfirePageknowaway.pngmovethanloadgiveselfnotemuchfeedmanyrockicononcelookhidediedHomerulehostajaxinfoclublawslesshalfsomesuchzone100%onescareTimeracebluefourweekfacehopegavehardlostwhenparkkeptpassshiproomHTMLplanTypedonesavekeepflaglinksoldfivetookratetownjumpthusdarkcardfilefearstaykillthatfallautoever.comtalkshopvotedeepmoderestturnbornbandfellroseurl(skinrolecomeactsagesmeetgold.jpgitemvaryfeltthensenddropViewcopy1.0\\\"stopelseliestourpack.gifpastcss?graymean>rideshotlatesaidroadvar feeljohnrickportfast'UA-deadpoorbilltypeU.S.woodmust2px;Inforankwidewantwalllead[0];paulwavesure$('#waitmassarmsgoesgainlangpaid!-- lockunitrootwalkfirmwifexml\\\"songtest20pxkindrowstoolfontmailsafestarmapscorerainflowbabyspansays4px;6px;artsfootrealwikiheatsteptriporg/lakeweaktoldFormcastfansbankveryrunsjulytask1px;goalgrewslowedgeid=\\\"sets5px;.js?40pxif (soonseatnonetubezerosentreedfactintogiftharm18pxcamehillboldzoomvoideasyringfillpeakinitcost3px;jacktagsbitsrolleditknewnearironfreddiskwentsoilputs/js/holyT22:ISBNT20:adamsees

json', 'contT21: RSSloopasiamoon

soulLINEfortcartT14:

80px!--<9px;T04:mike:46ZniceinchYorkricezh:\\u00E4'));puremageparatonebond:37Z_of_']);000,zh:\\u00E7tankyardbowlbush:56ZJava30px\\n|}\\n%C3%:34ZjeffEXPIcashvisagolfsnowzh:\\u00E9quer.csssickmeatmin.binddellhirepicsrent:36ZHTTP-201fotowolfEND xbox:54ZBODYdick;\\n}\\nexit:35Zvarsbeat'});diet999;anne}}sonyguysfuckpipe|-\\n!002)ndow[1];[];\\nLog salt\\r\\n\\t\\tbangtrimbath){\\r\\n00px\\n});ko:\\u00ECfeesad>\\rs:// [];tollplug(){\\n{\\r\\n .js'200pdualboat.JPG);\\n}quot);\\n\\n');\\n\\r\\n}\\r201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037201320122011201020092008200720062005200420032002200120001999199819971996199519941993199219911990198919881987198619851984198319821981198019791978197719761975197419731972197119701969196819671966196519641963196219611960195919581957195619551954195319521951195010001024139400009999comom\\u00C3\\u00A1sesteestaperotodohacecadaa\\u00C3\\u00B1obiend\\u00C3\\u00ADaas\\u00C3\\u00ADvidacasootroforosolootracualdijosidograntipotemadebealgoqu\\u00C3\\u00A9estonadatrespococasabajotodasinoaguapuesunosantediceluisellamayozonaamorpisoobraclicellodioshoracasi\\u00D0\\u00B7\\u00D0\\u00B0\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00BE\\u00D0\\u00BC\\u00D1\\u0080\\u00D0\\u00B0\\u00D1\\u0080\\u00D1\\u0083\\u00D1\\u0082\\u00D0\\u00B0\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u00BF\\u00D0\\u00BE\\u00D0\\u00BE\\u00D1\\u0082\\u00D0\\u00B8\\u00D0\\u00B7\\u00D0\\u00BD\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00BE\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B6\\u00D0\\u00B5\\u00D0\\u00BE\\u00D0\\u00BD\\u00D0\\u00B8\\u00D1\\u0085\\u00D0\\u009D\\u00D0\\u00B0\\u00D0\\u00B5\\u00D0\\u00B5\\u00D0\\u00B1\\u00D1\\u008B\\u00D0\\u00BC\\u00D1\\u008B\\u00D0\\u0092\\u00D1\\u008B\\u00D1\\u0081\\u00D0\\u00BE\\u00D0\\u00B2\\u00D1\\u008B\\u00D0\\u00B2\\u00D0\\u00BE\\u00D0\\u009D\\u00D0\\u00BE\\u00D0\\u00BE\\u00D0\\u00B1\\u00D0\\u009F\\u00D0\\u00BE\\u00D0\\u00BB\\u00D0\\u00B8\\u00D0\\u00BD\\u00D0\\u00B8\\u00D0\\u00A0\\u00D0\\u00A4\\u00D0\\u009D\\u00D0\\u00B5\\u00D0\\u009C\\u00D1\\u008B\\u00D1\\u0082\\u00D1\\u008B\\u00D0\\u009E\\u00D0\\u00BD\\u00D0\\u00B8\\u00D0\\u00BC\\u00D0\\u00B4\\u00D0\\u00B0\\u00D0\\u0097\\u00D0\\u00B0\\u00D0\\u0094\\u00D0\\u00B0\\u00D0\\u009D\\u00D1\\u0083\\u00D0\\u009E\\u00D0\\u00B1\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u0098\\u00D0\\u00B7\\u00D0\\u00B5\\u00D0\\u00B9\\u00D0\\u00BD\\u00D1\\u0083\\u00D0\\u00BC\\u00D0\\u00BC\\u00D0\\u00A2\\u00D1\\u008B\\u00D1\\u0083\\u00D0\\u00B6\\u00D9\\u0081\\u00D9\\u008A\\u00D8\\u00A3\\u00D9\\u0086\\u00D9\\u0085\\u00D8\\u00A7\\u00D9\\u0085\\u00D8\\u00B9\\u00D9\\u0083\\u00D9\\u0084\\u00D8\\u00A3\\u00D9\\u0088\\u00D8\\u00B1\\u00D8\\u00AF\\u00D9\\u008A\\u00D8\\u00A7\\u00D9\\u0081\\u00D9\\u0089\\u00D9\\u0087\\u00D9\\u0088\\u00D9\\u0084\\u00D9\\u0085\\u00D9\\u0084\\u00D9\\u0083\\u00D8\\u00A7\\u00D9\\u0088\\u00D9\\u0084\\u00D9\\u0087\\u00D8\\u00A8\\u00D8\\u00B3\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00A5\\u00D9\\u0086\\u00D9\\u0087\\u00D9\\u008A\\u00D8\\u00A3\\u00D9\\u008A\\u00D9\\u0082\\u00D8\\u00AF\\u00D9\\u0087\\u00D9\\u0084\\u00D8\\u00AB\\u00D9\\u0085\\u00D8\\u00A8\\u00D9\\u0087\\u00D9\\u0084\\u00D9\\u0088\\u00D9\\u0084\\u00D9\\u008A\\u00D8\\u00A8\\u00D9\\u0084\\u00D8\\u00A7\\u00D9\\u008A\\u00D8\\u00A8\\u00D9\\u0083\\u00D8\\u00B4\\u00D9\\u008A\\u00D8\\u00A7\\u00D9\\u0085\\u00D8\\u00A3\\u00D9\\u0085\\u00D9\\u0086\\u00D8\\u00AA\\u00D8\\u00A8\\u00D9\\u008A\\u00D9\\u0084\\u00D9\\u0086\\u00D8\\u00AD\\u00D8\\u00A8\\u00D9\\u0087\\u00D9\\u0085\\u00D9\\u0085\\u00D8\\u00B4\\u00D9\\u0088\\u00D8\\u00B4firstvideolightworldmediawhitecloseblackrightsmallbooksplacemusicfieldorderpointvalueleveltableboardhousegroupworksyearsstatetodaywaterstartstyledeathpowerphonenighterrorinputabouttermstitletoolseventlocaltimeslargewordsgamesshortspacefocusclearmodelblockguideradiosharewomenagainmoneyimagenamesyounglineslatercolorgreenfront&watchforcepricerulesbeginaftervisitissueareasbelowindextotalhourslabelprintpressbuiltlinksspeedstudytradefoundsenseundershownformsrangeaddedstillmovedtakenaboveflashfixedoftenotherviewschecklegalriveritemsquickshapehumanexistgoingmoviethirdbasicpeacestagewidthloginideaswrotepagesusersdrivestorebreaksouthvoicesitesmonthwherebuildwhichearthforumthreesportpartyClicklowerlivesclasslayerentrystoryusagesoundcourtyour birthpopuptypesapplyImagebeinguppernoteseveryshowsmeansextramatchtrackknownearlybegansuperpapernorthlearngivennamedendedTermspartsGroupbrandusingwomanfalsereadyaudiotakeswhile.com/livedcasesdailychildgreatjudgethoseunitsneverbroadcoastcoverapplefilescyclesceneplansclickwritequeenpieceemailframeolderphotolimitcachecivilscaleenterthemetheretouchboundroyalaskedwholesincestock namefaithheartemptyofferscopeownedmightalbumthinkbloodarraymajortrustcanonunioncountvalidstoneStyleLoginhappyoccurleft:freshquitefilmsgradeneedsurbanfightbasishoverauto;route.htmlmixedfinalYour slidetopicbrownalonedrawnsplitreachRightdatesmarchquotegoodsLinksdoubtasyncthumballowchiefyouthnovel10px;serveuntilhandsCheckSpacequeryjamesequaltwice0,000Startpanelsongsroundeightshiftworthpostsleadsweeksavoidthesemilesplanesmartalphaplantmarksratesplaysclaimsalestextsstarswrong

thing.org/multiheardPowerstandtokensolid(thisbringshipsstafftriedcallsfullyfactsagentThis //-->adminegyptEvent15px;Emailtrue\\\"crossspentblogsbox\\\">notedleavechinasizesguestrobotheavytrue,sevengrandcrimesignsawaredancephase>\\n\\n\\r\\nname=diegopage swiss-->\\n\\n#fff;\\\">Log.com\\\"treatsheet) && 14px;sleepntentfiledja:\\u00E3\\u0083id=\\\"cName\\\"worseshots-box-delta\\n<bears:48Z spendbakershops= \\\"\\\";php\\\">ction13px;brianhellosize=o=%2F joinmaybe, fjsimg\\\" \\\")[0]MTopBType\\\"newlyDanskczechtrailknowsfaq\\\">zh-cn10);\\n-1\\\");type=bluestrulydavis.js';>\\r\\n\\r\\nform jesus100% menu.\\r\\n\\t\\r\\nwalesrisksumentddingb-likteachgif\\\" vegasdanskeestishqipsuomisobredesdeentretodospuedea\\u00C3\\u00B1osest\\u00C3\\u00A1tienehastaotrospartedondenuevohacerformamismomejormundoaqu\\u00C3\\u00ADd\\u00C3\\u00ADass\\u00C3\\u00B3loayudafechatodastantomenosdatosotrassitiomuchoahoralugarmayorestoshorastenerantesfotosestaspa\\u00C3\\u00ADsnuevasaludforosmedioquienmesespoderchileser\\u00C3\\u00A1vecesdecirjos\\u00C3\\u00A9estarventagrupohechoellostengoamigocosasnivelgentemismaairesjuliotemashaciafavorjuniolibrepuntobuenoautorabrilbuenatextomarzosaberlistaluegoc\\u00C3\\u00B3moenerojuegoper\\u00C3\\u00BAhaberestoynuncamujervalorfueralibrogustaigualvotoscasosgu\\u00C3\\u00ADapuedosomosavisousteddebennochebuscafaltaeurosseriedichocursoclavecasasle\\u00C3\\u00B3nplazolargoobrasvistaapoyojuntotratavistocrearcampohemoscincocargopisosordenhacen\\u00C3\\u00A1readiscopedrocercapuedapapelmenor\\u00C3\\u00BAtilclarojorgecalleponertardenadiemarcasigueellassiglocochemotosmadreclaserestoni\\u00C3\\u00B1oquedapasarbancohijosviajepablo\\u00C3\\u00A9stevienereinodejarfondocanalnorteletracausatomarmanoslunesautosvillavendopesartipostengamarcollevapadreunidovamoszonasambosbandamariaabusomuchasubirriojavivirgradochicaall\\u00C3\\u00ADjovendichaestantalessalirsuelopesosfinesllamabusco\\u00C3\\u00A9stalleganegroplazahumorpagarjuntadobleislasbolsaba\\u00C3\\u00B1ohablalucha\\u00C3\\u0081readicenjugarnotasvalleall\\u00C3\\u00A1cargadolorabajoest\\u00C3\\u00A9gustomentemariofirmacostofichaplatahogarartesleyesaquelmuseobasespocosmitadcielochicomiedoganarsantoetapadebesplayaredessietecortecoreadudasdeseoviejodeseaaguas"domaincommonstatuseventsmastersystemactionbannerremovescrollupdateglobalmediumfilternumberchangeresultpublicscreenchoosenormaltravelissuessourcetargetspringmodulemobileswitchphotosborderregionitselfsocialactivecolumnrecordfollowtitle>eitherlengthfamilyfriendlayoutauthorcreatereviewsummerserverplayedplayerexpandpolicyformatdoublepointsseriespersonlivingdesignmonthsforcesuniqueweightpeopleenergynaturesearchfigurehavingcustomoffsetletterwindowsubmitrendergroupsuploadhealthmethodvideosschoolfutureshadowdebatevaluesObjectothersrightsleaguechromesimplenoticesharedendingseasonreportonlinesquarebuttonimagesenablemovinglatestwinterFranceperiodstrongrepeatLondondetailformeddemandsecurepassedtoggleplacesdevicestaticcitiesstreamyellowattackstreetflighthiddeninfo\\\">openedusefulvalleycausesleadersecretseconddamagesportsexceptratingsignedthingseffectfieldsstatesofficevisualeditorvolumeReportmuseummoviesparentaccessmostlymother\\\" id=\\\"marketgroundchancesurveybeforesymbolmomentspeechmotioninsidematterCenterobjectexistsmiddleEuropegrowthlegacymannerenoughcareeransweroriginportalclientselectrandomclosedtopicscomingfatheroptionsimplyraisedescapechosenchurchdefinereasoncorneroutputmemoryiframepolicemodelsNumberduringoffersstyleskilledlistedcalledsilvermargindeletebetterbrowselimitsGlobalsinglewidgetcenterbudgetnowrapcreditclaimsenginesafetychoicespirit-stylespreadmakingneededrussiapleaseextentScriptbrokenallowschargedividefactormember-basedtheoryconfigaroundworkedhelpedChurchimpactshouldalwayslogo\\\" bottomlist\\\">){var prefixorangeHeader.push(couplegardenbridgelaunchReviewtakingvisionlittledatingButtonbeautythemesforgotSearchanchoralmostloadedChangereturnstringreloadMobileincomesupplySourceordersviewed courseAbout island: The dialoghousesBEGIN MexicostartscentreheightaddingIslandassetsEmpireSchooleffortdirectnearlymanualSelect.\\n\\nOnejoinedmenu\\\">PhilipawardshandleimportOfficeregardskillsnationSportsdegreeweekly (e.g.behinddoctorloggedunitedbeyond-scaleacceptservedmarineFootercamera\\n_form\\\"leavesstress\\\" />\\r\\n.gif\\\" onloadloaderOxfordsistersurvivlistenfemaleDesignsize=\\\"appealtext\\\">levelsthankshigherforcedanimalanyoneAfricaagreedrecentPeople
wonderpricesturned|| {};main\\\">inlinesundaywrap\\\">failedcensusminutebeaconquotes150px|estateremoteemail\\\"linkedright;signalformal1.htmlsignupprincefloat:.png\\\" forum.AccesspaperssoundsextendHeightsliderUTF-8\\\"& Before. WithstudioownersmanageprofitjQueryannualparamsboughtfamousgooglelongeri++) {israelsayingdecidehome\\\">headerensurebranchpiecesblock;statedtop\\\">boston.test(avatartested_countforumsschemaindex,filledsharesreaderalert(appearSubmitline\\\">body\\\">\\n* TheThoughseeingjerseyNews\\nSystem DavidcancertablesprovedApril reallydriveritem\\\">more\\\">boardscolorscampusfirst || [];media.guitarfinishwidth:showedOther .php\\\" assumelayerswilsonstoresreliefswedenCustomeasily your String\\n\\nWhiltaylorclear:resortfrenchthough\\\") + \\\"buyingbrandsMembername\\\">oppingsector5px;\\\">vspacepostermajor coffeemartinmaturehappenkansaslink\\\">Images=falsewhile hspace0& \\n\\nIn powerPolski-colorjordanBottomStart -count2.htmlnews\\\">01.jpgOnline-rightmillerseniorISBN 00,000 guidesvalue)ectionrepair.xml\\\" rights.html-blockregExp:hoverwithinvirginphones\\rusing \\n\\tvar >');\\n\\t\\n\\nbahasabrasilgalegomagyarpolskisrpski\\u00D8\\u00B1\\u00D8\\u00AF\\u00D9\\u0088\\u00E4\\u00B8\\u00AD\\u00E6\\u0096\\u0087\\u00E7\\u00AE\\u0080\\u00E4\\u00BD\\u0093\\u00E7\\u00B9\\u0081\\u00E9\\u00AB\\u0094\\u00E4\\u00BF\\u00A1\\u00E6\\u0081\\u00AF\\u00E4\\u00B8\\u00AD\\u00E5\\u009B\\u00BD\\u00E6\\u0088\\u0091\\u00E4\\u00BB\\u00AC\\u00E4\\u00B8\\u0080\\u00E4\\u00B8\\u00AA\\u00E5\\u0085\\u00AC\\u00E5\\u008F\\u00B8\\u00E7\\u00AE\\u00A1\\u00E7\\u0090\\u0086\\u00E8\\u00AE\\u00BA\\u00E5\\u009D\\u009B\\u00E5\\u008F\\u00AF\\u00E4\\u00BB\\u00A5\\u00E6\\u009C\\u008D\\u00E5\\u008A\\u00A1\\u00E6\\u0097\\u00B6\\u00E9\\u0097\\u00B4\\u00E4\\u00B8\\u00AA\\u00E4\\u00BA\\u00BA\\u00E4\\u00BA\\u00A7\\u00E5\\u0093\\u0081\\u00E8\\u0087\\u00AA\\u00E5\\u00B7\\u00B1\\u00E4\\u00BC\\u0081\\u00E4\\u00B8\\u009A\\u00E6\\u009F\\u00A5\\u00E7\\u009C\\u008B\\u00E5\\u00B7\\u00A5\\u00E4\\u00BD\\u009C\\u00E8\\u0081\\u0094\\u00E7\\u00B3\\u00BB\\u00E6\\u00B2\\u00A1\\u00E6\\u009C\\u0089\\u00E7\\u00BD\\u0091\\u00E7\\u00AB\\u0099\\u00E6\\u0089\\u0080\\u00E6\\u009C\\u0089\\u00E8\\u00AF\\u0084\\u00E8\\u00AE\\u00BA\\u00E4\\u00B8\\u00AD\\u00E5\\u00BF\\u0083\\u00E6\\u0096\\u0087\\u00E7\\u00AB\\u00A0\\u00E7\\u0094\\u00A8\\u00E6\\u0088\\u00B7\\u00E9\\u00A6\\u0096\\u00E9\\u00A1\\u00B5\\u00E4\\u00BD\\u009C\\u00E8\\u0080\\u0085\\u00E6\\u008A\\u0080\\u00E6\\u009C\\u00AF\\u00E9\\u0097\\u00AE\\u00E9\\u00A2\\u0098\\u00E7\\u009B\\u00B8\\u00E5\\u0085\\u00B3\\u00E4\\u00B8\\u008B\\u00E8\\u00BD\\u00BD\\u00E6\\u0090\\u009C\\u00E7\\u00B4\\u00A2\\u00E4\\u00BD\\u00BF\\u00E7\\u0094\\u00A8\\u00E8\\u00BD\\u00AF\\u00E4\\u00BB\\u00B6\\u00E5\\u009C\\u00A8\\u00E7\\u00BA\\u00BF\\u00E4\\u00B8\\u00BB\\u00E9\\u00A2\\u0098\\u00E8\\u00B5\\u0084\\u00E6\\u0096\\u0099\\u00E8\\u00A7\\u0086\\u00E9\\u00A2\\u0091\\u00E5\\u009B\\u009E\\u00E5\\u00A4\\u008D\\u00E6\\u00B3\\u00A8\\u00E5\\u0086\\u008C\\u00E7\\u00BD\\u0091\\u00E7\\u00BB\\u009C\\u00E6\\u0094\\u00B6\\u00E8\\u0097\\u008F\\u00E5\\u0086\\u0085\\u00E5\\u00AE\\u00B9\\u00E6\\u008E\\u00A8\\u00E8\\u008D\\u0090\\u00E5\\u00B8\\u0082\\u00E5\\u009C\\u00BA\\u00E6\\u00B6\\u0088\\u00E6\\u0081\\u00AF\\u00E7\\u00A9\\u00BA\\u00E9\\u0097\\u00B4\\u00E5\\u008F\\u0091\\u00E5\\u00B8\\u0083\\u00E4\\u00BB\\u0080\\u00E4\\u00B9\\u0088\\u00E5\\u00A5\\u00BD\\u00E5\\u008F\\u008B\\u00E7\\u0094\\u009F\\u00E6\\u00B4\\u00BB\\u00E5\\u009B\\u00BE\\u00E7\\u0089\\u0087\\u00E5\\u008F\\u0091\\u00E5\\u00B1\\u0095\\u00E5\\u00A6\\u0082\\u00E6\\u009E\\u009C\\u00E6\\u0089\\u008B\\u00E6\\u009C\\u00BA\\u00E6\\u0096\\u00B0\\u00E9\\u0097\\u00BB\\u00E6\\u009C\\u0080\\u00E6\\u0096\\u00B0\\u00E6\\u0096\\u00B9\\u00E5\\u00BC\\u008F\\u00E5\\u008C\\u0097\\u00E4\\u00BA\\u00AC\\u00E6\\u008F\\u0090\\u00E4\\u00BE\\u009B\\u00E5\\u0085\\u00B3\\u00E4\\u00BA\\u008E\\u00E6\\u009B\\u00B4\\u00E5\\u00A4\\u009A\\u00E8\\u00BF\\u0099\\u00E4\\u00B8\\u00AA\\u00E7\\u00B3\\u00BB\\u00E7\\u00BB\\u009F\\u00E7\\u009F\\u00A5\\u00E9\\u0081\\u0093\\u00E6\\u00B8\\u00B8\\u00E6\\u0088\\u008F\\u00E5\\u00B9\\u00BF\\u00E5\\u0091\\u008A\\u00E5\\u0085\\u00B6\\u00E4\\u00BB\\u0096\\u00E5\\u008F\\u0091\\u00E8\\u00A1\\u00A8\\u00E5\\u00AE\\u0089\\u00E5\\u0085\\u00A8\\u00E7\\u00AC\\u00AC\\u00E4\\u00B8\\u0080\\u00E4\\u00BC\\u009A\\u00E5\\u0091\\u0098\\u00E8\\u00BF\\u009B\\u00E8\\u00A1\\u008C\\u00E7\\u0082\\u00B9\\u00E5\\u0087\\u00BB\\u00E7\\u0089\\u0088\\u00E6\\u009D\\u0083\\u00E7\\u0094\\u00B5\\u00E5\\u00AD\\u0090\\u00E4\\u00B8\\u0096\\u00E7\\u0095\\u008C\\u00E8\\u00AE\\u00BE\\u00E8\\u00AE\\u00A1\\u00E5\\u0085\\u008D\\u00E8\\u00B4\\u00B9\\u00E6\\u0095\\u0099\\u00E8\\u0082\\u00B2\\u00E5\\u008A\\u00A0\\u00E5\\u0085\\u00A5\\u00E6\\u00B4\\u00BB\\u00E5\\u008A\\u00A8\\u00E4\\u00BB\\u0096\\u00E4\\u00BB\\u00AC\\u00E5\\u0095\\u0086\\u00E5\\u0093\\u0081\\u00E5\\u008D\\u009A\\u00E5\\u00AE\\u00A2\\u00E7\\u008E\\u00B0\\u00E5\\u009C\\u00A8\\u00E4\\u00B8\\u008A\\u00E6\\u00B5\\u00B7\\u00E5\\u00A6\\u0082\\u00E4\\u00BD\\u0095\\u00E5\\u00B7\\u00B2\\u00E7\\u00BB\\u008F\\u00E7\\u0095\\u0099\\u00E8\\u00A8\\u0080\\u00E8\\u00AF\\u00A6\\u00E7\\u00BB\\u0086\\u00E7\\u00A4\\u00BE\\u00E5\\u008C\\u00BA\\u00E7\\u0099\\u00BB\\u00E5\\u00BD\\u0095\\u00E6\\u009C\\u00AC\\u00E7\\u00AB\\u0099\\u00E9\\u009C\\u0080\\u00E8\\u00A6\\u0081\\u00E4\\u00BB\\u00B7\\u00E6\\u00A0\\u00BC\\u00E6\\u0094\\u00AF\\u00E6\\u008C\\u0081\\u00E5\\u009B\\u00BD\\u00E9\\u0099\\u0085\\u00E9\\u0093\\u00BE\\u00E6\\u008E\\u00A5\\u00E5\\u009B\\u00BD\\u00E5\\u00AE\\u00B6\\u00E5\\u00BB\\u00BA\\u00E8\\u00AE\\u00BE\\u00E6\\u009C\\u008B\\u00E5\\u008F\\u008B\\u00E9\\u0098\\u0085\\u00E8\\u00AF\\u00BB\\u00E6\\u00B3\\u0095\\u00E5\\u00BE\\u008B\\u00E4\\u00BD\\u008D\\u00E7\\u00BD\\u00AE\\u00E7\\u00BB\\u008F\\u00E6\\u00B5\\u008E\\u00E9\\u0080\\u0089\\u00E6\\u008B\\u00A9\\u00E8\\u00BF\\u0099\\u00E6\\u00A0\\u00B7\\u00E5\\u00BD\\u0093\\u00E5\\u0089\\u008D\\u00E5\\u0088\\u0086\\u00E7\\u00B1\\u00BB\\u00E6\\u008E\\u0092\\u00E8\\u00A1\\u008C\\u00E5\\u009B\\u00A0\\u00E4\\u00B8\\u00BA\\u00E4\\u00BA\\u00A4\\u00E6\\u0098\\u0093\\u00E6\\u009C\\u0080\\u00E5\\u0090\\u008E\\u00E9\\u009F\\u00B3\\u00E4\\u00B9\\u0090\\u00E4\\u00B8\\u008D\\u00E8\\u0083\\u00BD\\u00E9\\u0080\\u009A\\u00E8\\u00BF\\u0087\\u00E8\\u00A1\\u008C\\u00E4\\u00B8\\u009A\\u00E7\\u00A7\\u0091\\u00E6\\u008A\\u0080\\u00E5\\u008F\\u00AF\\u00E8\\u0083\\u00BD\\u00E8\\u00AE\\u00BE\\u00E5\\u00A4\\u0087\\u00E5\\u0090\\u0088\\u00E4\\u00BD\\u009C\\u00E5\\u00A4\\u00A7\\u00E5\\u00AE\\u00B6\\u00E7\\u00A4\\u00BE\\u00E4\\u00BC\\u009A\\u00E7\\u00A0\\u0094\\u00E7\\u00A9\\u00B6\\u00E4\\u00B8\\u0093\\u00E4\\u00B8\\u009A\\u00E5\\u0085\\u00A8\\u00E9\\u0083\\u00A8\\u00E9\\u00A1\\u00B9\\u00E7\\u009B\\u00AE\\u00E8\\u00BF\\u0099\\u00E9\\u0087\\u008C\\u00E8\\u00BF\\u0098\\u00E6\\u0098\\u00AF\\u00E5\\u00BC\\u0080\\u00E5\\u00A7\\u008B\\u00E6\\u0083\\u0085\\u00E5\\u0086\\u00B5\\u00E7\\u0094\\u00B5\\u00E8\\u0084\\u0091\\u00E6\\u0096\\u0087\\u00E4\\u00BB\\u00B6\\u00E5\\u0093\\u0081\\u00E7\\u0089\\u008C\\u00E5\\u00B8\\u00AE\\u00E5\\u008A\\u00A9\\u00E6\\u0096\\u0087\\u00E5\\u008C\\u0096\\u00E8\\u00B5\\u0084\\u00E6\\u00BA\\u0090\\u00E5\\u00A4\\u00A7\\u00E5\\u00AD\\u00A6\\u00E5\\u00AD\\u00A6\\u00E4\\u00B9\\u00A0\\u00E5\\u009C\\u00B0\\u00E5\\u009D\\u0080\\u00E6\\u00B5\\u008F\\u00E8\\u00A7\\u0088\\u00E6\\u008A\\u0095\\u00E8\\u00B5\\u0084\\u00E5\\u00B7\\u00A5\\u00E7\\u00A8\\u008B\\u00E8\\u00A6\\u0081\\u00E6\\u00B1\\u0082\\u00E6\\u0080\\u008E\\u00E4\\u00B9\\u0088\\u00E6\\u0097\\u00B6\\u00E5\\u0080\\u0099\\u00E5\\u008A\\u009F\\u00E8\\u0083\\u00BD\\u00E4\\u00B8\\u00BB\\u00E8\\u00A6\\u0081\\u00E7\\u009B\\u00AE\\u00E5\\u0089\\u008D\\u00E8\\u00B5\\u0084\\u00E8\\u00AE\\u00AF\\u00E5\\u009F\\u008E\\u00E5\\u00B8\\u0082\\u00E6\\u0096\\u00B9\\u00E6\\u00B3\\u0095\\u00E7\\u0094\\u00B5\\u00E5\\u00BD\\u00B1\\u00E6\\u008B\\u009B\\u00E8\\u0081\\u0098\\u00E5\\u00A3\\u00B0\\u00E6\\u0098\\u008E\\u00E4\\u00BB\\u00BB\\u00E4\\u00BD\\u0095\\u00E5\\u0081\\u00A5\\u00E5\\u00BA\\u00B7\\u00E6\\u0095\\u00B0\\u00E6\\u008D\\u00AE\\u00E7\\u00BE\\u008E\\u00E5\\u009B\\u00BD\\u00E6\\u00B1\\u00BD\\u00E8\\u00BD\\u00A6\\u00E4\\u00BB\\u008B\\u00E7\\u00BB\\u008D\\u00E4\\u00BD\\u0086\\u00E6\\u0098\\u00AF\\u00E4\\u00BA\\u00A4\\u00E6\\u00B5\\u0081\\u00E7\\u0094\\u009F\\u00E4\\u00BA\\u00A7\\u00E6\\u0089\\u0080\\u00E4\\u00BB\\u00A5\\u00E7\\u0094\\u00B5\\u00E8\\u00AF\\u009D\\u00E6\\u0098\\u00BE\\u00E7\\u00A4\\u00BA\\u00E4\\u00B8\\u0080\\u00E4\\u00BA\\u009B\\u00E5\\u008D\\u0095\\u00E4\\u00BD\\u008D\\u00E4\\u00BA\\u00BA\\u00E5\\u0091\\u0098\\u00E5\\u0088\\u0086\\u00E6\\u009E\\u0090\\u00E5\\u009C\\u00B0\\u00E5\\u009B\\u00BE\\u00E6\\u0097\\u0085\\u00E6\\u00B8\\u00B8\\u00E5\\u00B7\\u00A5\\u00E5\\u0085\\u00B7\\u00E5\\u00AD\\u00A6\\u00E7\\u0094\\u009F\\u00E7\\u00B3\\u00BB\\u00E5\\u0088\\u0097\\u00E7\\u00BD\\u0091\\u00E5\\u008F\\u008B\\u00E5\\u00B8\\u0096\\u00E5\\u00AD\\u0090\\u00E5\\u00AF\\u0086\\u00E7\\u00A0\\u0081\\u00E9\\u00A2\\u0091\\u00E9\\u0081\\u0093\\u00E6\\u008E\\u00A7\\u00E5\\u0088\\u00B6\\u00E5\\u009C\\u00B0\\u00E5\\u008C\\u00BA\\u00E5\\u009F\\u00BA\\u00E6\\u009C\\u00AC\\u00E5\\u0085\\u00A8\\u00E5\\u009B\\u00BD\\u00E7\\u00BD\\u0091\\u00E4\\u00B8\\u008A\\u00E9\\u0087\\u008D\\u00E8\\u00A6\\u0081\\u00E7\\u00AC\\u00AC\\u00E4\\u00BA\\u008C\\u00E5\\u0096\\u009C\\u00E6\\u00AC\\u00A2\\u00E8\\u00BF\\u009B\\u00E5\\u0085\\u00A5\\u00E5\\u008F\\u008B\\u00E6\\u0083\\u0085\\u00E8\\u00BF\\u0099\\u00E4\\u00BA\\u009B\\u00E8\\u0080\\u0083\\u00E8\\u00AF\\u0095\\u00E5\\u008F\\u0091\\u00E7\\u008E\\u00B0\\u00E5\\u009F\\u00B9\\u00E8\\u00AE\\u00AD\\u00E4\\u00BB\\u00A5\\u00E4\\u00B8\\u008A\\u00E6\\u0094\\u00BF\\u00E5\\u00BA\\u009C\\u00E6\\u0088\\u0090\\u00E4\\u00B8\\u00BA\\u00E7\\u008E\\u00AF\\u00E5\\u00A2\\u0083\\u00E9\\u00A6\\u0099\\u00E6\\u00B8\\u00AF\\u00E5\\u0090\\u008C\\u00E6\\u0097\\u00B6\\u00E5\\u00A8\\u00B1\\u00E4\\u00B9\\u0090\\u00E5\\u008F\\u0091\\u00E9\\u0080\\u0081\\u00E4\\u00B8\\u0080\\u00E5\\u00AE\\u009A\\u00E5\\u00BC\\u0080\\u00E5\\u008F\\u0091\\u00E4\\u00BD\\u009C\\u00E5\\u0093\\u0081\\u00E6\\u00A0\\u0087\\u00E5\\u0087\\u0086\\u00E6\\u00AC\\u00A2\\u00E8\\u00BF\\u008E\\u00E8\\u00A7\\u00A3\\u00E5\\u0086\\u00B3\\u00E5\\u009C\\u00B0\\u00E6\\u0096\\u00B9\\u00E4\\u00B8\\u0080\\u00E4\\u00B8\\u008B\\u00E4\\u00BB\\u00A5\\u00E5\\u008F\\u008A\\u00E8\\u00B4\\u00A3\\u00E4\\u00BB\\u00BB\\u00E6\\u0088\\u0096\\u00E8\\u0080\\u0085\\u00E5\\u00AE\\u00A2\\u00E6\\u0088\\u00B7\\u00E4\\u00BB\\u00A3\\u00E8\\u00A1\\u00A8\\u00E7\\u00A7\\u00AF\\u00E5\\u0088\\u0086\\u00E5\\u00A5\\u00B3\\u00E4\\u00BA\\u00BA\\u00E6\\u0095\\u00B0\\u00E7\\u00A0\\u0081\\u00E9\\u0094\\u0080\\u00E5\\u0094\\u00AE\\u00E5\\u0087\\u00BA\\u00E7\\u008E\\u00B0\\u00E7\\u00A6\\u00BB\\u00E7\\u00BA\\u00BF\\u00E5\\u00BA\\u0094\\u00E7\\u0094\\u00A8\\u00E5\\u0088\\u0097\\u00E8\\u00A1\\u00A8\\u00E4\\u00B8\\u008D\\u00E5\\u0090\\u008C\\u00E7\\u00BC\\u0096\\u00E8\\u00BE\\u0091\\u00E7\\u00BB\\u009F\\u00E8\\u00AE\\u00A1\\u00E6\\u009F\\u00A5\\u00E8\\u00AF\\u00A2\\u00E4\\u00B8\\u008D\\u00E8\\u00A6\\u0081\\u00E6\\u009C\\u0089\\u00E5\\u0085\\u00B3\\u00E6\\u009C\\u00BA\\u00E6\\u009E\\u0084\\u00E5\\u00BE\\u0088\\u00E5\\u00A4\\u009A\\u00E6\\u0092\\u00AD\\u00E6\\u0094\\u00BE\\u00E7\\u00BB\\u0084\\u00E7\\u00BB\\u0087\\u00E6\\u0094\\u00BF\\u00E7\\u00AD\\u0096\\u00E7\\u009B\\u00B4\\u00E6\\u008E\\u00A5\\u00E8\\u0083\\u00BD\\u00E5\\u008A\\u009B\\u00E6\\u009D\\u00A5\\u00E6\\u00BA\\u0090\\u00E6\\u0099\\u0082\\u00E9\\u0096\\u0093\\u00E7\\u009C\\u008B\\u00E5\\u0088\\u00B0\\u00E7\\u0083\\u00AD\\u00E9\\u0097\\u00A8\\u00E5\\u0085\\u00B3\\u00E9\\u0094\\u00AE\\u00E4\\u00B8\\u0093\\u00E5\\u008C\\u00BA\\u00E9\\u009D\\u009E\\u00E5\\u00B8\\u00B8\\u00E8\\u008B\\u00B1\\u00E8\\u00AF\\u00AD\\u00E7\\u0099\\u00BE\\u00E5\\u00BA\\u00A6\\u00E5\\u00B8\\u008C\\u00E6\\u009C\\u009B\\u00E7\\u00BE\\u008E\\u00E5\\u00A5\\u00B3\\u00E6\\u00AF\\u0094\\u00E8\\u00BE\\u0083\\u00E7\\u009F\\u00A5\\u00E8\\u00AF\\u0086\\u00E8\\u00A7\\u0084\\u00E5\\u00AE\\u009A\\u00E5\\u00BB\\u00BA\\u00E8\\u00AE\\u00AE\\u00E9\\u0083\\u00A8\\u00E9\\u0097\\u00A8\\u00E6\\u0084\\u008F\\u00E8\\u00A7\\u0081\\u00E7\\u00B2\\u00BE\\u00E5\\u00BD\\u00A9\\u00E6\\u0097\\u00A5\\u00E6\\u009C\\u00AC\\u00E6\\u008F\\u0090\\u00E9\\u00AB\\u0098\\u00E5\\u008F\\u0091\\u00E8\\u00A8\\u0080\\u00E6\\u0096\\u00B9\\u00E9\\u009D\\u00A2\\u00E5\\u009F\\u00BA\\u00E9\\u0087\\u0091\\u00E5\\u00A4\\u0084\\u00E7\\u0090\\u0086\\u00E6\\u009D\\u0083\\u00E9\\u0099\\u0090\\u00E5\\u00BD\\u00B1\\u00E7\\u0089\\u0087\\u00E9\\u0093\\u00B6\\u00E8\\u00A1\\u008C\\u00E8\\u00BF\\u0098\\u00E6\\u009C\\u0089\\u00E5\\u0088\\u0086\\u00E4\\u00BA\\u00AB\\u00E7\\u0089\\u00A9\\u00E5\\u0093\\u0081\\u00E7\\u00BB\\u008F\\u00E8\\u0090\\u00A5\\u00E6\\u00B7\\u00BB\\u00E5\\u008A\\u00A0\\u00E4\\u00B8\\u0093\\u00E5\\u00AE\\u00B6\\u00E8\\u00BF\\u0099\\u00E7\\u00A7\\u008D\\u00E8\\u00AF\\u009D\\u00E9\\u00A2\\u0098\\u00E8\\u00B5\\u00B7\\u00E6\\u009D\\u00A5\\u00E4\\u00B8\\u009A\\u00E5\\u008A\\u00A1\\u00E5\\u0085\\u00AC\\u00E5\\u0091\\u008A\\u00E8\\u00AE\\u00B0\\u00E5\\u00BD\\u0095\\u00E7\\u00AE\\u0080\\u00E4\\u00BB\\u008B\\u00E8\\u00B4\\u00A8\\u00E9\\u0087\\u008F\\u00E7\\u0094\\u00B7\\u00E4\\u00BA\\u00BA\\u00E5\\u00BD\\u00B1\\u00E5\\u0093\\u008D\\u00E5\\u00BC\\u0095\\u00E7\\u0094\\u00A8\\u00E6\\u008A\\u00A5\\u00E5\\u0091\\u008A\\u00E9\\u0083\\u00A8\\u00E5\\u0088\\u0086\\u00E5\\u00BF\\u00AB\\u00E9\\u0080\\u009F\\u00E5\\u0092\\u00A8\\u00E8\\u00AF\\u00A2\\u00E6\\u0097\\u00B6\\u00E5\\u00B0\\u009A\\u00E6\\u00B3\\u00A8\\u00E6\\u0084\\u008F\\u00E7\\u0094\\u00B3\\u00E8\\u00AF\\u00B7\\u00E5\\u00AD\\u00A6\\u00E6\\u00A0\\u00A1\\u00E5\\u00BA\\u0094\\u00E8\\u00AF\\u00A5\\u00E5\\u008E\\u0086\\u00E5\\u008F\\u00B2\\u00E5\\u008F\\u00AA\\u00E6\\u0098\\u00AF\\u00E8\\u00BF\\u0094\\u00E5\\u009B\\u009E\\u00E8\\u00B4\\u00AD\\u00E4\\u00B9\\u00B0\\u00E5\\u0090\\u008D\\u00E7\\u00A7\\u00B0\\u00E4\\u00B8\\u00BA\\u00E4\\u00BA\\u0086\\u00E6\\u0088\\u0090\\u00E5\\u008A\\u009F\\u00E8\\u00AF\\u00B4\\u00E6\\u0098\\u008E\\u00E4\\u00BE\\u009B\\u00E5\\u00BA\\u0094\\u00E5\\u00AD\\u00A9\\u00E5\\u00AD\\u0090\\u00E4\\u00B8\\u0093\\u00E9\\u00A2\\u0098\\u00E7\\u00A8\\u008B\\u00E5\\u00BA\\u008F\\u00E4\\u00B8\\u0080\\u00E8\\u0088\\u00AC\\u00E6\\u009C\\u0083\\u00E5\\u0093\\u00A1\\u00E5\\u008F\\u00AA\\u00E6\\u009C\\u0089\\u00E5\\u0085\\u00B6\\u00E5\\u00AE\\u0083\\u00E4\\u00BF\\u009D\\u00E6\\u008A\\u00A4\\u00E8\\u0080\\u008C\\u00E4\\u00B8\\u0094\\u00E4\\u00BB\\u008A\\u00E5\\u00A4\\u00A9\\u00E7\\u00AA\\u0097\\u00E5\\u008F\\u00A3\\u00E5\\u008A\\u00A8\\u00E6\\u0080\\u0081\\u00E7\\u008A\\u00B6\\u00E6\\u0080\\u0081\\u00E7\\u0089\\u00B9\\u00E5\\u0088\\u00AB\\u00E8\\u00AE\\u00A4\\u00E4\\u00B8\\u00BA\\u00E5\\u00BF\\u0085\\u00E9\\u00A1\\u00BB\\u00E6\\u009B\\u00B4\\u00E6\\u0096\\u00B0\\u00E5\\u00B0\\u008F\\u00E8\\u00AF\\u00B4\\u00E6\\u0088\\u0091\\u00E5\\u0080\\u0091\\u00E4\\u00BD\\u009C\\u00E4\\u00B8\\u00BA\\u00E5\\u00AA\\u0092\\u00E4\\u00BD\\u0093\\u00E5\\u008C\\u0085\\u00E6\\u008B\\u00AC\\u00E9\\u0082\\u00A3\\u00E4\\u00B9\\u0088\\u00E4\\u00B8\\u0080\\u00E6\\u00A0\\u00B7\\u00E5\\u009B\\u00BD\\u00E5\\u0086\\u0085\\u00E6\\u0098\\u00AF\\u00E5\\u0090\\u00A6\\u00E6\\u00A0\\u00B9\\u00E6\\u008D\\u00AE\\u00E7\\u0094\\u00B5\\u00E8\\u00A7\\u0086\\u00E5\\u00AD\\u00A6\\u00E9\\u0099\\u00A2\\u00E5\\u0085\\u00B7\\u00E6\\u009C\\u0089\\u00E8\\u00BF\\u0087\\u00E7\\u00A8\\u008B\\u00E7\\u0094\\u00B1\\u00E4\\u00BA\\u008E\\u00E4\\u00BA\\u00BA\\u00E6\\u0089\\u008D\\u00E5\\u0087\\u00BA\\u00E6\\u009D\\u00A5\\u00E4\\u00B8\\u008D\\u00E8\\u00BF\\u0087\\u00E6\\u00AD\\u00A3\\u00E5\\u009C\\u00A8\\u00E6\\u0098\\u008E\\u00E6\\u0098\\u009F\\u00E6\\u0095\\u0085\\u00E4\\u00BA\\u008B\\u00E5\\u0085\\u00B3\\u00E7\\u00B3\\u00BB\\u00E6\\u00A0\\u0087\\u00E9\\u00A2\\u0098\\u00E5\\u0095\\u0086\\u00E5\\u008A\\u00A1\\u00E8\\u00BE\\u0093\\u00E5\\u0085\\u00A5\\u00E4\\u00B8\\u0080\\u00E7\\u009B\\u00B4\\u00E5\\u009F\\u00BA\\u00E7\\u00A1\\u0080\\u00E6\\u0095\\u0099\\u00E5\\u00AD\\u00A6\\u00E4\\u00BA\\u0086\\u00E8\\u00A7\\u00A3\\u00E5\\u00BB\\u00BA\\u00E7\\u00AD\\u0091\\u00E7\\u00BB\\u0093\\u00E6\\u009E\\u009C\\u00E5\\u0085\\u00A8\\u00E7\\u0090\\u0083\\u00E9\\u0080\\u009A\\u00E7\\u009F\\u00A5\\u00E8\\u00AE\\u00A1\\u00E5\\u0088\\u0092\\u00E5\\u00AF\\u00B9\\u00E4\\u00BA\\u008E\\u00E8\\u0089\\u00BA\\u00E6\\u009C\\u00AF\\u00E7\\u009B\\u00B8\\u00E5\\u0086\\u008C\\u00E5\\u008F\\u0091\\u00E7\\u0094\\u009F\\u00E7\\u009C\\u009F\\u00E7\\u009A\\u0084\\u00E5\\u00BB\\u00BA\\u00E7\\u00AB\\u008B\\u00E7\\u00AD\\u0089\\u00E7\\u00BA\\u00A7\\u00E7\\u00B1\\u00BB\\u00E5\\u009E\\u008B\\u00E7\\u00BB\\u008F\\u00E9\\u00AA\\u008C\\u00E5\\u00AE\\u009E\\u00E7\\u008E\\u00B0\\u00E5\\u0088\\u00B6\\u00E4\\u00BD\\u009C\\u00E6\\u009D\\u00A5\\u00E8\\u0087\\u00AA\\u00E6\\u00A0\\u0087\\u00E7\\u00AD\\u00BE\\u00E4\\u00BB\\u00A5\\u00E4\\u00B8\\u008B\\u00E5\\u008E\\u009F\\u00E5\\u0088\\u009B\\u00E6\\u0097\\u00A0\\u00E6\\u00B3\\u0095\\u00E5\\u0085\\u00B6\\u00E4\\u00B8\\u00AD\\u00E5\\u0080\\u008B\\u00E4\\u00BA\\u00BA\\u00E4\\u00B8\\u0080\\u00E5\\u0088\\u0087\\u00E6\\u008C\\u0087\\u00E5\\u008D\\u0097\\u00E5\\u0085\\u00B3\\u00E9\\u0097\\u00AD\\u00E9\\u009B\\u0086\\u00E5\\u009B\\u00A2\\u00E7\\u00AC\\u00AC\\u00E4\\u00B8\\u0089\\u00E5\\u0085\\u00B3\\u00E6\\u00B3\\u00A8\\u00E5\\u009B\\u00A0\\u00E6\\u00AD\\u00A4\\u00E7\\u0085\\u00A7\\u00E7\\u0089\\u0087\\u00E6\\u00B7\\u00B1\\u00E5\\u009C\\u00B3\\u00E5\\u0095\\u0086\\u00E4\\u00B8\\u009A\\u00E5\\u00B9\\u00BF\\u00E5\\u00B7\\u009E\\u00E6\\u0097\\u00A5\\u00E6\\u009C\\u009F\\u00E9\\u00AB\\u0098\\u00E7\\u00BA\\u00A7\\u00E6\\u009C\\u0080\\u00E8\\u00BF\\u0091\\u00E7\\u00BB\\u00BC\\u00E5\\u0090\\u0088\\u00E8\\u00A1\\u00A8\\u00E7\\u00A4\\u00BA\\u00E4\\u00B8\\u0093\\u00E8\\u00BE\\u0091\\u00E8\\u00A1\\u008C\\u00E4\\u00B8\\u00BA\\u00E4\\u00BA\\u00A4\\u00E9\\u0080\\u009A\\u00E8\\u00AF\\u0084\\u00E4\\u00BB\\u00B7\\u00E8\\u00A7\\u0089\\u00E5\\u00BE\\u0097\\u00E7\\u00B2\\u00BE\\u00E5\\u008D\\u008E\\u00E5\\u00AE\\u00B6\\u00E5\\u00BA\\u00AD\\u00E5\\u00AE\\u008C\\u00E6\\u0088\\u0090\\u00E6\\u0084\\u009F\\u00E8\\u00A7\\u0089\\u00E5\\u00AE\\u0089\\u00E8\\u00A3\\u0085\\u00E5\\u00BE\\u0097\\u00E5\\u0088\\u00B0\\u00E9\\u0082\\u00AE\\u00E4\\u00BB\\u00B6\\u00E5\\u0088\\u00B6\\u00E5\\u00BA\\u00A6\\u00E9\\u00A3\\u009F\\u00E5\\u0093\\u0081\\u00E8\\u0099\\u00BD\\u00E7\\u0084\\u00B6\\u00E8\\u00BD\\u00AC\\u00E8\\u00BD\\u00BD\\u00E6\\u008A\\u00A5\\u00E4\\u00BB\\u00B7\\u00E8\\u00AE\\u00B0\\u00E8\\u0080\\u0085\\u00E6\\u0096\\u00B9\\u00E6\\u00A1\\u0088\\u00E8\\u00A1\\u008C\\u00E6\\u0094\\u00BF\\u00E4\\u00BA\\u00BA\\u00E6\\u00B0\\u0091\\u00E7\\u0094\\u00A8\\u00E5\\u0093\\u0081\\u00E4\\u00B8\\u009C\\u00E8\\u00A5\\u00BF\\u00E6\\u008F\\u0090\\u00E5\\u0087\\u00BA\\u00E9\\u0085\\u0092\\u00E5\\u00BA\\u0097\\u00E7\\u0084\\u00B6\\u00E5\\u0090\\u008E\\u00E4\\u00BB\\u0098\\u00E6\\u00AC\\u00BE\\u00E7\\u0083\\u00AD\\u00E7\\u0082\\u00B9\\u00E4\\u00BB\\u00A5\\u00E5\\u0089\\u008D\\u00E5\\u00AE\\u008C\\u00E5\\u0085\\u00A8\\u00E5\\u008F\\u0091\\u00E5\\u00B8\\u0096\\u00E8\\u00AE\\u00BE\\u00E7\\u00BD\\u00AE\\u00E9\\u00A2\\u0086\\u00E5\\u00AF\\u00BC\\u00E5\\u00B7\\u00A5\\u00E4\\u00B8\\u009A\\u00E5\\u008C\\u00BB\\u00E9\\u0099\\u00A2\\u00E7\\u009C\\u008B\\u00E7\\u009C\\u008B\\u00E7\\u00BB\\u008F\\u00E5\\u0085\\u00B8\\u00E5\\u008E\\u009F\\u00E5\\u009B\\u00A0\\u00E5\\u00B9\\u00B3\\u00E5\\u008F\\u00B0\\u00E5\\u0090\\u0084\\u00E7\\u00A7\\u008D\\u00E5\\u00A2\\u009E\\u00E5\\u008A\\u00A0\\u00E6\\u009D\\u0090\\u00E6\\u0096\\u0099\\u00E6\\u0096\\u00B0\\u00E5\\u00A2\\u009E\\u00E4\\u00B9\\u008B\\u00E5\\u0090\\u008E\\u00E8\\u0081\\u008C\\u00E4\\u00B8\\u009A\\u00E6\\u0095\\u0088\\u00E6\\u009E\\u009C\\u00E4\\u00BB\\u008A\\u00E5\\u00B9\\u00B4\\u00E8\\u00AE\\u00BA\\u00E6\\u0096\\u0087\\u00E6\\u0088\\u0091\\u00E5\\u009B\\u00BD\\u00E5\\u0091\\u008A\\u00E8\\u00AF\\u0089\\u00E7\\u0089\\u0088\\u00E4\\u00B8\\u00BB\\u00E4\\u00BF\\u00AE\\u00E6\\u0094\\u00B9\\u00E5\\u008F\\u0082\\u00E4\\u00B8\\u008E\\u00E6\\u0089\\u0093\\u00E5\\u008D\\u00B0\\u00E5\\u00BF\\u00AB\\u00E4\\u00B9\\u0090\\u00E6\\u009C\\u00BA\\u00E6\\u00A2\\u00B0\\u00E8\\u00A7\\u0082\\u00E7\\u0082\\u00B9\\u00E5\\u00AD\\u0098\\u00E5\\u009C\\u00A8\\u00E7\\u00B2\\u00BE\\u00E7\\u00A5\\u009E\\u00E8\\u008E\\u00B7\\u00E5\\u00BE\\u0097\\u00E5\\u0088\\u00A9\\u00E7\\u0094\\u00A8\\u00E7\\u00BB\\u00A7\\u00E7\\u00BB\\u00AD\\u00E4\\u00BD\\u00A0\\u00E4\\u00BB\\u00AC\\u00E8\\u00BF\\u0099\\u00E4\\u00B9\\u0088\\u00E6\\u00A8\\u00A1\\u00E5\\u00BC\\u008F\\u00E8\\u00AF\\u00AD\\u00E8\\u00A8\\u0080\\u00E8\\u0083\\u00BD\\u00E5\\u00A4\\u009F\\u00E9\\u009B\\u0085\\u00E8\\u0099\\u008E\\u00E6\\u0093\\u008D\\u00E4\\u00BD\\u009C\\u00E9\\u00A3\\u008E\\u00E6\\u00A0\\u00BC\\u00E4\\u00B8\\u0080\\u00E8\\u00B5\\u00B7\\u00E7\\u00A7\\u0091\\u00E5\\u00AD\\u00A6\\u00E4\\u00BD\\u0093\\u00E8\\u0082\\u00B2\\u00E7\\u009F\\u00AD\\u00E4\\u00BF\\u00A1\\u00E6\\u009D\\u00A1\\u00E4\\u00BB\\u00B6\\u00E6\\u00B2\\u00BB\\u00E7\\u0096\\u0097\\u00E8\\u00BF\\u0090\\u00E5\\u008A\\u00A8\\u00E4\\u00BA\\u00A7\\u00E4\\u00B8\\u009A\\u00E4\\u00BC\\u009A\\u00E8\\u00AE\\u00AE\\u00E5\\u00AF\\u00BC\\u00E8\\u0088\\u00AA\\u00E5\\u0085\\u0088\\u00E7\\u0094\\u009F\\u00E8\\u0081\\u0094\\u00E7\\u009B\\u009F\\u00E5\\u008F\\u00AF\\u00E6\\u0098\\u00AF\\u00E5\\u0095\\u008F\\u00E9\\u00A1\\u008C\\u00E7\\u00BB\\u0093\\u00E6\\u009E\\u0084\\u00E4\\u00BD\\u009C\\u00E7\\u0094\\u00A8\\u00E8\\u00B0\\u0083\\u00E6\\u009F\\u00A5\\u00E8\\u00B3\\u0087\\u00E6\\u0096\\u0099\\u00E8\\u0087\\u00AA\\u00E5\\u008A\\u00A8\\u00E8\\u00B4\\u009F\\u00E8\\u00B4\\u00A3\\u00E5\\u0086\\u009C\\u00E4\\u00B8\\u009A\\u00E8\\u00AE\\u00BF\\u00E9\\u0097\\u00AE\\u00E5\\u00AE\\u009E\\u00E6\\u0096\\u00BD\\u00E6\\u008E\\u00A5\\u00E5\\u008F\\u0097\\u00E8\\u00AE\\u00A8\\u00E8\\u00AE\\u00BA\\u00E9\\u0082\\u00A3\\u00E4\\u00B8\\u00AA\\u00E5\\u008F\\u008D\\u00E9\\u00A6\\u0088\\u00E5\\u008A\\u00A0\\u00E5\\u00BC\\u00BA\\u00E5\\u00A5\\u00B3\\u00E6\\u0080\\u00A7\\u00E8\\u008C\\u0083\\u00E5\\u009B\\u00B4\\u00E6\\u009C\\u008D\\u00E5\\u008B\\u0099\\u00E4\\u00BC\\u0091\\u00E9\\u0097\\u00B2\\u00E4\\u00BB\\u008A\\u00E6\\u0097\\u00A5\\u00E5\\u00AE\\u00A2\\u00E6\\u009C\\u008D\\u00E8\\u00A7\\u0080\\u00E7\\u009C\\u008B\\u00E5\\u008F\\u0082\\u00E5\\u008A\\u00A0\\u00E7\\u009A\\u0084\\u00E8\\u00AF\\u009D\\u00E4\\u00B8\\u0080\\u00E7\\u0082\\u00B9\\u00E4\\u00BF\\u009D\\u00E8\\u00AF\\u0081\\u00E5\\u009B\\u00BE\\u00E4\\u00B9\\u00A6\\u00E6\\u009C\\u0089\\u00E6\\u0095\\u0088\\u00E6\\u00B5\\u008B\\u00E8\\u00AF\\u0095\\u00E7\\u00A7\\u00BB\\u00E5\\u008A\\u00A8\\u00E6\\u0089\\u008D\\u00E8\\u0083\\u00BD\\u00E5\\u0086\\u00B3\\u00E5\\u00AE\\u009A\\u00E8\\u0082\\u00A1\\u00E7\\u00A5\\u00A8\\u00E4\\u00B8\\u008D\\u00E6\\u0096\\u00AD\\u00E9\\u009C\\u0080\\u00E6\\u00B1\\u0082\\u00E4\\u00B8\\u008D\\u00E5\\u00BE\\u0097\\u00E5\\u008A\\u009E\\u00E6\\u00B3\\u0095\\u00E4\\u00B9\\u008B\\u00E9\\u0097\\u00B4\\u00E9\\u0087\\u0087\\u00E7\\u0094\\u00A8\\u00E8\\u0090\\u00A5\\u00E9\\u0094\\u0080\\u00E6\\u008A\\u0095\\u00E8\\u00AF\\u0089\\u00E7\\u009B\\u00AE\\u00E6\\u00A0\\u0087\\u00E7\\u0088\\u00B1\\u00E6\\u0083\\u0085\\u00E6\\u0091\\u0084\\u00E5\\u00BD\\u00B1\\u00E6\\u009C\\u0089\\u00E4\\u00BA\\u009B\\u00E8\\u00A4\\u0087\\u00E8\\u00A3\\u00BD\\u00E6\\u0096\\u0087\\u00E5\\u00AD\\u00A6\\u00E6\\u009C\\u00BA\\u00E4\\u00BC\\u009A\\u00E6\\u0095\\u00B0\\u00E5\\u00AD\\u0097\\u00E8\\u00A3\\u0085\\u00E4\\u00BF\\u00AE\\u00E8\\u00B4\\u00AD\\u00E7\\u0089\\u00A9\\u00E5\\u0086\\u009C\\u00E6\\u009D\\u0091\\u00E5\\u0085\\u00A8\\u00E9\\u009D\\u00A2\\u00E7\\u00B2\\u00BE\\u00E5\\u0093\\u0081\\u00E5\\u0085\\u00B6\\u00E5\\u00AE\\u009E\\u00E4\\u00BA\\u008B\\u00E6\\u0083\\u0085\\u00E6\\u00B0\\u00B4\\u00E5\\u00B9\\u00B3\\u00E6\\u008F\\u0090\\u00E7\\u00A4\\u00BA\\u00E4\\u00B8\\u008A\\u00E5\\u00B8\\u0082\\u00E8\\u00B0\\u00A2\\u00E8\\u00B0\\u00A2\\u00E6\\u0099\\u00AE\\u00E9\\u0080\\u009A\\u00E6\\u0095\\u0099\\u00E5\\u00B8\\u0088\\u00E4\\u00B8\\u008A\\u00E4\\u00BC\\u00A0\\u00E7\\u00B1\\u00BB\\u00E5\\u0088\\u00AB\\u00E6\\u00AD\\u008C\\u00E6\\u009B\\u00B2\\u00E6\\u008B\\u00A5\\u00E6\\u009C\\u0089\\u00E5\\u0088\\u009B\\u00E6\\u0096\\u00B0\\u00E9\\u0085\\u008D\\u00E4\\u00BB\\u00B6\\u00E5\\u008F\\u00AA\\u00E8\\u00A6\\u0081\\u00E6\\u0097\\u00B6\\u00E4\\u00BB\\u00A3\\u00E8\\u00B3\\u0087\\u00E8\\u00A8\\u008A\\u00E8\\u00BE\\u00BE\\u00E5\\u0088\\u00B0\\u00E4\\u00BA\\u00BA\\u00E7\\u0094\\u009F\\u00E8\\u00AE\\u00A2\\u00E9\\u0098\\u0085\\u00E8\\u0080\\u0081\\u00E5\\u00B8\\u0088\\u00E5\\u00B1\\u0095\\u00E7\\u00A4\\u00BA\\u00E5\\u00BF\\u0083\\u00E7\\u0090\\u0086\\u00E8\\u00B4\\u00B4\\u00E5\\u00AD\\u0090\\u00E7\\u00B6\\u00B2\\u00E7\\u00AB\\u0099\\u00E4\\u00B8\\u00BB\\u00E9\\u00A1\\u008C\\u00E8\\u0087\\u00AA\\u00E7\\u0084\\u00B6\\u00E7\\u00BA\\u00A7\\u00E5\\u0088\\u00AB\\u00E7\\u00AE\\u0080\\u00E5\\u008D\\u0095\\u00E6\\u0094\\u00B9\\u00E9\\u009D\\u00A9\\u00E9\\u0082\\u00A3\\u00E4\\u00BA\\u009B\\u00E6\\u009D\\u00A5\\u00E8\\u00AF\\u00B4\\u00E6\\u0089\\u0093\\u00E5\\u00BC\\u0080\\u00E4\\u00BB\\u00A3\\u00E7\\u00A0\\u0081\\u00E5\\u0088\\u00A0\\u00E9\\u0099\\u00A4\\u00E8\\u00AF\\u0081\\u00E5\\u0088\\u00B8\\u00E8\\u008A\\u0082\\u00E7\\u009B\\u00AE\\u00E9\\u0087\\u008D\\u00E7\\u0082\\u00B9\\u00E6\\u00AC\\u00A1\\u00E6\\u0095\\u00B8\\u00E5\\u00A4\\u009A\\u00E5\\u00B0\\u0091\\u00E8\\u00A7\\u0084\\u00E5\\u0088\\u0092\\u00E8\\u00B5\\u0084\\u00E9\\u0087\\u0091\\u00E6\\u0089\\u00BE\\u00E5\\u0088\\u00B0\\u00E4\\u00BB\\u00A5\\u00E5\\u0090\\u008E\\u00E5\\u00A4\\u00A7\\u00E5\\u0085\\u00A8\\u00E4\\u00B8\\u00BB\\u00E9\\u00A1\\u00B5\\u00E6\\u009C\\u0080\\u00E4\\u00BD\\u00B3\\u00E5\\u009B\\u009E\\u00E7\\u00AD\\u0094\\u00E5\\u00A4\\u00A9\\u00E4\\u00B8\\u008B\\u00E4\\u00BF\\u009D\\u00E9\\u009A\\u009C\\u00E7\\u008E\\u00B0\\u00E4\\u00BB\\u00A3\\u00E6\\u00A3\\u0080\\u00E6\\u009F\\u00A5\\u00E6\\u008A\\u0095\\u00E7\\u00A5\\u00A8\\u00E5\\u00B0\\u008F\\u00E6\\u0097\\u00B6\\u00E6\\u00B2\\u0092\\u00E6\\u009C\\u0089\\u00E6\\u00AD\\u00A3\\u00E5\\u00B8\\u00B8\\u00E7\\u0094\\u009A\\u00E8\\u0087\\u00B3\\u00E4\\u00BB\\u00A3\\u00E7\\u0090\\u0086\\u00E7\\u009B\\u00AE\\u00E5\\u00BD\\u0095\\u00E5\\u0085\\u00AC\\u00E5\\u00BC\\u0080\\u00E5\\u00A4\\u008D\\u00E5\\u0088\\u00B6\\u00E9\\u0087\\u0091\\u00E8\\u009E\\u008D\\u00E5\\u00B9\\u00B8\\u00E7\\u00A6\\u008F\\u00E7\\u0089\\u0088\\u00E6\\u009C\\u00AC\\u00E5\\u00BD\\u00A2\\u00E6\\u0088\\u0090\\u00E5\\u0087\\u0086\\u00E5\\u00A4\\u0087\\u00E8\\u00A1\\u008C\\u00E6\\u0083\\u0085\\u00E5\\u009B\\u009E\\u00E5\\u0088\\u00B0\\u00E6\\u0080\\u009D\\u00E6\\u0083\\u00B3\\u00E6\\u0080\\u008E\\u00E6\\u00A0\\u00B7\\u00E5\\u008D\\u008F\\u00E8\\u00AE\\u00AE\\u00E8\\u00AE\\u00A4\\u00E8\\u00AF\\u0081\\u00E6\\u009C\\u0080\\u00E5\\u00A5\\u00BD\\u00E4\\u00BA\\u00A7\\u00E7\\u0094\\u009F\\u00E6\\u008C\\u0089\\u00E7\\u0085\\u00A7\\u00E6\\u009C\\u008D\\u00E8\\u00A3\\u0085\\u00E5\\u00B9\\u00BF\\u00E4\\u00B8\\u009C\\u00E5\\u008A\\u00A8\\u00E6\\u00BC\\u00AB\\u00E9\\u0087\\u0087\\u00E8\\u00B4\\u00AD\\u00E6\\u0096\\u00B0\\u00E6\\u0089\\u008B\\u00E7\\u00BB\\u0084\\u00E5\\u009B\\u00BE\\u00E9\\u009D\\u00A2\\u00E6\\u009D\\u00BF\\u00E5\\u008F\\u0082\\u00E8\\u0080\\u0083\\u00E6\\u0094\\u00BF\\u00E6\\u00B2\\u00BB\\u00E5\\u00AE\\u00B9\\u00E6\\u0098\\u0093\\u00E5\\u00A4\\u00A9\\u00E5\\u009C\\u00B0\\u00E5\\u008A\\u00AA\\u00E5\\u008A\\u009B\\u00E4\\u00BA\\u00BA\\u00E4\\u00BB\\u00AC\\u00E5\\u008D\\u0087\\u00E7\\u00BA\\u00A7\\u00E9\\u0080\\u009F\\u00E5\\u00BA\\u00A6\\u00E4\\u00BA\\u00BA\\u00E7\\u0089\\u00A9\\u00E8\\u00B0\\u0083\\u00E6\\u0095\\u00B4\\u00E6\\u00B5\\u0081\\u00E8\\u00A1\\u008C\\u00E9\\u0080\\u00A0\\u00E6\\u0088\\u0090\\u00E6\\u0096\\u0087\\u00E5\\u00AD\\u0097\\u00E9\\u009F\\u00A9\\u00E5\\u009B\\u00BD\\u00E8\\u00B4\\u00B8\\u00E6\\u0098\\u0093\\u00E5\\u00BC\\u0080\\u00E5\\u00B1\\u0095\\u00E7\\u009B\\u00B8\\u00E9\\u0097\\u009C\\u00E8\\u00A1\\u00A8\\u00E7\\u008E\\u00B0\\u00E5\\u00BD\\u00B1\\u00E8\\u00A7\\u0086\\u00E5\\u00A6\\u0082\\u00E6\\u00AD\\u00A4\\u00E7\\u00BE\\u008E\\u00E5\\u00AE\\u00B9\\u00E5\\u00A4\\u00A7\\u00E5\\u00B0\\u008F\\u00E6\\u008A\\u00A5\\u00E9\\u0081\\u0093\\u00E6\\u009D\\u00A1\\u00E6\\u00AC\\u00BE\\u00E5\\u00BF\\u0083\\u00E6\\u0083\\u0085\\u00E8\\u00AE\\u00B8\\u00E5\\u00A4\\u009A\\u00E6\\u00B3\\u0095\\u00E8\\u00A7\\u0084\\u00E5\\u00AE\\u00B6\\u00E5\\u00B1\\u0085\\u00E4\\u00B9\\u00A6\\u00E5\\u00BA\\u0097\\u00E8\\u00BF\\u009E\\u00E6\\u008E\\u00A5\\u00E7\\u00AB\\u008B\\u00E5\\u008D\\u00B3\\u00E4\\u00B8\\u00BE\\u00E6\\u008A\\u00A5\\u00E6\\u008A\\u0080\\u00E5\\u00B7\\u00A7\\u00E5\\u00A5\\u00A5\\u00E8\\u00BF\\u0090\\u00E7\\u0099\\u00BB\\u00E5\\u0085\\u00A5\\u00E4\\u00BB\\u00A5\\u00E6\\u009D\\u00A5\\u00E7\\u0090\\u0086\\u00E8\\u00AE\\u00BA\\u00E4\\u00BA\\u008B\\u00E4\\u00BB\\u00B6\\u00E8\\u0087\\u00AA\\u00E7\\u0094\\u00B1\\u00E4\\u00B8\\u00AD\\u00E5\\u008D\\u008E\\u00E5\\u008A\\u009E\\u00E5\\u0085\\u00AC\\u00E5\\u00A6\\u0088\\u00E5\\u00A6\\u0088\\u00E7\\u009C\\u009F\\u00E6\\u00AD\\u00A3\\u00E4\\u00B8\\u008D\\u00E9\\u0094\\u0099\\u00E5\\u0085\\u00A8\\u00E6\\u0096\\u0087\\u00E5\\u0090\\u0088\\u00E5\\u0090\\u008C\\u00E4\\u00BB\\u00B7\\u00E5\\u0080\\u00BC\\u00E5\\u0088\\u00AB\\u00E4\\u00BA\\u00BA\\u00E7\\u009B\\u0091\\u00E7\\u009D\\u00A3\\u00E5\\u0085\\u00B7\\u00E4\\u00BD\\u0093\\u00E4\\u00B8\\u0096\\u00E7\\u00BA\\u00AA\\u00E5\\u009B\\u00A2\\u00E9\\u0098\\u009F\\u00E5\\u0088\\u009B\\u00E4\\u00B8\\u009A\\u00E6\\u0089\\u00BF\\u00E6\\u008B\\u0085\\u00E5\\u00A2\\u009E\\u00E9\\u0095\\u00BF\\u00E6\\u009C\\u0089\\u00E4\\u00BA\\u00BA\\u00E4\\u00BF\\u009D\\u00E6\\u008C\\u0081\\u00E5\\u0095\\u0086\\u00E5\\u00AE\\u00B6\\u00E7\\u00BB\\u00B4\\u00E4\\u00BF\\u00AE\\u00E5\\u008F\\u00B0\\u00E6\\u00B9\\u00BE\\u00E5\\u00B7\\u00A6\\u00E5\\u008F\\u00B3\\u00E8\\u0082\\u00A1\\u00E4\\u00BB\\u00BD\\u00E7\\u00AD\\u0094\\u00E6\\u00A1\\u0088\\u00E5\\u00AE\\u009E\\u00E9\\u0099\\u0085\\u00E7\\u0094\\u00B5\\u00E4\\u00BF\\u00A1\\u00E7\\u00BB\\u008F\\u00E7\\u0090\\u0086\\u00E7\\u0094\\u009F\\u00E5\\u0091\\u00BD\\u00E5\\u00AE\\u00A3\\u00E4\\u00BC\\u00A0\\u00E4\\u00BB\\u00BB\\u00E5\\u008A\\u00A1\\u00E6\\u00AD\\u00A3\\u00E5\\u00BC\\u008F\\u00E7\\u0089\\u00B9\\u00E8\\u0089\\u00B2\\u00E4\\u00B8\\u008B\\u00E6\\u009D\\u00A5\\u00E5\\u008D\\u008F\\u00E4\\u00BC\\u009A\\u00E5\\u008F\\u00AA\\u00E8\\u0083\\u00BD\\u00E5\\u00BD\\u0093\\u00E7\\u0084\\u00B6\\u00E9\\u0087\\u008D\\u00E6\\u0096\\u00B0\\u00E5\\u0085\\u00A7\\u00E5\\u00AE\\u00B9\\u00E6\\u008C\\u0087\\u00E5\\u00AF\\u00BC\\u00E8\\u00BF\\u0090\\u00E8\\u00A1\\u008C\\u00E6\\u0097\\u00A5\\u00E5\\u00BF\\u0097\\u00E8\\u00B3\\u00A3\\u00E5\\u00AE\\u00B6\\u00E8\\u00B6\\u0085\\u00E8\\u00BF\\u0087\\u00E5\\u009C\\u009F\\u00E5\\u009C\\u00B0\\u00E6\\u00B5\\u0099\\u00E6\\u00B1\\u009F\\u00E6\\u0094\\u00AF\\u00E4\\u00BB\\u0098\\u00E6\\u008E\\u00A8\\u00E5\\u0087\\u00BA\\u00E7\\u00AB\\u0099\\u00E9\\u0095\\u00BF\\u00E6\\u009D\\u00AD\\u00E5\\u00B7\\u009E\\u00E6\\u0089\\u00A7\\u00E8\\u00A1\\u008C\\u00E5\\u0088\\u00B6\\u00E9\\u0080\\u00A0\\u00E4\\u00B9\\u008B\\u00E4\\u00B8\\u0080\\u00E6\\u008E\\u00A8\\u00E5\\u00B9\\u00BF\\u00E7\\u008E\\u00B0\\u00E5\\u009C\\u00BA\\u00E6\\u008F\\u008F\\u00E8\\u00BF\\u00B0\\u00E5\\u008F\\u0098\\u00E5\\u008C\\u0096\\u00E4\\u00BC\\u00A0\\u00E7\\u00BB\\u009F\\u00E6\\u00AD\\u008C\\u00E6\\u0089\\u008B\\u00E4\\u00BF\\u009D\\u00E9\\u0099\\u00A9\\u00E8\\u00AF\\u00BE\\u00E7\\u00A8\\u008B\\u00E5\\u008C\\u00BB\\u00E7\\u0096\\u0097\\u00E7\\u00BB\\u008F\\u00E8\\u00BF\\u0087\\u00E8\\u00BF\\u0087\\u00E5\\u008E\\u00BB\\u00E4\\u00B9\\u008B\\u00E5\\u0089\\u008D\\u00E6\\u0094\\u00B6\\u00E5\\u0085\\u00A5\\u00E5\\u00B9\\u00B4\\u00E5\\u00BA\\u00A6\\u00E6\\u009D\\u0082\\u00E5\\u00BF\\u0097\\u00E7\\u00BE\\u008E\\u00E4\\u00B8\\u00BD\\u00E6\\u009C\\u0080\\u00E9\\u00AB\\u0098\\u00E7\\u0099\\u00BB\\u00E9\\u0099\\u0086\\u00E6\\u009C\\u00AA\\u00E6\\u009D\\u00A5\\u00E5\\u008A\\u00A0\\u00E5\\u00B7\\u00A5\\u00E5\\u0085\\u008D\\u00E8\\u00B4\\u00A3\\u00E6\\u0095\\u0099\\u00E7\\u00A8\\u008B\\u00E7\\u0089\\u0088\\u00E5\\u009D\\u0097\\u00E8\\u00BA\\u00AB\\u00E4\\u00BD\\u0093\\u00E9\\u0087\\u008D\\u00E5\\u00BA\\u0086\\u00E5\\u0087\\u00BA\\u00E5\\u0094\\u00AE\\u00E6\\u0088\\u0090\\u00E6\\u009C\\u00AC\\u00E5\\u00BD\\u00A2\\u00E5\\u00BC\\u008F\\u00E5\\u009C\\u009F\\u00E8\\u00B1\\u0086\\u00E5\\u0087\\u00BA\\u00E5\\u0083\\u00B9\\u00E4\\u00B8\\u009C\\u00E6\\u0096\\u00B9\\u00E9\\u0082\\u00AE\\u00E7\\u00AE\\u00B1\\u00E5\\u008D\\u0097\\u00E4\\u00BA\\u00AC\\u00E6\\u00B1\\u0082\\u00E8\\u0081\\u008C\\u00E5\\u008F\\u0096\\u00E5\\u00BE\\u0097\\u00E8\\u0081\\u008C\\u00E4\\u00BD\\u008D\\u00E7\\u009B\\u00B8\\u00E4\\u00BF\\u00A1\\u00E9\\u00A1\\u00B5\\u00E9\\u009D\\u00A2\\u00E5\\u0088\\u0086\\u00E9\\u0092\\u009F\\u00E7\\u00BD\\u0091\\u00E9\\u00A1\\u00B5\\u00E7\\u00A1\\u00AE\\u00E5\\u00AE\\u009A\\u00E5\\u009B\\u00BE\\u00E4\\u00BE\\u008B\\u00E7\\u00BD\\u0091\\u00E5\\u009D\\u0080\\u00E7\\u00A7\\u00AF\\u00E6\\u009E\\u0081\\u00E9\\u0094\\u0099\\u00E8\\u00AF\\u00AF\\u00E7\\u009B\\u00AE\\u00E7\\u009A\\u0084\\u00E5\\u00AE\\u009D\\u00E8\\u00B4\\u009D\\u00E6\\u009C\\u00BA\\u00E5\\u0085\\u00B3\\u00E9\\u00A3\\u008E\\u00E9\\u0099\\u00A9\\u00E6\\u008E\\u0088\\u00E6\\u009D\\u0083\\u00E7\\u0097\\u0085\\u00E6\\u00AF\\u0092\\u00E5\\u00AE\\u00A0\\u00E7\\u0089\\u00A9\\u00E9\\u0099\\u00A4\\u00E4\\u00BA\\u0086\\u00E8\\u00A9\\u0095\\u00E8\\u00AB\\u0096\\u00E7\\u0096\\u00BE\\u00E7\\u0097\\u0085\\u00E5\\u008F\\u008A\\u00E6\\u0097\\u00B6\\u00E6\\u00B1\\u0082\\u00E8\\u00B4\\u00AD\\u00E7\\u00AB\\u0099\\u00E7\\u0082\\u00B9\\u00E5\\u0084\\u00BF\\u00E7\\u00AB\\u00A5\\u00E6\\u00AF\\u008F\\u00E5\\u00A4\\u00A9\\u00E4\\u00B8\\u00AD\\u00E5\\u00A4\\u00AE\\u00E8\\u00AE\\u00A4\\u00E8\\u00AF\\u0086\\u00E6\\u00AF\\u008F\\u00E4\\u00B8\\u00AA\\u00E5\\u00A4\\u00A9\\u00E6\\u00B4\\u00A5\\u00E5\\u00AD\\u0097\\u00E4\\u00BD\\u0093\\u00E5\\u008F\\u00B0\\u00E7\\u0081\\u00A3\\u00E7\\u00BB\\u00B4\\u00E6\\u008A\\u00A4\\u00E6\\u009C\\u00AC\\u00E9\\u00A1\\u00B5\\u00E4\\u00B8\\u00AA\\u00E6\\u0080\\u00A7\\u00E5\\u00AE\\u0098\\u00E6\\u0096\\u00B9\\u00E5\\u00B8\\u00B8\\u00E8\\u00A7\\u0081\\u00E7\\u009B\\u00B8\\u00E6\\u009C\\u00BA\\u00E6\\u0088\\u0098\\u00E7\\u0095\\u00A5\\u00E5\\u00BA\\u0094\\u00E5\\u00BD\\u0093\\u00E5\\u00BE\\u008B\\u00E5\\u00B8\\u0088\\u00E6\\u0096\\u00B9\\u00E4\\u00BE\\u00BF\\u00E6\\u00A0\\u00A1\\u00E5\\u009B\\u00AD\\u00E8\\u0082\\u00A1\\u00E5\\u00B8\\u0082\\u00E6\\u0088\\u00BF\\u00E5\\u00B1\\u008B\\u00E6\\u00A0\\u008F\\u00E7\\u009B\\u00AE\\u00E5\\u0091\\u0098\\u00E5\\u00B7\\u00A5\\u00E5\\u00AF\\u00BC\\u00E8\\u0087\\u00B4\\u00E7\\u00AA\\u0081\\u00E7\\u0084\\u00B6\\u00E9\\u0081\\u0093\\u00E5\\u0085\\u00B7\\u00E6\\u009C\\u00AC\\u00E7\\u00BD\\u0091\\u00E7\\u00BB\\u0093\\u00E5\\u0090\\u0088\\u00E6\\u00A1\\u00A3\\u00E6\\u00A1\\u0088\\u00E5\\u008A\\u00B3\\u00E5\\u008A\\u00A8\\u00E5\\u008F\\u00A6\\u00E5\\u00A4\\u0096\\u00E7\\u00BE\\u008E\\u00E5\\u0085\\u0083\\u00E5\\u00BC\\u0095\\u00E8\\u00B5\\u00B7\\u00E6\\u0094\\u00B9\\u00E5\\u008F\\u0098\\u00E7\\u00AC\\u00AC\\u00E5\\u009B\\u009B\\u00E4\\u00BC\\u009A\\u00E8\\u00AE\\u00A1\\u00E8\\u00AA\\u00AA\\u00E6\\u0098\\u008E\\u00E9\\u009A\\u0090\\u00E7\\u00A7\\u0081\\u00E5\\u00AE\\u009D\\u00E5\\u00AE\\u009D\\u00E8\\u00A7\\u0084\\u00E8\\u008C\\u0083\\u00E6\\u00B6\\u0088\\u00E8\\u00B4\\u00B9\\u00E5\\u0085\\u00B1\\u00E5\\u0090\\u008C\\u00E5\\u00BF\\u0098\\u00E8\\u00AE\\u00B0\\u00E4\\u00BD\\u0093\\u00E7\\u00B3\\u00BB\\u00E5\\u00B8\\u00A6\\u00E6\\u009D\\u00A5\\u00E5\\u0090\\u008D\\u00E5\\u00AD\\u0097\\u00E7\\u0099\\u00BC\\u00E8\\u00A1\\u00A8\\u00E5\\u00BC\\u0080\\u00E6\\u0094\\u00BE\\u00E5\\u008A\\u00A0\\u00E7\\u009B\\u009F\\u00E5\\u008F\\u0097\\u00E5\\u0088\\u00B0\\u00E4\\u00BA\\u008C\\u00E6\\u0089\\u008B\\u00E5\\u00A4\\u00A7\\u00E9\\u0087\\u008F\\u00E6\\u0088\\u0090\\u00E4\\u00BA\\u00BA\\u00E6\\u0095\\u00B0\\u00E9\\u0087\\u008F\\u00E5\\u0085\\u00B1\\u00E4\\u00BA\\u00AB\\u00E5\\u008C\\u00BA\\u00E5\\u009F\\u009F\\u00E5\\u00A5\\u00B3\\u00E5\\u00AD\\u00A9\\u00E5\\u008E\\u009F\\u00E5\\u0088\\u0099\\u00E6\\u0089\\u0080\\u00E5\\u009C\\u00A8\\u00E7\\u00BB\\u0093\\u00E6\\u009D\\u009F\\u00E9\\u0080\\u009A\\u00E4\\u00BF\\u00A1\\u00E8\\u00B6\\u0085\\u00E7\\u00BA\\u00A7\\u00E9\\u0085\\u008D\\u00E7\\u00BD\\u00AE\\u00E5\\u00BD\\u0093\\u00E6\\u0097\\u00B6\\u00E4\\u00BC\\u0098\\u00E7\\u00A7\\u0080\\u00E6\\u0080\\u00A7\\u00E6\\u0084\\u009F\\u00E6\\u0088\\u00BF\\u00E4\\u00BA\\u00A7\\u00E9\\u0081\\u008A\\u00E6\\u0088\\u00B2\\u00E5\\u0087\\u00BA\\u00E5\\u008F\\u00A3\\u00E6\\u008F\\u0090\\u00E4\\u00BA\\u00A4\\u00E5\\u00B0\\u00B1\\u00E4\\u00B8\\u009A\\u00E4\\u00BF\\u009D\\u00E5\\u0081\\u00A5\\u00E7\\u00A8\\u008B\\u00E5\\u00BA\\u00A6\\u00E5\\u008F\\u0082\\u00E6\\u0095\\u00B0\\u00E4\\u00BA\\u008B\\u00E4\\u00B8\\u009A\\u00E6\\u0095\\u00B4\\u00E4\\u00B8\\u00AA\\u00E5\\u00B1\\u00B1\\u00E4\\u00B8\\u009C\\u00E6\\u0083\\u0085\\u00E6\\u0084\\u009F\\u00E7\\u0089\\u00B9\\u00E6\\u00AE\\u008A\\u00E5\\u0088\\u0086\\u00E9\\u00A1\\u009E\\u00E6\\u0090\\u009C\\u00E5\\u00B0\\u008B\\u00E5\\u00B1\\u009E\\u00E4\\u00BA\\u008E\\u00E9\\u0097\\u00A8\\u00E6\\u0088\\u00B7\\u00E8\\u00B4\\u00A2\\u00E5\\u008A\\u00A1\\u00E5\\u00A3\\u00B0\\u00E9\\u009F\\u00B3\\u00E5\\u008F\\u008A\\u00E5\\u0085\\u00B6\\u00E8\\u00B4\\u00A2\\u00E7\\u00BB\\u008F\\u00E5\\u009D\\u009A\\u00E6\\u008C\\u0081\\u00E5\\u00B9\\u00B2\\u00E9\\u0083\\u00A8\\u00E6\\u0088\\u0090\\u00E7\\u00AB\\u008B\\u00E5\\u0088\\u00A9\\u00E7\\u009B\\u008A\\u00E8\\u0080\\u0083\\u00E8\\u0099\\u0091\\u00E6\\u0088\\u0090\\u00E9\\u0083\\u00BD\\u00E5\\u008C\\u0085\\u00E8\\u00A3\\u0085\\u00E7\\u0094\\u00A8\\u00E6\\u0088\\u00B6\\u00E6\\u00AF\\u0094\\u00E8\\u00B5\\u009B\\u00E6\\u0096\\u0087\\u00E6\\u0098\\u008E\\u00E6\\u008B\\u009B\\u00E5\\u0095\\u0086\\u00E5\\u00AE\\u008C\\u00E6\\u0095\\u00B4\\u00E7\\u009C\\u009F\\u00E6\\u0098\\u00AF\\u00E7\\u009C\\u00BC\\u00E7\\u009D\\u009B\\u00E4\\u00BC\\u0099\\u00E4\\u00BC\\u00B4\\u00E5\\u00A8\\u0081\\u00E6\\u009C\\u009B\\u00E9\\u00A2\\u0086\\u00E5\\u009F\\u009F\\u00E5\\u008D\\u00AB\\u00E7\\u0094\\u009F\\u00E4\\u00BC\\u0098\\u00E6\\u0083\\u00A0\\u00E8\\u00AB\\u0096\\u00E5\\u00A3\\u0087\\u00E5\\u0085\\u00AC\\u00E5\\u0085\\u00B1\\u00E8\\u0089\\u00AF\\u00E5\\u00A5\\u00BD\\u00E5\\u0085\\u0085\\u00E5\\u0088\\u0086\\u00E7\\u00AC\\u00A6\\u00E5\\u0090\\u0088\\u00E9\\u0099\\u0084\\u00E4\\u00BB\\u00B6\\u00E7\\u0089\\u00B9\\u00E7\\u0082\\u00B9\\u00E4\\u00B8\\u008D\\u00E5\\u008F\\u00AF\\u00E8\\u008B\\u00B1\\u00E6\\u0096\\u0087\\u00E8\\u00B5\\u0084\\u00E4\\u00BA\\u00A7\\u00E6\\u00A0\\u00B9\\u00E6\\u009C\\u00AC\\u00E6\\u0098\\u008E\\u00E6\\u0098\\u00BE\\u00E5\\u00AF\\u0086\\u00E7\\u00A2\\u00BC\\u00E5\\u0085\\u00AC\\u00E4\\u00BC\\u0097\\u00E6\\u00B0\\u0091\\u00E6\\u0097\\u008F\\u00E6\\u009B\\u00B4\\u00E5\\u008A\\u00A0\\u00E4\\u00BA\\u00AB\\u00E5\\u008F\\u0097\\u00E5\\u0090\\u008C\\u00E5\\u00AD\\u00A6\\u00E5\\u0090\\u00AF\\u00E5\\u008A\\u00A8\\u00E9\\u0080\\u0082\\u00E5\\u0090\\u0088\\u00E5\\u008E\\u009F\\u00E6\\u009D\\u00A5\\u00E9\\u0097\\u00AE\\u00E7\\u00AD\\u0094\\u00E6\\u009C\\u00AC\\u00E6\\u0096\\u0087\\u00E7\\u00BE\\u008E\\u00E9\\u00A3\\u009F\\u00E7\\u00BB\\u00BF\\u00E8\\u0089\\u00B2\\u00E7\\u00A8\\u00B3\\u00E5\\u00AE\\u009A\\u00E7\\u00BB\\u0088\\u00E4\\u00BA\\u008E\\u00E7\\u0094\\u009F\\u00E7\\u0089\\u00A9\\u00E4\\u00BE\\u009B\\u00E6\\u00B1\\u0082\\u00E6\\u0090\\u009C\\u00E7\\u008B\\u0090\\u00E5\\u008A\\u009B\\u00E9\\u0087\\u008F\\u00E4\\u00B8\\u00A5\\u00E9\\u0087\\u008D\\u00E6\\u00B0\\u00B8\\u00E8\\u00BF\\u009C\\u00E5\\u0086\\u0099\\u00E7\\u009C\\u009F\\u00E6\\u009C\\u0089\\u00E9\\u0099\\u0090\\u00E7\\u00AB\\u009E\\u00E4\\u00BA\\u0089\\u00E5\\u00AF\\u00B9\\u00E8\\u00B1\\u00A1\\u00E8\\u00B4\\u00B9\\u00E7\\u0094\\u00A8\\u00E4\\u00B8\\u008D\\u00E5\\u00A5\\u00BD\\u00E7\\u00BB\\u009D\\u00E5\\u00AF\\u00B9\\u00E5\\u008D\\u0081\\u00E5\\u0088\\u0086\\u00E4\\u00BF\\u0083\\u00E8\\u00BF\\u009B\\u00E7\\u0082\\u00B9\\u00E8\\u00AF\\u0084\\u00E5\\u00BD\\u00B1\\u00E9\\u009F\\u00B3\\u00E4\\u00BC\\u0098\\u00E5\\u008A\\u00BF\\u00E4\\u00B8\\u008D\\u00E5\\u00B0\\u0091\\u00E6\\u00AC\\u00A3\\u00E8\\u00B5\\u008F\\u00E5\\u00B9\\u00B6\\u00E4\\u00B8\\u0094\\u00E6\\u009C\\u0089\\u00E7\\u0082\\u00B9\\u00E6\\u0096\\u00B9\\u00E5\\u0090\\u0091\\u00E5\\u0085\\u00A8\\u00E6\\u0096\\u00B0\\u00E4\\u00BF\\u00A1\\u00E7\\u0094\\u00A8\\u00E8\\u00AE\\u00BE\\u00E6\\u0096\\u00BD\\u00E5\\u00BD\\u00A2\\u00E8\\u00B1\\u00A1\\u00E8\\u00B5\\u0084\\u00E6\\u00A0\\u00BC\\u00E7\\u00AA\\u0081\\u00E7\\u00A0\\u00B4\\u00E9\\u009A\\u008F\\u00E7\\u009D\\u0080\\u00E9\\u0087\\u008D\\u00E5\\u00A4\\u00A7\\u00E4\\u00BA\\u008E\\u00E6\\u0098\\u00AF\\u00E6\\u00AF\\u0095\\u00E4\\u00B8\\u009A\\u00E6\\u0099\\u00BA\\u00E8\\u0083\\u00BD\\u00E5\\u008C\\u0096\\u00E5\\u00B7\\u00A5\\u00E5\\u00AE\\u008C\\u00E7\\u00BE\\u008E\\u00E5\\u0095\\u0086\\u00E5\\u009F\\u008E\\u00E7\\u00BB\\u009F\\u00E4\\u00B8\\u0080\\u00E5\\u0087\\u00BA\\u00E7\\u0089\\u0088\\u00E6\\u0089\\u0093\\u00E9\\u0080\\u00A0\\u00E7\\u0094\\u00A2\\u00E5\\u0093\\u0081\\u00E6\\u00A6\\u0082\\u00E5\\u0086\\u00B5\\u00E7\\u0094\\u00A8\\u00E4\\u00BA\\u008E\\u00E4\\u00BF\\u009D\\u00E7\\u0095\\u0099\\u00E5\\u009B\\u00A0\\u00E7\\u00B4\\u00A0\\u00E4\\u00B8\\u00AD\\u00E5\\u009C\\u008B\\u00E5\\u00AD\\u0098\\u00E5\\u0082\\u00A8\\u00E8\\u00B4\\u00B4\\u00E5\\u009B\\u00BE\\u00E6\\u009C\\u0080\\u00E6\\u0084\\u009B\\u00E9\\u0095\\u00BF\\u00E6\\u009C\\u009F\\u00E5\\u008F\\u00A3\\u00E4\\u00BB\\u00B7\\u00E7\\u0090\\u0086\\u00E8\\u00B4\\u00A2\\u00E5\\u009F\\u00BA\\u00E5\\u009C\\u00B0\\u00E5\\u00AE\\u0089\\u00E6\\u008E\\u0092\\u00E6\\u00AD\\u00A6\\u00E6\\u00B1\\u0089\\u00E9\\u0087\\u008C\\u00E9\\u009D\\u00A2\\u00E5\\u0088\\u009B\\u00E5\\u00BB\\u00BA\\u00E5\\u00A4\\u00A9\\u00E7\\u00A9\\u00BA\\u00E9\\u00A6\\u0096\\u00E5\\u0085\\u0088\\u00E5\\u00AE\\u008C\\u00E5\\u0096\\u0084\\u00E9\\u00A9\\u00B1\\u00E5\\u008A\\u00A8\\u00E4\\u00B8\\u008B\\u00E9\\u009D\\u00A2\\u00E4\\u00B8\\u008D\\u00E5\\u0086\\u008D\\u00E8\\u00AF\\u009A\\u00E4\\u00BF\\u00A1\\u00E6\\u0084\\u008F\\u00E4\\u00B9\\u0089\\u00E9\\u0098\\u00B3\\u00E5\\u0085\\u0089\\u00E8\\u008B\\u00B1\\u00E5\\u009B\\u00BD\\u00E6\\u00BC\\u0082\\u00E4\\u00BA\\u00AE\\u00E5\\u0086\\u009B\\u00E4\\u00BA\\u008B\\u00E7\\u008E\\u00A9\\u00E5\\u00AE\\u00B6\\u00E7\\u00BE\\u00A4\\u00E4\\u00BC\\u0097\\u00E5\\u0086\\u009C\\u00E6\\u00B0\\u0091\\u00E5\\u008D\\u00B3\\u00E5\\u008F\\u00AF\\u00E5\\u0090\\u008D\\u00E7\\u00A8\\u00B1\\u00E5\\u00AE\\u00B6\\u00E5\\u0085\\u00B7\\u00E5\\u008A\\u00A8\\u00E7\\u0094\\u00BB\\u00E6\\u0083\\u00B3\\u00E5\\u0088\\u00B0\\u00E6\\u00B3\\u00A8\\u00E6\\u0098\\u008E\\u00E5\\u00B0\\u008F\\u00E5\\u00AD\\u00A6\\u00E6\\u0080\\u00A7\\u00E8\\u0083\\u00BD\\u00E8\\u0080\\u0083\\u00E7\\u00A0\\u0094\\u00E7\\u00A1\\u00AC\\u00E4\\u00BB\\u00B6\\u00E8\\u00A7\\u0082\\u00E7\\u009C\\u008B\\u00E6\\u00B8\\u0085\\u00E6\\u00A5\\u009A\\u00E6\\u0090\\u009E\\u00E7\\u00AC\\u0091\\u00E9\\u00A6\\u0096\\u00E9\\u00A0\\u0081\\u00E9\\u00BB\\u0084\\u00E9\\u0087\\u0091\\u00E9\\u0080\\u0082\\u00E7\\u0094\\u00A8\\u00E6\\u00B1\\u009F\\u00E8\\u008B\\u008F\\u00E7\\u009C\\u009F\\u00E5\\u00AE\\u009E\\u00E4\\u00B8\\u00BB\\u00E7\\u00AE\\u00A1\\u00E9\\u0098\\u00B6\\u00E6\\u00AE\\u00B5\\u00E8\\u00A8\\u00BB\\u00E5\\u0086\\u008A\\u00E7\\u00BF\\u00BB\\u00E8\\u00AF\\u0091\\u00E6\\u009D\\u0083\\u00E5\\u0088\\u00A9\\u00E5\\u0081\\u009A\\u00E5\\u00A5\\u00BD\\u00E4\\u00BC\\u00BC\\u00E4\\u00B9\\u008E\\u00E9\\u0080\\u009A\\u00E8\\u00AE\\u00AF\\u00E6\\u0096\\u00BD\\u00E5\\u00B7\\u00A5\\u00E7\\u008B\\u0080\\u00E6\\u0085\\u008B\\u00E4\\u00B9\\u009F\\u00E8\\u00AE\\u00B8\\u00E7\\u008E\\u00AF\\u00E4\\u00BF\\u009D\\u00E5\\u009F\\u00B9\\u00E5\\u0085\\u00BB\\u00E6\\u00A6\\u0082\\u00E5\\u00BF\\u00B5\\u00E5\\u00A4\\u00A7\\u00E5\\u009E\\u008B\\u00E6\\u009C\\u00BA\\u00E7\\u00A5\\u00A8\\u00E7\\u0090\\u0086\\u00E8\\u00A7\\u00A3\\u00E5\\u008C\\u00BF\\u00E5\\u0090\\u008Dcuandoenviarmadridbuscariniciotiempoporquecuentaestadopuedenjuegoscontraest\\u00C3\\u00A1nnombretienenperfilmaneraamigosciudadcentroaunquepuedesdentroprimerprecioseg\\u00C3\\u00BAnbuenosvolverpuntossemanahab\\u00C3\\u00ADaagostonuevosunidoscarlosequiponi\\u00C3\\u00B1osmuchosalgunacorreoimagenpartirarribamar\\u00C3\\u00ADahombreempleoverdadcambiomuchasfueronpasadol\\u00C3\\u00ADneaparecenuevascursosestabaquierolibroscuantoaccesomiguelvarioscuatrotienesgruposser\\u00C3\\u00A1neuropamediosfrenteacercadem\\u00C3\\u00A1sofertacochesmodeloitalialetrasalg\\u00C3\\u00BAncompracualesexistecuerposiendoprensallegarviajesdineromurciapodr\\u00C3\\u00A1puestodiariopuebloquieremanuelpropiocrisisciertoseguromuertefuentecerrargrandeefectopartesmedidapropiaofrecetierrae-mailvariasformasfuturoobjetoseguirriesgonormasmismos\\u00C3\\u00BAnicocaminositiosraz\\u00C3\\u00B3ndebidopruebatoledoten\\u00C3\\u00ADajes\\u00C3\\u00BAsesperococinaorigentiendacientoc\\u00C3\\u00A1dizhablarser\\u00C3\\u00ADalatinafuerzaestiloguerraentrar\\u00C3\\u00A9xitol\\u00C3\\u00B3pezagendav\\u00C3\\u00ADdeoevitarpaginametrosjavierpadresf\\u00C3\\u00A1cilcabeza\\u00C3\\u00A1reassalidaenv\\u00C3\\u00ADojap\\u00C3\\u00B3nabusosbienestextosllevarpuedanfuertecom\\u00C3\\u00BAnclaseshumanotenidobilbaounidadest\\u00C3\\u00A1seditarcreado\\u00D0\\u00B4\\u00D0\\u00BB\\u00D1\\u008F\\u00D1\\u0087\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00BA\\u00D0\\u00B0\\u00D0\\u00BA\\u00D0\\u00B8\\u00D0\\u00BB\\u00D0\\u00B8\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B2\\u00D1\\u0081\\u00D0\\u00B5\\u00D0\\u00B5\\u00D0\\u00B3\\u00D0\\u00BE\\u00D0\\u00BF\\u00D1\\u0080\\u00D0\\u00B8\\u00D1\\u0082\\u00D0\\u00B0\\u00D0\\u00BA\\u00D0\\u00B5\\u00D1\\u0089\\u00D0\\u00B5\\u00D1\\u0083\\u00D0\\u00B6\\u00D0\\u00B5\\u00D0\\u009A\\u00D0\\u00B0\\u00D0\\u00BA\\u00D0\\u00B1\\u00D0\\u00B5\\u00D0\\u00B7\\u00D0\\u00B1\\u00D1\\u008B\\u00D0\\u00BB\\u00D0\\u00BE\\u00D0\\u00BD\\u00D0\\u00B8\\u00D0\\u0092\\u00D1\\u0081\\u00D0\\u00B5\\u00D0\\u00BF\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00AD\\u00D1\\u0082\\u00D0\\u00BE\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00BC\\u00D1\\u0087\\u00D0\\u00B5\\u00D0\\u00BC\\u00D0\\u00BD\\u00D0\\u00B5\\u00D1\\u0082\\u00D0\\u00BB\\u00D0\\u00B5\\u00D1\\u0082\\u00D1\\u0080\\u00D0\\u00B0\\u00D0\\u00B7\\u00D0\\u00BE\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00B3\\u00D0\\u00B4\\u00D0\\u00B5\\u00D0\\u00BC\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u0094\\u00D0\\u00BB\\u00D1\\u008F\\u00D0\\u009F\\u00D1\\u0080\\u00D0\\u00B8\\u00D0\\u00BD\\u00D0\\u00B0\\u00D1\\u0081\\u00D0\\u00BD\\u00D0\\u00B8\\u00D1\\u0085\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u00BC\\u00D0\\u00BA\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B3\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00B2\\u00D0\\u00BE\\u00D1\\u0082\\u00D1\\u0082\\u00D0\\u00B0\\u00D0\\u00BC\\u00D0\\u00A1\\u00D0\\u00A8\\u00D0\\u0090\\u00D0\\u00BC\\u00D0\\u00B0\\u00D1\\u008F\\u00D0\\u00A7\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B2\\u00D0\\u00B0\\u00D1\\u0081\\u00D0\\u00B2\\u00D0\\u00B0\\u00D0\\u00BC\\u00D0\\u00B5\\u00D0\\u00BC\\u00D1\\u0083\\u00D0\\u00A2\\u00D0\\u00B0\\u00D0\\u00BA\\u00D0\\u00B4\\u00D0\\u00B2\\u00D0\\u00B0\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00BC\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00B8\\u00D1\\u008D\\u00D1\\u0082\\u00D1\\u0083\\u00D0\\u0092\\u00D0\\u00B0\\u00D0\\u00BC\\u00D1\\u0082\\u00D0\\u00B5\\u00D1\\u0085\\u00D0\\u00BF\\u00D1\\u0080\\u00D0\\u00BE\\u00D1\\u0082\\u00D1\\u0083\\u00D1\\u0082\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00B4\\u00D0\\u00B4\\u00D0\\u00BD\\u00D1\\u008F\\u00D0\\u0092\\u00D0\\u00BE\\u00D1\\u0082\\u00D1\\u0082\\u00D1\\u0080\\u00D0\\u00B8\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u00B9\\u00D0\\u0092\\u00D0\\u00B0\\u00D1\\u0081\\u00D0\\u00BD\\u00D0\\u00B8\\u00D0\\u00BC\\u00D1\\u0081\\u00D0\\u00B0\\u00D0\\u00BC\\u00D1\\u0082\\u00D0\\u00BE\\u00D1\\u0082\\u00D1\\u0080\\u00D1\\u0083\\u00D0\\u00B1\\u00D0\\u009E\\u00D0\\u00BD\\u00D0\\u00B8\\u00D0\\u00BC\\u00D0\\u00B8\\u00D1\\u0080\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u00B5\\u00D0\\u009E\\u00D0\\u009E\\u00D0\\u009E\\u00D0\\u00BB\\u00D0\\u00B8\\u00D1\\u0086\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00B0\\u00D0\\u009E\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u00BC\\u00D0\\u00B4\\u00D0\\u00BE\\u00D0\\u00BC\\u00D0\\u00BC\\u00D0\\u00BE\\u00D0\\u00B9\\u00D0\\u00B4\\u00D0\\u00B2\\u00D0\\u00B5\\u00D0\\u00BE\\u00D0\\u00BD\\u00D0\\u00BE\\u00D1\\u0081\\u00D1\\u0083\\u00D0\\u00B4\\u00E0\\u00A4\\u0095\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u00B9\\u00E0\\u00A5\\u0088\\u00E0\\u00A4\\u0095\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u00B8\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u00BE\\u00E0\\u00A4\\u0095\\u00E0\\u00A5\\u008B\\u00E0\\u00A4\\u0094\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u00AA\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u00A8\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u008F\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u00BF\\u00E0\\u00A4\\u00AD\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u0087\\u00E0\\u00A4\\u00B8\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u00A4\\u00E0\\u00A5\\u008B\\u00E0\\u00A4\\u00B9\\u00E0\\u00A5\\u008B\\u00E0\\u00A4\\u0086\\u00E0\\u00A4\\u00AA\\u00E0\\u00A4\\u00B9\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u00AF\\u00E0\\u00A4\\u00B9\\u00E0\\u00A4\\u00AF\\u00E0\\u00A4\\u00BE\\u00E0\\u00A4\\u00A4\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u00A5\\u00E0\\u00A4\\u00BEjagran\\u00E0\\u00A4\\u0086\\u00E0\\u00A4\\u009C\\u00E0\\u00A4\\u009C\\u00E0\\u00A5\\u008B\\u00E0\\u00A4\\u0085\\u00E0\\u00A4\\u00AC\\u00E0\\u00A4\\u00A6\\u00E0\\u00A5\\u008B\\u00E0\\u00A4\\u0097\\u00E0\\u00A4\\u0088\\u00E0\\u00A4\\u009C\\u00E0\\u00A4\\u00BE\\u00E0\\u00A4\\u0097\\u00E0\\u00A4\\u008F\\u00E0\\u00A4\\u00B9\\u00E0\\u00A4\\u00AE\\u00E0\\u00A4\\u0087\\u00E0\\u00A4\\u00A8\\u00E0\\u00A4\\u00B5\\u00E0\\u00A4\\u00B9\\u00E0\\u00A4\\u00AF\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u00A5\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u00A5\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u0098\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u009C\\u00E0\\u00A4\\u00AC\\u00E0\\u00A4\\u00A6\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u0088\\u00E0\\u00A4\\u009C\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u00B5\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u00A8\\u00E0\\u00A4\\u0088\\u00E0\\u00A4\\u00A8\\u00E0\\u00A4\\u008F\\u00E0\\u00A4\\u00B9\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u0089\\u00E0\\u00A4\\u00B8\\u00E0\\u00A4\\u00AE\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u0095\\u00E0\\u00A4\\u00AE\\u00E0\\u00A4\\u00B5\\u00E0\\u00A5\\u008B\\u00E0\\u00A4\\u00B2\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u00B8\\u00E0\\u00A4\\u00AC\\u00E0\\u00A4\\u00AE\\u00E0\\u00A4\\u0088\\u00E0\\u00A4\\u00A6\\u00E0\\u00A5\\u0087\\u00E0\\u00A4\\u0093\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u0086\\u00E0\\u00A4\\u00AE\\u00E0\\u00A4\\u00AC\\u00E0\\u00A4\\u00B8\\u00E0\\u00A4\\u00AD\\u00E0\\u00A4\\u00B0\\u00E0\\u00A4\\u00AC\\u00E0\\u00A4\\u00A8\\u00E0\\u00A4\\u009A\\u00E0\\u00A4\\u00B2\\u00E0\\u00A4\\u00AE\\u00E0\\u00A4\\u00A8\\u00E0\\u00A4\\u0086\\u00E0\\u00A4\\u0097\\u00E0\\u00A4\\u00B8\\u00E0\\u00A5\\u0080\\u00E0\\u00A4\\u00B2\\u00E0\\u00A5\\u0080\\u00D8\\u00B9\\u00D9\\u0084\\u00D9\\u0089\\u00D8\\u00A5\\u00D9\\u0084\\u00D9\\u0089\\u00D9\\u0087\\u00D8\\u00B0\\u00D8\\u00A7\\u00D8\\u00A2\\u00D8\\u00AE\\u00D8\\u00B1\\u00D8\\u00B9\\u00D8\\u00AF\\u00D8\\u00AF\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0089\\u00D9\\u0087\\u00D8\\u00B0\\u00D9\\u0087\\u00D8\\u00B5\\u00D9\\u0088\\u00D8\\u00B1\\u00D8\\u00BA\\u00D9\\u008A\\u00D8\\u00B1\\u00D9\\u0083\\u00D8\\u00A7\\u00D9\\u0086\\u00D9\\u0088\\u00D9\\u0084\\u00D8\\u00A7\\u00D8\\u00A8\\u00D9\\u008A\\u00D9\\u0086\\u00D8\\u00B9\\u00D8\\u00B1\\u00D8\\u00B6\\u00D8\\u00B0\\u00D9\\u0084\\u00D9\\u0083\\u00D9\\u0087\\u00D9\\u0086\\u00D8\\u00A7\\u00D9\\u008A\\u00D9\\u0088\\u00D9\\u0085\\u00D9\\u0082\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00B9\\u00D9\\u0084\\u00D9\\u008A\\u00D8\\u00A7\\u00D9\\u0086\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0083\\u00D9\\u0086\\u00D8\\u00AD\\u00D8\\u00AA\\u00D9\\u0089\\u00D9\\u0082\\u00D8\\u00A8\\u00D9\\u0084\\u00D9\\u0088\\u00D8\\u00AD\\u00D8\\u00A9\\u00D8\\u00A7\\u00D8\\u00AE\\u00D8\\u00B1\\u00D9\\u0081\\u00D9\\u0082\\u00D8\\u00B7\\u00D8\\u00B9\\u00D8\\u00A8\\u00D8\\u00AF\\u00D8\\u00B1\\u00D9\\u0083\\u00D9\\u0086\\u00D8\\u00A5\\u00D8\\u00B0\\u00D8\\u00A7\\u00D9\\u0083\\u00D9\\u0085\\u00D8\\u00A7\\u00D8\\u00A7\\u00D8\\u00AD\\u00D8\\u00AF\\u00D8\\u00A5\\u00D9\\u0084\\u00D8\\u00A7\\u00D9\\u0081\\u00D9\\u008A\\u00D9\\u0087\\u00D8\\u00A8\\u00D8\\u00B9\\u00D8\\u00B6\\u00D9\\u0083\\u00D9\\u008A\\u00D9\\u0081\\u00D8\\u00A8\\u00D8\\u00AD\\u00D8\\u00AB\\u00D9\\u0088\\u00D9\\u0085\\u00D9\\u0086\\u00D9\\u0088\\u00D9\\u0087\\u00D9\\u0088\\u00D8\\u00A3\\u00D9\\u0086\\u00D8\\u00A7\\u00D8\\u00AC\\u00D8\\u00AF\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0087\\u00D8\\u00A7\\u00D8\\u00B3\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00B9\\u00D9\\u0086\\u00D8\\u00AF\\u00D9\\u0084\\u00D9\\u008A\\u00D8\\u00B3\\u00D8\\u00B9\\u00D8\\u00A8\\u00D8\\u00B1\\u00D8\\u00B5\\u00D9\\u0084\\u00D9\\u0089\\u00D9\\u0085\\u00D9\\u0086\\u00D8\\u00B0\\u00D8\\u00A8\\u00D9\\u0087\\u00D8\\u00A7\\u00D8\\u00A3\\u00D9\\u0086\\u00D9\\u0087\\u00D9\\u0085\\u00D8\\u00AB\\u00D9\\u0084\\u00D9\\u0083\\u00D9\\u0086\\u00D8\\u00AA\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00A7\\u00D8\\u00AD\\u00D9\\u008A\\u00D8\\u00AB\\u00D9\\u0085\\u00D8\\u00B5\\u00D8\\u00B1\\u00D8\\u00B4\\u00D8\\u00B1\\u00D8\\u00AD\\u00D8\\u00AD\\u00D9\\u0088\\u00D9\\u0084\\u00D9\\u0088\\u00D9\\u0081\\u00D9\\u008A\\u00D8\\u00A7\\u00D8\\u00B0\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0083\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00B1\\u00D8\\u00A9\\u00D8\\u00A7\\u00D9\\u0086\\u00D8\\u00AA\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0081\\u00D8\\u00A3\\u00D8\\u00A8\\u00D9\\u0088\\u00D8\\u00AE\\u00D8\\u00A7\\u00D8\\u00B5\\u00D8\\u00A3\\u00D9\\u0086\\u00D8\\u00AA\\u00D8\\u00A7\\u00D9\\u0086\\u00D9\\u0087\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u008A\\u00D8\\u00B9\\u00D8\\u00B6\\u00D9\\u0088\\u00D9\\u0088\\u00D9\\u0082\\u00D8\\u00AF\\u00D8\\u00A7\\u00D8\\u00A8\\u00D9\\u0086\\u00D8\\u00AE\\u00D9\\u008A\\u00D8\\u00B1\\u00D8\\u00A8\\u00D9\\u0086\\u00D8\\u00AA\\u00D9\\u0084\\u00D9\\u0083\\u00D9\\u0085\\u00D8\\u00B4\\u00D8\\u00A7\\u00D8\\u00A1\\u00D9\\u0088\\u00D9\\u0087\\u00D9\\u008A\\u00D8\\u00A7\\u00D8\\u00A8\\u00D9\\u0088\\u00D9\\u0082\\u00D8\\u00B5\\u00D8\\u00B5\\u00D9\\u0088\\u00D9\\u0085\\u00D8\\u00A7\\u00D8\\u00B1\\u00D9\\u0082\\u00D9\\u0085\\u00D8\\u00A3\\u00D8\\u00AD\\u00D8\\u00AF\\u00D9\\u0086\\u00D8\\u00AD\\u00D9\\u0086\\u00D8\\u00B9\\u00D8\\u00AF\\u00D9\\u0085\\u00D8\\u00B1\\u00D8\\u00A3\\u00D9\\u008A\\u00D8\\u00A7\\u00D8\\u00AD\\u00D8\\u00A9\\u00D9\\u0083\\u00D8\\u00AA\\u00D8\\u00A8\\u00D8\\u00AF\\u00D9\\u0088\\u00D9\\u0086\\u00D9\\u008A\\u00D8\\u00AC\\u00D8\\u00A8\\u00D9\\u0085\\u00D9\\u0086\\u00D9\\u0087\\u00D8\\u00AA\\u00D8\\u00AD\\u00D8\\u00AA\\u00D8\\u00AC\\u00D9\\u0087\\u00D8\\u00A9\\u00D8\\u00B3\\u00D9\\u0086\\u00D8\\u00A9\\u00D9\\u008A\\u00D8\\u00AA\\u00D9\\u0085\\u00D9\\u0083\\u00D8\\u00B1\\u00D8\\u00A9\\u00D8\\u00BA\\u00D8\\u00B2\\u00D8\\u00A9\\u00D9\\u0086\\u00D9\\u0081\\u00D8\\u00B3\\u00D8\\u00A8\\u00D9\\u008A\\u00D8\\u00AA\\u00D9\\u0084\\u00D9\\u0084\\u00D9\\u0087\\u00D9\\u0084\\u00D9\\u0086\\u00D8\\u00A7\\u00D8\\u00AA\\u00D9\\u0084\\u00D9\\u0083\\u00D9\\u0082\\u00D9\\u0084\\u00D8\\u00A8\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00A7\\u00D8\\u00B9\\u00D9\\u0086\\u00D9\\u0087\\u00D8\\u00A3\\u00D9\\u0088\\u00D9\\u0084\\u00D8\\u00B4\\u00D9\\u008A\\u00D8\\u00A1\\u00D9\\u0086\\u00D9\\u0088\\u00D8\\u00B1\\u00D8\\u00A3\\u00D9\\u0085\\u00D8\\u00A7\\u00D9\\u0081\\u00D9\\u008A\\u00D9\\u0083\\u00D8\\u00A8\\u00D9\\u0083\\u00D9\\u0084\\u00D8\\u00B0\\u00D8\\u00A7\\u00D8\\u00AA\\u00D8\\u00B1\\u00D8\\u00AA\\u00D8\\u00A8\\u00D8\\u00A8\\u00D8\\u00A3\\u00D9\\u0086\\u00D9\\u0087\\u00D9\\u0085\\u00D8\\u00B3\\u00D8\\u00A7\\u00D9\\u0086\\u00D9\\u0083\\u00D8\\u00A8\\u00D9\\u008A\\u00D8\\u00B9\\u00D9\\u0081\\u00D9\\u0082\\u00D8\\u00AF\\u00D8\\u00AD\\u00D8\\u00B3\\u00D9\\u0086\\u00D9\\u0084\\u00D9\\u0087\\u00D9\\u0085\\u00D8\\u00B4\\u00D8\\u00B9\\u00D8\\u00B1\\u00D8\\u00A3\\u00D9\\u0087\\u00D9\\u0084\\u00D8\\u00B4\\u00D9\\u0087\\u00D8\\u00B1\\u00D9\\u0082\\u00D8\\u00B7\\u00D8\\u00B1\\u00D8\\u00B7\\u00D9\\u0084\\u00D8\\u00A8profileservicedefaulthimselfdetailscontentsupportstartedmessagesuccessfashioncountryaccountcreatedstoriesresultsrunningprocesswritingobjectsvisiblewelcomearticleunknownnetworkcompanydynamicbrowserprivacyproblemServicerespectdisplayrequestreservewebsitehistoryfriendsoptionsworkingversionmillionchannelwindow.addressvisitedweathercorrectproductedirectforwardyou canremovedsubjectcontrolarchivecurrentreadinglibrarylimitedmanagerfurthersummarymachineminutesprivatecontextprogramsocietynumberswrittenenabledtriggersourcesloadingelementpartnerfinallyperfectmeaningsystemskeepingculture",journalprojectsurfaces"expiresreviewsbalanceEnglishContentthroughPlease opinioncontactaverageprimaryvillageSpanishgallerydeclinemeetingmissionpopularqualitymeasuregeneralspeciessessionsectionwriterscounterinitialreportsfiguresmembersholdingdisputeearlierexpressdigitalpictureAnothermarriedtrafficleadingchangedcentralvictoryimages/reasonsstudiesfeaturelistingmust beschoolsVersionusuallyepisodeplayinggrowingobviousoverlaypresentactions</ul>\\r\\nwrapperalreadycertainrealitystorageanotherdesktopofferedpatternunusualDigitalcapitalWebsitefailureconnectreducedAndroiddecadesregular & animalsreleaseAutomatgettingmethodsnothingPopularcaptionletterscapturesciencelicensechangesEngland=1&History = new CentralupdatedSpecialNetworkrequirecommentwarningCollegetoolbarremainsbecauseelectedDeutschfinanceworkersquicklybetweenexactlysettingdiseaseSocietyweaponsexhibit<!--Controlclassescoveredoutlineattacksdevices(windowpurposetitle=\\\"Mobile killingshowingItaliandroppedheavilyeffects-1']);\\nconfirmCurrentadvancesharingopeningdrawingbillionorderedGermanyrelated</form>includewhetherdefinedSciencecatalogArticlebuttonslargestuniformjourneysidebarChicagoholidayGeneralpassage,"animatefeelingarrivedpassingnaturalroughly.\\n\\nThe but notdensityBritainChineselack oftributeIreland\\\" data-factorsreceivethat isLibraryhusbandin factaffairsCharlesradicalbroughtfindinglanding:lang=\\\"return leadersplannedpremiumpackageAmericaEdition]"Messageneed tovalue=\\\"complexlookingstationbelievesmaller-mobilerecordswant tokind ofFirefoxyou aresimilarstudiedmaximumheadingrapidlyclimatekingdomemergedamountsfoundedpioneerformuladynastyhow to SupportrevenueeconomyResultsbrothersoldierlargelycalling."AccountEdward segmentRobert effortsPacificlearnedup withheight:we haveAngelesnations_searchappliedacquiremassivegranted: falsetreatedbiggestbenefitdrivingStudiesminimumperhapsmorningsellingis usedreversevariant role=\\\"missingachievepromotestudentsomeoneextremerestorebottom:evolvedall thesitemapenglishway to AugustsymbolsCompanymattersmusicalagainstserving})();\\r\\npaymenttroubleconceptcompareparentsplayersregionsmonitor ''The winningexploreadaptedGalleryproduceabilityenhancecareers). The collectSearch ancientexistedfooter handlerprintedconsoleEasternexportswindowsChannelillegalneutralsuggest_headersigning.html\\\">settledwesterncausing-webkitclaimedJusticechaptervictimsThomas mozillapromisepartieseditionoutside:false,hundredOlympic_buttonauthorsreachedchronicdemandssecondsprotectadoptedprepareneithergreatlygreateroverallimprovecommandspecialsearch.worshipfundingthoughthighestinsteadutilityquarterCulturetestingclearlyexposedBrowserliberal} catchProjectexamplehide();FloridaanswersallowedEmperordefenseseriousfreedomSeveral-buttonFurtherout of != nulltrainedDenmarkvoid(0)/all.jspreventRequestStephen\\n\\nWhen observe</h2>\\r\\nModern provide\\\" alt=\\\"borders.\\n\\nFor \\n\\nMany artistspoweredperformfictiontype ofmedicalticketsopposedCouncilwitnessjusticeGeorge Belgium...</a>twitternotablywaitingwarfare Other rankingphrasesmentionsurvivescholar</p>\\r\\n Countryignoredloss ofjust asGeorgiastrange<head><stopped1']);\\r\\nislandsnotableborder:list ofcarried100,000</h3>\\n severalbecomesselect wedding00.htmlmonarchoff theteacherhighly biologylife ofor evenrise of»plusonehunting(thoughDouglasjoiningcirclesFor theAncientVietnamvehiclesuch ascrystalvalue =Windowsenjoyeda smallassumed<a id=\\\"foreign All rihow theDisplayretiredhoweverhidden;battlesseekingcabinetwas notlook atconductget theJanuaryhappensturninga:hoverOnline French lackingtypicalextractenemieseven ifgeneratdecidedare not/searchbeliefs-image:locatedstatic.login\\\">convertviolententeredfirst\\\">circuitFinlandchemistshe was10px;\\\">as suchdivided</span>will beline ofa greatmystery/index.fallingdue to railwaycollegemonsterdescentit withnuclearJewish protestBritishflowerspredictreformsbutton who waslectureinstantsuicidegenericperiodsmarketsSocial fishingcombinegraphicwinners<br /><by the NaturalPrivacycookiesoutcomeresolveSwedishbrieflyPersianso muchCenturydepictscolumnshousingscriptsnext tobearingmappingrevisedjQuery(-width:title\\\">tooltipSectiondesignsTurkishyounger.match(})();\\n\\nburningoperatedegreessource=Richardcloselyplasticentries</tr>\\r\\ncolor:#ul id=\\\"possessrollingphysicsfailingexecutecontestlink toDefault<br />\\n: true,chartertourismclassicproceedexplain</h1>\\r\\nonline.?xml vehelpingdiamonduse theairlineend -->).attr(readershosting#ffffffrealizeVincentsignals src=\\\"/ProductdespitediversetellingPublic held inJoseph theatreaffects<style>a largedoesn'tlater, ElementfaviconcreatorHungaryAirportsee theso thatMichaelSystemsPrograms, and width=e"tradingleft\\\">\\npersonsGolden Affairsgrammarformingdestroyidea ofcase ofoldest this is.src = cartoonregistrCommonsMuslimsWhat isin manymarkingrevealsIndeed,equally/show_aoutdoorescape(Austriageneticsystem,In the sittingHe alsoIslandsAcademy\\n\\t\\t<!--Daniel bindingblock\\\">imposedutilizeAbraham(except{width:putting).html(|| [];\\nDATA[ *kitchenmountedactual dialectmainly _blank'installexpertsif(typeIt also© \\\">Termsborn inOptionseasterntalkingconcerngained ongoingjustifycriticsfactoryits ownassaultinvitedlastinghis ownhref=\\\"/\\\" rel=\\\"developconcertdiagramdollarsclusterphp?id=alcohol);})();using a><span>vesselsrevivalAddressamateurandroidallegedillnesswalkingcentersqualifymatchesunifiedextinctDefensedied in\\n\\t<!-- customslinkingLittle Book ofeveningmin.js?are thekontakttoday's.html\\\" target=wearingAll Rig;\\n})();raising Also, crucialabout\\\">declare-->\\n<scfirefoxas muchappliesindex, s, but type = \\n\\r\\n<!--towardsRecordsPrivateForeignPremierchoicesVirtualreturnsCommentPoweredinline;povertychamberLiving volumesAnthonylogin\\\" RelatedEconomyreachescuttinggravitylife inChapter-shadowNotable</td>\\r\\n returnstadiumwidgetsvaryingtravelsheld bywho arework infacultyangularwho hadairporttown of\\n\\nSome 'click'chargeskeywordit willcity of(this);Andrew unique checkedor more300px; return;rsion=\\\"pluginswithin herselfStationFederalventurepublishsent totensionactresscome tofingersDuke ofpeople,exploitwhat isharmonya major\\\":\\\"httpin his menu\\\">\\nmonthlyofficercouncilgainingeven inSummarydate ofloyaltyfitnessand wasemperorsupremeSecond hearingRussianlongestAlbertalateralset of small\\\">.appenddo withfederalbank ofbeneathDespiteCapitalgrounds), and percentit fromclosingcontainInsteadfifteenas well.yahoo.respondfighterobscurereflectorganic= Math.editingonline paddinga wholeonerroryear ofend of barrierwhen itheader home ofresumedrenamedstrong>heatingretainscloudfrway of March 1knowingin partBetweenlessonsclosestvirtuallinks\\\">crossedEND -->famous awardedLicenseHealth fairly wealthyminimalAfricancompetelabel\\\">singingfarmersBrasil)discussreplaceGregoryfont copursuedappearsmake uproundedboth ofblockedsaw theofficescoloursif(docuwhen heenforcepush(fuAugust UTF-8\\\">Fantasyin mostinjuredUsuallyfarmingclosureobject defenceuse of Medical<body>\\nevidentbe usedkeyCodesixteenIslamic#000000entire widely active (typeofone cancolor =speakerextendsPhysicsterrain<tbody>funeralviewingmiddle cricketprophetshifteddoctorsRussell targetcompactalgebrasocial-bulk ofman and</td>\\n he left).val()false);logicalbankinghome tonaming Arizonacredits);\\n});\\nfounderin turnCollinsbefore But thechargedTitle\\\">CaptainspelledgoddessTag -->Adding:but wasRecent patientback in=false&Lincolnwe knowCounterJudaismscript altered']);\\n has theunclearEvent',both innot all\\n\\n<!-- placinghard to centersort ofclientsstreetsBernardassertstend tofantasydown inharbourFreedomjewelry/about..searchlegendsis mademodern only ononly toimage\\\" linear painterand notrarely acronymdelivershorter00&as manywidth=\\\"/* <![Ctitle =of the lowest picked escapeduses ofpeoples PublicMatthewtacticsdamagedway forlaws ofeasy to windowstrong simple}catch(seventhinfoboxwent topaintedcitizenI don'tretreat. Some ww.\\\");\\nbombingmailto:made in. Many carries||{};wiwork ofsynonymdefeatsfavoredopticalpageTraunless sendingleft\\\"><comScorAll thejQuery.touristClassicfalse\\\" Wilhelmsuburbsgenuinebishops.split(global followsbody ofnominalContactsecularleft tochiefly-hidden-banner</li>\\n\\n. When in bothdismissExplorealways via thespa\\u00C3\\u00B1olwelfareruling arrangecaptainhis sonrule ofhe tookitself,=0&(calledsamplesto makecom/pagMartin Kennedyacceptsfull ofhandledBesides//--></able totargetsessencehim to its by common.mineralto takeways tos.org/ladvisedpenaltysimple:if theyLettersa shortHerbertstrikes groups.lengthflightsoverlapslowly lesser social </p>\\n\\t\\tit intoranked rate oful>\\r\\n attemptpair ofmake itKontaktAntoniohaving ratings activestreamstrapped\\\").css(hostilelead tolittle groups,Picture-->\\r\\n\\r\\n rows=\\\" objectinverse<footerCustomV><\\\\/scrsolvingChamberslaverywoundedwhereas!= 'undfor allpartly -right:Arabianbacked centuryunit ofmobile-Europe,is homerisk ofdesiredClintoncost ofage of become none ofp"Middle ead')[0Criticsstudios>©group\\\">assemblmaking pressedwidget.ps:\\\" ? rebuiltby someFormer editorsdelayedCanonichad thepushingclass=\\\"but arepartialBabylonbottom carrierCommandits useAs withcoursesa thirddenotesalso inHouston20px;\\\">accuseddouble goal ofFamous ).bind(priests Onlinein Julyst + \\\"gconsultdecimalhelpfulrevivedis veryr'+'iptlosing femalesis alsostringsdays ofarrivalfuture <objectforcingString(\\\" />\\n\\t\\there isencoded. The balloondone by/commonbgcolorlaw of Indianaavoidedbut the2px 3pxjquery.after apolicy.men andfooter-= true;for usescreen.Indian image =family,http://  driverseternalsame asnoticedviewers})();\\n is moreseasonsformer the newis justconsent Searchwas thewhy theshippedbr><br>width: height=made ofcuisineis thata very Admiral fixed;normal MissionPress, ontariocharsettry to invaded=\\\"true\\\"spacingis mosta more totallyfall of});\\r\\n immensetime inset outsatisfyto finddown tolot of Playersin Junequantumnot thetime todistantFinnishsrc = (single help ofGerman law andlabeledforestscookingspace\\\">header-well asStanleybridges/globalCroatia About [0];\\n it, andgroupedbeing a){throwhe madelighterethicalFFFFFF\\\"bottom\\\"like a employslive inas seenprintermost ofub-linkrejectsand useimage\\\">succeedfeedingNuclearinformato helpWomen'sNeitherMexicanprotein<table by manyhealthylawsuitdevised.push({sellerssimply Through.cookie Image(older\\\">us.js\\\"> Since universlarger open to!-- endlies in']);\\r\\n marketwho is (\\\"DOMComanagedone fortypeof Kingdomprofitsproposeto showcenter;made itdressedwere inmixtureprecisearisingsrc = 'make a securedBaptistvoting \\n\\t\\tvar March 2grew upClimate.removeskilledway the</head>face ofacting right\\\">to workreduceshas haderectedshow();action=book ofan area== \\\"htt<header\\n<html>conformfacing cookie.rely onhosted .customhe wentbut forspread Family a meansout theforums.footage\\\">MobilClements\\\" id=\\\"as highintense--><!--female is seenimpliedset thea stateand hisfastestbesidesbutton_bounded\\\"><img Infoboxevents,a youngand areNative cheaperTimeoutand hasengineswon the(mostlyright: find a -bottomPrince area ofmore ofsearch_nature,legallyperiod,land ofor withinducedprovingmissilelocallyAgainstthe wayk"px;\\\">\\r\\npushed abandonnumeralCertainIn thismore inor somename isand, incrownedISBN 0-createsOctobermay notcenter late inDefenceenactedwish tobroadlycoolingonload=it. TherecoverMembersheight assumes<html>\\npeople.in one =windowfooter_a good reklamaothers,to this_cookiepanel\\\">London,definescrushedbaptismcoastalstatus title\\\" move tolost inbetter impliesrivalryservers SystemPerhapses and contendflowinglasted rise inGenesisview ofrising seem tobut in backinghe willgiven agiving cities.flow of Later all butHighwayonly bysign ofhe doesdiffersbattery&lasinglesthreatsintegertake onrefusedcalled =US&See thenativesby thissystem.head of:hover,lesbiansurnameand allcommon/header__paramsHarvard/pixel.removalso longrole ofjointlyskyscraUnicodebr />\\r\\nAtlantanucleusCounty,purely count\\\">easily build aonclicka givenpointerh"events else {\\nditionsnow the, with man whoorg/Webone andcavalryHe diedseattle00,000 {windowhave toif(windand itssolely m"renewedDetroitamongsteither them inSenatorUs</a><King ofFrancis-produche usedart andhim andused byscoringat hometo haverelatesibilityfactionBuffalolink\\\"><what hefree toCity ofcome insectorscountedone daynervoussquare };if(goin whatimg\\\" alis onlysearch/tuesdaylooselySolomonsexual - <a hrmedium\\\"DO NOT France,with a war andsecond take a >\\r\\n\\r\\n\\r\\nmarket.highwaydone inctivity\\\"last\\\">obligedrise to\\\"undefimade to Early praisedin its for hisathleteJupiterYahoo! termed so manyreally s. The a woman?value=direct right\\\" bicycleacing=\\\"day andstatingRather,higher Office are nowtimes, when a pay foron this-link\\\">;borderaround annual the Newput the.com\\\" takin toa brief(in thegroups.; widthenzymessimple in late{returntherapya pointbanninginks\\\">\\n();\\\" rea place\\\\u003Caabout atr>\\r\\n\\t\\tccount gives a<SCRIPTRailwaythemes/toolboxById(\\\"xhumans,watchesin some if (wicoming formats Under but hashanded made bythan infear ofdenoted/iframeleft involtagein eacha"base ofIn manyundergoregimesaction </p>\\r\\n<ustomVa;></importsor thatmostly &re size=\\\"</a></ha classpassiveHost = WhetherfertileVarious=[];(fucameras/></td>acts asIn some>\\r\\n\\r\\n<!organis <br />Beijingcatal\\u00C3\\u00A0deutscheuropeueuskaragaeilgesvenskaespa\\u00C3\\u00B1amensajeusuariotrabajom\\u00C3\\u00A9xicop\\u00C3\\u00A1ginasiempresistemaoctubredurantea\\u00C3\\u00B1adirempresamomentonuestroprimeratrav\\u00C3\\u00A9sgraciasnuestraprocesoestadoscalidadpersonan\\u00C3\\u00BAmeroacuerdom\\u00C3\\u00BAsicamiembroofertasalgunospa\\u00C3\\u00ADsesejemploderechoadem\\u00C3\\u00A1sprivadoagregarenlacesposiblehotelessevillaprimero\\u00C3\\u00BAltimoeventosarchivoculturamujeresentradaanuncioembargomercadograndesestudiomejoresfebrerodise\\u00C3\\u00B1oturismoc\\u00C3\\u00B3digoportadaespaciofamiliaantoniopermiteguardaralgunaspreciosalguiensentidovisitast\\u00C3\\u00ADtuloconocersegundoconsejofranciaminutossegundatenemosefectosm\\u00C3\\u00A1lagasesi\\u00C3\\u00B3nrevistagranadacompraringresogarc\\u00C3\\u00ADaacci\\u00C3\\u00B3necuadorquienesinclusodeber\\u00C3\\u00A1materiahombresmuestrapodr\\u00C3\\u00ADama\\u00C3\\u00B1ana\\u00C3\\u00BAltimaestamosoficialtambienning\\u00C3\\u00BAnsaludospodemosmejorarpositionbusinesshomepagesecuritylanguagestandardcampaignfeaturescategoryexternalchildrenreservedresearchexchangefavoritetemplatemilitaryindustryservicesmaterialproductsz-index:commentssoftwarecompletecalendarplatformarticlesrequiredmovementquestionbuildingpoliticspossiblereligionphysicalfeedbackregisterpicturesdisabledprotocolaudiencesettingsactivityelementslearninganythingabstractprogressoverviewmagazineeconomictrainingpressurevarious <strong>propertyshoppingtogetheradvancedbehaviordownloadfeaturedfootballselectedLanguagedistanceremembertrackingpasswordmodifiedstudentsdirectlyfightingnortherndatabasefestivalbreakinglocationinternetdropdownpracticeevidencefunctionmarriageresponseproblemsnegativeprogramsanalysisreleasedbanner\\\">purchasepoliciesregionalcreativeargumentbookmarkreferrerchemicaldivisioncallbackseparateprojectsconflicthardwareinterestdeliverymountainobtained= false;for(var acceptedcapacitycomputeridentityaircraftemployedproposeddomesticincludesprovidedhospitalverticalcollapseapproachpartnerslogo\\\"><adaughterauthor\\\" culturalfamilies/images/assemblypowerfulteachingfinisheddistrictcriticalcgi-bin/purposesrequireselectionbecomingprovidesacademicexerciseactuallymedicineconstantaccidentMagazinedocumentstartingbottom\\\">observed: "extendedpreviousSoftwarecustomerdecisionstrengthdetailedslightlyplanningtextareacurrencyeveryonestraighttransferpositiveproducedheritageshippingabsolutereceivedrelevantbutton\\\" violenceanywherebenefitslaunchedrecentlyalliancefollowedmultiplebulletinincludedoccurredinternal$(this).republic><tr><tdcongressrecordedultimatesolution<ul id=\\\"discoverHome</a>websitesnetworksalthoughentirelymemorialmessagescontinueactive\\\">somewhatvictoriaWestern title=\\\"LocationcontractvisitorsDownloadwithout right\\\">\\nmeasureswidth = variableinvolvedvirginianormallyhappenedaccountsstandingnationalRegisterpreparedcontrolsaccuratebirthdaystrategyofficialgraphicscriminalpossiblyconsumerPersonalspeakingvalidateachieved.jpg\\\" />machines</h2>\\n keywordsfriendlybrotherscombinedoriginalcomposedexpectedadequatepakistanfollow\\\" valuable</label>relativebringingincreasegovernorplugins/List of Header\\\">\\\" name=\\\" ("graduate</head>\\ncommercemalaysiadirectormaintain;height:schedulechangingback to catholicpatternscolor: #greatestsuppliesreliable</ul>\\n\\t\\t<select citizensclothingwatching<li id=\\\"specificcarryingsentence<center>contrastthinkingcatch(e)southernMichael merchantcarouselpadding:interior.split(\\\"lizationOctober ){returnimproved-->\\n\\ncoveragechairman.png\\\" />subjectsRichard whateverprobablyrecoverybaseballjudgmentconnect..css\\\" /> websitereporteddefault\\\"/></a>\\r\\nelectricscotlandcreationquantity. ISBN 0did not instance-search-\\\" lang=\\\"speakersComputercontainsarchivesministerreactiondiscountItalianocriteriastrongly: 'http:'script'coveringofferingappearedBritish identifyFacebooknumerousvehiclesconcernsAmericanhandlingdiv id=\\\"William provider_contentaccuracysection andersonflexibleCategorylawrence<script>layout=\\\"approved maximumheader\\\"></table>Serviceshamiltoncurrent canadianchannels/themes//articleoptionalportugalvalue=\\\"\\\"intervalwirelessentitledagenciesSearch\\\" measuredthousandspending…new Date\\\" size=\\\"pageNamemiddle\\\" \\\" /></a>hidden\\\">sequencepersonaloverflowopinionsillinoislinks\\\">\\n\\t<title>versionssaturdayterminalitempropengineersectionsdesignerproposal=\\\"false\\\"Espa\\u00C3\\u00B1olreleasessubmit\\\" er"additionsymptomsorientedresourceright\\\"><pleasurestationshistory.leaving border=contentscenter\\\">.\\n\\nSome directedsuitablebulgaria.show();designedGeneral conceptsExampleswilliamsOriginal\\\"><span>search\\\">operatorrequestsa "allowingDocumentrevision. \\n\\nThe yourselfContact michiganEnglish columbiapriorityprintingdrinkingfacilityreturnedContent officersRussian generate-8859-1\\\"indicatefamiliar qualitymargin:0 contentviewportcontacts-title\\\">portable.length eligibleinvolvesatlanticonload=\\\"default.suppliedpaymentsglossary\\n\\nAfter guidance</td><tdencodingmiddle\\\">came to displaysscottishjonathanmajoritywidgets.clinicalthailandteachers<head>\\n\\taffectedsupportspointer;toString</small>oklahomawill be investor0\\\" alt=\\\"holidaysResourcelicensed (which . After considervisitingexplorerprimary search\\\" android\\\"quickly meetingsestimate;return ;color:# height=approval, " checked.min.js\\\"magnetic></a></hforecast. While thursdaydvertiseéhasClassevaluateorderingexistingpatients Online coloradoOptions\\\"campbell<!-- end</span><<br />\\r\\n_popups|sciences," quality Windows assignedheight: <b classle" value=\\\" Companyexamples<iframe believespresentsmarshallpart of properly).\\n\\nThe taxonomymuch of </span>\\n\\\" data-srtugu\\u00C3\\u00AAsscrollTo project<head>\\r\\nattorneyemphasissponsorsfancyboxworld's wildlifechecked=sessionsprogrammpx;font- Projectjournalsbelievedvacationthompsonlightingand the special border=0checking</tbody><button Completeclearfix\\n<head>\\narticle <sectionfindingsrole in popular Octoberwebsite exposureused to changesoperatedclickingenteringcommandsinformed numbers </div>creatingonSubmitmarylandcollegesanalyticlistingscontact.loggedInadvisorysiblingscontent\\\"s")s. This packagescheckboxsuggestspregnanttomorrowspacing=icon.png\";\n\t\t\t}\n\t\t}\n\n\t\tprivate class DataHolder1\n\t\t{\n\t\t\tinternal static string GetData()\n\t\t\t{\n\t\t\t\treturn \"japanesecodebasebutton\\\">gamblingsuch as , while </span> missourisportingtop:1px .</span>tensionswidth=\\\"2lazyloadnovemberused in height=\\\"cript\\\">\\n </<tr><td height:2/productcountry include footer\\\" <!-- title\\\"></jquery.</form>\\n(\\u00E7\\u00AE\\u0080\\u00E4\\u00BD\\u0093)(\\u00E7\\u00B9\\u0081\\u00E9\\u00AB\\u0094)hrvatskiitalianorom\\u00C3\\u00A2n\\u00C4\\u0083t\\u00C3\\u00BCrk\\u00C3\\u00A7e\\u00D8\\u00A7\\u00D8\\u00B1\\u00D8\\u00AF\\u00D9\\u0088tambi\\u00C3\\u00A9nnoticiasmensajespersonasderechosnacionalserviciocontactousuariosprogramagobiernoempresasanunciosvalenciacolombiadespu\\u00C3\\u00A9sdeportesproyectoproductop\\u00C3\\u00BAbliconosotroshistoriapresentemillonesmediantepreguntaanteriorrecursosproblemasantiagonuestrosopini\\u00C3\\u00B3nimprimirmientrasam\\u00C3\\u00A9ricavendedorsociedadrespectorealizarregistropalabrasinter\\u00C3\\u00A9sentoncesespecialmiembrosrealidadc\\u00C3\\u00B3rdobazaragozap\\u00C3\\u00A1ginassocialesbloqueargesti\\u00C3\\u00B3nalquilersistemascienciascompletoversi\\u00C3\\u00B3ncompletaestudiosp\\u00C3\\u00BAblicaobjetivoalicantebuscadorcantidadentradasaccionesarchivossuperiormayor\\u00C3\\u00ADaalemaniafunci\\u00C3\\u00B3n\\u00C3\\u00BAltimoshaciendoaquellosedici\\u00C3\\u00B3nfernandoambientefacebooknuestrasclientesprocesosbastantepresentareportarcongresopublicarcomerciocontratoj\\u00C3\\u00B3venesdistritot\\u00C3\\u00A9cnicaconjuntoenerg\\u00C3\\u00ADatrabajarasturiasrecienteutilizarbolet\\u00C3\\u00ADnsalvadorcorrectatrabajosprimerosnegocioslibertaddetallespantallapr\\u00C3\\u00B3ximoalmer\\u00C3\\u00ADaanimalesqui\\u00C3\\u00A9nescoraz\\u00C3\\u00B3nsecci\\u00C3\\u00B3nbuscandoopcionesexteriorconceptotodav\\u00C3\\u00ADagaler\\u00C3\\u00ADaescribirmedicinalicenciaconsultaaspectoscr\\u00C3\\u00ADticad\\u00C3\\u00B3laresjusticiadeber\\u00C3\\u00A1nper\\u00C3\\u00ADodonecesitamantenerpeque\\u00C3\\u00B1orecibidatribunaltenerifecanci\\u00C3\\u00B3ncanariasdescargadiversosmallorcarequieret\\u00C3\\u00A9cnicodeber\\u00C3\\u00ADaviviendafinanzasadelantefuncionaconsejosdif\\u00C3\\u00ADcilciudadesantiguasavanzadat\\u00C3\\u00A9rminounidadess\\u00C3\\u00A1nchezcampa\\u00C3\\u00B1asoftonicrevistascontienesectoresmomentosfacultadcr\\u00C3\\u00A9ditodiversassupuestofactoressegundospeque\\u00C3\\u00B1a\\u00D0\\u00B3\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00B0\\u00D0\\u00B5\\u00D1\\u0081\\u00D0\\u00BB\\u00D0\\u00B8\\u00D0\\u00B5\\u00D1\\u0081\\u00D1\\u0082\\u00D1\\u008C\\u00D0\\u00B1\\u00D1\\u008B\\u00D0\\u00BB\\u00D0\\u00BE\\u00D0\\u00B1\\u00D1\\u008B\\u00D1\\u0082\\u00D1\\u008C\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00BC\\u00D0\\u0095\\u00D1\\u0081\\u00D0\\u00BB\\u00D0\\u00B8\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B3\\u00D0\\u00BE\\u00D0\\u00BC\\u00D0\\u00B5\\u00D0\\u00BD\\u00D1\\u008F\\u00D0\\u00B2\\u00D1\\u0081\\u00D0\\u00B5\\u00D1\\u0085\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B9\\u00D0\\u00B4\\u00D0\\u00B0\\u00D0\\u00B6\\u00D0\\u00B5\\u00D0\\u00B1\\u00D1\\u008B\\u00D0\\u00BB\\u00D0\\u00B8\\u00D0\\u00B3\\u00D0\\u00BE\\u00D0\\u00B4\\u00D1\\u0083\\u00D0\\u00B4\\u00D0\\u00B5\\u00D0\\u00BD\\u00D1\\u008C\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00BE\\u00D1\\u0082\\u00D0\\u00B1\\u00D1\\u008B\\u00D0\\u00BB\\u00D0\\u00B0\\u00D1\\u0081\\u00D0\\u00B5\\u00D0\\u00B1\\u00D1\\u008F\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00B8\\u00D0\\u00BD\\u00D1\\u0081\\u00D0\\u00B5\\u00D0\\u00B1\\u00D0\\u00B5\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00B4\\u00D0\\u00BE\\u00D1\\u0081\\u00D0\\u00B0\\u00D0\\u00B9\\u00D1\\u0082\\u00D1\\u0084\\u00D0\\u00BE\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u00B3\\u00D0\\u00BE\\u00D1\\u0081\\u00D0\\u00B2\\u00D0\\u00BE\\u00D0\\u00B8\\u00D1\\u0081\\u00D0\\u00B2\\u00D0\\u00BE\\u00D0\\u00B9\\u00D0\\u00B8\\u00D0\\u00B3\\u00D1\\u0080\\u00D1\\u008B\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00B6\\u00D0\\u00B5\\u00D0\\u00B2\\u00D1\\u0081\\u00D0\\u00B5\\u00D0\\u00BC\\u00D1\\u0081\\u00D0\\u00B2\\u00D0\\u00BE\\u00D1\\u008E\\u00D0\\u00BB\\u00D0\\u00B8\\u00D1\\u0088\\u00D1\\u008C\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00B8\\u00D1\\u0085\\u00D0\\u00BF\\u00D0\\u00BE\\u00D0\\u00BA\\u00D0\\u00B0\\u00D0\\u00B4\\u00D0\\u00BD\\u00D0\\u00B5\\u00D0\\u00B9\\u00D0\\u00B4\\u00D0\\u00BE\\u00D0\\u00BC\\u00D0\\u00B0\\u00D0\\u00BC\\u00D0\\u00B8\\u00D1\\u0080\\u00D0\\u00B0\\u00D0\\u00BB\\u00D0\\u00B8\\u00D0\\u00B1\\u00D0\\u00BE\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u00BC\\u00D1\\u0083\\u00D1\\u0085\\u00D0\\u00BE\\u00D1\\u0082\\u00D1\\u008F\\u00D0\\u00B4\\u00D0\\u00B2\\u00D1\\u0083\\u00D1\\u0085\\u00D1\\u0081\\u00D0\\u00B5\\u00D1\\u0082\\u00D0\\u00B8\\u00D0\\u00BB\\u00D1\\u008E\\u00D0\\u00B4\\u00D0\\u00B8\\u00D0\\u00B4\\u00D0\\u00B5\\u00D0\\u00BB\\u00D0\\u00BE\\u00D0\\u00BC\\u00D0\\u00B8\\u00D1\\u0080\\u00D0\\u00B5\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u00B1\\u00D1\\u008F\\u00D1\\u0081\\u00D0\\u00B2\\u00D0\\u00BE\\u00D0\\u00B5\\u00D0\\u00B2\\u00D0\\u00B8\\u00D0\\u00B4\\u00D0\\u00B5\\u00D1\\u0087\\u00D0\\u00B5\\u00D0\\u00B3\\u00D0\\u00BE\\u00D1\\u008D\\u00D1\\u0082\\u00D0\\u00B8\\u00D0\\u00BC\\u00D1\\u0081\\u00D1\\u0087\\u00D0\\u00B5\\u00D1\\u0082\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u00BC\\u00D1\\u008B\\u00D1\\u0086\\u00D0\\u00B5\\u00D0\\u00BD\\u00D1\\u008B\\u00D1\\u0081\\u00D1\\u0082\\u00D0\\u00B0\\u00D0\\u00BB\\u00D0\\u00B2\\u00D0\\u00B5\\u00D0\\u00B4\\u00D1\\u008C\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u00BC\\u00D0\\u00B5\\u00D0\\u00B2\\u00D0\\u00BE\\u00D0\\u00B4\\u00D1\\u008B\\u00D1\\u0082\\u00D0\\u00B5\\u00D0\\u00B1\\u00D0\\u00B5\\u00D0\\u00B2\\u00D1\\u008B\\u00D1\\u0088\\u00D0\\u00B5\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00BC\\u00D0\\u00B8\\u00D1\\u0082\\u00D0\\u00B8\\u00D0\\u00BF\\u00D0\\u00B0\\u00D1\\u0082\\u00D0\\u00BE\\u00D0\\u00BC\\u00D1\\u0083\\u00D0\\u00BF\\u00D1\\u0080\\u00D0\\u00B0\\u00D0\\u00B2\\u00D0\\u00BB\\u00D0\\u00B8\\u00D1\\u0086\\u00D0\\u00B0\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00BD\\u00D0\\u00B0\\u00D0\\u00B3\\u00D0\\u00BE\\u00D0\\u00B4\\u00D1\\u008B\\u00D0\\u00B7\\u00D0\\u00BD\\u00D0\\u00B0\\u00D1\\u008E\\u00D0\\u00BC\\u00D0\\u00BE\\u00D0\\u00B3\\u00D1\\u0083\\u00D0\\u00B4\\u00D1\\u0080\\u00D1\\u0083\\u00D0\\u00B3\\u00D0\\u00B2\\u00D1\\u0081\\u00D0\\u00B5\\u00D0\\u00B9\\u00D0\\u00B8\\u00D0\\u00B4\\u00D0\\u00B5\\u00D1\\u0082\\u00D0\\u00BA\\u00D0\\u00B8\\u00D0\\u00BD\\u00D0\\u00BE\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00BD\\u00D0\\u00BE\\u00D0\\u00B4\\u00D0\\u00B5\\u00D0\\u00BB\\u00D0\\u00B0\\u00D0\\u00B4\\u00D0\\u00B5\\u00D0\\u00BB\\u00D0\\u00B5\\u00D1\\u0081\\u00D1\\u0080\\u00D0\\u00BE\\u00D0\\u00BA\\u00D0\\u00B8\\u00D1\\u008E\\u00D0\\u00BD\\u00D1\\u008F\\u00D0\\u00B2\\u00D0\\u00B5\\u00D1\\u0081\\u00D1\\u008C\\u00D0\\u0095\\u00D1\\u0081\\u00D1\\u0082\\u00D1\\u008C\\u00D1\\u0080\\u00D0\\u00B0\\u00D0\\u00B7\\u00D0\\u00B0\\u00D0\\u00BD\\u00D0\\u00B0\\u00D1\\u0088\\u00D0\\u00B8\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0084\\u00D9\\u0087\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00AA\\u00D9\\u008A\\u00D8\\u00AC\\u00D9\\u0085\\u00D9\\u008A\\u00D8\\u00B9\\u00D8\\u00AE\\u00D8\\u00A7\\u00D8\\u00B5\\u00D8\\u00A9\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00B0\\u00D9\\u008A\\u00D8\\u00B9\\u00D9\\u0084\\u00D9\\u008A\\u00D9\\u0087\\u00D8\\u00AC\\u00D8\\u00AF\\u00D9\\u008A\\u00D8\\u00AF\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00A2\\u00D9\\u0086\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00B1\\u00D8\\u00AF\\u00D8\\u00AA\\u00D8\\u00AD\\u00D9\\u0083\\u00D9\\u0085\\u00D8\\u00B5\\u00D9\\u0081\\u00D8\\u00AD\\u00D8\\u00A9\\u00D9\\u0083\\u00D8\\u00A7\\u00D9\\u0086\\u00D8\\u00AA\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0084\\u00D9\\u008A\\u00D9\\u008A\\u00D9\\u0083\\u00D9\\u0088\\u00D9\\u0086\\u00D8\\u00B4\\u00D8\\u00A8\\u00D9\\u0083\\u00D8\\u00A9\\u00D9\\u0081\\u00D9\\u008A\\u00D9\\u0087\\u00D8\\u00A7\\u00D8\\u00A8\\u00D9\\u0086\\u00D8\\u00A7\\u00D8\\u00AA\\u00D8\\u00AD\\u00D9\\u0088\\u00D8\\u00A7\\u00D8\\u00A1\\u00D8\\u00A3\\u00D9\\u0083\\u00D8\\u00AB\\u00D8\\u00B1\\u00D8\\u00AE\\u00D9\\u0084\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00AD\\u00D8\\u00A8\\u00D8\\u00AF\\u00D9\\u0084\\u00D9\\u008A\\u00D9\\u0084\\u00D8\\u00AF\\u00D8\\u00B1\\u00D9\\u0088\\u00D8\\u00B3\\u00D8\\u00A7\\u00D8\\u00B6\\u00D8\\u00BA\\u00D8\\u00B7\\u00D8\\u00AA\\u00D9\\u0083\\u00D9\\u0088\\u00D9\\u0086\\u00D9\\u0087\\u00D9\\u0086\\u00D8\\u00A7\\u00D9\\u0083\\u00D8\\u00B3\\u00D8\\u00A7\\u00D8\\u00AD\\u00D8\\u00A9\\u00D9\\u0086\\u00D8\\u00A7\\u00D8\\u00AF\\u00D9\\u008A\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00B7\\u00D8\\u00A8\\u00D8\\u00B9\\u00D9\\u0084\\u00D9\\u008A\\u00D9\\u0083\\u00D8\\u00B4\\u00D9\\u0083\\u00D8\\u00B1\\u00D8\\u00A7\\u00D9\\u008A\\u00D9\\u0085\\u00D9\\u0083\\u00D9\\u0086\\u00D9\\u0085\\u00D9\\u0086\\u00D9\\u0087\\u00D8\\u00A7\\u00D8\\u00B4\\u00D8\\u00B1\\u00D9\\u0083\\u00D8\\u00A9\\u00D8\\u00B1\\u00D8\\u00A6\\u00D9\\u008A\\u00D8\\u00B3\\u00D9\\u0086\\u00D8\\u00B4\\u00D9\\u008A\\u00D8\\u00B7\\u00D9\\u0085\\u00D8\\u00A7\\u00D8\\u00B0\\u00D8\\u00A7\\u00D8\\u00A7\\u00D9\\u0084\\u00D9\\u0081\\u00D9\\u0086\\u00D8\\u00B4\\u00D8\\u00A8\\u00D8\\u00A7\\u00D8\\u00A8\\u00D8\\u00AA\\u00D8\\u00B9\\u00D8\\u00A8\\u00D8\\u00B1\\u00D8\\u00B1\\u00D8\\u00AD\\u00D9\\u0085\\u00D8\\u00A9\\u00D9\\u0083\\u00D8\\u00A7\\u00D9\\u0081\\u00D8\\u00A9\\u00D9\\u008A\\u00D9\\u0082\\u00D9\\u0088\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00B1\\u00D9\\u0083\\u00D8\\u00B2\\u00D9\\u0083\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00A9\\u00D8\\u00A3\\u00D8\\u00AD\\u00D9\\u0085\\u00D8\\u00AF\\u00D9\\u0082\\u00D9\\u0084\\u00D8\\u00A8\\u00D9\\u008A\\u00D9\\u008A\\u00D8\\u00B9\\u00D9\\u0086\\u00D9\\u008A\\u00D8\\u00B5\\u00D9\\u0088\\u00D8\\u00B1\\u00D8\\u00A9\\u00D8\\u00B7\\u00D8\\u00B1\\u00D9\\u008A\\u00D9\\u0082\\u00D8\\u00B4\\u00D8\\u00A7\\u00D8\\u00B1\\u00D9\\u0083\\u00D8\\u00AC\\u00D9\\u0088\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00A3\\u00D8\\u00AE\\u00D8\\u00B1\\u00D9\\u0089\\u00D9\\u0085\\u00D8\\u00B9\\u00D9\\u0086\\u00D8\\u00A7\\u00D8\\u00A7\\u00D8\\u00A8\\u00D8\\u00AD\\u00D8\\u00AB\\u00D8\\u00B9\\u00D8\\u00B1\\u00D9\\u0088\\u00D8\\u00B6\\u00D8\\u00A8\\u00D8\\u00B4\\u00D9\\u0083\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00B3\\u00D8\\u00AC\\u00D9\\u0084\\u00D8\\u00A8\\u00D9\\u0086\\u00D8\\u00A7\\u00D9\\u0086\\u00D8\\u00AE\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00AF\\u00D9\\u0083\\u00D8\\u00AA\\u00D8\\u00A7\\u00D8\\u00A8\\u00D9\\u0083\\u00D9\\u0084\\u00D9\\u008A\\u00D8\\u00A9\\u00D8\\u00A8\\u00D8\\u00AF\\u00D9\\u0088\\u00D9\\u0086\\u00D8\\u00A3\\u00D9\\u008A\\u00D8\\u00B6\\u00D8\\u00A7\\u00D9\\u008A\\u00D9\\u0088\\u00D8\\u00AC\\u00D8\\u00AF\\u00D9\\u0081\\u00D8\\u00B1\\u00D9\\u008A\\u00D9\\u0082\\u00D9\\u0083\\u00D8\\u00AA\\u00D8\\u00A8\\u00D8\\u00AA\\u00D8\\u00A3\\u00D9\\u0081\\u00D8\\u00B6\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00B7\\u00D8\\u00A8\\u00D8\\u00AE\\u00D8\\u00A7\\u00D9\\u0083\\u00D8\\u00AB\\u00D8\\u00B1\\u00D8\\u00A8\\u00D8\\u00A7\\u00D8\\u00B1\\u00D9\\u0083\\u00D8\\u00A7\\u00D9\\u0081\\u00D8\\u00B6\\u00D9\\u0084\\u00D8\\u00A7\\u00D8\\u00AD\\u00D9\\u0084\\u00D9\\u0089\\u00D9\\u0086\\u00D9\\u0081\\u00D8\\u00B3\\u00D9\\u0087\\u00D8\\u00A3\\u00D9\\u008A\\u00D8\\u00A7\\u00D9\\u0085\\u00D8\\u00B1\\u00D8\\u00AF\\u00D9\\u0088\\u00D8\\u00AF\\u00D8\\u00A3\\u00D9\\u0086\\u00D9\\u0087\\u00D8\\u00A7\\u00D8\\u00AF\\u00D9\\u008A\\u00D9\\u0086\\u00D8\\u00A7\\u00D8\\u00A7\\u00D9\\u0084\\u00D8\\u00A7\\u00D9\\u0086\\u00D9\\u0085\\u00D8\\u00B9\\u00D8\\u00B1\\u00D8\\u00B6\\u00D8\\u00AA\\u00D8\\u00B9\\u00D9\\u0084\\u00D9\\u0085\\u00D8\\u00AF\\u00D8\\u00A7\\u00D8\\u00AE\\u00D9\\u0084\\u00D9\\u0085\\u00D9\\u0085\\u00D9\\u0083\\u00D9\\u0086\\u0000\\u0000\\u0000\\u0000\\u0000\\u0000\\u0000\\u0000\\u0001\\u0000\\u0001\\u0000\\u0001\\u0000\\u0001\\u0000\\u0002\\u0000\\u0002\\u0000\\u0002\\u0000\\u0002\\u0000\\u0004\\u0000\\u0004\\u0000\\u0004\\u0000\\u0004\\u0000\\u0000\\u0001\\u0002\\u0003\\u0004\\u0005\\u0006\\u0007\\u0007\\u0006\\u0005\\u0004\\u0003\\u0002\\u0001\\u0000\\u0008\\t\\n\\u000B\\u000C\\r\\u000E\\u000F\\u000F\\u000E\\r\\u000C\\u000B\\n\\t\\u0008\\u0010\\u0011\\u0012\\u0013\\u0014\\u0015\\u0016\\u0017\\u0017\\u0016\\u0015\\u0014\\u0013\\u0012\\u0011\\u0010\\u0018\\u0019\\u001A\\u001B\\u001C\\u001D\\u001E\\u001F\\u001F\\u001E\\u001D\\u001C\\u001B\\u001A\\u0019\\u0018\\u00FF\\u00FF\\u00FF\\u00FF\\u0000\\u0000\\u0000\\u0000\\u0000\\u0000\\u0000\\u0000\\u00FF\\u00FF\\u00FF\\u00FF\\u0001\\u0000\\u0000\\u0000\\u0002\\u0000\\u0000\\u0000\\u0002\\u0000\\u0000\\u0000\\u0001\\u0000\\u0000\\u0000\\u0001\\u0000\\u0000\\u0000\\u0003\\u0000\\u0000\\u0000\\u00FF\\u00FF\\u0000\\u0001\\u0000\\u0000\\u0000\\u0001\\u0000\\u0000\\u00FF\\u00FF\\u0000\\u0001\\u0000\\u0000\\u0000\\u0008\\u0000\\u0008\\u0000\\u0008\\u0000\\u0008\\u0000\\u0000\\u0000\\u0001\\u0000\\u0002\\u0000\\u0003\\u0000\\u0004\\u0000\\u0005\\u0000\\u0006\\u0000\\u0007resourcescountriesquestionsequipmentcommunityavailablehighlightDTD/xhtmlmarketingknowledgesomethingcontainerdirectionsubscribeadvertisecharacter\\\" value=\\\"</select>Australia\\\" class=\\\"situationauthorityfollowingprimarilyoperationchallengedevelopedanonymousfunction functionscompaniesstructureagreement\\\" title=\\\"potentialeducationargumentssecondarycopyrightlanguagesexclusivecondition</form>\\r\\nstatementattentionBiography} else {\\nsolutionswhen the Analyticstemplatesdangeroussatellitedocumentspublisherimportantprototypeinfluence»</effectivegenerallytransformbeautifultransportorganizedpublishedprominentuntil thethumbnailNational .focus();over the migrationannouncedfooter\\\">\\nexceptionless thanexpensiveformationframeworkterritoryndicationcurrentlyclassNamecriticismtraditionelsewhereAlexanderappointedmaterialsbroadcastmentionedaffiliate</option>treatmentdifferent/default.Presidentonclick=\\\"biographyotherwisepermanentFran\\u00C3\\u00A7aisHollywoodexpansionstandards</style>\\nreductionDecember preferredCambridgeopponentsBusiness confusion>\\n<title>presentedexplaineddoes not worldwideinterfacepositionsnewspaper</table>\\nmountainslike the essentialfinancialselectionaction=\\\"/abandonedEducationparseInt(stabilityunable to\\nrelationsNote thatefficientperformedtwo yearsSince thethereforewrapper\\\">alternateincreasedBattle ofperceivedtrying tonecessaryportrayedelectionsElizabethdiscoveryinsurances.length;legendaryGeographycandidatecorporatesometimesservices.inheritedCommunityreligiouslocationsCommitteebuildingsthe worldno longerbeginningreferencecannot befrequencytypicallyinto the relative;recordingpresidentinitiallytechniquethe otherit can beexistenceunderlinethis timetelephoneitemscopepracticesadvantage);return For otherprovidingdemocracyboth the extensivesufferingsupportedcomputers functionpracticalsaid thatit may beEnglish\\nsuspectedmargin: 0spiritual\\n\\nmicrosoftgraduallydiscussedhe becameexecutivejquery.jshouseholdconfirmedpurchasedliterallydestroyedup to thevariationremainingit is notcenturiesJapanese among thecompletedalgorithminterestsrebellionundefinedencourageresizableinvolvingsensitiveuniversalprovision(althoughfeaturingconducted), which continued-header\\\">February numerous overflow:componentfragmentsexcellentcolspan=\\\"technicalnear the Advanced source ofexpressedHong Kong Facebookmultiple mechanismelevationoffensive\\n\\tsponsoreddocument.or "there arethose whomovementsprocessesdifficultsubmittedrecommendconvincedpromoting\\\" width=\\\".replace(classicalcoalitionhis firstdecisionsassistantindicatedevolution-wrapper\\\"enough toalong thedelivered-->\\r\\n\\n\\r\\n
Archbishop class=\\\"nobeing usedapproachesprivilegesnoscript>\\nresults inmay be theEaster eggmechanismsreasonablePopulationCollectionselected\\\">noscript>\\r/index.phparrival of-jssdk'));managed toincompletecasualtiescompletionChristiansSeptember arithmeticproceduresmight haveProductionit appearsPhilosophyfriendshipleading togiving thetoward theguaranteeddocumentedcolor:#000video gamecommissionreflectingchange theassociatedsans-serifonkeypress; padding:He was theunderlyingtypically , and the srcElementsuccessivesince the should be networkingaccountinguse of thelower thanshows that\\n\\t\\tcomplaintscontinuousquantitiesastronomerhe did notdue to itsapplied toan averageefforts tothe futureattempt toTherefore,capabilityRepublicanwas formedElectronickilometerschallengespublishingthe formerindigenousdirectionssubsidiaryconspiracydetails ofand in theaffordablesubstancesreason forconventionitemtype=\\\"absolutelysupposedlyremained aattractivetravellingseparatelyfocuses onelementaryapplicablefound thatstylesheetmanuscriptstands for no-repeat(sometimesCommercialin Americaundertakenquarter ofan examplepersonallyindex.php?\\npercentagebest-knowncreating a\\\" dir=\\\"ltrLieutenant\\n
is said tostructuralreferendummost oftena separate->\\n
soundtracksearchFormtend to beinput id=\\\"opening ofrestrictedadopted byaddressingtheologianmethods ofvariant ofChristian very largeautomotiveby far therange frompursuit offollow thebrought toin Englandagree thataccused ofcomes frompreventingdiv style=his or hertremendousfreedom ofconcerning0 1em 1em;Basketball/style.cssan earliereven after/\\\" title=\\\".com/indextaking thepittsburghcontent\\\">\\rimplementedcan be seenthere was ademonstratecontainer\\\">connectionsthe Britishwas written!important;px; margin-followed byability to complicatedduring the immigrationalso called

\\n

acquisitioncalled the persecutiondesignation{font-size:appeared ininvestigateexperiencedmost likelywidely useddiscussionspresence of (document.extensivelyIt has beenit does notcontrary toinhabitantsimprovementscholarshipconsumptioninstructionfor exampleone or morepx; paddingthe currenta series ofare usuallyrole in thepreviously derivativesevidence ofexperiencescolorschemestated thatcertificate
\\n selected=\\\"high schoolresponse tocomfortableadoption ofthree yearsthe countryin Februaryso that thepeople who provided by\\nhaving been\\r\\n\\r\\n< "The compilationhe had beenproduced byphilosopherconstructedintended toamong othercompared toto say thatEngineeringa differentreferred todifferencesbelief thatphotographsidentifyingHistory of Republic ofnecessarilyprobabilitytechnicallyleaving thespectacularfraction ofelectricityhead of therestaurantspartnershipemphasis onmost recentshare with saying thatfilled withdesigned toit is often\\\">as follows:merged withthrough thecommercial pointed outopportunityview of therequirementdivision ofprogramminghe receivedsetInterval\\\">maintainingChristopherMuch of thewritings of\\\" height=\\\"2size of theversion of mixture of between theExamples ofeducationalcompetitive onsubmit=\\\"director ofdistinctive/DTD XHTML relating totendency toprovince ofwhich woulddespite thescientific legislature.innerHTML allegationsAgriculturewas used inapproach tointelligentyears later,sans-serifdeterminingPerformanceappearances, which is foundationsabbreviatedhigher thans from the individual composed ofsupposed toclaims thatattributionfont-size:1elements ofHistorical his brotherat the timeanniversarygoverned byrelated to ultimately innovationsit is stillcan only bedefinitionstoGMTStringA number ofimg class=\\\"Eventually,was changedoccurred inneighboringdistinguishwhen he wasintroducingterrestrialMany of theargues thatan Americanconquest ofwidespread were killedscreen and In order toexpected todescendantsare locatedlegislativegenerations backgroundmost peopleyears afterthere is nothe highestfrequently they do notargued thatshowed thatpredominanttheologicalby the timeconsideringshort-livedcan be usedvery littleone of the had alreadyinterpretedcommunicatefeatures ofgovernment,entered the\\\" height=\\\"3Independentpopulationslarge-scale. Although used in thedestructionpossibilitystarting intwo or moreexpressionssubordinatelarger thanhistory and\\r\\nContinentaleliminatingwill not bepractice ofin front ofsite of theensure thatto create amississippipotentiallyoutstandingbetter thanwhat is nowsituated inmeta name=\\\"TraditionalsuggestionsTranslationthe form ofatmosphericideologicalenterprisescalculatingeast of theremnants ofpluginspage/index.php?remained intransformedHe was alsowas alreadystatisticalin favor ofMinistry ofmovement offormulationis required\\nquestion ofwas electedto become abecause of some peopleinspired bysuccessful a time whenmore commonamongst thean officialwidth:100%;technology,was adoptedto keep thesettlementslive birthsindex.html\\\"Connecticutassigned to&times;account foralign=rightthe companyalways beenreturned toinvolvementBecause thethis period\\\" name=\\\"q\\\" confined toa result ofvalue=\\\"\\\" />is actuallyEnvironment\\r\\n\\r\\nConversely,>\\n
this is notthe presentif they areand finallya matter of\\r\\n\\t
\\r\\n\\r\\nfaster thanmajority ofafter whichcomparativeto maintainimprove theawarded theer\\\" class=\\\"frameborderrestorationin the sameanalysis oftheir firstDuring the continentalsequence offunction(){font-size: work on the\\nadopted theproperty ofdirected byeffectivelywas broughtchildren ofProgramminglonger thanmanuscriptswar againstby means ofand most ofsimilar to proprietaryoriginatingprestigiousgrammaticalexperience.to make theIt was alsois found incompetitorsin the U.S.replace thebrought thecalculationfall of thethe generalpracticallyin honor ofreleased inresidentialand some ofking of thereaction to1st Earl ofculture andprincipally\\n they can beback to thesome of hisexposure toare similarform of theaddFavoritecitizenshippart in thepeople within practiceto continue&minus;approved by the first allowed theand for thefunctioningplaying thesolution toheight=\\\"0\\\" in his bookmore than afollows thecreated thepresence in nationalistthe idea ofa characterwere forced class=\\\"btndays of thefeatured inshowing theinterest inin place ofturn of thethe head ofLord of thepoliticallyhas its ownEducationalapproval ofsome of theeach other,behavior ofand becauseand anotherappeared onrecorded inblack"may includethe world'scan lead torefers to aborder=\\\"0\\\" government winning theresulted in while the Washington,the subjectcity in the>\\r\\n\\t\\treflect theto completebecame moreradioactiverejected bywithout anyhis father,which couldcopy of theto indicatea politicalaccounts ofconstitutesworked witherof his lifeaccompaniedclientWidthprevent theLegislativedifferentlytogether inhas severalfor anothertext of thefounded thee with the is used forchanged theusually theplace wherewhereas the> \\nHowever thelead to the\\tThe currentthe site ofsubstantialexperience,in the Westthey shouldsloven\\u00C4\\u008Dinacomentariosuniversidadcondicionesactividadesexperienciatecnolog\\u00C3\\u00ADaproducci\\u00C3\\u00B3npuntuaci\\u00C3\\u00B3naplicaci\\u00C3\\u00B3ncontrase\\u00C3\\u00B1acategor\\u00C3\\u00ADasregistrarseprofesionaltratamientoreg\\u00C3\\u00ADstratesecretar\\u00C3\\u00ADaprincipalesprotecci\\u00C3\\u00B3nimportantesimportanciaposibilidadinteresantecrecimientonecesidadessuscribirseasociaci\\u00C3\\u00B3ndisponiblesevaluaci\\u00C3\\u00B3nestudiantesresponsableresoluci\\u00C3\\u00B3nguadalajararegistradosoportunidadcomercialesfotograf\\u00C3\\u00ADaautoridadesingenier\\u00C3\\u00ADatelevisi\\u00C3\\u00B3ncompetenciaoperacionesestablecidosimplementeactualmentenavegaci\\u00C3\\u00B3nconformidadline-height:font-family:\\\" : \\\"http://applicationslink\\\" href=\\\"specifically//\\n/index.html\\\"window.open( !important;application/independence//www.googleorganizationautocompleterequirementsconservative
most notably/>notification'undefined')Furthermore,believe thatinnerHTML = prior to thedramaticallyreferring tonegotiationsheadquartersSouth AfricaunsuccessfulPennsylvaniaAs a result,\\npadding-top:experimentalgetAttributeinstructionstechnologiespart of the =function(){subscriptionl.dtd\\\">\\r\\nEnglish (US)appendChild(transmissions. However, intelligence\\\" tabindex=\\\"float:right;Commonwealthranging fromin which theat least onereproductionencyclopedia;font-size:1jurisdictionat that time\\\">compensationchampionshipmedia=\\\"all\\\" violation ofreference toreturn true;Strict//EN\\\" transactionsinterventionverificationInformation difficultiesChampionshipcapabilities}\\n\\nChristianityfor example,Professionalrestrictionssuggest thatwas released(such as theremoveClass(unemploymentthe Americanstructure of/index.html published inspan class=\\\"\\\">\\n\\nf (document.border: 1px {font-size:1treatment of0\\\" height=\\\"1modificationIndependencedivided intogreater thanachievementsestablishingJavaScript\\\" neverthelesssignificanceBroadcasting> container\\\">\\nsuch as the influence ofa particularsrc='http://navigation\\\" half of the substantial  advantage ofdiscovery offundamental metropolitanthe opposite\\\" xml:lang=\\\"deliberatelyalign=centerevolution ofpreservationimprovementsbeginning inJesus ChristPublicationsdisagreementtext-align:r, function()similaritiesbody>is currentlyalphabeticalis sometimestype=\\\"image/many of the flow:hidden;available indescribe theexistence ofall over thethe Internet\\t