From 67c44bc746a4e35059d92f367d807b44e1f0c6ce Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=94=B0=E5=B2=A9?= Date: Mon, 1 Dec 2025 21:00:54 +0800 Subject: [PATCH] x --- CosyVoice V2/教程.txt | 7 +- python/.idea/misc.xml | 2 +- python/.idea/python.iml | 2 +- python/WebSocketFrameHeader.py | 223 + python/__pycache__/asr_client.cpython-310.pyc | Bin 0 -> 7333 bytes .../__pycache__/frontend_ws.cpython-310.pyc | Bin 0 -> 6738 bytes python/__pycache__/llm_client.cpython-310.pyc | Bin 0 -> 4827 bytes python/__pycache__/main.cpython-310.pyc | Bin 0 -> 2675 bytes .../session_manager.cpython-310.pyc | Bin 0 -> 2438 bytes python/__pycache__/tts_client.cpython-310.pyc | Bin 0 -> 20128 bytes .../ws_message_manager.cpython-310.pyc | Bin 0 -> 4319 bytes python/frontend_ws.py | 66 +- python/llm_client.py | 4 +- python/protocols/__init__.py | 41 + .../__pycache__/__init__.cpython-310.pyc | Bin 0 -> 636 bytes .../__pycache__/__init__.cpython-313.pyc | Bin 0 -> 691 bytes .../__pycache__/protocols.cpython-310.pyc | Bin 0 -> 15125 bytes .../__pycache__/protocols.cpython-313.pyc | Bin 0 -> 26949 bytes python/protocols/protocols.py | 543 ++ python/tts_client-本地tts.py | 551 ++ python/tts_client.py | 773 +- python/tts_output_33cfc4e1.pcm | Bin 0 -> 304640 bytes python/tts_output_46c5a16f.pcm | Bin 0 -> 148154 bytes python/tts_output_4cafe62e.mp3 | Bin 0 -> 39213 bytes python/tts_output_83430d06.pcm | Bin 0 -> 74000 bytes python/tts_output_ab2c61fb.pcm | Bin 0 -> 156952 bytes python/tts_output_c5f4106a.mp3 | Bin 0 -> 39501 bytes python/tts_output_cb0e0ad4.pcm | Bin 0 -> 185524 bytes volcengine_bidirection_demo/.idea/.gitignore | 5 + .../inspectionProfiles/Project_Default.xml | 12 + .../inspectionProfiles/profiles_settings.xml | 6 + volcengine_bidirection_demo/.idea/misc.xml | 7 + volcengine_bidirection_demo/.idea/modules.xml | 8 + volcengine_bidirection_demo/.idea/vcs.xml | 6 + .../.idea/volcengine_bidirection_demo.iml | 14 + .../examples/volcengine/bidirection.py | 169 + .../protocols/__init__.py | 41 + .../__pycache__/__init__.cpython-313.pyc | Bin 0 -> 691 bytes .../__pycache__/protocols.cpython-313.pyc | Bin 0 -> 26949 bytes .../protocols/protocols.py | 543 ++ volcengine_bidirection_demo/pyproject.toml | 11 + volcengine_bidirection_demo/setup.py | 13 + .../volc_speech_python_sdk.egg-info/PKG-INFO | 6 + .../SOURCES.txt | 9 + .../dependency_links.txt | 1 + .../requires.txt | 1 + .../top_level.txt | 1 + .../node_modules/.package-lock.json | 20 + .../node_modules/@types/pako/LICENSE | 21 + .../node_modules/@types/pako/README.md | 15 + .../node_modules/@types/pako/index.d.ts | 161 + .../node_modules/@types/pako/package.json | 36 + 测试流式传输uniapp/node_modules/pako/LICENSE | 21 + .../node_modules/pako/README.md | 177 + .../node_modules/pako/dist/pako.es5.js | 6688 ++++++++++++++++ .../node_modules/pako/dist/pako.es5.min.js | 2 + .../node_modules/pako/dist/pako.esm.mjs | 6877 ++++++++++++++++ .../node_modules/pako/dist/pako.js | 6896 +++++++++++++++++ .../node_modules/pako/dist/pako.min.js | 2 + .../pako/dist/pako_deflate.es5.js | 3924 ++++++++++ .../pako/dist/pako_deflate.es5.min.js | 2 + .../node_modules/pako/dist/pako_deflate.js | 4126 ++++++++++ .../pako/dist/pako_deflate.min.js | 2 + .../pako/dist/pako_inflate.es5.js | 3229 ++++++++ .../pako/dist/pako_inflate.es5.min.js | 2 + .../node_modules/pako/dist/pako_inflate.js | 3239 ++++++++ .../pako/dist/pako_inflate.min.js | 2 + 测试流式传输uniapp/node_modules/pako/index.js | 18 + .../node_modules/pako/lib/deflate.js | 380 + .../node_modules/pako/lib/inflate.js | 419 + .../node_modules/pako/lib/utils/common.js | 48 + .../node_modules/pako/lib/utils/strings.js | 174 + .../node_modules/pako/lib/zlib/README | 59 + .../node_modules/pako/lib/zlib/adler32.js | 51 + .../node_modules/pako/lib/zlib/constants.js | 68 + .../node_modules/pako/lib/zlib/crc32.js | 59 + .../node_modules/pako/lib/zlib/deflate.js | 2048 +++++ .../node_modules/pako/lib/zlib/gzheader.js | 58 + .../node_modules/pako/lib/zlib/inffast.js | 344 + .../node_modules/pako/lib/zlib/inflate.js | 1572 ++++ .../node_modules/pako/lib/zlib/inftrees.js | 340 + .../node_modules/pako/lib/zlib/messages.js | 32 + .../node_modules/pako/lib/zlib/trees.js | 1179 +++ .../node_modules/pako/lib/zlib/zstream.js | 47 + .../node_modules/pako/package.json | 64 + 测试流式传输uniapp/package-lock.json | 28 + 测试流式传输uniapp/package.json | 8 + .../pages/index/ProtocolCodec.ts | 338 + .../pages/index/index - 副本.vue | 237 + 测试流式传输uniapp/pages/index/index.vue | 10 +- .../sdx-StreamPlayer/sdx-StreamPlayer.vue | 23 +- .../sdx-StreamPlayer/plugins/StreamPlayer.js | 1 + .../yao-RecordFrame/yao-RecordFrame.vue | 1 - .../dist/dev/app-plus/app-renderjs.js | 4 +- .../dist/dev/app-plus/app-service.js | 56 +- .../.app-plus/tsc/app-android/.tsbuildInfo | 2 +- .../cache/.app-plus/tsc/app-ios/.tsbuildInfo | 1 + 97 files changed, 45781 insertions(+), 395 deletions(-) create mode 100644 python/WebSocketFrameHeader.py create mode 100644 python/__pycache__/asr_client.cpython-310.pyc create mode 100644 python/__pycache__/frontend_ws.cpython-310.pyc create mode 100644 python/__pycache__/llm_client.cpython-310.pyc create mode 100644 python/__pycache__/main.cpython-310.pyc create mode 100644 python/__pycache__/session_manager.cpython-310.pyc create mode 100644 python/__pycache__/tts_client.cpython-310.pyc create mode 100644 python/__pycache__/ws_message_manager.cpython-310.pyc create mode 100644 python/protocols/__init__.py create mode 100644 python/protocols/__pycache__/__init__.cpython-310.pyc create mode 100644 python/protocols/__pycache__/__init__.cpython-313.pyc create mode 100644 python/protocols/__pycache__/protocols.cpython-310.pyc create mode 100644 python/protocols/__pycache__/protocols.cpython-313.pyc create mode 100644 python/protocols/protocols.py create mode 100644 python/tts_client-本地tts.py create mode 100644 python/tts_output_33cfc4e1.pcm create mode 100644 python/tts_output_46c5a16f.pcm create mode 100644 python/tts_output_4cafe62e.mp3 create mode 100644 python/tts_output_83430d06.pcm create mode 100644 python/tts_output_ab2c61fb.pcm create mode 100644 python/tts_output_c5f4106a.mp3 create mode 100644 python/tts_output_cb0e0ad4.pcm create mode 100644 volcengine_bidirection_demo/.idea/.gitignore create mode 100644 volcengine_bidirection_demo/.idea/inspectionProfiles/Project_Default.xml create mode 100644 volcengine_bidirection_demo/.idea/inspectionProfiles/profiles_settings.xml create mode 100644 volcengine_bidirection_demo/.idea/misc.xml create mode 100644 volcengine_bidirection_demo/.idea/modules.xml create mode 100644 volcengine_bidirection_demo/.idea/vcs.xml create mode 100644 volcengine_bidirection_demo/.idea/volcengine_bidirection_demo.iml create mode 100644 volcengine_bidirection_demo/examples/volcengine/bidirection.py create mode 100644 volcengine_bidirection_demo/protocols/__init__.py create mode 100644 volcengine_bidirection_demo/protocols/__pycache__/__init__.cpython-313.pyc create mode 100644 volcengine_bidirection_demo/protocols/__pycache__/protocols.cpython-313.pyc create mode 100644 volcengine_bidirection_demo/protocols/protocols.py create mode 100644 volcengine_bidirection_demo/pyproject.toml create mode 100644 volcengine_bidirection_demo/setup.py create mode 100644 volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/PKG-INFO create mode 100644 volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/SOURCES.txt create mode 100644 volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/dependency_links.txt create mode 100644 volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/requires.txt create mode 100644 volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/top_level.txt create mode 100644 测试流式传输uniapp/node_modules/.package-lock.json create mode 100644 测试流式传输uniapp/node_modules/@types/pako/LICENSE create mode 100644 测试流式传输uniapp/node_modules/@types/pako/README.md create mode 100644 测试流式传输uniapp/node_modules/@types/pako/index.d.ts create mode 100644 测试流式传输uniapp/node_modules/@types/pako/package.json create mode 100644 测试流式传输uniapp/node_modules/pako/LICENSE create mode 100644 测试流式传输uniapp/node_modules/pako/README.md create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako.es5.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako.es5.min.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako.esm.mjs create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako.min.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.min.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_deflate.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_deflate.min.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.min.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_inflate.js create mode 100644 测试流式传输uniapp/node_modules/pako/dist/pako_inflate.min.js create mode 100644 测试流式传输uniapp/node_modules/pako/index.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/deflate.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/inflate.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/utils/common.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/utils/strings.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/README create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/adler32.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/constants.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/crc32.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/deflate.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/gzheader.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/inffast.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/inflate.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/inftrees.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/messages.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/trees.js create mode 100644 测试流式传输uniapp/node_modules/pako/lib/zlib/zstream.js create mode 100644 测试流式传输uniapp/node_modules/pako/package.json create mode 100644 测试流式传输uniapp/package-lock.json create mode 100644 测试流式传输uniapp/package.json create mode 100644 测试流式传输uniapp/pages/index/ProtocolCodec.ts create mode 100644 测试流式传输uniapp/pages/index/index - 副本.vue create mode 100644 测试流式传输uniapp/unpackage/dist/dev/cache/.app-plus/tsc/app-ios/.tsbuildInfo diff --git a/CosyVoice V2/教程.txt b/CosyVoice V2/教程.txt index 269e901..471bb7a 100644 --- a/CosyVoice V2/教程.txt +++ b/CosyVoice V2/教程.txt @@ -3,4 +3,9 @@ https://www.bilibili.com/video/BV1pnkFYmEAE/?spm_id_from=333.337.search-card.all 根目录进入 cd CosyVoice 启动虚拟环境 -conda activate CosyVoice_V2 \ No newline at end of file + +conda activate CosyVoice_V2 + + +5. 仅返回最终答案/结果，禁止输出任何分析、推理、解释、步骤说明； +6. 结果需简洁为纯文本，最短五个字，最多30个字，无多余文字、标点、格式（如无需“答案：”“总结：”等前缀）； \ No newline at end of file diff --git a/python/.idea/misc.xml b/python/.idea/misc.xml index 6417301..9b734b6 100644 --- a/python/.idea/misc.xml +++ b/python/.idea/misc.xml @@ -3,5 +3,5 @@ - + \ No newline at end of file diff --git a/python/.idea/python.iml b/python/.idea/python.iml index bbda969..b4afc04 100644 --- a/python/.idea/python.iml +++ b/python/.idea/python.iml @@ -2,7 +2,7 @@ - + \ No newline at end of file diff --git a/python/WebSocketFrameHeader.py b/python/WebSocketFrameHeader.py new file mode 100644 index 0000000..45b7766 --- /dev/null +++ b/python/WebSocketFrameHeader.py @@ -0,0 +1,223 @@ +from enum import IntEnum +import struct +import json +import gzip +from typing import Optional, Union, Dict, Any, List + + +# -------------------------- 协议常量定义 -------------------------- +class ProtocolConst: + PROTOCOL_VERSION = 0b0001 # 协议版本v1 + HEADER_SIZE = 8 # 头部固定字节数（字节1~字节8） + MAX_BODY_SIZE = 1024 * 1024 * 10 # 最大包体大小（10MB，防止内存溢出） + STRING_ENCODING = "utf-8" # 字符串默认编码（统一编码格式，避免乱码） + + +# -------------------------- 枚举定义（业务约定） -------------------------- +class MessageType(IntEnum): + """消息类型（4位，字节1高4位）""" + PING = 0b0000 # 心跳 + AUDIO_DATA = 0b0001 # 纯音频数据(pcm) + TEXT_MESSAGE = 0b0010 # 纯文本消息 + AUDIO_TEXT_MIX = 0b0011 # 音频+文本混合数据 + CONTROL_CMD = 0b0100 # 控制指令（暂停/继续等） + +class SerializationType(IntEnum): + """序列化方式（4位，字节2高4位）""" + RAW = 0b0000 # 原始二进制（音频等） + JSON = 0b0001 # JSON格式（文本/指令） + STRING = 0b0010 # 直接字符串（纯文本，UTF-8编码，无JSON包装）🔴新增类型 + +class CompressionType(IntEnum): + """压缩方式（4位，字节2低4位）""" + NONE = 0b0000 # 无压缩 + GZIP = 0b0001 # gzip压缩 + +class ControlCommand(IntEnum): + """控制指令类型（配合MessageType.CONTROL_CMD使用）""" + HEARTBEAT = 0b0001 # 心跳响应 + PAUSE = 0b0010 # 暂停 + RESUME = 0b0011 # 继续 + STOP = 0b0100 # 停止 + +# -------------------------- 协议工具类 -------------------------- +class ProtocolCodec: + @staticmethod + def pack( + msg_type: MessageType, + body: Union[bytes, str, Dict[str, Any], List[Any]], + serialization: Optional[SerializationType] = None, + compression: CompressionType = CompressionType.NONE + ) -> bytes: + """ + 封装协议包（头部 + 包体） + :param msg_type: 消息类型 + :param body: 包体数据（bytes/str/dict/list） + :param serialization: 序列化方式（None时自动推导） + :param compression: 压缩方式 + :return: 完整协议包（bytes） + """ + # 1. 自动推导序列化方式（优化：纯文本消息自动用STRING，复杂结构用JSON）🔴修改推导逻辑 + if serialization is None: + if msg_type == MessageType.AUDIO_DATA: + serialization = SerializationType.RAW + elif msg_type == MessageType.TEXT_MESSAGE: # 纯文本消息→STRING + serialization = SerializationType.STRING + elif msg_type in (MessageType.CONTROL_CMD, MessageType.AUDIO_TEXT_MIX): # 复杂结构→JSON + serialization = SerializationType.JSON + else: + raise ValueError(f"不支持的消息类型：{msg_type}") + + # 2. 序列化包体（新增STRING类型处理）🔴新增分支 + serialized_body: bytes + if serialization == SerializationType.RAW: + if not isinstance(body, bytes): + raise TypeError("RAW序列化要求body必须是bytes类型") + serialized_body = body + elif serialization == SerializationType.STRING: + if not isinstance(body, str): + raise TypeError("STRING序列化要求body必须是str类型") + serialized_body = body.encode(ProtocolConst.STRING_ENCODING) # 直接UTF-8编码，无JSON包装 + elif serialization == SerializationType.JSON: + if isinstance(body, str): + serialized_body = body.encode(ProtocolConst.STRING_ENCODING) + elif isinstance(body, (dict, list)): + serialized_body = json.dumps(body, ensure_ascii=False, separators=(',', ':')).encode(ProtocolConst.STRING_ENCODING) + else: + raise TypeError("JSON序列化要求body必须是str/dict/list类型") + else: + raise ValueError(f"不支持的序列化方式：{serialization}") + + # 3. 压缩包体（不变） + compressed_body: bytes + if compression == CompressionType.GZIP: + compressed_body = gzip.compress(serialized_body) + elif compression == CompressionType.NONE: + compressed_body = serialized_body + else: + raise ValueError(f"不支持的压缩方式：{compression}") + + # 4. 校验包体大小（不变） + body_len = len(compressed_body) + if body_len > ProtocolConst.MAX_BODY_SIZE: + raise OverflowError(f"包体过大（{body_len}字节），最大支持{ProtocolConst.MAX_BODY_SIZE}字节") + + # 5. 构造头部（不变） + byte1 = (msg_type.value << 4) | 0x00 # 消息类型(4位) + 保留位1(4位) + byte2 = (serialization.value << 4) | (compression.value & 0x0F) # 序列化(4位) + 压缩(4位) + byte3_4 = struct.pack(">H", ProtocolConst.PROTOCOL_VERSION) # 协议版本(16位) + byte5_8 = struct.pack(">I", body_len) # 包体长度(32位) + header = bytes([byte1, byte2]) + byte3_4 + byte5_8 + assert len(header) == ProtocolConst.HEADER_SIZE, f"头部长度错误：实际{len(header)}字节，预期{ProtocolConst.HEADER_SIZE}字节" + + return header + compressed_body + + @staticmethod + def unpack(packet: bytes) -> tuple[MessageType, SerializationType, CompressionType, Any]: + """ + 解析协议包 + :param packet: 完整协议包（头部 + 包体） + :return: (消息类型, 序列化方式, 压缩方式, 原始包体数据) + """ + # 1. 校验包长度（不变） + if len(packet) < ProtocolConst.HEADER_SIZE: + raise ValueError(f"包长度过短（{len(packet)}字节），至少需要{ProtocolConst.HEADER_SIZE}字节头部") + + # 2. 解析头部（不变） + header = packet[:ProtocolConst.HEADER_SIZE] + body = packet[ProtocolConst.HEADER_SIZE:] + byte1 = header[0] + byte2 = header[1] + + msg_type = MessageType((byte1 >> 4) & 0x0F) + serialization = SerializationType((byte2 >> 4) & 0x0F) + compression = CompressionType(byte2 & 0x0F) + version = struct.unpack(">H", header[2:4])[0] + body_len = struct.unpack(">I", header[4:8])[0] + + if version != ProtocolConst.PROTOCOL_VERSION: + raise ValueError(f"协议版本不匹配：收到v{version}，支持v{ProtocolConst.PROTOCOL_VERSION}") + if len(body) != body_len: + raise ValueError(f"包体长度不匹配：头部声明{body_len}字节，实际{len(body)}字节") + + # 3. 解压包体（不变） + decompressed_body: bytes + if compression == CompressionType.GZIP: + try: + decompressed_body = gzip.decompress(body) + except Exception as e: + raise ValueError(f"GZIP解压失败：{str(e)}") + elif compression == CompressionType.NONE: + decompressed_body = body + else: + raise ValueError(f"不支持的压缩方式：{compression}") + + # 4. 反序列化包体（新增STRING类型处理）🔴新增分支 + original_body: Any + if serialization == SerializationType.RAW: + original_body = decompressed_body + elif serialization == SerializationType.STRING: + try: + original_body = decompressed_body.decode(ProtocolConst.STRING_ENCODING) # 直接UTF-8解码，无JSON解析 + except UnicodeDecodeError: + raise ValueError(f"STRING反序列化失败：{ProtocolConst.STRING_ENCODING}解码错误") + elif serialization == SerializationType.JSON: + try: + original_body = json.loads(decompressed_body.decode(ProtocolConst.STRING_ENCODING)) + except UnicodeDecodeError: + raise ValueError(f"JSON反序列化失败：{ProtocolConst.STRING_ENCODING}解码错误") + except json.JSONDecodeError: + raise ValueError("JSON反序列化失败：格式错误") + else: + raise ValueError(f"不支持的序列化方式：{serialization}") + + return msg_type, serialization, compression, original_body + + +# -------------------------- 使用示例（新增纯字符串消息测试） -------------------------- +if __name__ == "__main__": + # 示例1：纯文本消息（自动用STRING序列化，无JSON包装）🔴测试新增类型 + text_body = "你好，这是纯字符串消息（无JSON）" + text_packet = ProtocolCodec.pack( + msg_type=MessageType.TEXT_MESSAGE, + body=text_body, + compression=CompressionType.NONE + ) + print(f"纯文本消息包长度：{len(text_packet)}字节") + msg_type1, ser1, comp1, body1 = ProtocolCodec.unpack(text_packet) + print(f"解析结果：类型={msg_type1.name}，序列化={ser1.name}，压缩={comp1.name}，内容={body1}\n") + + # 示例2：控制指令（JSON序列化，复杂结构） + control_body = {"cmd": ControlCommand.HEARTBEAT.value, "timestamp": 1699999999} + control_packet = ProtocolCodec.pack( + msg_type=MessageType.CONTROL_CMD, + body=control_body, + compression=CompressionType.NONE + ) + print(f"控制指令包长度：{len(control_packet)}字节") + msg_type2, ser2, comp2, body2 = ProtocolCodec.unpack(control_packet) + print(f"解析结果：类型={msg_type2.name}，序列化={ser2.name}，压缩={comp2.name}，内容={body2}\n") + + # 示例3：音频数据（RAW序列化） + audio_body = b"\x00\x01\x02\x03\x04\x05" * 100 # 模拟PCM数据 + audio_packet = ProtocolCodec.pack( + msg_type=MessageType.AUDIO_DATA, + body=audio_body, + compression=CompressionType.NONE + ) + print(f"音频数据包长度：{len(audio_packet)}字节") + msg_type3, ser3, comp3, body3 = ProtocolCodec.unpack(audio_packet) + print(f"解析结果：类型={msg_type3.name}，序列化={ser3.name}，压缩={comp3.name}，数据长度={len(body3)}字节\n") + + # 示例4：混合数据（JSON序列化） + mix_body = { + "audio_data": list(audio_body[:10]), + "text_content": "混合数据仍用JSON" + } + mix_packet = ProtocolCodec.pack( + msg_type=MessageType.AUDIO_TEXT_MIX, + body=mix_body + ) + print(f"混合数据包长度：{len(mix_packet)}字节") + msg_type4, ser4, comp4, body4 = ProtocolCodec.unpack(mix_packet) + print(f"解析结果：类型={msg_type4.name}，序列化={ser4.name}，压缩={comp4.name}，内容={body4}") \ No newline at end of file diff --git a/python/__pycache__/asr_client.cpython-310.pyc b/python/__pycache__/asr_client.cpython-310.pyc new file mode 100644 index 0000000000000000000000000000000000000000..67f82db183347c1c71e47a7315f95e6c9fd44b78 GIT binary patch literal 7333 zcmbtZ`*#%AeZO~JJ3G5t2_Xc+*ddM|+1A0vr#($6#iqj8P7~SXQQ|G`c(ivUR@xVL zW)V_WK5_&>P7TEMgVx4a@-cOsQ!sXVVkhAEhx`xyVSekWSD^Gk+8>%U54)f5on2{H zhV=AwVeZ_ykMG>M_w)UHAF6b9ISjwVPwy#gxt+0prib=l3J(wB3N~@Z_A|i*FS1;G z=Q*yPwVZ~#R@6&I&M28Vvt;G0QX-cq**TljSiP7mIXS14%BApZ2vb-hA?&k8E-jM6 z5vfro(r<9lg`SM)7CmB(=soM?y8MK1jdI@>e1MH;11y*EorjrNEBcNx(KoBj@?7^Q z^Ll*K?;c?O8nJFW^Vxjw0?Vxx{k}o1Bbrz*HXJi@ePTdtJjQbC+Insgo6yrQZuPsx zZT@=nY#6b`=fq~T4v5eD-I#s5_yV3bsxf!?nGr+WDegkcE#hwRMabJE_+FOHF44XX zWzEQbtQr<7Wv>_+Uo8Y-Wb7*B!^j@=ibZd@=ts$&6J8;tYF3Mq!VA58(F=me94Yuk zQJC4m*b;V|EomqU%wQ~QM5(|lRg1nWz0i;B{2{Mg_KQI--E5vHi11M4j7YEKyFp>f zpGt4NZ%h3D{`>APRPSaiXWn1Md$RhHNz&=yWrm7w6cJm}TMdOCjLtfdai~JeuT~_= zQbqWYlRs1|kE<6%nYdmkhrT?5k4@A9-z|jY$UamFCn{0|(OT)}D_CegbW7e*H!PI= zAWBv%m0~QS$E%4##XVf}Yw@b{SVG5-*7P8*;0Owz5#n+haL9AI&~gUO-5N{aeQDwg&BKYDc|SwXUTaTDve)!^vi% zuAO`L48|XVgROlLYeCEAYag9kJaxYD&JVA>yKw!=T;p5EuYP!O>Gkg~z483g-@M+K zJ9GWYvqO(!A$behvph;*gX!F}dX(^j$#T9>iOfHvjg1_v)g63nX!oNJzs=;G7_W+7ZXMiq zaDU*-;NaGSyZm50tW*z%eh}`YLpfNT3=dVx2faYL`C`E@hg+&x{q~|)8W!G;EG>!f z*~6y#J9cNw@(><%3xC9`6+?H#%ZC*?8Kv3|JaPiO(e;l&cD66FUAIi&btA`h0k#^z z?nY@B=V>1BZVx6xE%7(kStBT<{_SqGG*O^@_-@^&h|Kpo~ov_|eT z@Kw+$Y6jI_Gp6~}j!+xZ>s*+lJf_u?#-mJFkFaU2uGN`qh$KogwB{3-=L|5EDOIL{ zqb`xea|X{g?x4$A9wtQ(de)q^7x=VZ*XEtNzQALdoP{aTJIgt%vjc1|$SF)u7CDX=88mKEWqgc3q9Ow=wr>!2TpfUGakH;lJeD@Re-=78Dl}E9GRk4ss{3YYDw?hzw6P*+{btB+4;4-krDW1 z5t&tq-H4J89nJg7K9Qwrp)v=~kZw&Dl-QhIC>KE4!Dz(&HpCOyqjh=d!v?vnsUUak z7`--t;bPj1rETDvW^j$urSbHyEz9DDZgKiYEf#lh*}v#=1UJ!wuW6@Okk3~QsdJImEZz&+5m+!t|o^%*$Zi*PLRl~Q%bUyvx0 z+smdtua1olhVTp`uH?O9umhFW=%Jf0hZI3ACo#?Id<^tj=bcL;u)VFxUARRC!En{G zNJ^hSEoFJpVm&u3T>uW@7H>GhWB$h zgoX~((IF*q{RCI=k0=Orzeh;okFZw`fZH^o1945H)nPK~a6bkJWoDhb*t;=(-dJGZ zNq&H7m}daSvwAFn0|B8Ka&WCBtN}L8{A0`JaWJN16!^vhS@{?XEz_u|Ii zf*CS=3NucOnSj2VuSSlh%x!FFAI6MTC!}B_(5}p<#T0LRVrbeYV2V$tes|Ol-GYEO z(8)MAg17Ri_9?xq(b_t|w|Hj0{j;*ErY8z58CRf+mq}JWGV?{>lk!h#wTgQOsixT0 z@~SW;LV+}^=Nz>(!e1aCp{aJ+pKx!W9nt!me29lx0lih5$!J87)~AL+#OR>j|MQ+y z8ujMW&+J}}-}i5l2t@9r*EzAFQBefZK*+nRr zf`340t#d*dFa#QcT{p+9$vb1bgbAS&!eGTQ9+umvku6v}{nw4-=VON#%DZ^-Vq@-- z;=`sZteoK8`)XS-n9iczH*UQD-r{Ar&Ch-O!5fV$vyBg5Xgqr|9?-8@)N9VO~4++qvbl(lEFcg4%{kTk;K6;Enw2d9AT~}N6>mr z9ZT4?OdUksNx3h~%y-ur+&3s>n5k>qS@{p^I8>VX2cRR@Dc{v5*_0EQ(L*!f;H6_a zxiOji|67;o=-dtHXbrY|>BP4eU;MGcQImmoOY)*(Z}HM=*WP()>BLENwGBb|wfOf7 zu?3OD+%-BU#9ym|wRmDY^xDjs#-$I*V!!|1)weD${q39CHS#e`Ya;@E8F!{%s)m!1 zLt5MpKS#muA?jR-C1TQ0c1$scvRP)KEc~P7^_MC~5U43^$vt=>LJx6tHCX$l4-!I5 z-N}2$F+TV*ikL1O?r0h?n;~!OQ|C8*RzE@yq6>%jz_X%z-@j_TegCel>AS9VZ}|`T z6ul9FXF!n|JcQz~mmkl!lZS;7lo^=C6{Ho$=a{tSKpsKw92ao2gnkxIKFpc%2pJPN z_9xg0j%*2XJICy4t@(s351w=cDIlD>HcOZ^R9#nf7{PhHZq&^MttIOKs~b(zX~y@d zbe%#P^`^Snsx>u;kC~JEmo*4sMTm8FuI&FTZ~Er)Kz_;EMeK{S8NbGx$F6?oTMCCu zGp~I75v2jHUVdTm+*v$c`{+dD)pOS_%{ESa2xMOS=tVpNl4|C*s)t<7=GNJ6Yr}G! zP-q{u>a4bHZe021;)V0=(#e-Pb$;>1A1Fcb8X6bQG>(6u1l5S;U;!Ja-?{qYciUbj zDX;K0JSliq6&V?!e>5D*qiy*|z@S{w3%G*+MDYwKAk1@6T7a4+Yg2cUuZ_A%m(dUyQjx8}(k>WOxqCVzKez|o7hv7MesmVi#F+omv z6H#EB&pyXo4Un|Lt~&fF^5s=(F$SlSiubbl%z}~+3kEq)BaMVeRMjXFRU_zoCTOKW zGVY}j@s&*ujpD=c``H7OYoSCI;>gi&^j&=TpQgeGYLt&?oPK_3=9#7iYuUl&NUlcF zX0uZbY_z)63CLk|XS?GZ!+z9bF1a1G2*D+^DjVrgv>4mS3+M@`QJd+3 zFR~F-(u+XNm?5$u%CY!uXoJC=(SEi07gP5jE4kvRl}fd8A+J&{E56!_@D7Yogtv^b zuQv&&iLt+CSL`Tb%o@FNY(Y_=(8my4TBA{u8@3Fc?XolY5i%viDc9|ko>)yAh~Nu zlCP~m7bR6jHbiDwB{)=aas*kG;_j>&4xm1&DRZaz_nvA4U7g;3nD|&)~`6JC) zKSo!u9Yw4tJy41sQWV%`vcKfWTfgeHk>h~M^x>Jj%vI|1)2T20@9NX`PQ=M73#uq0 z)lAAzI4r+{g+x}~E9d=Ulo?d_qAy}*cnY0at4;GuXpl9Ul2pn`B63OfA|*|IvHEsJ z4;yZ_$a4_U^h=y1dD9s^vqrm(5}|$E)@#YbZ)s?Z0L61UKcqQ99;dFr=Az$Y3|p+(~Ttx%>vrzf}b?3eYirt#Fdk zmny?8b&^d4DNQQKH;Yose>L(0nV@Eh_2eH@LGfyC4HR*Y0x$j9i5$E*k*JnWc^Uj| zisD}7?hewlAu1@YjLhLl{24%H65|-?De9urQOj-n&J}I2x5p{_9du>^AvJ2|b>F+YSS+4=ij*iyhV`%wOO|6hc3M_-qEJfhjwGj{GD@~eF%Wi1K>`-g z-CfaOK@DXpCg_Nk9LMon1`}y)k89I;IjY6fU)p}@O#gtL>6cc3q)(d3hfc?1Tm7B8 zAV^V4M!?|WzRrD|d(Q9t?kyz}Q3;>_J^4`n|F%og|4?D&M?v9R_&NW;BXvMG*F6xF})C^73sfCCUMc+^%R*W0*V!}uilSZ=G zVRRHbjZV==D|8jRjqYNP(bJOYHF_bV7SVrAd!dhb;%Hh^r zG!M-;Utfu|-Hn3R{c! z8TS?MH|{S!U_4Mv8|mVM#)G0QTG&?HZfs}Lm}ESZmy8|O!`9a8KjFECRfN?w!1$a z^7UuRRGlsO>h65b_4Q#$W)BxEKeB5)n|DQ4-J5r4-iVoXv$;anas1F|-YS^s5RYKd zJVptblCSKtD}H3S#7mx=w=JxtbKJ=s_bkuK6ti}A%;J7xSWLgq89PuZTYh51;#gm+ zh&3hhcHYfo9iAzdN(H}v%yKh%vtWs;mKJC$Yma2@pnzup>?)2m5b-lE~3-8b9ZA_{b?% z)9cc_^fdhADTzrgtIIWgo*}2y^l3ILn{rKlQ+ivT4ZAAU1U)C28>(xjLT#q{wn7rM z@TBa9kLqT~)aKZ1$Yhg>$!1aSMouvPq#Lb;&9JG@$!??;-YHSKPMTHR*t9gOnGrW` zM%{!Pcavmwqv}j(l$kLzemXv>*0g#@RTZ;n^-eR<%5^QT9J1Y`@(i0%Ag7o~vjcJ= zvlF9s;n(f4%cd#-*C>vJ(>jPn^K|)(I?Yc+eem*)+pB2pyPg1S8ZpxEpIy zH8hR&Oe!pdh-Mkiym$M*hWyQLq6C*#$4u(xyU_bMulUlkD|>R_cj6 zON~RL_9M{HrgN-PWzu8<`r86)+iY%en!nMW zpK^bG{wsH!|Hj?SKQ5*3^L7CR8nbg(KUipkb>qhu8)tvnxN!RFx#t_NzjtG?cIC5= z8W-kLz?@X`m5-ZqA2naR*!wbXmz!|U(-=GwyZjoJr|g@3-b@OI;^Pn)kV z0I$Ph%)DuIIXTO=GN$F^cwPX$uW{=*P?i22ui)ln47KzLAw!|R2S4X8kW^V6hYypN ztAMg&G9M5%0IW$xsSF2*N#rn&z#6c%TVv{_5qIo9EwZym|iG$J4&% zxLMZ&%H~SNa=~&f(~quz?3k0K>I_Gu+mFpC2m^k!?711cM3D)x=N^pBQV7R9+xD!VbRdqSaqAbbOFDD*fmRpJ!nLw29*jXqc7CTSwxNWTO z+!9kr-4sAyrWt;YNk~n8IeOV)tX#a=SAx@S}B&y0|~2) zZv!&vKs8olW@t{x9t0;Efxl7;--}fK7N`IYH_?SzqNe7?s`4@_90Z=4h(sr4>L29D z-_yGH2o|?%aG^Sp^{@Oc@+N+H}yo>=cNaN$PLn+um2tj(!yD%V(0QDKh`2!Zq_;GNA^6MvjPVSS)7+RI=eir2rD#_qj@kX zK~u!O81bL3B`%f$TLERWO}}$B)!^`Ji9bL|n%37tM5SfHBz`!XJLaLmA?uc>WVw^Y zS$9O2Ras@S_^Mw;Z)!J_`X;7N$u}pyaW^)3hgtkk?ucg}^E+0mm~bMNcQV*s-Z^5K zIkMKJkBSVHh2`!*<`gW}L5vtdY^cL#mtx4ILcGX?H7-SQ>XTNyuR*A7Db3%VYAl`& z&Jw_R_0xsM;&aUpFWy)@(|oml{k6-D`SS#roETYJF`_so_lQLY$sb3RA94zoRZgq? zNtF0EDft#91Qq~>7osw%z{MXkAvGaDKT4x?(B<0t9K97MD8scu8R6V&piEE<844!A(5gfyL6(+? z4xAo}hSRH+AHeBVIDHB|L#FO(Rdw0v0ViQI0tzT<^Pr8lk~Bd8)RQWW1`2?jfP}a> zz*P=U$0bfOaP?K_fKagCTZiqgl1e?40%|mCzkgstNe`urNN^%~dkp8<)}Ya`>Y$7S ze5DL0#vP+%THYp%+%_nf5<+j|qce!182<{OYT@mtcMqk!PITLzqLx>F8}veD|4P}V zXd8*vgNIX$?xEAMs(D}6^>iwLWK`O02nh&!W$_Wq@)cO{I5`aA3ukx0%PrCavK_C z*7?PtmSnw*z#_^9zXC*jb$4OwHt-V1MsVAFYp(IaeDjUxfY?_q%{9(0;OIDB5ule~ zpWBf4XuYY%?|YI(i1J zEq*D2X%Gehqd`1vUY>tAP&^u%uhf8}f^fE?w%3C}QdcfrZoKeb^XDHn7N>&F-oUD5 z1XC=VR!!tP^;0@HK=H3a=rnSavG{u{kklA1<7;@+Yj!;R<*e zCuYluYH+fM6`n;KUFA#sZ%~I&5aHSJK->sBUM>g63tUI_bqaNGE!!stv*BPt$i3B( z{BA7bM5Y}&$*unbV>^V~@>Eoona(=lMM;tBOr46$-S8+4HNE)Xh=2Ij7u|oHc%nT@ z`w`)GQh57xw>SfF^0qU)fWj#jktX_F=_rUDIRcTvIWlpTOdigG$RL~oWnt#qVCK?M zwX$jHl5?D)CPaom2}i(K8ZbZP>eb+4+`1ATg+q|>3mT|SvXhLSs7#R~V?8c|*;9PI za{0vo;9G?4>`T|DPNi1R!`jDzanT*<(=*pTdy@>ezK9SH<2x|+#_RNX|C@BFaq~qB zuSP*&0GC`fQj5{0V?mhL=?;(qp$iyYRKTgQ9Y1~`7-7FYoA5in^Yr&d4rGR(+4tSOdk*Z`?Q3IMFvON6h`^l` z5!4U29#D-Wk-}Dig0FxJBK-V88vL&**-yy`5+gz_g2}hC237?E&Nz8MuGYB%mw zKPdAf*h2boKRlYnV?a623GoEtgX0B{+ik8cERMN%yx{JQ}S%nv`*x6mM=S| zFniubVyfriW)!CTC7pQ$FBE%&yQZGW*jd~tGs36*ZoGlFcwl=!bR*^zaXE!fJbh4v z5)b2?-b@0oAhQl)A+cp6N_N`nB%JXewF?LRd&&uB*^$9b(=Oq0g}gkI@k4tk^zz53 z2Pr&Yj>Hw0Ii#=e1acI&rQhc}R3HmJqJD*koWt^7Yh Cz2*S` literal 0 HcmV?d00001 diff --git a/python/__pycache__/llm_client.cpython-310.pyc b/python/__pycache__/llm_client.cpython-310.pyc new file mode 100644 index 0000000000000000000000000000000000000000..4ed2a285d00bd16f87a8eec12060386421afd2e8 GIT binary patch literal 4827 zcmbVQ+mjU48SiuYGCe)l9hS=~iIc=6j**)tN^Oyp21GErXn~TnSY6GWUbdInnc;Mg z>rVBgc3D&q*TsZL6ts2|tUy_^P%%P~gopeCdCEh-h8cDrET02j@_nagmf>O^(zAW~ zT)uPpZolt4TS=u137*ZLJ>Z`BmL&Zf8{JP2G#-W5YeB&zMoN+yeThk+O-pn{Hsuk; zR7O-&9nnmU;J93hjp(L65;xOC@`E$qD0+joPk{)dCIU%=YbK$@aWZ9dw-%tKU83`_=w6Yu2q@ z9sNDH_QC%3YuB$|^U}KdO1oNJHS)+7bKv=P_7m=qGxX3Xe|U7@`7N7Y{^i2AVeeWF ziiPoauO2-$Kk<6=-I&TuG6nf*R_(ZO^f4ycEXls%!0a#=@BIjyRQ?AEuZy zXxB=<6ZUvMckB_XI8-a|wLG`(6p^{^M~23u@OsZc;Yg@flRgJRHDyLk1(c+L zf?`bGATh<%9S!R02FZyt=r;|~jzK#C0@kO9nF6K8SRAM+2-65NPd)YY#!C4mhkG_k zv-SY&bLG;z^KZuav_2d|!)y?W%;sB`P4=5OA(a^dwW7Y?`He(m#1hX%q- zv1`8NvQP?RHP7KtA1ad&IG< z(6FqL3agc{p0uoeHM`UviCGq_6fKKqU<*!h9~s0MW-QAtmn**D#)ENmlF$G)t&Q6T zHgA1`qxyIZdzBJw$$O!CTH@efQE_eE#{ON;0R!Hyb-Ok>-d?{_-Q_!;|5%N=m0i^_ zf2dO4RVsnrO0HA(S69b)8YcI_>mkF2q|hu$k}O$9#mH@1O##)TNY0?>Xf@I)lfl## z2AUn#1}VDa0mY2PV{x7Ju(+c$19Y2k3?~6@lZ3Vc8Z{gptUwoTW3UuUgWIH7hGk)` zG>d_zb734cEe>2;1-mv+{;73pw)y_y=9xdV4xYdI;av0V#QYy$0ev?w?Qebb!IjHr znkT2O9y$n0E)tm0d9aRVxe;D(0~9`(W1kdA7GV_Xa-VcudXFNWoS@K4eR)`celSQD zn zP)vY8hCzTe$uqDvOnAkPxrR16|K|DT^xJDtH%CuJs@k$+$1{<8 z4ircv3YFtIL#oalRVDUa_mOLoc zUw%levQug#f`qqi-{v4OlVHXyX(WT>Op+yL3IBVLgpjDc0-GM2fDYP$wB%hiSG~6=u{0oNY7+hMwD4m_Aqsp z;;)ejGW>K93o?&Lz_Sc>Imo~cxf?t9Ju^ABWR`Sx+$rtbtVn)(c*)q`h}6gusjlsm zeg&L0vcJym+Z=sI$tci0EbWAT1w!17^~#BLZCQE$93{vBf!V;vGv6rFN4jM?lU~$D zT5uzyu7H>S#V7D~gzzkI7rR-0cQ{|NbG{?Q`%d=>13jP?g)%lscY5{prQ^ zmwn^<6aUZpqf%jc?OE^_Bj0|S({C+|PqaQc*qWGY9z44U_ZZJF&PBK(!2ONZv6-tE zFJC=%xOHx3;rE|5XWs|JUtC9o%YwoY2SUv)S8Kk<*J4A#ATPpiJ-wzlWc#Z|05a@7 zj>oewKEN@RC{X@gL5v{IG49pXnm@Q|eO<%6tUte?VW0NGrfma{zqlie0b(Gko0?tr zMjal;+KX=H79pwe?vU1f+}k2IrkNrlp=n2vo98e(4->B!zcW-|8rcFkh}V_QTcA+gy%%7cvz>b-9K^8%r7hp4xHAeC~#cTc)jK2zRJ4~l3 z@c4CIWcE>lDy9}_+aoi4DG>8zSfD%c6k1kNOG2_*5X4~8LVJtKY)6(`@C!{JuT-IN zA>D^0^x53L>GCr1HLDAB%D)Tl;D@(Yf) z>>|83J&RtCH$}9i86vz~5?+pWLk1wuZG+Kobb@e+H&pXkWweY3Y2O^rzzk1;0&;7@ zF?<)6@}J@|B5G*Wp|}g;!oo+ ziZk*nan1p3BDZ4OJGpJBZ-}nmKf}Q5Jqd*_>42b!$Nu?ES}Z3KmKwXVU1(31R_mSddF}mj zotd-alU>=3K`vkvXi}tLf?Xvg2&FEfiXf!ohyL2XV1B9udyaqNhyGSd+BbXl<&fCb z&d!^8GxO%X&-=VEmrE<~T>saTZcjl`zLY}eV}kGkeC!lb6s%z6DV5eARS?Lkr}|n& z^Yx1ECn^af=QPjola*xL*FDouRZ@Psl8$BMWhxoaNqAX5SINa=hS%lqtL*dhm3%BG zz5RZnQa}pHOn1ZAgH4jzIIt<@UYx>doLN(=D$cHHQfK14v_-R5p7b%U3lM$ zegRbu6AkC_eq11jarc^DIYN$1A0nzZ@>qT_?)!ATt-!iQJ%$}w_e z<2XLDiR29Ic@#ew?^%TLhww2NKaPtl3Y_vVIfx&cQR%w`O+SJk#*g4fVfPdGv3OrJ z3O*ZEN{{bIuMU+okvwZN-v5h1k$Ra-jE2q(;i9|UJ?%0l3A8*v31nubdrR_^MqE|lIdFSTW zcixEZEP-nC(^s}HzWQD5a=9$;RHJUdsZ1=Ifu@A$e)xT;&~Ets=LZ9)#(xQZVdKw? zpC)XEhqZA|026iWhU2w)J{1PzzU>C(+PpA5capH09UO(FEDMdgWNKMtAXCjFdH@FM zkhjX+t(!aVfAZDsYhT@dd;9NifvxptVYqquZ_&lo==W>eA8qx)#rmRaA2e@lMps|& z8yg$lzOoYC`Caqo_122!`dakbWB=4VIY!#GzOjcT!Ee# z1HGK>dEuNDQn%^`Ozdxo4kefb+_gQnr{NR08E%VH#Ky3jNVQ=q(zbMgg>7y-GSqud z5<1eG|A3GE6PjhzIE@ik79jlZLa5)<7FCWm)CGlW)B1wCsR10c7!LZP)}Bc$XdN>N zY~Um|*R@5xtzj(a9U3v!tgDNO_Iz?7aew}0IAc`N6>iQGq%0apY4o%;Q#`$3TtJ=L zzXtt9Fe zZ=OFd(tcRyQkJaCk@< z{R8nob>_T7TIfog85tQK5gOyPl%&UCH9ao3$Ve)(C}DMvi}Y;hIwZ!3=&}PBSOctX z$(hy_S^^?*y0w}fxlgV}LkHN&iedH>7-Ek>qb{jxUhPG?){9hKMJh7B?M=v@aqpq1Qsng+Yl# zph(VzbOvan^r%S2mC6l8vJS?F6zFLZN~>LSsf0TPSSwU|MjV1s>JiRK*>6|VGAv;< zA?FKFsCGfSS6Acvwh)|z;sw-J6`A{$mC=-3n3jdq@myfK`*bhTyVcWkC#Ym>k(scW z>kNd!q+1pG;LzD&DBGM8+kdfDm__ES>ybSnRVDoAa3)lD@RcmBmL&{n1)(wX#^nUi zk0ICE_YsLW*JGTv046abG}x@=ca7GA?+u&zydUDaM}8{(&c>lJAzVEui}I=|TljQM zmx-Zfk$TVgHl0@WJW_KqS>lBGuWqVHYUuD9-xN~j@jNn*rIBgM(Y-hQjsCy?1MJ5i A!~g&Q literal 0 HcmV?d00001 diff --git a/python/__pycache__/session_manager.cpython-310.pyc b/python/__pycache__/session_manager.cpython-310.pyc new file mode 100644 index 0000000000000000000000000000000000000000..76cf881271aab268b1ed0a5cfb09049f9e6f7267 GIT binary patch literal 2438 zcmZuz-ESL35Z}E!-`VHHc7y2$LJ;vGFjOFT00~7^tG0YdB?wYfailt3y_@3nd>3}l z3XWXSD*Z^?1PUreN+~!{T%ziq9FK0DZhQv$1)T6)~p;0$Ivu=47MY$Pf>b7U= zwG}$`te36lyj{;z`9+ z*_S4gS{wzTvi8(uqRbsp^Gm8SFE@CDSJBO_j|t3ncx4+1Cm5z@yb7UvCbxKo8AF8I z@HK}Bvpk1qVVwb4j=RjBqh6jvVB>`?1mq6rWW6FU@eP{KX?|dxchQdJSsw(Cws-I{ zSoLdfWi7c=OA6XPH4C|}QJO(!@eT=oT zNo9RM3hLbVmFxTUm^DIN_xYe5gsVG_@3Xk-`vRv;6@5R5qBse#XC)|`G7+L5x2ywk z913huWrfhmq6kZ2Bku&V8C7esvi8EkqJ$e6Bo2}dNH!tKA=!*%3zGGOrK>wphS|=; zD=`Hwv5YLu(muMGmW&eJXbjMeRO<*-QnuhpLqt^y%-VxD#KV7uS3U{kC{0L0TV$F} z)5A0|TBJo8oih#_iP^T8(K5y}7XUpjnhTVYmH|b!8be^%nYqwe`YG*X=uhm%nTwq- z&U9war#%TRy56+C3yYoO-(NqnwDR+N(4`ea-w<(){DBRUx*2@EQ2=KDVCuU&bGCE( zlZq|w1)(x(Ovk3|Fg^$^p{!ao7Hbz3GY#0O#!&>_uAJ5Oxh091KUJs-9wgjf-M$NC z66;|c=`#$9Kl`t;Wl`}c2*o2nZc85a99BsuZy3^g6jIe9K53D0x{K_;`!H?Mwy{9u z{qQvx2qjZai@pG0{5-7pkvAQSB-VJQc^?IylGi{o2`|{&Vi>8mPFJaY7N!4sh{~%T zUQ9hCPCLs?(8)oOth7k4k%&&>om}zyZTp$kB9igEm`eIUBhTzOAzCQDfCcmZ@@V9Y5-UJNaX4}-qHLZy(8Sm*7wnN;_chKW>c>W8!Ok? z1KGt!`S6>y#+vUg9tV6(0kJdpZtv2W&ik`FMqYV*@7|FVFA*Kvi=AJl0Zmuo@Z{<4 zxu2oY_6~~&!DRz0y?+p_QpHt2SHJ7Ld%pYQOan1XZx41Ze+n4e`})fA(o*O2Lg(st z>G{e|!Lxw_x_=PP{#O;0(mOYBn4x=tzdYMHeknDrlr=y>GVGYJK|v^I3p=&pm*iG5y&6`*x8C)M&C-~hsyB!MAB65L7wsy zl|!fl1cM`8{U>!ds=)MNYby(P|2rc6+T+@UJOFxfI}qcDZMYh43|fGnMUB6WnM@?H7zz5o5k_y1YB#>SuvpATP{n-2E4Tz^9swI8Z|2wy{&TrSn6 zN*PyN{7P|&ujRPRzwWrgzn-`kzjDUcG zDc;1_QYI3QaNp*5Gk%p!OHXUOwWlrK)-xqOrDtkke&jjBI>lNyLe)nNQ)E&Q-cZBRqoTxw{myj6Hmfb$T=Cn~R_%7RO$%zbYYm<93|FV3PEn_BQ{s21)70r`aizGDyvcU5jaySRk1F5q(!6mW=iSKr;{nbq_Y+M9wFb2D zBJYcbv_|CpXcJZgY7jKnuvdyVaqAG5Hdad`TpC8drq!-k#0suiv-)YVmib#T5nPU( zIbZp3OZm*lBOeZac6n#{!rSG8XNE2eR7yKW&b;{9+Q4r_h*tlYt`g~F}kUYB;+czjxE8wYQ1DNsaj_;p8;_tQ)W)@vw}9w zCDQ73A4H!)(`%<>CMDI`id>Y+Zbot!Wo9F>f;L@a)Q(uQfI=vN$oM0IqFU zHk{r?*7P5MT`ebe1sYzRORd+;WlZe(hq3hKQ-?=(Zy7oNQF-^fQ8b7?qpcNSve`AWlsQoGLJX(I|rShIb)g`M|E$&U~$(|@L z%;IS6YA=22spzWZ6B^bm-QwuT>8qoMPY+!>F}!O}eM@Iq7uRfA<;Y&_3bw3#%TZ!IWkZ_@s8NU(O0jQFTRbf9)0asl~Zq(U))|k^;+fPTjd=WvA@-kI#$Lc z%ZGt@2XQ*9AIj5rHNIacNK|A6n{z*0y%nQS6YQuFU4`L-i^QtR^B z^^*VULf&WG~XSwH=IsGDpg+I61V zn%Go*Azj=<$s$VbMPdauX=@GUK2|6Vc`MXCO|=?v)vM=-V?ZykJegbj>Skyw(^_*@sA}82T zXFij$8hSIyK6EDS!wRSJx(-c%lt<92)ud%f!%a||waL_as~IYdrbGQrfC4jI)F^JZ zHs9F^O#>>jVrZGp$yT9m1O>lbY9~btR!{ z&9il;!Za?0a<>~*h#LjH&?kRV1vsB7qM><*WjRNo+ptO!Q%qcl<- zp_$rjl|)a;Wwy|@+1lM^PU)Vy)gBS$J~cq*o9e-?1@m`cy5*g3mM>kbO7fAb$13|y z(pJ5=eRS))Lsza2AAA>k6H^L}KbgCXR#nSHzSzp9bFd(b#Gt>)bQ7;W{tDIqOb zzk!k)kyxHy9SR9^Co5QGOorvN*^>ScHKhY!`9WU2P?}+~Ivgs=__F($y zcMA?vzx0AsMIGFEl6Iiw;a|Qq2|1rQ1aclZyOqg#Pn8meV26GHvvgNSo;JuPl@lM1 z{QBhLXe_|{swYsRFGpfE*sDPD#0t|=8+lk)Laqc>JfG4S@DMcg6Y9}4ww)_TqQulU*vaqr+)g-or^{(y^_NN={tJ`CGyM4??c;}vRWoIfb)8F@fXQ#{n_A2P? z)fhrVJCyZ|?bI{O7)uRfRG^Z+4vIi3VHAb>W?SjL|5&R{G*(DAC@nP(f}%KwvBBVI zypX`A!0J4CvP{d{KN>xJs*W}~@?@`yDzW>O!{=balrLOZ99@~enJUl!s&eR5`SQTf zg?(TrRem-6#x~I-78Z2!5E|_&frK$Q_swFyMim^PYOb$Zs z2^2sv007|}eU+Nj9sQu1HtdbwgKC46D0v_RX%+#!grxA-VfT$hD__e45mp9*Qsf$` z3Sa|np(ZHT3b$OBipIvb{Eh3O6AqF;L6OZ{BONhGCq4K*Tbe^COnCMw288(p z?dlh3X)vA3g?ZO~tVz3CKB2s+6P}Ow89!eX8S#83cu!H%LGxLNY)1&I3RBvxXeOSz z^4gj5fw#*C&frO*7LC63^YZCqpsvcxrz!_OVUnC!3}VZZJ|VhscKGeh7@-5Sz!nFQ zi?cQv68jULd^L7~o)PO83xhK7Q~E4NF9x!<@r^?mhL^c%M>G(n>2Kf%{Hi)6E8 zx?mq;Rnk&XJ|XRs`rSo$x74q6(W!(ze!r_Q8##ALDMBRzhmlDJfd6}n3L(;_7n}gL zx~gmky7DGe6mIPsME)pqg`)BdtVH5F-GRPm1Zs``LD66JqJ0DU`NoanKkDfR_bPgb zub3hF-2$8%%Flnsw5z77z$`|O9vgk_QhD%L}r4k-l>kiBdAT(MSnI*7kM%lo{NIE@L1*TCmk$iPx;C#B&?XYh=t$zGS)L7~)(HU{_#v5aq#NmvQv@}RP;HP(Cl9pv!35p1y9KOpHW*?Uzq44h%3pm0LmV4xoMa_Dsw!DaxZu+OIV$0h z6r!L@#-Ty;?nj{66s2x=zsz_PP%6;B#ODEZEWso)6(GR~!2-o+?*zsB`Z^$K-O!0< zsUGM*Zd)f(OjnW5hG=aDNpWiOWM)~Z_LNKQsvyvkzar8(8A90 zfqmuuXJL~KzxxvH?T+_>^Oa9*8$R%2W#7waCUzS;&x*C^C&mz+h`bJ*L8mnxEAwQ7 zjca0y)UG#Pr_aYrVhuv@5k=_FQ9_(k{{a$fnq%cd;m>x#q_+3j3a}xs=CYa)ovf=b zr!F2NqiMY{kDwCrfe4~dDK`ma=t)%kF}?=fRvz#}X3CJ9kdN+&LWXo0`j#KWF-wLF z{Zjs{aL0AI=6FR=r@N2imn1{z9I_mF1Q`|l((z8DCC~zB0$&)4WC9*>o8A%-NY$GL zZJ-=@^$|t&9|7G!M+!jyl|d^ozilI~a%>wE-+Jr%_{HJD0kLU<*H~^iJ>rocjJckY z88D(XF}LM~%d018S`9|BrxfT+_3V;t~FtygoKvWd=g1{lZ6 zm=gDaVN1jujy9gVCEzY3vC}h~}0%nM}rlbw(J& z6YO2ES{ZMOS_4ta!(@WQ^u#|2CzCVwe@97nHVbZcyZQc%jGgiHxIkYC$=F=H9 zu{LQ`N$juD&LD?N7*>%YD@+#3wU7r^)9<|3f?+@fbFNPa69;5>M~W!G`S_3_3Hn=n zjlV!bns^Di#UM#dNpOpPrKlLQOgG8YZjy^`TP`X`ar(g@u=_=2x$C)m`$vjg(|7#>de0m}P-K02^jNJavV2M&N*hd+2*l!M*W z5wG2AJV2!9FkXk=i!@IL`g2h+;LwGO!|wrl-UHvn$kiQU%=}$wQ8oRA0*@w@!==hc zuMS^&XZX^o+DTa+cKGT8=w&J7jQqVPZ+6bTuj^m5oqqVQ3+57LY0fQ0S5jMnBed$< z(TjyI_>ifmdj)G_hPITd9-<_L#8Of@avZ8)R+JN_LBkr@lTQn`sUD%WTPfK_9lWd( z2=S;Fs5pcq=Br_Jw^6%LEfwoKs7OhzOX_hy^GtBidh%~h7yvuj@oGbwU!a!_7zE`Y z$iE#>f!`ehA0&<#l4Q36VJS<&Yc1XuSQmx6u74Ej2WNhqQg93B(}+w}a9)taLFjfF zep0YWQ8VR!kbb|X@Ls@Wk}(Pl4aBEFjCzY+Vwc@s1UDp*XQvMG55Wxt6%&Y>8)OgD zQ1u+~^!sqY8lk-V2EjPZFqB0JZXch0r2K+tvrpOMG+~@SEXw5kJ|g!6X)8t0*FR}r zo8YsHvJ34QHKX@-4f?`6hTm?htRmu%v)1UZfhb@2v1@aE z$odT-Rfbtzyvc4@MK&HqRlI2_&Hl-3rcWT9majM2hrj?;Cu6|!!qo{5q_3ijX0}Zl%L7vt`7dw0i~7^e8;+9+-UW~2mW9Wu&iF2I?V=lip%03!doKZi1U$;60JSa5 zM0v0%YL&f^07a#{LG`Rx^bT$n5(fV>E)m4${DPk~_T|9OJQ$;ec)Zy}<~~6Jg1?KP zwSLbF9?=u9B=W?+xbI7L-w68poxZigca=6b3MY93Ahp_w&mHRr(q7PrGcujrenJE`K(f0 z+&*tfT~GFjGdBKs=@i=WES;qXk)gAsKnsE4E_Ffw?9#0{`{OJ(ItGO3vabI3;wVVnu70xEgtpGaZrluFB5PhD@jEEQ zx(6zRjBCQR+()>SFhUTq7Z4rvbkr-V*H%JoA}s_kil6auRt10n+zs*!^r<#^-UQ+d z3c`k{{wLg%$zEaN#oZyaZK5x{RCo;cYGAv=YXUVy{3FdsU0KF#Ibh|${3SWs9C%clB486Ir2N|4r;L$ zLLI{MF68I^)PCOE5LZ*XPNC}4E8p(vfq_(?9exO6IX7%{>7UVWQGNg`L#u=RacX|= z)Ih;$%rMu@_bI=FMZpNL-a|)}XTnuoDAur5MWr`&cc)4QxOsc4Li_LFk;mixLvd zz;W0Jm;lrZcL_6y1T|)U!C20Ay4+34OO%ij5)ZK-)K)O`CMti3lB$iQ@1e^&pUdl1 zww#hbqGUfMB}z#30K&j311k#5msm$)ABvKr6OK`o>C`(><|u~}P(lxC$+e18hm-E@TZ)rT*d~QF z$Ybaxp&Yiz27+k|UgX%|aOWwy$hN|3yh~N7TRyOdq7VhJKi=~MUoR>CwN9zZu6ITT z_f$zbzz!&ZNVk%gP0!`cbXM!kXE|bTOKGV*LVWAR zpi-lz(lSpf^iHATKN027!DsOXWpFx-aL@r9dbT+GhJBs<#Ek>2F}zF0mxUVX5d=VW z*E#1^cDA!C&&{qp_#(=mY!{gB(1lZ#T?3UPyF_fK%@^6|A#{hGD5UP>XJhoBXlnQ5 zU{HdJnL*jMnp50Is$b_E)r4q_D!t2}Qba_jM_L zV&B+J`t5YbJ1Du6k{A-J(SaBdcDZV~)mFV+wrs`f)rmDvKDMHxHu!n@Q%|nySR*{R zZi*FIO+)>d66S7k%B`csO$i++-9yQGO6F0LrDPK&NlIEM*-lB7ZCReRh|M)vDbk6( z=tL>{uPGT@CC){uY(A2?_!{>k@w=cVDYhB$C5(oDfEjWPC11&&;Fm26{9b>%KQwz< zSZVS2+uLWhw9Jl9T@}8w{jpFpkCeh7<35C8K7_A9X63}F>rSZmh+4Met`V0EEF1CG zBJSEnao6+)0ivz>jTb~)H)UVQ2l zj+CCNPD4ox$6dP+cO3>Q-p=nKJdw=e4G=v~Rw|_R@aaLgGRm*N8=V^+`s7V<{D&_6 zVz{)~i3{0TKD&A37clp$(ad{>PY)niw;Bgk6EU<1!;UkXXk%$#nNyN9gLj7D81ODO za&XA#eFQ)%0AgY?-bkn$4S+Rmo8=X67+5nPddz$;cuHLup%Jrr$wD-*iJlxIgeX-I z9sVty55h*EE3@SB1Iy-j6zt`xM#_$35wyQ_s`y#nMTR^USbyNq+YrJ=SE^!?7enSK zc*Ia+hZXp>sK#fy5!LQj11Q1MPiTvMM~%WYA&jeV)IGE_DslE45FfE6B|*9&{laME zUwC-=*AG0K$^%96{VIs$ZpON{ITQ)8TmMS#se4&~bI&u16eWAkoJNto`AqfRF&Q6op9bV;zB;ws)_8XYkDg# zCa$SNb|UtJSJPWVY-AuEJ#G^lA;iJYkMG|+4&AM;Mi|w!8o~~v$WVb2UYD?fHeq3r z{Lb^=Di`ki*3VDWNdV^(%wPghIUL4_qIR+cZ~|ZW;XMpDj~;w|Oo3>=4?2af)8&k+wZPMFm4Q~eXn06ddefE^!jY0!S4 zn^5-Y8>P=K?2kr8ofCjkjWiJ~RNp|4!4E`cK-~jz!e)pNzosr++&nHj>K`$aif1-ZS-#__ivp>^%K8>ivNq%V&y;V zZdY0q`i2$1hvPoshl7fH>p$gzCTswmx!>aZ1#ypw3O_6QGH**2DHPBF1)lNqvL5>p zde=?c3et-S>0|~7;4Iwc3sQvSfi}4?rDmpMZLT{t{g2TxCJV<32W!^NU>)6jvKjb| zb$OHG5u&v1{~pc8sW?upo<_~Y5JopjNzwTtf&{7rEFl8Lz{KeVE;;{Q6xRka3UsE* z%>`o?7?6#^vYUqtAZP8?V+g&Q5+ZVuM3J*vDO%4)5}Y8*TWJw#zanzs#+oIZq^X`k zvk9!lc_95iq81N8Hr~XT#9G+8I#ISndeFXZqHLnvNvr#(s4U!6H?0XVgF9%5HAu!y zjwVLb@hA8ibg%>=;#~=;Q^HGg96AVC5Mjo=^5@Z{8b~K>`D&0}Eh<)R;{@hGdVc$$ zy#JqwJb{kY#Nt&~l*~FO6opqMkAnKurABkGx`sGA?Y?nm=Q@FB#8-(-eoF(|XJknoXX>dTyJ{de(nKlQ~BTZJywsq&w-v-1L7( z$$y}PNTG(U5=GS8!aU8f^TN3(wY!LfJSoQQ$c!1c%2#8iZSX69qyHAaG8^2pMF|DC zPYTVeA0Kjld};NJ|AB-rw=sMh?9y3iAhsoKJ8FJSI#G;wea-)+MJ%%f%O?zn0lyHb5POA&!2vw|s% zUSZS11{(V0CH)efpA8{;^O9iAamO}*T3RaFN27woc?k@D5ZHtWc=!pIP`nW$nDBy_ zf}FxR4{{y^bihWVx2|n(N1*7zqak*;YEB?nqoy8CK2m=Wy(HuD8@I~)8xh3e1Hy=V zFnZ`yz)7~c5iH?f=rSJNgi`wZDZaQHqMFcOKv;Nu%#wmSHt>uhut&3`&Pn~{&9)Po9zsyr!^HAPItAe<7q2ADmZu}&C?w7Lx<&Q_{fLt)V>qR}Vm}9HuyC=}s7#B1u?q4_zshPhKHU>DAXMB7giVh}9SsTblglCAdcZ zW?)PH2bff4=g)-;w@&gna1rdaH{b~pi&@@(X6VvM5h*LMO&W&u?aG<`)mEeM-M}3r zUV7jlZp?t*joec?^zqOqS25d>^T$Unyf3JXhUmZ$wQ2?W3ky+DUYXyg5F^qs>~pRa z?d6yE2vUFp36w!YE}>cBh3*6UhA!Z(miH_C*ya5v%cl;|7?%%%EeH)9(-V=vcBJp_ z<8VJ=44u?Sh_yES2vVPh9KX~6%ma2mLdW+X7`k}ECN+H!)dkODyvP0k$MAG5;?JKi ziM26ro>Xv3lfq#F`vap zs7FA9`k$jL?xAQuywC^#4&DnjEGf<5bAsB(#7`7$t*Mg};sZp-3(!Cwpa2j0^ImKB z1*ZhvVYlC{_#+4d5#@L_=c}MMDz%`d#jXE0bQ(KX|uT$5d>#OJS;u<-iyIwLV2!f+DDNr*A3j)n200DXLniPi1x6n>AqUKxLpwl;)W z(7RRB5t}nhQohpv5(VS52`>uBqUX(e7a7tfwz~RZPn4ij*ct*f3p=N~}Es0bJUhz#M$(J&Hp4~SREwP7azBMWICX&o2|Vm7D-Oz0L2 zMg_$-nc1rkHm~nXYWEM^V(zgYxATD8f zyOMZIM6UtF##n|||1Z?ULrAKj|5xg`g9;QX(Eoz2>j-ITQr$@ZL`6-ElUDnQl1N&U zLm2V2aNjBrbrE*{M%--@7=on#PZ}F9`}ZW_N=z_q2N70KzPNwntzY6jF#Mkt^1dB9 z#jbf#g9YUG6=U;-$9pSH>Zdf22W%2i#_v$R0q?$NRaK*R==GCS;zhU-Ua-)K)6^^E zM9@|PIk)*gbHVlGqgJE_inpV8Q-c89$Yw5;%NXpd7eRy#)P{}>hZl-Bp9${~q0O{| z^~`>ZeQ%*!0@T?RBKDDaBrO~tJ6<6+JuEjou2wVNMqist>gpY!3G zwmqDSq747KN&GjY2g!­nUt4#qMIdqVj+lF~%+c;ZiXW2YKi|C0W~OZ;ovSNQ|} SS#aOWArCq5g=<#%`~L@toz6S} literal 0 HcmV?d00001 diff --git a/python/__pycache__/ws_message_manager.cpython-310.pyc b/python/__pycache__/ws_message_manager.cpython-310.pyc new file mode 100644 index 0000000000000000000000000000000000000000..cb0acc6301c0f631c7d1bff09df26820623dd878 GIT binary patch literal 4319 zcmZ`+TW=f36`t7}mn({rW!1O1iCUy>7zFMm>BWYTSde8$Kuxul5;cSXmg1}w(&Un! z-L*nOD&)v&oyM}=#G^OXOo>Ue2Ba3I&Qh$+MVK~E6Rn2{3o-o^VY(?#%ZVt| z!_0uXA?j^VZ($LrN2aAjJJecP6lzhZZ85h@lSBuj10>eA4)Y`N81+JZmeXsw`Izh} z2Qz8Mle?{wr}r0~Ou ze-tVQAlbViGYPIgAu*benUqkNoKTsP(3lFd(Y)54T*kDVBlg%}sc5ca*L4Xq88h6~ zcr4`U$)uIao5`eSB$N39b8}dZB$LP8R4!;qsNJs}?CbZG!QP(@dRlkSU|)Ycq5PyT ze)u-wTfvaX{cYoX5%t6YS3~=eJ*=y3ZBMI$K_TUVOjgIjFW0ih-66?CY1$@ zUzK28lKUdGul?mumDwAQmLB@&7W{|j{L`2GGZ$AcpYrcq@@JMFublSZnO*&OVeO9} zRIZ<2y>RRC$~*iS=ogd4)IIe?D(9MFO}8oUf|iX72|0x%1J8XP+HAyxCM#6?UwKPo zB~^_t01KWe$HnunVTLR6WZU8V8(6LTOA|t#f(C39L+PZ0?ov3)(vY6`a4H8N**}M@ zfea>{BESK%sW8PV6HpXoZBUD_ zcG&GLUUbO*scX9Ckt!c;Jgqu>(4jH};e){8PeT=H?l^V^HY;-U)uy!z$H47Dh}&q! zkjmSi9IXMC@VGf*3%cZA2h}v{*FJ$VsQe9*?Lc;tB961<1mW8qItS2k%MTwdz31P%zW)9n0Hlvs&iD@&{qqa{uWwb( z-ddkJ>Cc{9z4fjOw;ri>`s}`c=Y9X`t)R!gE{;3C&LG2kC7*iB&Xi3TcN@kE`gFOt zCtbmK^^uwf2!;e!dkz#mEms(WyTuEQr?{1|#yly*yim$6S?Nr{Q^k3EEopA195d;p z>|<~n6kYqx6o&#cl;c>_k8RDPjYYVbc!$3Y5nZJj4z zU#*qK$#EHMMzd|D5``9u(34nW=AmHbXm5as(ci0%-X=!Zar6N0jZsmzF>Wj@Alr|H}`e9c(;OU1k%-e%l`FuLAq_D$+a6F2NPYY7)Nc-IHe(#KN}KaB$DZ@z2HBG+P z3C|f!a$2gOmjhsmhn(U*50ekbt9mU1^d4RS&{Yxf+cV8%7jFVs12Ri9tLJ|iiv%Yw z7Yjw+3syZXEx1FRHh&oorN?HXxf6oxd-iz{$Y=-gD#sh6h=L)tN+`t$C z*~ox+vnsS5PO}rZMWQ+~4g3^1Q(cy5q*ng#F15UC~7Xd<|jT#xWEPR`DGy zVfZ7+O+0sk@V5_T{g^cnC`t%J{w>H}gk<9rOeZ?+R63*Ec6W4$me|(7Awn3fV3eYm z@S^4z`FR>p9Ee0@9gKugfEOA~*-omM5mWP8MpAYr-BYkeGtjv&eyHCI!xsNo1V6#9 z;;S>5u5dt{kk<|mR1u=o-r!#}cTe9RJe6O@@JzUm4$oDfZ`@YdpzUhA5sgHn#_<0E Dl)sn9 literal 0 HcmV?d00001 diff --git a/python/frontend_ws.py b/python/frontend_ws.py index d22899e..f63a847 100644 --- a/python/frontend_ws.py +++ b/python/frontend_ws.py @@ -66,57 +66,52 @@ async def frontend_websocket_handler(websocket: WebSocket): # ====================== 修复 TTS 核心逻辑 ====================== # 1. 创建 TTS 客户端 # 1. 创建TTS管理器 - tts_manager = TTSManager(ws_url="ws://10.10.10.202:50000/ws/tts") - + # tts_manager = TTSManager(ws_url="ws://10.10.10.202:50000/ws/tts") + tts_manager = TTSManager() # 2. 设置结果回调函数（接收完整结果） def handle_tts_result(req_id: str, result: Dict[str, Any]): """处理TTS结果回调""" - print('处理TTS结果回调 ',result) + # print('处理TTS结果回调 ',result) status = result.get("status") if status == "completed": audio_data = result.get("audio_data") sample_rate = result.get("sample_rate") - - if audio_data is not None and len(audio_data) > 0: - # 转换为PCM数据 - pcm_data = (audio_data.astype(np.float32) * 32767).astype(np.int16) - pcm_bytes = pcm_data.tobytes() - # result_queue.put_nowait({"type": 3, "data": pcm_bytes}) - result_queue.put_nowait(pcm_bytes) - print(f"插入时候队列当前大小xxx: {result_queue.qsize()}") # 排查队列是否有数据 + result_queue.put_nowait(audio_data) + # + # if audio_data is not None and len(audio_data) > 0: + # # 转换为PCM数据 + # pcm_data = (audio_data.astype(np.float32) * 32767).astype(np.int16) + # pcm_bytes = pcm_data.tobytes() + # # result_queue.put_nowait({"type": 3, "data": pcm_bytes}) + # result_queue.put_nowait(pcm_bytes) + # print(f"插入时候队列当前大小xxx: {result_queue.qsize()}") # 排查队列是否有数据 # 保存为PCM文件 - - elif status == "error": - error_msg = result.get("message") - print(f"❌ TTS处理失败 [{req_id[:8]}]: {error_msg}") + # elif status == "error": + # error_msg = result.get("message") + # print(f"❌ TTS处理失败 [{req_id[:8]}]: {error_msg}") tts_manager.set_result_callback(handle_tts_result) # 3. 设置是否播放（可选，默认True） - tts_manager.set_playback_enabled(True) # 设置为False则不播放 + tts_manager.set_playback_enabled(False) # 设置为False则不播放 # 4. 初始化连接 await tts_manager.initialize() - texts = [ - "你好，这是第一个排队的TTS请求。", - "我是第二个请求，会等第一个处理完再执行。", - "第三个请求，支持流式播放和队列管理。", - "第四个请求，测试队列的自动消费功能。", - "最后一个请求，处理完成后会自动结束。" - ] - req_ids = [] - for i, text in enumerate(texts): - req_id = await tts_manager.synthesize( - text, - mode="预训练音色", - sft_spk="中文女", - speed=1.0 - ) - req_ids.append(req_id) + # texts = [ + # "你好，这是第一个排队的TTS请求。你好，这是第一个排队的TTS请求。你好，这是第一个排队的TTS请好", + # "我是第二个请求，会等第一个处理完再执行。", + # "第三个请求，支持流式播放和队列管理。", + # "第四个请求，测试队列的自动消费功能。", + # "最后一个请求，处理完成后会自动结束。" + # ] + # req_ids = [] + # for i, text in enumerate(texts): + # req_id = await tts_manager.synthesize(text) + # req_ids.append(req_id) # ====================== ASR 结果回调 ====================== async def asr_result_callback(result: dict): """ASR 结果回调：转发前端 + 调用大模型""" @@ -151,6 +146,13 @@ async def frontend_websocket_handler(websocket: WebSocket): """大模型流式回调（纯异步，无阻塞）""" if not chunk: return + # req_id = await tts_manager.synthesize( + # chunk, + # mode="预训练音色", + # sft_spk="中文女", + # speed=1.0 + # ) + req_id = await tts_manager.synthesize(chunk) # 1. 异步插入队列（替代put_nowait，避免队列满时抛异常） # 1. 非阻塞插入（队列满则丢弃，优先保证实时性） # result_queue.put_nowait(chunk) diff --git a/python/llm_client.py b/python/llm_client.py index a3614ba..9c75997 100644 --- a/python/llm_client.py +++ b/python/llm_client.py @@ -79,6 +79,7 @@ class LLMClient: response.raise_for_status() # 实时迭代流式响应 async for line in response.content.iter_chunked(LLM_CONFIG["stream_chunk_size"]): + if not line: continue line_data = line.decode("utf-8") @@ -95,13 +96,14 @@ class LLMClient: res_conversation_id = data["conversation_id"] # 提取内容 chunk = data.get("content", data.get("answer", data.get("message", ""))) + # print('大模型返回的', chunk) if chunk: full_response += chunk if stream_callback: await stream_callback(chunk, res_conversation_id, False) await asyncio.sleep(0) # 让出调度权 except json.JSONDecodeError as e: - print(f"解析流式数据失败: {e}") + # print(f"大模型解析流式数据失败: {e}") continue else: # 异步非流式请求 diff --git a/python/protocols/__init__.py b/python/protocols/__init__.py new file mode 100644 index 0000000..00d9367 --- /dev/null +++ b/python/protocols/__init__.py @@ -0,0 +1,41 @@ +from .protocols import ( + CompressionBits, + EventType, + HeaderSizeBits, + Message, + MsgType, + MsgTypeFlagBits, + SerializationBits, + VersionBits, + audio_only_client, + cancel_session, + finish_connection, + finish_session, + full_client_request, + receive_message, + start_connection, + start_session, + task_request, + wait_for_event, +) + +__all__ = [ + "CompressionBits", + "EventType", + "HeaderSizeBits", + "Message", + "MsgType", + "MsgTypeFlagBits", + "SerializationBits", + "VersionBits", + "audio_only_client", + "cancel_session", + "finish_connection", + "finish_session", + "full_client_request", + "receive_message", + "start_connection", + "start_session", + "task_request", + "wait_for_event", +] diff --git a/python/protocols/__pycache__/__init__.cpython-310.pyc b/python/protocols/__pycache__/__init__.cpython-310.pyc new file mode 100644 index 0000000000000000000000000000000000000000..171fa20f4d4e45876042c65117cb6059875e981c GIT binary patch literal 636 zcmYk3$&M2-5Qg2^I!iC<4)6}SAaMjC1PmZ9gOCCotd=aR+exf(wHw%H$yF}@u0^Nml!SHv=XP863Hgi0H@#@Y!d<8(~)RMjWo<%Miym!pE0(bBM@~ zhfj)c4k5)#7|E5q;qD|j`ytF(z2Lh>YNlJYXSI^yC!f{4t%YLtAqiisWh?EL)w*p( zjWRwvx=taB^-ihdduGJXov_a5M$|%H3kJt5=hkuK9_yqJo|8=CxV<{R&wg>~*jgJV zumfL~PyD1a+UZ&=Yj89s%#4@;Vu%^Cvb(24l>^5RwX-G;_hFRBm1UOC-WE>!sr+gEjax7BTR&aPrC^vp5#yxaTnYtYS3 Oi8nZ5i`jl9$*kImQaW|J!r6%9owK(q)U!2v=>cM=Lvtz?g|fzVU#+3C?>9BLxnsr7*WexNNQ} zWiCXas|pH|amoJZkTRaH%5wi+Abehdu`Wd@K&?S6_f-y!m1zIfiEmF1G6O5kI8=aUoHtx;QD=+dAc6~iW>MQ9TuLWj^L&|I-k7!YDYLP!ZiLPi)7#)K0O z7YQMKH{u7|`Ym(kr%&<^#(S1O&R>GLw7Sl%Z}2%em#=kMK($a6h)-&!e9z>Nn88x# z$7*vSyoXkZhxNvFo-XxlRl+m8>*Z<&{sp~h B&-VZT literal 0 HcmV?d00001 diff --git a/python/protocols/__pycache__/protocols.cpython-310.pyc b/python/protocols/__pycache__/protocols.cpython-310.pyc new file mode 100644 index 0000000000000000000000000000000000000000..39e4d03c5ba0b74138cdd777fe0f945a726b45a2 GIT binary patch literal 15125 zcmdU0S#TW3d7f)$cV`bQfW^scC?3M{zC<~+tx$qQinatP1Sq;Dv{y^?EV$re7wQ?1 z;$~@4qMXC>5vSrKR>=V?d5DrY_kBIsdC2vYROMlwT$LxL@)V{jRg@*=`@3g$XBP`m za@h|7YJPP8eN6X%_dkthE@vtDx%+Rot`yHI%70KL{*yxGG#>9?R7GJ5Q|pQ&|Ei8E z>YAhBuU6Mr498HZO|K_bOve;uqn=zzIjNPjlNNQgZaJ2#u4mlr9o5O5RaksHa4I2=z3xP`5{yQO}C{FzPv$M?EjP6Q8W|S3yDc;s@tIil3bFJlZHtvp94K~3hUpJhI5I5!K*|b{}Z7H^eZAIH;*tX4` zV&hD$nru7U0sM3fZ@WXHEyZ@ShtReqdI$O&Y!}-N+}0l49<~>_ZLv8XcDILf%&-#L zc7$ya-emjOe&Fp5_yg=9@H+?2b%-5C+e1v9S4v0j5})TvYLI3Xzp_}bcpfUra}EEg z#@b3r3sSR{dcAVF?gqv)HP2t9{_!6jmD6~<#{gV~mvIy%!FgXvC!8IH*kPLi2U ziY1*iOM&+(C&SWiwyH6UWw4qY%VIUTAo;Afv~Xk9ZB0JwdR}G8wSClV7i)2O#jiCR z93rUP6+oj>nm~p?mcS4|U~<=A3Ct<|ZVEtg+ftJK35%*C3EK!bZ&XpIHKXV&WV*?P@w_~+f1 z*082vNUZ9)M*W7w2P4#H-sRU^e%|#~n+?y6b&?H1@eFU0L@;z&tNS4~@f7Dx?xbb) z@!3xYIyS>6unj?(7#Js<36R6%Q7xqys-fZO{^}!|=(9n_hwQDXaPWqXO=ZE+?cL{y(anN+$+x z@gU|c;kifJ+1(;GNG+RgkRPCN$sqrbh_?xM9Q}Od zdSHBN{<%5FT)4t(RX;Fi*F3+uGH~g%?2pr`#nP#^>C!!t_syjY5@rTNv(1%N4qF{b z*+dMn$(H19k^^N8+SPE&j&ZhCTjeKcokCr@Kq$^5Xm}EjM{!FeRgfvdZ`h6wl-NVgKDNu*&vrWp*dFH~+v^-+54(rqEoB^VgzW?I_XlZVT7cBY}Omfp!hXOO4 zTt6=m7$wjrGUS!MPWVZH)^KNB*UKIqB#`_hx(7q^euew9%|^prq#y)7j}QwL?`lvu zQ)|?`E3rmPVnpk37cYjm%*jwgSP2T<_A`}Q9nBUs%W^OhYZY%ndseiEwIC}dnwJU~ z$)Yg9v1YGS_>%i1 z0>?mXDhx85?1fcClP(rttt~m02sxfz^D$v+zH;Mfw_a~Lg@uLrc{oNF3l5lT7=B;-;3?CR@*#w-|qd4lp*ub1regG+nV)N$ZWms6tvhfq)s!hI9@lOfd z5o+l9IoeaB%CQZY<6>;vK4Kq5>v8*p{fK?ie$@UEF=Dp;2Y*bz;o7k1C_WeKZv%$G zE=9kn5e8K8mTdC)RF)WGrF=3{ZH^w0KV;^@Ks9WHd=@S~TyJMEw2xm5~AD)mTEo_ZPX zlp^s^8v6TFee>BMAhl{Vm5{l|?4zOl44Uadvu!qJbG%&J|2Hl~`+2@{qu#7+5Y(u- z=kEt`!JfHR!BG(@H@ogOmi#LZ;K2v;wCA-Ss`8WILXf;BGZ8`Nia61i=>#7bl-&yq zO2z~^=y~^m9Ap-|2g@MgQVu0h0?U&TY8lxrYf;AID2pUckn$+Wg?KWsT*^$97n{tz zhwwuQlB<$AfkA0bdALAG()pp(6eWFT@pzvB@RhcDTV?81g%9~E(`5Zk0DXzBtX4CerG`WAuc3)nFZ-gbR_z(<4!0=?E{{efc z>D%&@M|m7h2kf^szCh&*0Hs8rLzDvR1q6bC^2K8quO`G3M|?}SuE*$n87OoWOYr=s>b^%Ba6RT%|f)< z8VOzdq3(d5qaNj^I^6hWRD5M!y`$WuEUm`W$0&EJKS9t4YY9;^!&>qQWl6t@p46|X z+|=8;pK611lbH6V!H=}H^)%C#)V5Jn1ZUKB%g;~`QB&5lcpEtPr1Dwwrr9=07F6Y> zPqx+d+#TeLOL}WMa${Xa`puAkf(bb6D#+YwwPuifg4lZQIes2EK2M;-8~y@SFA}&6 z5STc8xD6I0uJf9Yl(QfwGQCT#Ulu6t1u0ZSD!P>9MC8D{yjHEcJTRqliC2)!GgfOX z1<7cfDGU94ONQ+KS4`zmwlk&Wjl7yyjdv}xpcd4;meNzIrKU6_r=`>$3dhVX#?^@O z@RV*5YV`Lg5aUSrZ$eSl!H_#pB`6Lli_UaXoVHRn`~+$SsSavp)DsF5A7l7Qs8lp2 z<)=}L##l@Tt4**v!4hCtqHPLRC;1tgqn!-dngLr=?UZ0^x}7G5gRRd{AGBC)i@)e+ znc21?MQ2GcJJs5bynbk%y6lcAED5YkBzN>rD)EjBjgH!q<*_SO-{q0&pR(slIbNf| z%K(7^!@xvhR7wgZ7NxjQ-bP9arMQH+gfc-xU|Knyy-FD&4nlwVDiF>@Xm*7j$1JZi z741iyLt!a9Sv)B`X_{9UX(t=Xku=%K@P+h|h29*X=Sl_Xh(^CX;0!DHPdwgU087j3 zBvY0i{WV|^AX8GZaG->|z26#+u<4OA zAPalSE{zE*E9^7hk8Sd+0N}Woq%6JRa9HcQL}^usK72a?o4`W^=qm%?Nq~~^d>=qy zR#sQZ(hPOxk=~QqB`Ql@~ zGm^}z+N~@&UqCAyLowoh+}v$00N=q2;sO9B>Ua!12|T7?@lLQT=_9{@#}X{I!Kw_f z`1l;MScm{vd?;+mhb$fvELJ)!mNOO5^DKG}lQ7^J#Zz3;CF8}+W19(q)S0dj@HVzk z8vihiBS$U;qQgS|3UJ_v)YUNfk?bo-WFPlpvXlush`=iB-Ib&u#B@WfASVa(@%;v^ zs*ms2f!jrVpFsiN_+nrAHu9XbK8sXRAMZmeBdl1Di-}u+dz8xsBfvg#E?|RxN9a7$ zgpbZ#Bp+%Eb-AxSR+}psypAD(iSLwai+*6NRu->viuVvMktY@J>)+2!G<*{K5g%wL zwb)8y>e#bL3SK&9>KZConlMpu39TA1H;}M-YBkr92O~cz0~HEcn10pZd;Byr+B!Z> zC*IO!=t-f}s|LC9JA+>>+n6Kj6;;K%+;$Fkmk z<^5N5WW(oWRE=i&Wo_pESPAjwqU$oxUa7o1vsP>P$B&gj#B;*W!EF)MMAna=q0(6b zPZKytzyUxk)1VMs1UABY2W^lgF;vOWDJR~>^LLzGvo6Z_c#d`S-7rf znLjkltd>$!2vb{|eTXB)%zeMZOTVoO3q)oJO0pT)~>5FKMq^P?O zPT5udWdePwa0|Evtd@TTh1SG|^~l*DxSEiQLYr+t(qF-R0~YdGpa(AGRWy92vygtm zbj?K1QbHP^ zokx@;Es*%eE+j~(&|E3O$uvkEBAp1#wMNGv#dqaogb9;s(Z9PdV5CdCqw5P6Z0$6~ zQKKDE6V5@5@7Wk_s>9nBDuYZ^$B7OLGo?mG3R{2FPvH!OGcPu7P)JW9d}xM}FikiG z`&Jui^R^Cm`SG@~o?(eQ6yRrRuJ{9q7!qWPSt&^@;=hcmzlzcWjn1d2yP&BsG2fu- zWq`nBuFx8?N+5gJ=vX9eAzg*&{3?yhKUHNL->Lar=GYDI$66_=$tmi^#s7 zVum0yK4XK-u?J)x5o8XXI`V`t_=5;NSF&Q}y=&A5(f6BJH~(3Hw`0bfe~Yk#bnzF^ z@Oh%;Gzt+d&3CPYq~f@0{I6kdq+mA=>7gJQsEC61DB9@J&Jht7baWG<2NCUPW-%1G zUIQ=AZ)D{|9X0ypiA;TuZswz`(_r|YwZ!`$1tvk5nFm0(Gl8h z)Qf~R&YIA0W(9j97xBPt3grye;=%@ zlx~g9`y7XUo4a)X2kBXnNob|R+l!~{R`!7X6df-X=uAsBT$K~~S+oruutSGG4+{)L z4xK4!JBxr3)l8@Tl+DTb2WD-l(d2GvD0W!di3WMLy+EZs1iGgq5uu9EjGO=$BC?B0 zB1#g5Ym};e=6(XWUnhwfL16@k)*01?aX)~d;efiE?q`N6u<(9n>Cu4~N9cYVKSba> z08ZJ+!8DqZN?y4vZjJGy)GiW&0t*DhR>-2sM8GjB9VhStfkz0OByf?yqXfim z$-&7h0c4UzTpH+z-Q|`A1y<02>^j}_l{e1#73#W1fDxd`fRjRZGgF+7^87l1n*=Bb z=eG#FN`L|^{sjW$DmmGBPIiyKPJlFU^BW33gI3a8?=*k~myn;NG*S4giL9~69BW!p z%@2)CZr{0mvN&BdilcapV!CLelmj$JQk-TB(%0R~UUTuP>u@pI zM0yzG4CE&fC`V%r#kX#pRS_nsN(*Ty3Wn%ZCr7=8H{aAhuU}WMQ+T}nyu0Y)25BcL zBr=ViP0h8YVp&BW`QoS}^ak;!7|T$OcUuWRHpu)^Ym2;KgwG4m-=3Et`IMzZ+|G6$03fEB%SNdJjKsw`Tw=@lDLr8>$--2pF50NlZH8pihdyoGX%~_>6Eg2-! z4i|MGq90;8)dkDvPTC7VER?v8$}5L!&RM6gNeXL3=Df{d~eu8 zl;)L}w35-9xLB$AHnwkjcz3N@Ta*$1!d$BuV^z2_P}q>m7Md>fmM9xhi8jOECP1X> zvra+&I^I>ryJQyd?}$tV^aGj9yb2Y;W2o9Y{I_W^X?%~PCPENF1Tjvd@T%&|%!E!K zQ}DqG65rO!i73vDWE47rPbll@JNRG%vguDN_*V|PEN`?XagU23r&X`pi{i3*B#*p; z7u?7F@CJQ{plr7#B}W)LVs6aN3FGt|g!@eZx?+#pO=Oi2y{r>jbQnaEQF?V*z8V2H ze2nMQf2xS{o_4EXm=Kpqm4BCJxd5<1JUSGi&?TY>9dSVq9rV!4@=&XFbr$qM24+1u zfF9cgJt}nl|6mh0?FUhX{|??nS9-}}$&Yb6sMJdZ{=0+|Lz! z0!$e9@rff^!4E(aaUUJBfowo19e;%Jn^J}UK3Wlf56i2O{oCPxKrfdpeb8pkQr8dM z4F5ywGS&g(CRkoPY96f-&C;gNxRpl>bl^nUQV_l*yWTE^t5lm zIrR#97J`oNo*NWDCwUtl+XZ7oBIF;y(NEKgyAjK#Y>i93h;0TjI42n#F5|z6yLrq{ znoryf`TOTYACmOwCvFM{(?=8Z(Lf(Ei78M;D@*#sT|T}R!!SnliOYUIl$IU>#YE*n zRC*Rm{V-Gt4dkW-%7?NOuH!utoWG#C{~BOZn()6wD`Y+|?+4pI>Mox7aJ%4tMg97u zKEEg~G?&A7Ti~Bu`QOmWiG$G(*{{fk@jpccjtO~fI3^$WsS)J}xA0M9^m$D3A*j#) zjQaJhJ4-K(e9?Gk)qhLt+9l%ZAW4A}eKmap$RI;shec41`yV8wfkFTD#%YUziI|3Z z(*8tv9$1}d&Y91{%`vk)FvI#ZFj=%WM-A=cGpqTt<&9ZfIwa#FI=xWo9Wb@?F>?} z&92+&_MH1Z@BluNlH+vqBiG`2_nv$1$Gi93bIv{Y;`yP?W@aFKn3_B9J;pG9g9$m9 zq{zdBj$z(pc!p_S`1F%jN)FQzibO)^B4L3$ITeeKspgZBW}bO? z6tHhHK?c_YtOb_nc^%<+Ju&bcG4cjd#2bl;FCxXfiJ19fVhI)#EAXnVOUDC$0zcS! zD{)NP0(PP3RBZC>E0@C`+Mw3ivQyz$EHoMR#{uOJL#M(d6rY-o5^ViLTr3~bSTV*d z2&@Pk00bim$7e`%Oj=TaVi;UV`1ddf;7w+j8G>hFXps;hs7sro5d;C`$U~s2zz(8d zx4w}H=m%#_(z~<>Y~UT8z(qrs!h+#SC^8d%hZVS3I5H8#&iRGYeLcb9SeV3u9l^ul z*v0ttP{`1Mz=y^=8XEkCz1{)ZR-&4rcV zyRO9cKEOQ07kdXd#3`6YN3r`*qj_}n()9RD1mo7x(HCbz5h=$pIyx~$V(|#{G&&90 z(2McuF^u#_;kBp61=rD;NTe?^6^_P-!Y|IiD+&(!lBc7QS46zvMjAd$u7t@@ICgnD z8Vjq4#0gpVHij`yoOMMBLK`ZHX4e@$<(qX8{!aP6ESQI$JPJ9 zYMVQfahJ@U$T+=o{TX*D#!9}}FOC`(&>l5hqmMRflcqqiV0ji67c3e&S^+3KYn3qK z7%9U;+98wdLLd&0dE?A!JaBt}K`8Ke=T2rk-Y=dM#|LRYk@0bX@R$N&HA@u@9ik_o?%DD@y#G=- zetvqqaD`FsLG80O_vnX0FA3ZLe|k_bo;^>dCgOszZzdL>zN9%IN3c=^*coL&8XlM} zbA1_$eeQ6^=9)X2v3b6DR2&eb)gBNO|68w}$)bQsaP&=Ix=cU`%WLN_l%4gdup117 zY7B}uUO^yWK&c7bvDvB1WB{txeD#x&;BsS{;~`0C1ABU#>C%R2huk0EE1 zx8}f1F@Tw305io1W{Qzmz+|z)pAF0wJN!AobaC=#;^HmD4F-#cw-GOI2b0%9N_i(3 zwN6sTyGS|jCKbGgRPtT|#v`fbOGypyBei@P@$==Rj;|o~d?jh%t4JeXO}6nhq=~O3 z&Agwq@O31>*OOMhfo$g+$qs%SY2%y7PQID6^DV($U@`@$$<)EOlFrHPfgM6ImAceu z!ndC-rD<)GDW?a>L7@F`H-at%;|RhCCJ_7%f}02y5xj-q>j>UM@IwS20hrnWdTi=5 z2u2aSfM62Ac?44kE+Dvv;QI*v48azKY;F0OEv({_(6h zvogFb#0@&Wu+cey_?f7iV7xpzAf+m9qn zN5pk2s-4{%E*dfj)d>zh9wPC+>1b562Epb*#Mw~nqToC_6`hKmS7n+-49#`r@U%#H zT(Dq-HiBBvXN;Wz6@KOFm!%mYEm#$ zlk*f_ypG5{kwmRNv)SQmK)n)KsdG3DuES;7@9DYYOu- zn2P{qRm=f$AZG}I{p>3Pi`wY|Q_xqI;Jg`^du{;G<<#G6H;_SWX~t7B zcM?dvKClM>oT2~_rR8&j833n6pk!rSURtLIZA}1J7%Wh1#_5?m4iB{Ry_u3SC{ImO zhZ~GC(fF^dL1Q0l1vmG%oqrTqeqP@Wz$00P6q-_sZBv2C#DBwWxiWEDx&kQ4Zgl7c2n^ z6QwBAq$m%T0Yx!VfF7<0Rzk`mrK)JkN>esc9jt*oyOgS>DF;nCi9c8ec`i%^>%p~E z$9s4N+&x~@tBND5f%gRKK--p3ZQCf(l`1Z*ZIIs-Y!0>z4XuCMc9t*g(&3chAJkGt zYiWI~GUc?)cD_Qp4d^xYrjk+JZ`So^@^6VSzsuhNIlKK`{yqM^ z{(b(Bi7{_)`-J|3K0%Q8*tE}xk+zw*`Ggdu@q>rTkJc*^i5NdRHe#3t46Ui9i|(`n z5)L1ED6yOxrGfcG-!6YQDE3^vEmGcvb{Ui=I<&^c{^#K1yq#F8rCU7`>Y6^GnQPlF z&RwqRj~x@=uCVy&%jmugMPz0;@-moQxWSZWypSH#+BE?aOijquP@a0q-y!jcRxO*= zv=RNr_|JW!{Iqd9kCU^}IEi&U6M7{w9a_hPnhk7NQ_GbQ_($MOz#jppbo~4l@wsY7fOeP05HCk+CJ-c!K_Yc}Tz5-ejmUx;7`qpMS31anN> z+KhsC+dL-j#~@C}FhUG0 zJ?7y(0BWCMaPqk>-nd^EH4Gbupj=_d_0rD_8{j;oXx86H!mtMe zhmm-uBWgka1ew0%KlciF-s zivpNq){KnRF&}?z|H6x}9awc&W!$|#Xn1%0`+;{W6V6i)^*WC|%jj%&*f^9|FP?d; zXx_H!saQO)+?%XyOL=zAn^qk)i?1%vCTsVn96j^gf3~|8UQXJ#&+9WL%XQl|+rs#L zQ)R~Co;OoI%k!JyY*U^RU^aoLASni|ldO8>P&bNaU7Sptd-7}>)CPGt9tEKdxCe6Z z*rOmQrO@YI5TsHX`xvE^y`Tsru~fT03P+C{^ab8Ksvp*mxa6|K%4%qXUL0Vf9G)j& z2$ev;bwlXmDG0o-ogL=dpe}hG0B5s9KwlU}U`2`{*N&(ki1%1w{=Ux9X;*g`z{a`1((i zuL6!-N1&`A@;WBpK=8W&1S2>i!r(G6yhNtraF{9bymfRk93Q195)(|2pog4+B7!3! z7|+d2OoWMG6a_790_ETM_*8UKD3Z$=r3lI$Nezh0t4La=aPB3Fj-3+X$3PiFFvtAN z<+)k$dc_-6^F~-ZcK7w*wcz5Jq^)MDF5OGt@~ErvhkZI zlBMklOZ)u3_bu&k`gi@*wNr~7iw#RfZ?)aGwmdM|uUoHKzc#$M_lFV_Z zcI(xfU3Jg|~RRSIv|8dS0*A2g6K6kpLrjj!46>9<+u^GXRw$3$|(# z`1sL!#f_j`7u$nt1qHoQB+Q7iW{0_Ty;5WiuLl{SAzyG^M-99oYJBclNhTC2G6Cd< zc3+2!a;p>SRo1=S-`vHRsAMFkcC>xa`}Czs}hVUvtziwX44RL_^Qr zP_p4*%J=j<_hsv9WgyYo`|d!pbud+VdY-#)Dua^6j_a0dmWAFg+aa-S`<)ZFPpq)t z99-#0HttE7>Q<|FCfbj`*PCoVm8u@ZLKUl(t%>c2-70M^eM=|GsT0>uEL!hdw?SK5NF)ljT3L2nlJvq;stXhQTx>0SMFX+ zR1c)wClb~ZSv_MdS#M`3w(DIgsoEK8LBQA*h7m=+Y1tP&&w)N}hPB5Ip-w0W+SUbN zm9?HL(5_l-+UtKru`7n0xpHz$mFt#qxu+^u!@sJ^)wuMh%EkL91){P4Z#HbRaeWz8 zn`I-w4`QI!o`xjPmxLR(Ba2eGI(X*V8D_zX(#=*K3&WNJF24DvC;Xyy;-8p_((6~T zk1B?vv6;)4VUGfP6M0jEJB1#9poH!g=!F-80-XFy03iHmC8Ofr(IusF8%WXaG9i5f zf^7)!g$a%dX+qG608eZMW9af_w8b1sJ>p)I;HwF8?W%nzN?XA$QA^v;fKHUYe*k$g zT#d2>{Cy<$$`Vj*;8{Ta#r_v$&oK|&-ua>j7RUAd*Y>~dNSAda%Q{k)j*QiFeel}g z;^A~vTe7NcIi7Aml59Vcs62Y#dQ2i;wR+OlZAt4k8fi*en`op3Y%&^YNLm||NY-L3 zH$P;IR&&>oh_jdEGwzt|+wr06=UFph>WM#+u*3O@yVB3GU@lOKZ4cx6vR3AyXk0z`~ADA51 z?bqxJ@wBfs>1(}j+MaQg&f7N;cYpCqi96MDRg5SYWhtm~kwFTADpy1Nsd6c-6EYg+5r_~Cv6owjRLJDIqQq2hq#^iJLPony4RNSyvus2W zhg8TYt>z*HLWUXIeBAuGl5&jp5f(EDC|v6W0mel`5CRruKtTX3uK0q`uFt&@w4pr? ztp$Z3sV=o%2#V%YP6(2FP$W?LD1r+eGNM3KL>T$^fCGsnnr)J+OcY;E5m_L;RI=0} z5l}arM4gkQf`rLAQ^bqI+L}X z_no^p6J)!RmAl@zc5EcbHWJVoS4rAcmvq%Fb)_4+lMUT>8`C|flRc*s&S%#2q8qB% zDGR|s(igaIYRw5jYOUvOQ5C~)97YkYSF=MfT!lfkcDcel27mRifg4Bpt$|dhpPAHw ztHbgsbVc~7PW?#t)YM>rBmWBO6^wB8cV;XuaF;`47s=NE1-?PL)xcdw-lTsY>2s5= z($WWT((!^UC_8CO|Lo0?*GHDTOYu9iw`Wr&o$s4=i#h?-ryP`#Sbz#Px@f-nNT_l@ zVSUiWQPU54Hi=`cp%aFbEw}taaOAES(cn1NaHXM(jo0_UK!>1oZadC%!+N+DZ`iF! zBy>S*I?faWSxYMbXBda|>$w10EuyW0cG9j_z1f~*;g=7lS*OS~lEm=$A0GV3FcY6> z>;7AGvHZi;f4Hh=X5lI*y|x6|;?3BWk4ggIj~)w$$7B9Wp_f}`rlRrPodMvxe!7*0 zoiQ>Rz2HL5VGLISnLuzJ!S4V7FItoy1fWZe?tv-8lKYr^9{_N$!l!~WC)FeuGlwS? zFRMnuVBbv7rLY zE(4fdR>tOeP+5EH;9CbpyJ@94RoRm;m90A52~R`H(Kyd#ERKcNl%#23iCsnfJzNrlh)xFk@JJXZbPA19&?^|1OTj||oP2rgSf08aGGM|XH zwI6g}tkl6~)+x;GgK0qV~?DbxIgj%?td zR}@arWN`)lKQZut2XUn@5LX%=h!MpQ*YY`lxZ*(YNJ>F&)sG@dqb?A`YV{%YC0AxjXWM}@aF^E%j76`x(=5Q}`-F))Kli;_`69J2#Umjn6HnID7qPjoj9!OXR zHj)6MUR^kQGk7ETzNvnb8U8J3a-)Tx^Je4B$`)}bpgtWP;h+KWV{w{O+h z)dDN%Rjk0FbfESPM+HVVwKOzrB(P7QHyEPaNQoE&T296e>*>A^wEHlpwI|~Z3MCU! z-WY8bYPT3?9hB)*W{b#rxZp)!{!bvbr4@1k$tj0Yo8!M?Qas-q4^z30W(qKI&I&Q3 zcoDgj$_nxUP{eRpKw!us<1Zj7$iLa#DR1kj2?bXoE+X5a>HSzX2sK8~D+E3uG)6=p z5Evuin;y9_vgCT>GxO#TEG4U+@|y=`NJ89XCd_3%Ng*^KXLns z<#?*0E8+C7dP)<%=9H&p`Ebg!E7P<$-E<(?bl~n}s_E#$;WtmiLh*KF4UDr4fVFh} zl0hkgvhv|m|0qkQOHa-B7bp`dXK~OUDQqAKj{(ywET!eJ(2{>DqrPdQ_Hs-=q-+c1 zzQDF2$NWr0xhXPf5dQMXklle+$i%n*iQXS<>Xc zBbF*UoWLC0{s>ZqY@2f&d>+{r6;D3f<{8R4CN1KSNjb2X%}j;=R^?ljOJ}}OGe7Ww zqkPp@ee>1VUtK!8+>`R{U3oF-+rPkNJif)cH@Y)TJMLV(eQ~8R)wD0&^i;Cxsk<+w znvTibScTkJk+ng+n{ZurXfNk!L%V!oN=qUB8BnV%5~>ho`qyxlb^-y+QhBX1?)DEX<*QZow@!Wi)N2U3yoxbY|u-e_>=4Wu(?S8EOBpW{##Na|dP z8#tKQCJbg}-K{6ydSdCtZ#)H?y$>vvt2K?cE`9yd^5I11p;QeT7&S*>I8kU?t2PVkSOxGdg&`-f3R#&Nc2>&FvX#B%*i-vD3vCo^$rFGQO7iVD zsnVM`z{epU2KaIGSnal3pMC4I%U!A3T?^csRv7a<9i@I%)C*Kc{V_lo_^r+lIiN2H zs=+rFWINc&6$9>O@x!{+2&yU5CAHPN5kU;Tl2@jvFh)()R z7=MioH;?HJnAu|K>mEJ+S?dn}5j+byiwDq{f{!)OtH+S%*x{GF1Uy*rfUp5E-be0( z>&TF_DEU2pf*T0II5ioaCgFfXb+Xe08R9{-)=|#aFcwYt< z-071(P;v`JV+Md|ZsEbQFI~PXS-$H#&FRkmWM_Y(Y#?PB0MmYxW8m`orLH^sZ|`5) zz8r*u-PZ56-mQ8!m>7CCJv5pe8cm#eA@RcW{mZdL{N-OT%naMB`?>gd$S^Omhjbv$ zFSC94C_9YMby$}vsS$4tE?!)&QofW@d;iSY#PFxn!=dDGD0Svs;+e68XFOpYUw7=R zS-kqa_>Zps@M>akG%JkGcSZ*ti?BnOy2$eQ z@Sa6zJF9!}OOM3GMC5Wh@^UirayoJ~8MzAe_Uevf^#i&gZ26MdWQ3({mJMT;Yj}ep zseJG3kAgo8rcb?)JoQ2%bUtx`q)x>WC*ujvOu{-tZ3M98-$1@V8(riO%0JgJN%bk^ zq}MTtTTyzmEU?0UEj(~RHB*q32&@P|B80{_XSt};#YhafJJsb##FGOGCUn9;!zpNyFFoOIGr2h_r zB?PEg32vivH|hvpy&!iHd>_FN5d0|ubfA*=5TI{};C7qf=7peTOwgty2?XT`wj-!Q z09SmZuiJbDV+e3j#*TsI|J%&Zxl)5EyNju6PFJ=kE8FLe&5xwG_Dub*bp4ab`X}d3 zEYzg9Co|s4o2PG_o;y6>oZ=cXRol~59m%Q=NVliBj!biRy7@q|`M}(%gr_mZ9mq6v zibsl2yf(#kKk)f)UcGU3?#TT96xWm~Et?xy(5LXHv`WldGIxA_EQMd#@rk*<2k;x* zWAnp6_rT!H>TCwjVmQmdW4ZVtJ|5~Bql@CRHKm5S#ga7!9@$;BhLbE(;&Yi>qtEOi zw$$KT9AD~Q9{Tq4?>xVJ@@`{d$5U`QFIn?6mh)wIm2E-*d0F^PXV+5aou1o0a7*9N zwbHnTkF3dM*uJd$w)q`%mVxL>d<`GjCY@p5(z!bqZeKv^eJf{?dSBM0GwheCA&S)S z$eM}_4NF6Jp1=KkmVxNX;Wd0@-JIb#yHtOt^>%BP!T5@IjXtwhm*E(@MDP?6n?1&^ zjAOgU*ld#p%SbsG#~gfSD>y?RE4PAiYzCiME2pXr<5&itS*y{|v2^Ip!0mx71JRYP zHGE{97Q+?#qh)-GJcgVl6u%Tc7n>ft7>PsOMhSp zKhZ)H2lmPgu$Oqf_*+n3U<=Mp1&7p)QK_S(7z+G8{KftN=syHYB+FS1b}#^Le&)t! zQYG8cj&1YYs-5*smUGH6EqWWOU{dB_m^s3Fb$h{p-+Zy4A1*`7z zw7W6sZd^K>a<|U+tx6YhTbKByBZ;!s`_}F7DT4U{dV{0;kGyxs|82!xt8x|X=Pt(C z^ml7+xNZ9ogoS-oJTgi6z|pzVkSN)E-?T4dviD!Q*uEn6OP)hj%uV)C z1-IDS3ekHy#NN}FVZ6%R$La4il^;5&zjx38@$Ykb$R*#zK{AWS5;$dJu=2P>^l`^7+7D=(v_f}^?fQd754*Q`C~8!Qxj8T;#tq&tXH)JB$ffrT z1_d<_kYi=;!!adh0%{I&$N>fb`1MElR0`UG;I^XziV{%n&;wRJQxQDa@Tk}@oT$K_4z4vhp^868 z4mk~^D4^C%jK%%6m(spnN#CyTTutvgnS_7lQ}Astclno2ta9exKJiaaECd$&7WX8a zb@#dYjM;O2=e3=S9`u!dqdH}7PIF+{HUE7KmJ9QR-sav8_Im-gx1IZ5s}bVVG|m$R z3OD>mDDZgPfG6)TS}Ht~-1kh`z?Q=(mtH`kbtJt|2FB zKszbt)wwN~=Cuti?W7@JzzjuaOhM3)I-A)eHc{$GcR;Afk(kB4g{+A{!z$O+MjZ2w zT2)ae7Zp7ml+LLtn<#wbUf{g_4`iSaQ01v9*&@l8Jxxhx6J?>2+AqOZ)*jPF5yj6T z-61P`k7Ey+xqAj9#I=ppnqLJ=>9$}gori2;VT$^DQF0*P5Davl&4>w(Z}VhOVI2ih%8bIT#|QvQm~KFFOQDO zEjI#%8Pp)Dg9xby@EZ-Z$)s+kf#7!$up^GcS7E_}C+-0KxaE@Hw8k+Qt8M!ZXtU3_|oop&Lo`n4-IYZX^kA5C|H3qEi*MHbEgvaCHzI z(1If)!Stl~e|va}?1WtS$HaG=*a3J^}t?|HNX=-i{Prr7Gcc97;S6C7^^B` zTU6wjda^gGhvx%B@tOgiS?`7@nq9+I8tF--h-1Ncx2(dTb5?i x&Hc&delY{iU}#2hUi+BB_VIaoh(2jQAe}8+PkQjsCqc5l!T)K1w&=;v{{x&TIurl^ literal 0 HcmV?d00001 diff --git a/python/protocols/protocols.py b/python/protocols/protocols.py new file mode 100644 index 0000000..6d76488 --- /dev/null +++ b/python/protocols/protocols.py @@ -0,0 +1,543 @@ +import io +import logging +import struct +from dataclasses import dataclass +from enum import IntEnum +from typing import Callable, List + +import websockets + +logger = logging.getLogger(__name__) + + +class MsgType(IntEnum): + """Message type enumeration""" + + Invalid = 0 + FullClientRequest = 0b1 + AudioOnlyClient = 0b10 + FullServerResponse = 0b1001 + AudioOnlyServer = 0b1011 + FrontEndResultServer = 0b1100 + Error = 0b1111 + + # Alias + ServerACK = AudioOnlyServer + + def __str__(self) -> str: + return self.name if self.name else f"MsgType({self.value})" + + +class MsgTypeFlagBits(IntEnum): + """Message type flag bits""" + + NoSeq = 0 # Non-terminal packet with no sequence + PositiveSeq = 0b1 # Non-terminal packet with sequence > 0 + LastNoSeq = 0b10 # Last packet with no sequence + NegativeSeq = 0b11 # Last packet with sequence < 0 + WithEvent = 0b100 # Payload contains event number (int32) + + +class VersionBits(IntEnum): + """Version bits""" + + Version1 = 1 + Version2 = 2 + Version3 = 3 + Version4 = 4 + + +class HeaderSizeBits(IntEnum): + """Header size bits""" + + HeaderSize4 = 1 + HeaderSize8 = 2 + HeaderSize12 = 3 + HeaderSize16 = 4 + + +class SerializationBits(IntEnum): + """Serialization method bits""" + + Raw = 0 + JSON = 0b1 + Thrift = 0b11 + Custom = 0b1111 + + +class CompressionBits(IntEnum): + """Compression method bits""" + + None_ = 0 + Gzip = 0b1 + Custom = 0b1111 + + +class EventType(IntEnum): + """Event type enumeration""" + + None_ = 0 # Default event + + # 1 ~ 49 Upstream Connection events + StartConnection = 1 + StartTask = 1 # Alias of StartConnection + FinishConnection = 2 + FinishTask = 2 # Alias of FinishConnection + + # 50 ~ 99 Downstream Connection events + ConnectionStarted = 50 # Connection established successfully + TaskStarted = 50 # Alias of ConnectionStarted + ConnectionFailed = 51 # Connection failed (possibly due to authentication failure) + TaskFailed = 51 # Alias of ConnectionFailed + ConnectionFinished = 52 # Connection ended + TaskFinished = 52 # Alias of ConnectionFinished + + # 100 ~ 149 Upstream Session events + StartSession = 100 + CancelSession = 101 + FinishSession = 102 + + # 150 ~ 199 Downstream Session events + SessionStarted = 150 + SessionCanceled = 151 + SessionFinished = 152 + SessionFailed = 153 + UsageResponse = 154 # Usage response + ChargeData = 154 # Alias of UsageResponse + + # 200 ~ 249 Upstream general events + TaskRequest = 200 + UpdateConfig = 201 + + # 250 ~ 299 Downstream general events + AudioMuted = 250 + + # 300 ~ 349 Upstream TTS events + SayHello = 300 + + # 350 ~ 399 Downstream TTS events + TTSSentenceStart = 350 + TTSSentenceEnd = 351 + TTSResponse = 352 + TTSEnded = 359 + PodcastRoundStart = 360 + PodcastRoundResponse = 361 + PodcastRoundEnd = 362 + + # 450 ~ 499 Downstream ASR events + ASRInfo = 450 + ASRResponse = 451 + ASREnded = 459 + + # 500 ~ 549 Upstream dialogue events + ChatTTSText = 500 # (Ground-Truth-Alignment) text for speech synthesis + + # 550 ~ 599 Downstream dialogue events + ChatResponse = 550 + ChatEnded = 559 + + # 650 ~ 699 Downstream dialogue events + # Events for source (original) language subtitle + SourceSubtitleStart = 650 + SourceSubtitleResponse = 651 + SourceSubtitleEnd = 652 + # Events for target (translation) language subtitle + TranslationSubtitleStart = 653 + TranslationSubtitleResponse = 654 + TranslationSubtitleEnd = 655 + + def __str__(self) -> str: + return self.name if self.name else f"EventType({self.value})" + + +@dataclass +class Message: + """Message object + + Message format: + 0 1 2 3 + | 0 1 2 3 4 5 6 7 | 0 1 2 3 4 5 6 7 | 0 1 2 3 4 5 6 7 | 0 1 2 3 4 5 6 7 | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Version | Header Size | Msg Type | Flags | + | (4 bits) | (4 bits) | (4 bits) | (4 bits) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Serialization | Compression | Reserved | + | (4 bits) | (4 bits) | (8 bits) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | | + | Optional Header Extensions | + | (if Header Size > 1) | + | | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | | + | Payload | + | (variable length) | + | | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + """ + + version: VersionBits = VersionBits.Version1 + header_size: HeaderSizeBits = HeaderSizeBits.HeaderSize4 + type: MsgType = MsgType.Invalid + flag: MsgTypeFlagBits = MsgTypeFlagBits.NoSeq + serialization: SerializationBits = SerializationBits.JSON + compression: CompressionBits = CompressionBits.None_ + + event: EventType = EventType.None_ + session_id: str = "" + connect_id: str = "" + sequence: int = 0 + error_code: int = 0 + + payload: bytes = b"" + + @classmethod + def from_bytes(cls, data: bytes) -> "Message": + """Create message object from bytes""" + if len(data) < 3: + raise ValueError( + f"Data too short: expected at least 3 bytes, got {len(data)}" + ) + + type_and_flag = data[1] + msg_type = MsgType(type_and_flag >> 4) + flag = MsgTypeFlagBits(type_and_flag & 0b00001111) + + msg = cls(type=msg_type, flag=flag) + msg.unmarshal(data) + return msg + + def marshal(self) -> bytes: + """Serialize message to bytes""" + buffer = io.BytesIO() + + # Write header + header = [ + (self.version << 4) | self.header_size, + (self.type << 4) | self.flag, + (self.serialization << 4) | self.compression, + ] + + header_size = 4 * self.header_size + if padding := header_size - len(header): + header.extend([0] * padding) + + buffer.write(bytes(header)) + + # Write other fields + writers = self._get_writers() + for writer in writers: + writer(buffer) + + return buffer.getvalue() + + def unmarshal(self, data: bytes) -> None: + """Deserialize message from bytes""" + buffer = io.BytesIO(data) + + # Read version and header size + version_and_header_size = buffer.read(1)[0] + self.version = VersionBits(version_and_header_size >> 4) + self.header_size = HeaderSizeBits(version_and_header_size & 0b00001111) + + # Skip second byte + buffer.read(1) + + # Read serialization and compression methods + serialization_compression = buffer.read(1)[0] + self.serialization = SerializationBits(serialization_compression >> 4) + self.compression = CompressionBits(serialization_compression & 0b00001111) + + # Skip header padding + header_size = 4 * self.header_size + read_size = 3 + if padding_size := header_size - read_size: + buffer.read(padding_size) + + # Read other fields + readers = self._get_readers() + for reader in readers: + reader(buffer) + + # Check for remaining data + remaining = buffer.read() + if remaining: + raise ValueError(f"Unexpected data after message: {remaining}") + + def _get_writers(self) -> List[Callable[[io.BytesIO], None]]: + """Get list of writer functions""" + writers = [] + + if self.flag == MsgTypeFlagBits.WithEvent: + writers.extend([self._write_event, self._write_session_id]) + + if self.type in [ + MsgType.FullClientRequest, + MsgType.FullServerResponse, + MsgType.FrontEndResultServer, + MsgType.AudioOnlyClient, + MsgType.AudioOnlyServer, + ]: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + writers.append(self._write_sequence) + elif self.type == MsgType.Error: + writers.append(self._write_error_code) + else: + raise ValueError(f"Unsupported message type: {self.type}") + + writers.append(self._write_payload) + return writers + + def _get_readers(self) -> List[Callable[[io.BytesIO], None]]: + """Get list of reader functions""" + readers = [] + + if self.type in [ + MsgType.FullClientRequest, + MsgType.FullServerResponse, + MsgType.FrontEndResultServer, + MsgType.AudioOnlyClient, + MsgType.AudioOnlyServer, + ]: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + readers.append(self._read_sequence) + elif self.type == MsgType.Error: + readers.append(self._read_error_code) + else: + raise ValueError(f"Unsupported message type: {self.type}") + + if self.flag == MsgTypeFlagBits.WithEvent: + readers.extend( + [self._read_event, self._read_session_id, self._read_connect_id] + ) + + readers.append(self._read_payload) + return readers + + def _write_event(self, buffer: io.BytesIO) -> None: + """Write event""" + buffer.write(struct.pack(">i", self.event)) + + def _write_session_id(self, buffer: io.BytesIO) -> None: + """Write session ID""" + if self.event in [ + EventType.StartConnection, + EventType.FinishConnection, + EventType.ConnectionStarted, + EventType.ConnectionFailed, + ]: + return + + session_id_bytes = self.session_id.encode("utf-8") + size = len(session_id_bytes) + if size > 0xFFFFFFFF: + raise ValueError(f"Session ID size ({size}) exceeds max(uint32)") + + buffer.write(struct.pack(">I", size)) + if size > 0: + buffer.write(session_id_bytes) + + def _write_sequence(self, buffer: io.BytesIO) -> None: + """Write sequence number""" + buffer.write(struct.pack(">i", self.sequence)) + + def _write_error_code(self, buffer: io.BytesIO) -> None: + """Write error code""" + buffer.write(struct.pack(">I", self.error_code)) + + def _write_payload(self, buffer: io.BytesIO) -> None: + """Write payload""" + size = len(self.payload) + if size > 0xFFFFFFFF: + raise ValueError(f"Payload size ({size}) exceeds max(uint32)") + + buffer.write(struct.pack(">I", size)) + buffer.write(self.payload) + + def _read_event(self, buffer: io.BytesIO) -> None: + """Read event""" + event_bytes = buffer.read(4) + if event_bytes: + self.event = EventType(struct.unpack(">i", event_bytes)[0]) + + def _read_session_id(self, buffer: io.BytesIO) -> None: + """Read session ID""" + if self.event in [ + EventType.StartConnection, + EventType.FinishConnection, + EventType.ConnectionStarted, + EventType.ConnectionFailed, + EventType.ConnectionFinished, + ]: + return + + size_bytes = buffer.read(4) + if size_bytes: + size = struct.unpack(">I", size_bytes)[0] + if size > 0: + session_id_bytes = buffer.read(size) + if len(session_id_bytes) == size: + self.session_id = session_id_bytes.decode("utf-8") + + def _read_connect_id(self, buffer: io.BytesIO) -> None: + """Read connection ID""" + if self.event in [ + EventType.ConnectionStarted, + EventType.ConnectionFailed, + EventType.ConnectionFinished, + ]: + size_bytes = buffer.read(4) + if size_bytes: + size = struct.unpack(">I", size_bytes)[0] + if size > 0: + self.connect_id = buffer.read(size).decode("utf-8") + + def _read_sequence(self, buffer: io.BytesIO) -> None: + """Read sequence number""" + sequence_bytes = buffer.read(4) + if sequence_bytes: + self.sequence = struct.unpack(">i", sequence_bytes)[0] + + def _read_error_code(self, buffer: io.BytesIO) -> None: + """Read error code""" + error_code_bytes = buffer.read(4) + if error_code_bytes: + self.error_code = struct.unpack(">I", error_code_bytes)[0] + + def _read_payload(self, buffer: io.BytesIO) -> None: + """Read payload""" + size_bytes = buffer.read(4) + if size_bytes: + size = struct.unpack(">I", size_bytes)[0] + if size > 0: + self.payload = buffer.read(size) + + def __str__(self) -> str: + """String representation""" + if self.type in [MsgType.AudioOnlyServer, MsgType.AudioOnlyClient]: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + return f"MsgType: {self.type}, EventType:{self.event}, Sequence: {self.sequence}, PayloadSize: {len(self.payload)}" + return f"MsgType: {self.type}, EventType:{self.event}, PayloadSize: {len(self.payload)}" + elif self.type == MsgType.Error: + return f"MsgType: {self.type}, EventType:{self.event}, ErrorCode: {self.error_code}, Payload: {self.payload.decode('utf-8', 'ignore')}" + else: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + return f"MsgType: {self.type}, EventType:{self.event}, Sequence: {self.sequence}, Payload: {self.payload.decode('utf-8', 'ignore')}" + return f"MsgType: {self.type}, EventType:{self.event}, Payload: {self.payload.decode('utf-8', 'ignore')}" + + +async def receive_message(websocket: websockets.WebSocketClientProtocol) -> Message: + """Receive message from websocket""" + try: + data = await websocket.recv() + if isinstance(data, str): + raise ValueError(f"Unexpected text message: {data}") + elif isinstance(data, bytes): + msg = Message.from_bytes(data) + logger.info(f"Received: {msg}") + return msg + else: + raise ValueError(f"Unexpected message type: {type(data)}") + except Exception as e: + logger.error(f"Failed to receive message: {e}") + raise + + +async def wait_for_event( + websocket: websockets.WebSocketClientProtocol, + msg_type: MsgType, + event_type: EventType, +) -> Message: + """Wait for specific event""" + while True: + msg = await receive_message(websocket) + if msg.type != msg_type or msg.event != event_type: + raise ValueError(f"Unexpected message: {msg}") + if msg.type == msg_type and msg.event == event_type: + return msg + + +async def full_client_request( + websocket: websockets.WebSocketClientProtocol, payload: bytes +) -> None: + """Send full client message""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.NoSeq) + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def audio_only_client( + websocket: websockets.WebSocketClientProtocol, payload: bytes, flag: MsgTypeFlagBits +) -> None: + """Send audio-only client message""" + msg = Message(type=MsgType.AudioOnlyClient, flag=flag) + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def start_connection(websocket: websockets.WebSocketClientProtocol) -> None: + """Start connection""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.StartConnection + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def finish_connection(websocket: websockets.WebSocketClientProtocol) -> None: + """Finish connection""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.FinishConnection + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def start_session( + websocket: websockets.WebSocketClientProtocol, payload: bytes, session_id: str +) -> None: + """Start session""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.StartSession + msg.session_id = session_id + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def finish_session( + websocket: websockets.WebSocketClientProtocol, session_id: str +) -> None: + """Finish session""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.FinishSession + msg.session_id = session_id + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def cancel_session( + websocket: websockets.WebSocketClientProtocol, session_id: str +) -> None: + """Cancel session""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.CancelSession + msg.session_id = session_id + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def task_request( + websocket: websockets.WebSocketClientProtocol, payload: bytes, session_id: str +) -> None: + """Send task request""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.TaskRequest + msg.session_id = session_id + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) diff --git a/python/tts_client-本地tts.py b/python/tts_client-本地tts.py new file mode 100644 index 0000000..65b184b --- /dev/null +++ b/python/tts_client-本地tts.py @@ -0,0 +1,551 @@ +import asyncio +import json +import websockets +import numpy as np +import sounddevice as sd +from typing import Optional, Callable, Dict, Any, Coroutine, List +from dataclasses import dataclass, field +import uuid + + +@dataclass +class TTSRequest: + """TTS请求对象（带唯一标识）""" + tts_text: str + mode: str = "预训练音色" + sft_spk: str = "" + seed: int = field(default_factory=lambda: np.random.randint(1, 100000000)) + stream: bool = True + speed: float = 1.0 + prompt_wav: str = "" + instruct_text: str = "" + request_id: str = field(default_factory=lambda: str(uuid.uuid4())) # 唯一请求ID + + +class CosyVoiceTTSSocketClient: + """CosyVoice TTS WebSocket 客户端（异步/流式/带任务队列）""" + + def __init__(self, ws_url: str = "ws://localhost:50000/ws/tts", max_queue_size: int = 100): + """ + 初始化客户端 + :param ws_url: WebSocket 服务端地址 + :param max_queue_size: 最大队列长度（防止内存溢出） + """ + self.ws_url = ws_url + self.websocket: Optional[websockets.WebSocketClientProtocol] = None + self.is_connected = False + self.is_processing = False # 是否正在处理请求 + + # 异步任务队列（FIFO） + self.request_queue: asyncio.Queue[TTSRequest] = asyncio.Queue(maxsize=max_queue_size) + + # 回调函数定义（所有回调都带request_id，方便关联请求） + self.on_task_enqueue: Callable[[str], None] = lambda req_id: None # 任务入队回调 + self.on_start: Callable[[str, Dict[str, Any]], None] = lambda req_id, data: None # 合成开始回调 + self.on_audio_chunk: Callable[[str, np.ndarray], None] = lambda req_id, chunk: None # 音频块回调 + self.on_end: Callable[[str, Dict[str, Any]], None] = lambda req_id, data: None # 合成结束回调 + self.on_error: Callable[[str, str], None] = lambda req_id, msg: None # 错误回调 + self.on_queue_full: Callable[[str], None] = lambda req_id: None # 队列满回调 + + # 音频播放流 + self.play_stream: Optional[sd.OutputStream] = None + self.current_req_id: Optional[str] = None + + # 是否启用播放功能 + self.enable_playback: bool = True + + # 外部回调函数，用于返回完整结果 + self.external_callback: Optional[Callable[[str, Dict[str, Any]], None]] = None + + # 存储每个请求的音频数据 + self.audio_buffers: Dict[str, List[np.ndarray]] = {} + + async def connect(self): + """建立 WebSocket 连接（初始化一次）""" + if not self.is_connected: + try: + self.websocket = await websockets.connect(self.ws_url) + self.is_connected = True + print(f"成功连接到 TTS 服务端: {self.ws_url}") + + # 启动队列消费协程（后台运行） + asyncio.create_task(self._consume_queue()) + except Exception as e: + raise ConnectionError(f"连接失败: {str(e)}") + + async def disconnect(self): + """关闭 WebSocket 连接""" + if self.is_connected and self.websocket: + await self.websocket.close() + self.is_connected = False + self.websocket = None + print("已断开与 TTS 服务端的连接") + + if self.play_stream: + self.play_stream.stop() + self.play_stream.close() + self.play_stream = None + + def set_external_callback(self, callback: Callable[[str, Dict[str, Any]], None]): + """设置外部回调函数，用于返回完整结果""" + self.external_callback = callback + + def set_playback_enabled(self, enabled: bool): + """设置是否启用音频播放""" + self.enable_playback = enabled + + async def add_tts_request(self, tts_text: str, **kwargs) -> str: + """ + 添加TTS请求到队列（异步非阻塞） + :param tts_text: 要合成的文本 + :param kwargs: 其他TTS参数 + :return: 唯一请求ID + """ + # 创建请求对象 + request = TTSRequest(tts_text=tts_text, **kwargs) + req_id = request.request_id + + # 初始化音频缓冲区 + self.audio_buffers[req_id] = [] + + # 异步入队 + try: + await self.request_queue.put(request) + self.on_task_enqueue(req_id) + print(f"请求 {req_id} 已加入队列，当前队列长度: {self.request_queue.qsize()}") + return req_id + except asyncio.QueueFull: + self.on_queue_full(req_id) + raise Exception(f"队列已满，请求 {req_id} 入队失败") + + async def _consume_queue(self): + """消费队列（后台协程，自动处理排队请求）""" + print("队列消费协程已启动") + while True: + try: + # 等待队列中有请求（阻塞） + request = await self.request_queue.get() + req_id = request.request_id + + # 标记为处理中 + self.is_processing = True + print(f"开始处理请求 {req_id}，剩余队列长度: {self.request_queue.qsize()}") + + # 处理当前请求 + await self._process_single_request(request) + + # 标记任务完成 + self.request_queue.task_done() + self.is_processing = False + + except Exception as e: + print(f"队列消费异常: {str(e)}") + self.is_processing = False + # 短暂等待后继续消费，避免死循环 + await asyncio.sleep(0.1) + + async def _process_single_request(self, request: TTSRequest): + """处理单个TTS请求""" + req_id = request.request_id + + # 参数校验 + if not request.tts_text: + self.on_error(req_id, "合成文本不能为空") + return + + # 确保已连接 + if not self.is_connected: + try: + await self.connect() + except Exception as e: + self.on_error(req_id, f"连接失败: {str(e)}") + return + + # 构造请求数据 + request_data = { + "tts_text": request.tts_text, + "mode": request.mode, + "sft_spk": request.sft_spk, + "seed": request.seed, + "stream": request.stream, + "speed": request.speed, + "prompt_wav": request.prompt_wav, + "instruct_text": request.instruct_text + } + + try: + # 发送请求 + await self.websocket.send(json.dumps(request_data)) + + # 处理返回的流式数据 + await self._handle_response(req_id) + + except websockets.exceptions.ConnectionClosed: + self.is_connected = False + self.on_error(req_id, "连接已关闭") + except Exception as e: + self.on_error(req_id, f"处理请求失败: {str(e)}") + + async def _handle_response(self, req_id: str): + """处理单个请求的服务端响应""" + if not self.websocket: + return + + try: + sample_rate = None + while True: + # 接收服务端消息（异步） + response = await self.websocket.recv() + data = json.loads(response) + + # 根据状态分发到不同回调（都带req_id） + status = data.get("status") + if status == "start": + # 合成开始 - 返回采样率等信息 + sample_rate = data.get("sample_rate") + self.on_start(req_id, data) + + elif status == "stream": + # 流式音频块 - 转为 numpy 数组 + audio_chunk = np.array(data["audio_chunk"], dtype=np.float32) + + # 保存到缓冲区 + self.audio_buffers[req_id].append(audio_chunk) + + # 音频块回调 + self.on_audio_chunk(req_id, audio_chunk) + + elif status == "end": + # 合成结束 + self.on_end(req_id, data) + + # 组装完整音频数据 + full_audio = np.concatenate(self.audio_buffers[req_id]) if self.audio_buffers[req_id] else np.array( + [], dtype=np.float32) + + # 准备返回给外部回调的数据 + result_data = { + "status": "completed", + "request_id": req_id, + "sample_rate": sample_rate, + "audio_data": full_audio, + "audio_length": len(full_audio), + "message": data.get("msg", "合成完成") + } + + # 调用外部回调（非阻塞） + if self.external_callback: + # 使用create_task确保回调不会阻塞主流程 + asyncio.create_task(self._call_external_callback(req_id, result_data)) + + # 清理缓冲区 + if req_id in self.audio_buffers: + del self.audio_buffers[req_id] + + break + + elif status == "error": + # 错误处理 + error_msg = data.get("msg", "未知错误") + self.on_error(req_id, error_msg) + + # 准备错误结果数据 + error_data = { + "status": "error", + "request_id": req_id, + "message": error_msg + } + + # 调用外部回调 + if self.external_callback: + asyncio.create_task(self._call_external_callback(req_id, error_data)) + + # 清理缓冲区 + if req_id in self.audio_buffers: + del self.audio_buffers[req_id] + + break + + except Exception as e: + error_msg = f"接收数据异常: {str(e)}" + self.on_error(req_id, error_msg) + + # 准备错误结果数据 + error_data = { + "status": "error", + "request_id": req_id, + "message": error_msg + } + + # 调用外部回调 + if self.external_callback: + asyncio.create_task(self._call_external_callback(req_id, error_data)) + + # 清理缓冲区 + if req_id in self.audio_buffers: + del self.audio_buffers[req_id] + + async def _call_external_callback(self, req_id: str, result_data: Dict[str, Any]): + """异步调用外部回调函数""" + try: + if self.external_callback: + # 确保回调是异步的，不会阻塞 + if asyncio.iscoroutinefunction(self.external_callback): + await self.external_callback(req_id, result_data) + else: + # 如果是同步函数，在线程池中执行 + await asyncio.get_event_loop().run_in_executor( + None, self.external_callback, req_id, result_data + ) + except Exception as e: + print(f"外部回调执行异常: {str(e)}") + + def _play_audio_chunk(self, chunk: np.ndarray): + """播放音频块（非阻塞）""" + if not self.enable_playback or not self.play_stream: + return + + try: + if chunk.size > 0: + self.play_stream.write(chunk) + except Exception as e: + print(f"音频播放异常: {str(e)}") + + async def wait_queue_empty(self): + """等待队列所有任务处理完成（阻塞）""" + await self.request_queue.join() + print("所有队列任务已处理完成") + + +# ------------------------------ +# 使用示例 +# ------------------------------ +class TTSManager: + """TTS管理器 - 供外部代码调用""" + + def __init__(self, ws_url: str = "ws://localhost:50000/ws/tts"): + self.client = CosyVoiceTTSSocketClient(ws_url) + self._setup_callbacks() + + def _setup_callbacks(self): + """设置内部回调""" + + # 合成开始回调 + def on_tts_start(req_id, data): + print(f"\n🎤 开始合成 [{req_id[:8]}] - 采样率: {data.get('sample_rate')}") + + # 初始化播放流（如果需要播放） + if self.client.enable_playback: + sample_rate = data.get("sample_rate", 24000) + if self.client.play_stream: + self.client.play_stream.stop() + self.client.play_stream.close() + + self.client.play_stream = sd.OutputStream( + samplerate=sample_rate, + channels=1, + dtype=np.float32 + ) + self.client.play_stream.start() + self.client.current_req_id = req_id + + # 音频块回调 + def on_audio_chunk(req_id, chunk): + if req_id == self.client.current_req_id: + self.client._play_audio_chunk(chunk) + + # 合成结束回调 + def on_tts_end(req_id, data): + print(f"🏁 合成完成 [{req_id[:8]}] - {data.get('msg', '完成')}") + + # 错误回调 + def on_tts_error(req_id, msg): + print(f"❌ 合成失败 [{req_id[:8]}] - {msg}") + + self.client.on_start = on_tts_start + self.client.on_audio_chunk = on_audio_chunk + self.client.on_end = on_tts_end + self.client.on_error = on_tts_error + + async def initialize(self): + """初始化连接""" + await self.client.connect() + + async def shutdown(self): + """关闭连接""" + await self.client.disconnect() + + def set_result_callback(self, callback: Callable[[str, Dict[str, Any]], None]): + """设置结果回调函数""" + self.client.set_external_callback(callback) + + def set_playback_enabled(self, enabled: bool): + """设置是否启用播放""" + self.client.set_playback_enabled(enabled) + + async def synthesize(self, text: str, **kwargs) -> str: + """ + 异步合成文本（非阻塞） + :param text: 要合成的文本 + :param kwargs: 其他参数（mode, sft_spk, speed等） + :return: 请求ID + """ + return await self.client.add_tts_request(text, **kwargs) + + async def wait_all_completed(self): + """等待所有任务完成""" + await self.client.wait_queue_empty() + + +# ------------------------------ +# 外部调用示例 +# ------------------------------ +async def external_usage_example(): + """外部代码使用示例""" + + # 1. 创建TTS管理器 + tts_manager = TTSManager(ws_url="ws://10.10.10.202:50000/ws/tts") + + # 2. 设置结果回调函数（接收完整结果） + def handle_tts_result1(req_id: str, result: Dict[str, Any]): + """处理TTS结果回调""" + status = result.get("status") + + if status == "completed": + audio_data = result.get("audio_data") + sample_rate = result.get("sample_rate") + audio_length = result.get("audio_length") + + print(f"✅ 收到TTS结果 [{req_id[:8]}]: 长度{audio_length}采样点, 采样率{sample_rate}Hz") + + # 这里可以保存音频文件或进行其他处理 + # 注意：audio_data是完整的numpy数组 + + elif status == "error": + error_msg = result.get("message") + print(f"❌ TTS处理失败 [{req_id[:8]}]: {error_msg}") + + def handle_tts_result(req_id: str, result: Dict[str, Any]): + """处理TTS结果回调 - 保存为PCM文件""" + print('处理TTS结果回调', result) + status = result.get("status") + print('status') + if status == "completed": + audio_data = result.get("audio_data") + sample_rate = result.get("sample_rate") + + if audio_data is not None and len(audio_data) > 0: + # 转换为PCM数据 + pcm_data = (audio_data.astype(np.float32) * 32767).astype(np.int16) + pcm_bytes = pcm_data.tobytes() + + # 保存为PCM文件 + filename = f"tts_output_{req_id[:8]}.pcm" + with open(filename, "wb") as f: + f.write(pcm_bytes) + + print(f"💾 PCM文件已保存: {filename}, 大小: {len(pcm_bytes)}字节") + + return filename + + elif status == "error": + error_msg = result.get("message") + print(f"❌ TTS处理失败 [{req_id[:8]}]: {error_msg}") + + return None + tts_manager.set_result_callback(handle_tts_result) + + # 3. 设置是否播放（可选，默认True） + tts_manager.set_playback_enabled(True) # 设置为False则不播放 + + # 4. 初始化连接 + await tts_manager.initialize() + + # 5. 异步合成多个文本（非阻塞） + texts = [ + "你好，这是第一个排队的TTS请求。", + "我是第二个请求，会等第一个处理完再执行。", + "第三个请求，支持流式播放和队列管理。", + "第四个请求，测试队列的自动消费功能。", + "最后一个请求，处理完成后会自动结束。" + ] + + req_ids = [] + for i, text in enumerate(texts): + req_id = await tts_manager.synthesize( + text, + mode="预训练音色", + sft_spk="中文女", + speed=1.0 + ) + req_ids.append(req_id) + print(f"已提交请求 {i + 1}: ID={req_id[:8]}") + + # 可以立即继续其他操作，不需要等待 + await asyncio.sleep(0.5) # 模拟其他操作 + + # 6. 可以在这里做其他事情，TTS会在后台处理 + + # 7. 等待所有TTS任务完成（可选） + await tts_manager.wait_all_completed() + + # 8. 关闭连接 + await tts_manager.shutdown() + + +async def advanced_usage_example(): + """高级使用示例：动态控制播放和结果处理""" + + tts_manager = TTSManager(ws_url="ws://10.10.10.202:50000/ws/tts") + + # 自定义结果处理器 + class ResultProcessor: + def __init__(self): + self.results = {} + + async def process_result(self, req_id: str, result: Dict[str, Any]): + """异步处理结果""" + if result.get("status") == "completed": + # 保存音频数据等处理 + self.results[req_id] = result + print(f"处理完成: {req_id[:8]}, 音频长度: {result.get('audio_length')}") + + # 这里可以添加自定义逻辑，如保存到文件、发送到网络等 + + processor = ResultProcessor() + tts_manager.set_result_callback(processor.process_result) + + # 禁用播放，只获取数据 + tts_manager.set_playback_enabled(False) + + await tts_manager.initialize() + + # 批量合成 + tasks = [] + for i in range(3): + text = f"这是第{i+1}个测试文本，用于演示高级功能。" + task = tts_manager.synthesize(text) + tasks.append(task) + + # 并行提交所有请求 + req_ids = await asyncio.gather(*tasks) + + # 等待完成 + await tts_manager.wait_all_completed() + await tts_manager.shutdown() + + print(f"所有任务完成，共处理 {len(processor.results)} 个结果") + +if __name__ == "__main__": + # 运行示例 + try: + # 基础使用示例 + asyncio.run(external_usage_example()) + + # 高级使用示例（取消注释运行） + # asyncio.run(advanced_usage_example()) + + except KeyboardInterrupt: + print("\n程序被用户中断") + except Exception as e: + print(f"程序异常: {str(e)}") \ No newline at end of file diff --git a/python/tts_client.py b/python/tts_client.py index 65b184b..d508fd7 100644 --- a/python/tts_client.py +++ b/python/tts_client.py @@ -3,38 +3,73 @@ import json import websockets import numpy as np import sounddevice as sd -from typing import Optional, Callable, Dict, Any, Coroutine, List +from typing import Optional, Callable, Dict, Any, List from dataclasses import dataclass, field import uuid +import copy +from protocols import ( + EventType, + MsgType, + finish_connection, + finish_session, + receive_message, + start_connection, + start_session, + task_request, + wait_for_event, +) + +# ------------------------------ +# 配置常量（可根据需求调整） +# ------------------------------ +DEFAULT_APPID = "7069844318" +DEFAULT_ACCESS_TOKEN = "osFMEJr20SSTWRql43cJlZkAOg7iwvxu" +DEFAULT_ENDPOINT = "wss://openspeech.bytedance.com/api/v3/tts/bidirection" +DEFAULT_VOICE_TYPE = "zh_female_gaolengyujie_emo_v2_mars_bigtts" +DEFAULT_ENCODING = "pcm" +DEFAULT_SAMPLE_RATE = 16000 @dataclass class TTSRequest: """TTS请求对象（带唯一标识）""" tts_text: str - mode: str = "预训练音色" - sft_spk: str = "" - seed: int = field(default_factory=lambda: np.random.randint(1, 100000000)) - stream: bool = True - speed: float = 1.0 - prompt_wav: str = "" - instruct_text: str = "" + voice_type: str = DEFAULT_VOICE_TYPE + encoding: str = DEFAULT_ENCODING + speed: float = 1.0 # 语速（字节跳动TTS支持，需服务端兼容） + stream: bool = True # 是否流式合成 request_id: str = field(default_factory=lambda: str(uuid.uuid4())) # 唯一请求ID + session_id: str = field(default_factory=lambda: str(uuid.uuid4())) # 会话ID（每个请求一个会话） -class CosyVoiceTTSSocketClient: - """CosyVoice TTS WebSocket 客户端（异步/流式/带任务队列）""" +class ByteDanceTTSSocketClient: + """字节跳动 TTS WebSocket 客户端（异步/流式/带任务队列）""" - def __init__(self, ws_url: str = "ws://localhost:50000/ws/tts", max_queue_size: int = 100): + def __init__( + self, + appid: str = DEFAULT_APPID, + access_token: str = DEFAULT_ACCESS_TOKEN, + endpoint: str = DEFAULT_ENDPOINT, + max_queue_size: int = 100 + ): """ 初始化客户端 - :param ws_url: WebSocket 服务端地址 + :param appid: 字节跳动APP ID + :param access_token: 访问令牌 + :param endpoint: WebSocket 服务端地址 :param max_queue_size: 最大队列长度（防止内存溢出） """ - self.ws_url = ws_url + # 基础配置 + self.appid = appid + self.access_token = access_token + self.endpoint = endpoint + self.max_queue_size = max_queue_size + + # WebSocket 连接状态 self.websocket: Optional[websockets.WebSocketClientProtocol] = None self.is_connected = False self.is_processing = False # 是否正在处理请求 + self.logid: Optional[str] = None # 服务端返回的日志ID # 异步任务队列（FIFO） self.request_queue: asyncio.Queue[TTSRequest] = asyncio.Queue(maxsize=max_queue_size) @@ -42,45 +77,84 @@ class CosyVoiceTTSSocketClient: # 回调函数定义（所有回调都带request_id，方便关联请求） self.on_task_enqueue: Callable[[str], None] = lambda req_id: None # 任务入队回调 self.on_start: Callable[[str, Dict[str, Any]], None] = lambda req_id, data: None # 合成开始回调 - self.on_audio_chunk: Callable[[str, np.ndarray], None] = lambda req_id, chunk: None # 音频块回调 + self.on_audio_chunk: Callable[[str, bytes], None] = lambda req_id, chunk: None # 音频块回调（原始字节） self.on_end: Callable[[str, Dict[str, Any]], None] = lambda req_id, data: None # 合成结束回调 self.on_error: Callable[[str, str], None] = lambda req_id, msg: None # 错误回调 self.on_queue_full: Callable[[str], None] = lambda req_id: None # 队列满回调 - # 音频播放流 + # 音频播放相关（支持MP3格式直接播放） self.play_stream: Optional[sd.OutputStream] = None self.current_req_id: Optional[str] = None + self.enable_playback: bool = True # 是否启用实时播放 - # 是否启用播放功能 - self.enable_playback: bool = True - - # 外部回调函数，用于返回完整结果 + # 外部回调函数（返回完整结果） self.external_callback: Optional[Callable[[str, Dict[str, Any]], None]] = None - # 存储每个请求的音频数据 - self.audio_buffers: Dict[str, List[np.ndarray]] = {} + # 存储每个请求的完整音频数据（原始字节） + self.audio_buffers: Dict[str, List[bytes]] = {} + + def _get_resource_id(self, voice_type: str) -> str: + """根据音色类型获取资源ID（字节跳动TTS协议要求）""" + if voice_type.startswith("S_"): + return "volc.megatts.default" + return "volc.service_type.10029" + + async def _create_websocket_connection(self): + """创建WebSocket连接（内部使用）""" + headers = { + "X-Api-App-Key": self.appid, + "X-Api-Access-Key": self.access_token, + "X-Api-Resource-Id": self._get_resource_id(DEFAULT_VOICE_TYPE), # 用默认音色获取资源ID + "X-Api-Connect-Id": str(uuid.uuid4()), + } + + print(f"连接到 TTS 服务端: {self.endpoint}") + self.websocket = await websockets.connect( + self.endpoint, + additional_headers=headers, + max_size=10 * 1024 * 1024 # 10MB缓冲区 + ) + self.is_connected = True + self.logid = self.websocket.response.headers.get("x-tt-logid") + print(f"连接成功，LogID: {self.logid}") + + # 发送连接启动指令 + await start_connection(self.websocket) + await wait_for_event( + self.websocket, MsgType.FullServerResponse, EventType.ConnectionStarted + ) + print("TTS连接已初始化完成") async def connect(self): - """建立 WebSocket 连接（初始化一次）""" + """建立WebSocket连接（外部调用，初始化一次）""" if not self.is_connected: try: - self.websocket = await websockets.connect(self.ws_url) - self.is_connected = True - print(f"成功连接到 TTS 服务端: {self.ws_url}") - + await self._create_websocket_connection() # 启动队列消费协程（后台运行） asyncio.create_task(self._consume_queue()) except Exception as e: - raise ConnectionError(f"连接失败: {str(e)}") + error_msg = f"连接失败: {str(e)}" + print(error_msg) + raise ConnectionError(error_msg) async def disconnect(self): - """关闭 WebSocket 连接""" + """关闭WebSocket连接""" if self.is_connected and self.websocket: - await self.websocket.close() - self.is_connected = False - self.websocket = None - print("已断开与 TTS 服务端的连接") + try: + # 发送连接结束指令 + await finish_connection(self.websocket) + await wait_for_event( + self.websocket, MsgType.FullServerResponse, EventType.ConnectionFinished + ) + except Exception as e: + print(f"关闭连接时异常: {str(e)}") + finally: + await self.websocket.close() + self.is_connected = False + self.websocket = None + print("已断开与TTS服务端的连接") + # 清理音频播放流 if self.play_stream: self.play_stream.stop() self.play_stream.close() @@ -91,281 +165,377 @@ class CosyVoiceTTSSocketClient: self.external_callback = callback def set_playback_enabled(self, enabled: bool): - """设置是否启用音频播放""" + """设置是否启用音频实时播放""" self.enable_playback = enabled + print(f"音频实时播放已{'启用' if enabled else '禁用'}") - async def add_tts_request(self, tts_text: str, **kwargs) -> str: + async def synthesize(self, tts_text: str, **kwargs) -> str: """ - 添加TTS请求到队列（异步非阻塞） + 异步非阻塞添加TTS请求到队列 :param tts_text: 要合成的文本 - :param kwargs: 其他TTS参数 + :param kwargs: 其他TTS参数（voice_type, encoding, speed等） :return: 唯一请求ID """ - # 创建请求对象 + # 创建请求对象（支持覆盖默认参数） request = TTSRequest(tts_text=tts_text, **kwargs) req_id = request.request_id # 初始化音频缓冲区 self.audio_buffers[req_id] = [] - # 异步入队 + # 异步入队（非阻塞） try: await self.request_queue.put(request) self.on_task_enqueue(req_id) - print(f"请求 {req_id} 已加入队列，当前队列长度: {self.request_queue.qsize()}") + print(f"请求 [{req_id[:8]}] 已加入队列，当前队列长度: {self.request_queue.qsize()}") return req_id except asyncio.QueueFull: self.on_queue_full(req_id) - raise Exception(f"队列已满，请求 {req_id} 入队失败") + error_msg = f"队列已满（最大长度{self.max_queue_size}），请求 [{req_id[:8]}] 入队失败" + print(error_msg) + raise Exception(error_msg) async def _consume_queue(self): """消费队列（后台协程，自动处理排队请求）""" print("队列消费协程已启动") while True: try: - # 等待队列中有请求（阻塞） + # 等待队列中有请求（阻塞，直到有任务） request = await self.request_queue.get() req_id = request.request_id # 标记为处理中 self.is_processing = True - print(f"开始处理请求 {req_id}，剩余队列长度: {self.request_queue.qsize()}") + # print(f"\n开始处理请求 [{req_id[:8]}]，剩余队列长度: {self.request_queue.qsize()}") - # 处理当前请求 + # 处理单个请求 await self._process_single_request(request) - # 标记任务完成 + # 标记任务完成（让Queue知道可以继续） self.request_queue.task_done() self.is_processing = False except Exception as e: - print(f"队列消费异常: {str(e)}") + error_msg = f"队列消费异常: {str(e)}" + print(error_msg) self.is_processing = False - # 短暂等待后继续消费，避免死循环 + # 短暂等待，避免死循环占用CPU await asyncio.sleep(0.1) - async def _process_single_request(self, request: TTSRequest): - """处理单个TTS请求""" - req_id = request.request_id - - # 参数校验 - if not request.tts_text: - self.on_error(req_id, "合成文本不能为空") - return - - # 确保已连接 - if not self.is_connected: - try: - await self.connect() - except Exception as e: - self.on_error(req_id, f"连接失败: {str(e)}") - return - - # 构造请求数据 - request_data = { - "tts_text": request.tts_text, - "mode": request.mode, - "sft_spk": request.sft_spk, - "seed": request.seed, - "stream": request.stream, - "speed": request.speed, - "prompt_wav": request.prompt_wav, - "instruct_text": request.instruct_text + def _build_base_request(self, request: TTSRequest) -> Dict[str, Any]: + """构建字节跳动TTS基础请求参数""" + aaa = { + "user": {"uid": str(uuid.uuid4())}, + "namespace": "BidirectionalTTS", + "req_params": { + "speaker": request.voice_type, + "audio_params": { + "format": request.encoding, + "sample_rate": DEFAULT_SAMPLE_RATE, + "enable_timestamp": True, + }, + "additions": json.dumps({"disable_markdown_filter": False}), + "speed": request.speed, # 语速参数（需服务端支持） + }, } + print('aaa', aaa) + return aaa + async def _send_text_stream(self, request: TTSRequest, session_id: str): + """流式发送文本（逐字符发送，字节跳动TTS流式协议要求）""" + base_request = self._build_base_request(request) + text = request.tts_text.strip() - try: - # 发送请求 - await self.websocket.send(json.dumps(request_data)) - - # 处理返回的流式数据 - await self._handle_response(req_id) - - except websockets.exceptions.ConnectionClosed: - self.is_connected = False - self.on_error(req_id, "连接已关闭") - except Exception as e: - self.on_error(req_id, f"处理请求失败: {str(e)}") - - async def _handle_response(self, req_id: str): - """处理单个请求的服务端响应""" - if not self.websocket: + if not text: + print(f"请求 [{request.request_id[:8]}] 文本为空，跳过发送") return + # 逐字符发送（控制发送速率，避免拥塞） + for char in text: + if not self.is_connected or not self.websocket: + raise ConnectionError("连接已断开，无法继续发送文本") + + # 构建单个字符的任务请求 + task_req = copy.deepcopy(base_request) + task_req["event"] = EventType.TaskRequest + task_req["req_params"]["text"] = char + + # 发送任务请求 + await task_request( + self.websocket, + json.dumps(task_req).encode("utf-8"), + session_id + ) + # 控制发送速率（5ms/字符，可调整） + await asyncio.sleep(0.005) + + # 发送会话结束指令 + await finish_session(self.websocket, session_id) + print(f"请求 [{request.request_id[:8]}] 文本发送完成") + + async def _handle_audio_response(self, req_id: str, session_id: str, request: TTSRequest) -> Dict[str, Any]: + """处理服务端的流式音频响应""" + if not self.websocket: + raise ConnectionError("WebSocket连接未建立") + + sample_rate = DEFAULT_SAMPLE_RATE + audio_received = False + try: - sample_rate = None while True: - # 接收服务端消息（异步） - response = await self.websocket.recv() - data = json.loads(response) + # 接收服务端消息（异步阻塞） + msg = await receive_message(self.websocket) - # 根据状态分发到不同回调（都带req_id） - status = data.get("status") - if status == "start": - # 合成开始 - 返回采样率等信息 - sample_rate = data.get("sample_rate") - self.on_start(req_id, data) + if msg.type == MsgType.FullServerResponse: + # 完整响应（开始/结束/错误） + if msg.event == EventType.SessionStarted: + # 会话开始回调 + start_data = { + "session_id": session_id, + "sample_rate": sample_rate, + "encoding": request.encoding, + "voice_type": request.voice_type, + "logid": self.logid + } + self.on_start(req_id, start_data) + print(f"请求 [{req_id[:8]}] 合成开始") - elif status == "stream": - # 流式音频块 - 转为 numpy 数组 - audio_chunk = np.array(data["audio_chunk"], dtype=np.float32) + elif msg.event == EventType.SessionFinished: + # 会话结束，退出循环 + end_data = {"session_id": session_id, "message": "合成完成"} + self.on_end(req_id, end_data) + print(f"请求 [{req_id[:8]}] 合成结束") + break - # 保存到缓冲区 - self.audio_buffers[req_id].append(audio_chunk) + elif msg.type == MsgType.AudioOnlyServer: + # 流式音频数据（原始字节） + audio_chunk = msg.payload + if audio_chunk: + audio_received = True + # 保存到缓冲区 + self.audio_buffers[req_id].append(audio_chunk) + # 音频块回调 + self.on_audio_chunk(req_id, audio_chunk) + # 实时播放（如果启用） + await self._play_audio_chunk(req_id, audio_chunk, sample_rate) - # 音频块回调 - self.on_audio_chunk(req_id, audio_chunk) + else: + # 未知消息类型 + raise RuntimeError(f"收到未知消息类型: {msg.type}, 内容: {msg}") - elif status == "end": - # 合成结束 - self.on_end(req_id, data) - - # 组装完整音频数据 - full_audio = np.concatenate(self.audio_buffers[req_id]) if self.audio_buffers[req_id] else np.array( - [], dtype=np.float32) - - # 准备返回给外部回调的数据 - result_data = { - "status": "completed", - "request_id": req_id, - "sample_rate": sample_rate, - "audio_data": full_audio, - "audio_length": len(full_audio), - "message": data.get("msg", "合成完成") - } - - # 调用外部回调（非阻塞） - if self.external_callback: - # 使用create_task确保回调不会阻塞主流程 - asyncio.create_task(self._call_external_callback(req_id, result_data)) - - # 清理缓冲区 - if req_id in self.audio_buffers: - del self.audio_buffers[req_id] - - break - - elif status == "error": - # 错误处理 - error_msg = data.get("msg", "未知错误") - self.on_error(req_id, error_msg) - - # 准备错误结果数据 - error_data = { - "status": "error", - "request_id": req_id, - "message": error_msg - } - - # 调用外部回调 - if self.external_callback: - asyncio.create_task(self._call_external_callback(req_id, error_data)) - - # 清理缓冲区 - if req_id in self.audio_buffers: - del self.audio_buffers[req_id] - - break + # 组装完整结果 + full_audio = b"".join(self.audio_buffers[req_id]) if self.audio_buffers[req_id] else b"" + return { + "status": "completed", + "request_id": req_id, + "session_id": session_id, + "sample_rate": sample_rate, + "encoding": request.encoding, + "audio_data": full_audio, # 完整音频字节数据 + "audio_length": len(full_audio), + "message": "合成成功" if audio_received else "合成完成但未收到音频数据" + } except Exception as e: - error_msg = f"接收数据异常: {str(e)}" + error_msg = f"处理音频响应异常: {str(e)}" self.on_error(req_id, error_msg) - - # 准备错误结果数据 - error_data = { + return { "status": "error", "request_id": req_id, + "session_id": session_id, "message": error_msg } - # 调用外部回调 - if self.external_callback: - asyncio.create_task(self._call_external_callback(req_id, error_data)) + async def _play_audio_chunk(self, req_id: str, chunk: bytes, sample_rate: int): + """实时播放音频块（支持MP3格式）""" + if not self.enable_playback: + return + # 确保当前请求是正在播放的请求 + if self.current_req_id is None: + self.current_req_id = req_id + + if req_id != self.current_req_id: + # 切换请求时，重置播放流 + if self.play_stream: + self.play_stream.stop() + self.play_stream.close() + self.current_req_id = req_id + + try: + # 初始化播放流（如果未初始化） + if not self.play_stream: + self.play_stream = sd.OutputStream( + samplerate=sample_rate, + channels=1, # 单声道 + dtype=np.float32 + ) + self.play_stream.start() + + # MP3字节 → 音频数组（直接播放） + # 注意：sounddevice默认支持PCM格式，如果是MP3需要解码，这里简化处理（实际使用建议用pydub解码） + # 如需支持MP3播放，请安装 pydub: pip install pydub ffmpeg + try: + # 简化处理：假设服务端返回PCM（如果是MP3，需替换为解码逻辑） + audio_array = np.frombuffer(chunk, dtype=np.float32) + if audio_array.size > 0: + self.play_stream.write(audio_array) + except Exception as e: + print(f"音频播放异常: {str(e)}，请确保音频格式正确") + + except Exception as e: + print(f"播放流初始化失败: {str(e)}") + + async def _process_single_request(self, request: TTSRequest): + """处理单个TTS请求（完整流程：连接→启动会话→流式发送文本→接收音频→回调结果）""" + req_id = request.request_id + session_id = request.session_id + + # 参数校验 + if not request.tts_text.strip(): + error_msg = "合成文本不能为空" + self.on_error(req_id, error_msg) + self._send_external_callback(req_id, { + "status": "error", + "request_id": req_id, + "session_id": session_id, + "message": error_msg + }) + return + + # 确保连接已建立（断开时自动重连） + if not self.is_connected: + print(f"请求 [{req_id[:8]}] 处理时连接已断开，尝试重连...") + try: + await self._create_websocket_connection() + except Exception as e: + error_msg = f"重连失败: {str(e)}" + self.on_error(req_id, error_msg) + self._send_external_callback(req_id, { + "status": "error", + "request_id": req_id, + "session_id": session_id, + "message": error_msg + }) + return + + try: + # 1. 启动会话 + base_request = self._build_base_request(request) + start_session_req = copy.deepcopy(base_request) + start_session_req["event"] = EventType.StartSession + + await start_session( + self.websocket, + json.dumps(start_session_req).encode("utf-8"), + session_id + ) + # 等待会话启动成功 + await wait_for_event( + self.websocket, MsgType.FullServerResponse, EventType.SessionStarted + ) + + # 2. 异步流式发送文本（后台任务，不阻塞接收音频） + send_task = asyncio.create_task(self._send_text_stream(request, session_id)) + + # 3. 接收并处理音频响应 + result_data = await self._handle_audio_response(req_id, session_id, request) + + # 4. 等待文本发送任务完成 + await send_task + + # 5. 发送外部回调 + self._send_external_callback(req_id, result_data) + + except Exception as e: + error_msg = f"处理请求 [{req_id[:8]}] 异常: {str(e)}" + self.on_error(req_id, error_msg) + self._send_external_callback(req_id, { + "status": "error", + "request_id": req_id, + "session_id": session_id, + "message": error_msg + }) + finally: # 清理缓冲区 if req_id in self.audio_buffers: del self.audio_buffers[req_id] - async def _call_external_callback(self, req_id: str, result_data: Dict[str, Any]): - """异步调用外部回调函数""" - try: - if self.external_callback: - # 确保回调是异步的，不会阻塞 - if asyncio.iscoroutinefunction(self.external_callback): - await self.external_callback(req_id, result_data) - else: - # 如果是同步函数，在线程池中执行 - await asyncio.get_event_loop().run_in_executor( - None, self.external_callback, req_id, result_data - ) - except Exception as e: - print(f"外部回调执行异常: {str(e)}") - - def _play_audio_chunk(self, chunk: np.ndarray): - """播放音频块（非阻塞）""" - if not self.enable_playback or not self.play_stream: + def _send_external_callback(self, req_id: str, result_data: Dict[str, Any]): + """发送外部回调（支持同步/异步回调函数）""" + if not self.external_callback: return try: - if chunk.size > 0: - self.play_stream.write(chunk) + # 异步回调：直接await + if asyncio.iscoroutinefunction(self.external_callback): + asyncio.create_task(self.external_callback(req_id, result_data)) + # 同步回调：在线程池中执行（避免阻塞事件循环） + else: + asyncio.get_event_loop().run_in_executor( + None, self.external_callback, req_id, result_data + ) except Exception as e: - print(f"音频播放异常: {str(e)}") + print(f"外部回调执行异常: {str(e)}") - async def wait_queue_empty(self): - """等待队列所有任务处理完成（阻塞）""" + async def wait_all_completed(self): + """等待队列中所有任务处理完成（阻塞）""" await self.request_queue.join() - print("所有队列任务已处理完成") + print("\n所有队列任务已处理完成") # ------------------------------ -# 使用示例 +# 使用示例（与你提供的风格完全一致） # ------------------------------ class TTSManager: - """TTS管理器 - 供外部代码调用""" + """TTS管理器 - 供外部代码调用（封装客户端，简化使用）""" - def __init__(self, ws_url: str = "ws://localhost:50000/ws/tts"): - self.client = CosyVoiceTTSSocketClient(ws_url) - self._setup_callbacks() + def __init__( + self, + appid: str = DEFAULT_APPID, + access_token: str = DEFAULT_ACCESS_TOKEN, + endpoint: str = DEFAULT_ENDPOINT + ): + self.client = ByteDanceTTSSocketClient( + appid=appid, + access_token=access_token, + endpoint=endpoint + ) + self._setup_internal_callbacks() - def _setup_callbacks(self): - """设置内部回调""" + def _setup_internal_callbacks(self): + """设置内部回调（日志/状态提示）""" - # 合成开始回调 - def on_tts_start(req_id, data): - print(f"\n🎤 开始合成 [{req_id[:8]}] - 采样率: {data.get('sample_rate')}") + def on_task_enqueue(req_id: str): + """任务入队回调""" + print(f"📥 任务 [{req_id[:8]}] 已入队") - # 初始化播放流（如果需要播放） - if self.client.enable_playback: - sample_rate = data.get("sample_rate", 24000) - if self.client.play_stream: - self.client.play_stream.stop() - self.client.play_stream.close() + def on_tts_start(req_id: str, data: Dict[str, Any]): + """合成开始回调""" + print(f"🎤 合成开始 [{req_id[:8]}] - 采样率: {data['sample_rate']}, 编码: {data['encoding']}") - self.client.play_stream = sd.OutputStream( - samplerate=sample_rate, - channels=1, - dtype=np.float32 - ) - self.client.play_stream.start() - self.client.current_req_id = req_id + def on_audio_chunk(req_id: str, chunk: bytes): + """音频块回调（内部仅打印日志，外部通过external_callback获取）""" + print(f"🔊 收到音频块 [{req_id[:8]}] - 大小: {len(chunk)}字节", end="\r") - # 音频块回调 - def on_audio_chunk(req_id, chunk): - if req_id == self.client.current_req_id: - self.client._play_audio_chunk(chunk) + def on_tts_end(req_id: str, data: Dict[str, Any]): + """合成结束回调""" + print(f"\n🏁 合成结束 [{req_id[:8]}] - 会话ID: {data['session_id']}") - # 合成结束回调 - def on_tts_end(req_id, data): - print(f"🏁 合成完成 [{req_id[:8]}] - {data.get('msg', '完成')}") + def on_tts_error(req_id: str, msg: str): + """错误回调""" + print(f"\n❌ 合成失败 [{req_id[:8]}] - 错误: {msg}") - # 错误回调 - def on_tts_error(req_id, msg): - print(f"❌ 合成失败 [{req_id[:8]}] - {msg}") + def on_queue_full(req_id: str): + """队列满回调""" + print(f"⚠️ 队列已满，请求 [{req_id[:8]}] 入队失败") + # 绑定内部回调 + self.client.on_task_enqueue = on_task_enqueue self.client.on_start = on_tts_start self.client.on_audio_chunk = on_audio_chunk self.client.on_end = on_tts_end self.client.on_error = on_tts_error + self.client.on_queue_full = on_queue_full async def initialize(self): """初始化连接""" @@ -376,25 +546,25 @@ class TTSManager: await self.client.disconnect() def set_result_callback(self, callback: Callable[[str, Dict[str, Any]], None]): - """设置结果回调函数""" + """设置外部结果回调（获取完整音频数据）""" self.client.set_external_callback(callback) def set_playback_enabled(self, enabled: bool): - """设置是否启用播放""" + """设置是否启用实时播放""" self.client.set_playback_enabled(enabled) async def synthesize(self, text: str, **kwargs) -> str: """ - 异步合成文本（非阻塞） + 异步非阻塞合成文本 :param text: 要合成的文本 - :param kwargs: 其他参数（mode, sft_spk, speed等） + :param kwargs: 其他参数（voice_type, encoding, speed等） :return: 请求ID """ - return await self.client.add_tts_request(text, **kwargs) + return await self.client.synthesize(text, **kwargs) async def wait_all_completed(self): """等待所有任务完成""" - await self.client.wait_queue_empty() + await self.client.wait_all_completed() # ------------------------------ @@ -402,147 +572,120 @@ class TTSManager: # ------------------------------ async def external_usage_example(): """外部代码使用示例""" + # 1. 创建TTS管理器（可替换为自己的appid和access_token） + tts_manager = TTSManager( + appid=DEFAULT_APPID, + access_token=DEFAULT_ACCESS_TOKEN, + endpoint=DEFAULT_ENDPOINT + ) - # 1. 创建TTS管理器 - tts_manager = TTSManager(ws_url="ws://10.10.10.202:50000/ws/tts") - - # 2. 设置结果回调函数（接收完整结果） - def handle_tts_result1(req_id: str, result: Dict[str, Any]): - """处理TTS结果回调""" + # 2. 设置外部结果回调（获取完整音频数据） + def handle_tts_result(req_id: str, result: Dict[str, Any]): + """处理TTS完整结果（同步回调）""" status = result.get("status") - if status == "completed": audio_data = result.get("audio_data") - sample_rate = result.get("sample_rate") + encoding = result.get("encoding") audio_length = result.get("audio_length") - print(f"✅ 收到TTS结果 [{req_id[:8]}]: 长度{audio_length}采样点, 采样率{sample_rate}Hz") + print(f"\n✅ 收到完整结果 [{req_id[:8]}] - 长度: {audio_length}字节, 编码: {encoding}") - # 这里可以保存音频文件或进行其他处理 - # 注意：audio_data是完整的numpy数组 + # 保存音频文件 + filename = f"tts_output_{req_id[:8]}.{encoding}" + with open(filename, "wb") as f: + f.write(audio_data) + print(f"💾 音频文件已保存: {filename}") elif status == "error": error_msg = result.get("message") - print(f"❌ TTS处理失败 [{req_id[:8]}]: {error_msg}") + print(f"\n❌ 请求 [{req_id[:8]}] 处理失败: {error_msg}") - def handle_tts_result(req_id: str, result: Dict[str, Any]): - """处理TTS结果回调 - 保存为PCM文件""" - print('处理TTS结果回调', result) - status = result.get("status") - print('status') - if status == "completed": - audio_data = result.get("audio_data") - sample_rate = result.get("sample_rate") - - if audio_data is not None and len(audio_data) > 0: - # 转换为PCM数据 - pcm_data = (audio_data.astype(np.float32) * 32767).astype(np.int16) - pcm_bytes = pcm_data.tobytes() - - # 保存为PCM文件 - filename = f"tts_output_{req_id[:8]}.pcm" - with open(filename, "wb") as f: - f.write(pcm_bytes) - - print(f"💾 PCM文件已保存: {filename}, 大小: {len(pcm_bytes)}字节") - - return filename - - elif status == "error": - error_msg = result.get("message") - print(f"❌ TTS处理失败 [{req_id[:8]}]: {error_msg}") - - return None + # 绑定外部回调 tts_manager.set_result_callback(handle_tts_result) - # 3. 设置是否播放（可选，默认True） - tts_manager.set_playback_enabled(True) # 设置为False则不播放 + # 3. 设置是否启用实时播放（默认True） + tts_manager.set_playback_enabled(True) # 4. 初始化连接 await tts_manager.initialize() - # 5. 异步合成多个文本（非阻塞） + # 5. 异步提交多个TTS请求（非阻塞） texts = [ - "你好，这是第一个排队的TTS请求。", - "我是第二个请求，会等第一个处理完再执行。", - "第三个请求，支持流式播放和队列管理。", - "第四个请求，测试队列的自动消费功能。", - "最后一个请求，处理完成后会自动结束。" + "你好，这是字节跳动TTS的流式合成测试。", + "我支持异步非阻塞调用，多个请求可以排队处理。", + "每个请求都会返回唯一的ID，方便你跟踪结果。", + "音频数据会通过回调函数返回，支持实时播放和保存文件。", + "最后一个测试句子，演示队列的自动消费功能。" ] req_ids = [] for i, text in enumerate(texts): + # 提交请求（非阻塞，立即返回） req_id = await tts_manager.synthesize( text, - mode="预训练音色", - sft_spk="中文女", + voice_type=DEFAULT_VOICE_TYPE, + encoding=DEFAULT_ENCODING, speed=1.0 ) req_ids.append(req_id) - print(f"已提交请求 {i + 1}: ID={req_id[:8]}") + print(f"📤 已提交请求 {i+1}: ID={req_id[:8]}") - # 可以立即继续其他操作，不需要等待 - await asyncio.sleep(0.5) # 模拟其他操作 + # 模拟其他业务逻辑（无需等待TTS完成） + await asyncio.sleep(0.3) - # 6. 可以在这里做其他事情，TTS会在后台处理 - - # 7. 等待所有TTS任务完成（可选） + # 6. 等待所有TTS任务完成（可选，根据业务需求决定是否等待） await tts_manager.wait_all_completed() - # 8. 关闭连接 + # 7. 关闭连接（程序退出前调用） await tts_manager.shutdown() +# ------------------------------ +# 异步结果回调示例（高级用法） +# ------------------------------ +async def async_result_callback(req_id: str, result: Dict[str, Any]): + """异步结果回调（支持异步操作，如上传音频到服务器）""" + if result["status"] == "completed": + print(f"\n⚡ 异步处理结果 [{req_id[:8]}] - 开始上传音频...") + # 模拟异步上传操作 + await asyncio.sleep(0.5) + print(f"⚡ 异步处理结果 [{req_id[:8]}] - 音频上传完成") + + async def advanced_usage_example(): - """高级使用示例：动态控制播放和结果处理""" + """高级使用示例：异步回调 + 禁用播放 + 批量请求""" + tts_manager = TTSManager() - tts_manager = TTSManager(ws_url="ws://10.10.10.202:50000/ws/tts") + # 设置异步结果回调 + tts_manager.set_result_callback(async_result_callback) - # 自定义结果处理器 - class ResultProcessor: - def __init__(self): - self.results = {} - - async def process_result(self, req_id: str, result: Dict[str, Any]): - """异步处理结果""" - if result.get("status") == "completed": - # 保存音频数据等处理 - self.results[req_id] = result - print(f"处理完成: {req_id[:8]}, 音频长度: {result.get('audio_length')}") - - # 这里可以添加自定义逻辑，如保存到文件、发送到网络等 - - processor = ResultProcessor() - tts_manager.set_result_callback(processor.process_result) - - # 禁用播放，只获取数据 + # 禁用实时播放（只获取音频数据） tts_manager.set_playback_enabled(False) await tts_manager.initialize() - # 批量合成 + # 批量提交请求（并行提交） tasks = [] for i in range(3): - text = f"这是第{i+1}个测试文本，用于演示高级功能。" - task = tts_manager.synthesize(text) + text = f"这是第{i+1}个高级测试文本，使用异步回调处理结果。" + task = tts_manager.synthesize(text, speed=0.9) tasks.append(task) - # 并行提交所有请求 - req_ids = await asyncio.gather(*tasks) + # 并行提交所有请求 + req_ids = await asyncio.gather(*tasks) + print(f"\n已并行提交 {len(req_ids)} 个请求") - # 等待完成 - await tts_manager.wait_all_completed() - await tts_manager.shutdown() + # 等待所有任务完成 + await tts_manager.wait_all_completed() + await tts_manager.shutdown() - print(f"所有任务完成，共处理 {len(processor.results)} 个结果") if __name__ == "__main__": - # 运行示例 try: - # 基础使用示例 + # 运行基础使用示例 asyncio.run(external_usage_example()) - # 高级使用示例（取消注释运行） + # 运行高级使用示例（取消注释） # asyncio.run(advanced_usage_example()) except KeyboardInterrupt: diff --git a/python/tts_output_33cfc4e1.pcm b/python/tts_output_33cfc4e1.pcm new file mode 100644 index 0000000000000000000000000000000000000000..294df1a53148bee50ba2e892278ed82cf2d6cc4d GIT binary patch literal 304640 zcmeFab$C_B^EiCup6fTRB!rLzf@^Shm*DOcmlpQ|rFctmE7le*uEk4m3y?q(5<)@} z0>tI&v3KVTr|IYO{k`ws@AG_r%yV{UXXWh9%$=Q`vuQg}9jPux|;mFhvD8+m#W zyt_gHYF9$*qLjN39G@;!C#o}nE(FvZ#({cFJAcKo9kfA!o=7XpJCeGN1d!g5YOj^a(A#X#qrdpA-71feFh_xUzpf*=%ElJvv z0ve?705n%xBL&jtWDKlpPBl|N&6`q9No`X?YeAkSN(t(K(o`uoA!!q;u~KS80W>Di zh|n5Q4V9;%LIE1oLE3;oLj|COSd>DGqM}F{@CGCW99lv-imI<*K!F+nq+$;B0Fc8| zj{xRCt*1QLt3Fki0Jea-x>OzVM3JX90q9rfE7T)2wYCnaL%cRsLum=UYJF{4o2sc$ zp(o%qNe$$+2tW;BSON;vLAlO9RCqJ=f|08$7^LvjAW)rvnj;O%SOc|X05s@XO`+AG zs{Yfn8dZhRYLFTL7!RSkG9!4qIx5T!O6nYN1^>MUTu%*UHMNzsz`9^fxH`;%LqLTT zxdl1amC=E>$S>e3woqF`t9pb6IXtz`mH$!W9H)^4(!}#j~y#%R) zZlhjTA?@H-1vIR|mOv|$J>vKqEYpTMWE7;~?-H~IG!CesU8tS-%Ljb|O@b0=9BQ3f z2lfE$2iOdtK??edwgt*)lb{~z(1HPubhJlk(Nuc}wED!dft5t-2euGOXgwP!))q@( zcLBgIBi@|kSOPoVRI%-tf_+zQJ7CQffIR{57Njli1W*S%0$6ycX{ofs)@pwk8TJLJ zhjx(SjsSZEw8A;y&H(cU3eFXG2X&u7+Yc+n_2O=T>y08b4Owe z%IFt>pMbtWOX6LC|A77kq~Jxg{pyqaJ8!Shz+XY11^gQDXTWa(Z>BSO!1Dp02mGB* zihregQmTgq{#Z8!&=c#XwCYLqRQxc=dyogxUIcnly%mTicyB72>O=J<&_{uO3f_+b z=ucn(0l)@O1F1nuI*=Md0MbDOhAE{X)KCJ0$uo?=@UQ6zYUEcKuH+-A(bOpNjHVD9 zMUAD#kkS~Ek0&rrNyk&)5P){<|_c$A_5Dk#mcjoYrsd~-#Eh8F(e(Qa2)syydOm*F^T}n zW(3JqX$@Dfp+ug;h#W!22!lyJn8+LC571x1|F`SFQfir^2j7!?F?p6zfGsDmf?BDh zE54>HsZ|7iAh43aD(XiCR#U5~HRM@MN^1!Q042cJ5m--cAh1qJH&8!O8wtMgEBr*t zn+W_&@(m;fd=vExfz1Rqkq5A?B;87FA=nlr1$--k?aH%_+NR`K+D`2t^c@7Yl4qy# z>?HY4YL@~#sof-p2Vswr@22)pdkGZ*XnPgPK9c|X^#KgGWb@GBK@XbJ6s4t=5bZ%P?390AjVUwcAJ90RaJ|FnT#P~NB1 zLyGT$)&Nk8^S~PDi5S+x`(OsJ4qOwia}S{aUmyj}>`_X)zj70KrE+!GS8fC6K?1;e zgq@_cjg+@5RFD?n&}N&GLo1LaP>@zu3vE%JP^Z=+jP$5OxgUrjM zk6NInAZ=Cls`OFX|CavVf25CE05V5xFX5XieUu$?6u7SH0dTww2Q4a-KFa9O*HQj0 zdz93F>jCH#&_J>veJF$W0HsX2*!MrBk3Gwz4>Lp^EbFgoBj_b+h^mj!7G{p~!TDpI z`m4Yk)~RCnO95W(BV2}61BQHs66lvYF0{f2^iCZEF`%FX@Yf151E~QGFwjKE0oy_7 zAazJpJq4XaD%t~8J5e)HW4C?PLRA+*L&2_qg#pb4TZGo83T z64+d@ylWMF-B)Y8?yGHHqfo(0WBnRpx1lXOV9AjVnA#ue(30cmK*u-Z8(}Vp!F$o( zuO~FH`)KLa`NJv@fc~=rz=JJhwW{q$j=}o35Pkt4Aysj({IDnB4gfm=+W&0|1uX=~ z0&NPELC#QBQN1pI19;aoCN!M-6l)Btt- z*IM+tVT?%%1^sb6vj7#}2PYYzf$t78LoXivd6k0m$2CKW0IQu!){m!wX(UJ908fBp zn8LXS&k$-3=Lz5~q#y~*;Zy{8SqkS8kRnJ5Qk1KDR>B-kORD@K$FodXd#puyt9qeo z0LmYwjPrnb!n{EC(-jOf09FP7^GAu7X#mzuBdt*z{#yf(bCBXGsZ9RBX*@+D&nGML z06Bm>K&ns+DM%H{C_h!os0CvQ9d)7XlsZm1wZh32PO(^0&s=cEg;VVqa@rcLJb3=X z(=SrtEC$pOU(aK37K8ILlt+@Y7+}N6gJ-ni%9#z%Xh4NC8kB~A&EedQFr1v%;4}_r zaXi5dQc8HPgMNd_DGnYu*Wu|7a+QiWmhhYpr@yk6a0Z0(KoSkWhya`k0UJO@96)Ly zUZBPbAZ{>_P@op#2^duX3~-1oK3qR1kn0?tpjRb60v|BqZUx# zhfr{wKBPVLj{X|g=%Yk9Al?Br5bfx#^zZex1+-IRA&^5vq}SKB7$<=gzH+ZucbI1d@sd1h}`ue z5A+6FPbH2ARA>XVt_n^4!U_}wi0(nW4_F_|A&0fCgV|f!dW&;R`MF zffyoC)o-vW-igqm4UF(_48GJtYpB5#TB^AERTsbG!dUpF7v89T)}hT z`t29L_+mY@L4f{P!rt(Hcr%pLZ^AGOz@aa`5BuPV*a~LRh3Y^an7ukL{0faDV{70b zj-$>CO2{XiIjjxK$ZZ%AXfUcO4Xno!wnqt+rGTlj1nGfvK!PB1s6&7eP|B(_p%?Z8 z9Rm#Y3R+^k7g|Cam<`tBDEK~AL!chM(?biGExZRY;1g1CWkAK%m1zK$AtH@f8Ru0B z>L5xFWdbrnPInhSG2Cly!w0`C#Wc2Ex-!Z!mKV055DitofRpbYKQdZ@)Qpa#~6WxxOj?t>Iy zO!e1{BcS|Mje=ff8US_z<&LuMrIauQ$%7R^fD)9^PIdoklb{ZF!yd#gfkngb0@w%l zI;5(59qgd$UI#RFH-+9{ZNYXz3$V4ST?MO)mKgVFw69>vp#@lO0M)YN&Inc=cR#F! zogJ(_`UX$~`wO=CxBme9BRuL3gZl^UIM53BP^?pTPPGnd%XUq52QAwXabLwf6up{3 zWK5{`>{d*o~x z-;w($3zdo`lrrETRg{}5U!|Q70?Do z0027TY7QlMkaNI2z<{s#YeHTEMddnBR7s(Jp|+Ii4(eL8B7LNSeyCQZmts}Q?25X} zpoN0{0;~>ND6m|rwF8?9wh?^{w9!z9_POj<7kmYUFQWJ@6z*rW{|a!s3jw~a!o4lH z$JL5paNDb$@|_jFwZgqD^|lt=&%%3JK!dOAcps~&@+G~Q@+DopeT6rw@TOG*QiEUA z;oCXfD8M@ecqa;P7Stm&sDnEO_{ACW#^iw-?1NvL@upUNc-TP!;4bjE?5i^Fq3Z4g zdlASG<%qk7Dtjz}Y;o66C9TRHdaC;q>}aa=VQloMRF4n$X^=nq1?r42$M4@T&;OJ3 z+bZAFLH6*a9oE@~tPXSn0C|M+hi~*{JcFAV>OBkix(_!g@asQ(_bzk59LL95X_U%JPGEm08jw8D5)FCjS6n2 zOq7{mW&%bf1&V=ykpN&uO8>9aKuS9Da3s}HTJmWA0ghrRhCHl70bHX{Xo@B{O~F4% zq5S{#PnKy)CjZnnl7az6mPJ|m3WAIv5}GLUO6npso&csU1;Z3*&`#|wDx<+%;63Wx zU}m@misT%bKdcGX%8|8d6-=w}Lr>B&0Db|NOay>y0Kik=Ej++sC_`$Y+!Sypl2D}s zxEqlUP(W^8Bn5eSDF9TjuT-RXDlGtqwvb{k4}t;Z|H>b<03^@LP6963q2z!;*&*8r zI0(2Dtc(Iwcx*~7w6ZB>Y;Pr0c(51NS_#EQo>KB41xnD$ra&p7Vw+OZ2568&dw3Jn zsQru*R@%20yeApDm8{mYV+-xeh5?;L((>Vp`jU>DRf{@PXhfHs0r>;|N0 zR}e#sgH{G{j{GtK;1>y234f19B?laAm5$_k@@qtU26hb}_}!}Q)gF3M3+(_*q$iGx zmJjRzl+hYMu3CmN9O|@+^#cqoBFtB-;7|rDqgq2;rMiCL8{lA>R8E#zE`iXH>tN$h zI-uREeuFe!MB=K3qqL#qR3r~ARUD*^5(ha0j&ep>JIVO?Hn5ojsTau1@ZCW9x5RO# zFk4&&uHpYIakRMD4%Z25MF6V{I)MN@f_+1kG~_Cd@>V6G{YR>3hfz|vhrzyvHW}@( zYLCGhgC$l|+#TH%+X=Q9tufkYu(xQF(cYrX#a-Bk?7RT5FZ+-Oc4=Rd0>J(qNFYeT zg1%C4mxn#RoU+dcD}DfY1?Ul|-a8N=$m$(?ycZAt58Uzx52zYR)mx!>vl#E5tGCbLUNCx5a32(I zpyD0jTBL+`LGgYt-uFZw9PY0|8GJOnBZ}U*dLOh2sR1t?T7xf+>Hqv|3ZSUBYVnRJ zc;qS#JaN@KM;{&ic5DgnLT?}Ef;U#tON2YEWj-R_#|Mt!+JGBnJ|bZ1O>FQF!CO@C zkeA&W2d;w$3H%3H0Kk28$U!;)NCPUCKt?Dz$We;mXJUONQX8pA7kc6tkYY=y0{~3` z!1sXU@!omaeR`NJNF8QgCVljNk)lc;XmB4`y#)?9-U=QqfX#$W#lFNEs6@D z6~J@gzAAl?2GpahLGtPu4RMeeNblc&OM`Mm`9lq!3Q)#yQb6hBDGkmFctXQ7B3^Day zIo3k^GVN1oprwFAE$Aiwq9HH4B@e%GC_yXy+XukQZn|R)^u~9ne>sJtqQ!tZ{2K_! zVZFFYT&Kzlr~#go**W#s0Ms%|q;eGak2T zI$B7S{J%8<>1Z=mZGax|Tg2aAV=`NHM)j39tGa+%fpxGVkSkhnl=Qzf0wrITmSJcE zKs!(ikc;qFCh+%ZFcR<{%7B6FR1H(>P}U$ttOxm^j8z*2BY=!S6F};!#Gw`JdSLJH zFC@USqpgSi5%97yT1foc8{7fVTGk|X9rpyVsn`!A29{*!6a(m3{&x=14e%@= zM>_f!P=W|YB_+lYLHrP)qdx*Z3B*0XD**~%m_toPr51b{1oUfw4$%?taM1HXTrGza zY6yA2JE}n1-~%amOAt-L$O=SPfD%e#DHvrz&k0)Mo1h+XXbTwj20sgNm z0QsTx%RG$#D}PlhP#_M2Z2zW-sGDPIcPKzpk zk%p-csfP!op+@q6;~*2@G2mE>RFE{(swHfPabP@!q9$M~kUMGzj-^T*dqaw2l}R7v z4ex~6U`fT*mEfxWEq#bhqV!?i|0#W}QR9)wJLE6ufhrr2188P zZ-U4)JlF=}Nf0+tBTZ@q1t<_9Q)|>{8TM4;Dfm8k17Hx*#~K(7-hu!njOk{B|{0(AU5TC?3!&@-^g;8ZlA;K(@Ht=9?j9)v6til2=DlWe)LYkUY=@MGB~MD9N%J{7(!erlx8=jDvA+h_7ONv@FtJEEmc} z3Y3r(>FT#7oDuYa?@>HiFN_J?!mnlUeF!ZVNZ+DJ9##(W24IypJ4nR8M9wFWE9c0c z{wEs-{7AxNZoMaBb zWlrHRyw{U>7O-=G&)`F>qlwf3K#W(G8KTJ|Nhu;t++She^CWHki5C+}{88{R;S2?* zD>yOYi4DG^R#$vg@X&)udrzVf2C^oQ3`C?0NaQ)6aIZk&;AgV7kMb8X+YC9GK!O}c z;4xX#bNRk}OOBDR$yel?@@4rVd5+6h<@2O`gXDjay8C3^kUo^(%5TV%AipF0`Aj78 zg{%Q0*&NwJe2M>5iFogI$vFznvJkcDNxnbB7je9$)t`K`jwau<;cvlV_TYiBRH2+o z#(yIpmVcLb$v?>}>j>3(!eI)pByV#r?u4IyjDl`qJPl;s!t0{1Uy&qY8R0jIdmHSpAX#scg1_KF z^g~BDpd<2!-xcTquh>!zsR5lu-v|BF5OVH;b4N|WVTh-f~G_$9yjn6 z?3`B727z#?kj$q<&LdiyN4|7{zJfMn5KT{2=KYH3^Aq_g(T2y0HryoAzfN@GJkfv? zicVZ0+5kFoTfRr6b&st0KKX4Vk#&PMWf6TSR^%ZO-D8QCgSJ;98Vo1=C=!c5W;C;p31j=SkJt#!x0)D@o~zC^<>qj+xP@F#&ceOd?A5qwR76i+;kqW%p~^aym|@J;1f+HfqZo=IJl$nwoyKEOHxT8Rl8&dERq?SG142 zPmtFpZ^7Hk$IH8yx5Ycn>$z8w$6}8S{H6CDQBPPS||J^_he^rDcUf@ zT+;+|nE8+;#vDY9&OK8f!*3SaeY>fbX|Km)-vp2Ao(aBH0zG|?`?&|@`A7P#31}Of z;6F6L94bNcP{_{@Qy8s;p>%Pibq+Qi<%RYClT8o_W}s`i22X?SLI z8he?7OxF$5^-=msx&Ylk!&bv&{bPfldovHa<$I5@J{~@+ylVKl`Iq`!^$7`x^S|g< z=(p3qi+?NsT7I*9PJ8|8vA|N#ctJOZ-70zTcO5lKrxnc29rz{Z1ppDzT2Ae zYs$&wi*GBYY?r=^rTx*wQq;V}Qy5nOU1Z$?hFFK!<@d^q*~aB9_*u5aHZT}%8s z@mykDQc&`%cjezlr614A{gjlGkbkq}s;!%=i@2H2XSZwp4WXvH=Dn8p1oAC|&ApBO z28&_3uDQWw7-)E?FSP`DopU?q?&(wN7wgr|uU_Ce|LeYo1A~L71`aJJmJ0~35cGRc zpTJiB(|zxHZFciC73m_Gh2j?1QCrQz8#yySyRs^!H%UF0ygzAPf-~XPnz zk+k~lZ>g=*FK3+iR5gEkfqSvWkuFq}Md}k5qR%$mG`+NpwuD&pmZoNd@rL1hU31Mo z-3`lfT}LL@Wbr$0`Bq=oCowS1bBxIMSrHW*ExxJ%mm#^vS& zrh~SP&##_ghIf{{AeVPl&%J?vRM_Gd6%Y~@9d|k0Q4pEG;c3jT*yeLn~$}_uN$5q?O0$fA;<0 zq1CnV2nnu0e*YtaHdd$;I5wnX#PW!};j=1*Lc6XzG5^!_yrIRv z*_Vj%467|Mq?pIL@AKH}#ducsSZ<-sCk#Uk@l3F8ra4o8S9UX2_bYH;rJv#XIPkFF z0>9e9+VVTf`-gw2)UER1D$}c7ulje5ay1V}8p211&8tx4_tv9{sj+6H5M*y#bTNC= z`}CAqZ@+ov{iM>PC65|E+<(9Py%i5`JU#Ma+^c#C@7^8wAb*-ru)w;&F<%e`jaI2+#&KB0-{K?ttGB%}|lZDs% z_=&GdVhyp~UX+hbkNq5%@}^7Tos|CRr5Qs%pD%b)+^_Tp*ByB;vx(iRYh`R<8f!jd zsbr~Rjy4ZA?a|-VZ__u`2yBU|x#<#9L6_xS+pD?$i~F;{VBat1I*W;3nIsTunX0QBE@^*H@n8abP z@4qm|E_@mGBH+c_m;2sCC(e9(J9S9b-Y-jY*A;HJ|0Ld!p3?Jm?Mw;Aik34THuo5} zd2S!wmKt9h9lGw^QNv~P18pwd!SjmuJJWZDE`iDZJv^fPI#j4yu8VI>1#Ng*h0Y;u z!motKhsTF)3LP18H~4BmfA1`ho2CP7sFW#OvAxLs^JDbK=^t(+#mC=|-}Ums(@M|h zKes+!|HSdKT>QoORf(HZt7M4T?eZEI)v=A_KT}WGB%RR|WuENDd4B6|bPKjLFfY)* zHjdG>W=jp#EfbjuOh4}@-pdS&j49!>!ph%A3RRv} z(uW-my%6$azMVaUxM+|t}vK;oKDhay=>C(td+t2FV}FqH^zHLSFRLdF zNIjj|E9ZIf0$WG^7xsbSx;fWU$Lo;y2%lfQQ#?c6#~A%t zJCC+p75yIHlfE0h8V7PAy@EGaY*l4h6@9f^wb#|&Un{%bUv=MBOQ{@Pxp#$Se%T(s z7~JV{PPdZ$FFVtJe%t?z*URS*R@{9ZGvV*OHl@rR(@bNYe(xmc(OTWoI zm|i_GKkn3vGY?zb{&Mrp%@a3@Z?w7@ef#hG>9Mn4O@4DNt!)lpP}Mq2zQY|LJ7~C% z-mh{%Oh8j#AD`d7GR=p%%^DlsoIfE>*31_RtrjZPGD)|R9c`HBZS)lbmj;atwuXgQ zzg}}kjg&ebQA~s1qrR!1RqJroF_njf3jTZCTj*EGP3)%%>wntzF7M6G_)E`E-0SnV z|DE@@Pu{F{%kxgHd#xW|jn%zA_V!ge{bf<%ReLQln`vqo;ZAu4dVBZ<`YrZd?A_Sw zt$CL&hx=3WMVut&a#NW}j_vXf?(dA5%q3Hp-v;l;KJ|lFmS0l7Tcw9p%T--fgQ;6u zt7e^F>mR9|TqUM*VMIaDHlNdOaoXyV-hQF*T6RwAheW^E=I1f@mfo!vQ~7qM8`{5P z|2})y_i@+QIq_?gyJlRf<}YZ@o_^@BQwQVV|~@E}zbD zyr-7vc8Oa{{?J%G>gs~&XQnT{vwQ~z3@MitTs1ttnp=&M8Vlk8Np)&8)-~VXv{|zQ&9^iNs+Ckds`9>aHjj#i zB~oh1v%G_u*WWaJzVKQ8gS6}WuPnKG<8r0Td#(?@+2v-Pho1545`IWo@cBS-3&#WI zh&jP6*845Mv%^Q4QdsuZ{_)!1$ZbuoT{Z`)PkHeBH z$3{Oq9W&$RH^Q|n~sOt6*jFN)uZNt@Tq>M&A!Z^rBkz;yuX$({Hfoaq-$AM4qd!= z?%bJcXX;*>e`ECD%-vD3vF~<$e468BZ9}=4DW3vAzTD=pVU=RTdWJ44-z&h+XO7uP zAF|V>mYnVBtv|++>UY-$+}{4|@|(Ei{#ls?a~z@c z8gsVCW}n+Zw$OzY)>QBhy&mA_z0`BAQ7^~4c9kCfy!rEp+|C~>W)Cb{T(Y@nzQF2Q zm}Jk96|P785V^bd`z9$ZbgeJ8D{i-_U1t00?Rqthsdu5q{fO&khTM7dpl_ZvU%%pX!ZQ?i;?`F!wc8n7`` z4zC?%52+s1+P9JSDRW!;ciU~->AbWryRD6F1@A{@?3XgQ-mbH*Cb}Emx(chpZ&$oo zX?E1T*8N&nY#rSGeaC4XTXxX43~HECJ38`3xh3w^w6&ajbK0dRysh)1^}Sv<(*L?} z>BRZAXWN{4a=z2GjkkB+S^aoX(tym8&(n)G3KjI#yh8k{2bw|$Rf-RnLhpx^2A=R8 z;hw^^cQvry%GYEz_|UfKYVOg*Dyi?BUFZ$`VCk|p!r#AI-UKkXI=IfvqJ0eaE4TjTGy&^lc=UOy1EYx?0+h{LT`KbWnJcXXw~G` z>VJf9_8+4;Y4yslkRip7dpPm$^sBy?x1Vi%D&o)lvk8|+{grU-%e|*@v2QIIJ9CEH zKgjJ(4ZJdZw*>XA*e2{P;r7h(<-KlM9+^(lbDXyeN4;N^)GFcIxQut>^DZTSA2+^m zhb7rG$1N*lP4#I_j&_;TX-Yx_MP@M^%seyyW3yKZW;u2F8SjPUio%MH8bbw$lTyht4RV$cKE?Z-E~ua&>_ z@zSVkJ8x}`Y5U0Qg)!-PTEDD@U*d|MJEn-4^m4NAduUb|o$hta<&8VFwb(OME7|O7 z==iPp$>(mFOEZf;G|jG8G{Sb+)`#Bfu|Bw3rNMO?HhtH&R_CzhfINxzY z>sO6x))`mjNqKM2*&N5G7gqncDkU?{@wE1XU4Qqzwc!qbC-mxn%*FdZJ*DCYCtXcH{i##Y1N$zD)m}2VyPfsc z`w#J-8@S(R2RTunHO^-y3QeqAK0Zy8-<^M(nDMO8oPH>&bIBSK2XMJpt}wE?qjAs9 zRlECicJCcHbm72yeb)Dm?PhG3)%-2di@g8!da<$f%YW%b5MQBa%g5Z53GvsTg+JVM zXW{L_m}z(4-Klc_*T=7(KZ(muvZwx%**g14_Nbhi#rDz`C6!7Wxolzsu|QtTZP3h< zlf}Q8wp=u86`~y7?01TWmJSyivc8%f++brn-<1^~L@un^uSsOfyJUl3(B9H+aq~(| z_B32mJH2Y>%D023_=LHy=0>=pN>=1f`EdX3uB76`Y4M>iZ@*~tqSNzsu><4Fy?vPY zP5i7k-1`+D(lWYc_0QIS+Vv&ki!T3yElbREX4>7Qxw-|~Gu#AyjJ}I5O4EWeFz>h+ z?g4vVQ=*TwjQ9ULyyiPI-FeAgklMaq@5MjyUSi^+(}K9aE~ zvqg?Q??k~~+Xlya-kh9XH#Jar!jlH;(sXLtclrsoc6& zeC>}lpEgQq{cYpt^@lcGS}(IIAK5q}JaCy;CDU!WgF`6MeC9G9d|Z{aHsx^Q&&iM8 z)=K*LcFVf~DaEPX(+`lS-MEa*%xbCE-`&fK&H5$9mB#11%~}8HK;abYQ(I-}FUFy5 zV~O@?WNyZeGNqc&>3rRbJ!hIEL$X_A&+Wd}5ckU8R;gRGz3sJoMU8Cqs{ZXd3u}E})e=!5^i<$juQ0b0dY2UF zNGVSE!heWJn@Z-8lhF80Ongw>omYRoKA5~QWk6!{gvfU{(x+t-@~u5H|Do!=If4VZs>04z4b%5k@PmohjZ7i)SP55>KdE&dDkkxGqiQ((REfw zRf_txnWjT%r{CNC(qdb~q4l=aIalqM;3J;PObeK-(noo3KL7S%Ny^bTJLC4neG~uf zixshN;^@~*+?_XjQ^Hc}B}cz+_aQGWJ)O$7W%kXGK0VAEoj3oGv(5njfYKh z&9aFzv^0FLt;o6Sdz%KC>gt>7yLt@`{!$?;JfV8uI&W$Q)=y~_(LAsI*#-$w<7yN{ z{#N-(a5bM!ZYx>I`PN!1Z)V2SEK~Nq_s0|edOI_DSyD<;_`8QGbKVV0Uz}=tdpYfC z*7&sDDTNZN?VhMvrTfvXn!eEVqt|oG zIm0$ffM*NuLqUb%{UcvT?x@zFW@0V3TG|>3)w)-)Mns1k4oLD|;nvn*XAN|&U0Ynf zV0L~~?$b|M+4ih2AMSp5oc1C$I`v7)w$%6OZ8Ix=yp$1~Is0?b#|c@#WS+`?mfiZ} zvfS^ij~q#2Ff)?9rHwFtc5CG^%6o@f4!7M@POF#2#41zrWWUb4BBix{JCDHcbwe?mH{lR+Szr))zd?-IH@ZYgNYT z%z>HPv-f|#_R*TvDq}#}un)gv#eDiBXKulpf`&Qyxlc*_Kf=D>IY&s~57;V+Yjw@_ zm9_o#k4&$Ol1^1C6`SZHWx?(ccd->ckfpA5GYv)MS%<0tRs?lZhQ z_=z6D=2+uKlfSXDt}WMq@s+)#Kb$V>z|wYwZF7(39LwpP_h;dsIXynr`52RRGq+8V zsbE`iZ`<7>u4r}PTEe}1#c_@We2R08;7%=+T2mXD`RpYwhq)|I(Nxl%jfv7sWopSt*>m z!v!%q%9n0PTcu;vc;-BPjM+_1r;l>Ux@2QjH+PQ@o=&dls_)-RN>hI zzdSbgX#TH-zvp!-*lbI3rtll7Gt30;5B&;brfIj^OUo?o5O=^l)bfk=2j&#FRySNf z&0}i7(SXH)0YP&Emj|paH!awse8b?G{(A3H_fV7G5TaYIE2mvU|0eZx&9{A5>R*yj zxHSJwUc1jnGV5fm%N+G_&*x{^#aS0KkEMN=J~1;cd&8Hu`Ev@d=GM*`RkW=n#_H|t z%vTbR+qXEAG>l<{wwLaz(P}!T?`@gux!!Y?_d9pdu-n+cNSkK4|KS@_u7!Uqk0X|O z#=#cWXSl~0&mn%byn9%(jlE5FBdbs2X0fsIYUz9aoXy|*vZznqikvq&<#O8;X6HTn zR6m=}a{F?+Fuh<{VP9Lzk}rkN3dMr&@^2S1_9%XWE625!d_Rknt1$&kZElUmDi3Eo zby{r|EzhNLgA9|5Z`?k430{?b8hNj@EHWK4c^EnwSL!yhExGFSBuzWRe&bt9N6T>2 zXLCJ$w(R4YYU^!XK_bgFU6mXL*Y~!;*2~sPj?IqDlJt_PB}?*(b7PCzm2@dRXdCVj zTqfzNFjIKMEaz6ydnI@By*g0zmM+R2q;b>)`AyjRTSFA3emAIh_3G8)kl;|tLWLq^9#lo49+`J zGK_IEW*ZxrJ$2Qk6h2yvlV{6e)L(RGW|I)dXNVEJuQN`VLZwK}Jw&s?vC%f#KEYb(O5qL}gUu28UUX~c?;=f~VU7~NRjbSA zjU|H$j}^Wt9mBYDlh`42wB1_tOTnmuw30!>a;7|UOk@QEKd)4@Zg$O-2T^vmEt5}g z78khOgoV!2VgYknldOx^US%eWHHAy;Vcm4g3rh>r1zkMz1GAc`OiQ}^8cD1p+;VyF zefe5KdrfUa9m`a=#`->**1{Y6PfmfivxnTQ#s>7C@&!ki{6U{0J{wD?^L3a=eQn() ziE{2LNh&FIe&ec0MKG7NZqoRY<@U^?Z%W2fDV74mK;02-OI~L+m$Jokt!MdW%v{!o zeP#M+T5Blvh_m$6da&oE75ulZx$+)rvGhicr9+uu?iXW!L!!1=XJ84{mtc^~G3E4v{v|8e!;8lk*z)R?43i_ZjSTlqjNz)h*Y&&5Tl5qC`g-{?EyJnE9hs7*9BcK0^?#lN%7 zwl}x!wI?xc48zRF4DB=-t~UH->Id4OJ8D^A{8rv)9bb5>P*?0DUE{`+HQjSLipLhF z=YJ_`>+DG1W5&t1`C&pm+vU;^j+PQHzhXwPCupnO(p6UwoSXPlbeQIj)}?c>tL0#R z7(H6M*|gYAYp!o-r4i_c>~SiF`$jigzAAX|v99TSE50&4KtIY9?H*!$$wkQn9S_Lw ztsf{c*G5LM~Ri0$v=eU>u_XoedyWszTvrqoNe`n}(wC$$v`MzuwS|kUsl|Vkj<)ZW zA8T8(7c?`p5p=L)jPP1`Vb2$8G8bL_Y@OMY)CXo4cVBm0(pimm!De*zrE;`I#$WX_ zw08NaYl1z;W^)`9j<7p5E404kZozAMkhs&eSkzNaKALGrC5z)FauZ$p%bMu0ibJIc z{wP~lf0h1QbAdCnqos1fV4;e$(D6v}<-XGzwV$;&xsOaw*NxI*+ZA~iwTx|G@pt=Z z8pWmA?v%y~ccfHdnYNLa#cdilpJ~PJXV1xPT`8Ja?IEry>#wmH-fBn5U6`iKGx3(= zF!h2vO&2jX!((Hbeh&FP4Wne&9KOKSjeJi%LQf!e;}#cwr^q zjlbfo%!C`GG)0=_+D+6`YLoa2U6T!F?=zWnKWeEECS^-$49ot?MRRG?G4Tw&SawKv zGzYXTxbE}>F;ckVSnim`J6r)w47-+Ups7tK^8HKKmwabGDui=a_0RROWPj@JI9PJ5 zIK9-vl_BSHdyVb&9cd4_4ex1}OKRJbTmkY=y1SM;?z`Lq3_ax0_T$Bq3;!rCwRd5b z8g3XTnC5C@s70>Rjtx#1A3+agH_Fj+7T1gRXXBXRoSk_saP(BRwX0U?Nc%(QR%ajA z4B;wug&NG9CbyZI(nCdEsb{gDtz5}QTY$4Wo5@XP-*L0KS7IYaL#d_frK6_2pWb7; z<;rC%P(w8RwZCdVI6GR~*+{My6G)+pQQeCU8xvoc&UYsbj(7oc4=$9PB9j3j+4#J;&BgcA| zf$pO%;dW@h*G}LDQcvt7OXHp4bSLVQ_Mls1ONQ|eN?SU{PR0`ZN@q-iyeQKK_7&5Z zUCyo&5`{3GUfY3N!Bo+HLt?h8vYBWC+DFkwZO%Dx^^|iI-*gn!G*B!pQ zt2&<~_oZ#p&-5Rf^@hv(U7Sr{tT`dv5uWk)_;Ierd?jtTA(n~P*4Ol;rpSv$j@+TK zvR9bv%o1s_Ad0ba6Lv0pl?!8=K>)*BwHc8xL@F#xLOy-O{xU_O!P|;RLj%d(+asSC9Qomj*a^>3O!nmR} z&MDG!cAK%kCDVMxyqrDg8fZOP=$rpGUvS>mH8RvTS2f=@6wukF-j2q07k{1n*Qa;W zwKZGhI>H9|hWMkrklZ$EM(%_4kt3+da*24s)kbg#y`+7NnLVr7&0M9{2wm(3M}TXR ztD*3_FqmDh-D70A8`M5#rf9S;vzaw6`U<(bwnw({dd-ityP>IWllYpBaa|IA5casT z#roRyx`EUsegNam{^ES>I!wuQcY3Z|$?Ra$gj!N7;jnAIbAs4WJS?`9e`a|mM=&y% z*n0F2^cvbqXUi?Aqm-4MCb_dwR15K)lX5H}fzu1(Vk(4fs|_};;(ALx%dPp6U$4jl)9UNom$#tS0(>ojsOPbogI6ITsbkSS1F$~A{ z5?fd&+K#(sx^&V^ZUtx2CFwqBCQ0jrLA=>vcfQ~UPz|-Kv~jx5+E;Xju%onveK~Dn z-uq{Pzugr(M@j+In~_>FLz<#gX_mWt8T98Hw;gX2f%7}q|>F=tn~xqhHw zucnu_qjrTbqxf-2GG9ynAaByWG3?eyGD)uAU6;jN*9rSzA%g9~g)`r={k5XThy6|L zPj-z<@_cd+unWUznzI9#Dh$JP6$%6geU}_-`E)HiV!6X5Nf+#3#m*P z^O%~?ey6Qt=*#`g2I{KN6Ztp12k$0Sc5Re0b;q^u*_pbQ%r)wOv_;A!H^-(j>*+Vd z$1EnEUnDc0?XG#IiKL$J<)t7wg7>DqxGZu(cbC|ic$ZV0Bl&lZXHtY_oakU4ap`iH zQ)jJW?_f`5Mi@Kj9h%4VM`2FkpLxql&bi*mDTW@N+uXj@BnrIqU8!eb%hGjxmK>(7 zZw|1uu$(hKkUu(>mi$%lOJ0wn0rE7%Si?ZeOQTiaM<^*>?AT>rAYG--P|KO;Y^1nB ztSo;K9puK`dHE9EnOY@#Qi1XtVYACqyd=0$>C6FkqUHsiAkTF@w3TyGt~zAZ6C{p1 zp<853rYka9I*C74+L&j!-Q+jmkkiSUf73jn3rsomXma1PscVz?17GagLS^V~a_2;E zv8|>Y74G;5p4~{STTuOdW=G?JG4n zJovRPfnv1#xr@4fxMi#p~!S2EufqWO{BXZ0{^ z49%$-@*S$K(`dcIFQZTJt>t@MjFw_1^G>=u`^nYIe#A+;hLe-VD7v=ESHF$Dshgqs z(O$byw1$a{G>&eg3)97Dw(uYL0=ca;$@-hMo701DA!_6c+Hv|h+$F|DO_vYzJzX=! z=RyX5fU;@d)3+I(ttqkMEn%zFnR&w;Vh(5-%?#?U_*T3t6$#~C>C}FmJ2zX?RNI-1 z&q>3D4NQUX-qFR;fR7PeLM!?>+gKN?jn(d8>N6tsqrIxVp`*4flkX#+p>FCXn--a; zb2=)LpIn+<*uSKY)0-AG_qC%8cEfenTMiMgx_;+3OG*3;`Fj#YnMfZZ=fBr<4Z6L2 zfv4nJVxg!JwmHv9oW{-2z%)zuK&R8ab)}S~mQ147vaD=l{xHrr{l!dW))=xi&jeq2 zxwP8RtYoh}hkdHsX-sqLZ}Hck6dpK+3k+{?brb#gm{E|}fh;&@sp>3l(PPiYe-=k?yrBVsJMLH!m6<3Ri&Uj%Vvs@Q!3Nu{N(uU{K zS?iMGFhR?ClN-rX^{p(!wWsNghVq7T2gIc`Y(>F(riZy#MC zQ{dPr+@&sy-R%P%KGZsXxl~bFO0Uv3bP4h)RpWP++*mL+OIm0!9S;$g`D%z?{rc@$?NLyVMw0WAE+7DcB%>d4y(z2y= z59zjePI&0JM(!)L()^(LLw8!g+tk|Fl&bFBEcB7@J5Je$^P3s7>?!Zi#plTOXt`t zyIM2JtbwgXZ#MpEs7TKc6I`=gMWwX0l#k*n=&u{{4K;Ps*f`;_ql2>#Uza~D9b{9v zvD%i}o?H>RS3QXLbXZ(Xg+pR*DMoY7G*O?WIiqf9d@SmB@|O718758dNjc$q$t3 z$yU*a+@78GwiE*K$EC+;mKL z6^Qd>A0~-irJ2NBVOG;Ie2%M?=u6F#u8YmtC7NWpB0q$h%PyqWNptCiY%{upI9;wx z9VFhjwz163U zp_vrMkF@7HPYMgfmBIvOiMEvN176yp8Y`6`%o2U2KZLV#xLiU%(9G9(GqmI^B-f%B)3NkD%{J~6 zSE3okRHrhir}Q86E%q=ilKcG;lqB$c7!|_oWjr-cbe*(^>G$#ws)PL+sh#A+b3ypiRo^j%&k>Kx zO_?xF9$Sv#nWOS`Vs~1SNb4YRvOG+)ja@4Wd~YU}86t|}HLwALVSp7x7_I2d1rNJR47EFp-S6Xq48|H`w`dzC=@(sd03G+=L#^?9y)1G^by% z+YHt9ZtOXxgdRv`3EPE2p@yts_i#4t0DZ82wzePhJ9SHbCb4oBHI5m;7SfNX*>sF- zlAFm->Hf@5a%Xv{{H-*E|KP03-;#o)72-wmcRE(-59x1Fa&q>UB`&Mh)}?f*YZSGg zWth!GV_FLfNSw5K=@5HoM}K}fmBPsET+InhEHjSwpjatc_=Z2pZxa3xs><8gYwR$t zy#6QRoATO)`b2#Q`JOH_Q`kjpJ0^=+Lu{s`WA#h*2My`EJ=!B|OQPvTR5AIRmFIMf z<}i0i+r~Ig|4DO-87n^)Zae?72imvT4>~qEvhCY#BdyU^sbpSBl=U~qZC9u;UaldR z6MuB16rIam|K+gL{Jn_lq8@?5)~x~DkzF#LNOo`Bq$&`{PNBd?)Od6XLHWE_pW#U zclA0Os6Caz1Xa3Z>2kM94fDM1C|9vyp9Hvz= zmiecIdPb{7lR4dTCWTG}z72E*hx{gZAmYzmnA0}*vz-1puK?_q9_@`{O3>9v_Yb~U?Q^6~hdvNwtw6^$$YHfAU8 zNDfE`tbM78@w>`CD*LKzW$FC#9}+v#mss7c`siy7wN~y(?L$bY%Z$c)z*wZeqD^t$ za0Wtdf7SP>e`YWf>6zCrXFL3Eqv1>aK68P-MSDX}`_iH7Bj-k2=QhcGINZ~}1d>1NusdI4gn-^Q2cr4k_`r7TP4>Q`Bmzulv4*HL- z?u@aTX0~Na>lLesw$yyY{3Wm_I6E{fygM*5ygc~3zpL+W<9##VY-tQNgZ`a?wxNB& zTHzMqCxYwzoy{M8hl~;0YPXU0n=#n`n*T)b{zy*na^HOYF=tn1NAlss*$FH0S@QPe zD~V|Q##l5qxok(-CGihav2@Ui99H9>;5(_@vlPTw_-@+XiC(aYnv- zD$^#}IX*EyJNbn@&NvdR67CUc7{1H5&TMS-0bdyt*c9#+9T)ABTPZpxm=1Kt$XFJ5 zB2+!+_niGX=jMKxvm*L#=)utX(1!5#=-|kMpp@Gqg~4^0qsh}px+kpWSblF-Y;NhC zvO%#<$-0>e)?Ryl=AwiipIDk(94Km3Y9=ZqKTSq5k7gcEzF&S->4dUhOYbi|7v9~e zbpOmyNV(s;SAfgd`Y+}>^IXH#XBqSLG43z+L1!lBrbhW53w|7_ocCvb*Ss-#Q}f=7 zG!2gN-*0v|el)HQPK*8(-JSbph0PVl<`je$M}LT(6IvU(G4GiQRr2keYB>!9rS?;a zU6`qRudq?cjKrMGL1(P?93+QH&Vppy@`=SC6*fOrTDZ8(N>oc#wANUiGZ&=ai;pYs zUiwh+*wVX8ca?UDos6HAcqg$fc`*5B>MU!59dzsHT~X8P+^fLxuS#u5T#k9Yhw*K} z7r}ZFD>^EAZ*+XP)c=j|a^Ga%H^u^gv&ezS`8ktvugTX7j^=(GDGhxaS{WJ;csKk- z?%;xZDqc~csFJ_RRRu#ru5qdRL~>ox0(e`R<(p#Xrb2-D_mY_&{YVh~3f>Aiud9LYfXcfUB~N~T;`)<^i-#smSk+FLPa9uoYwg{s zhVdCC8;S>%>@1!O-u7@}f9mSY1iPu-+&&16Ig=WcyeP3E)~NjBvae!ul3J#L`?b*k z-%PFXe-HRp);if2TCq&XUgP+Teu2xw{c>96Ey$af`%(1r(1iiV|ERAkw4nURhMYfh z*5&pqXj)L3b0qR^?$o^2Im@Hl^12q(%bOlO8JcWtr${fO|;?mSO>lV8b^pdrS9Gvl#6@QVKX6@9s!h%y(*PJWT zP2&%h{8jv8$@Jo*rPIpmCT68NWd3xfx_4;#dM|gJ^3)p+QtxIO z8XW_%Kx^M2y{XnHy`=1yqDbMP!kH!Y%6~|0bK;tX??|h=9Wy=HH5AJhz)nvT*+mkhlx|I(uo0iDeFAF{qekJG+ zEcJb8`O9xBDmi7J`ufxbrHxbFo%c1LKEv?o$xKnAbNpzzQ}%vYJpOlTb!MvNb1b*7 z^Q^tgy4=3fx+Og%wJCW~a#H;H*k7@uiKkQ5(|=nv^r6O9{fPdNev|uv^zaaPnY~?GXYjdy7UzxWq_m7prz%a2wZTe-Ay+e%FymYHcRxT=7(l=pFi+us6pha=qq_03kK#_&if+w zwcIPC)xy_@k4G!yew^F3!rn^9E03(yyyDXpild{A7t$}5uRS^QP~c$dSmly&iABa= zxrs_OD!-6FD^%HSQrhiEqXR4UpMB`96Ki6xX_trW=&GE(p_Rs@%!=|8g_BMgg?|*= z<%Owd+-klb%oApF-we$U?c|+wv(&SR4T+}`gX3StFM|BEIKA1vP-|r_^7;J3%n90d zyH5Jj#GA3HiI-EmGG*HB{?@?t|RC9`Jn-tRG#Tdv{KY=+fx4 zaF<}$;3c6R;f0{e_xbMAbL@lZqshk5ubz*0gcb6+)Qrq5tC~I5 ze$ZLwba(r?KRRQbs!p*r$Xb!Phb*$-gmJE9+i9)F=(%iLxZ8iS3ijn|EKMhjyJ zwDz^WO8zE+>A}vSV0cyd#mL}j@0^-B9ik&5=R`k^^o{%x@#Wl=cQDUi(6&OQinA)* zo_{d!o16y&Wll8pN9no~jgMrGTv}LAJ}UE0;Qjo2DxF>NP|j%o>hxWO>klr2|f#II*(uyOOc-7c$rBxAi`-m$Tl(5` zzvL5%pAvNw{o~gpMkFhwzRJvS8tXChC*L2w`;E2koA`EhQ2a#f!DJ-e*M8sV8n`QX zYj7fb1E*_AYlv0RzTUZCU*lgE8kqBH?ibOUqy3`KhH3|g2G@ix55FI}Abdf%Nu+Uf zOJrm2mI^Z~&#XM?tb400t(3|CB4?0Enka3Ixsx+L}Xgzw#eC$ zLy^}aQ^LQ8GQm{vNa(N7fM_Upb>66gDis=6n48}-|IeIcWME`Q;7FMOhbny8q+o^xOr}Ie{G4 zNX{-XPsL8`I(2_(?Sy83qSx>xe4~9$jm^&3%#zgE$#WB}64xi{C4WvvQZ-Xe(l2Eu zSsfj$hiIHMe>Cdr zJU3=)k*awc^CK00&7YCGC3IHcabGjDzEN&|AAB?NW3)xy(*>mkBl0@ubjqC&y()Zf zq(jbix!2%Z>DTgZ$o(pCyZ)A4H&Lr(<*AzsUnn`hykn}wo#EdRiiFw+^387cPw^2Y zIYlcAZz!r$8cMXu{NeP`%JsgQZGUVHPL;-M$Aj_J@ga$wpuq0-yLJF;RMfB!VkWD3 z=6L$^R5+!l?o1AePm4E7e4mJ<$6C+3FK7?L7J1lRYCmFqn%a&C2 zhE@l+_~)C|^@p4f?MBXH+9q>K@b1V5IhW-P$t#P#5H1Wf@^!~r8q19@%^{GW=Hz~u ze>S{6f5=-My&aPHApafy27wQQe@E8lx%uDct;pYz_k8FU{eJ72WZTl%iK-{xE3Q>m zIX={0>t7CdjEuO!H;jepU|FrgWykM4w(I!h;zttQ>=nkwKs3}ZP^iCP*@>IWZYy42 zII6gN`PgJ46Lx1CpPBQFbF_I*W&336>_mRNP9it48gs>$r^dijDQ>NIm+JG3fVspt zr2pv-vL=Az+Q~Vo4e6my7}Cby{uO~ESnO%N`7AV)3GU5U4JEEEH3I%m0+)ezz8QHs zQX}$2cv^U3_;BdyQ1eiEFdk|cUKRN^XD!-%OF>D&-28g^-{oEu{Wj7vbe7r9`6Bgu z+0BLPPF!F}yL{)Gnl=pck#8ltBpM~!Cw@-6leCk0spY9A znMT%3`*nAyKHD4uTjv7Tw0=tF#YU7Z!xHv^Odt13KB%o~_@Wq1{2>k+8~rB4>lKlM!UrDcs0o9*pptI+JwuE0>=K({m*FP&2K zUZGaBrTC%PuGBvJsQavbgZ`9ry*)oYHgQY*c(aciP&YG&pQ=Rr-^)A|S6_0HGU(9E^4%f6aE*Lg;3V)}xA zgzAK*273Cc8t1yd+CSMZxz8Je0;9u`oKJGsK|xB-2Z4<8Kk{8nBJ;?6#?m<$X(j zD6CdAxU^S%L~252yju^}^L+O~td=syDoH*8dtdWJZuy|HWzdGFBo3vf!(#iP?{WWx zKn-{sy=`|)e+Cc0&9P?^d#spokH1f-RrDan`1Acg>s??I3|pP7T&Za z_*JR(Y0WxhZ?ay@yq5knb$7CVY*Orjcya7ltWNTQ%#GF&Ypz?M2el5)m3BMphtz_2 zr})(P$oTGf?_}r974}ePg}Xo>ZcNs{aO2JbduV1>YHw;&x~jF@sbttbBbW@e#*9pl zz-7?046TXVOPdcLom&F$hAKoW<$RN~Cue%Jes~aCn`_<&iQ#AS?_j^kp6Ke_;dvGF zKE|ph?+2gqmzaHhW?*sf*YJ5*FXM;YI(hFzi~ZxZ4%W$pSz4p;WYNCT3(7A}-soDs z-GL3kpWvml-0hdVvaDlKgOm51c>C0rveM*WdkyCBclw_*E4%a3cf_Za9w_>=@X3;J zY)Nu{+H_{=g_w8FIJLAAdvofJYe z=JX1`7<|+}+!(L7Hed7i3^k36j5@g;^5#K5S|0j2I3ZBe-y%>LJQZvZS{*6~w+!DM z+8P`h_{|()*iMJ^5%7-(V^@~XinmJd%s}eWPU)+(3!OWyvg8XfU-{&+b!8ReGm-<- zk7ORThuL3dBAK13mZ`?^TCuM2X7M$#`iU9oVb+t@2B*IMv-X=a)&A02ole7IT`BIw zy2l?(oSg|f@3=8-y%9H88?7;yRl~N@+mqvxBQWyJaC6MN0&j-eN6v~=4P6&_)t6`V zgk`jnezBPg53=(^*F>(3HjVxrg{3+&Dfl&3z}5gy!$c<-|D#qSjjD&1LLE#5ixo3#sb?pxD0rq?H*h_{K=i}i`OO!QA&m%KVP zHa#)@c&ci8TBb&(Ej%nwSd*=FnGu;@R+|hyR7`D8znIya+2m;EL|>Wje*b#turC@@ zv3Ju??n$QyENxd9OU>&7lS5}mE{pygc_&;qbj07&*VP;a8|XyiYTp3=nm|ctY|Czm9rC%YuaCVOEv>MrL1X7zrw+NZb78ROoo)zWoe%fLkcJhQzK(jRiau|Kh^yFR13e?;)HaB*~V^l+%ipEUPs z3A?5Bs9o-k)@z!h0xQB}APFuAUlJY~Z0)}b9y>?$m-LqU5BfB-5_~gP1jc|yehK{= zSQ$7P_|Uh`7zrQ3LZh~EpLvJ>{lG_on*!|vb^O2UAKO=Dij&pj{mS!Wa}w#)5Ua@T zYd(y%n~vxoI#&9F__5OGi&qxcDC-mZCh=iro^!x?&8}k|P4`Wf#CDcfjJ1dtV!ftE zQ*WfFXS!xyPPfW@kU5l|ovv<$?JZUZYrK`PF3*gBcgKC1S2I0P{>$c*Sm14p{{U7A zcwZlamCT-VU%@J2hqQN%hkPxA6~ogaouUs$I)?8JcJm)GLuPGbxn2jjd&fUE*gO16 zcyf4ps1xYf@%?39?oat{HTxPj2kr=+6Sy55`)7y-Jl@*Zc-ZccUYL9jz3Rebozz6@6{oIKY9F)XnUSem5@viv{G7z5#IEH2)K}?Y zsZ8Sj#Hz&B#PGzR)L83W_y?S@Lrz8O(`5Vj&9P5nb>bf6Z3+*eU#!Zuzq;?$l>$KRb);22Nw`UUN|3;n4e$MLD&jPX~|s z<{Rfg&YG5~>CA#ZS#@8_(Avnt$h2_Na8Bq#{~N|t`U&k-?7qDfv(?>wi~W&+>rVyS zg+>K__um)z$^W^z(%7JXrhVxiaMro4^^-=ew`|>SvmS(CYFNamRPkA7g zo2Zz6$Xabb?-V)BoT=6anW>rina8d3onPIK+5zY*lii;7NPL^HC(|MGn!Qnf$@ti; z8hAg@*x%i_QM<=oWM609XYbLD86$lCg8AVt;X2`0LhlBr2M)l`cLb~Y59klOb?xby z)|u}tpZk-(%e>cr0eaRc^ELfj_%VkwlT!ZWZ{aJPRK)e1j9e zA$ck>KG7^))xI4*SARNpVJ)~?Zpi({`Q7T0u9Zy0!||Nhrr2%Cc=~r(83q_z%!IK@ zyVE^p56p~CJ(=!fHNkV&7!Ug=`X~AN`fu>KkSB*G9Ts+`*WKf5BYkpAnoDgx=}z z?t4Z50qY2kaL%zmaK65Bq#R`DBHpdxhO-Vfs3Ht8Dr-|QFH&}b@7qc@qL8=gL5{`ws zhi(d<9cbfw$oN?s<4$$jJ8!x-8C`t0`}+mkMxKn^AAUGAD0rj)T%*2rg}cDn30ug| zy5IM)e`9cca6#};Ac0x>`Ob4zr_A)saQmb?$GFS4*?(4`lK%?xE$Dj}T9(v>)7*Q^mc;NoGc+ z<|kIi7sdjy$?;C9{h5!Qy;`oh*=%Q=t3}*e_T==)RLjge))afUJH_1LujqfrH_RU~ zM>}(^O7^YRz;t!Hi&4YZ&HrrZ-JFxrj*uYN1tuA9I^WrMU{%CNF}qjfI~F(}^RaaT zwR~&znxOU%-BQfb-|V|5Fa_V31Ou+`P2)GW0RBzq+jFcN+=lvoZL~h!?CP5Ue~&f# zJZ+gX(OKyB*8=(@`bp5jOzm2C1w5@Du&QT{q}yelu)0{yGR>^v)~d|j%BGzw{vLrl0w2QDK4TUbAM37$wLZ0C{Rd;VSL$Q#$)j5IcOZyCxM#(2Bt35CTnSg zy82I*`u8WZfgxoap}9X{aA&vy4%~i)Q(#G+BBLu zKVw+St%2~i{>V86KcH#aAl=co5)W39xx zcF)Y+Rx`UFXy$coy`B%h-Y&kw<^&_5|EWFTKIFh7$Jy`9b88r{m>YbdK$XC2{t3Qr z<}v+oP*7+0J16Dzb|+}PVWGR#e8|_^_lR$xZ;AN}=7>|;<5-zA7i(?)q!sAD=?2E~ zOO5WvFS@OLudN0rC~!}qH(lq<0;d=ZOx4mi!XK}-(b0HH@2+)p?{>CX^YG=$6pXJM zGCy0d*^Ql#oNt|OScCIt=VIq8`)Yff^+x8C%z4(&nT44vt>3KeR!w`M-OIVxY2eg% z>N#`lzoKD^3<`EA*AdtL6p1QNE(9*Y%v~8fJs@+F^|o~_X!RO5gw;`ZXyf!pwBgS8))SexQV%BE zB$vT^?gi^UXNOy0Y%xaYBehkKIc~6S&6HXDz@_#$&Gl{i)$rgO?7Iu|=BxDqTG(yk z6xr)A+k1!hopHeI1RH9ZzlZ;9-=D^vdL8(Ghu}vOb>GC-PxtC=jlJe@-&MY6edqgz zm=78E>)&84)M}vHPw`Dpe?4rRZCrvc!rB`%ab=Yjb2mCaICn#8?BT3MDG$LT?iu|H z%=WA><{3xzS204p?QFKjXDVkpW!}s*u=?9iJFj5n&|BQM+|jPjiP{IOzpRc{7?NQx z=agOG90OPU%^qhzX79oGCAV2qtkGy)LwmgaC|dEE`+;^?yHKyK@73Oh&(_QCz3|xT zh;?Ca)XoL(SdDL7$C#g+UCqu$PrbRe4PJSr?u%MNAAmkt$7lFI^8E&%m=WMK2eF>) zC+=>nRN7nL2hSY`-}dZxy8-b?$M@duWLuKqUq<(o$%J30m*50dUs~Ob){46ex{Fx>}u&z zeX--WFR^-LK1#1kpUm89&vWW(%K`hJ^)l?_aWS8pDm6 zMgkscrGR!%&`ks9Hmq~%)85lo>22_2RpWc3x6w|ofzUv!;LdO#!Fsq8;O+H-8Sq{2 z>*a6dKZ@@#wqulh#{ClWk2~EpT1G$5Y~@?#yTG>y{y0tauiZV)D5pQxxV^@GNV^(5 zYML?7_+4+TeF^?h&0cKHu^zNPbLzRv-Gdk>yFp6(%w6iPappNC@cpam?6u#7M`a&- znq6X_>r8bXM=y>$#m=+t5Uk$%Dm<{d<1QaCJ=#v#NhgBuEZ&0O?gOswe&Wn`#yOLn z%V2|Rtj*HC(>{Wv*h>2jYrA%E{aEw$Gj|gB%YJ;LwEJeklh zFbA6p&A2%o_S;f@tZrd#++%J}tpEG7HcG!4G`Y>FZ&oos0w%U&RoJG0;220LBiz@p z_VBgZui6!QbNw!?3w#{w)rPf4+~v;Y&RGamf#b`tF7!39X}_TThBb^gIm7K8)~A_! z)9ceEnNwD${}>z}fLyT-{P-#OpGWY0$?eWJposIaM)qc`zYwVm@tHnS@1p+>p7jg7 zaQ#|)%;T=dmzbaG-Spks7g&w>Y>Z<;cpaW_24X$ri{RPsx?f^#;ai+PF={l%7`4Tj z1|Qb~Erpe+dti?K3a7181CrcFj_r)Zy&F(d$2ko7ex>u9)7O37{RnTWjdhm4z$(NS zxSO1z@X1|-v1Xnd)s|qiucXJ&PkW$COldNsWSJ#{X=$2sg) z(eBmg71s-4jNv!V(Vx=xqD&p0Q`_7jT1&kbJXjwzI)m~zXgl0a@OSJC9(EsAI=)Tc zfRT9t7~Je^cV=P~y#qD<3@dqWbX%jJ-v?Oqz#LuxBZh`nUxD?Ve{l!7 zRoo)LGyysoj&=;dGXpRZ4l@=TYmMiP%EmSNYUq6LyJvv|IDpy?@TaDb6k4Gzw}HRC zt`}hyXutNB+ufal^~x{Q9>!bCwC#{9-oyIO^*|dN!L>fe7hzFIJ*&0buyXeKSWo&l zNPXL|CU^r#xl5eqoU0wosW~%%<(hbI8CE!N0o?qI^|-Hq7u_JIGkUUvQRpFeA*iZ9 z%DDh<=n1{z3t;VRaH4O(eeQxS{vG)7_xkNvOZrj3 zl(vJOs*r(e`Cy_(tFhaIv|N4C{mXmbm>f=Y0jfhiHX$;&ZXa`R#biI+RiiYrRi! zOE5wjuz**0Z^LN%JvdVyWUC#}oF-x1yxYAIoahF3u=_05IR6y#N)9N$DZXq-;GRY9 zV{RYFQ$um>J#gBiSUbKhzNmUon*_f2CHjyK&BcJ#Wi?jAzXm$c25{+N?jz{IaksDb zHRRTY&_i}%l(XA*pr%LhXIhU zEsV#ez8?JH8`Q1|r2IqB)w{X1-OJqG@WQ?pe5kW~ky{NKKorLT?pyS4;;A{ z@bCnzw4JqK-bl1uTLY*KfHiMD^o~2gQ$mnDmILE?xbJh^(+l`41eVI3Ft^rlnqcjT z)z}Hbb;FP}enP88K_a~q?e2-W#Gz>G3s@gNiZ$(9cwlO8{(DIhx+D`xu zKSCOO3R>e0`n|BIbk)DZ+hzkFUpkPtofR0ZZU$Ao0G#^pWGOVYu(krURS~-zlwcK# z)@~iQ7g~Hb>ed&uRv+B-p!27b3q0Nkdf5pn`VjUHz!wA9dts`(0Cj&7@hbOid^5qE zH$YEov7bOy$Xqu<@|+G2s%xLrWy3%8$ibg-Csc6o3Wci4basUfO9+SjFt~xatLt# z2|G|6gM`r>5bB3FJ*^D{eO&+^wih*@i#-)aV1JDn?gyZn<7j^rJ){k=b}?XlA>^K; z7-QdcUqrtob>^X;j74o1K^7m5w>L+-@?n4Os@;v8wUDg0XuspD|97=#(R12h#}XT` zEyP|d6#&l%0I?UL7Y&CjmJgVI3Vgl_$>>YKKBBb-Mu!1fy}{3Z0B5KQ$?QjPm$QMR zoo-i15mBrbbcJ3WJos7kyx#!F*F8Rb*gXgPMO+Q~>5ZD_fW~%Vr2hkwTNCX*V0|0# zVPH3pRp7CeAer3`$-{Mg?%C*<@44rqMccLW&|9trS2+%h^#+&T<7vT9G zNJSkmIuvMSfXKIyGWG#`=XreoQS`mxppy&1UkX8?i@`OA1F|mxgBw6I<>1oifh)EG zemVdu*s}q+{{(G+5&UF3pwk9>l)Q#F&(X#MKW%V#9?EKmohzOJHEaS@w<3H5o^T&( zQy-d22`DxWK642mHVHD&bi}5EyQ%oJb$H@h(BzBI zvMxhiPeDGt7+>vvhdQ6c{wxu9J1}<4xg4CYI(o@5j3uoA(-WYFzTh!i(XU@ez5W8F zUJo5$J@(`HL;Dt`-v=5h1;m$w4u1e8U#5-5Gh4MIps3gJY(?#Ji~{ZP-AeQk~yYGNza?u-Z#|SVQ7OB2~YBTJHQVrwbMWEMv zfc4p+QK4X(uVEl^+X>`CsyT?}Q{G<0W zU2T-r1tZiz)SxXSi!kW+7eIG0!cy?RJ>ajk@wPhvpYed*bkNpR(9tZwWC^|-UkZ6) zHXzpr&lUp?GeOS}A&f(x{SN%U8mO}$l_2J*$^j8agu?~8V3H+18 z%mx*`h5q~#=%6a3JMO()7yWn#suXhC4ttL@R4xe9|xm?S~Zl1xA>4&|i08ho>;^=>Xny7y8N_=+o`-{#EX< zPecnwd)Fsm1ey;Sej|F~HgGxa5cVs=4(P}!z@`p*Y+LmC#u%~E=qYPa#yq_BZM1F= z_-qZp=6dk1d(r#)gNt=Q`)Wfb3IkRSxNR}Y*#(JZJ$mB%sPX%#|4)#2T#P%-!99Cn zEbNIs-U1Mbc4mUQhe zlspxZa1ZqTZotk+wDl)QdO=_@3Q2N5%3X%1=VHwJ2(3Mgl5_FadZ=$zyxRfv|3V9Q zqudgdTo+@@wcvOCfsIz+t@+;0Z#Jw(`QY*OQG3}X{(O{Pgt72#_c`cvcR=6j4Y}nJ zPgYw9$WlLA1KL;wx_A%t@hQ0SE@(h;z#s?Qwhqc_jP_rMH`WB?0^t9L(AIAN>$Pa{ z77tp4b5FpT(oH{%d@VrhHm>}J(rC>kU97{K-UW=`21aLjR52UvT?ndJ0Gv&Slrsf9 zeH6ktgh}AOZ{QlKVxf0^GHB%~z-<)jJ{eG6=27tPs4e#i<34)7cs18h%L~x@cHp)*KHut* zHr^k{7;+fnbrI-27Z|$$V_gfhsRDZN2~f=UC~*Vgt)QPW^mW-a)#p988*Tdub>D$8 zv>0{b?t;0HN4VG8F}(X%aJtQC-2t5Y(Z_0`&D^297Vw*kcXNlu1g^m`6g8v#!rkDC zL955{d=budNTBDUHVr{Vbv$^*LBZSc&fkDHY6=0Adk!d_a*5_q*B_|s7Ekg%h_bkQ z9rqQ*r(1v;a9#;C zMCrC6`V+^RV&Ia!Xe%&Et{MflxVtxbwS{N*wG|xJAhU~Yl0{*4cHW+=G=3%2%!vR zl>_Fd(4K<`e}gKHql`3qCUuOefbuygp%QAyn%TIL!JD~H6wU~VGW?ULaY(Ea@7#km0_boYXPZj^6Ix%mA1SfVmXn8yP9?m+ z!kx0yFH=dB%JO+1-}St-0ju*ThF3GD=G zO8Ja9HULq!q#P|HeV#;IhI0+2<^ZDH(>jE^Y?MI?Ce{?*SgTUB>Hk)|k>UwC_ETbx zcq_!8y_P%YmZJT{JGr@nHIIU`65PkTs4;VAT7^08fXm&xc_g*+Cq0Wh{uX+4BD{e+ z*fPbxdL!S;Qe_M~2}2qvVm&$Wz$bxEDC8vL_XyEbb$`4?SiN_%nChV|5rhg)dM#&bNwKUi192hvkR5(Yymt~#>|NwKrDzHN%ww+f z?qgor+^bc3xjM49A306;;G?Bpq-!al%@-IAKjJ5bnbF2ygNWfw{!o8Jb)~(I8X&^Dg#J zp&!;w0^!E`vaJFY@;kzu+#%+bBQle~mK=f9!EuUQgA^fqZ~vD*{!i#bQSJYVK1cSC!<<~&mp zfbcAlN%)okIG5}p&)w50bLDw53XcU|sEBd40HbYXgbFxv&u0c6&qAKMQs6zwI3K0t zdx262%VS=?R~oOeY{u%y-JvOQL{SsU9T8kPvo;*D)QnYusa+ zZ)K2Or#WV`OqL$;SXP)4T*?T-w4|~z?;|$lubxu)5nhDneYvXWlPwkS7?cXVpDIVd_kkFWgIF zawGC1{wdRDWp6c-QC{Lm#`81BHA#!K!jX*U)ZRJTQ6iA>jn7dIm9Wk7Laxni1D3sRQj zQ5We*^ql`ao&4)n(LyOp8s7Lr?TB2Fu^N9k!V6cG(UVuA-gS zFLG11egE8MN>a?BoW_4eJR{PN$Vc)9DW7-nZY7OLN%Ayf$rq_9*L%CVrryElDN%{k z!1oDs1;T8Vv`i#3feB%(U@H(N|`jbl2IYxPGxt@kK& zUa|5Wg00&NdW(?*~IZ3PUpPyFp2X;Y#7f|iWE2u#z`!9UM;|0B&i{_=v%0Psm# zqfLw+#spKrLA6E6Kixj2;IbAi6F4>=iLK(AN{C#rJY_zA!rLaTc{O5KH+Gd?n7{ReDxI}vsuFy4+i zq3zyryO-YKoik?}<~KNF#5;JO)GnU%2?ws*rix{Lg(w-<*MaB%YEQ)QE{hIbt&M`1Wh_dGs#+;j>ZJuzK zen|cy7Q`a24~kqSk`{Rou}fKrwl>i_I5QwJy68G8P3fGpLU~-JO6tn4_@GdxcVW{{z>8 z?JS-ZuJ?JECXbas%eb^lVVk%nw%Vq>Gs zM7}Hhm)w`!SaEAgJdzgfEfSE(G$P|rVq%K&jz~C4(xFU4Nv5VJ*T^+WJWTN@F{K&i zh(sl^+`)1fMCRgG1WGDnPPSH*f>>iE?TP%u9FYatJ|&4uo7Ko6~Au=Dz;IM1Ts#@m;jV}_7TR!KdFGUpltr^ z!%Pc>h~C70thj;P$5<#y^>P_kRB1w4@+Nt&?j3}(s6Vl$3^Ko@M*TA_RwAP-*-pk% zQc@+*5M@P<%@T{2qa;qzX=I!iNtIG?Z4akB691$S;<%1?MRItD%+c~(XiZUwP>VdF zN)kHceOU@&o}v)ar_i*LLP!@96orsJL@v(C!fc&LH;O`pUf7>RCKd`&y-hSpp%Yqf zY5f)YV9Xgjfv%Ez#Tqa2uGm%?6EkO02-Bn$QV4${IS{{^H>XB=P;|ptW}zU`h0F`f ztgw>%I3Ite-Hanr)&?dc6*YX(@0AseqXI_<;cX(L$ap4W1}#)#0T9cYlt~^)t|wQN z)lQz^2q^R7yhFx7H4>6XN=sC0Xp3Tt_!D>tgcPLYOvPfqmYGM|L`^`R60O+CMSi2z zU2L<$IYs|eI*jNyiX#Xe2$hq^siJXS5>U2kVo2l#cGwE0ToNI&>-b7 zmd=`qpNpbHv5`_XCj|=ai5$ipp+ZHAY8EAXWQ(OIlM<;V@JQ!q&}fS(u+`!P!Xw5Xsj_PuPH)vFSLZW z760_aW9nir@N1Y$5G1}79>bS<;WDJ?J$$+6v&p!%m!b#f74UDp!i(F%Q?Z?Q#vG>F zYV8rOL}=$7d8R@~c&##Yg3oIwgwEc-Gmc#lcI^W5-8~&Y6ADP2E{`n@UA@AhV9ldkbyrXxIw4x(gBSG5T z-aBLa1q$svxJdfUoGjc3J3@{yZR5pEF;C7~<0yZ|yoa&Ef#kIIN?<7x_*Mygr_`oB z>fIi>f+1CFslVWacMx6*GlCW3N1#Gz6Ruf&DA*BJ0zF=3O0YV+YinwPr5cBy`0Tb9pAQ;NeQZh%gqalsF4v!jOS}>Jo(FN%NPU z&f!sd#+kk4V)%DojQ+#E)WS=#e=*%0dCkz@_-7#BZ-USWN8$4gy)(u0Iezd@A5G!) zv>5VV*Bfb+JuxeRi}b~Fk(tOXC^aeBUZj1c4Tv>WBqNcHWK>`d#|8;%bdVWd;aJLc zE90n~(cYruB_%PbIr=m0@nW5qu~|lGB|V7`l-LSImg3Ag#~dY5ah&H|C}*W5#h5wj zOy)=paA@-6GbQq@+(rJ)pUBABe5RCy#%D!lll!~}PCvu6yhrXA{;%$r_i|>IBcQ`q-#Y9)RM(NfwG@UiJtTClpuH{UWirx)KSg^!~c9;VU|asBY7_S zq$*8O9N!{=caj2`L!U|>O{7>e-l5({>Y&#uk5X%~1(4bmy$JQQ7bxkL5K)pC`vD=N z>;$5fP*!9A63AwuEh(7=6KqhUQFA+#NQgDg12N_~sZB6RYp~E>MbL#%nvz$<(jc>9 zLPeb4Qr2B+=VB)oDTc96+J?d1<-Y3}+0K1DfFp`SX6sk$aV# zK$)Qhu26zd_h(btazv_N8GN^rFnC?+Au;R1TBsIDP34TOk@oXmX#ubEDrs3Lo+*Kb zv|sWGITZ-g1|DqAgf1aZnkSwZlk$b;i8WqfpXC+yXy&QDOAJd8=_fmH%3M+eXI7<` zaL$!qp9u}IZ-|9SBqSvhiIhaDQ+!6`CDE%$i=I3%e-`T=8=;&nw2!b55O;B`JNd@xH9g7-72 zgE_RK2o2DtA$65Ig+oe>MIL4jDS_=0iXa3;Bj&TBDa*OCMRH^zhKcViMJSFWSP=T) zb-@$w6)KRU;7<6P&;Yrc;;=#q#Jy01a8co#!gGcHay(?N$QB$@pTWc9@m`7-2M;;kx6wLUvj8)8$@kPcMfwuHSNy~LLXTVWMFd!I`F;ViA zJ()+Dvz9T5cqI?0jlXD6f^`|Im@7S&^g!Oi92td4QxZsR%oW){!H`Jy$$48w?ED@aR``5tl9@M;=9I3ylSwTsQ_XusmqL)(7V>!HwPfPhqgA)t8 zXl|0Go}AU-#BYTjI%1QjPA%U+h_xW=QAaIJ&2Law6Z;JzNtlYofO*3033VAogqIU% z())!Yt8?KO3X9c&e`1~SnNmLU_-7yo5ne5Ku>=|Kh<(L9WTa6x2f;mOB?SNcMwEfG zkuqz`6k9Cw6yoDU>=VlZ5z%r9DZ)zNCDFa!6b_-8E9LM1_^ z6i$T(l}$;{@Jgwb`rbgY38WS}#3Ce1Fk*9^V^sK#VKIG!lGa;G>=vTWQtuT#i~5yVL9#l5 zc%Z70hOm<{LLe(T3j3`D_EF)?Oeu>`cE*rcRlSl&_D}Xp_ClH6B4^It!<3=~@iirN z{HM_bXUVd&3~C;SGchs`!}tn~GZmb_kU1F6Y;^L@WbQ>~L}cDX&8f)j7w29$$JGrh zX4}v@dSbPhYrQpNuEXkpy|MBPW2SFFxZaEVAnt>3 zBaSy=UA7w$Zt}v-h;PA)Bz>`hO5f8dN%unz*Z*M{fWYHzUKnutI1p>E+<|cW>A)0o z?!-zxcOkypOWloiaPC3+-qYb8oH0Gf3-@9LI0-|rrqy8lhnx-%cHVXfz5RbyyllU`tl$YW;pBjl0h9j-wVJMSt9Ok`+Z{_(={8Cl}X3qKh6td5s&v$&)_&7E4Dr3h4EMs zZvw(ZFHA!G9M)W8tilUOJ&%cn1fYu=Xybo^Stvnym-F$ z2G%iLfd8BLtMC@qo_ov7Wt4x%v*x+HqMy02Qw+4xx+;^G@c;ajthZ_w@OH@&A8{e??zH zDT+QwdrUKsI^Of>Ls2g&h4jKc!0V)MriFe;GjDt6>EMT#Shk+#^M=ix8Z#$Hb-r4xSZf(sIHpWE-9C;j&w4HA$TI0P3?`k156710PebfQ9A$KQ z$%F69fToNt#DKt^SmDSbqX}_FJaPxf_3Tc63jXa|$fMb*3 zo~h{`reF2eV&z*omI(!LeOA(e{H1O}0aH+4X$9*~tY;};GFr^>lOyP}-jQiSM=0Q# z(<#Bd!0%ZPro{btz;&z#?=eV^^Waas6GMXkF~Fl>k@yq}5UG$dAL(EOy$K#_&i3IwHccc_YsZOLhN~{my|F9>uQI?Y+5-(#VxeZ220;OciZ})hT z8`G59?nJobw2V#pjdB~~{+3rDo>}O zw;r_|@gx%+Nc_)~uOR)tI(Yvx{k=Lsb7G)oB_40|`{J4Ms1q+bYV1r=d#9Ghn3}qH zc~NVp=hr3PpDAkV;`c>8oqk|EO5m(5{lJu8*hNTF)4vS&NlD79jK|jATa_0dz50~5 zAHCC9SEV1e^E5)y3+am|-frRvM;}H01tyHC8;UobK#uUFc9_)-ML+EB;i1QA9kC~l z#E+aaCHNu^i8IE;tmulwE3te%0%?G_7yOGR`Jak^@ulUgJuOM%?MJ&3XYys%UMx8> zzfNxg32Hu7{6&;?N9Iat#o|1w%%IEsr&zgURyS+$ky&A}_lT8DW(#V;VkUD2Dn;v> znlDga;Lz4Dc3j$Q#nLO5IkD){K19pC%oJtkAk~~7Ez7jzN-WlV`iv=ik63h-U0N*q z^fStOyor5RzD8#(c3xVR^TrRIaBe_lVyg=N$Oeso3?Uemqli z7RqWZEv1d0-dSSd7Z?bPly{cc-DGw|ENyD8L_7p(T@&lMSpRvRwZ0NFJXd(*JT9>& zGXu=$nVRQSHhSJIcc?2;g31@0;eR^*WqwG!6U9GK%>;3NKy2|cgP?r>RtykC_rGafPzA+s7%W0o#op36CF#?_5@l)BMRR%Xf6Tv--AvJ#fSi11Q(sM(jS zM<~C|V^5UTHpOp}b00FB!+s}ySiFtdw`C5Hy`Q~Q%?9#1b9kL=8OTx17mDAq>bdN@ zGT$T|MR*NknUfOFSBW`uLXO2}&z!weS9xR~=hugllC{oQlHz;?|0p-RdPkOL$UG;X zS9yFVd5g^1C~nB>@|RgK;el+wf(@ae(gI2K^`O98V5(-Ah+)AD@kng`7vIE!tfnBd zWooQae$nLYGD|C~r^!4gbJRSijE^#BQW<=hoSHnCBPp*jrRLDMK7;UIdTc1a3#R2S z{zKx^!7-dZpK3l<=4)ll=ggYSyD?TiP-?D?=aeS+=PD)QTbK2%qSPT@c8Wiqnv0`% z8gs-CE$e9}US7&4P{}wvil?S{p^3+scx#G0M2}8-m(gF59%YRoRq@C#DHw~#qIfA% z%Hnn9&qzs3=J`0EMwv^bGLgyDyq}r@r1aJdQan8{Tb@qyDCvulqMXNb-Xnj0IOPv_ z{%OdIKcLJ63U2s)p!k>61J1-Ju8wz%1a7J4B)$TvZZvva=m?j=1jPjpJ23$5{qi@m2{AS+XworLjZWvWH%=rmRusS#anGaFQz(G%mm2Xp+rTHN`8Gzo zrJX_n(muw76l0bnR3bE>U`OZ)1@KP#Jj=P@Uic?tg>B+j(uyk1qyTzW5MNpBXYsC5 z%4d&9p#!;F#!tmxsh8IVXH|dtddivbU2@f|#(w7LOTRrSiyolj6R5mn#6L#-X5<<1 z^x*w+j~d(6ktIku;^`-GwmkKe_{6f#%n^xzZ&UXx??KYJNDFL-vN6brA@YONh3PZp z3u!eWz#Vrp_9U%(roxsSReuyriseK`QlSOnm;6Ke zx?EwN3Njvxk2>#^d>)1Fqz_8}%~EDo#t}aqpQ-la8kX`y7CTzjdyRS;&%_$1^mftY zsjG`7uC#FR)0LRo;F;Dw>V>?bo>jU&k7D-|jZx{1ViTp!RP1`&ZB`c)uUzrfr4}d}AHQ?pR}}1zinmLzXU}DSBW_f0V){%j!hS;jBUt~>#yzo5 zdl0R>Sxb?uqN04uX(6W7NvtbkRS{3!tYu5=U9@=7{zY4vvIELd|A!rp7CBni{`DuT zLorv@kmH&rT&qRSxvtQ^t}Q3$ToXms9OBwjTs4KUtoN(dP~nj)3vsm}uD`-RgRI3O zIdVxpvTkmGo=5H*k$9a*~~ua?}Og=@*lN}k;7M@r+$dxud1*KOq9Bd5Hz2bo)h zcExbc6`o~H=#*D3ckbg(Wn8uCBp@!3k`>Tp-y!Cdcy;FbkgVS+Z*@CaN0j^eaCar{ z-$SerDy;D-l*sxLC$gd-ce_d83wFVOL_35XzJ9{eEcw-KsbGy4A) zycK$ImtDZPgPW`YS%MUIwBf3O`+za-n8y8Tj$&Ow?g%A&Rh4*{EX7?6ao~wNfN{md z!@%4rJjq?*NN2Lk3aKWJ^W(r5SFqfS9m}`^Cik=3iZx_+;J**~M{(qChB07>JNoPb z4z>ed`|!RJloi6LkpmknvC~EYrjXPyuuN}eO&-b|PFkAe*_BwWF ze-FD?a_4C7pj?jK9#>&++OM=Z*o8WX-KbYN&%qPnE6naMbN2tI_=?;3nw#rr!vHL(Pi|UkbewSQ864Z6nvE&yUT_ z9Txa1-N#+&&kLNi7X%;kUtqtV3c63_wMe=_%NgK1H-5c4Hu8o4+RRQju18Yegx)c( z)vxz`?jDY>{2%PSRZv_@*fzR!+=oF1nZYd(g9r(6cX!#b9rt9%-QC??h!J-}a0pJY zKycS_S<#O_i=i%JLC)xic^w>jmuYIU_i?D$6uk{OK zKsmgt$YoO+F`1Asn~5UoC?1C2!=f#N$W{0Y+e1^1V>;f$Fpy5gt63>Eo}5T*K$aV( zf(fV!Utk|g-oblAioXHa0Q+Yq0sVys4Q)IIfGpUgL%I z6Z!-Clv{*$V);xsNWve3UStuyf$VL6#N0)8VBgu5jGRMT$08?DAN&)eMk?@K>_|Kc zEM>Ei`FLkkjT}KcV{i4? z3`UOG$J=|8qcDHu2Ij;brY5pC(2r;(a-CSp45ON1&u}@h65K*$EDsFF7oZo>$LwIn zjq#Ja?`0Rme>41_6NEbna=jd3y5`$8})|M8$D=j03Oa4 zt>er?*>JL-{R{{tXOixAp6LQQ3X4I~?CJceY`q=9mLp}BT4X1Rb6eS)^c|v!J%JBp zeHmY5lid~kD`stVtsD7jWEG{O2rkWE4CXL{?3eJ7*jzk>xWGhkb9GDb)d31CWs8=B%;1Z8YdRrU_6bw@;9-0oHuqyViq7+IdLAm zpmy5^NY~&a%xSheAOro&hVXoa1MFn`bj&JvL77FUAc2}`&@fHHq2LMsq@+qe#r)0w zh@2uAN%lZDwr?dKb0Ib$vR>4RETTR2=OhxvaN~U@PPC3)X$&O`d7k#a)-L2oQeu9? zXz^c=DcwLn$Gvbz^o^0kuW}sFC3pus9Kq-pY$gXqW}!d%dg>~>j{~b-td0B2K82b{ z+R3-Ax{!zY8jb+H2cj*%=mK6(;RSpXOMo5L zeYSSq4pAV{k+Itc(Dn8uoa+)dGMxHr*CX%1bz-AoQS(~k zV9Q!+jIF=rs5#km+^V**)da4}UBJQL2xZ6p0o;zo^aGpdeD3K{;Z)NYK zxsJP(hm;zpGs;tPOxaWBDMSTf!cANsb|++;O|t}0jG@UiT7Ru&M$6$QQR9F0{SC^N zk2Txt$mTw6W81o0j@vKlC${dlhhfvHgS?)+=g18j$Crz_+$c$kA_VDyts{-%e0hX4 zRJ0466?@1w324Dd#TAYmePN}f?uyOUBK8Y^8=Y%dj!hx;magW1Vdq(vewIA}R5O3+ zllFhmrDzcdGakgIa%BGp=sX)gz?z}Xz1TnaDOiv{XJf4imi3gCy2JRfw`@yH@kYW( zT6y-})c(QI++1#RTMTd)O3x*Wf ze>>&P%}x7#xae?+V`X^F;(E4eW7`~4mHi~TluYJ55-k&tl)Y2Ebspn-%&n7~qsI!* z|9sX2Yzu4)`0KwsaAokf;MxAI>NSdeikqq*-&Ap^i1Rxo zcWeG32=%-%=X#b`?v{LYv1eIn)r#sVHTcj@r5(5mc)mbNvfWI7w4FQ}3v$kxl3 zD{nh4bsp{LuG}tljmD>;AfBrBiY%(;d^7WpDj`A*&|!!mopwFWM&-6xRw>4S&%ci zq^0t0O+X{jZqQG)6tgMhGoeA!SN2F6Ej=J}l8;pUmXDW?ka$Thic6)As#ur1?w2)6 zuYSI}f&w~j=*sI{r43R3=NO}z?siJKLNpu<(Er=sU4N)0u8yeOTm{coOJy4s zQym^TrKtzF$=xklSO4IU)XtHi12iKQ2UOoZvNf~R(f=RT=Y#*7J`ahsifxWIr(do| zw6*>dL+Zl*iP#(ZN!3x_>U}o&s@G8UJMm)+zkR0pfU#%ul)9ULpJfYE@B~?sB$LUC zNE@EkIb(JD^c;KH=6Ye%jP~>9r?zVL3$I$<(fP7k=7KwVI5;S;Dc>nEX(TV0IEC#( z-{9Q@sB8z^=8tea?DaS}vTOI=<9fRU$Q>@Y283h>sx`-*)Z9z@ckRxGe$5p%VU?@% zcc*ZE{`{W%^L*Nz^ybv5>0TL?>9-2{*MDkXXY5S9K;9rc^14*yQs&-QBXpasa+0-3 zI!h0WAMg^fp-h~0j=9151kv;VO6MwiIG1Uq!Bt(44R|!@Psg6>G9Rz5OG9`1_VrYY zB^I^G)i|bpVP$Ul)jT9=Zj9UKq|cM%T#|dHH2g|Q|C=r;YOUX+>uLFcByyH>FACwz zT)6J6mZ!b%93W2@JBfz#?-2%8YyEBr(wFL98LQYB!EyP1$I~8f{KGn3j_f+Bdf48O z3eCpg_2I%0t^YZmaBMZvYq%pleetHx1e&COmfpSs?4v@9HXn zzK87z>L4=6tg`bCe_fp2cW5Jhw4T$PTEw6E<2mP$4Etg8HyzpH-h8v=U|WWHDVZ)` z>ik*Tz2kuh$>6o)FN}ZDeW_nw$BVshch>oqxNO9_w61TyTst^FGjnz3hQ#Y1*G21J zym_-3Kti2m}cI0a}GbJxVA*9L``*VYQs(46Yxsn=rYFZd&s)p%+QR<=GjZenZi>#)$}~m zV@!uUuPX6U!|l4~RWZ5m6FVmEj{ETO?aQ1eeV(|z=EWo=6=W_d_*62dF4@!$9&qQX z7HKK%G)=A6sOh8m>b1jbn9CqZ1*u_M%ysQMo2JwzSG}zGS(#Mbx1rF`gzr}DcJCjA z^>{WodEAKEL+5eFh4+{n-qh z&!&F)+W7Iuhi}m@qY59Lcyjv9>6q~;`|=|HcC1;Z^FjJ^oh5#5|M^YxbMrauy;b{N zv(odt`y<6>?i3)fz1Qz;`nQVt`)^rd*~s#b)xt&}{eFazuXVo`u(?O&@LrSV&l$1! z_`C_jI!3JSwW#OX4vkuqbdPCj<-dPEX8jj?`it<(^!JNiI!BFp^5n&bPdgIIGCCG+ z{`+q&YKQ>+xj_0%ZPKjMp3~HLjPe+)>7?~@d#CW{snM@gtLZ|Uu8~_`UvsS{p>|0_ zLu(HzNRaIKO%vSVRz%%Udi;o)JEx8tbiSJ=VtucJ9XEQXJ8WZ%o5$3S{nID?Q_|3c z8DHC8hrRHB9{+mqH*JDEZF5do;ev8io16~E<_jfG(_NRUAGiUJcuk?#ZSOvA8)ZAW zU9tPj2g@?upQbr=HPs$91-0%?`;DRa1X+Q4rqAilu6@^yG)(iGwPV=Vu0(iZuP0&K z1Iye$6Z2cLY9EzVr$0>?k+}3nz`LW*A3yFBweJ1VpMj~FIe5{bGS_CaEdaYG6sfOy zI%&UY2+zS9U+o3&{@Q7(5yHOsQ|gm3wC!la*cwaa{fcc>uWOXean{BBPLAh1UxgO* zUNyXN(vp9OIq1;WVZXYE^bYUp?AO;Rn5n6w%6AoBPDWz$etiDC`4#ucp$99ThJTR6 z_e{TQN^7oQ%xw|hyLve&^b3w=g7?4edyN0uml zD-u?HF8SEy{pOcmPj^1jK1=w}{4?`cpThm+|JJ`XFUPZa{S>dYv;8Oe0`IS0&ooQ5 zO3w}Idy>_JA7eFdZ~t09rXu!la@obQZ59944sVv4A99vD7HA_vzV@+?o-wsyo@sI5 z40Zpqo}GJ_hS&O!bDO}?HPw{PF4&kn{L9^sZSVKIa*fJ*bno%GXvKH0l+L+HB?(pA z+xjq*xVt1LUF=>%e04rEy>qmlP~JR`D3wrf7wKg`VEEd+ur{Ica(Qj}u*&h({`H@9 z4#)th!tIa$@9?XGS5Iu3d2xQ=KM%(#`#*`i*Yje?WsS2ug>tUH^rtp+=TGyOFCTln zNqBzz>HR0!FVIiBVxOfp^=c4r0;81Fvg=-l90mq%ZUbn52S zWo@9ry-IS?KCyN~QUA=#@v3htKb?9fithIOT-5%Tc^}$i<>@mDMZ zx)|I%G#Ofv=N3(?`&#$SYO%62k6;t6Q%w2oXPf@13#jQ^d#zzx3!z_U-^A(Qa8sKa zJfWMvkdnXzT$>ps;z9&~N?f9;kdiM4NUh%YV4d6abX$BQpl-mi&1^UM(S zBs%O<)AtTZ^D@8ZUn<|$s)oiOK>XtUfw@x%2V$J*+j^jNKcCbaTL;H>=rh{3_CIt+x?OoVoZs*_reca`u zRTg_~*`I0I3le!T($D(03tse!8u4uXtAG!KV;7`;$=+E!tVW^xm)cHRB+s2W8q~A9 z=UmU-o)y~Hnz`!na+=#2y>Cx5W7sSUJpaN^`1VW@1#ew&dpst?fOu^h}y8yjxoL`T+Z|67=kK7 z^UtPTk3IWk`bX-`$Cq87^?qiER(?5|keG!OXOvO3TMaYNNYQ48uj;q%sT!r{8*PS1 zynD0TCg+dR`9wT*&w?98ZQRE3wIMYjb;ia|tuu{|tXTM;^9dhK$Gs8uA(zH|oc48A z*pxv-B6}b2KEG44x7B$8Z?;iYGpV>bBO~7Mo%z)C_TkH@s9w*fz4iVwF4jNwNA{H> zx;oO}z@!pd>2v49ZcjYwHPu?K*I2LZ8r-FaT*`06BH6!|Z@M?ltLuN){8QVb@nWmV zAf=l*!xZgq;r`BHO9n6_(S0+NV#q-uuI51iaK1DmQ`XHlq4L0iIr;IQ&QT z$49T*o_Rj^d+q*y|L4Rwm(>25ON*b>1-C!4a>;WNcU7Z{zuN)#UY?A%#7p45O{I}= z`Q`Xs`ii+;zqWNxqoA?0$b)ZBx*2Zk$M}eCcd++oGMOJ>?ec^=ZpLgBa-Q4?A|C0W6|DD=K6<>50J!pz+R94I?FlC5R-4eWG z$S+ABeLt=Ia{l||xDlxzGspez^tW3*-oCe!KmYzQ5^%Z9m8-?h6JgGu-hz# zTc_Irw>@0t-_YM?MN5wgzx<0Cmc-{Vd7q}e)4y(itN8Th>-!&55+xbK3Ysg?wjI`W zNCVeT%6B~M8vcL04MeEcIDb+Pb$R8mN%lw_Cg{SMiA`ahC^y@7>wVi7>JPIMbVOf} z3F0lP;jVn2X`vs(i0*59%BGyKQgAFi>9u_xmbQ@UijW`4e;!Qq6;-sm1PzR&w?VABx??9Pt3rZ@veAuJDo|n)t{XS(5M~Gf*L_L*ns=WCC}P z;F(A-d?-KVQt5KhGtK*_Po?)S|K<)Qq5O~-UyIvSmq_QkPB)bgM788kW~^m-`@hW# zn=aRLsx76-g~H!k^XBJ&Dy%Qk6r~qP3oDB!ml>(N(>#A@ zuBvlf%H76m!@YKT>{Wdb?H6nnmWccXk%R#pw*zB}ZehEiy;ECWb3*;R>N^zy6?dy* zsy(aQDr+lbl_#nb8~j=xw%S|k+KNp6mY=35dn-C0?ulix1c_5-+fOkr>mj_0%m;|g zM0XV|m&{P?=C7l+Gvg6g@n^?M)q43+iA3rzKj7Tg^HYG@+rhKN^|xC;k9IemTbj!m zM^^Ndy93(}E`cW7V8h_1r?mmqhbsq^SC)P&sV`0~)aQE_HI=lK4XlW(4ygTEKe*k; zxZPs2|3|H2J`;m@QlU_IowEZSh{bU?@;rzHa1ngQY%fm=zKgxYTo>+T>j7ggSMTpBMPzTPUSzSF5P`ZR3zSd8M*s za>1%RdtQfvX+_yZ4-2mpBo+phOs(iyf2`$O`!K!MIK>=5FUFntpZE_si_j=UNGi$O z;^Crj!jZl}1z;7T4DoNc(_+H1c^SeKL8ibc94$79J1I{%-ElhZp5)o=9_?~pE%X@g z`QEd^)mza+7%Q*|qeULPkJxnfxb>bPRM)w^q3ulT)21GE|5a_T*igB?Ca5;5W^c8s z+Eo3!KDhOI`*U4(dw}7V^_7`6rO~so`$!jR4(*3rZ;PZ^X^O-~PNuKZFO4>=N%qUJ z!bQlvY%60{;xnD!x%;`Kigo<;-19;gMU=-9&q$})vOi>=n3jb)j8k5bo#!JgiWIXy z2^SuN8K{4Z9gLSuQtMUI1>-T}5M5zoYF$Lj9i6NGVcXNTwwiN|YfX>MBdnP5cg^d% zYSS`yF3%C`WNfM5+g=FX@{aJ&;96T}dM-HzACF%lx$;6s2i|Bb3qOPPaNO(ME{o-) z+WRB7Mf=siR4ascutyYz-xtZHx0NQYjts$rm}t<%v5L5&Ts+D)+*D%A#9ooxI2PuX z*}Z*a+dXRsv^Un5c*eehZni!!BD##mcg@!kM+tb*A1Wo!7 zcIK771GWl&^LhLvzk+`l%Vfuq38sZ$o#P>8G5@>qwN+0X;YY~~a%b*1@XquGT_AAf zuaJ9TA3z+pfwRlT0k64RIPW=1>@!+xeNJCtOUae^3bY%OYQC;ZraSXg_-$&izD5^q zduv}S*7ClZ;Oau#O@2Op06a$m?W2r7`i|@pj5J`}PU2!yLq%u&9>0*co2WOI+A;~6 z3Fi*r;`T&-mMvUVi4{<*u$Sy2)gWG|%-blX+_61ER$)YP(Ns$i>Hsiuqp*lsL*4>8 z=F!Y9#+Un(r{#N5wMIweKCZDM#9PiABmmc%o>19VXJ$S%MRXe<%`~>FT5^p>&L8n; ze69VY?t=M;EuFi9rHIq0nOb4jq3;m0#hBX&+k41K}+bm7gG|nl}N|6oUWN|T`ppOxExP$m=rrG@3EHchz z2jVmE$IK*CYwKgA@?2DNau!`0RPg7?@{OJC}wU@j+CdX~3? zNhXK!y096xliVj{UtT2k4<2h*P!E}>csKGIIvnV&3-w->U7V++ial&fYg=zkwD#g& z5I?4vx`diHL{Dx8IE{>CCYY}2^DK#^$n=EGkgP)zDhHVV6Fucj}LWDALIw zHnQDp_Oxbjd!tz(KPaFpAIgbNZ7AFxRb}tgJvKerqdcr(zK{3!Tax zjRli{`eD7u*omk18H)3qW!C@9=Z!(+W?_+dEE#7Z+b7fia9erVBG@UU51|}v;lvri z9>NzLX^U$;X~5ky2YU_w*QZkMmv-OPs;)(c{n<+dk`UK`&)J5^WrY zbjEgoC)`@p5nV&Q2cblUeKu7h5O8jprkGbT`L=V!5Ke#kfMKvjZy(Nhl4|s>HN@tE zj4|D%k8?@lEn)_#_UMK+)KrO;>?_W*Ra)LzOH3bt)nS&rA9I8W)y*^gAex=FDEA=0 zEK5xYQ1NC<#KKM3AhZ-M0N?R+#FN*~&qd8>t&L{$schmRX$5a>^X+%oaZDN#!v3Y~ zV77UX=>y$JeFpVJ4(LF|Kmr4m*hSV8U&CDj z9+F-d$9A78Vm_fR+(q2;REW8ZorW#9tU>w2BcvV6HT|$}v@E7NP;Z11;yHb-J)pJR zRKX3Bv|@-YQWs&(q&D;28AswV(n`IxUw~akqfNeiq4b?Oo7ltOVmDdj^e5Ryva9V3 z>|0r4IfgN058N9su<5KqtPptvMyW;7cZCHx6Y%J?E+RqJV&1pvHFF!TEfmr;8YQ#E%{Ut>BT<5 zKJvs^e|j)`nXNGwaDzmR)IF|QS7%xxKEs?qil`Xo40WDuLxhKR=FhfGqPMzw zPB!N>dW@NkE~KYgi?J2f24Vv`f%%9jZGH8ZvGKg!jDvj#auc7;)RXJ*ndnifnVpJ6 zGZCWiqE+-g{F$lF;N=`cmg8%PqXsX_4oR9&VW{LfAS>G^lRkoJwklhmXa}8T*HQ0K ze^kOv10172*^AO3yGT^LkA7+WX}E3yd=g(klrYCFn;McS8|Noq%6_+Q0#n;ix`e-$ z4JORQMtd1kXK%2bmjnr&h&DfMYR&**cU~<2k1^9;V%lZhMjm$I^DZ#oZG+mc z+tP$4mwHiu+S@$X@)Zjg43^Sxe`+>*19qKnCc}_FA|J8|JH-^(1Hcw$4KE+-$SgFQ z=+DR~^bYdVdXEl8&KO&5kKq$cjeR{&W&cuFYrhUcx$EqIOe3w`*>xzx|3>Z9VQdH6 zK;adv6%S|sF~ookc$1`(U&(9$EwmeN6hD>A3Rygt`b-VOpL3_na>OS%56MD%G59Db z37=U834Qo8iRp{VO2G{7Q__vsTQZ#QEVw8A$nQyX6K>?0h?RogLO$6K)S=D9Gu#Tq>=-)ICbbQ) z_O);=5$08T(E36btDj{k)6dcW*H&A9yX}mQt6yx0HJ&xKTkO{F#)GyXY6{X$9z-7@ zix>hu$B8Ay+!7uiYvxZA7`e6NRF1QvN>(9wEh-gRh(e*iQ<PgOJ4rArL#2S79;fjVpV%C}FME$My z7tJL#3(NbI+bjL5_E#JzVGEZQqkjiilvK^CT~u3MCu=^Y`^Peh?!nAst>7+Z;HC?9 z2q}IzPsKgM^XBDo-}1lmRf0h7DPC{h2jOzj8EKNZM7~xzOX1-3+|}gq%)8z&}$-Sb3MGO8!75vTP|8~faDVSe! zzJgOdt!`6O@AhKjF#%S$6AAw1za5 zS4aF!ER^Tn%YL7;Dz{h8gRIOS;| z`9pbcStrS6(I{aIZz1;v=QFvIP;n|b5u9LNu|O$)BE9Xf#`(T0-}94yQOJwV^&Phd z0-vWo9G}mc1%~Av&%E4X3Wl7nN$CJLUBCY zvxsh()H*@`&hnHAB>v?u6HXBA6XlCS5bxloI^a6 z-&;IWaas97^~q(rrpRlg&)NV{fV-Egwn?k;2yt;$-I31Wjm2)z8_fgtEp7bf(wgM5 zKE*`^%|$o=0*aw`6HD`-Noae=Mg_QuaDZEns(P1 z_s4Gjs-^PIk_c(WKu6dCy@(+}h&s@xz4Keg@d)e$;H@$pg z@u}Zbc4*GB+|(RZwlM2`W={6y-zWdLR65p9YwXh&XY68!C|I1Cf;^G8G*lKZOO_|f zOp+o|x$rdq12>=J%XvZ!CJAl?XEf~QT_QRm`J>q2G)v9Ztb>mh8J*U27I!%2r}2H| z`^Iacn^K7jf(SFS)Wm6ZYS31%E{!UP&;FVbnvt76Hf?%JYHG%>HfgGHObj zHnoSDRkRb12_(`}3SZ@Eg-Y>B(V$3?pOG#VW^y-^Utrg1GG;-Sp(C-=_y*24!4@gz z@W$z{nycO9FAaGS*00C&PQbr3U{By;?`V%5u&s|rUZnkXISsmo!?pFropYMg-=wr8 zhooIdyPUE-^-S93U*%czi+@!8tyi?3GW@ZogWbGhNsOYGQ+JomjuRbDIbJLRXrVolwYJq{#P6@+w6y}0;|UI&OF9C$aag8U=R7XB^ISs zJ;bXaP~D}X7q1T$wj;Dhr~9GF0rkF%HRlyd?qxbyH@zvd!BTNOAIWG;JQVBv^F@4n z{LOg31TyhT3YnuVIZz{O6&u%Dhk_owIkHQR9bHu(T|M@?Y1FmO`A%n5`LbbxC-^ls zl8(TvuB%j^;6F5}L0V0b`^&*Vjj*C-MkV_of@ zLj!MgDi8nBognxkmpz5o(a z|E7x#Y4yso(RrgY4XKZl7p7LG`K9Kh%uB<6HD~rm$Rg2J(pD2#+f+I_+{z*U0@pcc=@` z?bA16TFAwKp@CU`7kuJ0gB0D!3f5}e+%UT~uzJy-P1#3Md&N)rS(YG7)+aKepm1g7s;0U6dh;c^51A!SaENtT-Ir+JZwYxMmZXeVV^=p>`$Ih~39)*2otL$0U*%oh8 zl)>Au)=+Hj3vO`)qQ&w=CzJan-_xN-dVcJ+AS@=dtkcKPc|pShYPA8Dl?rAz~J_paN^yRz|x++SXrfFXJEDTu? z?$%Wt924XhA_$7|8{@Ue<&E4^cnPE$vvj&<|LPxqj^uj&s!lnYyd*&${~|FlX;|{0 zG|%ktB3V^hV{Pju(?{kZu~1MZ+w7F?I>BA-c38bq-OII~%O;2AGO?(cvk~=S|Iqs> zp8c$qGXJsG!821Gxh~?liX6wK?oYitblB4Ac<8I3g@F!%hy54(!k#0w(jiJv0un8Q z4OuPA>$;RZ%fFK8oHijjGU-6_;1s9ilBCY5Et$50Z{@e@&{ovA*XE1t;og;2sBXCU zxxP@}cVV1AI!m24I2@93gk8xy2*p^bBX)n=Q_EpXkZmzzfxAO@B}K|L&SK3^-?Jej z!nNIAg|-AGc5n-h^NsXc(Uz5Pt z!_dv3F!iQ)5|acwq>oh@t}R}X!J*wY_m1rTu484#S)IlOj|_D18RPOrdYik(wxcbv zWo7;3za4%j{mPI35jQ)2-p{a~BNF~e+>_{?R+sa-WI^4%L8A) z9;Tfkp8|=H8No07d-yzZ%T&G*8}PlBh5CMN!F8+u&dvAA=#<(s~!4imsg&D zsqY8RcI`CJ29N9RKCU}dU*wcXLB!FA?SAI2?duz_RUav>DdgwJ=NPi;vc0lLWHqQ`b^=6-=@9+U6 z%UQ*16&gjP=#-EZ4B@x%-f;);&U3qS-8rL(1Y$p|-8%3o!5k4Gj)nF7U->>I>S%E~ z;#j5hRRqWb6|WU~`Df{N@gc!C&QW|5HVZYu-CPgzM*Wu7jQT%yBWlf6$rTk9 zNVU55Nd57KBaJtk0$N|Tk2W?~dQ-J@C-w!~8v$5f&QI<_-ePVW=MQ<5JAr$K`=0-q z+lidW*@Yh_Sk6^)31>g&2qdCnc~OFM;^k5w`3CtZ<#&hWj-4DMRIeP89l{(axlx9~ z?t*T7DLEH8#PF#)v%g_UTVT_SIzi38$_eE^%086I{*L);E4x#%y4tH=-c;C9rrTtC zY+XZ7K~02$yPbbrkR_Nc3K8dtoJ1}nLNJZDkyAtNBf1dzcr-Q-Ur6vcQr=F%Q_&#F zc=;V=AIA{azU~5--cBLTdz^|LpEzDrHcNkt3-~wjF!Vn#j~Z;&>+DTE>$0jJRjm8l zsdQe+_99cktHP9G!QYb=W2@KIRyNFS4bqP^kD+4`KRk*!!uiZi5Wp%%bXmAq_>S+u z7xL^}!0pV9;e3MUEJ+TRyNdUpz$E-DS}rb^^p)2rJX9x~Ry$pANK|x`XUQ)p)+sj2 zMoBITop@7;cUTcx56;u?Etd@$ZH3KQO$!==>Kkj*s^?bjte9W*p=LvUXydY`_szVv zXkD&xo7GNfSsU9I+yM7c39*^{PL>my_${mqQxPKk633qtj<*tx@HF0A-UIGa-V1(5 zK^nhBkR;3#`${XMbETouVbWgWT+u?&J@HBrE4m@@=Kti*UXw3ZRfUMY@e-5)HUd~>T~qLhEK+x<~DP=rKeS7TWZ^AzepueIO9Q2 zXErcX+0U?NAPOXa7!*goU|*03;vk+!{vZyMBe{P#{kSOK$cy235nL982($thVV+>6 zFqXfGm(JC5ow$cMnIuVO5Swrwo{5zq^~ese4`i}BCWq$G^C=Cr*Z$t7wDq<+SnpYq zET=54mPh6&^8@o^GiJ#&_qQyx{AZEDHT9vksrD82&(w3;PL(nJ*>CI#BpyVe#b^oU zfYsqTtUE!FBZ!ftGu*>{NbVtDka{wOJWeV(k4P(g&ms_3@bnr(DA4dqOKnVdqFqwfbGksGArTfzG<|I*3jkDZ)!2+Ons!&DhIr3=0|K}J5m*OLVJ`t2fB=~Qt|7(X4a5NNf{ugZo(0F| zhX=q>tB7mFd%{4>Am5SWNIA!mvxTGJ3?y|#4so0CCSss0tFhVG2Q&wL0hxc^gBd^r zj4YfJIQ;D87kxgb>ZDXts_5gdk&7bn6 z(x_H?AKjmM!#cBrkQ+dcY(N)d?I?*4z@2fpH9|BHe6o?4OkN|`krbH&-%H7Q@&j2- zt|db_+ejJbGjWA@L8K5yd;qZ>SK|k<&KM0feHg{jSa>#lHCO=>*=0~>7a4@vLVMA! zG()9RQ53M>r@|-?Y8SPKa;6tj#Z)ZSk)A{w=2DfS>SOd@=Ze zv>_wVt7r^58#ADDutLlQABTtFbyyK*!QNuk*fq?G`CuVf9V*4PLY?14bJ4x%S9A+H z2YrnWMr)CQXe7!(y`kKnBNXx$NrwyuJ0Lqo6+A#q17<1Mn041A?IqjzE%-8l*dvkPA8zoeVW+ zgED#orB#fS!SQ~8`~`2Iy#^r90ReFaqG2?x2iHI%m<~~Qd?5S7Vk8zan{-FtBOd5E zR0Q`szCg5qBmeuK>ktP1=RWWei~zfVo!tuJSREWwHtP`L$iu6>UJDIf=s$Oo_x zqNgl_X!CxM)8QUuz~~A&3O<8CWG}>3I0aD>rhp+3C15@{4ZkS~=-GbA8o-B`I3pov zLnYMa4=7zLG7}9#_oG?JbkqU*^f$y4U59v~@gNQ&v-E>ncn9$p9Ff&fZ(pEQy@tps z>0lWW1Li^eo4JtxK?djB1xbb69}nRi=0KJP8e~9BhInuXoPcN!Mz%MUpEGDS|1qQ#M$fgt2Xp~j zfsS3%q_SyuLp`K|VVQT!Zp|2s^b#05hwE zucx3F_zfi*2pJzHBEOJoq(3?gb%moCiXKE;&_3urbRb%a{DqqSKi3vE|37RY0X&6$ zR2C@HF~ARW1RQXIZDOCYYG@0m!7uhBl#7@XjWdsuFhYO))-h`M=b0E@U8%TpJLGPfvA3`g9ihM$Z=v;Izf}__VZ^$;- zO?C!;*8qs*@g8i3J~0nQ0C%Xv$E*cr#;5EAIHq1;GDu=MQ1jElZD_YN8wth(74)@; z|Fw)@h&a*_+eq)Iw~FT1JA*Va13GizCa~$1p<^aLnT&=E@pCqRYVubPnXi2uBYiuIM22 zGZG8q$Yc21O(Y-AKL@-)mjd{d1s213=fH^A0`q$ckiw|)9Qnd}B9|a;%oX5|{DJr` zT8J1m1PKS95H*aOGUN#K&7%;nC7V3}y-^0Vpf5PZIw2d_u}D7K58Q`wLk8ADn^+Cw zMmLzVYQb()j&w#7A-59`>3|j@-e@OeF#yOSV22oA1zs*hm1r0pxy34J0iQ$tFStJ11;Hv^ni#dDUcuNf4D8Z;C0V|CzR$l=!Zd|C$yi% zaAp*=6FHK|c18=?bx?!8P-A@n%i5u~W`keMZJ1HlgLc-+o&p=#u85lb2T5Y*Acbrw zx(yUT-|31JLwj8gJIqEPIy4%&4CAOP+8>EQ4}tfn0nT_fl-4HX07M7c3-N(y_AT-g z!gqaTuY=F9`ZxmKz&tzef2Fbm@rAQ$gns=1nFtEOU3kSV_7TiALf{IcwmZ8W*$w4& z19WCBdi-f z1GxYzwUgLl_6+pmL*O#f1NvtatOt4?)=GWZZw#y{fSm0QF?Z5H zI#R^U2L9+9GLbT1WqP98|BJn|@NO!L{{6MMYg0{K za4GH%gS!?AgS$grZT!mH^IN}v;;r}AtW{V{o8EiQ zKKtx*_Gf=LXow7DCW5#7%B;nkFsIRX)Nw2v{9^=?gRDpIBP&n^la7Ya7NikGHU+?{ zd;+y58MYNX@=4?`x*Po!4FONE3CW=!qTT5=CK)>wLb2BLQN%(mMJnNpFbBN~>-#P$hA1!=?aE9-8!}y) zwy2rvi4LJP;M*U;St1p!q28jcA-aJwm3pJjJKwmJi^fu%-a|+`AsmxiXH=Mt3ll{?uk#O`8^PM_`zNeOB9hl+F zL)yX2B6y4)9YGDj^XZc?`*YC-SS;EF8_L|no>FEsfmzOs#9I17ftfjl&qj*rxyS)p zLk-0Krmw-yMF!GvdBB0j!n#_4zoRD7XAm}}M)>Grh)2KCZ)q0lreD%REQQWNq*Qmb z1F{jczosCej0YP@zr!9=oss?YUU~>_L%2*=>=+%4odv$<8?y|3ONU{@s0nx#vjD3_ z_ag-1rk~>-=*U2KrkHGu9-=_;2zG*>B!-HqXwZ`?VW?{@)^b|dv)}jNLr^tPjhooV7 zOg2&oJvC23PI?yh2t1t--2&?bYZlCLiyHUL|K>JISx8ij1RMQC|X+seW(@ zWxWsBO3b2=f5!gd2 z5BWx^P%E4zP7^Jt4s;JvgAODFj1d&m%IRjz=0GGe6#WZMGcy7tag|I(8^OtHDtQ#k z^OvF*0(Q(xl~YTxQLyu@K-a^{O`$?CgwkWLsj+lJbPVz*P2(S+!`n6N6kUsd2%N?L zq|A7HAcNRMX0ZFy2UuKsFgB3U6Km)b*kOvIB2WTO6OUj|k>V|wJ~RWgDvGzDcd@pR z>F5LSV9jA}AHq4|KJ1mR==Rh~h_`mpwXnVyK#c#BZjZiVp23M~5iP-5P-B@bXgswY zy-&6TE0_$=--$Yhw59jqcc@DUi*5tHYXq`@z5*vu9+S*Gg1dn=uwD%it3)F@svXi4 zJmM0FE_$F#>2at9Y_)=JfgHfEFfY;blmQ#gbcK#&8dQc=ASA>;Q!qbu91VvZxgj>o zC&CJt(_qsjVABV|rU(76O;i8hrvI<8>EQph>2YAwW05H|3K{-2$QkSb?Z)2+GVvi) zE8>@b6f1#z$mvISVBe=+16jL^HJ29R$#C!SFZ!AOum5Q(a~+?+JfU`AQ;{g50lkIY znlz&?sRDE=9gQ+nKJ>$LpeEYj`-~1`hJvEm5n2Q*y9nrG2XhqeH@Z{fv8_}H)dOEg zHO4f7$?SW+n{ap6oQx!*14p<+sm<7aY80-Z*Aqtazq^6g$U$-|RtF5T03q?+a4V6A z%%s|4r;#JrJj??XS7y?K-GP{ihMS7TV8acVKFB)k7G=gF=$)|79)W1}27MH51h@4= zQ6be5n@Shbo6w!)Y5X#s&pd{h&kg+$o5TGfoE`8PNF?fHv{*882MdMUh$fgA`Amx; zs`(6lgI=T*okJz!IITyIfgWNsI+IR7kD+`TBj!=TbThO&+*B6Q z?U|wIBeFYl0B$??cnNBI0t)QdmL>%-|!b<)^W`oY#bE=BiLQTaI=pon; z>H-kPe%2o3G2DKoK2y4b%7R#khO^8%T1Lyz%_N6TChr9vfxQ*MiE~|G8Y8DV(F5V^+8#Ba$H}K~w{nA+ zLG@$VsLR9|G7B%HeiCcZzu0zU7IOn@g+yZYLLHxQFk; zqu`uD)041P5j7XyaP5EJv)vt=FuDmYcOAE5~-kKHA}~ z+vW;!t@5S$22hTGp4oxjW1izP@VTrCybmjteS~f2K4S|7TY1aH?WOUOyYj!}PgNo6 zLUq0Tt*n)Fm$*RiK=6V;hdYIH6Rhwt)i&_VyVD)yLh3xWs#=?Qd5ypNM@^;qUd=Yk zDKl<4Y`tVZ=A2d6(|f>E;Ga)jp|&xf2rX+0yB;!NS?sagZtQdH%j_wF^PG#^C4yVR z$)ZEDyYg@H4?&AG>(o1xR}}pu22qK~ELg=0=I64qf#3Wi(8XI1W5{xhtes|gWXi3& zT-C$a*vL2L8P^(jRoB-@tuJgtotIr#-48wU$pAea|IIqX8NzMOE8qzQ*LX*SK0$<_ zH~$KMHE)G5Ui?5@1=U;kl`Q2y8Z`Krx`}eGqDt~k%oaxT6S!f#U$~ZT>woBtatWP# zZCdNCnvJGAkoy`@URvR)Xj1vR(p0t7)YQDzI@EFA-Ob1Kx1jnlmoS9YpSzFe6K)V5 z6aL~k1=RwLFhTfLNbwD#*MjAuUJ|}ysO&#B?p_XGc>#FOj_8H%pW>`N>G?CPZeji-xGOr3^&SucDl>nbaWL$T^vi@2}Y$Js&bDE=N^D5tRi6%H2dmn>3TmK_Dn zxT8Urm7A1Dr4n(Wh!%e3h48;|nqjNx-+^tue(n{nE>4v#%&M+osyalk1^zj1322yZVpa!8?_2kE=V|*3>m@U*T3EHg z@C)imr4_m5T`Sa;-KsvCx|?^_Hml$3ZRaxt*3o0pX{=Y=z5=r-Q+z^PE7&b86wMHQ z6ob~S=&)#n7!{i(Lsik5_nIxiXTmN8zg2#b$z;PM36k}~W!%B65BT3C?n!j@aJ6+x zYp>LdsM=J~v`kovmpsugC~I7HSMN70scdF4T70%<^&#F;{~EG0bDfyS+X|HI4DmDZ zXYmJ-0sfXLiI-FhWx~6nonn!+Ts}&DU$Z?pCe#ypK6rp?mg1aro#cS{yFkvJ&q_uI z`CGex*Y$JswKcI2)y9fpWmxH;;`=2l_0^>@Wj73el)K6sm{wS1j+3rQUMG0OyVwZU zpS*^m?oyX@n$#*`Oa796gZiUA;v3>jQKERWSRh-Xx~!=V`4##_yD8#aaJnKwQ7JP@ zzl$#MxttcnLdxpOsQcvHZ`)mCH14V>F;ta|DH>6Tl!WOEN=}!o(>EwTQ8~6oW}9C( z+%w6S8hFk02BpT?f;Hklq>0iL>0!__441W&1xY%IUJDlr&B9brOnaz48+2@%dazgKlGE&P-xCZFJQ+2iJ-0`87{WhbkWE-xuF6oT3vI8%pVt10~(` zNo83T7pq&tkhL(ZxeD(dAgq^RT8~nzG~ZRb&g#t$MMOWAA2d zP}8+%+u4KNA5z$5-tuUm?)9UR!I9w z2}zi=t#pgTB;FxzC(aOU65<(ke^zAiJCh7^x1{8&_7I=nQkVT@=m%~Rx7zD$`l?Jt`)8mC(8z?K5H6>ZVwejBu4!iUZn1$+^Ad% zs*AzGf4R>IEqcOp*SXla+R@p3&Qw=1MPE>qr)yczTbEKYy(Fl(L&OG2J*&Gp{-;Lc56r(M5vCa(+xA}xIv%;!Zmt^ZIe`|jS7m12{6g4Zl zR0xN+i=|pJaSlK)OQqUS^WF zm2DC|7EBTRAvho$Bk3T|P>xVv(fkqWk7yD*FeW$bsAiA4P&o{CqU})4^bgBNPOE?I zT<5garq<{xpXxUi{>V4vUdfxQ%h7%M&CjOl_Y-rE9W6k` zqom7ZV`R5wT7^jYP`OSKCaDng6dV==1Yu%E+FkBf>{6Z&@`c=w{1~@AWuX7BtWAkvluToo+_S$qH7@ zE$eB!!kOY$Q4?5ucsgOJ_%F#l30syY&sK)0`N|H`N5T%mQ^L2x;lRpYl75sX$-gKv zG=0KEQCDI@qt1oK2Y1ypQO{Eu6alGOh;X7A5;F56-P;_8tTxl~@`I%zMd7+11(CYk z{Ia~&`EdnLbZtvA3Sc`dFH zH5P@6+KWC&eoK!i6N8dNuZK<6Hj2KeJsIa2I4pUYFBdoKIc5k z57V^@N;ShK2yF! z-c>G<{gMS_SENJ46GiWY=Y^>FiL{S`RM%=+hD`|n5j8HRD4Y&zrLIb94jm=Zfx*Z##&lBX1LmTL;Stz z2Sf}%N`y*Z%MQrOq>W^oWRY^6+$gy#TqBqym@QZ*>LBf@=%o?`tq2|ymLAEAi;HR= zdL*cq`mLg+yh=J#^oZ9SzvK(5b2(2rrddsv7Y^4I<)6&=>1Gzs zDO+IbRr|m(-&O8@>>q{A<2Dl(h|8oKWCLXp^396=%G=6r@>`-Uf_{S6|HbE$aWY!Y zS58-5&|D9@6Wu*NJrWctg9=qH#UaHx`Buqe!E-UJlk@|a8z0Kvd97n^tzFrKO$EoIz5`UL;0l(E$UZ!BFJE|iU zFU4O3lt3qV1h#iyI#?DiU#jS#z8Gqa*c;n9u2JM@O}ijY&`5OyRd>aC$tIxBSNq~U z9lQfvd|UhKr{&{H-WFWX@0mZNV0?iy_i`B6%deBtNNIAC#${p~!~4u!DGmxLkZroGgi#)=0GSuS!{Hd3a{zh?p@^heLL0 zh~P}k4`Aw~vV9^0rxp4ku$&y?_tu}P#i}Qj4=hb6{-AqRFsPtK{?hEDzh-1F%3Go< zD7Ha8NPFYTnhv&W?p^dNydS#@*UNh>d?T5mXrQ{L&QbP~y^}nU1SC1qwbDo_Eq)}) zkRDN_sVjra!d6E_M`1Bb!w-Od$G@Qp`2Asu?$S%brQCVwPUZythu>8t6wLT-$_dG`{MwTJHdmLQt{Yq2(D1xG+BCq*cRBpan7P;vRx6%cFjF!@o~mrF z%2TQp@$!p`48>2mR(?TtRk~A}AuE#qsmcs;1Qlrd2Y(8?6>bgrqG_S&5d22nM)|K4 zmpvAL;^z@#@$Kj~>V+q?uBUy1wc5n5c&MLT@@LVl-zj;0^7`k`&fk+4mET*pySPmM zzWlQ(x^|QEkgML8#~fj`fPGN2>6->~UPSz%IHcYp67;j;dP7 zJ(4$)_maEPjiIhuA&ts*Gn_YRvEdqM;tTjmwH=M zHn{&5a+3IMMLtnO&}KGBhsp2BP}u-k3+Yp7cS)Lbt~641SNeyvi)^rLnp~i`st8u? zR1Z@`N;^sol3~)h;yQ7a@VVdzuQ8_^JCePXc!_dpH1NsOzaDp5YWWtUX<}t|*&cmH z>G#r}r9q{`^i2#e4EHK3jRVZrYH3GGeUc~G-;}NaHH@3=x1772DLfsUX5#E-FX{r4K;r-T{I3ft~B1PQW&|$<3?e1XLCbq z2irbJd*{6R6!%r{CLMuR&;{TlGX-H`$@m)lJ<$>FTmED>jUp!iLOZY@^4(RILti$+1yg4?3Sw~KX zy8AF!FXtcj9kuhUvudUpFIPUP46p24v8aNs7*e&bYQOPG^;zpx$FVxUOX5o+Co;Ft z-ozUAL|!wVg3lJT5Oopn6;;FO?x4s75yU<5V)1dwO>t)lOWITVNJhx}Dc&lNsx&gK z^tfcAbcN&^%;XF>_1d9Ea{~K5oG#ZRHd5%{;NDOtcNnb-^J8ObMNk=4T2p$kv{`A7 zQiDFkaHQ;6rL=m2#bEp4?BSAm{|tDPl?X2?vNr!l~t?FjA1s@5ps? zXR+g0K6ENGh0O5DJjd$$IDgcRv!XQ%OaqJ?jY)8}k28vmeADe}!g9~r)c(uyud|J- z*8R?xN~&l*gTdWu7Iu|2lxWI{V%gbEINw+Y*xBr#>>-@~#C^6D`02}_9PpX#0KS^$ z7W3u^cR|!QQ*uRY5SPjQyo8V4G&YZSU&{b~dPcSog8Mr2eH_=MM5l`SV zC>FjKUKQl=S%R(n3f?N-Qtky#TTUakkVRY3}cy@9udXV1_-{{HJ}l{WXC%fhSZi zY9R1sN1-#oqIqiGUG5RCofF0B$yv?D*sqClq89s!dC{+M3%`$9NPncn)OwNxa+LND@(25$ z`5O4f`&hmsUZw9JPiwEkgLxl$>OFHjA3dp_74Wwd&pq!kZwsHux62>!rv(O($y5++ zr>8J$k%K@tKLPsoHT0)hNfZ;^fL}h$I?me7ddZr>I>;&^{$p>u5Sxj%L@kaJor#n9 z3EYQ2hn_Cs#7x41r@_Coi8!J^@VRVaE$+ddW4$l~+72C!KyN6z9k8Rn$xh_hz-NDZ z|90P4-*>Owd&0ZYJIK4$yW6|U``i16Z-g(~SK(XhFZE~n4FNF_&nwAU)K&5=EumBB z?m%)zL0&czNUiV45a5$*Aa587bn61_78Z&>g0Zy{Zq^yrdbXF-l)H(W!EMQF&+E$@ z%Im~E${olBtp-jUXAZkLdkyOn@e-)nt=LgC2f9NU=!5iMl$`1Y$|Q~8Ry@d`>6`Cc z@4N54;EnTs_W+{e&T%{3i``+KB=;~^SLk)p%vgnokO`vs%*-}oJ7{mIH?KWA64(>c-HF5G#%!#p;x2|tdP$s5B{ z@JhIQxTCpEIO93Dp&A@z)e%?m6WCs?9x|!bz`fQ|*8{PGk-4bC3VJx@cA*gMYC+k4+z?+x`Ce5ycrAcD*y3#rR=PvDFu zpwH0h80f=6EyPNou0vtg&#_Lhwz8hF)`E>DvOW@A)-Yl|F@ZB~7H9Y6HA;4=RP~Lmi_A0$ZL!U8D9x2ICiHqlEN!`aQ6w zJ%Q&O4dm4`<_@rePT;`gKoH+SXP~#x2+)scg=w%4r~u1CLx6xb0_W~P|3O`lp;-@q zuq+mc3) zpxe^W6NS>y8>pky9BLRmrHPyfPrV-4oE=mKb)9+x&pDi4L;p)3q4`V*(1&TzWsZTo za!cUYt|0#)Vsrt}`k9CXO#>n<1@dOgfT!Do9zw38Jd}X38;wSz9nm^uBq~O=knz6` zRPj6DVy7Tm;K}yEn-2yKN`%OvFPjcn*8a>pdLi(S2Y|&L&)fo%=L}E>6-;{|YS+UE z?MK2;A8^5az_1Hst~Sh;6F*CrzrWYRhTE4YDC1Ai3-44Mr7UuUKfaDPvL@VWA+!)ZjW$GgqrZSslc0^zLdev=hg@4O{CNQg zxg(H|JBqXgC8m6MuU)`wHi1flAM^}56-aJ5T}6$eCs3W~P1IxRIh9TkpkCqxVm<&l zw;;M9Ed{@k2n_olv=Jx<54C}grF+vG;HUoq|EvNMG6P6A1Ui!1fvZmfKH3jd`ebwu z+7iu&l`$V|1gI#mm{L#)G@#$nFK7k&8La6dx)+UvT8fVldv(T&z@kL()dZ~aGjs{M z0%kD(f4J2F&@KKCplhDO_^xCc05e!Z-=a^^i=ghK8||muz}3%z>`-@V6E%@?l8d3b z`4Tmix=%fY_xVmWhw6!Qz}nvdeq9Td6UTt04FHuC3k>7|pbUQl9V!C8ZZeSSlYmg| z0@WMk(243M@(Y-^K2Xsy9dsyrp_M>Fd_z{D9-t2es2<5iW&*Lk9>&%Rz3`R;rx^~+ z{!!o{b+jCK$7xXSQAHmHvg%);_csIE_7K?x*7F%`rzQFcXw>##m$^`ja2{xv4d9KN z|4*maHo)p|nAc28_=LvH26`{^igq$@fJ+gA?Vw0YsD!w~Tm#;%2x!JPur|!}B3LDB zff(-qKQjeZcL!K`lR$ANfq~eckwc$70lF2L4QpUG+5$$sFZvu^0G2ZY3xjn#8fK** zQh|z)8E6!89Jmn&c!yG0zmJ&p%ysyzOJKJR!G>1>>1Jf+1F^gpDk)9^lbQ+a$zE73 zV#t>tguJ;JsiP~9+rR}j0*-buFqcN)4Fm8wVAYVHu7&6A4lGM^%y7Y=*q+HA_#L2t>M)o97&Kh8urXY1NrhhP%$Z8-~ z&H{V+AA$TBc}g!pJ3{Bufv}491E<6Ss&68Y3Tt3Q7r;!lWJVzepaMVz)Z;kX3K_2z zG{tnH704vI9r8DDK1Y#B)Myler{@DpT?@Z?A95K!jfOd9gHGKKvWKA{ch1=uc1 z2&zjWY$H>T^ad)lJL+NbfXkIbF8vI066wb50o|$u`QneTC zMK6F&{g+mwkLl*f1KQ5CMY_{o<`)tV)WLrGE%Jr#0jsGpu!|T+#$b<-ukAaV#iJp=D2f~u-(P%qOL zjl*R0NlJv{OdckrHiG>oGefb7U@K!_p4!pFz!zd@TlzE>LC(QiA{AILy!YSG`IAPM zG8cejO{Kr1YcSBv#F{V%C^4apz6qDH0fYK9Foz(8=(e{{(hp-{_k_e~+Uk z;xD0Ex1Jh^rjQc+6I2sz2DYo583SI!P9H~7==s=1vL)_hNOBQ26bRz=SStL48q{Gr zlY$YiMxRu{4%)|+l;g(f3i%}d_+Pfv)WKPyfbwbPauuxc;HDdqYknU z(vRu{HE=KKe@HJ-DPNJ@%sOTk_MF_v`Wm>3ZDI_h37tZXgcV!Ed;qnoFlI2YC;M^Q zI{@nPOrTWO8hJv;5;E!t_MN;-NSJR(7&gaGu}1_N6AMvZ@ zV6q+IMuy;9{Nvy>bbz^ouAn3FbH0^CGWa_oo=VA)D!Lz`1)e{TSp$A08REztvdEM7?V2Ccl7NN3zfMxk$DOs4%*=8}Ih&*>~64>Ra8>H<_i z3<6tyLGHjh5UfBjQ;Nh;sl-%r7}E>bS}Qu2LV$K(i!MW_(|sUv=n65%5Qr;^fUFxy zqG%OuK@T88>MGrjdcoRGwfC%ef?M;fdd*%AXGg%6Z=Gd#7-hP zn2U7LO>qQzUY?>)pf>~i@onTsrZZMX$D{v{EMh&i3g5)6rFNi;(J&NW*I&%`HD{pevxTj-~GmyAW0 zBQoYXFjh^NhAbJm7{f3JcAH|u%6m>Vg*knK&kFQM67W1Sj)>(p9^J_MAGehIOEFT5-Hf}Bf6v2c`4E~j@OQP@j-4k^ap<5!T==tFciGnj>8 zRwfqF-~r+_c(ta;P*y6a8UGDC=rDXGl0$wXeNe}+k}e2bgvjYKGKeV-97EMmchG`# z!5O$3-Gj^{bEvM&6Z!;m6KW={lpotf_MwbaOKK1^n0&~XsK3zPfk)IesNeVtZ$m=I zSnL(Of;As@oH*77d^$S~TSV;Q>?Yn5XE{ZUb(BwH_+! z9}`-*KP<%hVJNP_HX-Baj#Mv_@TdD3ZJvE#V}*A1K#!S{pm z(>bn?pCVTAa|Q1O0pU*BRIyQZOWIhLAp9adD^iMDiB#N??A@Ht#C6<(^rb!q4*55G zaL=c@e0!8F&N9;S*3!hh!jxnb*7UVzL6h%s7O}m3-HZC~t~ig%zcVm_r06ts7nY8e zqc<@J>pM$?Z-v_6rPw=cD3ZjqfLQec{gmtp$~)hnuJ&}`1~r%trBSF!@nA0qKQWfQ znL9$@6`hByZ>GFGZv1O`oL*GM%|fzJW@W@8n{1KC%Nlg4Ut$S%s{0B8pcH z)YVksLD6#FY+;$GJ=`VF5HFEj=SK)7A`X8R*TP-P+K6w#W%y!b0G&!^1o*yS-w^M7 zS4!QC`qa7=_2->ldxGPVt$W=v=V*t`o?G|M`LVv(73>c6Oz?!ky@ergneIm2qJE;Q z@KoY4s}xUX#c`K&M)A0u04IwxjmPEdfxubK`^u%bOGN@9m#-E5;@^|47I&1rm;RJR ziNul=@ z9JeEhSU>oovbR*gZ=+1#q`EZj)K-H=N z=<3d+;>i<%Wr0s*D$Hy%dI5bB%_KIlTC$gN&HPj1#PT0?gK9SEu zQZx(0E`<#aN&&4dtz?nl1?LD*?NbBkUYT=?<*Masb>j-ReuJJa9a9=#GOMUjNm`ky z!cxAk(r3P6H#iFGHh341ZJ1K@CXvd1$eqRy;a%nJ5H1yV;9Ukygeta{CCC0{`qKfp zIXdj0?Bl|%(OJ0LcYGgj;vWF&IyT`++&+me!xMDXI@tyfiE<4$V)>nVy@Tb2i(WZO`75`=xN2 zengqMJk?z6$f>7%lbIcO6sJ4CiTIw>B=4o9zoVz4%+}SGV_WKY;>@TIbN}$(4s1pTvVL&qh?dA`)!UHXQDfuoB%E(BzsbAi zKU+RZ*0$gz-HYpyh{b*lX(OL0SV&xBcKRkcqD>FV)|FJ`FUZ}SW&Pgg%egPpznZ_l z$vpoP&3=^sRe#Soz2<~%jps5gB2szrk{|M!>X?u)=#SDmqHmaA(b7 zwxcHcnz;7a=G3H{8dnXe>``&8Vp+wasz)ZHd28)+=SPn|@BsP9`X=ZuyP&=o+D`i_ zCXf`-WKHvlEl0I(({?~RcDt~))yc~ecWL`*&xGT$S^_kpU3K=RmVIRsU0nY7+z~&2 zevAL%_@463_jN*MT@Jf&eMx8i^NR7cQ$Q0_L?6aC@WUicQ8iZB zMN@ez+1-e<2<7h$iX+L6R<;OBa!q`7-|8pT4{8W&ylt>!ecgCZ3$iP+7jMk@%x@-n ztf*2K2B(MJ)jo-85z{b^pV%wDN6f?6ZSj|5c-m8;qeGMmzObD857Cz4`aU`rSl-v1 zGrcccP~4!XRgqPv(Jd^Pr|VbTP~XZBRes-;QoGqc+1cImiTus9!Qz0K+{pVVXajuU zJK+Fehm?rH5C=>Nw*JFuU+jGV&5+3k3v z1)C&n647FIPxMP*d_CV> zS3X>yS76QkmVG93Wd{DmkYWC|AhXd=P1d>Gy~Wb1ZPkBTf7UM{r(?@FsiH43kxCVO zI8+hdAfj)$E%*i{E)vvPnk_&|=3p*9P zE?QPH%g~_mrYX&;cM5&u8Jtza`$N)QSe1t z$+ugKYNm)kpd2f=D8ohV0~hUUYqlE$Wz|K^vk(19%KY+e{+9(`*Jr-{;rZst)aYD> zdsS_#n_9oP67f&4`_p2Ns$1xg@Tb~Mkp^vphz%k0G&|JgvWNU8SUxH7ZFSwTHmRyI zSW5R7H!6zP846D8wiQL_BPtuz%&0x%{Nm9vz1jJK8)BzCKd2yVbmXm=l-Q!UiwS=v zq$ZdXg$+!JiHS24A`(BrpJ!r2qPK;f;(uqK6O3bjb$_?MG4(O7u54gHbjxzJ`T6-r za@XhHE6CL~D`;DYlvh>{t99DXI~RH$VO{y5e6=7-DpUGZFM{0a^(vP7p+YQuB|5?H z#BRedz6YK`E|+a-&F0E06;mqjls_{l46Vy=R$Vd8tC?io=osWm^EIQp;{lFda8NQ` z(LC53K3&@-szcnV#ElI%otz?{(i6eD!2-eweZc6(kofERLwyYdh+_91t)I*muPDm1505A)Uhh ziCCiT8xb2mEp%s48`)36CC+zzCl%rDYkOKFH0`grP};3%MPXvm@}iH$-SqDAxyF}f zzN5@Nf=b3ma>tAMD>T95BW6eE$9WTT8}@2a*6d!(Ey?SX?>eYSv4}QF2=ITbh~0m>6$!crZm&{y*(pFYaVaTJ-bSJ@Lold&S>LSdw@#aaVkB+!IYd;Ze~l$znX+ebj!#eBAi8EUTy> z??rB5u0Ctg&(1kh3e*Lye_t)isMu{jWsj=UyCuvB-Y(HV@lyGUpq9aSh$?t&&<$0h z;(_=OzlQxBUF$zv-@~!R^1gaQMOo>er40>j_2WwW>Q&|YtH|nkwGzkc`aHiBSwh_5 zE)_Z@PZS5#M}wb)ZVKatcZs01vm-l3?$kEZ3Zr(#RL4}r*yBWrs}s7#AB}6E9U+S1 z^b?iyJNxEa5mQi=r~Gm0{QPOzn{(Ub&dOrvWat(b_bvKbytlGN?Ge{FUzPtkeS`Z} z_Eu4>$Wd)oFARDfbXOgzIxlM@*v9G)C-xzMopq1Rd#mPG=2TrNTUOXtmr(piS!Cs@ z%8^xF&0`!h-79=usg4+%wS^NeJS(eHrm010ndUd_PffH55$nU#BQ9wVM;(rO7bS{W z8#_8~Xu`!rPEv>X^})A!M&TJLkKM|3%evR}t8#oGDfbt6r`pkIncvXi0?T!a{eexts+_u8)4JU5;- zKCSFs+O)Vu!muR z2uEa4^!Lb+D0b}TxH)l2@f{KeBuz}ZpYS<0Q@u#&64^wJ&@|U!>w43(ilzD;I$KWD z997QvU(0{q%XJo1+A|fN;dN7Nlg*<|2g6S*uhpq;3ltBs0&7vqSDjg=>qCH#@_G%hS|QE+$OUhWO? zC04`wBy)suTV-8Yo8s`?;%rN9-<;5_guH1*&5NUpbfx=Eh4zu2O5gRsY;>|vt+=L` zsqCk|s{Ro)IcS)=z4D_3<;jV*a1(6u7TGscf2;gexvna+biM9_uBK#r`R>Zil?RMN zt?lYgdY1WVdJg`S^@*zyyW~$)Q`7_0X~D}QT1LK(_!a(dIHv6u`8#Swlsfui%)Qt^ z+_wZgX;0$G7_YpTJ5uslOdu~DF7sHUtKx_LlJ4J}J2_Kxnr4+}rxkoF(if%|$5-~R z{pvdEZ%+QrEaIM#HBg>Wu7lsQC}@jjv-*fUQBuG^1WNsr>0AEy&i&>dmAr}zRqHB_ z6`d=ZqwiAosN!4YClhVm?yRi)-Ovz#`Nh6ehKVzEB0+)}xtx{-CiePw+E-)GW=Ok~Fb&(Tz*mHnf%spkfT z1et@1f{Dk87IHIl&aKiTEK> z^PdP`b9V*Ywpin$ij#(yCHwQoXGyY8XZ8KHC#Sn^VbSBFtEKCWt!!=GqXJ554|<+I zQg%+^QC?J=)H-#$p#G{0vKiu3ZhL$%(~cbD(b`R>>6KF|8dO{{@Jje4H%iZyp_R=| z1I%Y^hn?r#>qsj)ly#Ofm;Y2OP##dX3F2t}48g)J;g7>7MNEt^M9k0*io6#6G$t}u z9QSuZYGPrMCw^^|PCY}U73>iRvF`OQ@Z=8-2_>rvMr6PI+5VU9XYtR-+!wlb#hQ}T zvP(7V>qbGRj8CxpSR@YBKJ_GZkj4%5Sn)yK6}_c;;XYPhrdQyHH>tj-*ar*Q+?h4B;NPOc!oJ1P6+)}PwZXrHbkf7Qt$@h9q`-sxnksdjDqrfDqpp zJ%#$-Ilk3st3oRWf_|f@^mK6p=q|mmqL=Bg<)tmD?uL7AAP;TC7I8=NL&Yr>C)B+) zrJ5_jyF(X;FAtYTtdB?w=Y+Ggd!rgfH;#^o*&cT_ep7-p!4kbhPV(*v4hd2bQ{9m2 zx{9@BEd6m^ME1xmPWI?uGqYlTbBZ1my(|7+UTrozbA2nxr*t&?f%uhtg0ihTDX6!) zKz$GB+ELQwf+;L3LXq{p%DM)iTz;}*Q`ysUnc-~ll;S)3Y2`PJRCSJJyFJm>I&dGc z!Fl(!@V?|UcmZGNg7D4Zt0UG%E{T2=y(#LIc5-B&=zTHMV%#y}*x7NRak+5`v3B)J zemnkIfd%jBYifOKoKTruzPMPGpP!qar^w#@D?9H-;iaMAitbgBq&TklzWz(q zo!YO?XLaX2hnPbkU-XZF5p9wvWd_-Hpd%Mc&k9@fezTRVduTVZwa4U~ZQoUUvqo)f zP$jACUeUXvbyaZn6my2yc9fAqIf zH>R+4Q9{YdvYVzimd-Y$-s;;=U%(KKfcmqf{QvJA;YQ9Az>C!RG2mC?Vw zBkFfLX4Ez`_p0e`8dHT=oio;(ZkqqGk~YTaciRGk5djh4{3Un?itXpsK8+!S6E-CL zcSOI)2ay{icWW8#hsX<2X;GV^21F^Men!lQC=Wvvp}bF=Q=DGtzur!^?lslM_myw; zjS5Q&hUvod-{sa7WEbBk(Uhz()Eh%=V_nldC%yBS+ngc7W0Lo>1&UZ@iL$Bcfnu@z zr?}Jq&cE{i!THZ?kdibcAuK*B^1AYwq`NqczXRRnU1A?-ooOC!Y@z>E)TM~f-On$E znw2Akcv07)btPZQP1Sx&o7(=)INuh~mKZ@e*(tnT!ds$-qVwXb5{=j-7{d2(mvGAQ z70CC%EMF6Eb-mJ2UAxv=Yk6X6W&O*lv56c-&LOUUyw{)ymMKnkr;xsw7!*@~ zV+lY$y#|J;7&3lYOlu~TK1+3@NK#3)piWT_s7CZRAaVu+<#P}EOFY8%0W-CfFcKK6 zF>48H3+nIZb9P!KjmwYXJAG`;=hrCO?W4#l+3%n=289>toydqyaUyARP@13vO zhx&W^m-$clzx#cDen1}R9M}M=qRv1t*@B!+=968igOr8p37nD?l*e?;AILArxL*Y& z#@X02EC#x>yu@j|7qO9e0d=ijB7`*nSiljiHLO=GEw$h|PD74RPQ3|q@o)AOc`H3?Pd0FKdiQbne7D=(&O68V*{Ag{4D_QmLIzsaeW%b%8$7P%$Q{KB%h_NHyIJ=MvnuW{Y+^z#+? zt4KcGk7*8U$4AVJod#vqCU`hL4@*HW0eSF<$)!uE?T{tGfOQ*A-KIWLb7?EERA-P* zs10ZpKlTsKBW@9PLc;3K+6@1_VEqKr@;%ssgO$vl&wk3*u`x~vX9OpeGnPZM53!@z ze}S%T3b7pDjok(|s*u5%&h$`f7nvUL_-FVnz$glRH^3V9dS`e?dsDruy|;j+^m<8e zxUai!vG1lY(`WZ7{Nw!V{Wtw3ehe!ALjxlNhXUUM7#T%&CU=2m>jdf!C7>tL&*@IU z%lMgAPPL{2kVD)HTBsw*IFboe1}uRDatf%;{vtzwy5rE>K*Mn= zunJ>=D(HdUMLD1$It{xEw3!g6A#cjVCAbo|Vc&qDoQ=)Ix?l+Q0LZ(pXe*Qt`fR&^ z=}7)R?0sc$lt~!oXXBHJdkAqCLU4B$cZbE@-JQjqAdBnb?y|T`kRWmQWRh|F>>l># z)z$sHy1KfW3Mn9&>970kx8Lr51h>Sp-^zrzGv6u#!vPG^6mdA18^eJ*ISIVd3*4UD z#XunWi%X%qrxMM=8{vrXH}p|oKp{0B zShJQ;!kPtbuAiccNWeSwgyQ8%VC9bBuKO9#FQvpQyz?_)5YMB})}UppfE;T~v_Shb zz%<#RvzP~E&GSIQT>=hl9+cXq0^!jdD5dWB-WM2_KcRiO85&M!fvYJ3f~q4vV>3SG z3XoeFxP>nV?(Z71+3%+g#a;hXAh9+<(QX*9S%2U?CPIttAhbp;dWD9CM&0ruEP6EGGhMo$5 zR^B|Q=zRo^ClJbm3o*voq!ZPOno8{g;xvnr(#dd#9YZg`&D|DyC%uC12VAccT}qv% zhEQti6}b$`oqFIOSL0cXK(p<|xW)tD_*r-=oEMG?dxR~}lUgav6{Z0V(@Ll>_zKbZ z(^IHITT}UW{6T&&@6Tt#8FwvEs|`5?r)3LScdiGwn|p!TGZarX67Savy^)0R3?erJ zYg(7;1})xH+!ZV68j3=jyl4??$UoFH=(Y5ue5v#a#*^g`$ABQ~0OiZyI+UNG z&$tVCvo%1E&VagKUyRK>AlA-{kMMt0qB}-lIQr!*QB8ya;|F~sAQoEzHChK~<^zb* zrckEb4{W15)YpCq=YYb!h^Ku6%}EA|hre}n|3bX;Vkpp7-Jn9a2k54gKpj0Kz5#*q z1$d`t___`R<~pb*{*IT%M031r9iZ9F$Pbm66BnRfav3AF3UMj&Wf_F{ev7l$B{dWxff zmfVBqeS!#+5x$r)jq!6GfPWnZ1XVvoVlSwN_J_(&1Ta>Cga@GpwyqRvp0$V@AkM`! zX!`;Ig4bQB$sI>qb^-Ud3~e2b_iqQa$s}Z?P`qNH>(>^T;<cXfbq9sW|~D$q8ZvW1WKh(Fqcc9%~OF_ zKD3p;W7h2ls$(wHvt~i$YAI|r;|gedzk4rpouh| zT1dVDI@pf!5YY1@kh#7IkMMMFg?XY;7z7PyEn0I(+zz%u3ea{Xc(fgR($5K*xiI<6ZqTix(p z;ewps$`9caiCIwR+Ya61mWaALP&r*K+~Q{lCFt29B$UgbJT;O|rG8L-Xf^eW{)Y~x zhtM9-fqzN7B(G!qe+a#yKz)Xv3_aG}d=qgdpDA__1_|M)0_rz958h?==1#PfmB9j^f{QVQ@LS{UZO!k0o&{evv)E|11KS_>y10~RQ{Acbx z=`7B&`>{E|dR`Wc>}5w!>K^fn`+-x?9E@hU_&Z`)F`wJX_XiFaD==`Yy~!*gRV=4I z5x0b7VUiF^=!tZGB9{!Or&YopV8XqG2W%%HR`iAb>Pr3_R;)|J0upN$-whe1h}cf4 zfva^U8q+qa7qp*xqZisSML>t%VxG}W=~VO~4-LLE)MlzBv|9hf+PD?b8vrfvU*szB z9pxvTz_kJjIe>gm^~Kur3>sQWVjw+~oGOS=xqL#Zi3W5h3i+1qE@Z&V<2m&eCuIzC zOR@o84ac!YY$V&#YoMZfR~#)|fEM8n;vhHyz5*vqrwBSoltYoZKIMRx#Z;(o^`)Ch zUjZ#0CyoR6=qkOGT!Z|PA~XZ`cN>&opL2J_6y$?(#0D;o&x4wom4wDDnu}!B+IC8$X)GG4-BC@ z5Y=5GsLBRW&ZXbIFSHv=_!iy1^3gx73uCSTTpl8eQ_#I2_5NnZn# zeG@C$USzRd;u(Iguvs98M9Pb(BOK?RlkJ(Yz;`CY;e8d&NKOcmTsk8#kKowafF3L< zYvvjh!2tD1CI8N24 z?s7SfPJ{!vBr`jM>nd*I?_-6$LaryavxLw?@aL|g%FuJr!*!U2@01UAu5I7}u$Zzz z1)CriQA>qu+)b?feZ|kH$wu+B`3qc2wikO&=)@2*;4;5`^)XU4sQJ`2e|n7WO4KXtQ`j*uqT^KhZ12dE8(=5jg%?P^LWs z6zU|R9TaTqlV*Iv06`1gtOVd!>j@{Io#_o$#4c2z4a61IstLKhRe2RiS>vFR8!zYyE&E#t(hOxM%1r&u;zCWLa_=} z2+#Q<1-&E#1ezS{lprGHNFkpT6>Zgv0B>1>!>rk;wRq&53J|4 zTnFwh7X?k|kJz`(5gSr-F^avxeCdShs2Nmo7YWx1Z>k^p6AFcP-bCPTjSK^4h=%HH z7+O%5--n&&YQ7G9MEYajcN$o;6ex@@MV>!P@5MUhkJ@P;)r3ie!eXTmNW8>qoPmnM zjCpquRYDN7dnbZbGM9cqE`WyPP2wu{r$O{J&P)7x!PC)W2ha*93KythL^F0NbbH2;J%lT8 zff0lvekdH$|D+}e&)6S`r>EQ*!UT@aW1e+P2iAEdklp9_rC41mu%kOoL{j&;TK*e8 zf1+@di{Y2?&G>5a6jR!*NJODRq@?%j-dR_p5bY} zji9Cb(;DHSqYJwP%7CJf0tL!KK2>}KRrFhe7u!_mh1#v1P|SYe&O#%*sc;5(-gLgJ zI94!YM0@fT;&`BCcL8%bgEUc|VjE#Rv{$VZ%a7ySgq`9$Xw|n7R`QFmTU-cD;$wHK<gnP$Vg*hR zQn^4D{4x5out*%}$Yd8Hn_r}Fkn6yxJpugo6T%7kbS|{NdA=(+2o1q($|eR0@#1~1 zGx!Jx#D;n#;xKvi@l&; zSO=^J7MzEJqCeH0bcM?F6S5T|FdQtpMU;ejA_NOMvW#j=rlJnKBtGC1;G}biO>tbr zXlU8Fc-lg~xmXGX*c##<_Lc+5!_-771S`@qupHMD3ZWfzq~8I#JqRo0Xrcq+dODax zr-c>7KANF6LnHbI_Sb8uKWQFwst=J$<&lxZSg0{JC-(_9C{uTUez;1A;oo4b=_K?b zGl;qTJfSC^tcTbe72si%OrbIDzKCZ@ErW86VxrT z3pIusjM^(*G(b=E51c_v#5vx1;wPC;1=AlHVE!rSL>RMZtvMIR4kTo$~wRY1Le zf|5IICS3s1go+ss^LU9%v>Q%c#pH#gEs!{DL~#AClEWx4q`l6h>Z6VvEvC2;70C- zqb>Lq!iA#h} z!VEBceu_u9JnlT7i?w<_GT#+qJ()uup=3BQy-i7>weBTGQWvSlI14zAUh4(U!Xj!S zy_wt(^mI7+0jCV#QE&DYIldArtAh-}XikJ%f(!OzMPfa1f&eEcwwl`rCHviAYB@1wt=8Jw$CdP@Rumn!?qp=>Y<5RfTLMC>+XK{|34<73zoYUNfChJV}YA>86 z-$tBgfLHUH_y?*4%Za_zG`MN)L>5^}>G|u96s`lcRpLS!`7t6*r4k4EFQSz3V@`=T z+5UWeA_m?o9z?$Io@&jkME$-{_(4X|M^NXk#{4T6P5eIuL>id(;!vIy(x9!+LUUZt zAA_U73f?B{#<}GY=!6dPr_Kymt2C{eIi}Ltc7~{S8)fJhlBY9ZU$FhEF$AjZKV9x zvM2h8+raFcDhZQJq)(Eb2aDHJIk*V2jNbvd|CRv4Ylcv3T0&#Bo%Tf#gc+ z05}xYr~ppF3*j+#-r?}WSOVYqU_OBuLa7*ns(^wl+z@DQQYZePc>04ln!g5)?so7$ z_KDxf8DOAoB$f05l4fSpugJaBAH*xlMH(YpCmSqjOfSctE1bVU+@uSbW?){$2{-s$ zE{*?vHj@Ici&p#y_Bm>l#(X6|i0k60aV&7y?ep1{{0!{%#^5}=pICrT+y@_t(cqH~ z1Ls4>Rq^|YNpyYsJH3h;OztL=#S;3YyaAL==1G=Q5!6z~NZ(`HOE1FF+Q^*7yz5Ut zlO)Rwl2E!WSWH*I4!VWx9Z96|uiM+4%@jLv8|_y#-C+ov(rsc#!@_N=nB`YQSD^#7u*W zmmtZNe5MQNa;TA9rN`2TaXNPn=TbeX9+VH6hh1wZu~nS&`z#OV(v$dFtkH*gm8jwe za`UjSsroNBUM8pgFLGm|mRRph`_GA&xFm>cP<`rs*Y<@O$&2i>Uv_!4-LL4v5;c>dd zh*`WDRm6Fmi+sQyV2QAZA4$v>C!wlXEGo&Hd?@Bz_@QF+L1@C&b}|nM@#Ng3tdimxl^yI@cTgPwW`rC$fcKON@{< zW?X5G*nst+9eI%c2ruQuWN*~o4}{4$KbavC;t(!W7zxfdDeM-vk#_1Y@&s7)8Zgms z!F>Z(*l?u?6Gn5<;7JD2sq_z`FZRgy$V#dKKJgXJ(0}42#2u>lS=4)Ev`f@DaEE&vIGYco4vKNSL@LNGc*ia-jQm0kqK`6e(ypk&UXYz+;2}8Aao+EI$$21d;Cnb5ofkT< z(D-U*YDPOXQuTDY>)cgy5?Z`-olYr!kPo>B_IZw_b{E4tz1f^>vppvo*T(dV~4VTasgrwasVw#A>k}< zrFfr{^f54HP5mq%{#-Xp!7ym{ZlzMXvj_8#XtLbX!Exr~#Q3-8%} z_95ma+Kv@6tyC9YE7g6kxubnpGe&np7hT)9x|8-;ZA-1OQdj-G=7)~fhw6?RZWt@f zzjZItZ0qgq?N{yhx%OB!FH2r28Y`oej9Q5n9CW$jdfM%rr`+qJ=N7k??oa%d1ibVw z4(b{DN8Ry(-+WS?W;^xw7_T`*PUl-Y&KloV3@S=2l2xv$Ze8h9xwf)hWl1GnnFb}D zbv2c`V>ObhRaLs`RoW?4Z>#3k{-tkf@G-V9v^I1zEit#V((EiTkXbCLl*GwLDvl_Z zsz*DocAx3(?CbA++kL;sCt!`Neh2GDhsZ+Ohc*bCAKEJ@)mP#5!nM0Hk>2CT*Uzm= zDScBir+8QC`HI#Rx+=Z4Zp|t!r=6lbsMTtlY7bN=RL(8$T$x-IQhlwajqavytv*LD zH-0xRHFve0vEOo}vzy`3IF*<|C&>3WQLc=q)q5;>A{x($UYmSh26PXM3AzzHDr92a znSpQpv+5MbIwzhBspose?ITmE|5_}`?wR!{=Y8Sa(xs)1DxGSJYA@F=G&XQJxFpWg z_DX-g@@0uVe^Tz`!u+zG)f050;UA;Pa83U~XV;1P6Xpf>R*wCS3`YoO;qQrk=&gzY zE=|2w0&#ZEKi_+l=K{|z-em#$;0D2eg?)?Y9C9w$7Wp+ks9t59K9F$JF<~{+v)cb0 z_ciBh`|LJ_+scw_C+ioQG>$ipAwoOKnLlbzHFvJ6Ew0Y*lf5$cRneoe)S5e{eO71t z0P8t(SIa%~2uq?+AqD4jRCclYx2X1rg!r?_45wE3Fq91k5I zwKTqey^O>e@yBBZ$9+zC7}3n9y=pVtuIgdNzaOjKwtl}R&5`e2InD5bi-5o8eL93V zj2opLj&tU(wa%4YN(UAGlk1Z2S2CiqNat;tW2aaT$5rcGlfp1i|JLvg&bbHKyWpHh z(hC@eWWJ)FsJ%GW&ksqo}ug(mPZ-Y|hMaRbS06)hyXw<{9-|WbC#2DOHK3y1d01i_&l9 zJTF;OW3{M-b5s=FUkq`qGVe01H?%emH=na-^8)JZ1w=I28!PB1#w-n%&x9h8ucD(o zTd~G@qW7mjw}|D5qZ^)Y>d`W@SxN)agHuEm*INN;7 zD{~#oG)tM)&GCp0=i{-vy-81&g)04=EI>BBbEY(Yn!U~uZqvLq{)6gH2tO1#GUjeV zZG+v7e>J=pTM@L{XBsnF+q57k{nV$ApM1Z{fBcc#u(Y3clhsEkrM}5GOCOSB#3`0D zT6=l7qPT*<;<6~}8R!$i{?liqmQ{J}ERDueRR8~Y^3Fb8LU;+OE;jJlGUy)CT zTXrLI5!>1{S6f)ts<20v{nyH@%EALx%}tf;QtVuGL>gmLn(pE^su=716LK%FhSONovwLveMBvXFv@*+Vj> zWxXmatGKEAVOvVfU{aXd2Yrs(k^Hvl@mAV)0c{&Mdt2X-^e*(4s*O!omilGUqp>$`UfX#8 z%A5Te9cwhC+$F)Udq5N46mMs@28vkf0NdVlUrUvJ&z+J{p1vq6K5tb?Ozjza6>*l? zDS5>_CmZm!_Wo9>m9T3aTi7w&O`Hf_;qo1G*<(DE2FOE9l2nj|D+?6+mAf?E+|T<+ z>K+fzN?g4#LzE0~r2IQ>Za!K@YeAIf_f_B#F|9Q0fuMWU#q!UE3O zaoAqZ;qTbu=+0hYkFpN9-c~q{LlqZ?+9P)7OGb2txi2%A9~L7KO52^mTa)B zDa83&-EHpI@Ns;fh)U0mL_qDB9QJkKy+b!1-+cN=|6z1)it#AZ+BMj}A}}H_EMTQ~ zy2}COPdb7xF~8IPQ<9oHHe>nEt3SJEt}3`wnQDyUSgM)qxcrs$6@8m{!0*B-P$Twl zb|Ke*yTqb&q=lk9sWV6VU4_mC&yoG&XU z{)^fPG(wmqe4~HcT-oKi8p~37e&R1lQ@4z3&(DDC%1!3^HGmee(!>wL`5f`Y?j+f-j->5uG!>{7;IORh~p2Qp>)w+vyjs`9YcAea z#ox*d)omw<+Ea>kJF;pU|(-tY$ea@>*s$T~_}>tb52kO}yhnh4ACn({;C# zZv47E;@S1Dqe_AucVQGeI8YfhF0hM#Z_h;R%3Ac3|4#pUpWUg% zwRXDg1W`{KuZUMb|Btp4?S(3C0e_6&!*}BI*!zxTo7xg!nPQ#g2!!V;d=(UusRY8q=h2QhLmTpkAue#%)CpzPkOJaJ}=D)wf!{ zO!+>oq>+PGfA@(BiU}GJqzv{AnC!u5(xoHCmX;osH}f{9ze=0*_2SpYzvdQntCm;@ z;Uv>ic}I0haZGkkQc7Q-mJx2kXYLGp&sN`j!ceQvG@LaaGkZAP#NqTY%)nlXJ*sc& zMoyv5!`vtNHVx_*nU~PB@r@QOTi&-~ zq72JYX@%Q1zpy%wf=&dF59sUN);&|5Af3eL>3fz(<(K|y_SHKz>&u;Aad`vFZt1I_ z*dmjKDb6b2DBmlSl|N+OlI2VmxsU5(3pV*1&gkyfG^%ws-nC}1Q^l54YiYLptD>K3 zmeXXH`JO8O&OtpQ#rW!E=O#qc1x@NSYF)o;d_|;>e@po|``C(*AA4W^e7Npj&7&`` zj9(uX zGu17fSGf1~b*@`Ka#3PI!{lb)TE1@K-$a+>8n+~Lu?xfmDvqT;exbX);rhzk?Ve|U zd69p_B#|23)c(T*#?|>57~%iiW0rHIq8IhVo>VisC?$*e`S@G-x1yhm^M%T@rYGEK zdWE8uYKmfu?C$@MxBmn2HpykdfAQ8ml1lJtFsw(6d%Q~<)hp_=b+PtE(V)!g zZ)-na`}*M5@!Wo;QeCO-lDLHaENLV=B+ro7$P#5~GEv%>-Y8Z%wporD2kN%hq|}}; z%(Hy8ujUt%UXnVpX7ZEDM@}PLy}T~_PY&)FB~KjR@L7{J%~mwq**G?NXTpH!H2)rQ z+J3m=_4kzLs~-%x*XL2gS6jX=DmbpwbF}QD`h?4SkNsY2yn?((dv*6XpWUaZdDT+GQtJ?Q2X7bZQj;W`Wvdh~RYTRK$|=%(g5cD)rzW#L zLto$g#@5E+&$)^#pqdv?-k~N-SF7&19Pq9Vd>7%D@Hjc8@r7n=vp<_y8)PT7OQ;SH z^Snh%%#R8mr!IJ!@gU`)?0Lj{@@MPfQk{##AR6hRimsYUmm>Fe-X%VDeX`tx)%~bA z+XHR0;!oKpz(P2dEy-_GY^~T_vrB)+w8lD)O&6!qr=?Al8mANLDd0_(PWSx!hMk*)bSdk4#U zV?%?Jv7b5IcG+>2zfG(}{gfj;tYDl9UGhAS`S%N!MqNxG8ZK+nt69Hhn;N%CKASKq z`uqRm<9i}IEPrxw)5_O1JM@!Hxt1f2Q1LU>RvN7wg*``IRePBeJwn{TzO_!Y+_v7d zcLl~gl|6)8=ny^(3PQ)E3)QRK3Vm+`yF|st2PefeG&c5Y64Yp1gY!uz6HB6Acm+uo z+uN46N}K&ExC+LFBHyy4-Z^;H_6ZHj^ld_X6m+__U!IO3^ zF$^x*>F{|yB&0wqx;<;=mr(mpv>UKfE&9E%9q|Qlo~Ab~W1DD89kY#I7NY zTo*D6E!zt7zP8-6k}b3yUX!D_Hr!sm5p>^Q0}|C?@fk z;c?N8c4?(1<%<}2Sql9eYU=~zU$tAR!pe>p_b=L8)S%>Axj(pIcT6gKOVoIAaQwT( zOo9_Ztm=$Y3yoIYMb%Z=N}eXU29K)~k|e2GHd3)zmFkq`GQuO!w^iMO(5sPEF=G;j zB{of5o-jJ9PvCd2<(gP>jnPnbs92s8`b+Zt#bJYDf7sQi zuJNVyqU)>b&#vF4-lMqT5nFv8D=LH&y7;_XX?IdTe>nI-^Qq03s-G{iH{}Nxmscz@ zbaHegY%&+u?p|7NSMNBF8O{w94AqJKU^!3ARhqqS)8ONl<65lwth_5-MQ?(BR(Lpca)k6)R*_%w^hJQYzUlwaAVrMl zPj&P2THqfZTsM4S)Q#AM2{8%f@lRq$giP?R@0?FF=2w+&C9iT7S^YCMr_W2*rB6wp zna*Y!z&*ZF9;=&Ws}=e(d*!WFYt;vxY)+S)emT8zs-uongh}&BEvvG4=q^@mEbm;p zvt)Lup)9dNUS+8&)wb7dG_W`)t0JN)jwE6HBro0CaPmJU!2>z z2D^{(SmqJop@TC@efQ<=y*<8pn!QK+e)4VNx500k?@RB_-q+nbYX+;j$#+vXfsnan z)0xH^hv`Sx%&7iU>0M5jwkS1~oG$5C_PHXbDo;C3*V!O3&9&HUGIkGtjrc=7X11S9(`61uD?nnbwjJiJRoMBoID@wbCWv&wZ7RkiU_8DtahhD?TdLDmp9d z@<#HbvJKMf%tdMk?$xs$!)z@r!%cOJBMpIuF@|S`_Qql(Z`uduPnF$=>m(FIWBwX> z1D@<7p*>vA|KPr}|2S6L*V_76P3FC(Amc(qu;DMmLSudN2FnuLW5)xo1h@QGpf0$9 zT1?+(7DH4B~1uyb@=l9QFpBI&<&vz6ZDtle!Ziu)41b$_< ztV|K2YN@`V-lYBs540t!f8`aD4`lWKkJJCl<8C~q!Tnq|xO9D>B>WSa(#b&K z@5Zgc|JmC&;@&`R|x4Mz&w7 zkZzC=l9j+g+@!mr)fcG|lq-~|r{T`{x7soZ?Zzj9OlZT;;f}Joj)qXw*V^XTc&NV5 zwGOlnu+FmXw`N!yK=GfnF9H8+zQgR8$fmuSri?yyd__JQKxQtJh)**eg6-xh5@VfS;KbOZqJ%CS>`of*V`hvs-D_!ghVhQL?6 z1#&AAUd6l6TAu7kZHJ$OFFggZ5P|+HV!BKIkrYUrq=E49)Jd*LCP-o>dgfndAG3fN z#{9t~F}@7V*yud^DSZ?z9!z`Fx2U$%12T+U3`~tm`~y1ZPdSR~&)##?bG)?Aw*Z z76XgVLIZsl_;iu39u;%Z3k~2LyT$c#H|;5%@kqRIcno=$Bsz=4+t2wYKQ-G8?1yte%Y9|n_{?K$i0LAwZvIfkp1#m(rL?4U= zlHG=U!0j!vhVg;Bi4xoJVfMR+GB;;P8LB@%FfxN7P zD6$AuLLOYfGw@Z38K;KAe-p9uf6SD9V5V?lV{oCif*n>xNJuv@A?uS3;AGI4Y>6Hl zPEI1{k+aD0@ZgRiB~Y5b3Eo{-^xo!H}O6BSg?dS&cM}hI2qvs;hD04 zKf@OQ&odZ&yys}Mx7Y@V?*m|PWq|`01Y+Q!A8&lgU27r5(j=sw7>}Q-grj zTtTIPakrIP40hlUsy$HU;glDpq-dPM8ps;bN|MNT2G)aUsCT80T;my9SRP~ zHL@$24u;uBFwowBoBAF2PzP=X>T~(*aUdBwv59OH>&I$XDY&2Gi@ z*$p43B~V%LRj5yX!I&q4!I^?y^$`oe zH`xG`${b+|UQ5BIJb>38MC&@l<#OPfr-E(UQivAv+HxE39E|_~hK>rwoGQ{@p$jk!|jshnt8a%3AV9KpU?0*F- zD*=(V7(B-JU@;cL`9hBvEd|@K7T9tPa7R&y);Ka4QTy9z!w#HpKJf^=x!%A(egKcL z4Y1c`$k`t;f1cv?3ZG>X0>Q6c1H>-@7UM8rLN|i7c!anNM(JIA(s#IQd;~`QCh%9M z!M)r7PR$AjPnQ3w3RUch1R1&6Q(oX`l|%&x(+ zmk{1i4G1OMBBR9OB?0>KCuZwCjK)?l8E4`dhJfAJ0nFkiXk!4_&l;e}RbZ`=M2`3t ze1LVx2W^43c13^4fc%REv$Hqm;#P17KZ0H7hJ4cmObItx^ z9Jj=ujj#g8;-{m){&YhNN$_H8@eU>8C-mkG#ON+@qqrPQzM1I9A$au#&u~0=quYSV z%|awO6Tx6|#^THWzg{dAzaZb8z|&2|({w`1TA{$_dm!52h}v3`W?vzOQc-;9aGVDw`ju>5}Wv!P%O{;3;Ss0#F>1@H9&5xEe& z>SV;dGx|`4ESi9^8-lUl50>yxw9g$gxGSFePpkn$(4WoltV*IB(Q*;t2kJzKvKiL+3vNY?MF1#~y&5>VvfU#?J?D*i+K1&@Lc!fx~dBOV5iZ~(c4{cNoe3mArYFLa^(smAr9#LM=CgdGY$?@38l}i!x=N=hx+xaRrqhhHr9222%;u;+lgYD8 zKL)r;QAJ$9eBDa+r#^_g$dkZCX9CsehN_qmdWnaHmBe|BRb6qZpc2<%SA3A}L9OEP zWPG6T73%1nsC;HB*n3}TIlX}@ChLOd{t;_MXL5pQ=UWO6uDN&sImkf-Le=0d!C^mlZ-n|N6fP=ORTeOyX~(Xwd^kLZ~kw=9emm4SRs-yYwkdYArn03 z3~;oUpo$XVgxH5tqHp>#cIKsIn$%t9EcZ~nfeu$Y)j`#C6{-H9da8IP`&YV$`2==I zxY(EPj`N4LI2jqs-nG9q4>ixWg*ZAoF0(5B8rPLy0X2h7h^RC%9`TlnXb%MvwLkxk z`@$aOF`Skj>0rC zN+{&w95+*$gZ^BBMMZO+qQBuVv#TDgi)mgR8DPPk9Ugu++ zUuqs`JTx~{gA_5cEM^DUSy;x_*nV1;!V@t-celn=om=^LMbC=FiVhXYmG`UGXdl${ zgIfP><0Z4!+QXjbFmj2gs_bCpY)1XCoSaL|zz%UFnCZ>P?xd0$LAyw*q(KU+@}}Cu zd5`Nm_eWkeeuD$226qU58#N(1H+F8q)#w?)|JGUHEmQp<)3|7}L3^r_Ek2#QG3$By zinN=b9bb;5x&H7^Kbq@Zyrz7&*45C(e8zrFXh40H^i+OuTCUmb^iq9DX_MR{(}h1+ z5%+5E4QFe;Yffm7SDmUfR1K~fpsO&HS@yGCiRFw|z6ke|QqPt??fm}?Toe2*G(CJv z)ZLgr;zq_dN>C^KnQ$)tL%7txp?kdYBs)#lwsKkV@x1CB0p7qh>4Vbu|J?JV;#Xnz z+yb{!U3IKUY5$AsDgGk*Q=V|H4~dIQ>z* zR=?ix-q^|#YX8Wp#kbUA$-lCjiX3G_^=+pI8nsJ>>u2{%o(H`r`x^WQ1+ER68#*<@ z963Dta@>@-dg1Nrc=(*qNXfO<4u;U`bES&nkOH^d@a)Wt*q{2eJwLXmXJp>Vy-{MV z8lzidO0dB;Lf{B5x>B-2VOB+`o2rtO4`mJMvqDcc#@624+^EvK*6yy^U8B&ZR43K^ zsf#zfFrBiw^NYx#k_n2XPE{@u9%iq-zS9CG);$q?H*`kC`=~uJm9die*75J-+r)cE zXafH5a8jM*I_Pgzo`w!^RgU<-?W>=}fdBf6lh(-JC?6}A$uCN3sAIw!`)jkCaiG4J zZd0vu?Z(<)wY9aQbjS6bO_QxF9OHyMs<*Va;+Lwa(^XANmpZQP+?siG_Hyyb_dVk8 z68NU>qTrEXwur5fgQI=p`^26NN%yn(`yc z;&h9w1kX@r$zu6lMW(z=Hc|dsZkBzPu9O5b8_7r9cI#%NXYHw~tO`rHwPHc_yP5`i zn{ktc0~6!`S1f!apE46XOY%{rPnEi*5Z%nr<6mwh}px1d|e+{&(c zrEQ4tftJa)E6=DhRE%ns;*(4-anNqmc(E^Mw~aPS4A*L|R3%krS4^ywR-dU+8m^dQ z?31|BV4Nl}wUY6&bh(eRk;CkBtwn7nthxMcr2%ZEB%)FB_S!%buKlK6_90A35rry*cyq#uW@M+ECU&`_lNy z{;wD(0S-y^N_ADWQh8N&ikU^Z5;eSq)xiZa$g;=?Vor@x`@ZT))#vJxnsogJ^Je>E z{tl5ukAbi22$@OhBeTeS;gUIDaZ))3Yji!_${g4Ha5lQG@_6l??|&$$Hq0KG7&{^{ zKT(Lj9C9_FkJ}hJ&+@BAS9&aWP3GjR@a(SHTXOH^+wwJq6N^%d9+u3i&}k{-ciUY- z!Yq;{DcUI~D?iD*OGUaq^-=7?`?34&h1T=tc}6z_tE;Nbs!6YzSi4@ArdOGsSZ>(M zxF|wLos#U8ErxfeK@qB4jXrFzKIAmoInLG7UFY%4E6*px@83G+pzonvc;jeITxhH* zyi3q%-*=jhl()@8H>P5AQFNYX&hG3DS?w~fWIWGga{Th^7ZsI7*JK+nT9s^Pp(B|@ zH)j5T7IITX2Ze|Ho^&enh;ZQots9J8^zpTm3}_GUpAY&zR;~wYZz~TEG(yWQU&f+X3DE% zm*gq(!?NL0Z^=SBp2&B^Tl@@nwAGcfDwGwE;N`NZwyq(=G}?O2KA!CgPViT__I8vP zDLXnTovqHHF8?|YaPI6J=ThzB=ho75gzwXU)VilbUqU3PadfO8EN4^QF^4;$QmZ;HK zb)m?XMP=^D;<&6G7jCix2ph3E2EiGoTO zlGyIH6_z&U0^=-R~H)9b8nbpRXW8{RZ(eXLU=lOT^C9J(wZ!(}_Y%l5GL zR!MD+BlAgSa^|G0uemJ?4i-k1B$Ne}ixrk?r7p`j(YBIrO=U=~W4&@#O;Dst=g`Z< z`s_Yyq3N=rjb79R>bL0o8a^7H7|KzZPciC@$IT||N5^qqB$hB^WXHf1U=`~W5ptV! zg>;y7rIeA4mXA~ZiCp*GWvDyl<>cEvU})X#A*aFvqc+BP#QhV~GooM6aGwgNHPkTc zbgjAgVQy;X(u^M&=d!|bx8?6DtSUB_UMs&_c}Ck>Ki~Y*K3I51?Umk;mndc_rz^^& zO_*7zom;c(Z1pUCO*ahn^v!kiYyYh|Uo*6Jv5qvfFojr~IHLGsD9Pk8v!sc#jj~o4 z--o!rysH?bysz8{L{*|wgr?NFshhv&F&}-v!r-ZJVzI^cPE;kNL{11k>~~IM6w6Fm z)gy`*W;e+^@c-BtC;d-j+~>bBt}rYy?leZ3%FSJDajZm`L(&pf7Ne+8j8@)*ht6W@ z1Ic*Yo|H(I%Iu0UY8U5B*CLOP-erFNfjL3XLjQ=k6Gg;QaSNjJ!`jr%^$Jxz5*L_z zR~;=_leI1V;jg&#I$5^dhlTx1pI78prD?a+#^~P}!p(lRF>H;nhB_nB%Z4cGDB8)+ zGQs3W?uaedRILA6n_m-H>#OUnp9@v+!RBa7W6M>`Rco58U_&V_EBy-Iyu>KsHH*G3$O42y0X^Cap)==H#UKI1ge zw8YU_|ER1iuOO>QW^l%i3_9mazP-pBjwIu?&1+xjRu~4ND(Y&pIkY@ayrz?+3uQ-S zDbnr?O%CNZ+JBip8ftX3&Qg0==V~}_>|;J^`C$FW*2G?9f9#;R@!)c|CJ)n(Br9bS z#Z|>K#Vo~JdAh8R?5=c<)Gpm7pQya7-tC<2Hq1-wd$dl6;Cf+wB8nq-Mt6!SjwC~m z)yeaEq3%u5_Sdz|N;P?=%(Qe(ddm#=>`!^0icXdlR$kDOx}*9U!%!1x`O`Yf?vIm! z0Lsb~OLJtLtW3I;nL+;GPudAf6JxOcQ|-3eAl-a@r17U|i6zXo(>}q`i#@|V2b201 zae$i1^ppOOeUML6TvNsNI%+Sa;A;onrdEHg_pn*8h)h~OJug-SO2ug35F+b}=?(V|or7J7?S1-hFt42S; zSY!HZiMCtWM6nx1N!)<3q~t)az$IWFf5RSX8E5RLZ>x*e73qHJI94YU2Q z&9nzOLfCm+4W9;f`xvIb)Kxx6@f>5{QL#{d9Qk|;_$uRMi3(@cVW-0`N{_YPG5)^- zM~3K7QIC%Diun?~JR&mqssB^=WQCikwk)e&Q8XeaAai7T%XDdGhnzYE!6om?)8XQD zNat=Cir$=Sv0B?ZLixso2UM@R$fWXDvgXnibbn$F*Vo3I<{9?t4%S|%U9Mvcca3As zGV5hqvHc$~t~AhOStAZ08)08tDovIv6+5u6?yR^YpCS*FzmQeS7{y}cMD+vBD%VFI zvwgw?-q&>xJsrLyGAC+e%=lzUp_+4PXUkWQ8nh}LzArOL&AmsLIeJ(?dnN`Ek@Q>Z@tMMSsg{^h2Z zzgi)(QiBSWqlSdtGh9-oQfqx5OM}h!j3Fu066+?6Ot=au&3Bojaw}S96tyX-4&Fm9 zoc%hu8o5t-MuPF<5Da8ZI*BsAPz&O7-uYm#JdM6=scoSI)Vt5aGj>fT;Z1h=H8WqER& zT0DiFi<^O~QQpzQ8SC2b9`D`5{^45_bE!ehDcsoSNIo!+v8!py_wcQE*K`iGcLSzq zqOH08q@$AS70zgW`-X5=p-!_#Tu%&x2e*$(rPnb2lIxNV(vwnFIvwYKcjYS-2cfCH zL%m6JOlJ=~7_u=g-a)_gwJ+_OzdGY#a<_zP ze;)q%H?cG&ATvAXn^{}*qu5e<-Tu>&>`ZqVJgMF|Xi?Q7SJPc2^Q3R3Qt3a;S8}G% zneF9i=FA0uZ%0XdNo?tQTTMqjm%?N9-eqg?9ffwdU8l(l(CwH-o6xgcB@*czsY7~N zR!i=Z|4{r^e)p@3Q>;zeH38rCtAlF-cCjZiGUjQyf6F(msI7Fc-1>;Cp_K!xDME-t zZnJezZftr~a!CS&xDwAKcTF$Nx|Y|rV5!wna^I$Lbas|H*Sk)*>wEp7aC1idN`9nU z0@Jlea)>!VS;2m9<6G>mPd8)cVxy{m*3#@Kv9lRB0h_MmxA`_#YMc_Pd4%$u)W3k*U$9&sfo$jly0fk^x`aYuGw5#*s-`rsmC_VG0qw1s_TyT zoc7)0j$$2JLb>Twrn=-hvzA^&wh%4cIv?Y)I(s@M*sI!`+l%ax&f~6z9ygp(YVm`F zwqi4Q5>J6g`*g&^Had=p2Iu;ibdqeaysu)Wa+=>P)o%4y|2S=uE-LW2er8b5kZAbk zWto0NjE^iIC5vtyX){g;D%O2c?xRMqiyXCz+T~Tq+LO+v-cG%k=Ezu?T|Mu%c|ze% z>y#1>nJm`vm$SL+EPM&&Tm)RC$5RwE(K<@L0YUkYY%XSV%Y0Ig+;z$kZ(naux36_v zb=Gsw^yGPmvx}h}+Z(s@uf#!w3a*=Ls8>WH3)9eWitPe=H|IFYm6XpfutXU8&yf zuhE{@{T(>iFfceaR1uaOE}E7{_#!eRGb8GSeG8fyFkF?*yyY9X7nCfrMCDF{w^rkf z9~sNCj^%vM^O`Fcma{%Du2t*k!C&CS9?v+Qo{~;x#$^AKdnrG`!WVwEPAhp*numz)=)CCK=*jjq%8 zNGnuOrZWwgy7Urq1iW`Md@nq&Tn(Mg9N+AT_AZV(&c9u^-4(p&eKM{Kup+fZBh+gC zCSBw@%0$1TH!+Z~2v5Yy z$aPU)qR5DTp*lmlMlM$q6}+^KF1VUgBh!-hGBqi+fBM_Z$vHyaNlR^1jP8=zw%zta zj&;uSuGXIQzB^o^AS0#pD5j32wqzX>4uKq_uj2Woa}YX`Uj zRY3y$X3m5SG}VhZ9??G15}9av96H``Q)^btqPDPtqq{XR-#-WIMn<2EHkpmH`{eG( zzii2bYCy-5{iT`HK3ysf!$LVuz>^$(QGgPGy9n=BA-@Lkz3Zyon;Vl?#m=IJ#kAED7`8jid@$N z`?v#s{_0o$C$z%@{PkZA$-&v7o5P|^)gyjKOo?0)6&l$#EIa6Dz)4ka$$4Rr=S^wv z!lC)wa=vHP&03XpGJAAxgZvNXHaOpEWt~&}Psy^ktN1~(DvE8}dHPzkDGtN8ER~5*(V_cc?nHu-omx+7i45}8b zVRkZ^Sgm(TE=hb?QT9ta$|}fPD+VZcBSUlkx3u#D!u7?5#Na2P1H-K0M8y4w=*Z4d ziz4@inS*Ku4p!fm+!bznrrUA~)#gjN9djOM+p;Y=)AL^DzcMFTn8Nx+3$4qF@0DD! zU2t4>weSXT9fTsWh?oi_&|{)E6#8DXCf^ayCigE_b(hT5)OFBR;EHsIyBE9lo)eyy z-s-+c_Au8Js+JU4m#Rm*>E6tIW;)Y`F<`vrAXj&nWJ_Gq+GuwV^%def+BeyWe zma{h3n0F+vU48}g8cVlAq3C?^yV4qtRj!vFg5|g}&A916IE)g{38$e@znER^JL0|V zQF%tVlU<8kU0fYplU$e3ew&;0cK4lU6SxY{@106iBmW>tKxd8 zUN%>jiu=TB3MH7OFZ?>qvlJd^lk%43FEnqnoGS1Z4z;c+)|Q&=Va~2@w|5=4Sa66> ziE^Y1H{K@&57&i#D)EkXWgAW?>t+*GkrVRiu_BV7BPw3 z2;IyGW*mBb98;6gK?DCB6C#-YK(%v{R zJkOLHA&Z<5sg4>PF)Fm4-mV#~96~?gwC=Rh1w~CQ0r|gjE99o+7;_)xw$J;Tw>p2B zSzGX@aH;k0l6YGc=MHyr3^i(=dRHUJAc!b5vjxtqKHxbC}- zxDL3EyQ;c9s9Zotv^4FCxEZk|A`;#}Rl=tRuL`jGUshD6i@1~S_qNy8 zk%$;|-rC&Q+(4k#4SAltd-*rbQwzEkIjql05^ZYdNcVd0D6p(618>9u12jXp3Xfki zTq+j%GQGHS@^J3)?)!+Bd(J}V9@jYcIZs{RHg*Abl1~#RLtAbYH1PbP;PjL3!90h% zM!2Moqz4=o&f#Y8v2?HOt-JFxO3_iDj2_pw~uHLxh3*=eY$9iFPIPXgJZFBnf=fkRN_@6u z&SZBbpP3Ei^+47UKq5Q@y6Oi{@-?_5-$rj6Pq;h58S32T=Ep1>cGL<{R%F z?CIg|=33$OIxaf?INCbTI=j32yDxcI?{v15n{akdWTi?HOI673 zgFOSmc$^Q_M1Np-NO6(ymbY_St}A;RdL2EzuRV1=``y*uzg?%`${p{%=gIKKvgNpj zd|TlfG=+6Q;7*3)$PC&}&%~M(ENLkjj&Hb3r!@O?bpi|Y zH-qMeR5cReH%+M#%Odwh#z(e_JP>{)_*1}l^?O+@vJyMmnOxGR=(r^+|9)RctR=1^a9_@;0yKVD2A zM5u3Gq`NUs7(Yp@WQ`<6Qcl`d+C#cd`cbNobwj3qDF3Zsm2*^rdb6gA&Kz)FKRu{p zNG0PNR0SO)c13KCm=$rtG{7hiD%8DDUz6XW3xqMg=`PlGzIcA&7qfr$~fCW3bNW^Il;cuuffon`|sh<2Q3(*|zLyAMc%l z%z4ri@7d#7@5%8T^tSc|um$X6?lgY@%6Dnv97NACvLof8R?~HuVrCh%@rSEhDwd7)c=(~P@Gmy^ovn_R?SkI{Ga;AX?|)}Yg_1k=-LJ3 z2doP820{o^-%CG1zbkNRKviA7rmugxUxZ@4w1|!%rwPZ|JDygqL5?OiM{y(Tufl-^ zqPZYHFn@ktx4ap7nR)l~-M)qBP{$2PclN}<*=CjUupr<@Bwe9*@0$Q@+^*~z~5aNT+5Ipw+R+34BtiS&N=F7pj$>u@so zon#0rMJ?*$)=;cjgEinD_AZqq$0dYxf;1l7gy}L;{!M;NF^TZ@YIrGMF$*;5?6GuKt@roFW9Hk_hH z09`+uvvAG$wNMaj2UnAN@E_O&Tv4f57uwZlfrK1RW|I4<#`H~kFjEfoRf62oX zDy2nv)^CVPqQ0!|<8Skytx;>AYv<`ay14<7fj0tWdT(Hmewx0XULE*C*Hw#aV^wqI zN*N(pNbyko&h&Nhba(A_EU`^5u~_#M)ho=h+&4eZm*j8AYm+xT?`>Y6{J+fmEZ%}K zs3k6y%&@uabDTEUSkF1H-KPSU{4w@R-QYYim3Tqu$+6@?aLqmg^<4#+`908Zt&7N) zg0m7RStwzk7G#v2l(m;<%f~9zs4z$RW%x}~<*E9qpQ@|*@AjuPZ8hsO>6$Lu<65&e zSl3lINjE{4uKlhV?cYG1?^jjH%DziZ(GSQp@hIPqjq`SKuXQRMf7=F^ys#cB8eZ77 zpu1(F*^(b-9$-Fau4IWS=vMd=er98F<2}iq=>S*GJq{J+E#E@6I$XI{IL?Koqog2hLhMu$xLZKSt&TgPvjkNqC8Eh@@wcf#P7Xd zoN9+^BVMmmJdg)9)aBJub(A_%O{o8QhCQAH!Yp z)%6y-x4I&ozwA$Kze=4Y#*%5pMDYXbQR@Y3v9(+Ar{X0gai!&LqAkPz!SU7k+_l=> z#G~`F-n+h9teL&dHRkv872&7j5tiX8^6?zCfLHxN%q7Q>L$U9Mp91!S*D(r1adLZ1 zl81G7r?fG4v-z^h@`FGP9#_~EHI%cJKa}PD2B5XC{d|5ws=BHedZPBG%vB#>lHo;t&Tez$6 zL7`ZJmyt!N;_c9^KjR(Xk-7Id zn>#}6QMT5l!%L1AM-_jzp0XadezVprK3Lqjq(Z6AM%Z0;v%~A8-AV2>o-W?{K8Bsi z3hXDak52MIK>xo3!gMF_#Kj^Bja%S^$w8!^+=%^cDpej#1O?Ls)#r9e3C_ssO4Fnh zWD8`Az^<$&Un74GJkDD=sc4BifaZ#NibjfB3PJ%Yk^G)~w0yW+FRvu4Aw7=TyE`)t zSV0Hbn~W#q*tZ@-U9+Fh;RLXG&iNF+e%`H~H}1CXQr89764w;hbk|{5wky=#(|ybB z=NSn8lmuCGmzVPn@*VLd`YN&OSPR=7N}4%b1AYbn6HF>EG{OsnXt3)DsH;lgU*Qs; zLx*f5Ifpb;6X;)56}l>uLf1!Z^<>I3XX!h1dF;l5z)j0#elcUgaP^azaHhPCnZ~qb z^vp}3bko5VsYrccO3VfTgc6VLURMYGv5Mymi1u$_zRt(y}AzmHi1CYmpN>$1;YOU zR%8;`Y!mR+eTc1?9eS`5Y6CsF0D9f0$xTqxUPB%wFJZMVfI6>97t>@Y`xo3Ixx{{ZZ_ zjL_ncZ{Rmok9Y@_@}}tjm4ZgN0)2^0^sR^8#x`RM zeAj%NeAD56x6ro_Y{5Ied|x2jik$}r&N=oAtK^!(rE5KRn=9bz@-xA9%-}a2u| z<5@8AZezuhNUnjiH-c%%2=sBf7X1KEprkH<0re1w{7B&LixH=-z*?yQymBBED0YFr z*jwlz_+zg)jNicb1M>Pbp6DrZ{#kI@dUFMAS1yI~qSX_*Z5#tPicath=!< z2$R3hFYI}U-9R;~YdarfX(l?Zzifj>j#T#jfhYrj9#f2Cl$$Or;|R)ZticrXU0f=$E2r>ZF!Wt%WB=7Lu? zjO;^^wb13=M67~0$4s<#I^4FlfEltC_0eTSRx;Wyhp$^7IL}02P7H%HQ(G|n z>XM;kIJi+9yup&dGRXpa=q~zpH)4Jn!S+}>^h3+_a#a{hB?D|1~k{l}D&lTwl-i}Cv(FvH*CcVED{ z?HZo(U$BafqTMTzIa`5QV#H{g(Z|=}!?hkUI^@4zt&2R<6#OQ=s79pZ;MC+B;^Lxk zNZ5eQBxGW^foC`M)yNLC8kIjhZIIxWx zfT0qAXm^3RbOR@so5d{{`HtW_)&n1_BK~X*_E|$Q7SA#r>*!(Zre&v)68*Xq zk+BxD<|UDcUM&KnA_;vfK|6Br{af%XpkR+zHriBx*x?BS@=OrvhscnSPQ=r{@SS@B zmf0uF$a`SLeE}QgDq?yidZ0aWiUE;fg}2@%w0Iw4a{@*>4y>kr;6ug2L!koP;TYul z4`A4yLtJbVR>LK9DYE7bu<*XXvnCS%V;c7C7qAcc1QwVEv!nw!LnFXn--dp@1qJt4 zXzMdDjPBy^7x6sX!PJ|N7+8U?mH)Z2oJHHNBd?ss>l{4!)?=KO;k5`%w!X+AV=!9( z;QKPJOmoz&70_-w*3;X_1c%|pHW$pX31E!%fIneB%*R3CB#pt7G)69|glCYU|MQTg z|2Ma>RFH!A(;E4@tk3U)*Yp*2SP6Qbh5w%he5#J%ea*vu@HuAFbF}R_TK^C(iA#}B z1|sja#h7gy5zrj--K0t3o^z(__u-J7nXU5u7^9p2|V=& zWN8lkB_rOs4qDO^pE?t*+lJn~@!u?aiIM(^aesvoIEP+6hSqOKQ;D;;R{F)>V!+H`6eph9%8+BMQ9Ejg+MDs87 zXbP$k0_%toPf+HDxeW91GF%W}qn2X9HVa1vs)iZzH|F^mtRM?96BprCHo8mEU$c-u zCZkO=!B<&?IkgR3%~P0NI}xY*@mh;kuLP@h0V1kDvO_n-!8p8EKQQxJqG~E*N($)N zxBt!jy@r*J;zZm3fbEqfSr!5ln; zcE7|Nbm09;v0Ig(SL&gcMxYgUF^3-iH;-N*i`_;`7vX8jqO%qHu&f{ZBd3i;oGwFK z*W)?%qMdWGTU>{Y(q4xMemlmjt;_j3`M@%j{kQKv-cZXTNbyGSW%mzzU+sdnvL1D6XRaS zg)Q?8{eW0_jvR0r_2xdXwYQ;_GmyQ?_=4A9Jk*`m-K#aCKDUCd{%JtP@qy{?=Hvd*WH9AdWX6h7KYcZX)7e zgMau9uRq{ee#3jFi78kIQ^6Z8054Jn=3@w0hBYz2J78vY!|1lbY;S|P7>9ppi#C?A zD&z3?P8jzZc-nBxDG}Myh3C&l+~(jb718?xYuy99Zegw6i@uwVo@|V2&w?EA4wZB* zc;;BZ1s^4}#!9{w5jzpHu%b9vAo$Vja_=Kn0nYLl;Uj#Ehk_ecmFR^U=Q^_UAmSp` z0nv7jTnSBqAn`VONJl&o#vxD4!&>|h_uh%{Fup*Tr~}k=v~?vp8Y5mJ>;rT3t5}mC z%hiD*Y7Te7%lLwYi*O{EB~~YA5wYSE>KMEMTT&MYnx2k3Wgk7C+$7u=UDQ({2!4>I z{36tM@fe3FffYvyM~Tr?1)(0d74zL8ETi&yPVCEX1P5>+-GC0kUD9_lh@MC-p*s>g zna%K?Dx$xkt~d@|5p=^Cn5xY{xMF(V!_6&!Anph zj1-4JLujlREyN*{4Hld7l>{3y5hv>4uD%2-#t!&Uo!~Es&Cn|hcIXOXCqF_I_+nu< z){-LZUH9SgGLhipnD# z^_ZRbj)a(N6ZH4}ziEhzOGe@WJ9ZMouy0l(N;GJ}9Y*-tI;o!J6?I8i7NJB7QvFT2>0H zi6;DQHdKfe!ABP_vCH8G77V|;B(AO)$-hS3)KT2THs;4+&$^#zz?SFUV07d}49~#N zp#frM2j>!4q6^zgq&b6d9hGqg*n|Hf#$Lf?XC7-3fAejqvHUH5Hy;e|t|#0daUi@5 zkMQUC*3?_%@C^19|AAOWttH>EQEVl#kXa&`%`NbJCND8DOfT`OcbZs^#y(b{u;Nqz zSGYPHzcYyh{t@BeP6}6}cqyw3M#UGMr{-)5I zQAo|=WVi&irglrV5dDw~f@!UE5nYiDWwRBlCGCVUd;_wNG=XX?w!q1BV@Z;r=iW2j z{d#gy?q&2V`3T7d{+*{9lPY~iPXgoPt8gB!n{T*JTsNHQZ59>6Dd_GT7oLmD*@4hB zY$K?IwfsBi#hi!dq95}a88M8zBSuIcv%9%|$nOQTi+v7_?Qy7xTJnjaNF)d|NrO0r z-%G~8dFKOW8^^UE1_?1ldF&h}13O&_l|faYskQ<&a~u9`VZs)8S$@Wd&*VD5nWwJ! z!&hDiB-fEyY=ZCvD}6Z+5_&GuXl_|mpfb9!D<1n%rQ3H1kcxT$5*~ja> z%}5LMVT#4K-ZkPgsya=>C3gyTE+*9KvE)xUC%q<0xii9Lrak%cf5>>JVZ28Qf3g1x z&zN@9N^Tf8fmD+p#T=+vUZaKzZ$#c#PT`eV`3w99?jL3dGnU`M^Nb8T(b=q#$dR>S zQ@Kx280aV2=Q9w`sb|0w?qvr ziitV!FM8oK5#Puf#7($k{_^PrH&$Dj*X`q}R{Rt1HtvWtmI(1mNk&$M`~gqO1$3-L z;O_H>h($~-g7JCS8H^vT#p*Mm2RHy9az*E^qvvj*1jSI`C6iFdj!krS7N7n1I%BATKVa;Al3 zuXnkxM0Sl?<-IK!>EC=yVF0^_`b>Ogw-CR@gH$7WkuY2=fLqi9Y6VUTS#du(8mDGK zoQx~^XglgmyJ z^|C$UNMQ@Lfxj&=NGh<4xI~E=BT&ZfZwE|ZO`PCQBH@L{-X_P;T{ydNi3-DBd@6ZI zQ1h?JAH-E&Pp!mhzW_JNir68}A{!Dbk&g#aUr~oN5z5%@H{pZG2^#eLcD@tQNIb&> zVaQD2ZR{=T4b_Q8gR1y!@ZhjLrgJ{On zOmn)B`w0D15g3j%zBg4_>g7ARCo_ez`dlo#o0h}FFQ1(#?xxSNGvLZSjC@N66QOYI zJr5tNBRJD75SxP=-;&+}t+)cxL-nA-x$9UpC-aw)V0LRoG zY=6EBvyafRi^Wxvs={IJwWL11m-|BX7GkM|vLt?z&q%kG4iK7)PI4PhizU#e>P*Us z95zWf!bA&xd@NNFUVzKVC!(D*i<__#)`kz?WiE%9hP7-gPNiy-y@fRK58VV#urA&S zSFbDFJ7SnHkUBzb<30!n$U!n~dQ~>5A|)X#}N+ZOjPV zW2@P}JUfWJ@@JyXQ;QrX+(Xpo@egIeXnQxVA0wCkVm0I`|ZT{q3;QOg!1Giy1JOhZlHD0p!+GF2S#fe*-KU=@ccRI3~3W3Tpsm^J^^H1 zL-L&DEjhw-m@m%^!1)oPo;^ZWf!p6kp()jt*#q}eEAdnMl)dF^EB(Vf=H9Svgb-zO z%HXX_x1>j)c3nZtC*#ChtQz`JBH4%7Dd>rcs3p4Kp5+Ou_Oaqz2_QXeEB*xYmvkZ* z&xLd?WK2oeq z&7wAwRdHf{0=+kgWVz7R!klbYIxXjHIrx7C5ikh*4yDYBf=x>qCwq z`UrZe4{@EpEBr=o-v{^6szN=c9up1 zg?Hi)D20*4QS!O?i9d!DlpyM`Sd|YaqN#LJ1`osG!VtJc9p&bW8ajj=0vFs=@d+xx zAi>4$#*U?u@Rhp-wY#>s3usClq}LHwxHIBa@-}ft_=8>6I;tDrfqP9}qC9*g-&X8M zsfmW-5{&#Z{q7~|4_*| z+0cj;QP20J_Y?ED_ta9_%`X$v@MI(4zq^I3%`AhHa7SW1&gRz(ClTXA>D|BtZ=hD9 z-y8ow==Zk5Ao3XceInc_=irpD9Tg|aP+N&O3wtF#B5#Yc`E(*j97P$3dt4yV1Z%Wg zd@cNqI`$9!g6&GwVirJ$DoY5!jo=QlvZ&|d$)j`u|AjjU5772}j?OiT zLvajeR-JI}vsj4dmI~9Uhhl#|U0g;o&^`*KK0{;crTCIaqyLB$FriP0OXLCEyzCTj z3kp)CkHT5nhbXQ>W-wZ@u`rS@ByI~6q0+dU7z%z&RjNKR+yJ6Bzm;f74M){(;ZBlX zat&wU$B-4tO2SJ%4JSJezM1e4=W9KLC!C*P#7|Q=*7yk;g6O zdQ?~Ol$9J#jwGhTx7vqOu_WRz#*8zbP1qYRfVS-__@J+&K2T$!tQAA`BmJPnS(iR0 zMsP2MCPZHnD!yzpaVDd9m z%k|*P^IG8yben!-WbCLhuc5zJO6*KNc-i~p!{l>h&y@ycFSrUu_0r%M(c;!Qg@-b8ta$ z;hlo31=p?RO8Js6r6XPUy&Zh3jDdw?MDL^%t*M~hqWc`MPd8LQD@bQ} z9Jt%C!q6hP*bt$eph?#G=^iT`^6iR?(s5KK(VNT_26<u#T9oK>%Os3LXB`1I%Ix6?cBjlTb8YTS> zfSumcuZOyxDp)yId0IW$Z?^0+xV7)(%b{o>W2#6dgH^ml909ae6m-Y`BKC7TJPUnG zaoe5;_3>{$HQ$i^>ZuGDa6jPnsq?O;NWCexVKvfJ{j%FgQfnrGU<0kQhK2B*F#I5+fU=**CJq05cSOcTTW z^-lx82agWguNM8zsMLy?j1+f^U-(qlczZ|a!2B-UlY2V5eBR>h18Ko2%~Ri`olV)E z;!Dp-f0{lvXMtHLXaRO$CFdM4&o;3`$kTF*GFaJ1RaN&TAUm*&!4!NwgbsZk@;Pi^ z#JTXKuoK~bMfsxEha57@3#)8w6%eZZt(mJbD0H%EOsSCU`{^xm?Q&EoscA0FU2dWC znx>sh{*d-PZCuKrBq6DBTBQt6M%65BE^8@oZBa7BS3o^Oljq;2W36W z_? z>Yj|hG8d)=rhQ7Cl72qxa&}(!r2H2J^NPxqymAine)Z1enouhxFJ;pea=&o@eC?5d z3jvbAd4@B=@xh%#v_^ec#ju`XbHe9D)`$!bTB6S~elb4QCa8w`e^ZT@$J2X>>*6#v z+sW8-Y~zc6<`2yNE0@pdoIW)Ksik5@3%&?DqvY)q5kin@*%|`FGBhm10q_RxUj(R#E2)+-@-Wk#n7)|FZHZu zr1rA9oN|Zkyrhu0$NmL&YIkRl?Vp14x$DjK&4)7fBwq(Jut{om(!iwf)EDWOGHztP z$R1>#P}HM%s(rYpj_(5hkh(4XD1WEW`WNY{1q=)vXBZaLHdr0n+vsmxVytDlZpsTU zGS!N#75P16Qt%mL>rkUEQL|iYS0&0$NKaBPgl+s)?>R>``?QiR1+()8iZI@qA(5-l|bF%l3*H7rckg~IinyOdo8d`neAN^c? zRRb4%E~IMcCS#HDcvwwS%ZTa`k0K97EeW|Bq%y^Yh3d9y8|hr?ctth&HL3@yzs0`U z4x@u8-D_E%b2GPL-lX(8iLa7AroK)NOe*~|D6wBgovi%SS(*8k_@aA7k@hFvW-Mwt zdb})K8LwKTdaZ42hzeSv-=IGmQY9=Y)E43mV2zlPAjy(=-$r$sHoQ&Lxx%JW(C)7!5mYS8cJs~aOYT}7hF1>0- zcy^!s<(9&t_KpeO!`{Q}3#zfap>i~kvb^R;;2A@ALw2AtsA6aXV;y6-@ez17tf^sy zJNkIJU!k4#UemkiR)(ei<+TyII{vj3p;UeGF)@p4?-*|jvFQst=S<6fmK&boOvp>< zmr^}hn&|wqIpJYSZpO9rtPDrq!-6?QUfU-R<4a+KsG;%|%GQ3pR3>exey5?GAxOW) z&?0n)@ouOz^mEvJlYhi|)4Ry-<))af8kWc)P}3SYJHm7eifOsPzwDlTytye z6>ama!TEtXZ*yyB%aYqBluy}|S_N`iTM~>Z=Q3(#rltqx94mNfZCD!UD)5qAePWYz z8u$rM`~oy>0wVNr`nG|-z!kyYLUMw~hTIPw8NML=lu2T$8e@yh2@W@;ML12j12(Du z)nse4RX(YatS?3p{_F@~{CAghD~Qeglyg02a@vo?pGj9!b|$4HR!z8-I6uvoxix)S z=1}wXBGDS-xamps{pNYP4s?}v`yE!d(0&RWWN4uu6F4*|IP^hiZg9=eYhf!)SHg{^ zDUp3*t{a;gzJ;!fTojb#ulDbyovQvOe?$%3(wD~p_Fl5=u6`=@bHeB&PVnvH!tE}eO&0t=rzV0n)aHH+UpvV-&>}$xD0x*R@Yy) zU$za__IY2jHspTKdX!{Ln3L?EvO2L-g7c3wnaY@%aW37QW3k*VJY6!>6(z&3`%hFcP?ZBvsOh6jd^r zv?U=i;d{!g%o!OSGg{_3pyl$*R_w0oyTls~Dq}aTpi1zM)x;?$Gb?~g`O1fQX4nba3Tsim zE_ZBh>+JU_os;5{$ERA7ZYNGk_>&xp3_3j{IOmpSXHjN}$(7^@XP1fnC4wwVG1{+* z{}1itz&C+o0vqe4K_S6J$jXq#A(f4O;s2OUhaEI^jh-A{Ti+vufc{xM|3Bz)i+_Nk z0^Ln4Bu?_JU2ARMY?X>H=U>c8%iWb#E$u_{KPfL$vQmB~4NBCc?#N;@c4kz_J5VsX z$lqpjX1R@=mL!?#Qa`2WC#V9nl>^@Dk^?S-D|1#qEjT`;We6F1*mySVV7MoIdE`f9 z7sJP(cBc9vbu_g4o@R&tF6A^P6Z;&!*u}fup|mq4Uo3a?8=Kke#_5kzzo%76JDs{O zWo6Q)l#`jWvW92g$YCr`3jdV+<$Uj&?_DKaq@FY7tBGp4j8iT`(#_r*Skuyv%bPVkn?9)zE-%}T;sCo z6+SB%U~ZX9Wv|aXlkqI`eI}DWAx)RnF!y!N?7X$+3x#6IJ;zvZXX|qPiAq!l=Aq=2 zJiu?cDo7pgKS5hT*InB%fYI;Q6Z&X9XOIPZf`=Jq1Z@g_9~=_!N4qj0BhXLNRT-x! z#cp6Z^91)5`NA#sqGze=t$l8ZqexP;zhHR&^K5%oT6XOmTUO6ZI#ZR?A^&Ioko+wL zhl;yF#j}xTvoD?7LtLYiB)p7Jh)Pmz)Rg#-({P$ix~l=9flC6V`dUz=7#Z9@=wyh+ zXw_GPbK~cbYPwsfX{>P2z95~4QvwUIfotP><4`$n6@NCf`QP*ZWIs(`j*8HpW=gx2 zTr)W?qj&bzj1E~H&5?y?tk>)ZTsBW0-+?;C^pb@E>7S|&&{YZet=kv)RbNBDz)(Kq zSV;YltD(P)&BI59`$xQq*cft8-!e4D^isc9{Y~xAj8Q+6Po-vn*}sc#>CU&0vGugB zF*D|I`P!@zY0lK*w8yC@Qg0+5PpY4GI_qtwIx99$Rq(NBm#x$}%q{rp6BFtCl5z@< z;;HhT|Hy#5+LqeK0SEL>eRPmM_3f#%?*V>93pF|+blgVE2d+7;hk^-t6y@LKl z|DaRp<;*AMDRAX&z#Fg2xPT<@MH}gFRDbXh=HWi#60k}q#a!HK6!NoqFwWrZ@&>** zf$SCd6ODpHbX(sVUkzUe-%j5#UxBX%+lUB78aIy{!Fk!O@bZ4ao`=WyQ#PL+1~-q&`~*07*m1^R4w$q&;s?1H zjvV1|tr-fwkDd7{`3t^XeWVexU9xETRM|3F3{EPXQa$vP(xpifEwhx~18+U}_$c#mXd5*Zd;;BxT`XUrjbw`dTKH&6gB1 zE0`!rf94O|R{p{b-D4oED4@WAF2UL04XB{^h1=2y-$L(8&m7MUcc#0CTj?I_UhnSg zj&@h~JoVi01j0$Gitn>8$2W*|v15SmZvfA1J$yNS3qQb3D*&Fd8_>X4fCFv|&O<8r zY1hF}n+^ApzHlUQQf=YylS99P{=|7O9pjlv(BrPlRA3V6)pRRbLSLuK!K$z3@4Io-xWkeM_)zXNceMx`6l~z`EK~6Yy+?-wz6`r4R?}@ z1GAu%UkV)g2%tr)<6emYxAhqrO`QN|BNU%?lU@V;j5COmO=!_%dN%knDmnr8f_25rek%AH1Nkw0EB-HjG(Vl+#$Vy@!fS+pGfo$1 zYTpA!wmi5n(}4sLz=%`>`S<|HK_^iKc#=bK9Xf}vEX+Utk>G0_z+CEVDoG*Uf;}*OK`_IGdmbkpN`#b0EoQ1M3(E+;u$A%PW8h zk%_;6yWfs`!i~ZTIK{*YgTUq9iaD|k&LR20{RRWS+83C=8}Nbn0o0@v2;G(#_kVy3 zp8+D4oCPNy#e@A(wy*#}sG%Mker@)z+3z9basLEFkO%3I1#+Ht!31L(%h!01*6 zYbOs_*w?}}U<@w-N54aO5B5clpg_Asuq`?QJ9!o;{CHsK!+;8`3hwVhAm2|B@jzz2 z1lN@lzrg(}#=rW*MJ5)% zdkm=IFZk3b_*j%-`cI?x(lBDxaWWhWrp01%7kr3@;-vcsT-Vy;&ayJjn{EQ%8wYQU zY_xv?GD{q|A1w0YQ)KRRVC8q?7AXZhtyJ`5FrumzZWqoWZayKSs}VP&fgt|hadYGU z$Ibsm+`PtJ#S!3pfBc8^%@V%>nOqwf*F4Ps>cBRK0At=0jEojQ=2ik~JOqgAIN)z% z5PP+OZEp*H8;h9p0EeqaR(>E}g%1ruYzMaa2e=|%P)oTH7lk;b{ec)Mb0zr7IK z{OMrCTo^v1C2G~QGK4Nr%0q#dZ!V?^Gr=Zn0Oa(1#OGA_7p052h@1mr8|0`~xQ*ja$BS>?ywiBVP`v<#V|6Z;O2g<`OWodvUfMiSNu}0dDG_3wrQJbyR!)H`w?q zxD;+IX9c3GY+OQ+C00|5$vwnwvNQZ5!f-=5l9)kG14A|&)kb-05?PB_LJkpcQU}Qp zf+O0HS(rarXx#^*GC4sg1)pLOZXeTx4Ty;|KuH3L3#`Zvc!E^LJxeaQh;N0bA`g_n z1>vaJ3w~c?kYzH6ui|20L}I}POC}zPGs(Wx6WqK`1jcU$cva2Nn{&vWK%w6NTV*YI zN1TKVevnK>A3g-SHy3?0m$)rn1tQ`cT=`hs1AFn6hlr_1)Ws_sXz>~tr$D&oGy!V0 zGoqjl@>O+=V_*EdB64vp#A7V}Rf3_o$4uP{!iuk8C>#(YO{Ygmu6lU&ENk1BreYteX?4 zC|96GgAuX6fq&fsMoA>T3quBci_aZ_=vx3*NNR?jAf&ioy^VGRV0{PydM*aP-w1t^jcCk3+Zv%YTgCCHtSB8cI>b?IR_Bb>-i_bccBs@|AAN=+_Fu=RIxkR z0J(Y&5s7`kZn6u|^>F1z+#DdTl6QfZ=m>AOQ{oELZhgq*#8F|B5RF>r4)7X(3lw=3 zJkY27JmM6vwGV_|LA?Kly=TD>9PM@Ljoo#N}X?k{%gQaZYP_GAAsu^O7;T>!w7D|2+}T05x}OyoFaq({vK+?lY|>g zgbV27a3KwI<~s3CxD5PS7PQ_S!V(}AZc=iL&mgROji{Sk7qKtyT`P$S{t7jea{C%m z)4-&F+qmEdEsQ=yQ`(=LN`4W_gFU?mH~hD_4wBYns^Ikvk<=%zfsyVIpVJ3{ud(6| zIiDEH--k-Ua7658_J6VWR^4qZ-M?;wn87m0%nWhjFf%hVI=qs2B`eHvn3=ra;&IH}INmA#(7=NDw?N-=Q`Rf%)tttmJEG2H6E2 z2($GeCjyQZKFskm$?cRottX369eIeHN`+uW$aY8r-K6f~Oynx0UY22A&;{m2Uja^m ziozjRIuO#W56NzjGFXI`)5FRCtaJl$r^8B!*cJGG=R(>K^MfSXH}V^z#{Z#fA+6Mj z5l1E2E2zI26g|T6%_(ON!DESc)I3->u2FNH=TQb8=rlSnFdDHt&VQhGAIA{T&j=2h zj?bhnJ9px*(Cd_d{0oo46P!25X!I-N8M4#yhrY|qM@~7aNbt#GKzpG^VC7gF@tTan zeX$_wHkpDQV%0m3JNkl+<07(zyhxXz-ylnAp_S+jdN=hCatRHDm1ZJjl}?fbiZia! zSwMyCiM>Sb5NjzF&P6<(F|;4v6RiNMOe8iQuYm8bAI`!CBU7JjFtCCG7JzLxT4^I8o0+E`bkyrhTE}9)k42fsRV` zf^X|SY9!O>K3EAB4XbP=au*!}{XcKX(cng$KsM2{AXn55Nat^`Bh*xw5tl)2p9@cP z2-*i~m@~jMevV#&d_NBx4%w8;bP{TT)h`;T45!iWVYLZ?YA_vH4Lv&Npg!D+w1aeQI?adqasr(PeyVohvTCHAR5bJ+ zwZYuIk6K90L;@hg+D7?8T1SX=r^S?p4ntY+`7Y6u(KpZqG?;z^y{j{TApR6q`5u^= zTn=k*J<=Y%;7}q}ta(TXxeMOM=U6hNlg^<|tO8Co`T$YxUxGtSKtJHO$i0q8+KrV% zZzW=o1!y`lkxU{-;W`8(cG5SPN<`zFLD}dz&TLj5h6D5U=NUO6LWQ^lFqsHB@`j4c&)%(tXHEq$j$TVnPje z4?5n0=>f1O-HarX7OD(RRN|m|C`Y4FFXRGP@rt0HX`z?Eo_i`(rVG%|KoDt10kaz$ zhiro$=>mA-HBe`J!8&=Kx`14V^`HXX2Rxh@Sby51anxV97wQjn#suibOT((E8c6LO zgf(_E{g`Z|+2}w>nytC3bI|G?{D*E(O1nd??23+n-lxfMu5p+? z0rkQac%!70FZu~;f#Wdx;OwO~P>Z3)`3neE6R9+yb`Z21l?_R*9SDl_sj>Cm{t@@kQ9;Hc?{-2)>70lhAu^?nO>@p|84sA3| zl2gE9tRUOd`9OEgg`XqQ>9_}anY@X#;SR(M9UbeitLO_bEOrDs#!{H;^gziB1PVh7 z`HW5n|6*rY6DE@bAxYX5TzvQ7scoZX!Rgc*dOo!P>fRf$PYQ$6=FX5X_P~O{j5!9@ z-75SI)_^TSwTJ>&FfXA?=um6|bTPEiP{j?xZedYx*d{u3g-l1(M=<)#9TP*o(?IzN@BiK4y^nLpne^7c8Bh@V%TwBK#k}& zER0c$JMqKJ56p9{SXKgi20Mr~f~8^?aL%wUur{%0an!6aKwCP@%3^RCDr`9xfbB!_ z!6mMut`M0(a4NCoS{7SFtafvl`H`uc>5nng@Wha28g6zmjWnIGC~XU^J#8GvGG`CTh1g-Ja-%Ku}~_yC~POHm+X}VN#2UP$wFLYvb7>V@lo*{(R;{3 zaXCx59az2L{Y^*Wp+{-CHQ1stwX~&b3p8rYkd~09Nli^pgE)y*gJr{NmCJG3_Y(WgKnd8b`%vs5*gkFL)Y%ZkaCqSB7V_$1uXww0&Rcmq@ z)rMdLX873V*=ExHZo6xIVf=0AYWih4YK^fzvi*Sj#?j;^$iV+VZTNA<`H(q%*8x zvzcAFUpQ;I4zNQ$6StSVmi#SW<5DiauIS+5bf2ZT>{h7EaXYWDD9(YUZ=Aedw3WAA za2@VCU!yvxi1yfp_Oq6ix(*suOKfvQf2BUSd0opg zaN3creexPHBr{jJ3s-tWVbLR^NcXoTWNZ^|A6zrLE#| zd2Hp?>Zz(-s@-)Ro9DD9XlZ?sB=`X<4hQG>o>g9qXKN$Y{oB)(FmG z-hO_a;0Bll$4Rm!0rF@?XGN}yRx!%`r^j=Tqsl&B?R+usj_$+VuX*LUFO^M_S|vro z1H3BcJ1m*LL3FZvm>F%aG)tO1>zCBegO=a9;S8~4cH-G~)S2Ra5MP`v5lx9fPaxXWf+bKnm>sOC9RP~tJferiAN!rndb*4I7FS-V1u+OX$T(uxwR495O3WKLvC7~rL61jAj^uGKD z-01)1y3n0+@8zlR3H5uTL|uEkFZAr{+EubpbVM+ao6V%q*W^)0l;x`7lD2Q_)h0{r zq8itl4HZP$`f^cOQK_^7t7@&TQGKs}-yEVr+p0`Swl72x^ao@!QO;rRVSaB>h&V+2 zP`p7Rg}Fm7TP)iq+v_sHZKk`cd#QV{XPoCjN)`RjX?vRKsiY8;`ei);8)5rg+;& z;sG@q9l^N3l7oZks31q!EP5e!k)D=)luvQVb-Au+b{pX_NvZcZt*r2V>C@`I-0h?1 z3}vZIAuE*qD=OfPi3k*y*;z zjL$@KEm*5+;G;UT4+sx);_VdJb$mUb5S)8{#C9D=NMGwV4 zr5rg&wo=NFN4xHIb1L>J_PIAG6`p@Q`9A01-PXERcwF`9>XIW;3x)_Ycw6u!L`c84 z=b2|1Z|Txo#ZBDWbX8c*pUMqoy-NC(Zm2-ZpO??Cx~wAVx;C>k{lTxxwYDciu)Fv# z<^@g$f32uS^ifnUVoTB_Ea^9i6`YD{*(R3*iUij$Zq4p7$|K(U{93&KxQ=&w?Ac%0 zT{d34LwJe5o6Tp;fs?N;);wc^o@y;?eo(i!I;%Rh@<-{9(tk^$N(Ph-tk_f;RCBxb zdt-6SC*5mfhV?$t194>(u{LvA{Br`ic!eZG93!@gK8P1f5+w=Z0pcl=1o<7s6j!$E zPq&H6m)<=8Grk_~Clt3m6<#ytUq!wm0e2j0I-{O?Z`)!@YCEQx(M&hWY7J$J%LSFz z(g(%K#UqO^luf9*S)E(+Z^LEvcdf|u+ct+dO^t(I`bB&V{}y`|?be_li=FUOqp4ZQfgyKispG-97&(wn}n^kN7m}B$h{=up14( zb>mwnHxYHKtI#rSX>nO$$(o|2g{j4*WkgkyYFVwgF;z3kxYCLehbcAonZ1eMNth~H zBEBo0CP|iLi!TeG^E&hH@iy~PxH3*B&ON~$$q3nInOHH>V~F<{-_(Fmp9$`6o(p|m zxEIKNhSaTj#gl=YiKF$Zu0_dtBy76oOJ#dyGYobcC7u>Q<{m8~>?Is~S*os}w2TUHo@( z&*EPt=gOih16ASmPc^D+u@4G+ryzblN7v(kFP2id4eaJ0e!jwGW?_hsn4nb2KIp)O%FI|#) zanq{$uN7O$gq8iuStU1$y^CW@M^tXEX4TZ!ZE23t^fUZry#ogDt0;#}^Iq{+K|Nfc&6KJ4K{B*ZY=ljn940dUv(Q2T!hho%En+ zkD!2)ig!nL5;F4weY0k4b5g_5nvUgjN{O-~rQ?f-7FHEKD7{nJP$R4zSHH96d0V8V z$UcFbf=078@V*Lqi)M>Af*E(eBt~*Tw3qM7JI_18Q}S+d{$*=;7sQBcs;p9;>(<$8 zuTQ;ymfuj1y&eLeM9&Bp;8qJK@!S|Akpa%@mY#a6dUC_o`gtn4paHL~Y%hrquYC(?!XJQ}S(D{j#k&tMbklUM+r7?o|0UDYS#ky&T(- zxlAKxxA1T9B5!x$$fKY#Iw2PEKeOjEb|Cf6$M&Vx&X&1gtQu=KI8Epoc7iy^^`++x zKY3_e^y~I(JMNAvj!;MBhusJ$@E9oB&u*eDW|ihz!`4b?p?^+OmRHu1-@DUl(o?g3 z7K|?mE;CoZZ&_*l+xDLPi#0`{7D}W&U1|5f+=jZON`FJ;v4o>V?>Tqd)TW2}2ra5< zY5lF4)^^DvcFNHi?6uP2-j_m#M>69YI!^5=??1Hf#!m0!-b5D$1$jow4l;~ZYm12Zhs=b6#t-7-=q)AQT=&TzQ19*{+M+Kc>z!1j*^^L#JiWd$=!IaDJ~l6 zB+&@YFU&z|?eERpHeGA47GcZ8)=AnaZ467gGXww0doHc=U&4aY5r*bWL@j%PYqz)Gk6>|Q5!V^vZ=tvB@>8pYL}N>3E@{BtjtpLIQJ zNsct{RbfC$&x+NxTbuf6hnRc*&v={uOUC`g$uu4QD*!B}$82Z+MLIP`cl8 zjZ@$x4yKF(=ek6YyF^~X&pglviC{4DwBf_#O~?L>ovOH zl7Zxq1tSs%4d~c6tlqc6^%a-2>6)~ajd{{Ex9{z~E&phE_xZi=x0@N9!npDUwd-43 zEk(40HBB_wMdA9x6;X~+?sNMg>nZ5SF2pOyf!0?2?iT;Xs#;Zzn`*GitUA#^x9&6k z>nKD{a162_uh_uqNcWDBJ?r~O`VSd6c(8upkbWb&l!l_(A<3t<#bV)P)DUZjuPsWVauRfi70@Jid_Yf}L{=uq-mHZ+Txo z1y;bfb$#nX>en@iG=tk(&E1KPSODj(V5ltCBha@;;FOT7krnL(okw?B(7CeH_D<(I zTyIwx-pB1HE7W;R*S=vu&69$#%&%!)X}vQZ=3&KeD^)eun*GgV$T|2o?sr}_PcAqk zaN!qo7BQ@((#9}zjq`MgEy>Nbjb9sAKu6v{y}Mz!IoY~QyMxk3yNv1CMeo=Yl zp*ns2;g@?%iy}MWhuFlnatn1v>zG#ys0H0s{$MLYc`nK&M%mfHHPzp_mp>(+XTkr7|wSL zp=J{ic8&F>`Hn%ZAEo=Djo0qb`s!EdU+WQLq%{TzPB*a~-Y465ay3f{q zh!@Mu>mhldNOf&-nIQKS|A1Aq9zEq4Xj%AwjlKB)qhqg!v48hJW1kFTKd)`4Zbj>i z)@C@bh-y8fZ8MZvgv5Qa0|hAx44NpJo4Kp`%X#gf6Lgs5uzaPf+@s!WP~fca?1=oR zH__vwr$_lj=K1|4eudOq!dl-o_*Jbd{E!=zeIct`;oQm>4JTSQ=vnr1lx8jBXYpoo ztJvRw_;7;KJHxG4wcVS|&7IZx>hY~TH4+`ebk5d5vn zO#fG$2!5%khm7GW^Bx@17P&L#XDl5%H12lX=E&a42h0}Rp4P!N>e8PDjX57PeKU)5 zb4oWfdK<^slBfghxq?Ze{;-?Xa^KuL7Xob{#U4Xe%j(00ro{25`owx#yP?rg z7hkurdPe1}s?)WzTMCSWoEx#@>}`C3;HvPv__L7Dl`vB1Yec$zy?vkkCJ{#MM!&F7 z;VOBIvNm9B)UtLvI&4WO>ELMZ*KStiUiXevrDlD#+n?<@Eg9W2-LigWe=k|zc;5P$ zB^S++2f9VNHc0miFLK8t>4x>qv#QCm&6TSwyvjG#9BJyO`)S#Oq;qBongmXM5#P?A z$PH&4r}{b;Sf7}eS=Kl<(oZolGm(2lVs{nz^b1}Su`jk;{QP#>xM^{|Q7?iHxkjV$ z+Ju^Ig)zDQ**CLx=JqRGTH$E4822Hq+>2sLs*tsaW^zB^n@NU6t6QjkUq{qDs{P&& z&^$qd8#Lxf$6nwJrZA1n3}y$081ITX;O2QK+?XXn&Z81nvKR7VM6~q0;-lx8K)3KE z(cRl;8h+{dd?Y6)Q4agL@wL_Fj6ynLPgzez=M|}5oq}dW42wJ5{(AiUc#n8t+`_0IKJA$- zU3KNVydPN&nG3SWya9!c<&T;QZ4tbsE=$~pdfap^kWS?Slfkahrq>=TUH4~0;hM_F zwcI9+PGnn4e`I08b5cTDB<#vjW4GuqC(G()5*lB&^)z<1HamHY22Q46qx6Z(EBCJ6 z(tyhmYub6Wk8Za(dO&1YWXFhsZYIl?x-Eq<=}o@_vUGV%D*~(AHFPoEVkEhY@EYWG z)?>4jWDO?&F>lvq)L$-d`ExX{w4`Um;&HqRw3(1whZ^r1 zY7EnjL(PRYumoW1*=~Y3@eJ^5#!^=cYK$S6&)6VhV%W)SfAAki`Rn= z=ydwojLPEgDr@rslLomh+2+mgWq6*KQ(O(EB-E zMR2;$-_HBV-T~YryZw$i#29PnV;pVS0k_J5SOcS&GZea!vP4g$U*+kF6P}}j#>Fh| z6woC%VMN^H$gM$71TOl9veg-FU*CP{_tTWutL9XTzj-;ql*PqoFpGgZGnE6+mMgPnYZaqQHzzD_> zR#&!z^NPZNwxI5>^6f>og7-z+DknDX(p|FwF^K(ypC;4_i}=0S z53$|UQ^#5BJ5#BVYqp!UHZfU+++db+FhQ!=SJtEmRZj7F9+DihK7J(3eq&>PN4kaI zch9gV)GheKNK>Uf`(2(}QE^mtxcRi@HM5&ygg4LotB0pFo@FEoj0#O%-Pm%Mf}A{F z>EybM*10hL9{-i&Ke^?8RuGVtBF_n5n}4%8moGUGBmqMvWbwFb~$ zzykZo?#TI@E8_1HzLPyug2w!tkw4`Tg%l#XIw-SsBBt*Xcbdgw;_P<(U|q6*$q;P58yRSUtP!_@BhQ z*aEU7v0`lf-L`nTg%=@haLJc51cmr2@`&xTrNa1B|5E4FCt6VQHNKsfBsk5taZ_1? znMuq&Y_*_9a@{pKU|!6lPOEz)_HgfXEOu?!FX>dx&b*K>vtJ#2ll^UNAw&Jdwv|;Z zS?T#B_-%-f-wqcGHeY+I+?;JsDO7GOJ@8i~o4)IuT z+moOC>F{gu+lSvC=3Q$1*Kv>|k@rw$2Am4L?3XAvVtsWJE4t=3Wh7+HE^t;YYi@6B zrQ&!)WdRDMyo}Gq*4uHTME^mb2G&)%sfTqdxq#uv{~}%^w(u9Q1Q;JJ#d6pQ!iVy2 zKG!1aJMHPUv6rdqrubE%Zf*ruLjnFJ{neG%y}nM&Th{1fU%-4X8Ko2kZV1u)u9J_& z7wJo?juhx~s&g+D{wn7+>}}iRJjy;Vel0UgI}1KA7}R~ZNlG#vXxn9&VESfVPoBWO zvBkVuTnYCsdlGvp`z5EBke19*bn@L0F(%-#)p-{GCWa-c@~V z$x}DDSo&gh9EPmf*BpGo|DkIqwu{AHTTnDEKPzu&(dM%1s$I?fEf4UM!V|LDig!{j z_aeHD_+V97&KRQgpLMeh_iR3NdsZetUeJec;1JB-%&$y8?tW2#%uo3>b^NuvB3_q7PUCT1miUee6$jUQ^%8e+erEtS1LzZD4{hhy6{+H_`c{SG!nQ#BslxOk)qcqDTGIh7ibDFTPT%{;Qpyc*q zu14F?{_J_eB3Y*UA^%m;HJzXK8s6(>rxnp*LF**mEjj7P`=76D?-Xg#C0DgC=uLuK ziaf84!Rtbfc}*3aaOO2_FE(doXQ;Bvi-*>3YBgDEu$jU#IY%)?dX)2=+GferC+ceS zv4*oonR%@}90_MDMVq7t#k+W$@hQNydW@8^UI?;W?)%ro?CNIj^P$hJ?!x%3VY}Q$ zv`xr*oKpX!`%BxGJq3x{?sOf$$z_4(z+j)S8NLkZQYychTVl#SlX*4gPVrV%TC39% zg#9I)C_m)VU0TS#Lv^rB(v8$k(7kUHTXJn&>MNs(J4N_IaFut2GZFWq+f%ntg1td# zbYTY!h)eHg?)|oBO($#2jmwR^- z#W~M62bI+3T5^9B?ypR%pQoWs&6J6^Lh@7cOmvd{m5eiGX&ZFAjomC?tlw;&&KKw> zb`POYyj#$N^9;X1^?>wT4JT8gbX)3wBQB)d^X(04*-4!#qxysYtE4xB z(_WRA7}$(3(PTxu$8R5%pUAC*+id?{f39dq&irgn;hL&Z>H{X5;~@S)Ad>WzTov44 z=95fwmTsyxR6ogl&GrEjvGI5-Yc`~Tr zREIASm;Jkmx@zucia(^jUiabF?~tlJMh&)&|3tdPeS+_O-y+3h_G2s75L1lh{RU|I z^xCeica3%SRahebzE~{D=O^Gx9oGy~wez&M^rXpbpG>*n>8wG#H^RZ9vw|_4f3SRV zobwfZgS}L|$2}^zzTKBDo4bGOIw@gAR6x*t$)uKLnPWf2z3uYh{;v-ea#K$X;m1o~ zxtI7~^$&Jm$Dc*)Xo@Q?$eEctpzuOv$Hp|>N9z;h0+Zb+J_Zi(ydY?GSep_{67%-tO)ctBb)vfw5Bne9Qz1_@N#Mbq23^eKdF9Nm*eLV{gT+5AsdZ}~bT9Tz!jn#39r1Q!!aw+55JWd#$@KU( z@>9RmiGK#vJ~k%OB&Sy7qIl+A>$yx?#@J}uRbNqhsGxh{UuAK1wXHXe^Btox4sRT! zMzT2Z=oR~CW43Mr%yewC+NN+$N1ItSyzin+@p<7j-ZSP}q?qI)JJ~PA8u#15$Ku9z z4C^!_VNYCWq%_znzS%M%ckK_?FW7hY>`^MpLPZzUA3@zu5PDw5%P*%#19uP;jd@p5us-Hwnc4)#s)LjcEWxZZdb;!g9N9=6`~u0 z!<;ktCFFlNu)=MMRKISKcjFTi+!DUUOJdfB+T2!Hg(b?gq|d3}CTDf2$k42{^+1NP z$BMbi{yzOZ8bqHcrp~9PxcErP(ejDahw5%Nh3H?|2^8aI2yB8woCXWA!yw zu(oif2<8Z;a;!*{Bi4)+YCy*_$QmhEKa zS)@(G(R^_EyQ(xP>L3hjA z6TQqS;@9(fGrLl&;Vj{o>3~H67S-d{JGSAZ2HOg=f?hOOBXqOYmh)D=r;x@+evm`Kcf7;XZF}a@QrRr}+g+q&Rg=V)wo|_aa1;=TH zA-wT%)x64gRhpWQb&RH}*1je%sI%C-IsCrtyGRIe$nvi_!aCX79jwfUEpr_}5@nv{ zO%W!DZVS3`3z?00DwE_ki{`m}^-2%!ADI@tIu2`RjeQn1I^aHu_yK%MIu+u0I4V)OUSS!+O=58jea-`>A$X!$9>#Lp@o?Y|oG3r!$sO ze)et_u62v;r)`ntficS51JdK8*#d!5WDo>%7qUL#e=r}0g>`^`R=V2bd%)a?^w=)( z|FpjouZ*b*kMI%DA$2i|{? zL&&%Su7o(|5B7P!O!CxyPJml@NOYH&Eiqv+^P_r3(!r&Y1-8(JRfS8kmS-j9xm2L_ z!&@?qU!4k$NO}%(MDCK_%xs5Ae?q;sVPoxHRitWb?dwK?_LW&ecEfwIo-t$axpYrw znj_iX-rm{1+O`~e>>oQk=qP+BYZ+K5zq6gJv&=FEoAsO9Pdrgk@AW5$j2Iq6#0XSh?&G*fl4W|_*h zPSMcN^jdSvyon~5+(8Z)wP-=Rc!5&x_=tyx2~{YXbW2^Sj}CBopipjcCehXrrAc@ zdYEq*Pgy2Ad3YQb7lw;I@!dIlm_E2WUd4c~$>opQwhoC-JA-uW7d-N*g*s zG0wE7a#L=@uay~^oF1k8#u-{q%Qs5S)4P^<%yjh>ug4H;OKVcY(>e;Q@kZ75x}MEL z^jyaf^k3!&7BC0sW}=6^mt&t}rNhhaXAxSJj&0OlJdSmUy@h>=>BU%!uLD}abml+Y z0{9H0e0GLTi@qP*BlbbelIZe?Z{d`8Hll0XTCyUWm9;qcP|5uIlj`xh1=g-ul6bB{ zpkT=!urr9Kh7qk7)UnME8fMlttE%djs!tjoIKq(8cn;P~KP0<4%bX*qHRK9sH;1>) z+dkj1&FKf(@K->eeGZDD_@uQXi1VI(;#%shibyRT(ZZCS{nXaa80Di6iHlB+z87&bygBN8G#MTiKE!V>YrA%7bsgkqeiR)l?pblRCaV5n^8(8g zR;{SLq)`~e8Ho?0M7F`Ewzea!hB`)dpDLSbfObK;Z)eV7?nOPE zghNaG1w;}XAtvTJPTGe#E|Yt)VAe*+Us9a=e4b>etB(&iXlqzw18;5v@FqCHoeUEWr9wdh6RrBZgKLA6xf-Xh0s+(iNt|2C(LF&&8`-dWPxX0-6@ ziRwSqLG|^`QCb(nEz=PzkNAiDj(o+xGlt^B{zJ`%4ow!xCaZ~m91gpO;|rk&FF-AJ zAOD88FjsOv2*gsIi@@WP_r}06;hm#)#~g~j5;Z1ba@ehq8(w{dJ)FTU+p5o&C<_)8 z_AF^DC#r8W1{vU5pDBbC(;cWhBd~kKG|OGXM$NURmv#B7n7Y}GGg^1G{WPc8M-%DJ z`P4tqQ!xt5MGNUh_)b_(H>b`yog|zGoyUk^=V$1k{KdG&>cbXtXYtocdb=O>yBwyD z@{Vc#lFNz=1PS>q$c+%erJLk!#Pn^;r${uMs<&oMjj6x9B^5bYIUf` zR&OdVEZtUESd?2fyUMp7UT8-!OUl11;P4l+H^LtDl0CtEO4r;ZtL0W7swrr=54UPP zO*bs}?IWFYs48?dL&+qumvnq>J9x)qHnepK4N>V5MN z>sy4y>^4^m!%<9j08iN@@CC5RT-#LRNbTB|t7>V> zQ1yIuU`tucbKOkiGs{j#BB=y-+;w2j)*@fQQ*e*uICnbOjta*o#~5N0vE2EAibDgL zmpQ$8A;JVnnJmC{l1GA9fZz3iO96WWK~EoaIyfYR9g-e!F^Cs9)g_g42aUIw4R2Z# zYB=S+%A-r~7x%B=H6*B8bjM72=FN_`^nB>mG1Fh2zShpB8*MMNHZ7vnv~+46()ysa zug+v>Hg~i>vquwJVla7;ng~Sb4oDnz$+;L@woi%C&S#JbXaJx2NqQG{iRr_=>;BfCTykv4%+th|pHHjrbe~$gBF3KyPQ=Qc8Y34Zx zV+)y1W-oRP^BA^(nrEvrcxy5nd)BAae{HzgI8pso^H%@eG|b-OETA1|2!0sbhE^ka z!05g}o*=f`vuz~Uv7gzlIeLJ#;R3pu(ZcS*w~1fKN4w4T8tt1Fpa@O~)rBKr5R3{d z3T+5B280GGydLuIlLqr#&7#JY)ziu+l;)O%lnt*m)vwbvny%VXoC;u6oIn$?%T!0l z4D(Z6&()zGnm4}o^mpv-3EuB>x-h4*$)Y#3u$2Ji<(T<^~pjXjq%QpQqOw^@l zA8Hr1s#?0Y2DkRq$_z@2!`jZ#$(il^NG8xl(B%@1rc>TdHu2iA&T);n1YD&y=sw*_ zYq8txMBZ>X6F?=Nau>JJ%GutheM)@q`F8WW8E_+Tdth=P9aIuDKG+oa)}y`fH>;K2 zU^N-Pwp7(@s;DgaT=J|UzdE!bqls>b*S8op+n9S^hyOdj3a@3dlY)BS0Sbv` z({Ig%f?XPO8AJwF6y{qffR%twFU1ANfBwBab^w#m#*_O5D6Xq@E z5@W6LuvuWXnNFG?nf;+o+i1KnRhiHPD4>pdiKV2)Vbyuyaz1(PT{Lws6$I$oH7aLN{53NgWv~9H2Y#d7O2G-OGN^{@$^SC~%IX{-#R6*v$Y|R0};9oq`R*dol(v z^I1ABU+`9#Fa9ApDLbslbbAY3C;L66UcJ4dy?H+4dQkD#x>RG5eUQDkeWdM&X}u}hc*M}%c)`%zc2)aE zvr3n(A7QeXQOj1#CQA?NDBDni1e;<%sA&Fjz6O`rJL)NLHl_i$LJ53;QFsw^8~YsR zGOs}JPP9k*-X+^j?zzb;+w+yzP@nt0{(kQMX@1@O;{E&h*Z2v1S-`@+#~;I1ktLSS z`o-$3rb+OgY_IrQJ*gV6`BS&L@s;|Xwn~4^aLrO^oo9J(S#Arp9kaf+yfQB~r9Rjm%!)7n#Y8<2CXJ z2?vPgiQ7qLOJjkiEOzVdHp;!qW2o|)@{aPAr`c?{R*LsCmrW7sb9c7|a zFyUnt>-sg{ZM@P@Rwu68P+MI4wed=mPtyp^GTkLDTR+N>VJbHJTR&QMTgq*ht-s8F zTRK<{nBy%MEho+CrW2+h_@qVFQ`UIsTzhBJ+lz?qkQ?excLyTQDXf4I&f3lX#W~6w z#;+B4iaf-trCnq{Wv^YD6q8)nyIyg<=6cMn%GK3%u&YL~N+EL{<9b>F?Vgg=B9uRb zo5n`2gw&iUdjlE1)%&C?& zR;~4neY|75V~-<{*i7tpsO@p~2;Bp%8- z#!2Vy;*RDO^E?H&L<1yxDJ^><6-w7hl+q&EF8NhCA`KM37QGYtiZ+YXA_P){$^0kW zhwLKGFV=15JH~LdEBVav(ecGzW34q+7;O3*dN&Zl@Aj!L4+ z*?}4hT!b9(1ku3jSPDeV+xR<1B=Z`>o14O3!M)CFamLZvZn6kW{S24&oAiHa zUG@L8t<<|{_iE1SO!@}nB-0PmH?x-|(Sq3W9r4aW;sUYS!FPOi{6nlDE)!jeOVB*= z+5X&~Y+vqJ|WMwwtLnmHk)IXgR&iPbRrrY z8yvwvCA>}ui6EkpcuA1tMdBFc3yc77`W=voNHF;2B5JG^4+F2=8bpOzSu{49eS*Qo zPOvCO0DB&*l{JWcjmcr3W36Y8W970X%ofH&+`y>BzF`ZXkN$5o4%-2QmtSD+xDOWj z1;BmTLq$@@$wA;vA54y;8VPqGfNXS*rB9JG@Lx6L8^;ZTc77t3I-8wG97>0Wvpo?& zlsXfrR%bNnO+I#HQwl1OzK(Q;p5-Ah`CJFONk_68bqD4~G-9I<0Nv_6I+)>uq4-NM zkhEgMnO_)z*f7Q-d=kDHabQdEt@u^EJ2MbfW9M-2-s8)VFzhJi0WRNDbUii-!+>UT zfNrK{qT8UqR)QY@%F;+G3HqmRBOih87lnMpaHyUB`Hv+PoGAYSL1Qh0I6AI2TxpeSoua z1(^cImvHnDkS2apl~AXq0yFOr*jnb$GN6xG$wVMxHGu0Vh>oM8fwnQ3^u@0Oqa%P` zPAx+^QXl9HFtSFI{i!452Jk?han2>DJD0)k(vQ4GJ|R%(p8Z4YA`z#OI!@i!Ay1&I7t+c4~1w7@F+R~E#WNQ0q0;+MjPgYliF5h z6jlPf)my-Jd5#w2LGX;+VRXYEBY!h*Qx#xyQldKSFBEucz)8A@tC7tN9dZqPVE>sN zZO|kB9tdso$ob&vu>&>HK{+r#;AAZWmRCLy#&UodvlWqIJk(pli@Ts(47w23Hyj`+=OKC!ssYRY2}o3{T~L zI-eQ>>@S>3r00--sEuH6982yeg8-7vbb`^)si6GG7+MY^fTNwAoq`P#oys7Xf?f2;()}@m>LM<3;Q-ZNs+F?m*%4MDpOizZA%37qI{A5p+1X zFOfs&No+nX!RqLJ=q)-MlLDQtl3IZ+r)9u}9fd`q&yYx(20q0a$`hy|1a%GF3ZL;S z^@x0cAYdB50+y^~C)lRR(`dfa1v^F>oP((M#2z$`9EBx(uzV7MMkeurl;0WAUg*m-&iOwSQgfofW0KVX< zXc9FGI6kMr>sEoTAhN*d7Kz?oh$!W+6)Czo`WiVd`(J5#> zF(2tb&87Cx_sN&w3%o~FfYYs&W@2;5@klBCm{>Q5b zL}4#r&2^&!(NvP8vw&ZhOmznOP&wqCnc$0`0kpfWR0VyUT!?*ecEHlW5d50DN1jBg z$UW$6G63-e@@#kNF^tb5N`*cmPr{pX8Ms4XXg*Yro77bamtg213SS*XgtP74TlJqI@tgw4o97 zQJ~V0U|eg1dHw_$hEAZbq8>m}8xMOO3pED4=?Fxmz(CHW?Swn_2b^sM*gP_ejKOyj zH|Zg$6l|bj!0FLyItV#~KBnH%48)BLMmh9)Vgc$& zEkkd^cp7OAP@c|^P1H>w`Pslm0!egw17&4^lc6S{S8k=lVdnQje~^V>;_d@X zkwxfrT8-pTr;v1*f0klC^hKl%*$DKkn?SHz3S7fB>N}8U_Jb!)ODnKx&T5$9Vo?s* z5q|=!L(rk#O=89!WXr zL!=FueO&B2oJyuMqR2G-79EfLFZSL#SgNaQ<2-)ayRWg+ zKak(%5eMWc@Gb|1TC7br2aTmY=(t7F4yA>Z2@2F7;vo8(@QG+6wx$M)6Ucv1J)cgd zDNo^|HU`Y0wZx}?Nqpe=Cz5JJl`CWqVzDw66ue=|L`3J>p!7DNdVv9T21Mas=~rL| zeNk#Evp|=MfInjzsRMbp54A`-0nSlPtkozwTWkaG+RoHsIR0&gPw{cdO8yRh&r(p6 z(xs|k0VT-`$?sB6vK0tN4){BE#oxMB098|72_D&dDTgS8591kROk3eCoho)lg=?c& zpY8_=R4YOh7lXNagis-ayG7(Fhe6ybgIIf->?H1^Z{dtDqz1_^lmU!KIs;l*nSZIW z#CkZ{HNiRh3hT7Vf7Yqzzw7jW%{tv84xz6InM6Zz5Y1~-pN0u5_8xm=md+?8JA&l}{r)KlJVFQ5rc6UZ&&V?Dv~|2P8W) zsTDJcO0q{zm)gm{NH^&|k_ir~1h`~N$zSD~RI%8e+Mw(tZ1fkYE_FpID`yiEs73H! zCgh($;v|g zw+GzWES)Hw~25 zzToG+1u4sgYSINMNSs5yI2q6EBhL9^GD;ahd8Jdx))VEP;Gor~o`9nDft&-syvI~G zg``e`pEh1tM$MESk)f1TnMiGh>!V04m$uP^taS`Jfw1SQ=@Tp{zMSo)<@8(B{%`5ykX z)0M^oTo}d5bRSUY< z6)RV$rpgDxpll}kkU2OBe8gJ3*;iyxzDq`esu@lVm5w6TEycZT9rBz+e11)#(e4PbPZ$K!U5d1e zd@ghaNBM^EfZ8IABKym|h~ELi zCT@TLnN7VAKhkyK9~+{mWb?moMEMn;th@3Hkt`EROX(PK6=(i=`5bno8*Javp!Hut zw){Ie6THX)cJe3CC?6<&iJpj5Q;@s8Caxk{E5u!~ISqAUou6Vl9M6rBA(vlUW3Dg4lIM~oU zN#l;RiF}MZ<3hPH-A5*W9Q=o?AiwQKq*L{Y-EgZe1#$c{ZkijwpYEt^rap=e z>Z1IT8X)z@dW#{?(M_eplqh$S zU6h9Sir(UnV6Aos=d%p<`U!BqJTgr;#C>TlZlu@bWmFKI3mJLcFW6nVwO$91lNdr$*QEpQozyu_T9R#HeK?SFk5J7aO7D(%<*WwuB zAv({`l!tH=WbsY61m{p{sT}-y!JoukwYgLa+{W5?FQIrIsZw<~ZkLyTq_v8kdZH{* zte~F%jSAs1oGL@{JF~IhW{{8ML&`2H6;8mHa5H{PdqA{&C(l5h*PED#yWmv$FZ!Km zB=z!ovM+Ix*d{N==Sxk5&f9HkQAhHX$D;|V^Ljnpo(y|fnfl*#ZC_zAfNg*Y^a zvP-eJBUB(;64_)q@`Dv&r`4Rbn$ajc9|vZ5(*#ABpbdT;((T5-75-GKRc?Pm_f^{d8~!ZxY{d z6Pg4%`8uT%QBGMdFIA?&eXNfhMz)j(D|OLXZz*v~EoG+sTuGNlD)G`K+)30#Mf4Nl zT&{GJ6Tq>pMztd96Pw@$-iQ96yr(>Pf6s{dWCiM_(tw^$cBI3ViR8bo00+tOAn=!A z5>P|$PvjD<=qA)p#Ek#0(f@U8G#qP`!WtcjRdWyS5T~(5dnzU}4>i(lP!;W#Hi4Y@ zBUr&ZaHoC@>hySc_+;UR|Bo_{+6dpHi{J(iSHi$gpQh|ZMehi{<0stsuAuIWd49yM zzT^_316e{8lD&}YXTkH}U*7ovP;iIJw-8H@A$lA_Z=@-43tj8B;3O|pD&zjIk->C^ zyUY$~1`i1pq+i5Za;kVvPM151w;{_JBZd5@E72XU1171G90doYZK&$!6CuPRY&?Nk z!OUdpv!m!w>}+ls_Zdu4m8w1ZG6C)s(}Cl7BXou;ekJc`J8(DHU)i^CyP7~Zr+!8~ zc{H&Lo@58ab>i+|y}%>?U0=FyxHrY~*}cK_)OFoi*)_qn&b=T1f6DXJljW)4{RpLf z2lT=o3sb~HVpZv+d`&qI_l;=Of`1@6>M@zlTxPtik^7w)%kJP-a69-(d?$5#b$Rt! z^>x)l6{+c}zMyuiyJ+&%hc#cpp3Km_&=qRk>Z^Pr?_~xsDta}w7S)&U(hxYAoeF3J z2LCSKAusL8b6s#Xa+PsA+_T-6JgvM>y$7MW&G(lE#-Zz3Sv)E(mkz<3K1xnd=Hg_S zsf<$YAu^mpu3rs4Pl<>@5%7<=guEpV9fX=-pKnGyIYA7jilI++(w(4GjbzVq$GM4o zfUB;GSKZ?Js5WzNxS^`*s>`Z&s(jTWzABz7&o$?2a(kHFl$Z1oVdPEJ3I0g0>P?#Fnz`y!tw&Q=+e=$X zr_-f_Yt_k6%XGq+V(g?}si~z7NdUXR5JTY-jEVC zz1N@6H#0_n7CAU%O6axFGa=hdiw*g@%GxD(|C`tX+C+|*hYAY=r@VrDsOv|^NZUS3 z7xSu;=f#_f9~GA?2`@cg`pn$e`p`DS(Z+QK&v8t^C>#;@f>C~%d_ko$6x*Hsk^PIU z!6vhhnG|Lhy^>0zC~^+mg8p?6*d_mnofwYOY$$5CvyoqHBwA6i_{3WnJL~15RF%~O zG+xaJ{UXCr@bENnGp-ZzHe_8`c6iV5aiL!fqV|CHj`|HhkZZ`8$-Z)|@Tbq`dEl;z zN#8rxzsy@oGK#Vb?-mX#DlI-!e4uz~31g15n(TSb0iLzc#Jvj+67R{2$r zQJ{9M)l5}aP<`Wgt`ajDd1<;7BRquC|FpNiXQpeaW17uknP)C3jW$P{E0}wk-?J;IA^g-_N?>q&<(W{+al`TBID^aMr2xICSfMKpY6={WcM&F8HOG}Z6pgpXs$~< zR~o^Wtt@&|Q=yH^M1?;9&z0Te80s(`$z(A#xC(q7RUfrpvrl_Ye^-CVP{BCE^vP5q zWM61{_@?kCVHGipc~*N^(?F%>KQhJC9HphW*FVTx)$_r%($Uj44NrPRaY)hqLZxtV zacS|~;vY&zmyWUwuw^=qyKj0E12cku3z^aZ!b%MSGp7pN2u=KH?hqHpE8K7{p1nsO zrb56O4rO zTZyx9=lKxz1&vnsqyC}(qF!e>Y#3zRXv{KdL*|<@^$yK@)m{DrH=3o{gLEdj4@CSg z!Ha<=feQY!-k&|KT(up&ZM=1^rM7jbwUaFGv35*P4NuUnq zCeP9yW)LDreYQONob|Cq>|VA#8^PSA;wUq`4?mHo;CZkJu4C7*y6-A|h`~fzRI~4( zH+}*)s_A4^(8YhDyV4o-aJV8qVM5sZ><})D&*8@MNBH(&Jg-#mRWDHAR4-OHQ`w=T z+0M>l+ptmWeWngm04@3@!lqP3e!5wjA$Ap*-~<07U!HfPcY;^#HG9r@c6hFMyq?iG zaxVK?`0x7r2VMpy1uFOjAC-_yq%<V8mFG1X{Ft*y{!E~cUjj_|Fhnq-)-2Z z@2hRCe#%$iHC!sYjj2E{f>&9X)Lobw{1%w!ujc#1v)r}B@xiv!IvJ|xJSbD!T1Q&< zTc_Aa#|qb0PaEHC|CB&+@Tho5o6DIoP97t( z$iP#i1Mf+Xo9H(9ZREnYa3eZp-JwukNp+>W&@Y*LIo2o9F_WC0!0 zW>5+AMwZ+HtE)3s)pR&@ZiDaKYxtwZz@u+GaU3bS#AhHu0&@;dn#Zk<6=AvM$w zR0FCrHIsTyMZ+=l7;UGUGmDwect-nJ0-5Uq?ke|{E9PEv>$!Q{Y_1ij;quu%*q8U2 zw#;?93Vn(Sr*I30Cs{kVXWWu(@Sxiw(89u?9M}-39{B3t=b!BF=uh)^@(=LO@o)2A zg8ryNU~1s+KxA+PyiY#`+Q=y5*4JF2a;N&GCtKy63` zw*=Y+jDZsWOaF2I9{*0b3%~Mf0xbfo1J?qX0U}r#-mTYzdVG)5aMz6$+ljNpvmyyE zgk4gmlp?30$G#1&vh|P)KS8aiHykQ&pthb$&VolqC2B03T5nP%6isXBI&?>RAU%nm zh|e?)PQQcb1yIUdq;u$4rYh5v>B)>?)?xSOF+5v_{fTYDR$#r%V`dY+a~EiAF5^#z z(3_|TIQsn?<}y){2VwN*bYVS!NAo(P9Qqi z5vs2v!JOa^!e;2kenlRiDaK1p;A(t8%9AR?ePlK&5YN!XkAS1=2xzAt!qw1${(mFr z5|-iA_(Eu)j2TQ$CAVX*UngI}-OY;iW%i~`{|a};&4d)tjJ-IGiSuTnT;qurE*q>ck3$vO@z%GrU4^Sp*Cix8Bi$5!?Lp%< zn({y}A$S~qzE=M^{{nwce`|l||I78Z=fCUi|CRN&8SixqR6g&C$xvLZz-6f}e3w@J(=aFdeSUJ>hda32NR$|8ZZIg5{x7+%MRK4&ra(Ht`=ZM>I-l z(roF0WQ8AdYk9tW7_qJ`V%t4MgimHIq6@q?_n=1{j(>A7IS2mTd*M8s0bh?ooS7QR z4>#|7P;XtqukT1d8BhHL*XDK9H8>_G!L@ob{e`Z~bc7=9AoGOz&RCgT<{`5mclg0f zGV=i1uc5SnJvjw`(>yWmt+1b^=&;Y;wZ;1;N4dqF`f2iyTB zSQpV?3Y4PmU|Ru>YuH6D%&>KUg7LhVExMsh?+IIpu>LFyxwMRlj$luW5L01!sL$jgvMy?Q&2hR_R}Mi(kSkS`dq^{6 ztN7Kw#P1KZ4L%Ph3I?&E)IpplI)uB>(pQD2iXU#}H-x2#ZXLu7p@q0WIwQ4_hDp`s z15yB5+n3TqsX+Qk{tE2}3xCP;sI~5aV*KAMvJLL!7Iez)kq^jXoIb;-)>MFu!0D3> z@88{Uaqfo5P(;ST&-?^(oVoNYx;FDOP8bPik%9e%ox`q0B$&$nh71kLL8cL+U>b<#}+T+b7k81LYv``~SS3D^Lsn?|eT6&@u=_BfO!fcs6yhJ`3T5 z+<|<7UM~DBF>`cS4#7FU8r9MUQa8WNcONqYMZuqitzwc~46W;Eah`NiIw}UmpF~DH z2%YW$p{zJiFbntKbYEU7C-ss0NcW}1Qgyh)J`o$hDRw@p$MM)VkMVxKDlG|_lHf;` zh)(1kWS#HH1EiBWifZdjoJV!23&db@1?tgf$r@xmvIVt}`iY*zdVo%hT%x(!_)->oye^-f9ir14@bsxp82m;0;X z*Grzt$S*g-ll`Gr^rZ&I1~kEK0UK_Kd&I@?tA8gIh!WP>XlaxbCK<)b$O#rn^(0dK zS<*|*rAMM!oQ10QI5_YPRbt@wv<*G5^XRU}!U1w5*_2v<&%2rV5p%Z;yzGZ_O?VGq z%9mB$ROPBARU`Fk%_8kUT{%N@}tr)qTp<#gpM5E3PCa(~sD6Ip3>{|6C?RVWS!w_Sgko@ot(LyYh z_%vl>>XFpVsdAa-WeQWmQd|j9hRF);t7;oxRGj}jJ2i9Ow+)}Sd>HWF`t?};#-c}- z6wfSwg22ix$z_~cx5zlcxL!X&pQMdLO{EOuhx%!8An2ay=w(}NSz^9pIc59ZzQ|tI zsqsAUbr32m9jF6LJ#Ga*g008Ls|Km&s%G*V*ga4r-jwRViJMuHLD6tBKUxp>3b14b=uTy|oG20_`r)N?&PrYI^G4Ykiv98nbGN zY7keRTLSfGglG>o3l#d2z4JWFJbup_PaoF_cXzC$nm*E3-`_s4K9CaJ5wQMu9sNI8 zM+N`0j-Fv19ZlVsN|#+)COtJf#hG~7Fkjj3t!RDw{bFu%=D4rJKks_~^|kUc>ErF} zm-%AJ8rN~(wqTq*l=7<5OaXW$)Cx-ui#L5#H{{oFE9qHsz?W+eF|R4QSrC=~sbFK# zjN*MosU^*=W1UlcdQ1}}t1fB`+6|g>Iv;#S4jC-EAJtpwy5cPVch7uxi7U%-%ARb0 zXSruxg-s$Jb!-9+YI$L`xom6^8KKXV)pS8i?y2PvzQLI z=?RpLeW!^xb~cd)hx#>_M#YLma9gmEZ>m#k+f_OZ^|?!>H?5KGr@pg+&cSzL7;%sq z%kELl()8B+tg6eJ(Z748XyjeuR^g2Qw!5)YaBOt$b#3+a4Sp1|rOt9VF`AaygR0va zoiu1Y7WRIWOp z@{S4-W#-3SVy8N<6rIT^ct^ZVf7S0*pI5;b8(t@TWb?+`H~Br}b4_JkU45GIt7&;y zM);Mm1mjD-IXOJ=)RAthWy>v{T=e8SU$85GRiV`^I88!JQqOE)r>T}}x@zm{?-m>ex{`&`NGkuWpaoyD~)t7MpP34a; zKhno3BfXHW!OW+>QOjr*Gna93bv3Q@p{C7Ye?@kWnU*jt^^fx9Do0dRSM5`IcZK?8 z>cwBx{1UiO8q6I3q0-yuFQ2`v{>uAu!keid({kI{9{Dd&owQr@osCaTXG0!`-3^}+ z_R-LqPbF^oN^H$6XU&s}TYt~ZpO7~wFXMY_O9OXpsROf+pQS#bn+Bhxp{Cv;@y52= zhpb6C?(gEM;(Fo8vkA7EwnwEKtXrJ>-MA$vC+Vu3hl^C5P}Kq_(ylqB8px;8QeCWdc~svr9(VM)@K6N@){p z@60MO6qe+k&*@RP#Jbwi%GK9%)OR^}LRrDI*NihRG8O3`s(;`v(zBrGI4freYX2!$ zsI95>to^j>7^d-Sh+*@J6%?n}Ut}4ZY!>)}H%5 zi-1ldb&|QqQ1FaesBWj*Yj|f|8&W28X6VSU-Qh1I`^KcjUWyqUdl^%-uj4w!vk8^s z^f6q-JyRC%a}Ue6WH-&Y_L=(qUZXYw%Adoj;}y=-Ox|GpmUE@-C1x zk^{Znn`~PwVdnUfX6DO|eeOG+=f28;nL--$2`!nw`CjVoV8G1BTzMB%xbMiz#Bo9o zFl)BD&buf0rv)F12APy?aJ*}!oFxY`gL#RYNzZ_8ZK|je{lQXUJnE{aF{`!OUt5?Z z$5Z+2F;FzGb1k?|d_DCJO$Xgz{Ym|P{cU}~$b~)*e-za#CNZ{BY)0(+xR8Wz3DF6? z<8Q^bip~ftW7sEDDNfC+mi6an&8MPIWxjRKEX??py`a$T8cDw4Uui#^^rk(Ub==R$ zyS?;AqI>YB^R4A$vALj0;ZpMtwmNpZ!|ZzFZ2;%pFHB?2QvF(8oMxA57~hWFLHDN? zDw$wPjC2mQowN^iX1aEG_IMxp;sc9nEP41xTnD&lgQ%KFQ%+PjWFCysZnQ?K6s-(rq!Q{N;ti(!* z`{G{2^o?v1K3I3x-6vPdIP$6D`<WBy!ok^PW!pF7h#Cr~QcsCud}!+ukUv6{9CKb`rJY6KO9 z0sE$lr!0bfpkKJm3Pinn7j^(J>fRYr3~TVB5nacYr17FqV0Fn?r5^wXH@F;8Mv#&(RG z8Sjs49_NYa5ZxkNZQ4YYSi%dM+=TOlbDpLC=12bH~47UtUeP=8QonAdDsRS(S%y7C6vaM^I$SSF+-JRu?<5oKb`hUn)} zsZmvJURCC5FALX0E6EE*9W4~cFSyBh81_paPgUX$HukH9Jh>HppKGD{sP({O^({IO8_05)XlpK&4;FdvxlTFWyAJps1#Sn`!nt4r z;huOwX+^uZikcMl8FnlE43m4!p=YV5+?8I!O`?u}Tfi=ClO7ZGXayBy6Q+O@*pVEk z{;ZL7Z4IQMmhr7|O6V^U4I`AOl`#!tnnkaVY7liLIxXg9)M)r*UJuopu4}#tZA+=5 zP6g+)+hrfl{hmMd`-SgkiYi-Ldm3R9DWB=e-)G+u7p0X_J4q#F38#FK&LrDlcvs!G zCcBn`B;fEG{aXSL#noVeon|$BJU5M=ifPqyl$B(tO2lUI2jNv?1?6$rZ9IR1;n%@_aJBG(07uV)&8JUrf!6UiugJ z7|Rz+t&(5ApU(fQU}!Exiluv;s-oBoS z?l|{M?>%3sx0zS*RQH+!dEx@4JnGu#Q1K?vZ^wKay_MO6xyo>9oDhosMnAy`>W?8< z?Azq~#s5BdSURX2A^VX_;jEnqJ>O8K4wQ;E<%Zl(a-gblk1$g=pt_5Jy4gx89_NF=b*lM+c(%M@@-*9q}}*S!gjk z!h6zYwahKK`2F|1?EIvHC%LZNoB3Nxhq^Zg%82ddr%EdMgp|mam>7IPjUu{;EB%qa zGTx`|TJGbn^)Aj`&;81M+1oo{7OqIeauc|DZ=fzx{n35AgFo?#>_pU-H;Qw_D?(er z83g|&cs4j!=p$uFz2)C99Wj<{NHwIUqbfXA$&e4p!%>$TFEx_(i{-=?nB2aI+1I<| zLCjuzX_lGBEJm)qRozxg>T+~F4UdiYLN0~Y4DT6PH!>z7AtEW_T==tyClOO421RrV z|08sYDcSInn&z%-tzqp`viQ3z|7$_7f`q)ZTwnfib6IZz-eaHtAH2tr-V-(#Ja}(@ zKav+x(4^pG?&aKV`EN@@Jaq7ha6n2_nxVH>jk-YZhnsaAIa<7dPMgKI*jvXN<2mnI zgLfI?Zs=_q*aq^Q9v!tFN*B3v|f+zS#1tXWJ<&jq56=n_Ngvp!D=t^s5&zYZ*85J6o4Mz#ihv z{6m#Vy$wFFb#;gJRSjE>PeN9P1;g5gSBMxBnHY5|vU=qC@Drg;Ozn-&bPi^g>=$go zXkQKIC2M8tEz5(_mqq^+rI*HA{;+7Q{cTkoHC&xMy?iD94&c`;l+%^ph{fbIs(@-l z&qwd#Am&_NDutMV)?gNY3%bTm^da^BQeP6Zf=hhSej_Su*})Y;Eqt?O$VI0?r`#Of z_`flGQlG2}ZNxrI7KdY6qphNWPM3iOk5O{vRq`^~j2(MJ(LpU_M2Gked7DZ@cm4#c z;q-h>IEJf{(bm;1)9*FZG@4A&Ap=62h1G<{=0R1L+$(x(U=^I`QIck zPZmmQ>52GIiUzZwrC5MoQZw<8&`O*n9TLyL2fn79q>RQSAtu4FO5aoaXfNHC*~^?@ z7DIhBf=%O=@@rHobu;yOO_uftxUv@;VnQ@{qoLuS!yOSJQQ47`BU?v|3L`_t7~2`1 z^A(A7aguP>f5)}KmSi(+sVHuI8Wr{8t9Q$ zAnQ?!gfsg-EMcMc2O^Vjzm_`<=7THt%@yW`&o0?RP;Tpo+v zr6@U684Lw>Jn15Sz-fAoY(VB>wqXRcX%jIYV8m^5h5Vbm4rHrMG6#i8F}`mhPSiB& z3bhB`TMf9|TupwG%BrrYb!xZimgsvKCK%I9-%Nc%JR#>pt)W*!r-jxDtsJt%xIuqi zH&&<8wB*}EqZ&^-BsrK6F!`>!>pCCWYFkg3@0PqMeqU6rXmio`qL#&pB^62+n%`P~ zvoCiPx^{Wr_{Bi1FjvaQG)OYFi@Hev#Lh!LsUSKGWS20h^hU~w&e}HOx-v+yp+CM? za*Hw;V#VSubjlVxz8HCUE}ewVw~r~q zwqrjc+j+?y;c~eld>+`MlzOMSza~bj)veRHbf@+A40DVb#(#`WOuI}?jLY?Bbfff~ zKB%6~cjqdxPcYLp1KNda!6bh+SU*!8S+)vRzd6lZ!#vmgy>wRT-=&YtL5suM!L9`l z3q}s!xxR$Jw_pn~h#8w4Og43a5{9IA(I@E*bWh}9A@n&AC9YC2R2aFDI0j8WOLW5A zLUrhY3gu$y85kPRC1g60nsjTdRDzZRMRjil;nn0c=n^S(O6VwfrnHx-F z_6nQ8rE{CPeOybvkRJmj>>X98`m6e^hSVl$k7%dsZs`QwDg7h8U0=@-0S2;Bt7ztF zS8GPAint{1NA^4wjw!wUQZ4aupqX!gC)?HC>9DUvedU~Gh2?{}vpLcH(R|9%%qpXb zwAJz2*~CqHOMG<$X~AfbmMbbj#Y`lk9~q?ck!$vW?ztbco32JbrAAYBtk4aZ3&e~N zW{k(n4dv?ik&RAnYq^&EMY@FlssduzGWm_H1!$Pv~rhl0B#g)H|v?eFFWz z-C)#KX8&Qka}&6gTok{JucErBs-rGcZ`6#?rs!6~iJ3GM8YUVS!F~K^(|)6%{|DcE zh(1DFUUh`q&)%h{5!I!eLKUG}Alvh+%kCI&zie%7nQ4wR&jh<}P3e}>;pVND1J;`$ zItk9z?js(zcb&gW@To9d`hazEZzXBgvzfZM%+1 zg%ye;ecX(R(4*8D;>I#0W--GgYFgeOoPpJfS$NvQTwSaz%F8MgR3~i>y zP&d(+4kvFB7ATDGD1R&0l@pjc&ybtpB>5=MlJ)X8X}G*k4nwUVPVSEPK2DyFZ!Ka{ ztR=K!Z3~wENXhp-Zi$*}`YD8Eiwg8hsPfpMS~Mq%XptKv&;p?_rPMHQhPI@t1w7y`H_7 zZNK%qHN^gh{j~jOM-%5f*CqEekImc7|1IzpHwcwP%Q4Ul4uKBJh}bw98k^PlWSO)N z8mM&i*Kgtd{zQF6obeD>iFJezbCs}h&U7ZY;@rJGoxG)9n@0JrRVL`7r@wUrvs;C6-{s+BxfzKt7N zHB3pIk&ESr@`U!7& z80HR+sU7Oe=yU`%Wwo`mQ?>oHdTp|%iaH&W2rE=GxJhgkHU?a#a+n96Afxyxyz&q8 z9Y^KtwrjC-kArnQws*15u|?RFkn0gvdoKzh0Rr#g7Q2rz>ky=Tt zbYI*H=I&$hJyaY0rCg}EmdFE|+RnOHW>S5}u>Ss8EYG})8tKbbsYtL#d>P_l5>Yvnh{ymokb<@wxOezI)!=L4$ z(p|v`MfEh?#F9OA+_E#-dC_smQQhIO7ugp&nmVUCw>l@gX1MQprhA+D+WD6To&;A3 zWyD%iJ?yr!#3VvXz9GY*W!nX9#71f@<)CWQ+b9M)iH?+-s!8fGAMzu4gy@6G$Zbk1 zrHwKc?|2jX%TDB1Gcb?wFO{P)6g&=juaZIxgVN^Ezf>V|6Q0^?Jk0=of|<&UV0yEE zLqAy=3c-F*X#U9i`CnC`s-~)B^#OG)b*lQA`klIhdW!0l%A*>m>c}5NKf4dxlBq_w zpc27)_RIIAB4K=RcHoS^neVBQR)1IH+~5$k{kF*qLxw}a|n83IaDhLaFUy-uGFv83W~*PR2h1c zO$-Z7ZFi_`k3&J|<~H*aRJ&Cg)hqsc2FHHAc-? zO@cO5_gME#H$b;c2NAcyVpwh%VrXp`ZO8%%a~arueK?gRV)r@bxE{M}dC&P)2O@<&;xWlAS0kcHAMRDJsLAvP z`XJqnt`Du%L#j6Q0{R!37=mfowMu1WwY*gR1E+{z@?ze~Aw8Ac(nQd}eu4_?4rcow z$fK}kS1N0uf9(qm;$Y03{tcCGQ{41+{&%hZe`u`^k;VuNn7p0kpQW)<2TbHOBnFW= z;7}Z=-?3e|e(Xy2M^HI+=!qw&($z&8kEWcan>1!JcOl-(R(;Aa5 zrEw&r8Wz>;1i|CCm@ z_OcIh9&%-S8v82=<&no7fi~(Svz;BrwdC^PlenJW$F*T+q6X2B9!{o!TvdXeTrhCR zx5nGl+sJ#sbJT5i?Qmy$o_ck@&AthN#X@H&nWjtS6&CqVGbr8)sm{!4<~p+rdBH18 z<+b8`Y(H)kcZ>VLxscJbs+lUksx#E%Q?;~yfZ?9eX37d#6nZqQNyLrFAERDIR*Ebi zc`LGY*i%EPme3wh{l?ZL4+y`)XS;&?l0ZOD9O%kzKp#e7$u=41E_xF9y8_hV}E7loB^a}GuZXuse) z>=Qj_-OE7`U+-J$o8uerKNYAa92e{1lx!{+fII?TBBta@QLE5E5k8V`&HToWW=}z- zJc~WdUFPa?zjD)|2uo2PP-)e5G`F;@ev3X^|H*LPG$Qm~s3-J7Sl{q3;r+ssLmwF) z=wtP%nu^>2x(m@-GC?&l($mU$$X?TS#vCjjT|A_CZ}IlxhQ%w3V@ju4F4`VD8laj` z%^xYmfgpB`Fw&QqgY0NL**xwxzwUqDS;qh3clQ4Od}l}VL-Usv5QUYCLW+l!w6z!< zQ{3&nOh6|N2hrm!y_B878`Z_?7wQt#1=S5zLlwh4r5P%Xcp|?Sy9aOk#(AfC;ygCj zIY)DQq(kGn?lQPF?opn>z72t)LZUQIK9A{H3wf2=L@UfD%rlNLeIO3vdPXCCo=Phm_+viY)gmve+K z8$Jh@lslBd%;ajL`g>VJXs2lgtC#Y%xjpP#x)PZrdxXq@;D72};2!H-<>=uE*#FIi zBAjDgr`>fu9eqavtoW0BMR5}ADGRNF(yu%_jlGR3!w_aNeS{*Y3#iVQ$0YF`r62Kx zc#H|*PShxRF;mQ1_+gqHOpnzxH4MEN-Y#lO^op3aaRu?i5-%o>NVLS4i@zH?D)w09 zEyH8J4C)|ha(E!qdCX!eRu}$}ADU~+o|Sz!TgKHW9lM~Y>X za@1nBx$2s_iDrRjr1pxghb~+5L6ypFpg)0Eks|#W?CWQ|>s%WgP3@a)f7+hg8rpxi zA9N(RqCLmFd;MjFD0x1yk@|zS&|&O3E*} zJZ=nCpJqOh|A=Y6*3J`_Z^dcfoq0dztj*q*-6!Wu_U-H;x%~=;71by$wQh8F^F9t} zC8zR*DrRS?T7ghoMLSH(Ypv>es%)+Xn?Ro;PD|H=tuV3H#FOai?g-k>+YZ|lCE(#JR|aY^!Av9xJ&UZ6N?fbCGJXC5seZ2dc|yhH7NZAl)h5Q0+doo*%$;2Q@QZ9wx*GUU&z&Q=A9wXKjDryT#i_*y}si zJ14rUcyoQtf^lG@mXPDoBiYVW<9hL9&<8I-$5qWl(%W!m(VIe@o6tG9)D?CdCUeFT!eR zOIQOPt5gomc0aRrDe3;bb$(P%`>e59m$R+ewyas%{qrIUzZOfDaOV`yZT}td8)!~P zSy44t8>zdiJ*1tZouf&@)a+{ZAF34yPvwFEuk7yO+T+N!ZL(glY(;c+C zhWDL+lHifrfwnaoB7t(M5cN9s7u9f8CU=Nk$1J2)gVfbh`a`H5tPm&!p*cO!KA0?o zg1(-FJ$arP$6tdBq1yBzv_s_Q=v)Dx`Tj*)N%Gg&Dc-EFyEvx9o3=v#R74<~s7uejipMm|xhddfx^Q%YCV>te>l? zs-fwttE9K-F6cgLOVuoYkcj~Iu%TEsIKo%W{l($2)w1q0w=l0WZ?>GZKDBjm{067K zRsL?mZ0T2`3jG&boo}dmsp_GAs;Y+W^kFEZMo^j1ukIH*28lqHZwh$Xt^Ia??cfn~ zEGH-gwUn8{pVQ>(Uz+BI4U8mWdd9s<@F#sv4y2q*ElORIx;v#-@}b1y_zkgRBd_W2 zFcswV;2w9e?RM$AB2~elTwiADxAtG-GGepSbIF3mMO)2NY}t-41Vq$Wu-O1+FvVXIJAWv!6q``dlmF~K(1ddlK6_c8Y~Uo_vcOth_Zv~>UM zdm0oZx1y%fG12^!%BbF@W;GYp<5WYr3QRQgD--08VoC65;GCcKFZb2=UH7R2j^J)M zle{L<>0Vrzx>)WI`TsdUQKq@xK$+^C3=hDLlY znIYIb?`>mCw--Lm@0iPHPtN?FF(C6|=B%tIIhh5TlB(8f&P-3|fKwbvOrd9ROVzD( z#d@Er3#mV3gV@ zkI5iCg4?ftpzCP76H+fi7kwbMMZ)F8*yMI8KcogzhNomCyOP3^;;_GdiLmJ!G3^Mi z*vEIm;j^499+iJ0`&{OOZ_~d`$y|{0Aa_FE?*$EutC}0xM!JUt(xq_nB6FBK$4^#Y z&_?NL{VQDq-6aj7>c<-Cd_@sI1tzd=SsbspK(w zEVo1bS(jnl0mtLo(aU3{`2I;plNY4yNqwC9HuX!&mt->OuY|^NlcFD*{^I{uvV@J^ z;f{d$V{x1B)$2umlycE*OAj<~F=b z7w8|EhK6sBni9(=RD$}jP3rg5S!EWNIbY^^>X8&NDK&9x+?I%R-3n%h9OiHA=w{9> z`m=z~OU^l(nf7hT*T24X%N(5@o1b2M*1F2s&s#6}PKqM4nKTut-KdW=jSKnRwA!#l zS6`FB>zFWdmV81W16EIW=SJ(3(htR5i#8VK7v3p;T{_l!*`DUg@_g{$5;n^TWKHHz zevSGc%|h@81nkZ0d=dMR4v+_k8}cY|Z7|Ef+Gp^ld#>XyFxx*gcvAF&EGRHlRd!8T z!?}<_5sRa@#T`wgQ?gPImF-<_X}L<}O3Pj;6P3Cs=~?{g$R>socBoR`zt=vkG_uH- zUp03{_D`9WziGd|_M;M|X`|ov=8mbISA7LuJy+4lUcgY}+!{l+8&=@$r$Yp_KhDTYP;THO)PWq6&`W zp3B~zIs4nBug||GWYAe1bLqlyW`iT$b3bqqRNFI*Mzu#{(ho4|LL8=@#s~VpwI5aI z*_q%;FA_Hgc6w7>Yi*OwlS{4_eJI>l7*#BnOtoa%dOH2?SH2g)gHi{Ar?+!j^+-)G z?NM!at)OnJTF0$mR$^vXX>rhV4BiwW{uhR&+#ip|1 z>!KFKUQ1|)l^0XCX}MYDdX^)~H7|QKb!zhSgtQnwWWTBpnH7BNWGqy1neX3nE9NMf zAHG%jI`eDaZ+kL+&Hg{wd&{6WwlG|`y?fkXZ~}z5ySp24cXxNwTZ6L%wX0?MFPb!HN0-%_n}+LzQdP zPqnQ6o1sMiKvzfGN!5zp0EDB;!sh_x8{l5($hBFm@s`#_!wXXjV~gXhFKrc^KF^Lo zCjVIqMeE@;Nr~#sG*paL2B}<1UQv&!ObK{n^qzEHF!KR+8MN-ZvOC#|9M0DQ2VOcb zrz%pb6c5#H^kficei|l4G>+~PQ!DO9+4J$$%XKeTwcN|Hd9eec)|mThyU;!43VzBl z#i}fvo7*va$G-)CUFjpzL(_YuJ2T2>bJqS@01Qu8>uP zF5VasTrD&@;&;@znEG*-%XWw_jK3G3SGHEHA@X3bUHgwdCa3#pCvS}_%*utA`^>Pv zQ!{3y-~4m@k1ahh^Ko`$L4tLW^MHRVaM>!*`;`4O(Yhx3x%#WX?Kq=9tgEZ-tX`%N z$vtSP@WkKS9dB2cOen5Ybfj=tQS0KZ7Gp_?EyMoJi9!M)ob4ujlhZLJmBLg~El?M$ zR|0|JqH>}FVNxiPS_EC)1j2z=#BalyU;#AVQm~rDDQcpkg?f?hv9UNfG4x^hi^!GH z-^z54trYh=&L10HW=#0_;7i&9>M>kB{hcSR3kx^r*|N1+75)*K`!hDCZ%+@-=>7NA zzrVTOqT8kaJPmmzYA5T08#!M01{^X?^xt)&Hd-sGyQ(4-B-IDY7W=XfJ(C^lN(zdX z7d0;WT-4sut>k2BO=ny8NO;rV!Cv8&Qg3iO3?=u{5nv@*s_dn_2UE@-G!%u1io`nT zBEExn{xSF?d^9ni{7cUYSOjFNHRUm=U$Jj5)S$oD`cDQy4up@@{CV z(W^=zfsYvI>gsR%P~5m6CHHOi`+tA_-p%NpQ6VEgqx`?`Ipqq~CF`AI{8xlpsEO>x z>{Yf^^O_F2UplpZj^3l2uFX+>XCz_=W+$3F}DNmH=)WE=V>^G7jH`BZsT*$nI|f0=nSLUG{9&?1YV0%zq%@LTzcko}k` z)k9Wc7m3!iM?q^SeKk{%xltGr`6gN&`zp>=c0s%tzbJk{*;8eL!rPlZs6$DG*vp$> zZ)S1kf6r->)jsoOM)i!)^rSz(|J=!#@h=iQsXc7#-6z=ra${mLvsUFfcM_#$>(8RX!n=jHi}n|rt%pjEmd0>h3zy7Qx`JXJ09K5f+_!yf_4_9flQ*|EQc)0Q_>6h#L+EUFJb*R!w zQNV59&A#+BbCfBWU;MW)vG9H&R=nBry5xE3Imc*MQ_ou8&A=F5CB>u7iGGlyzoKF^ z8JZ~VHq9yZQPn%8ThUyx5qdE5nFq{a<~t)Y(_!v$KsiEnTYX6TO<&J+Hn@H0x$tL^ zBcjWcnI07y-p?!;3RI;;kgVm}cwae^ZC1;*qALZ1^1V5D_UwP(Gq+~uWlqo9nfs)$ zT1h8olF!f2K+Y0x=zogFssoUkKcv|VbE%&irKUhdDc8|0h%HD%A=iJ&9p)Hdn+#JL zU-4ZF4=f&yJ>b~yTIDhM0{%m68s9>yf(CGcb}62!Rk~jK`i2pPC_^88Pu*GVFU>mG zJvGwa)1K0e*4HuYFp$Qv#xcf#ae=8M=zj3G5KZWmkXFH3(;scHLd1rNm;6Ro+ft2{ zE?!Vrrf_M&_56~&%6av2+vU8-9-H$mw@bmx;vS{v-Khbil!9%eT+Aos6G+mpQN^l! z%3I1IN+%E~8Zkqu<9KtVrjX^wJ!>3iY=^COOLOb)l5(Y;9M@c7;7pEY|8WnYL3tlB z;0s8ENmf>bjP?%wSwk74-Z;l_Qy;1ytSiu7&=zQi>O%CH`rn3c#wVsvL3@I4o4bW9 z3`sTr3?5+$(VNvy+JapXX_of3cY16Kt;>q97gj3xnKvf4MNa4JD%sPrN9VN2n^sua zI?P_^z8B~SG~RnecjzpvR9;p!QXf&TS07hzRzFb9R8D8I$+JMoe9OJ?Ww;*MTiLEz zpIY3O6l-PMF34Z-&in2~-Z;M_@PN~SlVk<>TZY3OH&gRO_e;OZFv)-zT)J@GaP1|{ zMopmxd~-UB?u>q%;k2QJv9EEzQEPIVY6e5PF!X1L%{)EGWCZdR?LbcRyS?`udRu~J zLQ$JSxu8zLY?!2G=VsSy;vz>KNhO&)t+O6N_NZ(o|Kf5>#DPk*eRy zQ_333bVUs82S1YtzE>W@*YkIG|F&nBD6MlXv~@&@XsZL)@&0vA508Nh> z#0|QpYP_~skDC?*H4Tml?h-V_bi|l!XlM}h6AW%cu5qtvO3rJ1JXc{{1rR_M}yLp*0;q2itxgN`IfvSSULH*GxK)kD+*(ZUDo#Y4A(l} zEKU&p$a4G!xr|;3JBc5PMam|yYAz~V%s6@l?C+N#O~g$0lJAkbopXSFb!pquYo#mf zKF2DT!m|l1?^S{HWe^X@4KSR{rz@#iYmJ6}rrD5_@`r2-JrnvaG$C|z==jjo&~u^X z!#aeehUJF644V=fY3^*=qpPd3k#~`+e4PK4tAl-3Ne4@M(fz`#f*bi#-mtvryd${> zbKB=#&OcpP(NfWN!7;`8$LOFPWYhkOX2U}|5HO>m~Ezm`fsW=)MRvsu-zZ+es5RWzFL+Q&nRkG z=*~~iQ|A57QRTeOHs`dv#_E#R(#QQ!ymnkYlb)J3{0Gm;qqKB=Yj z1ga`I0`CG0;tvAOGwgJKW#2Jx7w>5AWA8k$1YQo%+yTC?xIoTD4-!M@#>!Tj1bvP% zHaOpWH8ed;2%i!0FQO!(SLA}oagl#uM)@IpQRt6g)ioFMx){C7~-2Zy(L}><{-&z6WEJ&mcGkR(06z=wV#=;YM{02dz)4S z*9ln_+9B+5*xRs=VIRUihed@?3!ffNgf9r&7@BYXXR4HE-$vB!~ZZPc? zn-mRTV&kP#sSq**ABE(K1iv?s=e^}Nx+0u*M_Fev%)oDZ#`~HFMAis7mndW~mP`zz zF=es(psu-bP0&2EE>sbAJFH81r|?nX!@?88M}*G~e-QpUJP=kVG(Wh&SW8DJ(}-mG z2`77VoWD!!mUOXHELIhLEZC5LAn#J{vYg`V57{Gge&^=pKP;+N;;=_}iv4H!LsAEH zJ>Hd^O*Mw3)@aCmbYm=ZOdNriD(&7JwlG?8hIk39CXfJ1^+M{ zR^v2@q2lmBea{r9%0Ag9SbthN6^|&)$*-HYGe?)5l%>f&mvbp^c449=u5^KOz2~TJ zZ(t&q2lm=&|JfYDbX5+re^&f5-V|?)IgvK7SOIf5#GE6dM2JH-PV$L$347n7V7&a$-X2kEvw~^TqIblsg9-21l3YCqi zBUn3mlrV-J>;LO{?V97bYg=r2T6itLB==0ttL!d0BXU>4*;?)5+m@y!$+jx?9**bE zFYdj*X{^MbkdlzA@#z!#9L!FQ(*wr%cZQny3_35;oT7k0WO6IcRpyG z;;-?AkTeO#Lckj{OOAm=brG~T^Q8&Ed1?zes$OUnY$1M{P*6Q-3sXh8OO>W>q5Y>r zjlWDSgZG;=Lso|M3ipJkh0h9K7KVmy4|W=Jbgk8AnewC=^GFgO!@l+zJ!_mNOQTD& zinT>jeqr8&JTdQl{@8*8g;B*%EVE07mX38SaGmui{h@3Oe^Mw9$x0vOQ8A#nhk%u9 zCy)~}WwX3O$`n(extu1Bmk>C2=!LH&?Brnj0^J32hkE5ul~L0{`%^#K7;GG7tYu6y zy$o(b-a;4ZBr{AROr5mrVsm!E*DV}L2>Sq`S76 z{9#^#+|pT&04}9ZdJNsnVxfd@j;$ls$|-f|90^o_0lH*GFG_*m65Qe?;tTCkZPZU!n-xcZ6$p(OqR;dl{o5$P{pXWy|+*=g)#-okHYF9giq{@!HY3*U$iu>uWkJz0yH&2(m>$e%>|TNI$|?$V>bq0^!JO`~g#-%~hn5H>Dh5rnHNVm#^YaAniPteoA-8 zx5dj^WoLHL-r|MZAp|L!e;(xQ5yI$zrk3O?9Qu5mV&m z!g=mFpTSqcLli;uYpJqamaZ$z^5w8wnW0Q29f0zJK@=@st0bG)is??3vQQRr`G83wa%1!Ybry_!7+Gwjt9M zOtu3Uak(d zPMpckLz@WsjEKF3xlM1@!jJKgLNE6+svr5>+ym@ro3SDJ(X!feo*WF*&d+e>GgGdB zek>upvOPG6X7sr*{<52?(EC`5dqbw6=Fb2jI^{$#)PdQqGVY2?_pt zU`0&kqq#7wtlo!3ly>q@$I_)!?%Ui|s=I>5C;MX9smPRolHZ5!R2`IAFn_%A@w}F; ziN04gAgYt&#mS!If$L&AQbpC8Y=LLdY5w83jBpbCyh0t#S9}ShqKj2?xaom(;Sv%m zRw8Fn^A#@gF_M6NkP8DJ1CNj#oF!JMKNEIzpU_geAsE>1L>i9bkys|4j?KdNh!Q^w ze){!tGhl#aLnEm&8@;iX&tr*nSyqbn(!NO57gb!$a&m!)D^pl8HY{&mX8k~{a^Pl`Gj6`>m zFNh`dc<**DN3ijA@VPQd-XrbeNr!-zBZkAZFppTo3FHH(t*8&PRBn=tgFAG7q*x?E1Y8M z3LU8gW-YY}PjJ@eLOeA0mkri>b=?sye&0&_53|$gqiPel==A6%B%3QoWCWhWzHX-c zMsWfesi-bj<=aEjI4f}7zmM6;3^E_|u4cZtttGvs8{T9ksyMB<;cp9`liJdW!U9C3 z?n1)lFdRKnZSQ_%|}M6GL*HDdG5wQ$UW<;!cSM|w6n!z0uxSpkMmZ4d*un0 zhU`Rt^|yBI;sU}9yrb?R@`j9%%a^VqtBE+#%Ne2^MNJPZh8c7`)5!MPGl`r{__+dX znOvKg%Z?QfVBfK~f$n}MwnF+LeNr6bNn{=;AshT{#Er@|KnyJ4S_O_t)v3y?1{sL0 zmmY9#aH;6~k@LTIPSfyLG zM5YzdEH?<_mDlt&SQ=8g6$6_fiM>P2_RTj91rIDCck+D}(v;W1*D@bX)W?+U^9`dn z>FWo2Azg)g$acl@k|>p)=m+fOEmD8^g|{}k2J1(i7iI(1Y`R$NrYSx{M_Y|cjj%}iqh7^MrB*YF0YPk&YzKwa-)6K zAiLfgeIm|i`Mt71`8N1L)oL!SFDOk3zM+5Il@tfMXKE5`0DU4&B&q#8<-k zTomjFzaf+G)?5?!E;3Wu-5)8>WZDT2JhKB^(fx|vs@kxJVj=s!jkR)5kjBP^>RAmXK3LuX4&5@16p3;@c1n*tZB-|k#+7SCO zk=@{(Y?jXQpP-!?lHXhCNl~WGzO_94W z2I7PB4LX`!hbFSy{nM#EB;#)nmO8a6z%}v=l=~@?gdC{@=@4T14oD6195xC&7w7`21p1pPHQ~twv1MukWL2u&g z={cSWfp+pt&0b+5UxsQ=4+@Nw`mooSn%avrbxq*gs|GotWu%#=`r_zrPvTlL zE76N|B=8PfA;rG6>@}e|W0Q;U2zDLc*Ko@g7x<@Y%GEb67Uz3|@t?{>*DQB!YNf7> zP(QF&GXbe@ABBg*ltIfsAv!Rh#Z|u9++59TwlV!*KEo%zX1DrtnK|fd?LuUySSrmZ ze1-1O-cyZbb9GVnUqq(&v%inttH=>Ept({kS&?mQf4wNxgMOI3B=dH~CVBGpYMHvK-x+srVC5oA=oj`0u*FTN4o>ZUD&G4BFy#U(VNWs7 zw*nuk5QM+(1+Yt+xD* zm(*PGPJZl(WJ}54iaKy5Y*d)hzwAsQOB_zk4isn(fde_GB#F5xclH0%R?w^=u35*s zN6BrNC&*C6Wl2d@;OYa(@FO;le2VnP)_XaktST*k5M2YE815&?)*uXp|%M<=@W<=PY@RSokAg#fF0MH0&!%2 z*PYVK)MeunEq%(9tnA z8gd>k`zoP6HQD`*Efe`#nCC&LCD?`1S%RQTBKB}+$$Rh=odu1|_G}4qRW+6v?fT6d z6plb1v=Hxub=;?3$2Q}B1Dm9k6iNiqxX-BVBEGRNR8%6oL?dsBSlJZhu_GhJQB)6- zc8yUyQ5+Djde@Lfq?F$z)z@tx^Vp`sYX4beHTFr>o2-YP;ipP}TuH=qRT7>mkH#bT z%2;c8AdgECctvFs_OK8uF!)65x#Y5M)P9jVvE`UOVoib3*PxYXyQ<0VkTEU6LrX3i)Sb!vZe z+9BU&lf^&8MQRv7fPBa1fWz{q{8u+m-s)J!jAP1pZu2+E5Oot_CSj(Y`#!Nl8B&MN-H4A+4&Bt!~$}ruKgZ_~r3Ok2=kZJ@vYJPKVz{dFw>&JiPO+*5cil&RV!6byB z4HZj#kz#q}a#kmAA(H|r*gUB}6%emt40wW#FbO}TnI>#f82E+K7ie)M-~*8y=8n5S zu?NfayTI}CO}Y!ly*WsvY7ADxwO?AT`R0G%jaARkUXizyJ`xTFjdKl@bVv_<1qA(S0EpHi~s*!6XXBKnn)%?)s2NY&`*5ld%;d) z{_+WIk@CAP)!)wd3cKp_FgxU84Lpg+fq&iiy!!(;2;q1)0RojpR ze^+`E1(+ay7%`3egQuXqgvInVR~M?k=Cw7JRtL`L8T7WbD`UihsNde3w2D-TL9W;M zP}6<3u~nhVQhW$3<#Gs;ol0Gz2Z}W$HGdlM_zyvH@h{OM@Y?qZb<)XVBVi%cQ$n~0 zqyv8~U+|YjYvTvutx+W1fvo|JCO<$E)p#e-2bnF033KtI%CmvKu6%5rJ}giUR`5h^ zd8S{Xfq0_1>AK)vsjF*R>)OG-!lrN&@n!H1ASwnT)w#u7h%{LN#xd~-qB0bD7TZ!a z!6|ByG|h7V6h0`S|L?BNdlhZj-_jOrqt+A1bjKoXwa3IxJ_R*H zmF2m|UB?Asusnd+LeKPF$2#&mkxRb0Ofb<5O$FQOBcafDPrS)&p%#l35UrHwiK1z& zmH(}lr6$;hi%&3UF7vZ|{k22oT7X{j{SY>T#e6oCNGAH;;c-A_ zi9oK3GW}b6LVfW~MR$4os@A(F;zLYN-4g@1$YInQUq!qD-4LzK`oKJSL|Q`Z=8jNr zxzmB=!PgxIAY6-BYs1vSgZNSG9(_4bfFv==@&?ahF41_5v=p_&#~42Hg98_^VxVLz zG?_vY@-a{jd*Q!C%u&s!iUis7Sv*EFn38Kiyu}^{8es_KMuu^H_*K+bej4_dxQ8rs z4pYw*dm;OzzDNiWC$$7l{Y_Op`MPrf|5!H(Yi5r}Mk#51&CE$q746Q3%%4`9i98DY~a4JcGEJgs7~5*A=_TPVYTfV;|j9nNj9W7RD2gO;xRtU%N-B zmojmV`oaaIhI%<)m;Fe6m29jZc|y1WIY&V3k~_6+htL;-v=UYz5^yz>HB0bDb3wI6{mLED{S;9hmvPJGSon z<)rM4MSm0hkt^669~cCw#{5|RD=-0$5ibLu|Dwy`0=CkC!r_OgHK{dq1T85Xs9%W z5Ktx%#g3px(C=6`nJ5jGuT!_};bdR36*-d2_fuFgwhrCO(%f>x1o5%UtUM;o5*zwQ ztD0-ix$m;o#lBb{YL6$N2%`RQqmeUg9KMJPL7XrPn(2Lm^@DSj)@%=SykZb{gPG{= ztC%L=^)#iLlVRi;S2$5YHi~Ddsv<(ZCIEDL^B|pj$d?b2MT7?i&KAaaf;MH<>I!oFecmNJ%AKFrU2TqwP ze2#RVsKGYH+G>hDBzs(bO<9S}?s0U8VvEPbA4E?oyK)758D^cNsp6Y8MqB7w~~P!@xQI7DgSpp{eNChufbLAm)o&j&}oVu+()LlyQ!j= z+}7KMdP&S6`?`J*o57MZhnXsA@W12=Uko=;*I7#8rc*)eVMG9OYX-hhMuZdcbi5PR zK#U?90FR*@lI;0`Z(x?OF!={RR23u<6hTwNDzrb(1$y<0+M}$y=M;PHMO@=uEmXV)lIis-2S`g=xri^tiCepC_W&Z0raY zO<3f^c1gHS=+Wi)GxVl3oogsW;!P2bw@Ul*C1@LYGdKyF^EJs}Y5=w!eC5Zaf&6T^ z(mm)YXrgDK(egK`6(2&C#j?Om`wMv^58=H)`8@vDKr}#0>Mg$G_8~*jI>6zF$53}6*ZPaNDH;aE!jCQf3J=q))Dy@T&U+(fuy20l#2uyD)) z8ICSwe@LHt~(QC+!|p28fU7cfJ}EqG13 ziSie4sA|Jo*Ai?IHV(@Na%Tm6j#N_|$1mh-vI)Eqe6S(Hd4H_0k>3KQMhMtT-?+nk zdFUKNTX;{n5cLqB6p-EYIfptnI^j23-M?G~mLd5qphqygt`mpG4m z?9F%XbX;(>a=x@}v{tfKC@RkHUO*O|D9*MjZCL3Uo5Fs{+00Wm5Y9~i7RE5>Aoa&4 zp#w37r05sKBjO10l5|mv>0fjrHH#j~v{B?MZ)?VA8yNiXYe!fOh z^ro+qIru`fP?|18aMRe`tOjhkq4Is)sNmII^h|JRSi9&Z@!HCf)!SAZU$I^Mt=K0~ zwZjIPQDc^J9hS}cTn(&AdGT2nGw%NylD6sV_RkwWsz1*8vLp@rH8-PUj=6BXHQssL zA1QsrhbttF64FKIgDZu+H+MDf4d#s#b-BuT>IG_+y7AV)DBn2G7WY#3DR5OZV7H6A z@ve$JI$!YK$WO6j%b%%|Uvp%=R`s>DRaL80G{obaDwN;JdgZqWN2&om~3jSsq zYdEU4DG5r61`GNAQyzya!+Fa&(>2OH8NQD{>{V$K@kc4>Tbospw_?`C$5k9rRaG;g z?&`Wk&DcuE%BDxj=74UrauvQqFnj0P7UfHsxBkrh_2qk1T1x8M)Xr(`fAsymC4FON zAh%v|Roi#xOaBbv6SN>EQvt@L?50Mv^|a^JHPrdaXr>%F6OX}c@@+9x*u`~YTd>R7 zpIlYZDX+#G(uK;e+GNw-P(_p{Ca7GmiW4i|DQAnzhXS08D)PR`rZP*6a4$HpYA_VnLo0|<+Uh2`+wKQ|FSlW|L@wE5ZpK9O~~Ys zLFS=BDq}U>KvhS|gG}I$K%Xkq`Pkmfe$T$rG0S<`y~v*@B;mi5$p%yC`RFq7`by?% zY^|2{-!_@ttWqOmt*({Jl&zw^`neUjhTdAsLLhqp7|wS+Y~ z<*V=epp1XHLo9zCF9ToXCM3tqP@DCmOoxL0K)Pr~&}2h`Heb1x?u<{AFYxF6queze zn`~*;ht^rPBKtX4qIV2iQA)x`D*G7fg=R*3;@?+_uGXOD=Q`Kw*J)&Le7oV>S{EyO zVvmMgQE$NYLY()htzW(^L;t=0=cVsQz4gBN^se9Mo~eU=oc`VBuQ&TfVb@Y4I3Bv9 z2dGJkda6U}8Jcn0db$(Z9L+v;17$4L0JDJmdpDcuo9Nl;dgSPAk1O2`nS>FW`E!Dr}4j%?5X*W3J(|6v^*?b;Zpm9#f{ip;7P@k*NE|W zTilKpfVZ?O!C()iI{dnT!XM|0@Fn|L|0LkM&hfc?L;w-mpo^*dsww)rrhmcrLdJ&0 zMzE1dW#-25We3MsiC32GADbJij@OlqDbqIml!;N-C20v~CwS+$xYDjxXTg}9ahXiU z;Xj_=S?Mb?+hmQ&?wUI>FOc7~=()A7eTQ2cV0j-Hl9%9aA_%hAznBC?s3M6OM0X_z z;q}l0DPCyEeF_}+pYyHuef9P8HwoC;{Q`!}AQBbzwOfqFkTwysqwB;rkH1#oPv!XP zZK_wVGPL~3xP4J8Lh=mtHMQt^$b^8#p)I`e@6n&JKYym>r>;yjq?M%o`5yf4x{GeJzB8~xA`FkU3bjG;n0$%0ly-3Ie7jtiAp88pS{BUI zA00c~Nj@joJW|L9>Vu{w;og`R<%ud0)yLM#t-HDb-zc?la{Zw-^c4?83#J|l0lC6{ zcX5^tITin8d`tOw;vMz2!&~zQ%a;ymOMc$|^CI(7uBW)Uqr5L)=!w6iwaWV{hx(f4 zy|#>Qly;LQppu!}L@>~1y7E^7g7=x*>#XPaRZ5q}*{#lczJJ^wSxGcv?x@=t>Y7_c zsAHbSzpU7xO5du6Y6aE4Rm-Yos(GM#aQUdH$HALb8xSCWct6|QSf1pQ+15XgzPC;- z|1Bt0{xKq>dKQ^Gr69iOXVEHaMaOG*AW%-;fnNf$o`&o}l*1R{jsDB=g2~Q{>=h$9 z!GFYO_Eq-P^rNtj#`zBVV*O&^r5M24F(Wkh3`>I6o7;s7Vb>#`MIDW)P_|zD;&`s? z=(uk&mE!u9y%|G9o;Bxab@X-F9XRb->ZI&`AlNGNr)D?Etnzne#{9oX_JO=r1#OF> zEw3yWt&?o+9WC6w{a>J4nl5P&E%H-7Ag@H)qsveg7@k|e&QvKZ=8th^u9&;TpXP7y zcZ8`xIlU`)!GeKx9j`*Pe|71G98*+qmEbeMU(Ak>#-Wo!zlRPCiwRp3wji`pXxk8L z$f4jD`s=DcbRGP=*pjX7+v7=eezxs62s;Nq2la5n&$VyA$;*#cOyzj+@Q32whfdc8ki44n;&jb>9jqr&h_kLxYkiJH3F@!C5;kyYxzr>#5! zMy&N{53#k-k*^tu@*VZebcHzn*uMbT|EX<&eYAaP>2~{e=SgQ5S2a&7Z%g0GfRW2( z2XIsPkNkSx4A$}K;P4(PMhjuQ0Sv1Y|Aa3GjOOaV9jpj0P6_<*L$O+TF0qyhruV^a zyCGAbUQQjL+R!_gwaV7&*D9^LpK7-v2gr0LcU6xC_%wLnOkg{^ zlZ)jK@#VpDI1fHYg)~vD2vpM>;B>7fbOz_>AR!7IbSH%gVk&SwIH@!QD)uWYDjj5qZ+H8PbLTbp{BJf?J0%b@;2H-o~1R_Y10i(XB9k#F)#A-7V_ zYjOFUr|e6uRf}~+^$HH;J%;0SMPk4P*#b^^1gbv`s{Z8oh*3Dz)nO&_oiI zui>-rPFv`s)CM|P5w7g17|5KY+C%f81u+N=vwiVG>>!$qyaujXC9#S?0|EP|K#Ea9 zRjyy)kH5VCqp!99EO4duYz@eGW(2l@Z#fn?81wu|{$+tPYhr_7tAR3XAzUe+xYqmvz5=_^j|CP49Bez_Z@C1GG*X0Q7w_i=^G^Pm@EMv5LBRFA z4^GdPFe_>)y_8bqk?0V#5%h5@VXKkT@&@qRjz?c&EdGty0B#a3Kt*q65E#FA-zR508bE@2cn0& zz-{A{;5qMzZow*o^Wh6JR(#8W2bvER7bDfc6}T6@fH)f;q$p&Ud=My@Wl*3( z!sH}ZxFA%7HD5|6)@Jgeps^z~Ov`+z)M~wXpiD(>#Q-mWl`9H1z_~?U*+FH7ZRhkOBCt#g5LI|H61&*5~!58af#_$7#CZ2=Pw3qG2Gaul){Z1oLM z1)7L_l1s!7kW(Ka;*i~+D$hiS~~(b{NDpgi3I-_>m(kCIsj{gREDn( zCrr{Sxiwhfldv6_6~3Ep$YJTF*hXHDtbwk0M|=@_6s-(7(0xE%e+IjV)v%u^58U%@ z*jO|KpEaI;n*3!Cw*{iaxmqOloV9 zYO+3-Bn{_hvke2~xp2`U&%tZZ^=O>@4qT>0ek;3zjpQGS-BAZ|1McNV@%4yDxX4Xp zA97Q~lk#%360w3Pz{Vr%r5^&%R~9~r-Q~ORJA%6;mW~{d)$$s#Sm-8gLo{ep)Q1|; z2FO}@jMP-zBaQ-U=|#Cvo{A`dM@%CHaAymVd9k__BQ=-y%gvBA=xRIxFM~;Fru+*M zi#_=j!Wihu^+u0|>6PTuwSE+2v>OxeoZBpX=TKqdr#;zKI-1RK+avVCkeV zmIuy;^Z;S;A=C$=A~qEHA&%zLx%I+iu~fEWk72)Rq%L9|rK8-`zztsz8!KK%{KPax zSH(#x884Nhxf1_yzcuhvxPm?=XET}fec~^&nZNI!>+27BD18onk znZ`tIY?xddyv8h~t>-|}buZEpTZ8$5j~R{)fKFtB^aM`Vamj&ff`4ZNko;2cw&*8m zDG$#D?h$7c=OcO80-`w?hg*PFIZ-UnSLG`S69gr)3JA}u;JUht&4Yx`ba>wN6(32{ zU_V!v=z{k_d&vo648NU!D$J0UAonppb_=b54MmU0d&OR28L3Fr$U1Z+7`LC|F<`!} zh$PE#@H5ns<^jPx8cT*̀XS_A1P4ihqjW8!IPBzQWGqDq*;Kaj)aQ(#4z3Py{O zaBuhr`-c>~I^GK1jr5Un_|xF^m?Hl`G|+6yMR%d`$aJv-{C+A4nQ%h#89fQ#&u9!s zJIh&;TU-I`zbr&V3xGeI3_FDe$R)`vEfyzF{^E*D6xQLVJ zHFz2rg&$lB&<3Lyz+Y7Jxv;06|s2l{`&@ebp@ZdD$>TUc5&cvS* zcF4P6x;x-MD*>TKM~OE%=!XOSRFp!opJZ)j6IGr_Mqi0;wj`io4g7oQCU%6}OxLF- z;xFU@{K$X-W(IWxt8^FZPFjfF_&>xUcH;>?gue-i1s!GvA3!x?5q1|@D4hcXd36y* z?xNeUvv?u?4}B*0k@g8&1)DHj3PbbY&)xs|-O=Y#dEn6>0q1(AbVP0doao-*-KY+` z%eituoCwyD$%0W%LJP6ML_VCr7GcYfSK@l^0^5db%h#1=p_6f*NP!cKljsO}t&qkY zaIkSBz02g#32!6O#RdB`|$ z)!#&0BQ2$F!baY~Ul-0w%TX}#;7y54>;h2Q777*lmRyRE08iiV(8s<9%=hW&EGd#w=KcqeADy$72gUAP9nivC) zvC;6{yAJn3rF21_iavxt|4qyy#-UwhuW*U`2EU<2@)wLEW%3ts9or{w7Cc-8H;Q}4 zcb5{;Gth<^552tRK(pEj?~S{`IYEQ7;yD_Lk0Z|FKhZQP3k-M{__M+wDIIwUMzJ*f z9{La75K>^*F;{pXzLS>A2Dne0Si_2T3W2fN{hhpthEx>5v}!#r1}}a%bU#qsLIB_akdg9gb9#DBsbcz2D19RrTfCJsSPbT*bN zr;9E4`S7MTU3!g9B(ljV@V5FG8pFf+Zd^I8Hs4)bf+)fEc8{2Y-$C0UBg7;jRSXjs zz}{mhu<|PrMq&?^Eq50C3di{t!c{Q>IRIy*>G%|^3NlF^DlZYo2~S0!$;p4=1Q&&U z%_?|O{DR%E3b^MdrH62L-V7`BFZL4bO@mU-x96Ny;@#c_3*)25^FY<}} zM4_Mb0}-)p!~=2&p~ZSY{;~qE=PSX)>78%_eGhh)ePlOcFgg=#bF;-?;K%v~UG$bf zO%Io+!Y;g=d;nJNDlpZfjg=Y&G>)Vd&}UcvcFw)ZR_s6 zTN4rp2@rz2yX)ZY4ud;0xVtmx;5z6G&fv@p1b3I(`nzb&NKfHr*553w{F#Y z>zsSv>Y@gQglze(wSMvl)0q?{&u9}cHzvbNq9a=mZVKyJg}lUc{*`=R{S%mxUW|#m zz;;E4VGU^lCy?=Q2&+RoF^9pHp34p9&ah7iryY}XkxLGii)jnkM!K825qh6+ih-+F zWK_6Hcz4vSImvZ?1~dqax-z^(KSef#gkVCbT(q9{mVKb>WEcqb(kDzc)e$)zY9IPJ zvOs&vHq$i`O<;p+%n2v&%I@0__o3{ zU06tCd(afc5grkm7cLO(1;oo$p_%@Qe!Bhvr_$|8MtDhRdRT;e-&eMrezjqg;f*kW zIjIba6bXF`?T)t6zA$@)j{0<6E#WIOU*nY`(YWxPNOyGvUCM6PZPahqr|7KgC~c*@ zGGYoxLY1R6G%wpmw-nyJ?}aMtcJ*{*YxsvqS-G$JE6L z;n{LKjb+;jk8sXj;I}d5XhdlspN#&bRHi+ceq2dDjT^!qBbVSPRY}c(Bj!Nt-g>qr zJBw)n*Os4YRrCdFY1OpqU^4GwJj^q8DERAVQ5l=4st!=6slRC-wNA7x+@)#~KQWOV z>I~!$mlQ@VL+tPiyuexbT*PS82syQtHEVEu>vwHbG6hsSxI#Gb6PX^1I01$nxkw^(@`N zEaCbC$1{mZA(gayN^ji57`lY{*Dt9i^6Z(~97T|g(T>r-WvY&ZmP<$e0F=Ai<1~$< ziQ0GU{9Wi7QU`u;^SGC6E;Es&YWLL1DzaAeNCvRi+0N_`<_wul-@^&xmL|~Z^g5jm z<&F{P-Ni#CdnA2>GqD@qhJwnu1KG^9WnZ9kIs+%Cl^XCjnz~SH4|dd5G8;Mr*MJCm z2H&p~p_6Kx}jmT(AkYwOf zqw?QMKQ&F$Gk>$|xpI6r?k&5JJ;w}3k1|ZQz-ulY9*|wROYlvt!tQ}WAou{RjSItB z>KFDUQ-UeW6oh-O=Xyd=cG>kn&EOK~IvVY!(~CHbVsM(Hf{Vp@9BH^&rO|O?%>Lw1rMgJk(a&)Ar;( zxk9d?_B_e7Wr{Ps=yNqit*<^pcQKBxCl^@h0 znU2`&j*ta}CDY&-Qx;vScyL{6;4ZujVdubystE0@)z%u&)~FC~v7J~3yKQA!PmNW( zD^Hak+7*%vE%3#{Q2r*ngpO6JL=QydNPk75A(D;m>Q3%E^6CuDq_S$frlFF52J*)Y zb}Z8lKI3!c2GN9Q5xE9b&WyO$lY9#Q3{gFo4nk$q6*?bf2oUM)Vy+O^1b)M{X&!C3 zS_A!TC&`cJx{*DM`tUndv|Vuc3)2p6wEv{71Joc0SSL(0NS zv;f-*5mu5pOv`AkwOZOxUwpux;70QYgi4rA zeC1lg#mC1yhCe|DJ6)KMJzds+HQdwxppVxN6b^IaxQkpnt`8I^FAARoJu0>kKM2my z&(J@}i~Z@9c3ufa*GCqFQvDge+PPUiIp?u&gP#vn3Y-m$3B2~N@z3=C;@A9pg44q@ zqhUD?Gm8hvo9`%tu|w5WC%|DQfNt(cx|RISY-O8scerc(G-1AwESwYS>niAr8K#TR zrGROeWsl{7<&m|3ZHg_AZJ%|Lt#OQE{n;9|)sIbyJrp}LPi9P`m?qFVTPI9l?`z7Xo@%=&O$V@eJQ}%v)Eyr=!Fz@!9U!WdzK6p6XBoZgLLeKB1+Fe_!l~RWw zj%LfHqC=x%^mW)4t{J`;t`-U#IHq{`JGySr zP8?^L0hO%EVkfbO^qVo&l;83hbE=)z;B^qs?0f^=RowyIEnSxGNBEJ*hA)^+HZy0Mds>ED-$75Ylr6t4+x8suxBM~NV&CQo z=Q$BKH~wRu7J2H&I88p?&s-GxE(%Se)ONn3kkVk`nLazmj*4?V#zC zz5s~?cl)NfhJJsau{~pXdetwl((`@o`E~8L)>%Hg;_ToZ<*yqaA*ZT4$a&@-y9=n) zl~~C#U8M~{#{Xlq4?Hobe?#te-%q}izEZx0xz7TvLPJAWLPH~GBEO?oc1e!WwxK6h z8)`JeMJiSn=c2dQLw`iy8t$0y#a+htCc)yj+_BEHv9aG{N5`$myEuRUq{0QOCFi8< zDSD>J<)U|rEGf7@zKyl5E*xIs9`pVEr@U`=rKP-{oOb4o?fr$1+doCpSAL6T-Ez(M zZ47(W@q7#Y8_8taX51rI)kpbv%nH&Ldh@@?Ya-)9$^NxDqup_?3`d-^tLwUFVD5oH zPUw52w_HhifGYR}_*&=KxTU~r;Ym^vJ)SGvY9XI~x0ovZZQ5^nY3&=+ zJWn*fRl?Pz1Iew5{$Bi9$=ao-m+4k!eHp35>Ov*sC!6MzO1b}hAMnZWChfWY>7S3c zJPAE}`0`ZRnRn68Yra2n-SbzH?M!~dF4Is;EvwJ^)l$*iS$e6r2y@v@+T5rHRiopc zajxq2C)v%i!}hgK#a%z=sDDkQp&W$v&JXOb>}+ll92~8}N}-By8p=h}xV_l@U!yW@ z&&**5z&og>VYPJ9TR9~FA~$BRy{y1ecEIr6=(#~EC&H5RIvn%l0%_+pmC_-!RD zM~saP=&!L$wJwo~{(4>`H2*GtznwY$yP7@SKG|8@6Y-4?)QeP+XQ`8EeducxhpS5k z-AuitFQaQCyx_}VVwT9xV{^DJ!fsuELtRmC>S=idKa{WWD-!=Mv^`~5v4*8qmFZFb zTDcb$_m^u}qIXi&JiPv|(00e;bkqBuFXzA5@+|o5+4IJ)PNiLYv+HBa4AI`$do#pq z@BkDOp!HwXa>X1qvQl6D6@C$P)hZ~V@P)uVJl$khj(wngihZ@?p7RgSnA~H5sbL}d z4Y-D7@PN8bu0lU?q0XnfgA<^yu7og>p9fb}f{9oS-9>$Vsf2OAIl=nW_EW4S{^xut zi5m<4k}|c}%Muey*-H;7v$M?p(zlAvPpT8kiJ5X4&*HDOJ{Zz2J?s1A-s752`4_`p zU47m6Lrli$Y~E`NwN|U}H^i;xWtJ1x!`9iBx~7HVM_n7fCDT%M!V&gfj>FyCc`^G& z_Q>oz4&ut=y_a(-m@nE=siiT=hEt@c z&L(y@CYVz#3D_H6eH#Cb zjV0B0_r(;_sL<`6%9f}1@naa(oIKT3oDub$*tF*k- z*`$4WK5%#a{P#PbD!%^qEaB<7N39+wK0f*M+tZq_PQLp)-pmNDeFk)m~Wdiw`axL&)7$}hxqyiriULyrmG9d zQT90ZP4MYUimkw&p&XP zPFJ45EG5Fs)-@NuNK=hA^K;95%VkqR>AJ2g`xczwhrR}$@vcwydD#uJ)@M)1F6qc} zY%pS4*5O)4W25s@5vLvd2?~B*t33Y;v%w+nk;E>z+?fUYlRWKD+pI+LHm# z?!0>Oq06^V_MYC6{+viP)lcSdB@DexD=Y&oiKb@a2w^Y#yLLuS3zrGq3zPy1Zkh9- zOM6OJELpW+c3#1Bn+*kfdmq~Oe=C$Oet7kE=Bp)ioC~G4T{bg&~9EIyCIJl_ag3E ze8Idk5^Cq~ob)Vde8EP^uTnY|A6jx}iFXBuBz&}P7e%UzWciDES?A7gYi)qSAPRv zO>bH6vYdy$W4 z=zTCJxFmEg+&8*WX{_;N5UcU648@JR%}KT{u><4c@-|B-l{l=x@irULv{-)gV5Z)#b!ymAQ05}UkGUZqS| z$7?^Ji}sOW`CoJm#lps4O&2Wdq0smkTDu4HKF-%P{~w886FVdY6T2n-p0qA8oOf^R zYs(8`UeTqS$~R-z(->t&m6&@S6e~-@M`JEPt$eQ z_lFX8b7`FM3VaKTn-x=0(?sJ4<1=$1i^)13`~5iEFSaVN<>SQoAM;MkXHOUtcfi)i zbilA59Gzj2m4TZ+w=2d`{rk@u@#)qtyEAruo10zVF~PONmFhm>o#V?6 ziKZ)-yS9~iX2h4wcPF7j;tn|2?Jw}SV1Zgi`%>4L$PSz{?3fFFL3;%ZLbfiEx@~kpV zJ*}2QH((XrKo?_X@>Y&SZ$v!d4&eu(@uAFMX0UFkP54~oy?jmWN!KxEzLdVLbj#Gq zx+x|#&&>Em`PSs$n3P%YF$>BXGV+k(3gGb7c=T)q@>sUQYHOv#-Yql*~4AGcoc6@UmJgJplA3PRNjxm`|pF6 z0+({1mWG&XggRoea#L;vjA0K(g>At?!wRv~Fff+0?CyJZTAWAtzNzO0v~DuW{#!J2_az&&5^rh5GD&8}?6 zTYE!CGv|J1oU5HX-7_<1nXgms>_E@Z>LpK^UF=l!5z<%>>qpnf z%9j_8^JV$sLJQpz-D1oFx*Ar92gMfp28Jnyi+ZcxV0aEc(0aN7yorqy_Uldw@AQjl z54IZn3{0rYd|-L@zLhxiQO_@<#7ewF+R)ZKM*i<~8|2u!Mo6Ms*k z7M92~VmdQZ(We{69A-W;NAbH(Q0MK8$^OrnHO_$db_S-hUD2Jq1z*v*%6X*Z|quzUJLADceZf0k>pE*XnOtiNufydaH{_GRcphT@KHp1Mp3=p!)k8I`w0z zA9}SRZ5VpHZRu)s=w(`i6vdQ$7u%R?#McqF3K7Ar+ojKM_+&6k)unDyA1T4u!l+12 zv72G9ZnTiZ-(&wmpR77vsbu9<4&2qDT20cWq~CU}gbkJG+_7<)(1Gxmi3Bx(fM(Q$j_3 zBf~s>QQZW6l76+WgKnq(oj$B9D)iw*wx_O%!0KxW@pK$FkxAgc@)6jEN457L_+dKSuUNUxSf!E3zyyFj6dXC%i0jFcOV? zkEBKJAOapleuzGbegRT=KR%b>LA?oGmt^?(6+$n3zxERN+(GmqokLcT5%4hHO*CSM zFZuxNp$GA<=iu%4BWv)xf6x=(jJ{+lxj?cpVW#8-xlOE$0bRxB=yT6ye!}Mt@O@i= zYpTVZBIPk*|JQ}RJDiW7sQc97P>MQ_pFdl1Dm5^Ld9CJRy1YTNBMzJ3jO&2wn21Sz zW4!Y!_*p|qHPReE!%P+ebJ!ODXAD`69_%bkUNPsPf6^oLB{h+Qh=JAfVWF?Ix=R>DvC1HSe@ z0?C;l=W=b@0N&t}fJ^&^pL-L(2GNed^1Z+{KLPHh3+`+j5W`=zR_r_E&?~zIeWK1lZ}^!GOhslL>4)j_QYa$lWvi04 zcw#aTuRQka`b;Srt0^i_jA~&-3QH!dwcu>kk*>s5Ze*Z?2OXeO@MoWlXVwYVod^5G z4NTUWYcBOC;C@mumBD0z{S8>7&P2z$2-Pl<5Uu`t@O2nU)~cm<4cX-3*V0g*1nBC0n#5%uG!6JCPJR3#!!Zz+qSn z+y?{!7LwV*ka4<9BiC&phqU-1hdX+8( z>UNLzQ0s@CFiktERm7U~{O6r=|MQ&=`ak@gHUlnaJUxncx>TDh40)$nxbtbo3yr(3^l;k$INEBRtt!t`#`bu z;L^w@`A@AjaYgmY40Z!^o^t$mI*k9$%uwDjH<;P9Dv)k0obAr5`M5Fs5IRa*MReR@ z?IzQd>!bdyKC2e~X_($8xi@P_zlR+pvX8k9IKR(dLAfVWQBNEuuW*Z)okbmGp~JkDWnlkrV75 zXi_E{iYvv`Htae>EON(ep$r56G~IVK$h}ZXFwG6OqK%l|d>?J3){>;?qJ&|J=sL+? z!x?a`-x)l}G?uo876od;FE}M?)$;2X(a0zHj!uI>^>cx&83)nsQY9^JuIAK zABHCKr-&)qM(Y?|D=b&l;O|0hk`}UP<;CgTKm5~R1+9!e9ayawx?@5{bYk$i(h;o4 z)!{ZwHGQkd%dne0DUFv?0tZY5S;4tL-fe71uSd@tGV~oH6@zB=COjXHtE2fLy0Wqy zPE)to$_Ycl46D$Qs$csEhV=wyy816RJ2pB~UBXY+hO!&@`D$;zHTQ{LB5Cj%_(tP( zhmqHPWY6+dp}x0ApQEfG{dFtAUz$!AsQvYA*%YoEc#WCbEM~m!H?1wXrCH=8xg$_1 zqevB14}Z;1P^i4BY=#=+2xdljr&^QlrG(z)6WI^4o@`N>=yU!yH(9qs|1^*{cv-6h ze)%vaKRu|pqVdsGZ6F`yO_^~{g2~6M^b~I)%N8$MURo%@FAsw|RG>QFDD+lHEpVdRiOnh)BuZY^I z8(joU&nngh48m}^BwfnnVHoZxZNnRZzMn5tg9FbedXgJ1&sWC_4#PXGm6mCc!dY@A zyMhC%T}u|KE3-)#)k^O$Rxm)OGBomq-@<>6?$XM_Lp&PFRVV7kYK^&r+*(cMHbFmn zD|aH=lrPJ^QO{^iS(lKlG5le!T{uq3!{3qbg$C-63N>?!Mr(jYRXpqi|9r7ezzUoW zTu8F=f@!C9kUv5ZU{2Jh45q32Lh7+-AKg%eD0h{U$|K#1&;TV{c&JPbZQ<7H8NLxS zIq;CHDcn(^lqvRNDn?oc_p^VBi`D*-$8hR-AG|J~*NrjA{sqczOG3Dp>pr(bbVqM% z1C5{AtHGI}_Kd@LnLncbqi@BgMP7w#@%3U>s8!^bY;WzkI+c1D54Vl(Q#+DATK9;R zDaC~$u5*Cdsl61+LmwfIsU@^#Ol%%ul`@v}03+s>){vVml#n;@aePrF5m;Lvxu>`C+D?&r4URr5*2Sn+n@XyiZQI?$2SLbVmUdVg2BhltW zQ1VNK5NG$XKiwon<$bJ`Yb5`nd3jDe5H1vMtlK3NruCxJq0JOksXUuKsqoOZSsY!e zHdR+@|4@#-NmJD@eFvP)ufTgg6dp5;BBEAUr>R{7v&1j@B5D&M9N8Tn!lluc#0GS3 zHgjA)5_QpXzz`K8Q9`f==Vr8~dh@B_FM4EI{SK`!f#^ZSrdrD^Td z1JD6!#Ag_aa*fzn_9Ek?)75_ZrKSP;pVc%}3I~SgUnXI4cv_{No@(Tq_z z{2d;|ceGBVPt>AbqocU7&^(_=t!k<~MEeWM5dBGvIs$w9zwRD)RE7Cj5NKxjGCCr8 zNt9*?$Fx}aIi=w`@^*b3Tf;b&4D;jMbRs;37rjy;@y%8g~UbCQm{r-0Dm=rqi!1@ak4fj+dFwhMFa znrcg}B{-UQ)t`ZvDXMzuU}WS3x%WF{9Pd#ZbR=11G~9rz0*AyhZJ=;8hDoCJfTVbd zeE2g|>6g%08b^+yUdjgEbr&$*1U%&PP`3RWc%`=B5wWxta}}sd8r%075&q$}revai!@q%u>Ryw_gi>lZ=Y<~izy$?8Pqg5p>H)olM0U4es1-lWIT6PTnG|2JQz?}3?3Wha31)t@2EMAT5t;R#g(j6@ahx-;{D ziD&mPdq_*lpih(t9$q_sFLtuw%nABYO#|a=99U(Yz}&j5NQz0BgWMqnh?+fW9_^I+ zL@|SB_*LzxmI5v*0|=eYbgI@x^`eiM3+`VDWfT;@Yl7eKLQMf;_M;ky%6%}MK;vi< zy+!*_H~3Rsn2XFgF!uW6**3z}21z3t&@9M(FW~%_Nn7+j+K?5r4EWq*P!sM!MU;bj zA&j2OG*og+wd=s$Uqep2kJzb-p3O4ShU6nP=z4HpH_GLK?ngF(Udr#N$dAwu+EUam z$>5)T0MaT;S*TnCjx9qS3)D;Sf)8__oy8qz?-Ms^!T!P4gSPo;wiq{o-Oc=r=N*fB=QH!1+sBXKhjMM%&BTU# zcufZ&Ba5Lmv?@SHe^3sossCYCt^v+&tI}NgNB$)5QQj&0l~2mw%2(MT|B0T&U&=*g zh|)o>iau3kwHPX*>0p#-N*!gEnoIAYr#k|ys~14tttnYv4CEf@?giY*BhB@1m(8XW(eyday<4Y$zNu!dtFRpp{?p z$M`$=)BR@x)6pTy42_Pg!tTCO-lA5d^`YR?PiY2DWQLL-e1+rW29a0`zkrM5Kj;Hs zt`8FP7}KRMh7kr%yd&f7Vve2lM$FDCa;?k@lGfE0@P7ZnpNDQCzVlswSTI-{kM@ytim zu8-MFF3dmE-Oy)18D~1YB40^&jD=0Fjh#$0Oj%Mfv4FT&DrgeT{mo^~7IQswAyX9h zVlve-JvJ^k?vVzF{SAZkCo%6F05`cZKo!S<^N`I{W%80N;ABs#Lu6lgOz3N12(Tf2 zb6@&0aw6V%Z)eXl_hWYN68EpetHq~C~m`CYdIc;+L*J3g780&SCcOpBJXx7a=G2Qa6` zf-%|;&KV8l$x&YHAu@bE~l=qx!F2*Fb7eK2bqF}1;8yvelWiUBoJS8p?P7duNo zN{yxJ#*i`A^v<}>6lZE8y~Sj-xN)(my!l77Xs&2x%{z@D_@|aKrI=0``x?thdQmc1 z^mlY0^ivFi;fn5!u!+xRH!=aR!NJAQ@~G3JgTt=iz<``PEZ3Ub!B;7#vNyrg#eLcJ z))jJjTPlkY~SM0`P)zr5e+ zOY_=2WxUP3Ej>rw?cJr_`P~!U7u{1mBL3eVZ-bn6P}11qtB4r-6uckW60(MV4CM(| zj*JF_Yq#=HeW(qhv1A0ZhrP)47vka1__Lw7xLceiP7w!-rLYcv7I%qf#Lr?;X)rva z8yPE_N|-rIV+&(hXC97^#a!MTHC;FLGEFv_O?Klp(-`w7_&@A*aoEdo;9VWk(J1A6HtZvYN!bZ>d3m8ldfqpK8{yYR(^cM_; zu?n|}Yq1+L;$3(r_ci>ARoGChE)Ijv`E$`E4U*EOA;#y%a;8*M1lkrgESD^sEJH2z zEYHpJ%^l5!&GF`L=G|ti`Mzd^5;6gAt)H!rHv?x3;@>6uNd{fD% zCDVT${$8-LqkER3MIgEW|H(La6P{pUl?~Aw;Kn;;eL;FNjfaulOob1 zskhWmnk4-p-Tp*pmTRU%PYFMscs%s(i=1tr+R4C_^F7mYK zg>X`En?EzRj<2WJ;pyPzywttQUC&*}UD3VLo$bDW9kHkPjkjY?&zw&=N!S2GkS z^@;VRDN>rW*to*jM$%Uh7p{Rd^&+jebx$D~K?CU)5{M%L9J=q=Osp{$F9_~KpUXD+^ z=d!1V*P3%PXN~W#-0#q3c@%08sTH-s*IbrYDkYIuebF}2p5R@SWY4n8(Z?GvG}X1y z*D+)m8X|7ii>t)?qQ`IyansGP$H3xlQp7dlOYteN7%inIQeWd;V?C2<>SwlE-dpNg zd8-0U=_Sh%%U#Pu%QZ{TQrSAw^4;`BOx1nhOiTrBo7^HYI#exCB=@2Bf}3;ob53-6 zo&8C6x)QF0dCWIp?hir{ z!lSOG?U=7%gZg<@$geMFC?jg(ZYht^W_&F*kk*L2IN9LW57F-jbFh}Mk#Elz=FK?S zk716LF09b8`rq{943ot*(kbH!(_C|9%Y92R>qzT#>n!W9)^w}e`rNwI+S>ZmQrzM) zU6JAqKj@BgInQRPbi`~Pi+O(b8RvV2*C-Muay=i=`QI{7)Ag! z)Kuys^_SdYEAcF<_tW~S`boO|!Yg2$^WqHJ%B|*xbCZFAHu2+mFV5tBIHxWeu8V(3 zYm5y|Z%pgWtt<}9dTR~aC7Ug#Zp`4A-7&w!^pCk~>uRlJZYtSzOSu^GQh5O0(nJ3( zU;do!p6c$rxSN*Fy3Q`nVa}n>*3JayN5>0CymPiQ*~PmDdD6VT9O_H7m>p(HR$ zcLK_wqu~Cr6D)zD++Lv2R`5lHJwjdhBuAhT+*aygtZy=#Z<-q+uD)2T*0$CQKmmWS zp0cj7R?^cv&?})UFmX%k?Coxmqh}n!w z{iM}G_BH|B%Tl^M`tJrJ`K7JKL{no^BhxcuFXI=f0(_q4Vv-)v0Ra=bAtH{w&I^`NyOVEeui*ScT1mYxGA2OW*F<5zL-|PDb!+JXXSu@e`bq~sSs1k zw!qTQR7ET;UJg= z!}Mhh-=Mg%QR-%FVTuFR++*Q!A6;YYF_U9^#r_iW+4{SAhS4PcEsS7W(|StB$n{_^ ze-mG-x4);k`!|=#HOomIe>uiGDmhq3ww-Zwa%4EJJH4){9wBF|Pw*sn3J9Q`Z%M7hWk2nrHY+mF=g^ir?u{25wA-`s@ zZocUY>zC_ny8gl$z780O z=QSY#v-x^roU~2Sqzb?X*o;@Dagtx`gBqclVY{Bw57)gHeiWYbrTMvB3YPW2Je_^;P?vX|yLwRdjZf=hl+hWaQn{7L0J7t@1n*`0RwZ^XETU|1* zV=P*6xpR11pnvYToIgDs-P2reohzK3oTZ(1#MrI>jca(EpMrA z`YL*K2e>w*hB`iaI3xs~_#)ofp5g8puEWlF=PpN*W1qc+UCX|ieKb2OdzpQ_W0v!) zYm=vSPSCg6Un+PYr#v?lCoXd1s(gG&D|l-uABn7ss7Qy2chh6S|l~PLGB3r;T)X# zWoglW)eqTcTnU_#zvzE8^o3_|Z|NUYO6k%SX)$m$@zQm1xL6pd;Z(y?==a?Q@-;@k zSyxbZM(81wf~#@7&|KIrl+iuXb=Tj~_ca)h?N^ZAN)<=m}ZGn{`rQXEI^#qFoECudL1exAM3KHqV} z+1dTwGdU-J?j8TgV0NfPq+rx6f0mah#nrp&T5UM(LAo*Xz~!cVNnLe)vLVy3NDLrz zStK2mc1Uxi?otWKE*=(#iWNo8u-{M*_}xW%BhWg9bq|E)!dPLla7d7J6Lk*Vd|--> z8=8w=@s!lZ7)7^cvALV2jCHZ~nKj9F&3e{S&fLmaN!+8`$IT-%)oam$;Z=doxl?j7 zJr~?pT;H7aomU+79Dmun*aiE;?Bm%FvfJB>I#QfJx;W1z?+Bm8zdukWv@EFAgyy=z`qqa0;ui4}_OHfL2dS(?#oNe-nr>Y5?4$N1=LOdgPrjU;z6$<~z<|(NWRjDj9prfBoYGunv`^5DN+)sb0PY;G z3FY-o3`N9qh=>EyYw4TxSlTKL!72Xr>H>c_~Z;bESX~ zBUA*#Ei7!&mDleD!|l0YFy84tsj=~?v9IZ&sh0V@xvu4a`LyY%akO;OuwBRTBbjWi zs?sMC45s@@Zlj#{p40AsT<@JaXFJC&dv*Jc>`K{cRzmic?C$pNj#Oty_b1QXoDR7q z1JU3w;YX2hw2%Uo3vd{dfCxH4rZeN&CEN*g67GWAu@1boU3eQdsi9OAr~5bYE->|{ zP+1*CP0mTI1 zsROc}3dZ_U2eFW$r!GHqb?;;Pz{?lIBZH&-k9`AkjNXv@yDRAI;5_M|_MY}5*;TU> zvu9=7vp3s!J3cx`xf8uta>nEq4%`Zs43CX$h%SY~V2pYP>ik1!HB?s3F^AaBpAjDD z-sm40CW)D18|e^g*T1Fn(o@MRG02CT7$+I`8h09hHLgK^T*i106>UAqAYBwkfTQI% zq@jPZ8tk$ih6jdpg9Tl*Vd80gI*D0^R)((n3c5Rd0#}#mPwS|XY=~Gwtpe$}M|=}= z279M?&bU=qUDq(@UB^^MUbwM8x0iMt!|wFVRoZjZTh;d}#jpdE4jU!QS|77fFEN2W$ z7o>Sob4ifSqh_(93s_MU(LMP|+$_GpsuIBRhhF1rLiZ~Gvq;>=#hI|l;AksXWIuq#v)|1nT~ zNOwhO2o0j0L(mJ^i)Z&E zBIhY0rY5=|d(aQDqPH~OG!Z?ft@zd1RM_;=ILnv`?beex&wdpfp#!l{950STr1TN% zipvex^`gG2?iwFqe`1ozaqYhH5_+ApL*1ZE`cH0*?}OLxx#=E^s@&-q;)wjen+LVRsZE3tDm6WE6_Y8VNMg2NmP`D_Z z6gmrWLIq@o|JJ$7phENu^8gw)|LQeV(FEVqC^)4w|~A=o?AEF2g468V6-`;f9;ZK3(KdzhwV!tWx9 zT?EA>2R9RHFR?-zW*Jp=>vgqpqQ(JP>@y^aELL5>z`?Pir~a_+tx!pr$2*{3lE8T| zLwm$tVqdVY*xT%QC?gzza_D0yDA_3sG}>XPo)!YjxfIYezpCxjTd4WnNBBh8@E8fId?x7TTfgJ9w`2hk9ND8)QDbN_^e|OLxb@GyM=wj-UF9$9lL>Dfxq1e4tsev!i1sihZT zYFD96^|SI^ZX)lC1|tI^Zm^FtL*qiVL+;?*VAtT!!NI|$!OOv_q4ObI`1i09-WX{P zMD>0-AYV}Wq!x?=UbVZ`VY@wm>gAjl^*9U$pR3Of96S;NlI!x7! z#16JXv;U5p|66fW@_&h&0CNv0!Y4qGE@MW+)uk`A0@?!ou>yF}waj8>ApF?p;nN1_ z3a9i1zyUXgHgE~87!*E61A%=O zc|N{HKd{V?`qnEF2LtF-9qa@4|5{^JfGg62WfL)*ymwtnTz%NmFy#3 znQF{+%)RfC7Ets|#?{;gdU_~ZmstvA@*-v&vmH3)If(igrUjFq{Q_^x+N=Vlv`Xv| zc$Hpab}LuDi{!!TQbD|8~qZ`q2ZxDO-VB_CQUillHqd3L1c^ z;10CVQq*4B-|{`EU@QU-SW#)PF79R>zSDwHDHY18nXQ-CD@U7JpR2R_^n z?9(Gk@pFz6Jy680fmG(O15IMHnThOsXq`S|8bA#%0~6#T;6P_H<=IE%2}4PcoPyG4 zW$an0xUY-EgS+H`YL}o>vW>ijcCbv|k-zZo{);h}p>I-vtcAMN1-cuWtFsXmgP?nT zS=+4rrZv@OXoJ6hXWP78u;@1bRJOS z1L*)fk4>~N$wOL@`A{mh;e2_3-Sk&nLkkAp;YOT@7q|_Bz(cQ|!P~fk?1pW$;iHB+y~4%ie=FOCoe@w*bN3o=kzl zbTx7adCF_l99uDgYXJOtS*Rgx1p>Vrl=BMFWr+UiK3B5-p5-xsDYT$5exYFN0{w049c#GPDWw)&_&Gbryb7kI8t_0nwEVE!){p<|xP% z!CF`gW%y3aR^X`x<}9NkvKnG8Ul;mzt)Q)U&#V)G_wPWJcU>&H#3>Q#^q(# zvz71`p0P84-fhgxqUqopD5M563Oeq2fQR{&X-(dc{$MAJ{x{C)IK)g4(c{-jkAamHk+y?0iiJo>uU(2-pX_%lx<3!Tv2dzY6C5m0i~6^j2Esq#px;j z8MhxO)F)azD&+J2LgTq7%TUbe5^sq3*|jKvI9c5spWwHt|upQGnARw5zCPmK-?zCKCOC`XO77u zwaQvQ@ZH90Gn900ukuOj0?$=ew@jUZ-f2U%sqQ)$3AM;+z5vvhhxRM>OdO;z28?mgLNt6&qpzl zY)NjbU!Wk=0&im$<{L!)2!0;0W!hFc4r{lnwpC68hRUZthnC_AaDKXI1C%x7BXuYR z*{kXktvnOaJm3(lpk3K8Nh5E8M9#vz%EnrmK6Etqgnq+J$%>u2Jb~93m&D{y181gv zpp5*2n)uRGU?#K0$R4gVmyGA_0&45O{(1LT$1vki4`guLmG@dd@WgBBMyo3j&)=2H zx>Z_UrW|?0d+1Kq#{R4o<}TCE*l+%XW7!nWPxf>D+1m1DVWV~kZl#Z*aomI4)oL(3 zxboOp2Vw6@0v5VFwXsua0d+3js~!Y1Vnj*rjMQ{b!a#8 z0C!S^ODFSXN${&1x$9t8uHh4zWUaBT9JH*5@;$UAWDXSeRuB*Wo_1i~DG$IB*~i^w zxQBd`$j@Zj(;}1vOA@PD?Vi zv?AIBW;uI;w&40J6@e1swBHns&Q%(d?_7P-Q};zVMha_}2VQoR(NLCiWuEzT0Tgf>On zB6IZj=m6~U6S#bM8<&~x;JakdsqiZvNGoaiqV<&+I#+w9ZD8->E;<9%Itj7iw?q2l4=S_zmY-J4C=mwlGbH<487lnG?7f z+;}KxPo>ASWqe!xD&{sK0elCrFXq63cRq5Rv)XX2a%7EqL>#t??d-iK%P8S`(5ZyrcyK1RDWW2DMqN%U(vpj_i|M_6Pn}W*{$keW)cyE`^;0e zAEjJ6a>a2B7#7?Cwk@&Wm@CRwBJb3L%0?2$|G^sB?(ly;FRus_C8YIL z?y|#>)xYLy(0$NWwP=a#B&?Q0a0Q5iV&-|=*J|2=ZAGs#owUK~HRL;!IEKH$bWt0q zo1i{?5p1glWU*#ebA1e3M&hQ*5&MjuP(Yflzuvwm=xwzfB^4x2}(y-bCoaF~>9N!yf!5*Bp zpOuYTCv_P)!2Qa-2Aa8(3U_XmK;bzJs;tYPzG(!$b|4wRj3rITVS0xRAYau(uP~Ne zrY7Xye==XdjJ-~809o3TDr7EKg$Fi-oK+^sN0b!$7oR9}(6wQ|LLXg_XRA#}OI{I7 z++J#eKJ63mRqoRP%pv5KFX$L(^;_Vek;`O5={d^PVN7J6+DEygO7tMNT=$vXL9Z&c zqf6w+P=mL#wYht2Ep4?rEwTwU$P%`$*k9L@*Juf#mRBnagg0z4K9)N|GSzlK8+2r! z(o1X!=Cf+xo@5YCH3aRt@nk;O@7;+;zp*-0g>{(@Kr_4k2YYYbT}2YU?RIyyY>OL7NP@cz z4uiY9ySuyF-~@MfcNkm;8Qk3^LJ|^^Y;UXX_nz|s&VNVVbAF2jYXxQ?y}P=)>Z#|x zE^`(t2f-kAQjD06RM$tDYuIzB#WmqNG4*r}^TY$Q6kk&6AjN^1F3@z?3u~ezQ?gb>Md{ zF_(Bj&`2A`N(-P1v94j|WOS~?^XplSZlvdoRiLW>OMJXY_JW-I4jkwOa4*b(vna|C z^mzTCz8$53nnp9TIV)L=PV4emDXPXIvjp~Zf3Pi>v1U1}tb3aOdCTWxjmP-J=+BE2yP>HR0zfe%K%d@VRinxnor z9J2*j)ocNzg*RhgQ~*29F<6&(MDBY#Q_I|M%*HcU4*O#(b~8tez4S9R%@*7Qa+>sE z?=vGXPgVs_r8)@`+*}xQm3nEYaS;E_b><*zuwB6XeM(;&9Ly?PIfnEj8D?MlKBuXcf0Q46(!@?Z&6#VEOk|MC&W z)oo@dY77JM{R}qNQdu7g-=7P%o3TiPq~ks>Vb`IOypw5aCK?u_GChd>Ok-44HlP+$ z7PZ6cjD=0dNE?Q~WhC}~$wnM1OzWAh+!AgEYy`)_El9y`X9E+DnqqZx9CqnVu$OO% zs+4Z_V^-kmDj+>G(oDuawF}k=&*19`!45MYYHv^Ic3PdTMdxfoy*MbEqreC5LW{te zcL?=@x6D{%LE3ST$R8vVd))w}9b1|&acu;j6~z;<9F_eEs2_EPFRMJsLXG)9qU~K& z;;OSVK%*`V*7-(!@5QlOvty;-Je&s5qWWgtr7h3~BW)C* zo>W>Y{gf@r7-f=@q!d@f)Iha}vO{^O=4$Kp`KYh-M(t)HDt~v)bkse6GZnZ?{8TYX zoG)@BFXZsq!fUaE)X>H|8YB16%~sCZ)Ur`xEpsi!tc%fs8gCUW!Qx(UInH8UszWBB zPL+W5bAVb<>E$cqE$<8Q&TyA^_i@#5c6FZ0eU-B*_mVTqxzV-5UC(pOJJdf}9^T>zJEtN&XY6_G^WK0xQlGHQ}td$kGpNt^u~oIRBeutzbQ2>1Dlz z9-y(dsoG-wC(LYO0lba}pycg@wN;tXS4o?3c7|D&fj~EqIm^VyK^tgQDH^F&$ z6DQg|g=Rt(*yct`jsH(R8_^Ogp5xzf55PSfOP0f`A(;+si?UIk?Jejj0Cnjw*4Pr~e=9$kozj-45s7V{zI zRP>Xm(NQ!iE-EfEF?LGA)#ybLRl-?EG+9Iocn89uI5Cs|SvYy?_l;jqelGv1+62g!%kC;BxQJx1vbRUe$WljMoYIVA*6&p7QWtnE

TC9?nsZ;tKjjzV9M=*%Z=GE6 z$}*|!P3f}IxRQP))k+J>rk0mh?5v8g&2UT?zDm!O_hbvE6(6MW(7nMugq_@*n9Dr( zc{lgn>$l2(c|fbce}cXSEem=d*gxn_;M%~~zJuJ)>7VFt>*uK>=yp7FO~yP6MsZ3CnYe*y`a`QMb}|ALsceW$50Jt^`2}D8wT%+>a3Ri3OACs%zw-U z<~VbnIl`P~UNf0Y4qPp+Fsqr#Oc#b{Uf~?S1vuF~syg_u%TOn}fI9F5=&}w%t+PQY zg^OjLuvAb9%Um|+3Fla+uk(`Q564&gVf$wLV7tlw-S!A>=U;8H_=>j~?IY|r?Pd1n zjysNK&RFLJmkarEt{5Zns5|vV^)Qpz4>zG_)CgdCbC~DQy7y^1f{z8>QH z7_^}n&v}iR&-~6L(fjC`bW^$rehSmzlJA1UTJv@XMxqa^DJ)zZbx>fmfF`L2{&fwW_$Hn$6*s%){11_UGa{T1WmL6Xc;^Lb zeJ6kd%tnR09@H~-xKdsK2Dm|926fp4a4Bcw&vmHQRLZqbO+JL*(~8&zKD-&I))mr1 z)}T6}4zvq?lXs{~(DPrzda{@r1GKd!C6lq_Nw{Hl$BDu~<^kiJg+6Ektb-#mF$PM|5KhW<{(D4#*Ka4%|?%kWx-|6>~JaPxs39t2);8qS+9p|G=}7fB#; z-nikrCFkBdiSXZ{b>dxslY|0C`b zmw{F+K@1E9R!|eaOAY7ISUkZM#M>@J)Vlv+Hrvn}4-pR{^kJ=uNvI;eLUmq(a4L{6ZujOF6A42{9 z5hA`=CV+m`SGppCSE7Gz0?{c)8+}kA?gr-m0w9QcflI!D(_#+#y@asAS<;M`5#Fgf zXgHlv)g_>{H!$C}Vob(i&b5X{FcO%R7Pu!YJ27iin1$|m2ik7LLoZ;2zcBC#zyc=W zZvzP2a)Z%qf(m*R<^zjtXF&wN20nENJ+cBL(GBQl9e6W);Qo(NL`^cD{wpxxck*Za znTkkq$_AwxkltCCmoI>Jx&y144JXCT5$fzw9gv-FAxW^n=ZqdACHC-6$65(vz%7f`l!%6{c8=4v@Gzeu!r zDCYM@pe`5whw48=F20Z7dI9IQBN(|t9DH=s@MX99Ni5t!{xpml?x*+gv|n63qF zN|1k|CB;xL>6LJxrIVq1yN=w&U_J~*jGe$ZWJ7i8hFMS@ZK?*;N{7+U1%7@Rb94?d z1icsz#4ZbH^?B$@m!LN${4Zw={a=n+g7;1-574toh-G(-Q)i6DXgvECJm-1*mTTy- zbBN`C@y-&wKL$}=3&@`lztxUj{el1cD4u;bu(!@YK&v4Oy#^AqU!Dh~WG)buqu8%c zKsGr6=79maj5fd{H)15yp?B>fZ@W8xyk6Ez;*>xB)aw|Ch)Wsk%eX1}Hd^ou2wpO>KtA$-qL_ipnt=$yDwMEcCSJo#ScUdA z1iL=Ds#j(JV=_F>PQ4YktB_Bl|xL_~& zg49o#4$Hrg@JIY@XcdgBJ5o>Bt*GdDvQBvCWycjPwoRJpR6Y)myE zS0PejfXVriO;Bapj7#smp+g=_PiHQ{>824KM4zOOF^hn<7DKyzkUB+<1A2LtOrv9% zD&S3bs9Lm+tCXBNFYzexMeZU-NjH?g zaU+nLJV`AhmWY>xgV+~M1@7WU)Pg!Xl>D8#jx|w7=E){-d8SHxgx%svay{xP-!P+I zg1v8%uThcQVEVdD11t1VzJd!C39Z{a=?hsGu0dazZB#otls*e**LOHkKcW-h)Hj=) zz#L$#z(kQkktoo9owpoN(bO&lYGmR_Z$8(R!olFoPOzmS2>L;q3 zQoTu%T21zmR?7mjL|v2jp+76M@Q`sC`e>>%SB3Mg^|Gj%&%U5~Y5N)$uz$F2+P2vD zyQWKH)gv^eYz=+|W_ljj!^6}O+$gHL)ZV$)79~U~+qvu792hR&a7A&+nl`F@VubvN z$)G~SQ^ITeN&8*Rf8JLNx9Lt~6SfPyCU?^>ncqdVW3Wqb^_8}A!woHDpxmJp2nDM%1%zNOkm$56m>{MB=5o1{oqCoCNYgIkCv8pVZ0J};B zwG$!lv{l-k5F5zrz!!a?%YH}u@*Pw^)ir2eX_|AEZG}@S{i!6}urbL~P_& zs1`D`Y!~Xn2Q5hK=NRfd>Ga!%_B69gFp7JydjCI;&H}88w2$J`a~m$HARvf} z*xlXT-QB(Fs%!TeyLP*}cDJtGjf#Mvf&tQf`%Zty@8NORRTuA_nLG2o|8vgoRL1&X zI6ahlC|_}xI0bJQoyO<0A(~hIMz`mx(w&(V#4Th6n|n1!cV{4V$giixs_YYoD|Y!N zT?ORozl1>PHCD!dtC@l?ooQ*wZr5f|ze8VsN)&hjnU>@jZF`zOiRfwL9 zM(viidQM3-&;=JOE>@dS^XQ+rbMtCdBttcF4s{0E(dKx^A!>hmy!xM1Pg{h9k{#Ub zc%<7}Ds$D(_|pdM3o?!~_}{5;<*o1n4q>la0g3JF=uvykF2x<;HZzadEPizNcT&y= zLKX5fZGzVVdlsrcR!4qnvgFWKD7}T_-re5Aaz9)}<#0?WasnvjKZJ?SXRcwATY4+| zP`IyQb*2zQPCCSUyB9VqHQt=T!GM_hrWvWfNbZTf#pgQj~deO*BXDpqi;Y z-M`!Wd7sm>=`l0PqqsO8R~-t!-{Fu1SFF<$K>GUsQIh&+S_ z@#)f4K`&;}CcZ73hp9rI@Kmf$Zbl||r|^es5%RivqA6q63+e)KwSx4Wa$bH+-DTfv zlY~J^4)xYklw4ch zqf*!vOqH5RvM^jc&0b(PQg%8^y)BoJ4e1de+>b*prI4OMj913V=atFYA!ZWQSoXmc z(o}9F4|C1(6!8oEcKD6whlxSn)84(_Me0gzI*7b8sFCtjXMd1!(|ud|YII-kBX=#~ ziqc+tfPSm#;1Px>JJrc#FD8~v)$HOaVYD~{RO|BOX!>{N5Gd~_;DDJ5A5lwkzw%fl zm4RASx-0vV`c7uiY2bWTCN?N85V6*Xi?yCi7ruo-G?em#kc$o!e@g!#xAjygRD-z6 zXiMx(ZPD_{Bh*PeuV!hFrG4HMX*I6sgQv=k-(h-?PvZ5wCk?1YI7OpD?xzqd` zQiAiNvs@Pmu_|DTjHiO>ha{<1lK;?tXUee}Jrsn8X6Om*t#0tv!0RZ(OvJD5#QMS) z%jyx-DbhrrWL4He*`?v$J>IJdp|kOb?P3pTqJMyN97lZxQ*jzSOpNh5q$2cE3gk{D zU8*jps5W8=D1>eBbhE1dVxX`<{lr9YLzq+8clW0$^^w$1*#>t1Iju+{g$hzAy#XxH z*32F3%G!}n z){F}iX)pOqY$DsVS)>5BM=z}>Ige_?oMD@y-{d*gFO8^A-jqBcr+2z z!aZ&{_nJv%YQiBljv|pR-$mXfo|A#hCw4oZuG4f~^m}zt`~?0MH;LQ9?O>;YCHR<) zW}k4)bXB46tVO%uD${N-4)>U==>O&BGCY^f$M8jTWv!xE+xr&$tJaP~&a>`8-tC@4 zf+qEXM=Kfm>lqR+baa1lhC5z4wmXfk%g$uiNFhpXkKNZ{Rh9g}A37?R%4yOU(MP%~ zeiX|}SJBva30byqs(_fQycP>ZSvoF##nZYuJTd!J8ZOAo&q<=t#wex%{6-T>}W6VrSPY5r;?OwBFFeXsb| zFuyWP1dXZ4(3aaud=PdxFF1bKev~Y<9Y$93GaMASmnNLv_{Jmta(r?$7o+CE>-oLQ_FT zfmjr7KkeQlwIKS?1HnJJK^+1mwz(FnM2LGmcU+sC-<@0Cmxar+U9}Udk@i1H_n=x3 znwo_i^(*;-yjiIz9TNHokK{|#V2-7;h%99$vPr#_TJixfjUQV;lelinPn`dI{G1a**2=6Ayz8Ovij`7P>nMWu06Iy`-yGbq{xU_q-Nsp?fq0{*z+rGP?`R-CJB0 zbQX=Jo04OQR@4T1C3Xl;a8)+5Jo9~M-RNfwm=xGJ@U4HK-*>-z0gk{jK|=$x{LcFw z4Hy@^*K)wKJtseFeXcuS$s3wIGCMoxec?T473nCM$}iE29L2PyyV6&wTiPJugME4N z>w?VuItBk0J}B;2y4OC$7}7@Vru#8%xRu;*%x$>!FiFtjJ-LpzPTASt-O^LwP8DdSP%F=j;{Ejf z4O8^AE|B-*e*;BvB%T*-*>rvfTv)lLjXr^XHT?Sp9txBL{s?MPW(AVVt3sNWxfc`> z+&N@cKyzhY!Opw~`C_gvEBTu}t?>JA+2xC!jy~cAVi8k>uVuP2rXphozko1FHHGS) z-<{`61B-SQc=G)Umw=CY4aMex(if$UmPJlt9ejqarOv`#r{_{}IbfqMcP!qs#zXlG!zfKL98K!Ba^ zn?$s>SF%lYEVOMe?3wM%==yU+c2vQhBA?Pr&aa+t!tc^SEsr_IKj8kP1IQGz1sY4X z%Uis+T{j$W?Kf<5OZS)VDV>2F<0GgvPo>Ui9H~q7Vb*cM;0#!Gf3t479rmp~l_Q|_ z6?<;D;+-d*GaV;f?L8OJeY{raES*%lX)(klGL*`MA9w>zvMt!L>Sm+#lp4WGJ4J<>~dzKVTvRaxwH5;*#1+ z{wdz{PIb3&RgHA{PY%!ALRS$Gh!Is7;O4{ev1Bz!4B7*$=ueo&D7fR z(cHs4)m&g+4F0p#x4*B+TFZZE;M~Bn0G#a#4lesw*>xdRgL1fjs)Klkwf+^mJFimq z(5&pN-!eP>jLd46RXZ~`E2f~iJ zVg>IN&mZp9j+oNrMNNv^mj>7>*)G^xJ3`$lULU!MRvlE4yYwu!3;2f@aMjJGUXn+_ zK7K^KGC1)IxM3Z5CH4=f1W7+5WMR6wEbtvX+eBC}*a_r&5!c^7g@azEv?&OV%- zk#!~Wdsckj^5R{#24EUib#g*?HJxaUsc|S(4aA3M+9Hx26?q zT6n53KF9y(?u=9E*Fh2X&uIE1Gks2Wx4a+uTZ-!08atbM-=eVF4{WYS>}U2NFQavR zs@_*u%7yW(*jdy&B2HbYWQj@MDDO&7b9cORld~^Kz2iMKJ;k0#v5(wI&C^DbGwEt< z9_|tG`V8Y@Q!i61a}8t&XZbv^9I~wSdF4~!6X#>_ZRp#^_a;0+XMD3kCW-f%?$gE> zO}qN3y2HA3?hhuKN>n?d4|%-!#naOh=c?(@+ufxnOJ0>Emy9UxR@A%LrzEB1ztXX` zA@;Y9ny%{Z)t;B$DDnL-jwCo8erg8v78*0)KeR+R;QzrSxUITVy`ZdyD>_YafmL=C znXO=G8%yAuS21aRPV7Nj&SvZoH=?oZ74;iE5VMNvG(#t#bvd5Oq3Y9v&|cROJLR)< zH_YPVm`c@U5EeTzBlc^*);8USBHP-eaF|tt^4}a?~ zUrUT!h@SGN(hX_9G!Z+}W>OO=P%0Lmfs{EwtR(u2g=lO3fv-X#2;K3E#XKZB|B*;} zynI=LZz#fmQcjDg;Tw^>i|Af+9JHS%JCX115zz4qf#b zTB_riZ_Eeq#&eiV<{EP!itGXCt#`p5Z^zVNIHrI;O!uH&n4AuyoiBV+WkRo ztlmV6_*OYgPLeiB`LJSWgI=r%M9=FlhfYfYu9Q>Dn+T!nfv7KyjoWE7Z*1<;>hj@w?d-g8&tDpc+!?d3h}wR5bby2n8cn@)?xKL8&3U3=tggkY3ml`VeaA8RzvD? zJetCGt55KnLH0xTq$bpsrO@V%L5I79Nq;63mtP5`P-rf*h{Mn;vOwJGjNIBPG@ZO9 z6VTg}L%t%Pkf+GKPDf2kgq21_SJPh^k5Y&}ldhk5_jlc3#JhX!dXb?K6 zy(*N+Uun7!O!dn`AFhPVL33zXU6BH)griD985W?Ar9pj2ftqQQT>5qdmMVoA*e0$;ItWw ze=dV&)Eh~SiO}CBLrK~Md+1p!pnC4ZaeWAtGY)6|DAJA_kx1x^-~E+a zv_Sj&3I*#S)RuS9TrS}&39nQS>Z%^EuIm3^jSpT+1ag`WFts?T?Lbm(B#!YAq_a9e z4Eb#0;+pooY{Ift5xv+ zjnJ*a@Lt_GVj2HeuYT!2FYr3P<5x($|BCpt4RMSc5^ZpvCjDQ(Y!1bZ#`XIhnW)du z+N(h;Du$ZyD+@RodNR^8(3FnjxGaTMv>h7L73hYq@LhkYmZy+$jmO!!0R1)*$JT|P zCqrqAH;d&K#r>f6vw6LV+bYMfopn3S&|o+I@Pi)*sWun(#gJp&AqC(dX$> zZE_Xj0JRwHQ7trowMgrLoB(E~#8~jJDz0=yR49>MYNp(hevsL?BP^#H;TVQe>%rz5NXhh2(1_nq1j%ETIfrVAxziJ>KGTl= z2v)HPPm&Vq6d2nZK*o6v)|n4|ncc^i=XN5+ewGTR_TjjA$oX2b{7~BK_3<7TR(iAC zqg*D(U3*)5sI!^V>kM^ubv$!qIdi?VG+Z{yGU(*7&_4?47HnNEpNrDf(seZC8;jAJ z(%wAM9O!HH-D-UuaLxaK-~52NfzN`hWfljm_UmDZHupBzL6^^`4kHPvxK223+A~V& z5=X)7Y)4jJ*6}Ri=f}(;Swk{!WuD3EoEu-bx8zl6j;+4qo2y7jl{vK!Q5*c^Bh*rw zV<&^}-ii%odc&*J1x&9a>`*QqJcNJrX7h3%)mqtqXF#ps*w7^rHOv1Nb|u6b8ddge zkQy-5U$%VLzo2)kdD2f|i>JiK<$ubG%(|UX@yE>XEx!&EiecIzpGp1~T{2NZX9A!nnA6!#=ZQ zo`HSf>!4ocwnR!5#7J9sNZ9>y4MP72`K!#kfLmq@e-9Iuw$fMc8Aq$a`B~od2H$Ud zU6VHJ%gYqs}7QJ=0|LvgJp%p7Ujc!+dYq_OiVd2Nh1&1^Y zUg@{M)Qk-zzsaKT!;^2z%ITJ|=|`P!KU3AuV^W++aY^-)#E+Z5#C!|S2+nSu<6mI2 z@m`nwA6cHg3!LI^a~GfTXfyfZOZrSS4K>~{aQYH%0JoL_>4nYbqV;XftWTWvV8HF5 z1EF)G{;pJ5p?!HZtV;Ogh-+aR%MJ`+eL{71YL3!PXyew|V)K;rM&B=_F8uO)%H||0 zp+Q3Tgv6v}pC+ZA`PTI(lS373v;E^fDorL@u;KavrXA)OpW4>1*4|dqcb>VL(W#Hs z-C>_IKj|(^Fq6$BaI1}jEix;OA zD9s49hhav?#scCZK{{1O$n*3KydOjrdV6GkA|roc;;3UTrA! zb$N@moLWB$Qv<)ePcBWY_d$I>>;2vMHi=z6*7;QQ)$iwxtmXw(Y#Th=<xpR) z9T533y0}7AWUF#RgV*@3GbFHOl{n9z&YLA6Ij6tX_>z+{EO~HZzxeHMnfJc&;}cFN zT}*zH7L<7>=Ry7oTO-eS^$pVsd6g*N?tT~jq64^q3jX{35BbbAUe&+lyRgrg@8}&a zA|j~ew4ys~I%&!Ddl~dKv~H9ZGq>vSN-0q@D!iBfcDax=gcd< zo_p?l)aS#=yFb=Qc=EpG+t+da?@Qy$B>E+fPHmMwCg;zBhNVAU21TR;^@B~_d&0%Z z@G~l);>U{nBe#XE4Iq4?^!1rkDa5n0)SZ9t=eSf?a@xlpi9_T4-%WmVGHz>p$%l_g zFF&Px9g$f(KfS1%BTRZlW^)YAtl&F8U}#`M;NZZO0qK6%eEXVw^nam?&_eGZvXSVl zMSiAx@@a-eX4#q-yezDGg_M}bHKxU8R&-XZ5i_acwy5UimIP#(@AGX*UcBn`6ivzT z{jufKj*m*>+W2K}8^o=8Jtwa9`&tR{NsiAizwgSj6u3%fx$ny>>ALz3=B}UYJ9)s zOA*g_<)0e#DQI=j=b$q|s{zhXP|P8 zQ@<%|iHFQt{U`Hm|Ib1D!;&iyv5#u5tZ}%?qAKR9O68-`_abHov)0#!x0GI7?HXIW zDaZO_eM+swqaUbulV8WY>ipvB%NuW~cSqtor*!&yGUH-ic(KFzQC>{{rQd6A=$jsJ zJ2<9HQkm*yDhK8JU-bQIT7oN~CDWO-gR{H~6N4lufK936>>T4gA3kt**NL^>$keB6!D-^&g8v4xhV$vJ)yYvL{lm7dr?6ksCTWet! zp>b)(tv(n0wgvVMZdxX=OzU7ZAl9#=&sXCZSTp_U*4jjA8klLSa2^eKi?kwYxZYv8 z<~J<(Kv-nO2C=>Bq}0!@UAvmQ#$Pofs#7t`BP#|E@vUrdQst!_$DM-IpG+E^^gjOD zyY$zOpPzmj`DD$rv9I30$$i%;Dfr8tA1!k37FBoN5i3)J_)EqHzCZmF0y9BCni~8* zXkmcY_pMnqEaA^Wwd$zcL)NyJcdK`mxK{R2Ich&U(kT0m3$m8`5jiL3c(vN~^BaWJ zHPo0~`*^MG)xTBR6#iR~==;U6j+pD+RQe=uKnD9|Yl7iD`S#zJPoJee9`VHc?7%C- z8}@y6Qo)xq=~HsdMG1~q(i>_h-^_U1V)a)8+k@?RH83>rvfmw_@5UaOU$vBl^=K7hvk^Usz^pxI1cHl`%C!>vw4q)#!X}PwfwNt+ftS*wCBCnfV`z z8@Ma0ml;|&&v?-?)6WsGB=Bdzqkt*_HT=d{_8Ss(<8=*~AoT>8c9G&6??3JjF4B8h zE+Jk~?-`eVmbFcAz0iZ@%T;<<)n2np{hCc|4d>VSQu{@nc{O*(EQx$x*5Kzb_)yP< z1pA$WT|eii9!WY9|K;7RH>uBSK0Wj_;6=)-`f*F%ITFf$YW!`$&)~d4#mAgi#l}Qi zW~MI2RMF=z-$1`|{^$K7tc!gj%r6bEbRW4!^fRpp{T^4v4q_j{i2e~t>JCrUNH$BS znQB?3z+)j%<-bS2sZypoU#mgA0}W2sIbHK)4W@dP${VBBhVJpFO>en#YJxkdWL@s> z=`&JKCO1n^-|c+!=w;-~zORP9S@q`2+shxWCZGNi`XeMOG4Eq>xa+n!9ckigTw}vj za|AMR)vW`3qkYa#a zX(@juElQk{@c!NUx98ra#D7m%|1s#3?elNnjhWH8jsknhX6GEypsHw1t-wvwrRv`p zwizoLKN~vh-+@2%mdymssXO@gGvM6pt&K&hB@z=3_zswD+yi}_F~dC7+9RN4aAw)+ zVP_)xMY7RzD)q1ITe+xWx#;6j8zT(mPL*jEDESzT9oh55N%@L*f}Jl~oqHf_M`qfO z*J;_GXMLXf<>;5v&wIX1PV4!-P5R`Y)pFAEPZV7&-Q#e%Wr0-|YhA#hI!ixi|K%og zi{YQSNw;NZFzcwfl#@O}fb&7DqF>Q5*qKbCPqSuSuI`%7*Pt4_#xv$EmX1EXe8SMe z7JxO?8Q%@QReb`jzF1-UTdtUYL(XxuAp<${@$6vgr@9J0v@gVTDa6&rImTVh8|B&O zJYer_J5$=BBUoP?)lm34 z5~*?UwwkGD!~!iujU~6D@w^3jQ{$++RCy+XJ&&2zUuZ#114FD5I}Wq21>8NZJ?GDE zrdNSr-Is}`uYfT05WDM&;I;;+SCo8NFVoUyOt^fcfnr_Zwf8;fYQ^3{ZzXS{r@-48 z>S9gdsrRCHmGDilfjd1{^oR?kkCIce$m3+2oP!@7LA46RJ1JI&U@9^TtdZ;Juo+18 zLrVSyJdRC3GW&rYVFt*lyO`6=S5N^OqB$=V31JteUIXcsV1uQ=7qN*hM}L4rs5|n) zPr(T*2R_XdOc`S_om@x_rdm-c|Z^uZdb@0%mP8obl0QF;Nxn_-^Dv@WKi~bkWF2DwL{BwZlK( zqX*y$-1v3K&mal4BC;`$7y|YBxjGD9s@m#P%;9!|M6*O$1-38lb*`pdRzj<>IUXI?cwcih1uLh z!bwy|4xB`bq2mI*hy8}p~CnCuiGC-DqjY;IyqHSt=D&9TxqhtuYB*j9KVK*W%11tmlT*&WBDJ|>>; z;A`)VSMvwvo=eC(n9ePR+d3M}JX=9{nS`VJ1J~$MeA*|fteUPk6@wb6<|yrv=_$m- zdA@QJQ_N`XvpO5|xI!@bdgE*!#<5ik`!%Q5&A) zeK<$E(TMaA1f&h*Zn(Igqd_MD^mhTrl_N*vC@;i0+>767gYR<-{_A3-aXzUxq@I{r z-&1bE2hAg0Qy>c9Y@Vp2&M=r?LH8wIgK1`(2k?4)H zyGiK?|Mv-Hk#dBdOw1GKDGlKM-Hra>NlH0#i)_$-!`*(f>?__=(v)eGQ5EQ+@_xxl z&6WF8y`)$8wJp*ec`{AQ4YgP7VzDD;kQdm-VEgpYEZ*u=y2ndz6_2nxN;m_Y_&qlPFP2BQn!iNnFJ@ z6+O;eVGnZ<3EGir73DmYBnC;MT1b`U-)l~>5ozIXbHkN}_A_)8N9zm79_nP-mmVO- zfC03Rxywd4J1{%dYwSYeo^(+=C#_%(P&>fR7(usI)`41d%R5Y~#tOO%&O)?`Tv126 zX7JrvH$0|aM3N2>{HV|L9Qe#~=@#ljPmE}y78>SxyDQt=3*qwLrS?M}xw29!AH!6( z9Cbx{O&#J7c^zo5pG$e9C!X?5IsTolC)j3<;bXfeb!Epzy%J?ewdmSXuf+6y8@4xkjZJsqtKAG#6h2={qcH73Kfif*DTAsuk;4s_0>NAT4RkzzOY zD;jMU$T@bFp2^QJZ(_$%sUqP#<4%m(py;KF|p&TNHQ2&r^*c|#2JX5v6v*NW5 zptjAF<1worqJ1D^nd7p>J74ri=KX}ymAS)pq$?2H*%!#-jS+XN8|W1FHC>yVNmfvM zYh9#q%u3D5Uqeb{ycY!(+Di5^?WF!-tCEjBBi*OnJ&EqrBlfweitZxrZzF|X&a=+B z;&}GEVXeLs*IVi(PWHTVO_3fmFAe8)!#Fo%5jWVjcy=f?sl7a7*vPHZnko~7Sq{Nn zq~%ka*mSNLGgiwLx;nz;gHSSRQG;j&O-;8+0ZP{&!V!VtJM+aArpGrr0ru>m;tWsD3`Y_E^Mruta!J9Zweh3Y|4RcGIi{1TB^&1_CY}q~{lKKh_ zs|izueM7Az8lq9K5jBuWC4WQzNIkF%GBhiF5q)x()m5^U@S{taS9CsjYHgI$s*UQ5 zN%Iyqj=oR!my@Muax(6IdODTdMR1B+uBN0)lssCA0<&@iXgiOQO(=sD;NMCW<`EIb z>G=c9UgT4fv>9?ukmKUjv0(j8r!t7a>RROJ1Ss>#S{_J2In+2dny*VH$uosa=@8Le zs{t=S1?B_!Qt6GR$aw4nmVmR>mikQaa(!_oTt@rkO?d5vOaVKReniZWymB(U2<7Cv zWMh^_FXTQ-$1NxQK?zis-_#YbaG7JYE+|FfXZ< z*wqB9H$b#&juyR|@H=NwneeT)RGNxy#EsfYvIjAS>PDu~eP|Q89sJziz_v|8m)c~a z8vJ>QK1s$>r*d?0a!hjV0FA*A(gROAF?bp3#rG8$XmvP z33v`nNt)_QS3?un5b7mVv^^{w-t}N0Bh?nO>48Utk42 zO`C?~l|}YbIx4(21076X=`{4wek13i^~no;^M|?{6o{wvGs>$yQl^W;gp<-Jq*a%x zBdG&af2s-DL`y?o=}a{oJ(hRjE}B6}t+(wUN4`lNqh#0aeW2S9HZ*rpc z2l6sEq(HTdc8drH(Y88ifZp0hBei`}n3RJikQzumoKdBMN^$l&FDEXrva2`-xZkg4KI@Vy)Uo@uHWukGxpDNFJl_L9cuWU)VZ4Z`a8S z)Cy}^B>3=cGYf>tEj!$Yi__=aSm|~ImmKwD-1?IV$rX&rX7Me zeh%G;en7n>)`Q@fpeDkLbsQ^pFEYC=uop>DQdLPA zXS*{oA1e1U+)2)mbtoH}OdsOEx4^ZtA5Dho(7PYu>kM8~4<%Xo0CsXq?5&p)m$bjY zcm4p5a1U^+>yuBBCrl@Dv97IyrpQqIzu%EBR*-OQfjv;FLLyau0k6s*dE9VnGZK7% zBH?;RI|>$MBAJeTD@C{gU{!5A`494IdBJb21V73*K`Xmk4nGR_Sl`6u&?V39|w!w)fLPUoN4pmsbF)BFqcJ^b#(aYl#zSVnjnNt@ToIjf zhv++KyRAldr=E~2z(|-)nyCMvg?^<==w3)fuEd__2r{sC?5?J0HNl{5g1uR7at?Tt z{jjDOriNin{0+OEd~}%oV(q%HPdln=N}+N?4ae&&gxlg8d=Fc|eoja4>v%N}ZluN7 zw|!N2Vt;l4&XyB!JiGwi(~X_mQf(?ctY4{RbS-27QkXG}4kP5Lc%>eC7Zkc6E|IIv z*MakGD5zU~;N!c+xS2Vuhpol+K`Z?gu;XL6T`UL6;zf#}4kOV|z^C<^5~+{WYU&)> z7Fmfd%5|x`*h{$Y9pYUBx$X_94o@&!-r(ut?(4eYY~^%2D5u@o(B0Lu$h%EwE#`_} zrCDG`te2Z9Cg}MCa5So5eo}+#hgQ8U)D0?|`bmAI@^I`&!H+ZtZm)f8TQq++<2Uf- zbuV?*^%wQwhUtczhI@t*w3Bx=_A;(FJ~4hW-Z73b`WP1*W*O!iE*t6?-s$h^E9ejN z4ELBZ(m`l^T_HCW%X_Wv4$e4xrfr_hSvsxMQu?4|PDy_8xZ;4~2E`kT>zDK|CF~m< zQ7*|{R>;J9aT2bwEy#}i;t3p6Gu23B>YHgITBp9lxik^ENi+nv(z(nlr7N@Bqw zJX$odsC&`QBLCuHCBe2wcIdxm2hVUlrYPHF zUumb%+dIkg*uBU-!M)vWb1(F8-l5(H-j;$SJQs_lAqqGXWHcScdb$5}q(L$)GbS4y z=r%|yOoYj6Bu!;aQ%w1$HRhU@ zyB5J>@v-_4K2I$}E$u83mPGSL^Ib4L_gm(f9~r9|SluwD8PQt)>Xn=swyGul(RF{n zU{Qg8fipj#pi_Z8e?flR{O9>`1%X9hi+kA)I?H+2NmtaZq(;ZH8VAk{{}x?r=h%Gk z84ti=R}U+)o7zAXxfs#qt>wAyy5p?u{O)i%7CTqC7Q4IQ+?04rgyZ5M$tn+0HmS1K zn+&I)Gt0Oie6&6c$9$~uq49(9h4H4*ZsbjkOan}hOu^>y=H2H1;L9*rf-MG16-!;q zK+AedsioL5-sgkQS0AgToawB7Cl^6oP|gdYYqI@S30It0m|0L%kW_H4Kv(c3e@cFS zUhBN3c?Efc3i=kQC4(JJJmJzOwG8!|In5RGD|JhCe!6wM#*O2W*oiF5PGP3eVbm7l z7^t(cqRCs^ebaf)vE4zUm#V*OJGujJdg}|B!bve&S|mlw6_l2k_?f}5yg|E}LiRBC z0{s%>_`AG=udgfCo!3tXkLriv;6p_0-Lo?>z3h;U14`t{UdnukgMWO7ZeZbr@Ds{&ZI+gx$-=!R;HsjldfH27gF* zLI26{$=JX&0}UsaO`A>4Op39V>9%Q@xv?eCr=f4KHPu?vZ?4~9zf7ygcbV@%cy}K{ z(Ho(A%=%NC6kOS^|Li+UyoK`$R_8a#Pt7}*wtVdtycxo1>6P41y@q`DD5^4jlun@i8DC~7h(dp{`?xsXUmt<{#Af4Z z<60yr-hn%I-%!W+($( zz07uPwvgle)0SPlwXk);&H}Zda^d8H*ZJvrXLC2@6lM?0>6be{|76j9+dJ15VTy8> z=t`q+3mK^n{8c_!cS|=@pQ1mj&qW93Mz%6Ng!o%|AujP|xL>=1K=4|JPZj6<)3L(Q z$kEiX+p*GVa3A!X7A{Ch$|N*w#$c6s7&Q33WG?1{(X^AM+1Gey!+2UZU$%Hx<6F}W^L5KnpP{~weG7ektPSv0%^GVxWexY+;y2uHq+f=$f$tI%p(~*M z(3@S(6X&R6mrG}r>?qn;c(vf~{8_ozvXipd?0wl^bJFwn7H%#%YTx22kHlvqd8+!D z_=sHTS?-hWp5dzTv9XG=wc)Am2{(c1O05I&eXCMd-XK;NZhDGb@s5i2ezpi(m~E7; zr@hFr%=OHD(PQ_iJW*{rE@43hPcU_kLu3>=jKVzQp zt#LV?K^2TEjj^~A8=9Y(XILIvURZ`%YU4h*!$SB>^{MFl8fS5wb(VFWug>yLznFbY zu2IWNg`V@SgU)-7y7r=y67+Gt$`^7^=hVshoYOFGNxr#oe$nQV^|q&u1Xl%b4qD@~ ziNW-Imf}0>>gs3f8|hEzqIF04RPGqtf_a2>|3Yn^GFG}M42H@jx>(mf=X_@$XM{7@ zdEB|f^{@M}r;-pSPDl2vjmm+R^nsX;w$|$4TljJz{5`&{?wxKlu7nSItKksd-x=cy zqYG<f-%xd@vt}*>xeW=Q7lq9 z=&a%L71^jvR=z0BvG)4|t8oHr!k*Z?ov7y&dc>J9R?o$8{rQdjR(>u&16`hH zc@N)MHyr)13jdnF!0+e(;qUM#_;dU!ej-1WKhKx)Lv$Z-f2*iJt^3AjaMihZb~%#2 z_n6Q0AJiwJjdlsC^`TNvkrTFiysmD}%l1jOEu}+B=aud(eS<#O>bBFi4)$2bFf=!9 z@>qqMxQ~}gPvkyIk#agZH3t;1TUY~khO%%Ep4GDGKiGkleJA)<)2M1_^|?bAfoiss`3VK@14FYz*j-4K zUtwQ>JRQTeMjzxLZV&odS-uKCn%~PS{Cu55$D_oete(ItK7$oj zPVJ_wksl+y-cg(mK0=A7t0&LB)jiog6KlYKL23*3%=6@X#(HzT>x44mO|g}96`Z*j zawjAT9B5%W0vb*koW-edVqb!*+lJj)T{KnZ*&fflw73elSX zt3E67?-kgE{tLd)6(~u?L?GHaHb5N=!5&~0wUs&s8u5PWI<=3wL%pM%IOiRaK-hyu zZWpMuS3wuHHd}z1S0yl~N77l;bSQG|$UWfqqu~cS zK#}ly41?K!Cj~(ZCw>J~%>&rr{xEWmh zooJ!mgiOU;q(9nVYLZr?ct(VDG%7_Tbmw zfUb5C^Rn&apP=#FAdi5QM39fQC-A5jLg$>M*3z~p`_*ySDVm{gl3I!6i~g|}3Xf)p zsmc)CPu55arC4RQI$CKX?Gg5Rs(bbd*QCDE31OA+Q1~RYm-;9%I5z(&cI6rLzj^5P zuwj1_0@wX#FyXpkC)wfu^rHZLDkI>MAAs|A0m%h_vY0f`U+9g{(vxvbHfLXQefYn) zMD`+!&!9fQDC*{LEkHGVty^TsG&I&dWLt7mbU*byjLnSSbz%HPa4`h^ZT)h7F+|S&agIU?%t1Hz2!njPe1oqcdRGE^V!wIx!Ez_`N);)p5wmkDse@50+8Aq z3mv_cY|*7B*9V8Hxj|K>L!RXP;=&0&Ux#!bdI#(_qiaXg-kDxMS_ zjfV`h!N+jP@Yp~ZD&xK~NPk`bRNqyv>L_p<+v>YxWz}BqgJji5HVb>$EKGKNi6V7` zQX5p39^MpJC#2|4*#0TKRkE)5Y+?7p$wkMD?1gmEj^c+U{Nc0icf`ZUm zBJh5Flridets?HJ7RsM~h9uHpHklp3t>Vkz*>IH4!Bb&{ZX=!*9dxyIlaMx@hM)D; zjn-|`8FWc}F@I7&O7EwS(Y@ktVx3UI7_DEe>x7*hZ9;>o?j1O&xA{x_H~JQlr=7=4 z?7fYlmm}YpN?q;4MKTT0xnpN2CY-ho!`Ne42yRH!7!OgBKL6Y?NEb9pu~c z6YSJQr61U7Yqc?O9*hD<{3JNyAJL95jOoSx!;;)@>{s?L?mzU`P34lgZ0<6ii9`7> z+(N!R)^w!qJl|BeTK81v)ycXX-6E_aC*iza*CpzX>&EMCy2kq7bSJqqwkvms3uPLR zg-BlR(7Gv|#Zd}pw)wU)Fmu2FIcYXe*H`r?4nQ?_t>H+wC|Z>~}9 zj-G?w#o|42g+wU#k>4BvYGZ%m4X)Y}auIQo+(yaNe)t=@W17^EoDM$PUCe!}A>&kn z`}aPz91tuuvbZccLRZ2~(1h`mToKhDV00`Z(P&-5Gt3zJOoC%||P{6BD4J+*58bd@L; z4UQ>6-6xOYNl^xwzLvyDO+pWm9ln7HT5GHgE|7tkTc(m{s510<+6VKwcg#z4oaZvH zS&@^uj#vqW@J?<4zgZWni@;Rt0UxU~@{w#J+XC$X``GbFP%OdoBaImb;%EUn3(jF5 zGnrY>T)Py1 zI`SRijzarNM|IbH*BI9>_W_?Cn9*ECC8=QZI9Drxc8=^5e4n7_y(HT#f9b_KSo|=VO z@gq#n%Ft*eh3Bk4vxk|&j$@m#tJ&GyT==bKV1>Y9MNkbCkDl0fKH&c1&Y=I@i8W(m zb{(8qO=vrP0@>^9^nY+XfyqtPz$AG%ITY%_b+R{6Tb+&Peoy7Hd|TWov=g=qsowSO z&B%Z@azAqBJN|ThbL?{vPSH`;5$%j}aqbqb-`(5rEKT;N2&=?O(q8m|B|#CGiYMq& zc$=QV0rHI4LiV5%$r)q}X6c2Ah~JXmpvuTw?U>WY)q;%m%hBcadGsKEsY}IeVL3hASe4eacK_ z4l(&SI?41dWHoEh1K{VfV$!^pUWe6qTPlT8NGH~1-|;NBkUXxpXUNl?)kHAK)6udkigX=iIF4lIOlh=PmXAiQ`m7tS;4) zK1ogCNgJRXMiN%Wly@!sRC6)Ae?fG^K65oW>i=oXD2k`bfTOyMT0qr6H`Yw(WogJ- zwgC_K0r>wfF?)3)fw_(vg7v~{=r2v_OgfT@Wd5Q3m@S~?+UZYBSN0BDjdd^w*@K`0 zHNx6B6`7RbY%5&p?U^X>a%16gsYZ{bBG7lafSN%44JPI!s`URVKpxtgdQv8G1YAW! zh}Li=?NIMwMKMsW3>7g^Tq!0CNkUJdnK0U$<7w^HJbOGZ+&w*2yemAzJ)b>wygR%V zgzjkasg5VCB94*#aNIh{&*TY80-R6BFip)@Ly+nW0dKSoR#26Yv5SSPtSVWG`@tM^ zP1U95l9R|ABhgQ06VpY&vH0S4juFT2IMe-H>fD+wTRRqYh_$5V;91 zyW4Qp{R>agape2lc#brLJ8Gz+QyMDs<(tw#Bo-Rtoc_%rMlR^$7?1-)0Y z*SQ?Le~{YmM;q{at^L}LL67n!IR5>hWc#-NJ6|^*%opI>w7?d>H3l-)y;{_1V_v zkbloY$I5@>e3ZS}a!ziB5PBBcYjgN|_>z`K_|o+wzAaqIzx9pnxv*z6^5hA8RefsL zBdg|hKHPa;=g&I!>A1DyGu+hlb=I+)JMO|P>3E=X$g1=K{6lcz z>9$|8`W?u;zou;pUuq6)U&wdyYqn2d{MTt8**>cMT~0}cwts*&>&cXIYFh_4fX-ok zc#$3E?tJ^ap!EeX`8xDY7J<_vIQd$J#^xLBw0_E7vq9y9g_tImeEUeGzO^I87i=={zrJAc^uIQDJ)^ZWQ!yQ0%N zfv@Sm+I3UcrQF*1B-(n1uzO#NZ?*r#ZK_k)#ZGOxg?$2d2~zvS*4sFpI}0qljoYI~ zv<*g^p@kcyA7Gz%1f0t7_WtbJF6BSf*5e;}H|DfzGw}L)F#KA0nbq+PZ|~v%d*?$J zHwSi4K)1)RBHqn;;|q-FPl51KPC5UNzAb~6tfJ4)uzLL$yUlCi8vAp~Js1A>RrEur zqhHN zbluUlQP=+HOW)UZRaY-koiBAy<{ay*+-*3$XA^D<9?V_Q&+>Y*vagC zhw;_<62AKXE&V;ccL%V$y>~HkmK`}SzpH0=v@Eyinbh+-5||eLqu{XaFY=$jle-6Z zkLvF2THZCP`+)AQu0>rFy3gVJ{E6KsF`M7+{x!VYN_3U?rO&5wXYKEL=Jkx?OZSWT z`nexk4##s6`9ntJZEle~3+;s+T5mx+Zywa=t=40ZWNg5yeiU_z(D!dOq~( zT~69|Gk}cHf|ih8;#)q=D(0H;v{;z zo;9IyYjbbYfS&*5rnq4}C-aYttD{M9KetzWmw(Ls9jm}%Xx9kt|6SQLoOAq5xjB9T zny7m))+>5?dJf>r`1AQ*{Z?)_{w23Sckm_n9L~L`bL;i7XiGl_4vt4Ea0ZlkP5Qf( znR*l}`|kYH^r*Ix^#AwVY4>B|$083r5Pj$;z}&aEJN#y}f3HGrasXPt2l55~fR@)O zxvk|d=rFuSO*6U8bbVwjM>6iGqsOrq+P4E3?R%iJQ+r3FQTqrQzQ5*H=4Zh1$9Y~S ztz+Ss| zD{fEa-d}XFXK?fL)7&n7Bac$6H_=r+0jbqAWLY!08~k1Le9vH}Pv?8cqtRNK!QSoF zmL>PjCRb*3-}hewdK2@`e2iXfOYSzT8Bf z`}xn+1JNg+M9w3)i()f&T$giO;6>cO{Q%$TKh8Z3k8%IO)711^^8ScY-eJ9(3x;hD zr*|iQ@9)Bi+nY39`EVgN^l8d<3Ai6h=#*tMr>3572r5lqf;2y z$C#rFq0JYu;@t_iGnbY4alSElgH`bog?kEq zL2K@%-pje$;0dVcowRo&Zkr#%?FmOS{zn3%(~-iA2Res>ksELa`CMd5o1nX~5b8S& zE&mO;;e8l4Ka7C$Q)7QAGT~p-zj=IR@H?R03ruHmgLfPMnDjQe=Ky8DEqIuF@gHKu z{IBb~82g)<+t+eC{=aea!u9y?DYt_>g8vc5{Uz>%=;&R8TQBwkz9%t1W^kv+3`TGo z{X7ACf8=ocpc{4)<2jkuj=}7Y#(#hGO}0cA1hq6qc@Xz+Y(~sxw0ju+T$|ATd_(aP z-w}BK#J80kA)bIxFeyYs2r+_+3 z2X&5vZXFIbO@HxSsqVIH>a&TG7f8?weLS+yabGX!8re-_gA<-ptoz6u|9|z528PZ(Cbaevjz90 zybpB!H-Qhq>an!v0I2hq=-&-c*qfj}-{6k>Guequ1wP|Qu`Ts%!43N3sc~yc@xK{* zX~`n`{uC|rc8}lEh86U*r;PT-%>F^FKwLFVJ>Eax%0JeN>#Or+N*m#wwDDs&%mqAM zB*ccy@=2QV7jF*mkiWY(c9|0BGmjOGAp*pxmF0uQ&LzSV&n z2a2Rw3O=<%eU{O`bqHUL`%Kngb$p$czQL&d3V8kjsLo{6Iw^4j#(WQOe-bq9AZoVP zTT|yC`Z<7cSVT!Hf!PZ1djuBr~p@(09=3l@poCd6qBXm#d9Zg@hWQE(19`PTuz+@BJ!Mz-e z{oj~BzhR7@W=1>#C42!Gvf%`N18MD0#$_;=-=DPJmGd^E^CH;u4s&KMW8Fe;)&mmj zk!Ap<6$o`=x)_i3sc8#FcW?TCC^X<8;IS@Eez?Dq)DS(_0a zK@~a}qu;NzeF@_-pI*+SpMPRBpJLWM4@{hyuQI3n?}Pb_@ZU)H zF;M!D_Yy{OF=4JO3-NhRP$&KGPuWA5Q(J=xj@e#F)TV$5V&7iiga5&?EwLkMp`)@9 zW`kmM4J;7g1Af{!i18W@wvMBB`MV;Ak6j z!cqR1mM&&w#inKWH7lVloxo!`aSQ3u`;5tKaCtU8{WHD)6a9V(6W5E3leZu_Gv|_a z0ln;IM)U`^8w2H0z9SS|vh z9|6Cm1shgicTl$Tx*G}wT2Whn`r{2v>oc|+(hA$`92`X0T2PWUQh|=7md^R(%4x=q zzda*%OIAMD+VQor-URHiovDzar{v@)*N#O9j1I3O)X82E2e z8fm<4+svUjE-vt)?E`Qb!&S-5({+m-OdZTvirr$YRA57%jf&6NvjH)h^}z$vt&bU4 zaD7m**QGQ~sIc>27^Pi8!?ucFVo7@3QQq2`^wW4Lqp4%$Z!~g>j<%usRd7_?O&+1| z$T(8L`auocP49-#6J51G_C%Ux&*QR()$nJMpY&?Y(jQyU+vvk`X5O-bKZ_c(ay~P3 zUIXjjVm52UU~&2_-ftHBjlu!x6Soa>rZ{6V%UyM)<<1k0b4K$w=GI@qU1`9g^3K}4 z7~J;%#FmxzEGszt5qK;v#kiiXfGULMieU+nSCKAFUxt$F)=1fn_jwib3OO`Vz}G1;^}NGdm`Ek& z(W?2tVLtD_())$lZfm!SzvyIU3TQxn)d*uq8@k9S>=*^=UgM);=5C z^`P3unAR1-k<#T`nq_$C)g0cI8agKhx4jv=3RBnSP;XmrAJXPfpR_*xSz3DKU4Kgo zO%lr-U1>zPWmkS(8QqU@e^f%W|K7M7tc1=;X;y)`K9vGF)0{`nsLWB6`N@Yk^cYv{qMUc_@rjCjQWz&}8SJF){k2JlaxHIfeMv;T?)J5E>#ylCEg7);d2c zT?%EAH*-zh7^7==;Vp+@yB5o5>K@K2rJeUMR`C%$+P*jAF{bI-44Rccx2fELUot#8}R! z<1HifTB_c3$K3?X6zV8R>m2W_EZVLzp}tvj+QAqpvUn5x5r|8GQvx`@KM8-dbkD%;n=RZj*eW2qvL2eaxqzl z9aVqLF|I3feam6W=ZhB_S8FLoXox(3)T0_X5@&w!t=i!l^i_P6laQy7mzDy!#~TRt zR{p~kysqS#A=;ISoM%XR2lk_B>l)qyo}`5peh;dA2M&^6J_O|JE48 zw=R1DeY)JYn>PNwwsGdm&S4b0hni{>I~2`mo^9B7jV@+X*;$S*w(imFSlnxlK|T!g&!Yl6DfBo)m zeT1hlaW6Tdqz#QVS72^Dc-OGu&;7 z9ocb-GnEr{*CL*U4~$C;lRK{KRJi!8ZT-PpAL(4EU44ty?lmfhS=US{o%F0yJ30Ms z=2B)=IQvfKnkKVuIdjr^=-ia^TGoe>IhVuHgldJ)3CAEMkTx`_kyNDeMe-T)8*)nW zZQ&y2b@XZKPE2may_OuEJd1XC8GUjy;cCLE%HM>`%T7#gPaa9T8r^bB@_{jOfUn`7 zRrc!I8sn1Bx2a8)(Bv~z$zV!0#cUqm)}XJN@M?z2y~$s{Rg7GA!tVF za|%SXg@Bx!yrFP$N2)PIXv#ZEpJPI|rS2JxaCDWgldF?Hhoh4!XPpWy4n1!2aAJTy zIq}M$ySI%@L|QDL7F$fqs@lZ8LY50=HhDK!WU*Du&Cb+SJUml-1DwI9cNC{4*>UoErNtL&P3Wsus%ExV}G_b~2sx8$trat;Y zKYcf8Xfu72x|+wFQvJm1RUshtaE|j{KlhR@j8hHMFI%q~baO}lHu#HGA*S7e`gEBn;tUFU{s?^;53N9Jpcsbh>a-k7-eDDDZ^ z6Op8P<{npkiJe%a$L86+q}c=MvN48x(h+0s#CXeA;tVmD(q~UZsz0IHhFRyH#jVT7 z7~2$IEvwd_p6g4h^khOKS9&~wa?;np!d?qaYZDgMvU>>;I(zU`DD6V1kk{0aFeIaq z5!$g4YYL4c=?Ero6C1{Z8)AoVv8x(!F1Qvv3qA%Lb&o4pD}H;XC#D9A#bIYc#phtT zvr1Fxi?h`E>fQNuhKCx2KQ$)&-bm=DzHolhOkLrKE01g%>1%ksz7)5~`-M(dsx9Z2 zeYd=K<^H7lq4c5st_4{a8^wBrmNhvx~lB3Z+ug>XlOOfow<3GM7qY- zw7%tSBb9XjQ)RAwU6GMQKA%03_PXR#a$;;k<%<&&URi$GREDm{KCAAx>f2b$k&Bk2 z&dw}SWBG*jh;gqb?=X-NJSd!rK8^BfIhM$c z@;0rZk#d`&N}3Fo47cr;JJ2A1hV^brfgK^zy@Wm-Dcm6xEQX#4LNiCT|z&5ULT{ zQfW-z-FWEHr}xz1TBK^O^YR?h!0-}sM$$>CrWDh+D|hIsG`G1@OV6|3?o`$TDS301 z%$l2Z##O|%!j;N*UFW<>()G`G*1Nqq5BA*Ef1auK-njSq#Q2XilL@J2Ut;zxVf%4f zJDF!c^f>n8l=VQK{W-tY9ME`AX@q#bKZTR&DWp1x=Ro|2@aXnAnA7iri#ddo@PkU+ zq1c{_`#!8;A5z?h;Ww-r)95~wlYZ@~*fsue{E0Qj6nS(f#yp1+enff4Hb=s1Ds!j4 z)R9)z_8d}D`@cP=w-1NY8{f%eI(uW!?05QjXrs>wxBt58TZmTp2sfXE1;!Q9!aVTa zA87B7TjQw2=h#eU%ra7r-Tn=~p_=CSiVu$TK48N>xc4qtA-3#Qd=q(#DK#YF!6(z| z4<9B+RXMHTpW)(Sa5I=0Ol@MZap8L8U&8kUv%{xk4jAW52nVBEpWKW_U!6CVOZ6?+ z8>1_8D?Cm(>DsKbMY-_EQxZ8#p|oX^f-XLV#?&id`klYN2nT;3^GvBRl{{hcxGStJbbp+> zn|nuV&dy9aYun9l$;~!Zcgjw$gqZ2VdzwD^Q)~K>QqsymSlb*;$fTCk5Ex`X9Xq9` z?CgjW(&U0uTFR}ZWX-73(bSj~#1!VuI95E-mq+~2#HSr!O0Ipd*V(BiMR2W#q|_Rd zy37$gvy2K|%eLf zB)-*eZ1AAM*uFYHeX^qoMaYiVy{fw~SI*rE9h(T%%larS+#6acb=(&UDpi#tOQW;4 zHCKwPCP$)qb`)!odS~jN9gDu_@t70QJM%dSy{uC((|AtBOy@ZbZAYKaVNOR=?F@`} zCY_1Cn&zDHoLe+`&%<{i8od`_dsF(CFqfe3A9ESsxnG8!?`3@Fayk0=ny+E5MB`U; z4d(0U9IAJCE#IentC;K2M!bRlgS!!p#BVpuP27QSGdDlqg1Hr4#oKV-#tqAN@Z4F< zUEJk#SIgae#d06!o?_o$><7{1djAI&4^<*{u4xlTLvSZ`{+mvEnZXpQghf8zdrY2n@2n(xzcZEuR!el!hR+w~>hnCnW+4TOA)=Y}%A z*AaSMW2~<&F^>DSB_vqzO>p5GV21B+5)&M`rr|P1yt$fh0 z%5yII_~#bajH2PKj`!Kj+sxRwoW*CA+3cLwoXPC|LeWRfOh3JRLE*gre8c5i^Z8;v z3sv}RG1H+I(;M#7il(O&WLlviYJHyEpe(wlL1#`b<}*;8&p>yiJtq|RiMWo(ePY9e zLisI#luG@{Q+gP^4D95mTe)Ln&sL*-M$mrg2gc~SqrPug5f_BC>v%H<-vi!4ztQkpJh4==eZ z++z62UEm6RDmNLvQ2w#G1B)xXo~wr(UhJG&%CYHp&2uHoI#{`ea4@b}u1b;iXO(g< z=^ip?1xltyma~LBk+dzG|D-^U`Shd45_oBCGbFA<+h? zdXhCp-Bh(qJg=(tv=)DKPAoSkvgYt~)^u^_ytam?&e*9Xwy9EEvroFL&AOG=#9v_( z*--UWt`)?NuL1Uu3M2+C+Dvp4ByHO7x*T zt1~XzQ=Z;AyK+*ebl0=FXjP0XzMRN8|1uw)lbNHD=VabGcf*l7myOBXt~-Oog+q@V zyYjk~8bo-tFJF1>s!!q0ugcKFo5x@GlI}dm!PQEI+=+%Zg<3_P?3JXR^N<^>^>Z^?#Q2-@_+ZlJ~=^BhuwX$G_vnLJLd#BJJ_MI3zwRj(mnb3Mp*Xg z*}G@Qo^z(UchB2%iR|u8<9X9glvGpt)=0xc%PapLs-Dx0oKzWNNs$>O#?&b_rPPvK z9SkwfI&*T;jLqs%Yp$gvkM(3FF}L-lu4XHeBK>RDQcqwE>1)z^Pvnv#bzXRj#;!pE64G z7-nly+79I{glg$YW1WFm&H%F`OG{E}LUPJzP43j{*$)DWnD=jFA`~(wIz==)mZnK)~)^N*ebKNmYiIg zr^?n+o2{?uj7_Pj&(eJMEIrfRtTl0w4cqs`)&4|kTqVbWOWI~D!$m2>>kGZWPuND-r~s4V7-{1nW_9PxGud39SZ%)o<6oTPqSUI ztCT%o97gIU#f=orw~~VTRLN6x%|h9mr;A&b6~(gwb;q*iWW~uE<;kFYnkNlvzE;gy zSHh;2zbjuQ@*6xU%_V$Wl;X6GbFz96SH;S0i1gj=XuVO8_7YT7ivNl*u} QsU_Ch(3@;(S@-t-KUUC=L;wH) literal 0 HcmV?d00001 diff --git a/python/tts_output_4cafe62e.mp3 b/python/tts_output_4cafe62e.mp3 new file mode 100644 index 0000000000000000000000000000000000000000..5f6e33283627adb8bc9039812de9f5c4ec6a446b GIT binary patch literal 39213 zcmY(}Wn5HG_$ct*rIvK5Wl5KASW-Z8>Fx&U?i3J|Zjf$}?(Xg`X(U8iT96V&z4H6t zdq4L+FXq&~`tI}0nKLu;Qaq@Dr=Zo+)Rg{rdXP$&$vh|`XF>kj9&42GEjsL@h5K|p*7j73U`WuYhYbJ`4+5crAq+~H+?Er` zO8;Gm528*a|958`0v8XJ2*vz&mG%1d|NIu7$$OS%^SJ;W0+#^CbTutDEr!t0fTai- zGI=j1N|7|+e-A)*pFbz7?81Zb@kw6)3;cia@5Eav6NCyG55~7Cvq@IDprL^Wf$@vW zeKV{=fI)J&6l|oHq(v||%oLi@RgT7q#Z<~-Ue1zLzsfvnqwE{SQ`&v-a(F?WPWs7* zPY?%+1HRLPp%>574QDBEb1Qi&5X8NIud37O=k90jQ8x8H{(XGx`<^r8`serJxolT2KHt!1H^&{ghY_lqTZ>+T={bU!oHKFj@6_CN2PCNg#Zi_D8~efiC)c;d#h|aJi|Ri z5-a-&YgUKuwbnEW?*rMfs9pP{Ph4rjr~6DSUUSD|Sy*MLLFb}fHg*`S6+S(g1u zZ!rpFcmHn#6#M1p0`?B18>iC?1Qd|U*e4$g;Z5R4@HGt1ju#cJAX(m!_#5sC97Syk z@uFg7%B9HpFzVU-cvP7&>{G?OC~9pWDpy{aR7WEyEM@vDKHl#aJ1m2WL&CS@q#!_J z42vRHecE2PR<}H=1`%}^zbLb|=SJ^@Q+&<&<(a|vOv_SNL%@K*6(Ket4npmV4cn7M zmnxkliJJeau%~UAyb@Yc$7wdIa+64|%^t8wktZj>XTe{0Qz~!X~J4!`#j% zpJ3i%D1>({Bd2sGu_QEAW39`|v(!6saHcg(t0au|xlqtUNjiV$QYmR&$M>U8h9p8; z0%hB8@Y#+xZBOWz3YSH^zsWG)l+AzA6ZIuquH|lxTR&K*8eZpvx_bx~TiA-4W>Ceu zEJoo;+wH#CiLUj^R9b4&DgX6WIgQ}j5=umZqnw(*=SK0o0;$%1c`&~17WT#Ovyj_m zry=6)>&R>QgTk{^rRty8=$KB;Da~*B!q}011AL$6Vwm+M)G_ITWexF9v>VI+s;<4N`($}J zfXt|M_s}F7k(zqXN`5O{!=w~-rZhn?C-L>kXYl126hLTf3b7C1W^05;3$I5v!Cpi-_EK|%e10%a z`!wz^Hw^~1Gl5DuckKUs6n7V3{^5Jxr*<5yCI~|VFvS9p`9!7&KoX->yJ3p5e)?vr zehQ2P0I5eS32HO?S zN*!D8t4gO^^@o(;cX%q2lKRJ@1cGf*Nd;X|0Qjp#Nj*&qZ`V^NU8Xg}NeVKYr6r%& ztSL3t{D@;Pc5V<<#-+oxmSk)4%c6ys)mi;B_ z=IFbn)W^}n5~Fen<6bbBMg9OrVilBHixx%UAXq^4)}`QK1egyQL_=02L<9wMO3L{t z)iXsx^qh6BvW^~-z(9!%1uaZ0&8{b(AT42N(1)B)peuQ0QZDR#7(Rc!$H-R&KJ#fkBh3=5NPAeaOIypqIRXKmr+s5U2g;=Zo%N*UQsx?}UhA`JCwDo7 z%+c3WO9PxNoCs+_sP%0zWrVH$#phNGvl&IyAPvK z3A)(2+UnT+Wt~(DJ=2_?nXG7&{khe5|M#7)myYVX!#im>%Co+omI-R*K11-Lq+n&w zXXvr95UMxQ5!UP!Fr85M)eHchz7(*-R@gMbENP-N4H6tuNllQ#2GLT_)af*C%YE{Z zR5*hM5^l}`Y9v+hBg9P!!vaUm(z$^Wi552YK2jkvdQ$Z4%p2`-0}+2BxUi%kT5cT zxeA(fRIXbMfUDUaeBex#Y$Et+6J<2I@A_!IH$1Q<=dLcnR^FVvCHl92(R~z3C*Z># zVV|c=m?3jKUS`!e)u!vwvBvt%9yv|4^$zS!{jKp&vXukXW~%13$=?T$cXfaNpZN3d z{NT&izh1R}Pj4$7U$^F8||yIMXAM_McU0$GOQb9I$E0UV#bGA z;{jp6nVi?vXVynUNMS}#J}lC7=$=5Mejr2}KuypZ0<$G$lE*nh!FgeWTKI`B-Gn;(h!LyL* zLZc*DCpLFiqP4uoy>4ufnQWU&dO7x{k=rzyQkskUPY|b+Mx!vxg#WxGZ-#aze-p9=BCm$L*H+#N( zSY>nR`4A)Mm^XE=lSTJOUCisImU~F>Z%vrO3g3)Hyk7@wG|BsO7pd0dZAaAj=(oN^ zMXm0L1A;NC-^a!xZ8WfCGYd><5}q1~cpb6J;-0>y68jXeV%eAImrLgpq{!0f^k>QR zk!LfKuUY$*1)hA!#n_;^X6rtHR?LgvdSk|;k-p*#Xai#;%TB~`er#gO0k2RSzSX$A z(+#}(I_hD&D63w~P<-TolC=()B6OEAPMjGZi1%apKoM#2xO+Qd@>y1-@Hp*tVxBf2 zR&wda)tsEQtbAFNz16w9Y+&RhH8}e1Qk|%oX{yt#aoaSvcd-CDp?);fsy|_A_Lh1~C zcN_7i(Ls&Dr0(yQ)`iHQKesj0o$|fcA1@BpoCr^5_2EpvA_&vfW;ep^Otc2X{rhr< zwy?3_%1dtdZ&s$I+xg}EF_JrET*TCo{@D2jq*UL3eFV6n;DfVqG!K_K3O0qP9GrZY zZ5ND4X)LscnI_fM1b9VD&L$(8fRBGi>~jR3{ZOiJEkHKH8{+i?ILgUb$oaPc0A3gX zyivTAe(&yN)HtM@>}z&WUUJ`9_eyPiaG!+qV?)ndt>kz^Hm{Op?i%wKEQ8pZ`Y%p@ z3HG|bvHRfGK5JmcyMTUi@+(Q_mhUUaIzc^Ip!M%G#1*`g24GRKF-^2CW?N(MvCfVO zQ}m0Q!$(dDK~&k5Cm&y4Eoh$36t0%VMy2OYF~6$rs4pTGYCB|9i2IV^h@g>N6IV&MG~`4FbaMHz){K%j>AUGQNVo$t>i`6(37m???z=M@P;98 zoF>{t5K=6G0DMeY0NNFok&R(u4sG$YHJR#luHpotH2vK#27+m0qy_ZHoXR9K(Zxlo zPr%1m3#!fEtXSMNFXiU^aJc7$A%rO_k-Kzt)EK58GtBv{f*={T1-@Ca#tcMeR!~X& zAT*zg>IC{q_EE(+bMZ^Xu+bO{`&i77V6W2?zlmS=L&=S5yj6Qa<1hkD0HXi(3(at! z7Ti4oUwvB`8^0oCmD{?u>^|m`aD|A|QLk3OkMp8%rL*I_w@*Hu{5R0TOW%xc0dGaI z<%EtUCy!iFSJT3+*S?_%g$)lA4TviPS+UjLOi*oWm}5T*{WIs<=HJ5oljcLs-U2L^ zAs>9FEXVx(q?frThVMhD@(;1+H8GKUnYZ$ zqmW<4@^EXOR!u>_LW74rIN?(Dzl~Lu4Z5LA08S4W$okW2rxjsjDpl_7@Lsi z^{-c=#LO!@o3bt6a5qwyT*(CeX}`Z5%1GQ1zt`KhfK9O1uuPXrm&9=-93=LBI5=O$ z|I~(7v87L28?!|0TbM5bX1bxUNB+TqOiKfu1xf(Z!2)2e;eb3@CH`s_Vn(!0Ew~SBm!^jnoT+tF4%Bj4G&`i0%3Pee)9}iT`sh-R+@o#A zs|C}R3PT*()Y)n!6{F9NC9Rz$Q%|{wYNo?AiM%p={4+g=4~U<9eo87qGsOq;=FU8J zH07N)-?1((3J99jjw`YmS1L&;g8>H`d}5;~ftp~V8KO1e9UQnq>4HuwDqryif~9z2 zD4oZRobM_nJ%IvXw^FxKXX7xFI{5aZ^PUFy9b=6H+na8aF1{**th@s{jn$K-N^M-} ze1Y1Ft-c9K8I#WVzG^gt1=<|~j7DY55PbecqxdkqGtVA7RQBHb*F}$MrEQ9R;_q;x zejmIxsRu*#aohugdfAktkm`goJ-ou4yv%4X8j5N6YW#wm4o&h>W@mRv75ITrZl6(l zinD@*fjML9G}foFAv;8uVF-6cja6oARjE)b`D9r`VSlr}zFtn5K{%=^8?b?>uz@#` zEi7Y{C0gx<$xJxu$>&iD6&hr^w|K-5T`0|LSc6UaSErO&-N|i1&-`Pc0E%uf!&eI) z)hZAdxKhv*hyt9$Cdf>$m7>om7Yrq$5!W=1s9YMgMLxsD6zPfg*)vkZ6wf(7V>Rju zc40o_>C3HJc|{bQGR5hBaVo6F!T-AFE&C|3;)jLh$-*|lR(7Lwao1C7kf;5G#w_)Z z?vlvm*AUbuvj^fe$+W*osd7VHKeA=tZj*9{CGOkBWlq;& zMU#8u)tZNQ8}^XO%*~sd#g}1v0mBkOlvxSABMu8Sg&|6d6WdUVU&6>}Xb7RxHiol3 zH5zAI;zM@oTEPY9(#Yh>@x!aU^5#2H8HKCAvs0*=fud4 zk{6W`^o%V={K7%b@*H1*BuTC_%kH~g6X$!8IYK-9I#pGW*xhkn)F*FggF zrFD%3OnF^}??LGkeI1{C{>T|YZ2>1-Y#NMMC4PI~< zzBg}f=)4?>u@3|Qi&4C2igM751C$QBFW^i8rqFMT7mo{`Am7*DaHry)G-CWbIsWfkqXJbAIx`$9sqg$4K)*D zu)24BYElhKL^aZEas3nGe&cy~sX@{mpLw$roiJ_`@bwL2l?e{qNo_ zq5|IZx90TOQf-XLTcd`aI{pEYDPJibZ_1HU3hQLtzO#Z`5CDt<02ooMqfq^@7g~89 z`TM>gn)B-dvOZDAI{m1$IS5_KOCZY7bJfr}&`rH3(6-hfk%T>}?+jOY<-1tP35H7GYQ|B}a}Md+JFPSY8hrjXLSyg-jzYndP!G?ukzE2m4*PKT ztw5R|^=WC9Kh3pm~p>@e^Wi$mI3ITDgl0Ydd^I#LVXHCMEkSlG2i3#2e?rvCsr$(iinKUYXcKhjg5J_Gh=+&v_{hll z9OIc0TVO9>$;(dcdX~aV5*Ds0`dCt}MuZa#Uuef-B+2WT7pk2=GWHsTX_uvAXxg0% zBr{*-Y2=inFSB9GhOkuh(vCRN)85NoCtW8SVe$}XN^?h3&ytcy1^rL|vk47G?2Q=( z$+!-dSK(=VOaJ;cX(;t$Wo%jf$x{OHJk9D?K1Dx(SxhR>;o#E1Z4o0n?lI*h?)DxI zArWR+sNK4$8q7$~6jYHI5#HcL#?%U-kfJ+&HC5t74S|yp6nyVg$sO~l4|fI1Dbf(R z7vs^KaL^r4)EM(*u?%in8HclEW-5et29VpYO8=NNN>D%M)h~$wAF>Z0<&r6o8DA8L zhUcpDSDHxb6cl+%s+(0vLaJFalSkT*U&av7Ytr~EAk&dVz6t3t1g#;7Rbtl0WnNFo z(eT5KBbV$OG=s_8bmkRF`K_9LoyLmza#!NXeIYhhg?s(ryDx*e7flg$wj<>08?`mL zK0WXLtdYfpHO#G&Szz7f$U>DX8-|c!HkxKoB^i4`VJ6GJ0(#q-P zP{IB3oyiUmRTtqy;fe|(0!E@06>3CC#PMXHl}LS#Y5XsLY$%{G?7VG2YM`^?Xx8&S z^1*7tw|SI(!M4G{+l8dg6e9}n#Z3cYdbntX0x(@*Um_C=pPzmurjkMSxxu8Mfj&#Y zXEYIdMXz&x=aLOXB&B%F932IFHlv9mAH`6hIUJAxh@?&xtqc&Uc3K`iN2@Ncc&Yqr zwEN(EukQ0ESJg|^xX!hFJb?<5$OIe;LTwqnlNK-6$Y`o+3vn;h)HWTXcq||o4n{>K zMUvnLN{sRmWH1HV22lrvgyWNEW>7heHY~1u{YaEq{KM?>@`~3r!^VO-B{$-HEMv|$ zEF2v*J4!z?0-Fp&80H9vz}grnh|J9y46t|~O+#f|$%K2Qz^@(Ix|tBxK|%ea?g-1k zLVQ$y#DCwXUIw&>mc}`sfND(Kv-p^aq;-5u)@t>Y;=J8MkvNy8LjwS*MrKe(2j*;O zng^)MIR*V^V7R#GB}UrlaP12Z8%O(pnDe)L{B zcu0#Qd8Z;%8ShNRhU}g8WG)l2<&qVvd|pe2BGN|n#-1vib$sV&TEQfbFW*q_qPngp zeySK8-dK=|@5oYx!|m6mSpUyMH+NIV=RNjP z=XfLDlV1EIs;FhZq8lzf-#XEYJz2Lr5u23CzXyhC#|_1$Rn_&eqwZ4_c3!ED3QZKY zC+IlO0N6ATa6K@As6XFy>OlNh#(!b}XCMJfH1rz(DSw`eEkP~OK9>XHh79N>wYN7KHA)GLmrp7XS!4vh?{Ov~0Rl_4e8uRp&%`IcX%QL}pA_t~%RcaJAoQ@pbq zp%qC?F;^u`L;?L~efo}?=XPq!SU&{LqGbz5oCR>VQgN^C@IqkRycDRY&JAIq4M{Rl zF+sln_0QZ=%}`U&>5OPUB`7=$MUo&~lX;!$gVcG5 zVO!RxM%cLt=SsKmRh7O4`$yuqy_vxv)8T1UE+#g1ZaY{h3tN8kCfgvKJ6s}^YHI`1 zhl8Y1^W5bsgzg^&wUI__lC*z(Q9DP<-%JSgCPPK)+Ck^;4OB#2L2>|hQF@XAZu}%7 zuS(+4Yic2z%2vI3EnC5U9O3HZrL5@b4i6k(>ZknSmLMWXq4Ik*XV<*=3__5mWLg{F zdMzKvZ#=d0h7*qwavuFUkHccgHl1F=1M)o>qD8ZklT>oHA%-0pLruTkmuE+;y58V( zphywRR^tZUs$s_YVXt#QP-2$JEt1EawMG=r++uNSiDn?}Wv#c+u|+ha(h`vwMAbD- zO5@kx^-EZ~hj{|Yht-iE&b-T;g&soglsS8QC_~gO8{^RAA%DAWfL$8UqsXBipSsW; zfYzbbY*{d&(E4x4Y^d5=nW4$dY&P^+|M1m8Tf8P-KVEEIMuMQOU^dd^xYa6fJtPs1d@+*L6=Xd9kgC zjY91B$w&NUDAWgFu{ge?c}g@qgE9n~(0Ujg8ZEh@BAXmXx6%w2wvDy7k-xXM_)V3e zoipZ1n{h;U`GsX(vE(LxHcXP@1&Mrdw20F9==;o?=EsG>DIPLoa~UYpjN(aYX)E6W z%H7xMZz==UZf5FmxB?4Y?G!#dz7@! zXu!9M#kn@4Vq5D{>B}74A_fr`4+TGu>UEN5xrTjMpO@PwNA_viDAG1bjckQf1f}py z@d+5-gcrSCB#WbWX;vt|Q3o0~lz)83*LcEKQ&I8KnA9fiT$$(kJ3Eiimd$FmOq8Ke zs~J$7PZuj}n5PCQ;i`YxwJjt%Hg?`3<_sSvu| z9y$V$xlb){@n#%kV8f!VB>dW=$l^WM?9dv8IZ z_wOnfGZy-ld)9*~3yRl4DD*ly>gFv#nLNs)lVhh5mVa}h-$5r-sLVo5ABROJWThE= zHc7R>rS-zvzsyl2tnE#ACUUYZ`^PRkSg(E&+>x2*|ABu0ZRP#FG7-&EQFLE}9n&vU z$hkXbrE$u*%z^u@O4uH9#EBL$XcMFnK*QeI91)#A>Z{#TQoOPY<<0Gpl zGaJr&#WiouPP4X@bR5Tf-a83SggAJUm#4irEZ+HhkNjJ7#CS*(h&@~RB}fdbNW~p9AV||ch8L_rRSJO|Dl12`4b(L_Pbm% zi61BAHi!0`0u}*QQRwK*m=UO<3SXqQFA_r|LNZ?P_}6+8FbU9c>xvOf&(3b65{Y`_ z;0?M_w8_FQ3Cj(3z@6QF)YwUK3X`|DH1%um!qKg;az8a?I@_An5XP8#QjGzBvK~;s zUP1KA`_}tFDs^{>h4;(68{(DBb+B6fXnhZX_A&MzToBGVWfv5G;39Zx;3g!+eQ4 zVvUtUni?!90}Q27>`%s#9Ph;*r0Pxga8xFn2=>lVt*=h+j9QvV3{?dbpU~6NoUtrL zs8(VkSdEENgUHa%ij&`_6Gw^HM!E+rNkI036KS>)S(DddSFO!Y`G*bibFR_JHx~N)5fO<9C^Nl2Ged& z=cAPFtTz&ZyAF|AQX=NsB?}WwC%lQo>0QBU=f|qe+d1Wx<_*mEjpy-3ErO|K3VD&$ zwUv7GXH-0 z>{Vk*R7xIBrx$Yjrq(u*eX4Awxs1c%c-#;b6?C0^^7$cM{4akF^_nT{Ugtb~^jlmh zs(GWTvqDH^T%{+v{QhFT*rwUe-Ri%o=t{QlO4De7L*|$~qJ2}YaR8P1c0qxWjh=R< zDOP!?844L#*}9(FHi3v-n}9$t5DAhv%-V;?$*pOenAQ^r>v75b%E5tY1sj;j2_&1A zR&2xv23ZM0{EBtZN0bJ(?%gSazw-&;6Q_qZJ%lB7e#h(x9#1F6zRJy{<-o-H^2%}$ zYPziys~8s1qBz%Oz!`t=6_Mb#s_uxMXjfECNnUs@W`&n5ODNX6iF-|GU5aU@Ivl`) zGX_?KS0v)AJKc_<<8crWbPKTQp5lF+C3@k!K|!y}UcgiWi@Xq0Jum;Vc(fMgf?@N9 zWb&;3zxtApf|_X@!sfnp?s>axZm=D9d5ApQ>>y30HJd??lnj!~B0lgDDm|(==9UXm@GGc|)KY-IaMTrlza7$|hC@ zmh&GP)JHeA7(3KPZBmUDr8RPP5cX`X)`FUjPoPfDVZAq?QVmCb?6uyF#;a5;ZT#@^ z3<7IOmG#VgdU=F2abOmbK%*D%>NvcC?%5j?W%QH3btM@K2eI^Y*>eczm-%B_A|lD! z7w?uE+$AxgzqnA-6@N@(=d%M%`wNtq-)8I-z@B{mS{FmL0EdliM{?BMkq`n*xN9;x zzC%Gt8UUge7Q~X|R0{<3@SO{sZvlu*>!fLZfkLszUqWejj9F28KBT>l`^J{&DVO-K@8 zK291z3e@1Y{w;!@uB<7d^^>iroEs}(0B4?N(>tfWGM6zlP@x4ZE*A;HQ3wsOwBZ?@ z&4d|EO)jNjJH%fbdw(cXAoHd=O&DsTbWU3PgBsYyUoPJ}S31&YlPv-Mn%9dr& zu*E>>1Xh=b%J=`^El&^Uki;|yvC&X^$6Mk(T^aN;N{BY0xiWDi>``OTs_O1+T0`&N z!r{s1wcaq)v~cKJ*l#o}*P24wlfjFo5XaqU*g;G<(_AuC07fj6xnxff{f4Y=VbmZ@ zz>MN!{8G_?Ogb`UJaZ|QE+L=1a>3C^5A&#*Is)_{HeW3wF=s+7{zKnP4vRB+IAwt( zwr78=!sk-q6COP(+W{evhHg+35)PBo^HPI|<}$N^z^L3Lp`wF|dD`NJ9x%8kOTT%V zITnCvm}m%GArRSwCO^`OW6K@p01{PDBU$t(OtKN^lgU3c&HptG!C@p6k96e$N@I!x z5iWrQN2@aOGKth`1M(y(8cjIv+hH^KDYRbhf3|fgK0|gf1$Ph&=f)B6Fbr@TuoUf?vMMbw&FUeR>%_wvTYn z5>+1$8BzsmEG~$o%+tXuU+URl_F$TBRc%Yqu^@>f#=@?5>jQOtS~Xr=9oU5uB;wLx z*}t7Hu)8boGbmQA@x?rtG7s9|?x8VxG~IcNBE4=Z5o|vz+Xi7{#G(kR7|>APoqXgLvF#`Oyol=Yr-KQEL^3sA_A!2;L#vmMRoiC>$9Dt&_}8HmSKAtny$i0H?C5{eZ?MeGy~ z=mxf%O^U2BKnn$r!)`SNl5!7jJCni>U3cn>)^>Iu_Ft>?^tEpvj<`V{Ug}1u)_pyE zEmD!9!sdT@F!om{;O!j^00<)eVQ*5-E)~Tvz!1$yE}d$Z5;=?0(>x=e6xwt3$(+f3 zG^5gPKJBv>X9KiI^m4=aJU& zmf`t?Gl9<;cj;_#5ysDE-s!WY*v(`?75A=p1|DIsce@_s2gQ*>zd$Kz zWaEA^+U4bY^uN=;2vEhOmm45!j#Dr(IBkdb%{G~>`qLQI<816*8+fYB#$28Ft80Cg ztypvI@$%Xb)(t;1OI8XIeA)XF7!q8`*N+9Vm88t2*xg92M4FLQs}g;MmxC1sb(?t{ z_#9ftc*RJ0)eWL%xgi{=945bXk(F#<3AqxtmAXnMJzFCY*gPyt8aBJ98N(%sQQKn| z#lz19$T|ME3>;{p4j1uCK+<6K1AupRu(zp3p$KzVfrgf$pna@N$#erDmKYbpE`gh; z`VtW7>h#awTNA6ca}+cF#gafMS;P3|Jd7^g(s(Akt)#`QC+~9@ZuC%wZt!nkTD@pl zJFX#OyF{dO5s8@ubbt^ANIl>bTuDEvh+s~a+r2@Wo%QiBrZd_7nP_*OOf1$56=AVs z%Gg||9_rCIRrqu+5;32lOCY|n?6^2%!)(4Tnm-tT8>I;B?oGm9n2Rzm1JZhJNSsQ+ zeD3%-`iPxUKY#9G)7+8SP|Tg)5EFLonCg-~1pk;svunTiI-=~@FtKahx}!uv2LOUo zC`%aoi$xHgDD zm@|IJqXy!qS)^*(tf;cSI_{X{AlL5DDK}>=a`NxZQgLQJz<)GKRWlKd)8ngJU)OeS z>$zXrG93wtSlxP&>$j@4^;|}y@(s3MYrW}!-yO#}TKcmOJTA~0x8J6{Ej11=yQH2jvw+#@z3&Ro^F{ zw?;-#qpO@bfN@l_Y*0|0^v?svkm0%X7!JLfNCJYEm{|(`zjIBkt(GI*+q=;((KvR% zDTfd^b}At0trY5F7^>-fa4~Awv~v<_3+dbAlEow+pO2_!=i@T;&(KoS2i}DRGEOn3 z(`m|b0q}pv#1M*mS&sQXwYW!~r0^yhDV`$d{4~619Zq5cPK`3xEst*Zdc>O_P+ywcf^5L8hX&veKkq_gU zkwRWE5c6mlb-Xxff$1=HrFmm4%5WTk7F^n=XAy1E^~2cweF{b~Im3kfa>>otF*lDd zUie~s+RmGIVUC$_eD&Zqp6gW6MYn~ws zD9=_lJ0|7WTZ(qy&60d^c6~FIte#4+C>T*$Wp^q#``PG?q1fN&UkDAeR{rKC%UM!p zR1_-4)SBbgY_e77gZ}@e*UCx`Fo!|LSs)pK{cnbR8k6x2aX=6SepCXPIPWzFPim21 zi_xs^CnFTWWC#z8L_MUqQwD0Mm#qUXJrcU;Q|&T?ZuO3hYrrSn2Sb5Hv8qFxoBCNAi4F_O9oh{Fee*g{S;!;;K3fgl?$? zWGxh&P;4$rP2`R=$?aShgDDKq@IyalqYRpwCdM5zKI=rMn(rQfbA{}zvs*`ELRA(VhT9%}68lhQTq&;* zn9H(7y}c$mh?LjI-Szb1NKZl7gl>h`Gv@B^!mG=YQl`mI(fWIF8cuY>kh~e8Ybik* z5!;p|^w*~T7#hGh$K0Z6ErnPf?4ySC{&Fzf2&haJLE=r@_>!zfDn+}~?@QQ^x;?Ss z#LX|GT{u})D4LdJwL~R%1k|t8=Cy`sAfY{0<^^nt@zGOeWP!OwLH*aQvPy&>cTdlk z9?2pUNWKc1t95NuPZ`rc`TUi3gc`BzEef|HDs%U{8Cys#?v2^}Vi&6A)-vGQWYjS8 zHx2k;RC6Sa8~lfPAORXW88B#%x_%!sX4`>Ta}abWPxgldrNzBhY2@z?E<(AS^P%B1r=-Q4#})^c*OZBH3&^m4(}n`%kGLiW(|hDQFd4gB@m zMv5%tVyx0s*qb||@7`o3M!(nDCuJG<9hmi1%0P#qrRc|hx-H2MMsQWi39IK?XzeqD zx?G4)QkAT%&%zKb)e41rN$c-LP5IXLt9KVV1V7_8v#qNqjV-x(H9z@0N-05}3Y z)f?3>?OI@~nGY3$So>W3WC0Mjh-IlDP)&ureXO-eyg3aLl(G#3Fu>4c8o*LW1O%Of zR0|y;yoWgA#Q+ZgGed&RqCmS@O{m}?@nnoa{B8P8^%cC_lT2Q+<2O^KUwUyf4Hs(@ z|HiRNom!(k0zvR_oJ*@GAwPqLwxR?V(|X*7xM3csBk z*tIcM6kcocvng)E;wvm?Q#%#(QeJ)LcQ5CVXs>Z*X(F&xx@T5OyvY4PiQ!1O^YT^b zBm3vVw7loEI`zFJba;%61hG&A)n$9ev01RM@%P`;28E2Ntuw8ZnQLZ1QDgZLaH%c! zx8MA0i^nO34{H{QaUM@TzojJqm?BOwj?H#5X6;AR-zOXPpgsfdSu&~05j#u4;Y=_l zW8qBk@95XWLE#eU&pEQa4V(((Lxy8wLpyCfcd{i$alv7LLsvSoVquH?Q=u0ef;^(5 zCKd@qcrU1{T&Yo%=Cmagzmx-kMN>f}Z)X5O_2Crn<)wPVun3HB6pYxoX&Ft4@*&j) z9<0S~p1es+3KbJ{hm#d*1Eyxdjg#vSQP=0Pu?If4LE1l97{^oA^MG4Ed?L{mPC9Eh ziam>`#hB{mnq-nk$j}BSm4xKa&%DqC!mFBV(`5PAmYDg|Cr401=>@0v@DpXK-molm zU%W^tF*sTg`(Q3sQ)sSgC?4AxV>7Xo)gm;Zjprajy+E<>YVE%C@qg+|@zuZijaTz* z4!yEU>U7Ss@UB=i$X+X=+Uj`uAVcEpls#(?CFg z6oD)4e#aN{FN;{*89wM=MoIC-ZLh28~~~k zBguREZX7c#94NXH1rUcxNkUB{R6tEYaNIyD!7?ZfW|osX7`|K(8xATqTge~@D-!@u zsAe>yn{x@kC;HKmD4_nZDhh~X`2ZF;lcXK)4vL6j6cWvF0}WAKPlmSikFr;^UIqKM zm+Nbe-O^TUlBMUfWNJ11N;>|Py30b5k-0dYiu3vexD=^8j4X(?kUOvxAe=iaH6HaP zJ-9W|Z=ieK@Ii;Ip>?=y+MZ?8V7E)2I&6jzhg7O({2gB==lh#VO!qgPsdzR;W3dwl zMGABcHkM67t?Nl_I&yzrG@bWH$$e}qpW8E0*4Xv8PJNhO9{n$Wq&B>TK^J+(cF(=v z(doqrr0+@v@j0OK#_LxExBTCiwD$iAu*9XDzaAW0@iy1GiNYF__1y?XxsI?AOBn_1^XTf6#{Z^~jL>)h$R zEF!P-JYB;qhRjMu{mJK4tQpD#T_HtvcxLdCqA}g=RNQizdgN5TmfiLL*n8 zWn>O4^=oz!2seP66`^xTA@G3U8G-AB{MRW`T&;nz(pzRaJ{r6`p|(sAXOe^6nCF55a4i}FQRx! zV_jD}^_z09$U4(2l|GC9WtKhkxkT@@wl2Y~YF+dTN>Kwjt8qh7(Y~cyi+QbqLGR}z z~G_KgQeQ8O@qAmaD@zg@x=nsO?RlDa!BIBMQXQI28@$r3R?46^B zftAWKF|HrhjzDy=9uCIfPRA0OqYiU%SQYI#AZY{zZEc@*l2I@rA6 zYOPa#F`5^=6sRa|=Y5B}821s*Cyy2+H(4_ke4hDhdOm6$$xC!@pzB6?s-SbYOt`8$jG545b_){eKJ!=Ja5432!BrjqR#toR(*=BIPw3+TT^o3)rxj z>F#b-c3&G?r{aEx>HwG#w|a9o?HnfwgG_G@dgy%$#!?dHktA zDO}`YxuKn$)P^uKoDn>1+bbtuq_A{|v?07NE<(&mtC73$5NexFLf4N93x)~APod1&apgRCW>`EUNypWdmI zP@dpzEz?yCWRXk*va^?)`pp=?s%Tj_6N=c)imUcf1`U0|S_^^2nN4#P3ZbSY>Sg^CJ42$SrPEpYF>pPVBgFGfN7(X~jN$AI9GE zHwiaMc5Kwio2TZpy0?A_=7v}WQjFDfc%TXH0D|wq6Um>p(^jI|JL}88c8k*xZZa$O z?RtxoD{dKtC_Z*0$fpac%EEW_tyt2a*HE(^$IBiPT%?}il;=aK7P=afa8LqCqa_u{ zIGe?f&Kh~#2H6fwNQfKzONuc+`b=i3VxRo>Gw}@buMX{R9UdHzQr4t{EmU**3?6ru zryam=N;In%I2vD^oXC8}_8F1i7?7FT*VVwUD>hRg;q+gdd zUYs4aT`@|f;Nw=w+2$gir!69Qy)+-E$R=gFppt7)w)xMIu7dlqoq9b?k}#Q^Mt6c8 z24xn*93x_K5TlSwgJAu2=PMf&N@GVeg~ujUvS%nW7!EFyDwUeRc+`O9dbkzcqAt@` z_`M+xF%)FLRL#6j+q9pJy0+2U4}A7z9`euD93A;27IV2cb-%q1iz9H@N?kLTEQi#r zk2pFNQvj`zfQqZkwRD*=2^8bckeRMbI4JhGWQZ=xR;Xtcq94QY@Hy8gE!{=9m2^fS zK8w;=ZXl#zL_JyHSpJ-ejX9q-Hui!fma<>5GgiCWNGG!KSD0^4l?<2*`Iv>y#^aNxMy+52!nAqm)k$EILbz59IuXim(x&8Yw*trG6R!jz3u;Un56z1ch634 z6pXbsE^Lk9rkf=U*L9Of)G%pZj_p*gvyc)K^-odd&Sl`2B*xvASC39k$A92+r+7|z z-h7{b#*(y;2o_mXcKSaz$yXWedFArMowMke}gKR~%zJgcBAKNcaRWU7*Ugtv<*57P}39juT;JYjzK> zG)@kq9#VY!szrmQuvmS#CY?fbkKiH?a$ue`RcC*1S zK#6b9Z#OVNLRyJ%9`Rd`hlTcm&p%}c%5(4;L)Xc#;WBIAZi6$a=>BeWHOZsGIMLGKu@`vRsFyh;T5x!G!8#6fV_Bv0COy3X#QA zIx7`r&ZelM#%HmrIci>umqnK6T0gqqBxLVHa1$ zzWPC)drWNf*B_6J5>OeoeJ~qMP!s(pH%iyl_a>CYl4e$n6nL8i5f%z0|J~nztAQww z@AJ>O>KTl*70W`N2;ogNaBFH~oe(&rdFWWS%@ydB&mB42HRvp?H>t!N6~XIfUM07z zpmtJa(pjnO22n)z79gkC!|3wasd ziqg+gA9}r^FfO658Xg&~b7@$El#`a@<&rif5uakBPwM-mN%-15HZojke1j>D3DOJ* zmEuT6M zN##*ttc@Xh+^e#RT{)Xw^&5(gBCm@!b{Y;b9o>lWk73tgD`ODf?<+HZOM<_@;ej_K zhRZuMC-AGm1xXB=d#sv;>L{uo;%7%@g6xL(?2%=LU}fprBWoAEqMaUsLq3L~29U;1KK!&FDf zsoxDc%B)LWO32uTA!vU+=?l7eE1z_u3v~#mas17 zND9`?h6piLXO=BsOw(V{&xl*~I zyqQ0=MjM=HTo1;qaBcZ^pW_}56h?vT4{AvYdt9iADztP&@lh^vUByO`2_>4+{)o^IS$>MXnFE6#^7=Om%%NU*;&6L)_!|yz z6te?^GjKW6wUH~^QX@R7G$XBjz@W8+8j>~dbWSPf;UceXP&3QunkCG-Exy1f8e-R_ z%N3=;eP z+?P*;QAniB>mo#W{b1`faS5~OfBM`b<*tYPvrI>-(m%Z<6e(!=_h&wlru3iG`N*X# zWo@xU!UGL=l?a@#WJ!zYy!4E%vICuX<*CPlKad--NbWk6L^23ldy;!4H$%gsSxESg zNzi6So2{VuwfV{y`(4VC@%Z4_a*cLDJ#DoA6r07DrDs2`13zfjhJ3c-A;wF}FEX6# zwlSEoCHBAVQ?xN%A)8u=J`-(z*{Wh@d^~PvrD9M~h+rN~6O}Z;yl?X&GCst^kjKL% z=?w_o-^XDQ^{5YtO^=HGVyGCB*FUI&IlO4pk0ZZvs?S)Xsw+E-n;IoQo+7uOl1NV} zO7;y9OPa06f` zd4+d0ds9_x8FOG85wqg+8q62D8k8YB$3`s+2+#YB<*rDbt{f(d4|^P)fI+bcN)d@# z{Gp}lS>HKFoKU0zeQ8xuLc%m(Yt(GSegVJQ)URG55n7H}*H+}QuGn9^4l@qOu6SXz zM`#|N~4w{@v7$&y^of;x=2sUA}3&wT1lLzOO{${vhA4%7fvnm(1EJ?>yC7 zbIMPPtTHXX%*EN45n{IZg4^{u&=lNQG(LR?KDu=#C*6_+0hV7K!5MK;<^@S(Yt)=K z+ZtjrMy}E$Wlt=eC5R0eBpO04(qi`@-HpuC5fhi;?Z$}vvq*8ap7Kt_g=OT9{Oqm% z0wGV?dzNKN{Q0z!{C*32L&U^;)B~Sel}O4{HOn9X>L?iXB{Gnu5?UOT`Z(2@J3Q|G zMxY$N!cd?1B>I9Cg(VBSTzS%8ZmgFg(nO zh8bOu@np~krMBB{Yx`k9IwIP2`u)r&L$Y4%B)Hjjilr_T4pr>4`x4|Xy%EPMHBykB z>NqV7z!27i*}+o$haFNFIma9gKxEHf!@pi!wI0`h041h(YVObthS@~|0f)h87kMW^ zJV2zKEgsB;K=9@B%HUkuyVXWt`U`Q}(jx}KYCHr4hc*JB9ww_9%po|v{=ny#Gb@CZ z7&$AJJt#r*&0|5;gud|NN1z0K3~Vq)$*+hj3T^`6UiWXA z#f!H`e+}sV{T%RrkzxH#_)rG?PXT3n`I^|779|_?9d<>b%1Mk}D@!^U^fJCo7RZIf zgILSTbdW+AFf892huYhgli`su_X(EocaK%xSi2pJ( zrebVF@4lxdpO# zx`|@~NEE!OREeDLTr~e- z=12GR@6D5)8p&=){abVDY%R-YYxW9G7RhJmofUQ303OSJKi*ybFAaR}piPgB&8XsZ z6tr4+-^-E7KZ}whjtioG7y7&fieL?|YYLu4TM%jXuc5_*pL;NsMPmQ={>&p2LL7v* z_361Y1R@u`Ql)r|hhOFI|IFs8(+nr)$C6?(knCV&)2r$q3m#B^Z#;ZF zjIN(_7gj6OTxm56ECC zsOEJOr4p;&Q^O~nN#MmbXV|e46c@k>(oRX+qsEJ(K3ZfpwEC>LzK^m|%d^Rv^9hV9 z{NeQ-hr2~JDlZQEIc;Y3-z74pZ?9}_1E=o(y%QcuaDEno)U;gg&PbLp&;ekXr-n1nCGBXdHhbbpe0Cq4og$umZIN z7CDssvxoxwW$uWgHdlwLrD82)h~{UmPWn+6;;n+-RL`!DR=adJp7PsLU(J7Bb}4Ut za?bxM{*scZqMPa{*}(c^#*^@u}t7k_1ySj&oaQFY=b2I5%DBiOcGw^94vI zRoy)!C-npUqRB7Ac&odqXMC*_*Uq;_B~`h<0_YA4dG9BB6p{;V9x-deH41=qxFA)cd#0X2nC{OHE+)V2)RD0k9m%;qy zK=1|k*~_Ks;&eDECVKh+MW2&ST}Fx?ndOAWU}^wE6?Q>z2c^QOg48V>EIh(&&kPJp zZXBnM<>w`EtU1JlJMluSLz7SM(o^k*!I)1og%r6O`E5xa0mtbbv3v&MEW2M@?NA6593EjE=x*u#mTtbBu-+1L#ouvnW-Q!>U2p zDaZ1@WL&0Y*5Okp*bF1XR4s;u3dU4`NOiqq!37fphw3bwoQzvM>K_-d2*buq6K5n? z_OmJTjj+*Ia24A!1j){RQHF@KYm8c1s^En8+>8YEVI@_sB1R~@Zw<3w!?o4%_8H66L{R_mT*T+2zNm`WNqV=OSeWx~fAec?zGpTLK0Pez;A z+L3suxLib2wiFxddkcD{6>m~e^xUS*Mmz-yBM|ttniYO8@QjvEc&(q`H!az%*(PYQU(mX&YC~x@A`LFGHE$psycp` z|0>vmBx#sAGWsTGIF3c?TfAsiYcT*}mo zjK4R1ptjq69NHvOEr3IYDM!KJULR|%k@vRD&JLAV#lB9KjW8SFr%oNEOJx25hD4qR zGmUG>uRb$Zv+m{wsOVYRR}RA;_$Z0`Ltd!P&5kH>)+o+T4=k!XG#K;Fax6s#P?Cu> zn`Rq`c>IFs8(st`DSq|w&vdngACJ!yG7ZIq_utzWMJH-j(WyBY@vl5hF#fLoYSX+$ z-EThaECJHk!Kvo75LcA?&10aCMQ1D)WEi>W>X5BPQ^Pwh!e$pH?;-43PI{gigH5Jo zMiGJg$2I?uiv!Ua#8W1OT6RZ9OotE<=yG9JhIkYl^!wJ9%Qg~p zm^P++ife}_@D2z@J~e$SyJq~NV*tLhCw_O^W<$G>B6+M%l^pXXJTx4r#%rHp8@(rb z_(z;^@aci*@Zk5dByYl84n|m*gsl$i-}c|muh|4OMD>$-p8n8zG-#0T_Ur2dpO=Um zNNkLq4PA^dS;~BpfVTf*S5T%zW5WVP_~`4)n3L5Q^;um@`g%AIws(7iA5+?VEdz>XA-u4)#RE+kL-z z*Q9p;e0Iy&vDm^&kT^~1yk~=^>!I+ksF@Tz8Y}`Vl6u3%)G}*z2`;%Y?xLTboJ93W z+l{6%)xND{`L2WpIXdp_7w8a??{(?oT(ZIax z2;k`n9spGowtv!d`0q#MzpC-0Pv5-WM5(vVDke>5N@D`YhV!cweZa%h<;L0S<}e*> zRKBE=gj{x_Re&FNnDO%pr1;Py+y_3j5?GKjbB#ya*FGvNUlz!WhQquh$Sc6WYbU}S zuuZXyS__p6LDcBdX*Bq+u!EeU^mzP0jH)_N)MDFnUL!@4)wi`c*b@kNFaWE9wRnZZve0e>6j}Sp#YT(ZbVU z|A}P_J$+K->KF1ys`gL3x}Ft~wla_Q`J(dZ+kTS{?uEHsp|mf71=Z+au!;e1l(Xtp7Sm9kpF#q*jFO`#4o<6e#r&+ zY)frll>FFbOI&FzJ?iY}2~nZ>3F)q&r-B9$H0DPCx7utWXy7jl^Pm(Amq1j;3gSUw9@O{ciJXw6;mClk%8(W?-V!Ybo>e8k}@Su7ss**{Wmd{ zDXAwSTo}6v9!?Hi6p4mlHTgQOWWZU(0U|*tcDx&{# zrt~|?xuz^?w?--x&VM*h&Q9rg`tALx??2+HJdqyq{oK;H?D#GBWpwHTpMB{si-y1- z=-N8nRjX&8%4T0)-)6%sJ)(S+49Aio{V&(B2}23@$7eGJy+OTlx&wmViz~gozY_Xk zus%kLKHZ>^!qqtiA>c$P<)8yDMt*_2fa``Ipmc;pmrWbFMw6n1nXv!{lmwQ3D;iZR zDln0?Vl<;t$2x3%!_LejJOv$#z6k3S;u#?*rF|XP9HS3kKGce6>qGUxf5?Ox)PAL; zs_J+wbm6;$-%ONFK4kdsC#B&twOnTF7vp5xUz&AP$#0He-*~uxwU&sTE!=47w?EUt zP}%ryrv4-Q6`6MR7wX0BYNW1)xiS<{7-Wf5& zSewudjL-|jMl+4aIPSHiQ`~>?qf7_U<^1s`A)qVgd#ZUJ^miWDDk_=HSAqI?qgh_h zh5)4*xv5{!fT^H+xXDllG4#8o3uC93BNIgOCLkJomf<$cA<$dx_nyJ2Pdxvb2&D)U z$({%=5#5BY#Q?j`>VL_?h@UxYvBfTBwKu9Tx0uEF=CJ=;-R?MlX1-PNOIy)KB_O|# zB600w{)@ewV%88+bQFc3qg*0JA|{3K5Zx$!&nwbCf3!o(Q}N&KPgyQC{^cDGN5*?G z@9{3D*wz$GheuEo(tjqCFNyDM`{jf~I@F~tOB%N+`?txvKn@E57txNm+)5M?iwJcf zz-uJaZBK&ZO$SW}?WV-4tb)1T#MU#C^-h6iHB&U4%!LOWM=)Q~ke-nKcmBC{ak$ri zEe1&WvyH1n5n#m%A8IZeaBIMxMd8A_+qteN$5u8iUGW^|ep=oUC zjKYqQG^NUn%OB(&)!KG-k){YlN4ONUM0FKdSY{X$$_e$U(Y42cGDnBP$@}{fxWM}u zco<1C#f7-UvCP<{`YoUWj+g{~oRR^s=}E>X+g~a70|_?fV5%@C5inn}WPDX8tbcs$OekPVBTOWgnj_o}c!4R9rHCHyxIxAZ#t>%XkeeZQ$CEzKcjL3P^bBB(2^?Y? zS7H(NGPyxxIrR%VsT{glnH{6jR83D3@$ter_!#I0cP9)1r%dw7O;MKTv^Yt9c(TH! z<5hGe`aCqko%}V@hCDLXCr;@1(|PsaU$G-h7b$Z&8B$89JHU{A)MkJw4^g~KqC~6* z;I`&e-gE>PJQ4@ws}Y(5iJ3#Ix>sh~O;zA=r7re?rP(XTgT;i6#t-X@N8AIFiX302 zJ6WGqzmfktPq#9+D^~qiHX^&C56G&@U-r6;T@0F$u>ITHcYAE&X2vjmj?&_JTIowz zmmf=U5O~FO>@)OO|GRk&;Vgiu-$OojmafOrU?%sa(^N#ew5m_wp@WWS3sIpSw2JK! zBr=Pj@L;xlKA$Im`|W|-s9GJ}OzC}t4*VdkWP5)jHb6T$8&wlL&%Chaa+MJ>Hb(_2 z0M~T*K2>9R*BJbx{snE5`^78Yr#W4Jb^Q3>kGqP~M2R>{$XojZg`CDn^Jf+^7W!VDav+*Tp$$OO)+n()FfR6Zuy#6NMQEyZG<} ze8R^;gb3g;7_^mbQfsd)w(N}NAEwZQMG>#wp!rA`1T?1e>0d#omDm)t1RQ#6n zzGqsFZWmebR!%F+5WBJAw8BTqju?LyRm>E?M5F8T7cS>4waUhrUgV|okA>{Yoljaj z4{I~6*D{B{6rm12GSOAh!}8QSFFs1w9ok!9J}ssADJYWHC$GiW?^^J z!#;rnGB3W@Rgk6r!dj4pd6*_y3X(dE;!Q`=M>)R^4V~j6$Wkb3U;|8_W`u(%2dzA1 zd)ah-=)IVPb@Axf6%SGJ=P(sDthnpSz{Y=*OLjv(r8m$X&m*(=>i_iJPsMYcylb{T znkCoR2iE*E-{olLdgLy8xh7`%&iW_J)Irjy!Zna`<46Ey`?B5g$9cl;xLaeJjIrxc zJcpJEpNqcMBjV~)ld4Oe@pikl$&Q{n*+EW^QmjX^eg%bpopYtMe13Ob77^7O_Myye z0Cy;_uE`d}Q*{DajLfx!(wMIfubRNZiE@UhO0<94%j+hg)Ry}RIhVQ%(uGmO*MfnXN(+>vO_G^1m0IzLpN5NV6Hm6d2HM^S)_xoB z*y)lnot>}!^1JHy^+dJ#WZf$b=WO$B%oi68^nrHoY6!t4WgpC~@^jogTwh6;o6m`I zIcm?{OqOUlrR7)vCS`SRS}hVT=!|UyL7yy!qb}nObe3vqzCxZ(yy|-3bEIIQuSsaN zgfYg^D%=6DaO+EIRlKpr25L;)Hy;m3KRPi_`jo&-n#$?F~aF`>aHC2iWP9r`p zr-xQl#s!3J+WrB#7raEqwmY7>*%t8H7tq+sE86Me;2VNaV9h32qA4v5-+M5OT#HEa zB^Hd7^`qk~rw12B2pma{_i1@moNIVU z{bZuk+Hr#{T$!B<7%EpR%Yp&GQ1mF{A9AzEGD_*on6r6IY?&~L4x+QZV76@6wFFw( z;{(D%D?v|!SB1`Wg**N{@Huhthj8-buLGiy+?t$R+}}#C{yj4W;W4)(IGM1*BX+5P zrHq`UnhbaVst|;$j?ryd^o5AI0q0n)*dl87OLaz)mbiI1v}p1<^LP^`Zs;J!00SNf z$ST;Y+RG?H%!rFlpur$a#hJhZ5|i!mBpNkb!u~9_Xz<*<^X;yiTbwKvn6IwP9(!xt z_H`E-8Y-&`z*2|2rA(0czLoj2(ReLSeZjKFwbJ;FKOjXO3lPQt8sV>JA79uvWQ@Xe zK;!*51P}h!Kfvw+anhEP-nV2~urh-U?X@{NqOcSx?#-;jF+bt=8L(h$BHt4#;38?RcsJ{ek=51ghTzbEg6=-<5isO=o!cS6R_0U2|96SAB9yV6IqtM?(?lu626uVIv}g*C|g z+i0bkoxZTS%7A|jS&J~eRh6mUX=l)&9d*?rjBn$_Yw80Zg!Jicw>JM+IMJGp=H!;% z8?^b%Xlo*2(Y$=r`I9o7xZvtS;!3n8PB{!D@uNkLab=}8&_LhS))ihlaJYRp;(IsV zfqZJ(8GgxYWbE=MWGCOwtd?h0Dz5IUC*j&Hi#@D(&_UiTjXxJXw{P|kKhC17;F#Vo zL)MM2_|50>?9IKqIG8w)?_G3Z#S_J4tP~-(?g|-P3-YK$LcLa4z21BV(todv?+2^W zbHmnVgok%onEW407Gk|HcsYxu~1sa)Xog1YEr`uBy!z=8XrEyqJU=(7uE`} zI|Kh_kB8%sfT zY+S z*Bb~f9F?vTi5Qvl5EtyFY>o&okne-3IBi^Qukp5C!fxH0S~z(OThzCRRy8{u`*{&< zHED;YIq^Xj&vQRjSe-vZ9;_y={DSGHHW5?I&$SM{{<)I7BRrSn#C3_1P-`gKb|uw6 z%zMx4KNnlnY40NAz(2C@QDw+pqdB3ztv0*3pmrqi?&D2~= zKO4T?eYpGm*=^D6%OtlkS(K)?r=T8Ss$4;BfOsGU;nFpV@24vFDSA?Dob=;-`d`P1 z`8XlGdRbx^r|C%P7CD}Z0uB!ulotz#snc&hXC0#%YR+r7!p}COKkwTp=bbDT;qw*EVFg@=_cJcvuPw zsu<5^+v<+g>F}TwuW=f$eeY*TO!VAlRp!04wt0mg1FlS8PYuK1lGjFn(3W&)04X&cWoYO+Ck#2wYkxK9T){9p z-)bK4r0k_RRMb`sry#?(sGfnMF^v(s?gtMwCOYbV(9v)Gf3(MTLH7`hsuMllqN-Uv&?3r$Ppdf@ZhrVD}~&tC#i>p)FA zUZ<3WB@#ekc;04Y?C)!y-i*^p*1h`pcBK5ph&w5(AV{05xP$i%r?gUduejs5(>o9y zQ6Ab`A5)IW*84n7FVy?PKe})5&u7<3f3IF`spTS`@@kwOrQDc4XHQ+D82HOBL{#PY?e$KP6s{4wCIT6$CiAG#ZGYpqe62*8eC+$d)Ol-FO)$kcd?C>=+*P1>a!oUw6a>REwntrE>L#DMz^j-pbIh4(zj}*$p#f1se@k>my!h{qk zF;8|vay+ZmCpd(b351mjj8xSwz5z^G0?B z26g<1sVo*f3wc(SW=h>DUK==k0FEje|I}MJ^wX=yH}|-HrR5=hvPI6yQ0vc$YL%4` zTqOFnuKnB9w#{wii$w`u>HKozI8{RAvPR(7mJU=DPZ!jtrbE67?CJBkZZ;@tWgFZ| z@0fY0jr1g2|4*_8qI}yjGD180Aa1zfgdDU$xDu87we+w`Iv3@OpZWwg2~s}`qwxx1 zgiTZ~Cn0LF<*<67y)q+651i~JDs$vMXr$?z7#w`3 zJ)~EmpQ>*=;gqXRx$VBMG>YD_{X|LlJ>j@&=TjbhtiXw*fBVL6t)T;+uOsgk+)dqb z0cW=xqweW`JDP=8MrFFRL`4>{U`wB|r0q(cWOki#TI;-#?S5C{y+9<&4;&&+4x1@9ot&3|)(__B8UHG4?A> z`s}?TPq&usous(9h~vqXl#To;CUXVUu@xK5HOT9uT2Z50rD<~Mqm$p;wfDZW)trxO zu@927V=Df}uzUZW+|Z@z84>4;+}96$j%4zPUub@r6JN3^FG^b=Oc(w8YTk&@?MYO9 zlR6=zNf`mVurk&o>B*+o{17b$X2Ns~BuRJg=ht#$yS$tZ#k=IZUTkI7Z~~~{pr3=E zC{q(A7zEUJq7!u_MX0WPCOvk>aLl|8G(hQh@G3)JubECbJ#XP#9%kb&?Z~$fGTCjM zTonpt;ma?}E=iV|7W(Tt6rEo-&Qfa53yJ;rE}koT?F%uvwQu18#Sii)6WdiuYP5MT z%#W;G1w3wA&qZ(~zt?p5$xa+vz3e)E>@)WLnR|qcT@D-MkF|mQbBWCBia@+XQgl1*MK%d&gF>J82_}c*z{${9%8ovA{nk!q)PP9P3q`c5H{Id{ zzJiV!Vt!APqCF#qfUf7h z&4>{Kt-NMZMK}3jb2yGca4Gr1cYWFK@b|-Ky(ylw_1`zEG1D}UEvIBBRE4LNKcYTn zf^PEW`*#aJHaGv0Z# zQj}m*(q?{4%RAqAQ$*LM6dZ_l5PYNSVjO*_&YswkDH-1l%3zsFFz{1un0#t?raa1Xx=Q4m_IY#jPUNZ77 zg|i}Bra(v~f1C-A(i`MtE-;r$zC`&r|drceLiL>1>4gZe3A!a|@$=R*9| z@92gOwd5_Qch7u>kC)#E*RoyNn*^ZZr!Q2w)9#;Bo(D}lF;g)>FMmAV5Eut}PqvId zZ}U=JVC~`!|KJ)P?f3WY@AZl#sYTL=n*oJYD1NMhh@>E>Lzy+y-)i^{gu^n)J1`r> z2mtEaJF5tgI&Mz?d-st(D$*qM66Z|HRO{YWI;5xTt>L|!#M5^HiB9K{i?#8Z16{c3 zt@T%zp^KNoBHT}dv%8-%=Y!unibKfvI@|B`>-;x*c5tSa?Zzb<8mt?2ipWM6(|st? zEhP{KC93ITnc+SLYfjQn+7_kiQW@l>nqnUK@@n%* zkmMIMkDz^7xx-hq=MXmu+j%n>3)$xE4Bh)SALOHA(*I|}g8i@D{r~eT3j?T_n^6o) z{6U)^taQ?Dy28l$6#Os<86F9h6|+Q$tE3x>DL2-0o_&mvi0Q4HiTIfltD}#*`r_j| z-WNF*DsRHCCMzvNIz`_X9hv{mP=_jdXqIAq;*_u2}5b2E;hCWlt<@v5^drT<0UWIeLTNqBRR)=;^D>c|t%57)ErdnU8kojJZgf!%^8<_jUrD8-ty;tT*c*ZVXPJRrD^X)8Xdg>vwKjONKB!@VQfMhFAjTme&!H zZZB1}IcUYEmhp}0)ENu&@qh5&J+(clQFsGkl7K9&X%*rJk^V{+%xwY6Bmd+ zsAO3X%rtyg;$=O_3qDZFgPuvc9)1KAgfUX7@3|esO2rWnM-c^RQ2I&9Di|klsnZro zNn^XzXPk3AUUiO5LX_qTcVV@(0&{ynU`>(5RXHS^(j{q%cfz3Z8G;DI4pZIKB%oLv zHruXUC3afM7I#^T=vt;YIvM{$NR0HH74D$LLVU1DL)Y&;d(CTTZs1=ds)4I2W$v7n zm`8;a_m0Guqv4IAd_q8B2&yoU&5NF&z`C*{$Y?FssA(1~EYdKBt8y_xC+PY~8T+PH zb95*pWZ?l=q{y`Y{2_ljZ$nZ7hXZCY6;$iDiRO(=l>mC=U=}=Yzx{Sz6>Hh{A$w4n zg(CzD2M-B!EjfJ=R+#OZC{5}O6jEd(PbC!g=X?{|+fP6Uan!W!MnkpRxwFvmPNk^ll? z^Ak8QT1ywuEscWs8KHQmO{AKiD!@o&|9!=9e?X5W&;^)#$-b+lN zigo1RxUgP4UK_Ttz6lOY=KA|v%w{7yE(LpUQ72PZu~h?0j3VB6*xOpk^j0=r>E3UK zTRsY1oq6UFRTmdp0p)5yHI`MU!Ob%DgR2SL@%s%!LK6Rb|FKi@hh+B*JW83<%Bzgu z@TnR2oF#CUK@upjWo(La{Up}-sn1K?sZ7H|ZO?Mg-GT!3&1HHHgR{p7%Z`=J{LCec zQL3V5`q-2qImHm41U-kaQV-YIR7-aJnU7Z z&8Qo<5`Nk90!>O_%&lH&YU#5{M%I1rv^22V077NF;DT`bq`or#S9?!(?Xk;gNjN^f zx^EVci&O4V;>-zu;q0m(apP=6BriUv023Oq8HpfmiR(Qr4O&lumb+Je$0e%xpb>lG zDiv-oE|b_V+>8`6yLI&bi)lqtoXcq$1@P@FkynRS6WU8*WouruS9*mMSvByW>UHc< z@{v{6<;l}kB@gS%M*Q9%a%5mmaheifz@crZs$1X^d1BUOcATB=!R)MCXv~#XIHmE( zA+sbVianJeHm9CXI9U@n}>Q-A=}K0!>JK8h@Nis!q}LzYGK$Wct0_#DG?5T~YDYwb#3McRl=D z-)Y`m8`afOyGa}dcGtx*kJwG=+0u#1hBE>S^r<;p_zO4%6i=bD4wRg(BQa26C;@e7 zIHoy?pRD2uOqKT$TkJcQ3apJV&gOV5;yb+(uY~S;>LQQq?m})fheMX*Xe!ik+l3wj zsuF_~uhJD3rg$9CN>0N&3WD7`fmUinC;2M3|5Et5ru8~(>5Z|=m_2^lts=Gglgb~D z<~xgGj~b40Y~D&Wjp5q59BZy-_@51&3I}!r3%^#CC-yBjnIa`5xET^5Mp1iTaMdP5 z$ZKxLUe`is86Ws`h-=>WC;Z4nZ~Lrn=WLmITD|%|V`o<_UKZc2{rmB+%<1ax0Ocp( zsj-8}5X*r-Jd*LBtIPkJTlBx&C;r#33}!u#otM(=_Et@h-6{z>PvClj)Fx0m^BcAm9}L0F!G|Ijgy zW$`jO(7Cs@=fC<+zlgfF3zcOr#?RhYzFUZryU6EvFMrhkrNK^eTS$RwV$!&MK&vv- zc*H<|iPG)8Lc?BA10iT%59&>(Y`hIx;pb2+SW4)yNE*9jxRX`QM${EGfiW|qQ?Htk zJQg|LRGCo4>xdc}7sT!_jCuqC%zFD9Ujqupj7y}EFTwmJ+qTysTxA>$gb~x!j1S?O z5%Q|;0vW+JaY)@~^Gkxo#*(}*j9TPO@q;uhtjG$KT{_;jH{{DZ>F2<0sj=8J(L&uA zhMG)Gh&<((^+8yH=Jr#^3h9REj~L^0?YwgkVnz_2Ef!CI=sIvX2%rcX8gFM3594++ zz*p6f_0GU;Yq-kQPmmF1Jrh0)bYXT10W%WuRhY-)HMQ&)QqsPg|5vyQ_DQ*>oezqaj$oSxN~xy7RbKNc`JpI=}8puSw_TzDp<@_OO_EA703n$V(tuhdY5 zK#(fE1qcv2MrvrGm(Zk34du|K2!|S4P(lakJs}`P&>$#XnjCu9BfTTiLF0 z8)_-TjplxN{mis3m6~0dNJ5e?6}~~mvFPLky^vy-aqy5)0|nYJvWKU}id75plO^C6 zhkY~}ikel|#Huho?1tTu^>Y(0ky`1`qHI4+{(ZdPIqJJ@{xEFN=veDVZ=AVCi;qD0?y?f>&$y~CgTqJCY;%u*)-?S9N}va;hGxMScQ|VSO*=0~Nl(KKm=k*V;p<>l%AGw=WY~*!IjYIE@K&rpI->+nvk4H6Z zyR$5>3~cKjQV9;2er{(y1#r1J3hXbcvx?z3D>Fs^$ylU8QjnNx6^i z`q4rZ(iTSxs>1>&Oe`g%7+3%A5BGMzG=G;Szeg3BzIW? zd6QgpE+qVVo|(1vI_c?p2(yI=Rn2tw zd|qcu7FF*vxnRgs{JK8l_!(-@RQQJ$2s5=(j&{USkz(TA z23-!-yMaJ}_5QDU$1Rd+CvtPMS!OenQ;4}c-#E?8k5>3z`n!J!N~DVBkkM<&h!tdF ze8Va@rnGLHQEuu|!*)TXQ^sC^57lO^eOUUQg@cm1$jdag{q^h?e&3L z5}m(Ht>=2>Hs^l(*EdZ&7TH@{Ofb~$*M0{rtjf*9L`lH*<>H%Hs)Up(BxgD_Z(TuN zA)-%Znp_@`ax10mizXEXJ+Dp{fYecl0m4r%)lC+rP0SxGQ7tI zIFA7=7y#6#76uz#-q5>`0V}7YB-*a*&8$R}*szxMENWV|CG9~gkZ9iS{o#?ZX#N*L zdB1B43x&u>+0BFoi&AvyPV2R_Wu`f_+d)U~w3CQbBXbuYv1mIFae<81>y}i1bslGR z@)%XFZrQ*&;>MOWnY(6W*jhz_8s=_&Coa2!;NHt%etO}~g|(ebZC%&6k$GbWQ__z* zrMZQuT4OdYL8b8Vz~ef1?}?Jd+MSb|I^^9^6iv2l9yMwh%1 z)}QNW2kZ_!4-s{2Sy25YCgGcc_;UR=Jgg)z+TGqH znDbdGr@9!SVm*gkA7U~Yc$W*kp9{JJ#Y4=^L*CaUYL8~*4vTniN#(>+v9epz6k8+Y zi6$S(^6e!HB`n+mhdnoruca`>@cb-0Dg2d#lO-Je5jxjyBqJWJQS0j5r}yKyE_^m1fxe6jzbrwG{8Dl=`sF!I*o=Y~3uhvzJ4;ZTnCB zc~=$ALTfQ+4U5FS_!Sb_xi+X&qyIA6n*%ewsLAHaHy~0D;3X$z^}3DCpe2ouQ&*F? z=38+$Vy2@6dno0Z!cG$duc{BrwpAC|jpGmDZYn6tX2r&b&frpFnSEtBSW=>}%2yN9 z)@K^6U%LR>uQ-08RYpU-7zo)4B59WA6fD>|yOP=qYHdsn6?)PFv6}yj(Th>7$x{OG z*`)JstXAyT?tSeP9k|)<#NkLTm)&V%)-CVL*(;N8=Whqsc3$VFmP0st^x z0$)Lmwtu%ARN6Mi80-~yN-8t?YxCmI{SL=~E`iGnE06<%L#@bWS6tSKJG!dTkx2Y+ z_QrD5<`L}9&wCOsDb>V5!LJS0Ge9YZA~pwE*2%75BWos~1dHQlc6oq6S)nJpNiG8< zAii3M(tSPFK(EzB3^JWQia3*lML|qYMCZk~5dnPYB55nio-t?exGjWPYm)Y!ezM+% zG((MhkS2rHja-Ujy&l6h*XnBn-N-(ke>uU`VP8$_XEEsY@SXMBSpT7Ck~cy4I!*n4 zS3!;L!axgyYL!&t&zk{85=i&Bozc`F*2CI@Natc>c$#VNE}gR`Q>yDBv*%8r;t0VS z6=1atYj4G^!~5dhW(@1vyuoch2#sp|W;!r!xOCU>fC9ziDQSDD!E=AYpZcgP%`?!I z?1{q@z)VYjmgwBSF!zqXrD_f_8RcpP>^Ra73kD@G_-tb0MM#iOEjSM~m6ZHo*a7q- zBLPeJQJ+MonG4GL%PZ?KO5RL$(=;hLSq0Xtbvnmb)HED_J%SJ}?RtD$0HsNO2nH+6ZBK39i7bwhEqPreQrnd91Vh|RQdpyip)6@c zxzA5~Vr!eI-kKh3tX50E(WStVsNHKtA!VMsPkZtYu%55Eb?@itR$gCSW-H>19&-1! z`|QFB>9mts;@nBT_SgASa7c*Uv@|d>lf@5c%KR)W$$yrTe4D2Lm=%6ZpuqrSe!Zso%$$3F~c884Yk7&ThQ_N(RhkCo`m0ai>s=Rir zLwBS2wLqYiCfx^=MT7Aue56>r+&3arJ2V63oswjLd8$)MGpld@4YxTTMI&u4Bh^;% zsfsN}k3}YPgjmY))QglgiJQP!_>|wi<*`>KPcXm3!48$}#7P3;HfeWJ)dC2V*TaK) zK&_35*-XM1u<3RUD>#M62^@*Yh+%WJ1@C^Cu=hGG=R4 zVPmQ6Q_P1aGzHUBhA{)u3NUB+JcTkhGW^{-hNe6oED?{K=&vkt%em-A#jMT(smdaDbW{tJduW zv8+}`0eZ}W1WRm%FtXpuRb4NLjQ_?JLKO?wf_MKhx(8-4PB|8`Zp+^5#A9AJrs>qe zym=_shLX;im7_m)EA{o}Z5onotkjobA?hdS7qZ+gWg9p92<8>$~c$`>o z*Na+*enN0n4TrI(->*7_qK8JFlk!KqVPC~51bp(obM`YHn9>Pd8e2ombKO+?+5Ao5 zs_T3v;Ct02T2DSX=Wr^$$MQ*3`^x!yIT>>Di#>XXIVPP{;f~a$5NzbZjnRm zals0i?5!q2_mZCj>jNKRIMHR;cuWsZt?0p3djXyw?x)x!=l~0KeGMzHaHMC>;y8E4 zn+vdf!WreE5~TbXCLrawa-i{NsY!dHs-kfu^+>1(7}y<%S4w0o^|`S zD3s>V0NpRGlE6jDc^(_QL6xTj8Nfi3@Mh9H{)jx7Lc;sC9CrqhE zf_*|>vA<623F}@Kk%l>zElx#?XY0-sJ&pPqDSk1UtW2fPgk5;)-rdnwfDs$0+G{6} zqAoj&RN!BQ_tosl9R0^cP|uV@k*!4zciiO*`s#opO=IR0&PbM7sT_;iTzVY@Ja$K& z)_E5;YUXbHo6oY@0cZz!aSwo}UC)SV#icC9JfvD**vCYC0MzoXpC?~}!3&cS&~ zcxyBS-f;<|qTta)Hh?WV*Fq|~W(wd0Gisd`8UdwI<|hj1H82mjXIIBOW+o3<@VzIT z{OiH9N|7HLI{v>Na{Hv^P^pOM;cZNU)1FiFzF1PtkG!>@NE7>E%>n2AOE%;$mt;B( zz`mqIdWW6l&7j&RY|v+o@|h+%sZGqjiP^$yF>ieJAdaD$2A!MK;``kwlK*-LM5m?u zJ55ll*%BG#vzOyZ4z|pfA?ydx=9xCVyiPJW35DS@Vt3DpJ(Igt5aek{!YlLw(&-Q|GPkdVce%u(|@R04}6%1-zq+!l`_{ z>*ZA~K+=v(w|2`&G?;gxTl^g5=+3?+xK6L}k~2eb{G;Xgp`@kmD6_m}X@kvCEOKhp zw#|VVWvrVSL>SO6a9fG?GTAwL6*9NZpBg0ce5KSkJo~l2yzWLb^7Cf|zX_*TY93Fp z_-?pna}r1sm*1+FQZ}R3Ax;-$E&qbc5R{tSv$yZ)kXDYASX=P^t50g+ z@mtKmoZ0NE(M|=2- z16mZ129nb&&~;}rtc9@-MOZ67wN&C0d4?7sR_2(kDn|A|=$}0bpif;2v0i~7=H#^% zQ_pzge7D|Du5_4}PUffV9=md;CfyM%+02>KETgwac{6j;f`sW`&yjY_Ryr8I(cPY|oK;t? z9DAdF?^1!mF(WMbXe<3q<;oi+n)9@g$f-7^d~N*&x}!W#MtL4l*PelzlXWH!FJ)7) z?1AC88Aj_#K{_VAW}S|j$xz?bs>Z<7?LA6Ci1QC7gCXRnY@rTcQo27@p3FIeBUc7~3+fzje1s`sn(LYcSr zhVt(zDw<6LZfnkTS{>e4yq#Mj(k**zY5l@l)x^h8AScy}!vJ|NVTvubLlB|Y3kU|^ z8>1SN-}=o*Ln)gaLoy2dCnF;lQZ;3<8nS?brt&dX^!q4K5gDnd23C~~^$y(rW@N}! zv?ukEN3h&hH}TijHR?IJQM-1n*b}l=kuv2d9OmU?Q?8H~PUq$0Q?59+*J~O@R0rc8 z;p#qlV;PdsX=OT8O&2DFLOsIoO(LPL$r`fv_@%zdBESroWU8?T9~iJKkl0tMf~<4f lm&rKulqqkJNP4>|xCJHOCz504mp^EkZE^PKx7xp)Ez!QH*M7iob~3KWL|MGJ)jZE-8^-r}W{;uI)WJh&5u z7;(?}J@TKq<@wV0_uhQg_x4$tot@pC*{-A$=|Xz?p$FK#$fscU@I!a7yOVAZM!Os7 z>NlN9XZS}K2%+5>{*N&Tatw9lJe^5L|NlBdjxONC|8((x6>}hTfE=_0jF-#m1o7za z>cbUxpzDIM+C?FaBi;i--C_K@fsKF|(gQ+> z5g6(L_(I*DfHxSXnDi-x5D=SsK^*#fe+bKIpOQYLFPPqtqc=bwe;$m(SOj!2)Xxun zArJaL`(S_O_kaE&^>Z=+Qa&gB{qULJ#?WUF-yh-!_)UL*XduK4AYXuuKD6oo&_;uK z(T9Lv`B($2Erzizw8rv`p>u}zOE>5T+JAHo$a4h82uD)J7sQG-q%D}%e$$$?B(40= zf;1;BNK>$zk|qF+z%(We0UCg*4^Yn!bx2)O+iz--TBJHa4KURJs)DHk5KCf6Wq=rf zO5j!^(Imm0AOqo zu>u4^D9~?${H_ITjKwknz!wNErvDc(oyJ-Gd943GTh5LD$FBqu3qXM1wh%M;%znSg zpK2v0f5_|)VNNR;{3rEe2^fdPH_Pp5Bwh*9WApqLgxBK;}U#<)nx5$R8-HpWow zj09gK;A%A3h_e`vA!?%!u^Ds3LR@9A|BK}m-_gbyP#J8*e>xYaFBU>^V5-1Oi35W^ zbP>=+gYyZ)bXHY|8CKH|HNZxH4Y1MF_M6(^)&YYy&P#-Pe!ITkhcgyuZUaBaZbSdP zZUi$NXLlq2{KmQ782mWv8~Oc>{qw&uPy8Yxo8Fb<9c2 z#=2n*TY}rn{}n8!i9fCh#5DHzt>7C!E{v&iAO7M$SXhoE$=_l>#M1D8^T{>)SSQSj`4A}P(0XA_EF0N&CJ)&z;lz#=H zD^4`bH#+0cMZooe0?uEYu?RS~DInda6ra)wr1Et?Q26>lZIHfD8ZJ{QnQF^4kXb)E4jg&zp1`5@`oLSGOSx>c zDKAdB^L`Mf9CtrI&rNx4ka zv83bL8how(XKa%hoT%5@>P_N z!c`4J2soo~4}w5v7?hY;>hr#vODdKg3bO5{b6_oQ4Yu7F|x zTLtNU1Xsb2lz{TbxGrKUrr^E-d3WTiDSuA6f4W;h3WIAW(j46fx`V4Hg6z@|uBEu9 zqCsk<`w!qMtMP|19{srLQtF0&*{6n8SPRq-*J3re3cp|ZVNIqhvl?hA#xs7K0~^yR z-IVD((pQ?Breg?cFuIf)bMTMG#?c<3{eyjk?Wes%dkXszdsg?M&yj!8e;5%Q6^nmVtbQ9u3Js1V z?*DK{M@JR?^16UHK=)3RbE11)+?>Hg+p9^60EeGpBF@UJk4 zlN4X+9tZg~G!cNwl#9bX4(?zOaQ8y@D|CLyTp(S4aDRfk5xV}!yd>R`;68)`ouz2k z_0L;*MZ*0C&T3qb=zPch1_eqz_wAU)IS z;HQ9{fcnX28MY@Y8Rd_l`&#dTqp?orkvGRFW zXDCTNAH#AHuxzBm9sRXITKth7V@=X$3xL2V21+-|JCtHS;Qk{UxcxN$ zj^K^-QhFvml^#p+(j)1ibRX=xd^PNV>MeGd9D0Ony+z|VnXB3VJUlHbW4 z@{YKOo{44JF+G^^%=gSYLzA@bvera@*XyU7xyit|!jFoEMz0oH4EyE{pr3dz5FmccE`H ze@_UNCKDgig?p-qQY}&!YMSe2=x-UEMvZxhWu~<-z!p^9<_p$@_6|E6ej_3;e0KQU zu&tr0;9&t%%q#Vm)hD@Y(i&gBb4o>iN%g{0d5yE}8ROIEy*rY6D|tmy=OiJqPf}>I zBY9J5r?js#)!7BP6AK5H&aq#0rF+A~!_0eypgN?fq%SobHU^k|<}Q{EmQL17R>8U? zU`@cFz&C-%ZO?3{LYjn?hdUxmD_yDdIHtU+KCWfuzhn2s4voGZmK;1Pu)TSkc7&ox zy5ha)I8nNwa9M6-)`Pd7r)ZM3Z(cob@jUSPsi%#fZh!Xt`K*^C6B3dW-oD9fn>)U+ zZuuqWF7J7{(h zn4(H(^5(^hBag2>eE6{Tqv(gfJ>30x*|WDVPbc0@?V4UEyGl{B@~6&2JR!k~b=uCx z2IkF{9|A50hTBSEOEMxLAkYvrGN7Avg!z>Dv8AuIg|$V1IVd8eUHCUqInlFXPsdfO z*`ZEhwW8RR>Oa>gj_wiq!X{b2G7M1vBGzz?wrfj2$$6Y%csC*8vzN9P_nr=Y;JX(X zufBgR{=xl|4;w%E>Sf!clLru%lV@!Ppg56RUq-S5dQf%-_}e)bv$O z4;~o2!g@=;QMH<6Iwq8ZIIfO&_oi4?Vno=k)buH=o>_@Sw{5%@1$C=$E2S>zZvUJXO}%vyP~g z*R_+4X6xmk&%+*uB?TY0eHVHlq)X6DQ@EjxZk1-0Vj44Dsz(kpZ<$WqJoPQzb>qpv zx#2IPUQ~HqV}0F=O}jOoQFmseu+~c(-Kkl<`luS|F=vCPYNn9)z8Mt_vdR)Cyks9O zxS4-7|LWc=asSl3{P246-PMmKz1Wc$m%$e7E&Iu}P1>W#(d6qJn=Y8kO&g7G^A!Ww?HZ;Vq{_O#SmezyD{dnads`-HSe@ld=y0Kv zqrf-KcJAd*?}Xm2^r`Qi;a((6P@> zy!nh(FH`0Sx2&BN@hEHILA6i*mstxO0E>z zN_LdYE9jE_SLTBB=kLpkN0+uMALZQQ`o=lP6CuswPH{(7Z?t#xXRR4Q)oi0e)v=$} zJX2$D?RpK@H8@-U--ZL53}|}3`Ol3@>vXGksP4?@P5NDAI&)p|r?Xz>k8d?8n_nM) z{q{}3>kg?e(yFIg(kf*u@~p*c3u@#HEj(6GC$niroA(hvX5^*I{BJEHPRh?zE+GCbP+naDcvVY9Om}@b7l`m?}sJXeCs@CP&ZEGae z>RD%E-Gganr^Ct;t!tpj;NgN$;VQQGIpe%OX>f1MB0kXcbVfd8)W{K z6`G%$J^5{)ge$3^9nmeiaiwdOE2?}^Eidj&WqVZX=(m;ERDK)zN%Zupt74xrOYWVZOPQCoEPG?x$t2CI8;P~D=jD$q zHG7)ae=OQjSX{E-bDW#4e8V(kJ1HM35*6QSs{|TDhuQuK4hy;;@Y=TCHal>cZMluJ zEHZYotPVXMbtIMA=Z!wL5EDNX0Wz}+9NC~pHsBQGmUidoXXd~A5qkyY+*rRE>qaNU|-I{%oCZ~ z+y(jli*FP+EbdYMOT~1@c;7(Z8KJ7w-80#lUEaXi)IH2S*Yl_A8NXNjjXPzyYb-HV zHcvBe)4Pj_j>MPoYrfJ3^_9S=5@JMIVwN-zqGOIjfr&vVlD~B3pS_YfvXeTNA zGwa1@eg@x>U*PlloI(@vGv5%m$z!+Au2^dS$JxPcait1xlv5S)(lN#$DD7*@9L`TY zO7BZaqkg9zplBv4q?*3EcE)u~Jg#IFlh}Q_>Do`ZJyLbyj3`Q%*&oEq3m1I%(uLJh?^7c z`F;?ODk3%E%7c6ixuLGc{3JXPCNO622Jb3GQzl+G;9{f$$}W5--+l2kyGlAEy=Og& zrA#MrvUi|2$Mu&`i@hc$DduXwRi(Q|`GzZwOD69KeunZ5_gqp+(QF`zN&oE6V0zflHp zcg4+2OR)~WOt>y=Qhliy%sx>bRkb2n!bESnFI!9&f~5z*$yXLrr8F|0eZf@XZn2Ws zlhG;`D867?koAI+%@8|DDMTp^XPYurgl|0?q#qSqxM1aDZWD>&m${C*zICtkYQLgeoFfIngIhICKh`IlCH{Bvf6y@Aw?oPk5mZfy$`)*zDZJ&*n``rY0mxS8zK_5 zPPp!F$rp)(nOCAt*v2?HEi;Q5Bb?<+`AT94-^~|AilsmKZ^=$L_kJ#};I=99TyOaY zB*A0x7CNenTNO5TEt{{rU_7dsCNB345T`r8a9(uQVaKaZl8K5?5Qz5m4%JpH29b4OeQ}zT9S3DUR~A^A2LHjLloeH(9(T9+$pm&L}=n)zsEh<$H;1 zo3qH<)yMm0bIX;J*);YsX{%Io*}@=pl6cQMoL?*brK+Uss59vru|Eo0*LHhzcY&vv zFB0Cfk(#cm_3Rqv1oJC9U#iciDfWs%{BvO^pTe&v1Gq~ho4?>m5EltCf`%E-_2mW< zQPG%b=ef^c=XmBkf1R9SzLcK&n!>zmC-7ob@{4HlS){GpXr?;1M>9ZOlR3yQ5*NdK zdMKP{ev%H5aqJ$(;qwY}#5>;pKCN#!ujAe1q@s>;v@%oGjqAnlaToi3=GVG5dY`hT z%zYuB8LhdcXu@PMkz}G6@0-TA;yzbiQL-AVY68oO`M!31PiZ$3raGxERTgvAxT)Ot z%oeVms*&=PGF4H)oR>V}pX8{dXHROI>8dO1DaUL7(KL|O^8-i~@h+d~+3I@@cOS82 zowQ%vE0%d(?k_#RcsmMpg-=KtyM_euja;=nH{E+3dPg(&P|pqEQkJ=X=W~Q_#Y3c= zYfTymXZSa6llz^sgDb(iRD8`o;x4Hl>Nje(sds4_YXi8h-rx9GavFAeHJKX57QwmZ zQp?!jSC&5d4VrLuEL&H)!YP$Kl_%75jl>#h$}{yf7HT^w>oc3A5?_LMqHnD$*E!0! zS#Y@TR}^`=_<<%>W z+1ofGfUEd{@6GgPeZn8YYQ;2F89R!tq?Qc*v>Uh=ip{EMWoPb~GC~(?USqXdW||*b zdsz1y?-<_e{xD9mrs$jNc*9?&x#o1!`G5@p+by#UH`w}o9oLooC{o$ zu7j>yo{8R*yjOa{wB@#QlL4n*F?ZN_ML$&~z%6$9_JZy`{q_J`nj~5W4W`sbD`s0nX0sL>64OOWk1@xIQzQKI9ofm zIv+WAxeL6Uc!fE|-e#9E!^D?9#yi~GK`@cqidEV`-70+(<1)h`!(`nx=%p0>Aj5X! z9&<{-9{~pfx&<8ysvnvkx;gCc=(f?(5u?KrL;egHqix8H;78ks7kP8jvj5EgIsbWi zmT!+ZOVLD`%sm#Hy3UkUDR}*U=lhiGUU_$l>)21ac6+<~Zh2n2_Bnc&-z~M3tSg2s zWoea)HO@z#Fg`^*z|3U_F#kvk#J#?Ku2qiuc8mRpYYZFO}UWz%ZYSyNl%ANu$^{S1NiHLQnJ7aU^i)=FvTl4iz>bMA1vxECjkOFjbvv|s^={LASo=nS$UdJTStQCht;w@*Y5Hq6+O&QC3SjjOk^b-isM~3 z%HoRh^BU%_Dw7Aefj!<_Pl)&fz{KgT=P|Gw<*2BxhU44*O+$mb--CMRuuj z)bSdNrXj-#13j}V&Xng?^mOjzQ<)CRp_(}DubSq{67nbC$NQ77zb{Cb&%Rad(H85T z=+liuj4pkWeyHKNp{G7imu%Q?9AzvrjklCr;{$I6eG@z?bWwPGgfgN@*k8e^fv?SO zv!uUCqP%gAMMYn{pPgPgTUA(4{+(}t;<^5eK24oSes>Kh{U?XX$WA+w`6B=CQl;w^ z-<>QWH+iF{xpP3po6@BvRmybspPb#?V}Z`h7kUe!!UKM|pb}c}PkrsZqdm`Ec4vw! z(XI1c0`4)6yd`&;FS%0Y0$C}2A&lV%cwc*R`F&CccDnKt^;Gpj)dF^-)I_w1r=@hJ zx$0-#K*Ke|GW|E&RFy^1o~xr8s9k6%wFBttzZi8fTC4WQfyPC3lUz!j5A$h`+!} ze%ZakHPP{{!)veUy63GS?qvQ|e4?JMUaoq^?UoqfsAs3^nQOjhgD{)fr5LGMrai7X zpuVBdvAncaTrZWAd0c1J4$UQ9cf(?1yuk)D@mJkl?P*PcW}7Zgzr!%g=rwh)95mN6 zRX1)nbO$=!+pynI$ynKNT=$D+u%@xDRK0*(Og<4idIwaTD5+BVzU-%pgO2Xr?ZRwv zvC!8ixH(6yvZKY8;*KSIN=KFJ9Z{~Ha0>W~%i?zrKAMeZdZTGeF5g+Hx^i~$W66=%O%&*)P#STR(_m+#`7BD|BcgZhO z4=IBrb8Qtj6|XhdbVb^?8bMR6t*kz!SghKs8lj9=UQ;{NU#l0Z$7@P7_0>PChN$nU zXR3cw@#+WKVr?(oO5JhYblqR-0Nq_ZkGCv>b~-va*ASwVwn1*=6g+o zrm{ZBVAd_sR@Mnxr{*{HLUpnFq0*#am8+Dy6x9{amABM(O{iAT#A|u=SY;o@RJJ;^ zOllx~&V0r`V1MHRmES3@GQ6}zZ12;#SG&G;r@NYazVYqnzZWL)Lw#+%0j}@uuPX}5 zlgl}KD@VF>f=lmeW(^IU0uCLU8b_B zN)+7{GZYs%HTyGA};#fr?dy%-Bjf z`N={jkrUH}&xEVKqn=*w5Z7VHV#gN8*Dy}Q-FH1>ypz5Cy&F9$_bcZrC+`^INN{v= z-FF}KT=mxDm+*Uin|z~rHyYt?fPQ zx$k-EdEr^$t-Cd{516Inz_oWKJPCyxixZ@XjD%cM83l7nnlJt-B=C#)Bz~{ZS$an9 zGt1fM>@Vz3OfRxodL!z^sRAcvi9Mw-l1SPxgBc^Ufuu<7rJB;eVukor8bh9uKq#*v zvl8x^mPl^#vG`6L05?7(palY%$aG|i$Q3dMZh`-S`@;EF;4}(&Tf@klnjBJyuYOg*a<74&qsq?SRJwn?sfLS{f-fCkQ@H2MkRnbIAzkhn3P; zX^=EqS}7fcFB~SfiHQkhUP7A~QY4*_4nS|OA=}_i>Jj-GW^OkrOYA4k6!p??&;r7o zVpcL5<`A?=6z7Y-z$h!B4pWJasm0V`lHgYBh4i�tk`XNk^c^+CX0v5iitu7qs;; zVB>n}w4@=6NG^$B)XZ_HR}{G<76 zTdBU(Q2IprRjLIyZ_CILa+fRsX%r=VuMXT?_9nZ@4`e9Nt$7gZk_;qA+9oZBI**fj zLCKS)ucRta!g{#Xs{}mKUFfA>$sppCet`biE3OnDiILJ6=_<6NBgngiKx@*Z4N$@k zFzco3a6@gP9 z=?|#)uYgx4q)TwW`UXnkVOJCZIcq@KCa8BNkiskhsZ1)XnF{x{mw+1XfwA5XW0wG_EVLMVl!p=$;4b&3bW!>XX2%v7#jTL* z1dLn;w7~>;f|3j<2ha$5y9920kHgr`gBf-J#?K|i!7N7^v=&giOz8srd!e)x+IbId zn4@4cQ39bM{L=}y#J8ZH6d;oqarXa=ouA^z8Pqo;BUokXu}1VPmh5@d0<>o#)bndPlop0gLa>X zG#u3w|9$oY=*68-(^-J^-vI^t9kBNu)EV#TU2yxI138~cccH%L0M35+_j~9Qtsh@_ z$nzF@=@O)!g|T}9HFio$s1M2^2ZGDNm={Cc-$4(jKzYR=2P;9HmCy<=w5Y%z$HNSX zfqv=>Sl%BnG!n+85b*Cg)Y1jmUdb=D5(WRsfd1PL^JWFqdIMm=XxmM&);@d@Yr*La8*w8mhm7a&895t$^b7fwIUbvq2@jQ4YfieNX}QECOTqV<47~Sc!R14g+PqQ6dBXN2Nrl{2G-u zLuq3w(?ump@Sjv_oc;&pg{kxzQX~AKgb2!r@K7R^G3Wi?K^bx?&++k#0({v8^}^cY zXd+-flrArUI-`tvDfAXfdr--AS&D?_MQLm-&Es!}EI&g3T@3$6>FxqBMKGQymyRYE z{3!X2rDG118!3Pklo~w`A!32IZUDfN#b)d|4Iu2A1Le_am^-DU@Sk#0-JqXN&ZnFO$@_*2kftE-^X;3;f8Q?>m45~eW^*}&f z4Z1F49TC$I*XV4)S%bLtv30b)s9!ujV|^-0*<*na+Ds(BTC0v z1k6GThkzJKaS~|`VkOGRe$-SznnbA?rA{b4OQlz-+$ze=p=2s*CQzw5N`+DO6txUd z@=n&(Lzz6PSt(2JQJGO$GcLj}% zVa=QSTZHng*fOdQCQHN1x?faglS;kQUP7%d)bv8YUPY+w@9mnvfy)w_Re^^`%`CL3 zlrELyMd?f&MU?)fvcMQZZb;UfM6F7yZ%K7BQ7eV&Vj@;hpqiT~vx$akhoX!!m0td+ znTjbgW>LQ!BZuS_o=SdVZmJt2OM)VHQi)J3pMDFqU8%-v&L$^i!TQT1Mn{F(I2s>m2pvPzNI>~^96#EA{3rd6{5ARoITlO6@6c3QV_Gx01i8*w zGQ|Rl6Ev6HM%16cvBWewHkcygF4d$!oo`H+aT{}D>*P2Lf5dv4N^{6M$v76&kG5Qn zth-ES5Y8*4pg5-}U_8d695j`LmL>La2BJ0y8q7=QXt=)woS}5qQaVhvNl-pt);U3$ zYpRukK03>Be#^0#54Fe8AW)r5>ZkvsDRMeZ!F+OlO8b#|U>&fA*b1s$jXv5Ys+WL! ztB=$J`;}ro;-`!OIQEDgs2PVoS$BoXe9IaXs7HZ*E$l<6yfmDYpW~ysXc$*t>BCwq%YajUpT<(XNVJhJq=38{-gee+jul+~rWtmX`HjKh_KL zQkUA42c{f`+#=k~&>!8`(AHxQeC#9HPh%;k{NEmxx#y2uimXvdrSb{zC{*tTZ5&zD z%8~Vpbl|7@HmFsDdP;~3bZ>~d0f;$>HB&arv*dJza}Y%U;$!qgpP=^HBX3nd?Db zhicE$b)ND(bgidaF31NUPk@GM*il}FYUIg$3BCbCwMOLkRjB44zJ5Y=2Jw9leA5Kq zF2VC;`a%hPBZR&_LUkDjz_~9Pd|PA?z?WbKgZ(AgUja~i2%Iwyfiu~mV7`WvykTGu z_rnOVM*xiU!)UNakHl}>z&w)0L z`ENe_AO7>358t8XfBfobe>|>GX9P`c92(|9>@5QSTISg}#bIb#(Eq z9QuwDYB-^`6KXx-n@IRF5Bli~NSz49zz*OdMpA84>Zdr0npddPggQ@DqeJrcfQ}|LTh3i!}Hy4Z3ka2k7e?IQNkPAT^Ky=>*aa)Q-b94`hRDC$7g7FoY{7 zeG5Te-#_x-xSCS#0C@}KD3C`$jzs2JWDW#ZQRHlJEv38K&FrK#IsT}Hv%9`qO2*Xr|ou0|z`b_iC6k4XN<&J68kN={pyPPJwG!K?0 z`;0)<u=d#Ak2S_rT3gyO^kbdq8bb9nX$oCe zuw0q*kax+no^|0chW{)6VmRMfl0GHL6uCA9zW%Q9dL^4W4OY!$}HBZDED z7h`dpk&DI{%7@E*u*{WH-j-s8j3bl-Meb7G&wcdKR|YT#!6y%_p(493wHXy_S(Osnu*0fFja$|nPOUO;IWo&sPx=EoT7qj6MwllqYY z;t2%ilk?;EFb`e(DJ_)gB0W>Ua|HYnx|kQ+KwBjHKGI6cQ&6pY)T~DzQcdJO@Pq;B zCH5nwpxCz(9U;)Y2;Fc4xX(!GV1j-vyUXjuT zqy}`B;=IQj2CC_fr)HWDd@0o{{rJiZ?knh9B>&}eKk~se7CC1;yTg6Ke{Thl+eTiT za`t$xi$1)Op!%Mu+ll9acv6cews=ZRPm=NUmWJ^po4(kB=ZW}24W8rDGgxZV^K$vb zmYzHo!r3G}p~W+G^rMX@m-N&UPcCT)PjxYb=k|EUN%P~`t(=0Vy!7;!`s7niym_EN zW9S#K1o=*ao|MX`r1Xp!ze~R%pY>xdT333aj5eM!(-xtRwjX2VH*D~nA7kY+X{;H| zi8-*R@IC|YBugNr82S}^O+EpaZ#=LBd<%!(AC&lW75eQ`7$MZT#joH<;CMOwU&k<> z-s9Oi*02zAVCnQu2fs+i4gX!>&w+O%cso@BBV7UI;CCE=2Us`!rxQ%Bzy5fJUI1~~ z5QA;S`?oy*T`Qh{c;SxkBHW1{kgCJIb|5(hH-Sw7(~rT8UoG+$?!VW;ouVYIA$z6I zB#SgessVF_kTcRKa#)HK=Zd{yFXw|BeV^2V+y#ji7Vgk_<_wzxxvqm`iGkV2w&Z@} zRQa;<%zbE7AKpUi*bYbR`Fnk(w525ScE9_x>p z0xf0M{kG}0=E2smiQ%;)HI@5S4vU%@)wFWEnD$Y*LDvoYwTE@zC=19y!RS0%d?mj_ z?xUQkIs4OZCB(f+O8g>0myn#U9r{pOJ9fkIEye zpH=fUbBq>qp3!7_Wo~DE5l|e|!FJO&EUagA>)2&+5ml#DZB8LH!qvL+iYVR!2^YZXad|l+1%P(R>?w$CAwjz49i!Uy<_1%NEaCKK<)a%?Gyo zRUa&VnEmL`v+#s3-rmi)m&28ubKc^+lIL6-UA*ZB%RuYK0B^uLYqq)Ad;sO{jiH7? zhImsOOS)xH(AaQm^y-+&)f?AcQGauj@a8|)t{h!hX>4qh2u;Y4pexEWXYKOog-kY= zJuH37t4EKN560d-d8dE;s`$tE8r*O3K=~vj;g9sx-0CH>?D3w7(sX5C{cX!nLH`Ch z1NsE+3@osEK<595exE*3*HXJ#dmc2rvrHRoTf;-5>s6UlGpydvjVrhLxAmPm?_>X} zIx+66=%9%40eZHHGo^TYc9YEDj1~#sKOB5-&8;u4*S_BW#)g~uxBtGUeX#S{+2n4S z5A)ww2;Lu=(dt2l%2umwQt;2g?%=u6}E%WXlQb z5p^N9RjtkSZ#P-cw!HnjhUsySs!gswJNj(c?}2@}s`fd>hjXf>Ur8DDqUwF&PV~)- zSGnum{@wX+t=nn$mp{7yJT*D_eLxBCti+FHSL)1`zXH6riy?xorL8dNa=>`=zxsXZ zcibIjJ==s6*ig=`_(B(I{UanhYHZw&+RGbXY7yAJUbi#t7u4TWb7~z|)yh%RLj(2W zo$7+)?-#$jkeK+~dN2F>>nk_^ne)%uD|4^L|6BR)=MM%vo1C~Uy=j5kIYxY>Xr!BC zYGtisTNzp@?5mJPfnCf-W4$>-mtW!A|Y`R?f3O=<5khUASazvFyrhqSnF)< z%n*00r?TPRPf2Iyske!Dw?4@@O4`IX<9ZOgFJ5=h_?PynXEZwyXArvO8OcJty@RX1M!1vYknG zW9hbvN9EoUZE;0j-+~EwTMJT3>)3bL2NmBgYEgQ*c(YeSRtQgAW1aQN9)niV0&iz= z88L{5E9wfd(j^BkG_dZ~nkp9X$5l%Ng)TIpt?HRHOtC?=(Y#6Zt2*0uL%UIIs$|SH zjQRRnrrE|)rna_0z)AgmC9B%ZHsc2C9J*1eUCcq>1dmecqpnZ{2!q|@9D5yo_}|2f z-Xg~eyVqfMe(Cwu8{&Rw|Ej!o`Kr>kWm7zq}b%Z$Xrm88siw!fhHwlgw+!a*~?|0fB!Jli>y@kY~p2~coZXTe}&Sd); z@^lY`i>e*g+X3@*cQwC)Cdd$Ncf)Ms3f*aGw2$@anS+WkYnB|@!^!FX$+xoUL^Oaj% zvwg3W7R^cFGT)HhEZpSgXwE816t%fVien{>G(PL)0rA zue>v?+bvzayz;4Gr@MApMsR;qtSgBBlk^lPcvgx@>Mx|Wj$Xd`zA+w;&>nP&uJK;6 zOg!spUon*@WQXd$uTpu4bG_@X_o8%(EAl)o%VrOI_c_LhYuOm(7H^VN!2jv}mEEc4 zq)E&a_g~EDADu2Qp$ZWF{#a`7c#}%QfB2Y|r?dLxQ$<7krHNLm{ zqGO$Ng>SLYk^2?i=GZHxxI1}<_{x<&o>i6$%`3jNw{jj}q7~_`NnNbTpQI&X0`A&w@rCcbziqn*+e`{qV)+XMrY9;X11y> zkRsJJOIy_>O{Qj`euHtOwa|JiU{a9R@-0Zu&kamcpV4+wFIL?2jq=z)Iy|?WDUB>n z$X%Fi$SryA%3PcMBxAwbo>>)nT??P)UnuNU5>j^GzRS~2a7%g0`kIAY4trTSP{kSM zY11`dX`HH=x=-~twWqX#VWi%w*`pf`8Z*tzwL)s!+S-Dn^;KF|?pQgpiXlcFTe-@C z@W!@e+h>;H>YL1I?``Mgir4wc=_%>g(hW&-UpIU;@kOPV@vm3ERJ^#A*gy5})N5%W zxh;xrm$h^q@q8)GQ5CB?sb6U&U7-Fe&~MnPEz&jA)>S=GSJ&%w>vTi(Z?uDT&GnM5 zxA8zgpOAAAFQa!=`L=r7>Q$=ttfGml7B{C--LR)2H*9kZui3xE`5w;kwq#@0-|t4H zHBP?xviFOYFBiUO@GAe++ZXJc@o)LG+|0n-Sw(Hi>N_%hUr37;i#5wNS!zbRUe{ea zUN=Y2Y6qwXsU|4?RW?vhRF6{+(A3t}*G|y|njcx?Z3`l|S5B%DQEP9VS#j~P-&O4r z_eX5~Dnldc1avjkQ}aSKUp?o&(iwRJGrcLAgu{t--pqfI^Q_ggU!MK*Lh)-D zGJkx3Id4O$*)_rUfPA5xrPk}5uogczvPQlBqHc@!x!S6}qdc$tLb*Y4QgKNkszu#y zoup4Tg;*3J%1Yznn${j(uS2y*l@3>qsWLWJA9o3O?XuEbUE+GXv{wiRTR1lgZ?bD3Mp^O~)?hB~D#QLi)B zGA0<>=ufK4mAOin;uEDwWl-6ab5sj8yR?@LoV97-+hA=}QOuR9w`-egoQ~OBIXw1I z<<6BaNA9w5W{vg%`OMqFo9hTGuARN+-IXL=;>_3AU;OyO`r@CbSDyyH{4T+r;!OWN z>u%2GqW%?sx`G9c8>4b+PU;@(LJTFwI;MDIALB?vE1gdxsEgDWL06=udY-ze_O-4| zpJY)V=D)s%fD}J^Lv$pL{B971r@e zpV`~Y^UD2?JK43@HPAKRbX zqsSpRA@{=GL=Wds3qXeQH;{_`3#3{{fV9p+kYqdtd!+lYXGxIez}fvLaPmD3PNse% zx8RiiQ<5*Of?Ybku5?Q3MY5#J(jkyL{1w9O$!(Ci^nk=qchEUF1g8y~K}tV|SeZu5 zLy|!9$T^U@{tGllzJ-zo!k+3V$ZB4fT9ZA}Pf`rXb1nnf^@Gv?ke%)ad#`OEQ~wMk zOFNLUu+#4ZdIxJ@-v!z(lsV@;TIR6zGVo1Bv%E81vEOIA}!S z+x&|`a^6j5k)KI6=u>P0jfydFFf$J1*PDZm!G1^`%6!g%%rSW_{S4YFgUO#zgSlj~ z^eMOlrCsE{*bwwM0!dqGE$CT|hn;aRkm+744VS7(6JWFk!xv{jxVBUT__;}n1Bw2s zAmu#~_TfK}Po#mQ45Xu9!`oNiK&xX&1>m3-r03lvhB1-NOcadeZmB&3r^%o*(izUm z4iE=u3Y;KMq=tZn8{r&HfD@M2(pNACkNV4Q3O)1_^v^eBAMC{Mi?5~6Vb8x#I0N+< zE9qdoZoxi24tDp);2dB$jI;?};2H)J@9U(ifU7S^Z{~NBCx$>TaLi!o3HevN$aWF0 zk%J@~=Gb14?4M7b!OXb{(rn3~SI`6Md=N^4w>4n?{0p+jGvG9C5}Y~Q1u5wysVC^b zTopD7b6`Hrg|{BYNYllopa(J^Ubz^~8d(c@DGrx9N<-n5lTXB9(1$MZQ}GZp9{Ob% z*IKFo?e~SCw{QgXHV#RRNS^Q&vys2X@lpeFiL3{$s7=iGyoWK1iA-IwpA^rO^Re7_ z(rT_qJOOPl71xsp;Y;S6uS9j14`yzNIl?q@U1|qf(sw~?|1jwz)o15QH<@IqfVn1) z2fq6^;u6O)bKpc|im*YtAw(-{NKfG{jkZ#2W(sc-9|&hTI1S_$i*80Gs)U`)TA>a5 zsnlG`L};!pE)m^aez%9dgjIRbbx6)hM+=tJp#sX<~%Kpn=j`Sj8ptH`#i=a-j!F6FwI@k%_)!5-KcWRbp+W zl{Dcxi@ahU@B?j`F^onECs`y~Y|GYVa>-+M3A7~&G=erWmG~`8RhZKuVqdW?=>(c< z!OT~DIrEpWO3D@Xki)_tk}8}7`Fv3vD{T>W!8k9F8cRKemCPh&GSgks0v#}mJGnGr z5*xv!G75!{Tw)qZ-!V}=R_~)iCQ?t==kSkJ-p5G7q9TG5Igd-`9NtXpTl$z6=aCmo>@nV zSUczBYI2jfEvj|gbXB0Dk#YgBGJ_Ro)k~Br^$gVr^%PBS)hOjM&@t@{y29OouFZgc z%7J(6M)Pw#L*2ui7RQ(NL*==p;T0W9KCQ5pXO?a*`@v~+HuW|H^URwhq%sY~zFaS6 zf%+{sNwZP+z2-OlOT!EE0m}^QkAX=6X95cYmsr~b2AjSyt=Ime-KpNEG%9~mq{F*; zpL_rDq`0Oz7FC3o_b&UlsBU3e!Rh?BdE@dc<(1|h%^#gVps=8Ldr4ZwM8_J(zwT`B zP~n+)O(BwNs$6EdX1mU$o^PCPsAU;$=^OBSkir%dwkdQ#m@~A0@T9=a*8bKE^9tib z9nlO_c4tJv=R56f;ZChkl{G9*Ey&87pF1|&@qTdD{q)4N!|7p}!{3{7*u1&Zx!CC7$!KGuer6LWH8@Q#X2+Kw}7XCkmd>!<6P_G~j z9PWpQxx?N>jEmeDd$#I?2y4*uz)2xuVAY_zrj7c*)NqHw4D{ZP_11Kjg>d zUVYyneL~uccS3^UW$Ekaq_D)t$uTMRlvU|>vPyFv6yI`h;g!Mwa$PBD`J3)O10= zK(mYc8uSQnlQ5sx8CKD}MAKjr<_j8^F-Dd*lqCiF;5OcVSUM`2jB57Td(ojIe1DEyM1F zKdfYq_#wD{&~aOA;J1NO&7F)-^dt4-lt`RnAU6vewU>76pa%ehdvyS!Qj=c?{|A-!Z9tEy-g>kb<`o7))&n?eHL zTgxp^EcdLlt?dFztfqi}gP7nEK?#AgZGVLQ6WSqgrR5LHqJRsQrRE*RW~O|7k;bcR zqWM96Nm-p75Jvfm-GY5ydAE}Lg~55rnbk9%r8mepn^y34)Z6xH&a_AA@ma%jhZd|X z9#>+kIP31kHv~#FjGL^yt?sW`YPfF5F=iS+)ps$DH`g>(HuW)`H=Qx|GVQlKvly+4 zz@^r%)*@SF^E*>7(=l_bWsM=gJlfFNkOQYVO|^Hm7d7J)FF~KQhhXrvcK_sfS|$|l zF5q+fYuGENs2b_2Xzyt!siXBy-7-T1QzQLX=7EM1b4N=0X4t>1thW2Y+Htcdusv)4n@~gN)fHxUDN1U%Kek}c^kqPdiL^Npn*BK-)umR#!*6UDI6KQ++`FMxCv? zrM#wC$9=<227S;9jH6#&6pgB8@J;)ZZ zbJ=F>JcWyy!*%BtG2OXHMLqHZHy7TGNh05~+sRlq9{BJKCQ+Qt{34aX?V*`G2VOs2 zszRnp6POmjU$g?gKTCQF_ZFR`A#87995a^861%b6c@2{xnVFx(rNFIR6>Q8vSTz%Y z(@T{e0SEJtbOoMoD*2ij#IIHq2n(dGY^>Ob=|Nx*LgtCZ1hi7cVD1VZ$5sZe`nphy zJI&8!hyFj3z5=?5to?iL%*2y6O`AG(1Bxu}4#nNw-QC@Ff#S00;;^{1NO6jn(w4fV zno2yGnS1AZ-v4)c;Ow$J%Vaw8JU1;{L`@)*XgA<0i^1<&gerwi(n2nreS_CBi^Lc@7Z;A)Goy?ous<8H@@$g;bdLhl<1LmHZWU5uXc50$ToW$!ljR8!uSI3yi-QFR0iG z;SsZ5C=drCZ`d)8QJryD#SnhAconrm;9+C_@WD(Q+?bt1iKHP3Vs)gH3`I-8o%a{* z;P;_4Y-HBM6}bWC+Cp&dOX#^UsheQhjKEKrLR`QdWUi8A(o^DTFJboLcEq3BOYP?C zqU|^yrcpT+hGVFMB%Bx#Egr`f>M(l9eUWs+Z^=*guJbb6AIH)6s5c~^@)twsqvB9{ z0^UKN6m_s4y&(?j0L->>`kgq5KFG(*oG`1Iqz}1yk{ys2br<~*s+rZ)4f2NTEo;Ml zV_TA2Xco>TIcTc5kzRmn`FL^x{{SDkgwu)N$R4p8r!tpF7#c}waeqk+4n*$sRxXNO zNu8m0;{)h#oGEN&-cfn3@$52k1``?!U+Hv;7t*A9em^~!9YyZ5AvlX2D=6i2u&=Zn zZ6b&1_TpRFbut++%nP&$=5?AHAnq2_Xdw=uP7xg)%0EFeA)hR#u8=7(xllqNv!2Tp zKhQ^c9inlCutO3}j^I(^ExeUpB~B*o$QfZGY+B2?)+pMQPB!BHTz%N#EW8$y7M79^ zGH+VJc9k`f9#WOd8F!ug98G|3n1{+!<8ec^(w)}a)TGJo%DRdFqLHM~<+2VjyK3dt z5#WpK`S3B^ZsT-5UaxiWUW>hs zcs_K$q+X)TlRuFCLw>>9JLT>gQkW5uG_R>P}8861KPCdkkWoZ=e=!HV)w>8uFph$^c$n>F6f-?EP<8zSu=jD z`F!VNSrU1X^CB(5`7}Q<<@MBLl-eo1apviwi)K4^XV1yqw7q=%f-57p#I&kwtShNI zGbSy@D{4cKLjTk4hbm4oSomq0R-RNu@&{xU{63n}C?(+Mz+X)IrmXV3qT=Gp5UWXu zmhRUq@q8cfGd#M!w8_Jko7>TydUxp?*SOc_xSc&NbRXJuM^uMsbNDOY*V2D&%PQ|y zj4qaDXg@Z6^Za$gmm?A$CboZmKcVym_qNlQhUv@mCKX&N^|qg8$E%9mwtBS>d>J+? zW@NqI_2cS`btgt?BfdknQLZjbp<}DaX8Y2r+r@WsMrB22{7z~4RmAEX}FfG&XbM9;H>sK!tCtQEN_|>Q9-x7De>GV}d&(6D6m|Jqua*esK8somg zE5-jr$o;6l>Yb@yU2j~>n#dnv>QGxizV5fI1HA_ivG1!IXVB)J`7=E|A@x}bNeN4h z_?`FXaKYTN#HujMK)#LSz55#9(mK7u`qw+!MA7C&`z@Wub~)MoT3nZ&S9{g#G%mJ# zd98i<>iNr;mtT}6<|S2p8kBM_D<^MR5nVNh z$C9loopzdjPe6;X=F#ynH)3W+Z;31o8y9K`?C71Nn!|Pz7jxq*w<`ZBY?3oMdwpi7 zjKK7BX*V*oIl~JNmi<>n%+=g{W}bSF-sC?qBt7O$t&x^zQQg zuS>BnV|z#c@iVDb<3Pvy+QX$&va?fGeChP@uQwlGiAiyG4_X zi%V--yWWXEBpw=_XB)qSAV=8qh@+7S;g+ypp>u-!`nUF+sEL=)pqmSg9rJ2;SNv0A zE_zqct)PE?P`<4o+K^nnujaA!HdhZlmFBrwecA>$i=18WbfX*1?zL&zp>?OMwlkZI zY?Subz6K4#FZsCCBV|q$>N-_D%kWq3hm3l^9)558ZSUu^ANqXICv#sjQuh2dr+3PU zHzXU^nhlO6*pH5vNi=Ib4tka7W4)2jC!YyE+w}c)8{7wKnkmzycBU;=Ep+Gpb?~;^ zwrkdtmMn{xEzGgqHIzSt+fhMGq^wHm1$oe8JrX>>=s)<#e9nNN=B8)0Zl8O!`nW575!{B9sGo$WXwOY5`w?%wa&vo&a9)2~e!J@YeVW zxY_@H&jNh}0q46vXv&%bmhwO6do1XPd_lQT0nX~jfH!Ru7XotB1vdM-Vz3wlX%K#5 z9r!&8Hsc*aAQSLP4^_2f!h3!RI&(e)D)ZV@JWOe--}h1)Q_5F!%h=_4@xCj{c`< z`kyz!1n=wLpbYt6*1$n=IsB~yAitxPSWol^oInRhDTSlK#8ZrgZN39wVUxuL;y(C0 z{^y~81o-9uQVm{0HpF?*o?M1MKMDV*!|?Xs30UGxz|h75a?}aX+J*m@F!2G-uLzEO zDJc2+0FKxfKFM~GM%j>h+6%BL34LFf##M5gL=%4NBCt`1QXlD1)K~0E_6yZQW84wv z;`TUMST2sB*D+D_SD3WU1Nt@$armB)h=&UE9E%)Hxoa*@S1T7Suy_)`mir9JF?Ynd zkYz6ggyA6|D#em0x-S#UK4;n^+Hakkx>J zGzRPUQ4xu2@icUtu1{CtMq(lA&q$btG($~97wGl$MY%?H8lM)=FvaW!$sl&9c!K&# zu2Zd8J79;K@icr*xB_`4J%vF2FZgLUr^k~f)F{DQ7{gqJWKw~Yia*#=@il#f8ICHM zb@;Z}h57_Xviw)?nr~%-^Wt1OzE?z|8Od8xd@xXY_L5t{t zCUtLBU(09m%X-hYx$B8mLL!1SNjp7 z?w~r+kJzWoDbVmoizg|T)}sAr5*3RR2~X{$+n|9Ygv=FRkl&;=pjr(8m%Gis7CNAZ z2yj?3pL$Do1Qq^BK!n|y^W+fU67I3VxFyz8z3Ho{fGptK2nWP)$lGawBG5`W@XRm^zN;LPF4RQU_wSNtNh5L%H(=rmIwK2tpT2dD8q8@fJW=XoZ6lOpod?ANW3VhN;yn;K&PZa+KjD3i> zlmzk?JW-rT63B4DB_5;fLJlC0@pw747Jf3hWS4jkeijXBBYPOl!&SmPNG{qXRC6c! zS3+<4EY%yY#1z!5upvNvR8X zh&T$KsYArca2E|>&QN_xEBsn0qBhYCeG0__D6t7Ye5yl1rk4+CsBTQ+hWbyHiCDucpE!sq6~oF4Z27=5GsScnS3duF#Kk zEY(hE%r^jRdL#3T=?{14AmR{~@+sVS;fGjBb!SppmcD@hCPNSpc|f~?9ePgMiamrO z+!LWvyhE);zUYR?klBEQvh*?bi1fUyPg-!!g^oYtu=YTPoN%x}V(8;la7ErW+oV^@5c9-kDbA)}A(2vq! zyTAyA&b#~+e2ka6hB!_-h@;lt%#qDGi32^OpPeU@0QoTXn4s= z<7dkQ{yd~q-xjMN`HBcDT)tMd$*tyT`NLwbfH?qmp?E)a<;~Us7fTG`%xpw zIN^ZvqvHVAi=U1uMy2?qN>s;cbjm%DV?0`1gVLp6JkA6^sz0;k=T2w4-RkmJx7nR0 zHZ1p_D0^<&n|0^iu!Pl#Pv4A7K_!!&!xWc&)P7U+Lp(pJ7BX*Lab}MiSy@TJ+1#I* zm;WSYKF%3Y_@?}dxsU5H?4y0?PRvbFB}{O-Y=3OQkWoiSBFoE9s5%2Z6D%*K3-B#$ zqUtK1=+}fUZ&a^CtL`ar=X+^-kL=d9S&xv3szR$*cGGtYpCml2NH~`4mHoxES$fxV zaKOI-g}w`PDY9+krR_)cxpG5s|NPACsaeA^^D`UeE-ls>)66?u55*JACAJYWkZOqU zao3y@=KocoN|pjFIJNtUdyOq9H3 z?*QYwSr(~0<&J&Fh2=J^ZWYq`M32^S!@Fm6I@r8t#8d4qer?IbAMwvq9(de)`8fIA zo{V8tz0h0jRR3*3D+4!s7i%Q+G^f6{S9xXe>iow!%d$sjpUJ7nyHOle8EAHMWrzc% zhZIAU>lELm3idFi!w31E{3*T-Zb-ILQ|S)OP4+qSiv1wDAhF4MD&D!3dTIP|gszdi zm4C;8?jO4i=`^L?WoAEcfb1o-L=>;~a{hdA4 z^;CF6#Y;=o`5tBZQ31_^9)?bgve%v3D6E;-qHfEZt?##JTt7VMow}FZk(Zgg`bp%y zZFkl_*!4E@_n^`U*9Pe&w*y`S^*uc09`!Yil&P|ptUEf3&pYQ>%Bxb#{x-BJ8e8Nj zK2=s!Ro85?PvG-OA9My1%H@y(-;lmYPls&pMEWtkAM(}~p)rV|r!X~atUO=IsW-SU z(AD#@c@GWvD>yh(sN1lC>aUU}4V&dQ*;%(J_<;8!=|HQkq(kPOpMQT_{`t?BkH4N| z?9Du#`?9dqaKC)L(Z_6X9u()ZN90q~61Vl52C7Yp-Llit0JbN}LK12qU*))Db<~_T zzN@g6eJ>wYNms3?*=V|H`DSb2P`gG6XT>afxNMm6w|c)jr(LTJ)23PkJ2>C=5L1zro<9LhwLnX3W8|r_B#Dc@BhKKLgIL_d zw6x}7O=`{FnhCYtOa-+cYulJ7Shv~-az4OzzLQ}2ZRKk9YBzuPC+=N6&H|fqLGSCM z@vZb56DX~7GU#B)gwX9F+d>wGoeZw_`&)1H&?=sZBV4DgJ!=|PW|eg=Jz3J!u(Pl{ zU&xQougxcJZK-by|~9xML@nUsFgjgozA7}JZ+K=)xMGQk${2Oq$Va4z4959d?4)!bw5 z8<)@dLbl{#{v`i|zr)Azb@>Wz4j{^pUA^Fqw!j(WOmOUTd~wuq-gP!`6}VP%GJZaM zXQXghh`=8pvE4+v!M5=Mc9EN)VmJqBXwSh_Q6HSEt3lI|02+`#zu|Hh@+2Vi=(Bp);ZVJfGgzU_-Fh)!5}omXK@=cj0BND@*B6sCBgfy259QKukpCy8KT$uY=t~@ zo!=+lG5%|PPw2M0Yc-5CQCuoSIC9K0O!g|Digo3sWd(+iVy)q6iLxxIJie;E+25{l zbr4>VNZ_9plGBop@WoiSd2a zz*>tX$`K2h?GLDAwpgB`igh30`OCYnU%!BV>d+xQL#?5G!s*D&sAaHci*k( zU~85GnMRf` z9WPZ%{Mn66OWG+m#T_BDf3CT(N?tjte0bTqvY3kXmGi3R)h3uZ%K&?Y^EBMkOT;*u zk+hNfs2rLK?GxQ1ug%^?KA(KI`1cK%9oQ|neP~(Of04d1^P}HH@2N{iX9VT@O!Vk0 zd&{pkcdG1Y=$oIHotNdGm7ZCU)ij&V9+Nw-U|ms%(x=A1&3&D#aRQ=1O{Z4$R`>(A z{Yz4h{f2&sD@bc#(0e#?tiI;1HJgktEACZXuQ&qMo<6m=&2hHb&S1Vi9t^pz4d{2w zcF99oSLMIzN$yD=MVT+cg!W%x2lQ~b?jn*aRGc|jvv_@ye^olMtNIohyW=2eKOh9D+pc~$U z+`O0)hi8qwBn93imonRC{>iM#uA7&TKcetXaXRpgTPhFN=&WO%L-8WIp>&zNt@5UF zoI)p?!FE9g{DfQS^mk-iY0DO~-PEM^OZEQhXH_GN(~VoJlB>tmc7we35Z5n0T1-PZ z%qqz!StCfgk5^sRYy;)NXI&@#Rqy4#UHzK{EDc-`bSb!Z=)mwZ5lg6n}J&34_Yvo^D|Fn=?RFm0>FH5oPOHG^vhm?%p(o58{I z^T~O1oSi27rI@X{s6MA@$lr~cK{QJ1EK@%0fB*M0*?je z2F|LJQD9B&)x+`%V8W5IjS<_!`tsCm9}-Xw9{H+IKsqxJL0Kfz3p874uwjT-HsoO!-x%(9muw_s-hg9tK@&uX*|&-ddkn z-$1{Oew+Q`{WShZ{Cfl(3Xlgb4;)vgy3Ufoo4z%W`TtmTUecXv#9y@=&2wsZRO_lz zD)TB9l#eQ_Q))E$7?u>fibfW;rZ!h0G-z|PR|IYr?{P+5Q_4f_f8DI-QfiZ#g0`CP3^w0Ns;&sa- z!mUzqO7a3(@L$}&_FWMl4TtuR^aG`aSx)dZG{a z&eWgRFV_d@dwD(goa1>yx4@&;y}8?d^+V+{xmA+FEJk0*d_m4#aqPDZv2-#us~K5! zrZT3&TE>>iN_&*3OR5Y;Lu|?Mk}0J}%ks)QR^BnLtKL)F!TiT^&9>B$?+oTT@r?wB za2^Mf4dh=^M4ExJvk4g6CslH24ecZR{F_7*g~!H(`QZH#iXceHbCa7=O@aBg)*xMbW_ZUtY;j}|J0 zEs%sh5z>+$kbL3~81rc0(5s-Wa2V)bOT}%FLtPCju?o+n=-UH`e ziyni*a}?nGVW2&&2k7Kl;Fyyk0e3#|02{?J=n$I@$n#CW^8vC4b)*t>t_JZJ=|_CY zVc^W4i z&qdqBSCG=(2GXeukSCy#GpSEx30X?dWxT}@bWCi9RP-`*22j5Qz-{|dEtv_l8I;Am zn8<9BP7@QU9(*U)685q50p-gl<9KE_C>wvWZSBF$rl@E^fyxW-jmnLNMqpPNPjIUDzv(#K!@7H3PG8O}quO@^`T< zSp?UvNH&QEJez7r52O1DH~44UxH`f*YAd}MuN0E-VZge7h!KDw{sRfwEvSKj z4eN*&?V)zy$)pF~hib_=EP(qp1Lo4}NJduUwx9^#BkmVcA=^D&NCHl!k~9LQ--lTE zP4rTBr8pG&yj~KXokDlRqwzBo1F7+6An$)Gl?AxrHmV5!q%#S_LRKs^7i3dQK)d>o z*+%klHztOS1I6f4YKG*9;3=#}-i(iU51&OJQ4PtWHi*Yi6b+h6Y!I(88B_*-1Sz}4 zbSCv06747A9ZUq<72m;sC^H=+EF`y>E5JRiC9hpArCyR-d;pldis&3>BH8B(6O$wt z8BCsnZe%;-iLT=~IJWMvp9P{EQ0wSuAL=gXYPvw9?^ohZY5|GQ70bb)GM;VEXh;&j z8cAjQ(OFjqF@n+3cc@nU4)G)N0u}N9;mfp+ZbPj6Ea->(gm;0GxdrIg7SJ@elB{PU z>7Ha99w~03%g8GHOY8@n+EFqIH-+=D8W3(L>POb%i#Pxm(N^T*)%Xfo3P{2eJPa38 zcR-t3Ch)*OOc!~)7|mn>5yfsaC7mD)hI4lY?jSefi8nD()EHpgvVdoRv=@>o4rQjG z1^iR;lsST?fKp;Cuy=YokouPxaW}{?-vz4qmeddOi};}=F<7XjnxVmvneTx-Ni}AH zM`(cp!~rA*%>?aHU2&(dl^)3~g=?fg+CYB*W&Sd>mHH%}qi&%)^li#TK0`LV29!(C zkt5zGf5gXZ1bqY4Ky{h3^e0j)_C&)_4lN_0VqbPU%?kslt;~3;r8t#5qBbygqJZv! z4Ah8}6AIO(?%)c1O?*iuiVJa+7(tgp&w*5Iie7+Pc@LTmYN!p+%{P&bqvwH+SI3D67j34NtD(?{8js05nr%Gsl! z?;Ze0Hy*75p0_#b56+4ULgTkud z6fAtLP$Fpa>!xTaPm+&R_{)DtgQXp%eI;&^g>)tKO9WD8a-5$EsE7wQ)8XToZku4` zEN#q!$!NM%TU=tJ>wy`IFzExnDyyWDm>b@}+>- z>{dT_d#wr5o#bHssh!Il&9qXN?N0v zBu;FOk2!7DV)HK3!kVzE=@pKW1tq~HuHu=+Q;TW~dltPg1eCTf3onbPuvaxOpD};8 z+_#V9Q}GYb*H;0X`Uo0%jwz+8E}8}IJGBe7M2kIcdCu}OdR6M*dtdQR^`7L%`AyPy z)veRJ`4)SnxD`R`PLf--YO$mkc&<}u75U4X;WxF@>CV7wrfh=mVn1z?h&dB z*KO0i@Lb^a)oZ%fDE(*s7~kXG29Lhb?7U2mJ?^T(E3P`EUazc@2rzeGP~mUkd>mz# z`=UnajT(<%BYJmuNa9C;( zA_QMyMcCWfciETQo7mep!(5@R0nXJ<6<-DYmc@K8cxLC| zJ)|3TggPqzf{Ere-Hi62yVEo1V@z9S9Ia$V!rR-6o=cyk3*f(W0{_k=`Z9e0>A@+o zh<-{x2QSSO>IiVdX}}ae1pmN!@GWGB2S8)G6=ps)_;p55ndCO!PI|x`^$_0?9+8jY zWpYZm4U^0)u@ZN|EO6OY5(UH6ckA>YN44wfa@H6sBGy;R#1a<)z{7NCW z$Pt)MZ;(HvD=0*6ffKhDyel^7tseqj5l?ynOt217LzkdJG!xZFt3cUONnb)$Xd9fj z=X6gxnEp=RXL`V!A|Jh@4bW^;LK&eYt~1&QSv}F9Svez0U?cLTUXety<$v=XX$j7l zxiHxtf+p5^z}fD^3t@Je1l=B!2oFaYD{9Fzk^(&LPrOCkh6M2|bm2gjA-x+_fJbcx zyzw~d2D%EawhC|{>6mlyj$TgvOA|UC7|9{@A^H#G+l{8?GHwhd_7iL9y{H`KW`Xj9 zKB0J$f@h;X^iPr^$iy9J2gG6C#AnG))PdshQfvmLz+y24=Rg{Xr}zbXla`_$uGfv& z0QyM}a8(766_kQ07E^HuHJ2U@PBh@TL5mOtQ-2=lDo@dgpuuU%Oom?3|8=@lpjwnK zZi3F}GfWs`!7s@#>KZ*5S_E0KHM15y=U-zxU!Cs2LZ z$ku~$2GquA1c{~QLwD;=>>+-o-I++SE|H=8@E)%gc3_&_PyZG!;lGfDs>B0vBrvHZ zf(#dv-)M+fER+cq;wm(Z{~Mesm82gq^?Tqgl?F)serg3(i(BC%u&b;lh1e4`7ng-N zTtZJq1^BmM$3eiTK${XtMZ3X)^Axlgcj;=%D(=DV)NNFsaCjhSDppgCgy%wY*q9y( z&4pOh3ADd01RZr2eFsfb7U-M;;OG56zt~Uc`ke)us6^;%dnmf#{a-_hfFmCPIwXJC zi3Wf_thx9Ou94-a7PLH<#K!bnssU*Oy7F7pG3XbTp}MFQwI9cUn`#yHUKmFH1zmSv zI5TdbvI-Rx&@wntoGFaP&BP>_r+x~<$v4nUJtUuqlbQ+lZ8Q~(X2C{12RQHNG%IST zrnG{Qpx)3w)fuj~HJ}C;z3|<`3La9NoaSOIjf6yu4 zhbE<#a0Z{CMbrtBBQ69jQEzBGdIEF(4A5OQ0f*)kat@}$Db!t(L$XjgOlob#d(egm zsxD-t4x@eWBsoS;W}eYU=(f=O7Rv;K|EQd*2YYipaW70u8L&ytC;mba?ke8JQ}~&J zSqOmsv+I01_HjLS(n2RZK+wDHyEbDzLHs3dA^s(-2X>+z*-Gl+Fscu9B@IMy4bp>| z9Ofe171A-P0MQSTO_r^ZT4kl6!0!lQwhiS?T1N$TLSb)MKyvA+1$A z+P$~>fnuy;oqU0G3X>$R7aH&voP{>2<$O(|@mEDjdCRg+hPFjFi{cE84fl)R70XKp zR@^o!s)K4P%r*9KPAV)WKdGfmmgKrjt%y-RRbEzwtH*(lNBjm^D6*WGKO*BAY9 zpLf191K6PLLGS(B`FQ$$4&3i2^X%*%=|4k+A}yEXTE z&h5-G=_%)qcAH{~eu*~H2E*YK~ z9WS0(wxXuK?WS|0aE5BczLfc@o@kOZY3hgSR82FDMDQfr{Caf|>(Qtd?Q}uR4IHTN!1?KW$Iq)zUeOOTDh-RHkRhlFG270$kD=j)|_W5Fuk+9wf%GrA~V@Lko}YG ze7Z79+VU+MG%T-YuRkL4xX*I;6_QhYw)sTm=YlabzCy}bR;?V z)2rmnZ}!wfSy2VuOUsNmtVe~ej6$Ju+u?D>^Rd@#?-M?Aymq^vQ)S4XOPtgQZo74V z?VRd`#vT=Y%9G1CR9>w9$7XRa9QjKt$9g(h%yboXE3gR#F#at`lHlBpz1^n14GG6vgaaonG>7-ra@j-XX^N8n0uRi*Aem?`5 z;07TRg6%<{f}4lD48}p_b%N>~^gAk@QM0wEP3~-Pu2ugrWh7-!C{h~t*}dru&1R24 z_qG~AaaEc|yYU~*iz_D;56{1wx3sW##gm%7=1Yzup#{1QExq4mwX(_5o3vi|$JX02 z)-u>U7h>M>Ecy0GS1Cu68Y+)|M!$mhQd>F>_*p$WTFNRWDZN!4H5QN4-u?Ys2ABf7 zh6O~ni##9xHe44mD581T*^phnf9N*Gu>5yvZ+_*ZQGX6)sq=%&ZdpRf9OWjjd*H#` z@7_U<7?;r3dbLt#IFvsocW++3;!VbN7L6-d97Rhdf-F-mKnLa=B*#WaggK~oU~N0o zNb`8hOdDV+f?XU(uVn@@uR$}n1D6S7gwH|luc;kyk!xp2UqHi z{c6rzZrF3cvzJHepbThIJ_-$sl(>Sw?0oO^aKCLnEW+L?uLbi`g1AIqXAV3stPq<4@o3`;(>Lf2TLhyi3bCCH#r&6qge$#xW#V1x^te>eGd4~4z3%ypsrtiA@)-2?-*-vFa1nKgefZ{@C)}r z`T0)T?_6d1Fnb~TuFmtE>GRhAwf8*Lbg_$hN$EKNsH}fRXWuB;Sw7tq#2HzM=8MNE zNR(44CrRd$3-+Yiq{_8r_e!^v?yFc?d)?t6QH&ZkwocMyx&@^Y8aOZ8c9^SbcbEoR za~yMVe>zfnNgk+}pinBGC@-i+soSVdD{B;bRk~)0_JLRS zhujB7IHc`J5U*r=AYt!$B*|F{OSb!6VNzN=5t?jmtBcInB}>RfA0NN zo&C1tr16S%8a~1tkfq2wsm8et&?qIxU8&W{rBQ~@#YKiMr4K5<)GV~zb@U?NB&$H3 zv|ckpHk$g6v)fCoQ>?!%jOBanqUy@(Tc#_vYg~%>nC9u$Xf@WmKG;6lZUMt_)y`W2 zEeW`CQhmQcaio+85;yOI?{_$_OfaUuLYSwztMGDawwh`{|NA zB&xOI-f&;Jwor-N%Xtz)6s7@@P+LI2l*v?1j&cd zLDtR%U(>wO+3c9Y-X&|RGVBK2l9?krt}1c6p>8h?70)_$*50YGlq4AP4L-mnTPve# zH#zPS7rRu6)UA{WveE20Di81G`q|H$2UpuGFITp!x>!5R+QvBuba%T1e=;8S-Q8G5 z>hRZ`Pwd&&f9%m*D&9j~1CFZ=yBdM9`#h2$_i?({V*OO_ zQQr6TOFe&TEt-4k->UZVS(2+Lj4a`6T@uF)^DD?7_*C|~ET?Qu`J2l2Rc)(gR{yE> zF*k*M=8?nA)r3poKD!3-n3oA%0R^!L#r$r52-lT+0e#K9-)oZ;Yyt+>}~ANtsN|XS=`Lm%*C~SD)7bXe${1@RSp8^c{c3j9$6Lxb>?y9Rle}&u1 zQ9?TZ9sdiwhz|5=y_f<}%pX#C(ZSRm$dEJOt0JntssQC1Wqn4RO_Xy>z*|ZaUMrW6mVk0`3HN8;V2z;}39O1Q#A7%*W@1 zm%xggA%p2;TqTY{J;c5=bgfDP&~wQNiNMU0Ze{vQtJwE!2kCuj7iNOAF}Tlfzp zYGB=D73eJ+E}6?_vFX5gWwQ*kn0mvW1`p7E<{c!>BdOuIp*Rcg5{!5m z^xifFwOuGV@V}fAaT?PB(1#n;I@%XiiWmieF7YsJrIlnC(-MVI-Ixg|m^}-K(I`5I z>cf5nk4j5mO0NMIvI=6rNn^4R#o=MV zJL-ON)ZWR&- zYS5Pyk~W~G#25IZx{&sh z4!r0PNVZDH(U2e097O>4{*F8%b3{9}1N`*MsVO43T<~F%OO=r=bQfrN-AQ^Ct2-c+^IU zcH#$anJ96k=tf@=ApeB?jeH=(YAYH55s1lftVgKLXumj@B%xizLH8ids622IEujC! zGf-1%DWpCDW=zTHJV+E+2WMarYC&}1pgBQJAz$J9KcWmkz7E1w&c2dnS_`W*=Z2CxV8Im22`Y5|izDs~69s~ZJq9o?CX2cO9c+>!1G z$nkt}3-uYW(EX6Iz<{%H95oN^CC~{;eFy$34bPyG`97>SnIc9*U-&3EsxY!2a+$}V zJV+OapvIGSR26t?j#5p<8b~vUhlcF+_yoNXG!b^XF%D&`uo{@x!`R96BJ~j`3}E&W zFBAuf2}?;kbQ@Z_>%h!g3E1E{T){LGqLC=J!IR-ydjy=*QE=^b0O#2Y){M`f;rJh_ zE}4O%@Nep-5Cp8@Ku8)ohn9dhy$AG^=ix!(BV-l!(i9}DC5kfv7ajqQkZ_VB)@3#T z(|!k%uKF85;g#hM<8*+`T7b!t&Y?X(3-cRM~XIjKUpc31G=~h@ca~T%>}?! zeHiWH_n>5P2w5$TXV#HODu;Xn??gD{H!K3DU~k$&?qUymlW-b3#AWCQzm1U+iiQL# zY6oft=cXy-y!l`wRpW|eXOa#CgX`_PP{fG%C-WS4NBgLE`~xOg=z@yKF|-x67ltwi zNIc4dbA1vf>t3iMNk@113Yro$j1#M1-sPB5e2=yXzt9x|SS{d%8k7T?mW4zGUbRb* z0Cx}0a5Cts2SN+^SWr|f6>gDB)F{AekE89BH+@F<1y6@3I0bS5e!%l!6SWFZXy|+= z>rp+*PLi<^XMsO-2=XT0;FMa8-&0RP&yq)P632;kfXm(oo~}%>KeZnzP#?0CIYek? z1p1GE$Lh&BrVn^%k|-aZqPL&`k_OohX><>~gkDE2K(ClRX0_QSUluPgY;Hc-i=p@d8 zu9nE05&T$CnZF?0!K-@^ZAabF4cdib7!8fsT{O#VWW)^cBDQF+iouna* zmIDSH#K>7Y<15LK2ojf6kX-~us$6zVwp;dIwpji_z8|tuBILocGm>ZQOlBi+74O7S zZ01LEGa!{@fIZ&kYnuYR-*L-AOIz6H3oKKuQrkFNbNhGuc!wG|us+;f{){jb2Z5^N zE!^v$s0rvXNB?;*$VTIW4&1h4?Lw0_+%`%tQ^D zSRFyt?gV|*D$qZ@f(*U}Xf+&r13DEPLg$%gY%*w#{H0ma1lde^8^vM8PQ_})1;sZ- z2_T+fN|T}+%nLhY$E4>ax7mlxQDAoZgH|XXCa6xrL0-on7cl_~isI z5DUj%2AXk+tG{cBYoF_mE6=6nI&piscidq97GJ|p7LtXg_zKRzy~uGwK~CNWu?M_i zSrmyj0)sP@J_A?SQznwV$u@xb*blO3n#q32rpq-7q>w2}V+r}J{58|3R3JNy^ zOd}aK}-SDiM`6UmzEmZUhY55;8*w0NrzueW!h~U2Qkn5^dSmgVsuGx~;%b0W}h?IF?yQcSqwubuttbbr10a;V`$~X|#W|-L>_x&9WJ6`)yNfy{vnz zHam8{;sS(8;FA4H)`&~dL1w)qTXI0+FS*GM2d94wc)ET;!fXztu#J_@mN!-|*L-*H zqx<2-d;jrQ2AvJDh9yUwjC>o>A|kC$eYbqce&o-&Str(XuAE(B$XlN7{d-Ktr`+tq z#fEnkb!y(!jh&IX4(p^|5-Ykf7I62 z?5nA&9bj2)S8%6s3RO(k>DG#yiUTx7($fFGpq?(6FMuRZuFEYwUSyUH>rN7=7N+eHB+nYj-O%L6u54kT#}u)@@JRq zg0Jnr_WtzhWBcsuMYVkU#aHM&dYYz}u8IDIDLr&bC13Cr%{F|mNVA7Msg4|**|xg$ zdBL=TJ;f&~?m7;+O-v2g#-Brz$#_+^wpiO;Q?BStdePp}T5dah&C8u(mZ7D)ixW%A zO0kNe4xj70r_}#1Z$)2IY0A55leUh=q8y}nPT!?IlH-WF*c&7sTaAZPX6141OJjM^ z#V|Z_Y)o*%g5>MfJJrmrnNYJ`^#fHmRH+;}j{MtZE}5IRC+EtyqR)|E{`orbOaJe~ z^557a#rfC}>V_s)f8Maxm}6QJq%v!@H2Fz%Fh<{X=T&=8dtKX^^08&FEhp?pJO}-+ zn43Ze`8YBY3nH$PGpJ$kj%|~3#aaTwp71Auy`#wW-I3~4y0*B_c(3?3u@{6<(g&nF zeu3;j%XAaChrd+(p=;Cg===0tc;|M~ML>04qZy;CZ@6k2A3P|uexwm+U(Y)0ls}_q|`dEqsst3P#CRu&4OjLUpMo@Ky(*8?kiYA8#a2P_5}xbOXf& zyExk_*ZDN7EZ-gP56=}(H@FY?_tp2G4iFqnHn}xIU3mpM9`oS`$$|7h#T~^0)kMu2ZJBnF zE?%FhKdRrW7xdQ+TaDd~gN$E|nWoz2N2XV%iRM>kqxpx)V`!&csal~7Ru+?Uu$e${ zC>PtX)%-_&pM837nd7l7-KMlHvotP0VM(*zuohQLvEH*aa$az~b;m&CV+(ZRmh*+8 zMecwe#E#<_5l?I-9uw8bt>j&@4!Mfhho8hG^aEN8I0re94H_a01QF6$b_kmtXyCW{ zTKL2L*S#40#G;w`%;&%*XyZ&2c0qdQiM$lO5C6|TL>_q(2K1O6rB z3FJeMB^Epnvm6!np0*1W4xsQEY&WfAt)ey9all#R(s~|v$M}7LcI;#Bgs@No`x)8= z-jloFRp4toP7EL)kSk%6e;iMTEki5(4LoW51nx|hSO>1l?a<=w!|q{BK*L@ZXc|}) zxEOE+S~2yQChT&qDkxdYgicarxgOFL{fccT){}jx6nYO(z~fZC)H5_?nje}@+E3aY zy0yB^x>$Wf{ZRc?-8bC;{Q`ZM{-my{-lkix(E+pGpt+)21#_aE^ncVo$l!E>G|?~N zHk0UE=V{_z?qqBcR*xmD;<9B$`G~Sw<((?7TARZ3Ey6X?d%<7MWODb#LYUH&5dyi2 z9sstTWL2zc4V-|J6g{bALW1Y}ZPHDCAWH`}_}rc&?g$s^>g6hR6}Vcs_j&TX!vYH# zn#X}ZQ4O+N&A~?Uiu^^jr&lYo=?Ka~Y=PG0H~e3i$ZUp${{`eLXUzS$Uh&$5J&CIm+a%;vc@Wz=rfI~8uuJ;q#9eMYJIZIboiE(*JL2bq z?=Q1wf6E5L(6{f=KmX(w{;6Iv!WQYq{q4E=NDE3(pVY56mYY`xdqYMA=bBrZt{IMK z*D0S6Q{*}P(mt+I1^St(_CRx2uHBb4As!J?KZ%Me2$%e3p1GD@meS`f2p?n+vDyR1 zJ;BE+9g6xE+p!9jusP9}WUiW*6jgOe!i2ck=#Q00hfOhm)L8K;0gv+;q$uYVzRex* zBQ<;C*X>^w-%e%s$l-q9EErRam49>e49pa^Akm~#xn5glIAx9x{uQi-dHpg|m_Al> zRymrQiq;dl2Wog8JF=}@`TElM5?fJzk*@e`N%Qjl)^fYa-P_-ipDC|}w&NG7T(MA_ zWcZ@HqaLU_q1vx#M()PWB2UG!{8vUB=;N#B%km}ppZVy(WcE5R6Z_#E>1*oq`skpc zVNW93Mo*2K7e6yWlh``xLDG%HS_xg_1F?&umW5vn%?WyBP-=b>^_czkXv?1R^@VMJ zXZ~pN!~YHcPJO?g!~Sv?&M(_l(bZnyUd1#Q8>4@dLsVC^2lY!0^$e2@8DL)OrJthK z(Oz6eW{I8Ij^0kLFZKxAdrNs)n^K{~S-PP-sN#ZcnQNCfJ}{J943xmf!Dtv97o*)&P%j>02r$q{VjY&-d5g8o<5#<-;02oJ;V2qR-wbmzm&bTj6oCp zZ&+HSB6@Yqq}Z`>^{Z5mZxfGI`5v1Y(>wY?Mr-lEO?6oNE9bGPOE4GK2jNTtfDDpNx7{Sy{PWjmOjlL=154vFu4G+l_wwutNGf~&2?XhH04Nk*zcpADLB7}X3 zm>iW66BJjg%9S`Q?s#-r<&~9so42Vak3DbDv+e|hUNyzF>cdkbq_={({c5J=%1`~fjsnhdGBA5yVg8=Zu6gqD7+sHyr} z^-LM8s76&KT4Mbnp%;TV&`!|tJPhuoNrsQWhfEFH7E~6L9-I`iEp%C>;gLt9?!?5# zEsVPr`!RA)$RJ%E`lNW!`=7O0Y16{-dF6ky{?yKEm>*t{pWi>PS>Eux=zK?hSg~AQ z)mc3-R2oH2P%k$Wo0kSt!86UXj8*jOHA>Ya#VGo3%1?}gc1x@@juU*tT<@%7%X3Sl zVoUL%(%BY+{f*1&{S+u-v-nrSB9RA%S0R!Exr=)=Jhy0av`ckm+6S6YbuDE$oeo+2 z736Sgv|_EQhjxyBjgdFyn->RV1kDQm6Wld)K-lzfG}2mG8KsQu6}Alse``rmNcD}f zhn34knFWdYeBRsqnFTcpHo|)noqsX!Pu~85jN&*5xNh=y7Yp#3DpFs?w95R_tTj(I zPSmGrx2ju!?*ms%pq3Dy&9l z`F#t6OVIM8);`YK-fB!60aC`0Elj4<6egI2Wy3ST5qJ{&O#h+IkUt@#q6b$|eYU_q z)EDnP;JM=&?A_q|;tysPvXvkSI|lk`g9w(&RNm6e((}fqK_fzDg!K)NjZCY&Aj%VU zJ32B(jtZ|lB)oR0GU%#dhbBwWg*=P?C+=nUc^5k;T2GcgDQQ&vx^P8dY~k&Ksrm2o zD(9al*j#k8q)Yj2>siMd_W*ASWYB%w4l!4Lg}%U9Vi;*5-ryc^7-pi2Q5||4`TvCW z0d!4T3VZq6{7fNFbjiQa>Cod_My7!2w06KYR#~0hQ7duqJN8e7q2bpR{EiI zB5<8cD=1q>M?d#`?a!>vKMKGy1@?<)fN6DyJIL+^_H=#u1};J`juRS-U!c4566-)5kl@)|>?eHXn(!;& zHKir50ar|c4#p*FAU+g%i1nd)m0g>ss0UN1GbEuZP!3U7Xj|*LXar&tPz>$JFf@mL zrC6<;NUfBg3rGF?0~un3d{U?(?v$2cE%VO+mx_D_ z{`O|*liR7kMGLkNI&o)&>49$YCh|LSUs{K@kyC^x(n0hiNkEUTjSSvQJ_X)4j$yyB z;o@VMY$gDWYcDEbJK6Ptu_#LEu>@ej^$<3SpQSuGSW4uc%k9Y~VoBhpT!^QMpZpJn z1#%r?0hxg>#HS0Jfz&d9ZG^8>m#SVNKI|1y-`3vW4y{lQrH&AY@&`MUohkCdA;tt( zadUhT-aU}$+lSmB8p?6#KK)X@hxeYi1F26`mBtWSsuMQR^F!!K{41_S!qnraR984V zP+kQ6i$OR=_Y`~i!-VPrjS#B#_(D;v4ssVVh?yzOQbdZa{7FQajuDjh)|jX~fDH^h#Z=S*=#Y*P$EsIg#o}j9 ziSEM5KyB2CUnLK@&M21?dgl@ScQ062#6xH-d4x-q3`m+Hj2$Ik#v=GK1dJ?-efV#0 znQT!d@yUU~xLtKwIwfY)r{oOw4RQv3#C$_vYqz3F{$!~Z@=Anoqb2Z?n@DQfdo zl|99D-T|G?@kkEaK@oz*@ju|_kP7*qdy1X>GPV$_kiM}is6Y5h>8dadE0Mawu7{UX z@WW1tdP$H(bK#>u7;TNuCpUAm$rK)yTvRH56a9*32`%`8K=!-`AucRX=15jvQE1#4 zjTvr|cH3&lpU^8@C~||UP3VzR_J>#u`B|DyB@j#ebD(8+T;}-0ausEQcmmaMTZoB) z!Ia(K9^0hb5SYiR6vGwm{ksvh@;nMyDA|c-$RyE<&%?5XW&CZu&Xo#JU4MuM3cNg> zyiC@?mNHxLb}ARU)ptO+W%!qPXqiIxH+a~m?r6xKaB@#YsqhX_b9pk#ETePOWAXmn zzCbSOC+EuRgi~aH>5(s&Y_8ZKC&4~`IF`?D!dokpawYEuwNltEzL!LzE53sFNkvF~ z<#}^}f0 z)f7!1IYRs-rmCNdb1aLMtF(IYm*)jP&3qYo?A_{rYt9nxI8v3(jqk*-j-`qtD9(9> z`np_vm7{>auS%dL&nT>!x~{mz8IG?;mdR@*mHJHJEtbf81c4b#&QshGhLRhR5kfQf zC%87#lryniyh6U|zs4sjZH!fSK|jCfsJnn{q6YT~dr|!gIask!tU_JWZ{;n%I?z9v z&vr*9YFd%Cc%7$*&cPpLR#NfgL1SLoR4=7%L@e;Dko2%Y!i;h+ho~hiCU8?#Q?=1P zkUGe_#7yixI)jK|8ls2L`EmmyTrTv-AiuQNx!yt(VKI3{c*rbQ*JRE~<8Ys_QR<7G zk_*Jga!WSFFoIa)Zt4#qPAez4x*PVX>)4~D22upSRCPwvK-lb!r`O9K?>fB9@B<|s z;fhU2eO{0r6PFbxCXWs#SNlWdHqcJmFAT@}D|TYuKvCem{vO`ON1*ZeETk*mkiUXf zB4>*xZiPG_zlf-qdSV}>t#CIm5z&cScPiH#af@~zP@I@CfoW`o^o|{lEkZhb=87RO zf$N1WrstEx(P+FrGX^{AR#jH~A;yyi)pgxGtqEFz8R|-kvr0yH)nHXKn!9u@ zT2G#ZoJFC0Mts3d$F_7 z?eJa<)Zx;FQ_@$tJvM@9PNmY{=tAm};;yQ>>J2atcB&3Tisq=gzWTjptyb1M3^R=J z<~in%LGi&8LnA6hgbp@6)UVW*YO>WA72!lQx>h{L^$b+@hPY@4ZYwUYQhK8(zp!`V z#KPpFX+?68xnxVp%d!+}1Lq{qDws|8<3~w_h!s*tUV5~0z49sa>u$kEUFAK+3!0}y zFzU5}kD*i%eOB37T}|uKcBX~<-J4T;i= zl{+-YbS?Cm+8&w%s(Z>v#R@8(nnyMy=Aip!9Cq~x){{W!H{ezIqpNOI22BRD;gsm- zaUJ8kCq%|MBE6wagNsf3^o`Yr$V{n(ak*Dm*Oz=K_$Tk_Z#1{*kL+)azrFsp`}??` zfBj(!j3sQ@FxwjUbfyn9wzG&PiZ80wn!Q?!j?+gOQ2klWcjZ|62{8hzgPa7a-WF)g z-exv14Y`|wLq3m3Dg^aY{lXx$Qjf}5?7sNyr1&!!Wa3~B_@ zo?YqsyPVBmo%{61_Ux>$^5+_#H)Xxa>hcy?(30H(?2%*IN@Wh zPXn{wd`|c_{72;PilWihckUI;c5yCtfqJBxq;nf`fpHUJu4>HFjn|w|cBZ;vu)F8> z`OmorI)>O1tTQSGRah#nTgTdy-5>m;_?C!@%2#(WUJ3af(KKdz{O9C1HSg9MSG!i7 zoZ6jgTT_ZsW>+;;Ze~nXO~x9r?OltlQ%Zm2dva61um3XaGx>E#_QM|)x&P(8D>9X} zs+i`;^Y-Q}U@mP#wx{1Ix~bf%9jZ#IwaQ)eJ)#9R2oc0}d^lSt@Q-f?B;2~Wnz*jJ z%$^Wmt-wTfIbSU9M;>8Mh`Y2(T~{mVHW4` zx_hdNWIA>a$&jW9XTS!#k-Zm4_fPi)yn4SJ$YnHK9Bdc63L^h6Y{E>3OPVT86p1%1h_5o3&|i|6=y+L9Qt}v3NV1`BCn9s=u*hiEEUf}SLjX#DDlM%mS2#n{XmcLw;hz$w6dyB8X^@SB7S132-@-=qmIqwB4`ZkAPIW z7z>~q=VP?95W5qD5YJ|&Ll$AOE>3~cB}SaTrz2Eoq!kGMh@BxXXd z?ifNN*TorNO$}vS(2O|7*AeTYTL>pm6<#6-Wu<6>C)6%74GsR0_*Erli(}bX zDRkz*D2J}WRn=f-{-7+1`xJsY%Cs29KkjNti77pMc5%+6ZVVAhzWeu zorx=WCrBHil2y_(o0pQ{%M66^4KnDF-$laSH)Z*mk>hundkkdE@5xl%TXkCtN4 zW3bVffbWA>WFM(E^nBhh0(kuahCfHbiKI@Yg*oq|ui z0K}pgG!+{PX}5(y_--RN1b+N>aIiE$Lr@p;3YenbfjvJ_x+a)}Bry~^$C)szZjBuT zKJ!L28#Un*&YJ6!Z@8rrQGN{DpKIxDLA@-SPl9 z|92tjw@!+JlvhtME^a_afwdh9aRr_Fo`n1DhZk*#~s$?Qngh015p)5(iD!_0l@&93(g6!0h=J84uGD4w5H3 zWd%4{SA)w4+OoTpTN2h4!=+JemxgKp^1&l%0=g1LP|3HWboEahWs(c$s>jY+c6e zsDRdnT;6xM{$B{QA=hgFs{jS*qCB)G%x%=jX&`?thraJrWHkC3Z4CFI2G|<-GXa|A zmw+183KB_OA>Eaa&H(Ppada2@4>a9lp$ne^|2+~cRJWi>ycC@a_t7RuFr+poLgyEQ zyU<~|0bHwB_iEd4|q-bag%%`4GJpEg-UfD@?O|?r^ zOI5BcgXGq9)o}Gv%>%7fdqGo8T}S;^^^raS&zI}4d%#y}2#q?_uk`(JS9gtdt#@d9<%q8_kr(` zzk0wQ$Yh-CBADv-fqwoFlA~6@XM-!(DGC(Zm44++RdqG0*`;}@>7kvb>uw;-uR>mj z_loKjTUKRxLTJLm_!U*o$F2+?ZH!awlfQbqT2c!C`ECDsB_}JVX^!p3Kid&T_rZ+3>5_L<^scuclpWjDw5B@0n-X`1kW%s8gpR&Gm|4}XP za@izLEy03j5s#>+%8%;jx(>#AW<}63Qu&OjoXDnk>=YUwo^*P59!AfY%URZ&Cs_@kV?Emulkl!OQ z)(D_3uC#x*Q=WMCF|ZM?D$JT}?LgfS?K5pB0~Yi>cv@(Wun%F+!}eA(MYN5IkBds! zo%lUzV$z(%2l30Jk)Q+0AY3N~`zyO9+wYdwEWJ_C@OS!m>ks7Dp8Sy|*_L{?CHBg$ z5Rch!;(=p9#wbUsWSSwupt+unwFBI$D!gLA7)Tvg5L!upz?2p=H*_WNWT!+NtQ;TPKGBnWHF;dszR79HEvxQL z6l3$kp6li-dZ0;Mj+gM1*}s%GD|+>3MDCW{>c5Nr6y$F%!b=*II?Ef`3Y_iyV+9QI z%15!=_(eiPb)eT$^~nW<0iP-l=XWys{N#a5 z+hXVCzr@O1nlHk2-8QM>w`EPmWa}C0OzTg}dJAHGXJZ|kJr0=p%4{0H2TmQ$rLB-j zwjc$N-<|?FZxph`^}tRO3EcvtbR77*L2&2a50>GMNG4JPGvFujcyQymflk|jC;^8- zZ?pu?dyVi7ke(1FFR+l_Vau^Tz(3gwv%Ajt8UiO*;K$H%$iH%!NM?{#@wbp1kCW%g zhk(0s2W^ak@mPE$HjqDp(e)MZfqRSP{1)h|SYhTn2xhzw`P<@N=wO5i7r1Mjg@3`% zVko8(xFmJ~g@h8W^7n;U;7HvQ3t&R{POJeu;c@5(ai{!2{KC}$FF}Inlc%7kgky4V z~E(KK~qP8xf*7K%9bJ#8u%Ve-{0K&BboO zNrPY}6GLF8`xE<*e-C@0?QAw>Acw>L@Bmh(@(b1FO~6T8hgDbh$4l{rf=!)9Rj^0V z+0-WBqZ~zhW8?UBcn8%8wlh;r9LntR)+W{~FZgpo{s!&G-npO$}AIn)-#H)OB$v z(w|(79Ds92cXSUTG$I0hAbsMXw<5UZ`_vR<2L6y-2%Xtz z;F~${Lh24Gs94!yPxV|S#;VsSGx6QN>)vgAPoy@LLbewU3ulS8yo0F@XWE`bintKf zQa$1M?x$oFW|Lc>8xf7)#Il$$alc|YK2~VU4q^(#XIO1KL9t)>$~t(2*(J=ygUIJZ z3VMJ&z$J*q(muQoeh--Q$M|V*rB;*U(N_3D#Z3NTAOIA(^Vrj@u#&Y*^>pOR)_j!=V57Dl2ysH!L_HiUF^I`kC3;~y}mRFBudp7ac> zlcmaBTy>gwN3WYmTfJ#t3&g2Umoy zpdzvU&>aG&5^DxmbRv3^*ntg^?(#ReOVIwg1(Zq(^C200FIItkz)nK8dm7qIHbLub ztz3+}MuW&4+$+pt^}-P36r6m{LeqJNP{6$s(t)wu1^)`q5xw{U+)i<<%tNX?Pg=`Q zWd3352;C)*)DO-+Rrq1-dHy$SrhZE{DMW35wSA&75y5{L^M?$ETpgTi`ZeXrZ|CuxeyXlLxd&#BW?#G_nKxCI%##quh+R}SE6GOK+nJw}h){Wp+> z3tV+v=bSa2sPm$852T~=+`YVidy~C8y??yZ;bWoC>Rafq6wn2F1(eX$8w14OH*70z z7++tw2z($K&gLEDTF@amhOWV!SQ|*vT_=W+O{fWUEkzY&vg)C#MAc8dQ+-&yT>VS^ zK(j;Z(Vo;r>!bCF`o9bT!%o9)!vUkpRL5A!a9lrFpQpW|=9TLevD8}p0<_zf3O4pN zWAnfA9(V6^)pA~NRB=Q)dN}Gkn>y2-BVEf}3tWTUGd!a_13mS;DqpNG(x>$0d*6G* zeP*B6o8nvK+wZIFzvm|d(*g;Mi4Eam_*BS%&y)7RHTekb2HuDQ{*hF z4WyoFrKDU2l(?;sY_n-*z*+N!{;;91v9GDr6l@+~PB(8c-!!KN?FuR}>&%FGzbV7; zQ+ri?Pnk@Qz#oIdDwQt{l=xPArnqJ}rrJ&RDt6$}*)KSbI5VBKUG3ci-96k+_ioQK z592xI6}@YG(|!L!=4XUI!r#)r(*Li2p#P}f>o4=a2cG}IKm$g{Msjue%0d)yb*qBo zECMK#G3YSJ_{~C}!LyzQ+k}nBMf@@Gk_@Ahf#S0esQC4@9ds-7-wmj#*!0c(Fz90N z(2(TN$Du95(!wr<-3$9G%p2N0v~9=*^CLrBZ3E>!q6RWrXwKw#Ke#SA;%%)e;w+EL zNy~oA#fpbk(yn!AoW;&fE|;sHJIG`6U_Ksv#QOu&m=HFN-2m+e16z-cXV);9f!cxd z{z!iYSZ(6{xBO?o&)bqq=d<8^xJ#M_ug&hrdgM5K6>GpHR~ym5$6{#iWun_*vNVi1 zNj?WJM5^+sN}*Y&4cA{W^oD$E^WeTABSQZQi?0-@v^D%`cuYj~i0|Qs@Pe>kAytD! z!xU{xWe(9AImu59-1a0m<81dVG36Dd6G~G{_m(y)OD*qXX;;z68fB|zALdARUU$jv zdEO-ds=zBIhkeh@fhI{Up`L(27lq)LLyu?%t7bnl-x)2t7*gZ&x!ORDJ1O*sGww`@ zhNr1o$YbDTRfY}fIea0}kE~DW>F@LrMK`5cbxPGr&8tf^S=t<(Pfr@_nx+A3uxYS1 zWINQTCWLMctrMCb@+u@UWM$9@(|E&Qx_#AQkz+mT7Feh6MO_X())ss2VW0f8oV!vFn2WG)n{mbsBY2e zL_Jg^edI0%?s((e*BoWG6UPdR9@Gz%#v;?wydt`W;NMv+4k74ISQO2oY_;o z%Y8fjO9JzmUT}YG&Hc;0;XXpg`V^PWZRK`x8C)?phIjL6LIcRi*rZ(fHF6WuyL+Jz z)td}~HWUe-hHuK_s%h$)nhMP!Z7-coH%niv-(*NKj)sQyJ7b|yZ}J;$#vjIO#z)47 z#yLjG(9_UN|5Mva(@6DzCdlE~aXDLPz#R`v_KonoaV>X_bj-4QYzJ-qZPlOy-pe-4 z_OA`GPqi1=*Ej|`!(1hMLSftOLtAj>#FJ3iZG;Th=u zy5>7e9Ge_d90wd%9d{icAv6EXxz^RhExQXnzq~(voBZ7Z4H=e6XQSW>(el;# z+WcO=p)f<(57)_8F-dwQos=_>a^UoF_zPk)IhE=Ro2*reb&7L}p0H0^txQoZR;^QA zQKhSQtGB5?t25MR)s56Ss`}s+Z>97pk`+A7Qu)*#3ZrI`&B+PGHM}K$7F!6@s9gCI z%+}Y6tA!3iW4;4_irc~&xy!5tzK8!Y9ogEDu_IU-S{Ek1eNi0W4qUyu*nijvAPttlOzE^-13L$;txoSIwY>^aU8YZ_z@b3fLdpflKj*@CN${ZOuXQWH7x| zLte^9q(8`Qi33WUgxa80>JmGO@33tm%!H5{@@4s$6oxnF)zlbhJC4UBp%dm4f1yxX zgv7}LF;TvUrU^IEi@@I=iB^%qfa3cOQ9&b*1~+08=nZFznaE1$=`O|YBY&h^{1Ehw z=fe5Ik9>irA16$wjtRrij{E|2nb-!m31iVq;#)aest|9&gftoJ2c76$QZ+bT5y%Mn zD3I`a{QqwQW%`!f7K;i3=Tm+}s_lQwiLo&>Dlz<7-Jwd>)@OQu*UJL&OC%ZHF zBiMfgp=ro1IG=ULl7#bQH)!w95L2+ml93oK2jIIf9(;RuQ9m$iv%sM36pQc+FuUD= zE#(@a6%q@c^0Cq~>WxGpC2}l0#dRRg1CwPsJfS&7fj^4WlwfbttJ$4K4qVbXH2*5!!Rsp*^wWr#k0AC)M) z$3%3hkcIb#XDVQbNezYf#2YwY&PJ~ZR^ka7iEGH4!0TEhwMM34i_sf+G?FOlu_9qJ zn#61-$1^|aA$}fffmoTxw8&?nX?UL4m>2>x$+h@&{wh%i+Ydcuf_EWfp>_TS+SRml znN?z)p~JlssV3YPI};wrc63DANxi^L7zG~pdqCFKg7f^TWJCr5(``QH#v739^1W(5t$UkHs z*!essS|B~~{^UFah4$RPFsl}k)R{vuMiC1O=+HaCDMk*acQk()vgw?&>Q|0g}8d%?Ba9!2Dy zkjUvE+>{L%C)cIBautY$$Jl{Diq1l}ksZOHSr5L_MF=GZqvv6xvIpAiJ;jN_QNaeY z;!L279}pYz{lz4{5q}xkB3zfo0bjm1au>LyN1#DTqRWBad0Re;pCX!qV|JcINCS~k zSOk^?F4|Pi%+HpSz_8vE*pJV^-ntS<^iQxk$ae72yJ5yU9wy*Ffvmk1n#LiJ&zO%y zBin(+@EP5PguzvM5az&f@SWI!vxOWu8=Ab!DL$0C|zztfCIKU{d0m!eNkhbvuy#V}%&9K9W1>k!)v#kI1Y5ujU}(%iXFxY}5h{UEbOikA2IM8W7f8BY&{eQG zjDc;&VAz0WK$o;P(7bN}OM#JkBa_fl^b2e<#=s^b1LpnRrNO|C900aYGqO_35&xe- z{48CCSLX~!>KuYha~im08_GT9{qU;-yrd10OJIJz3a!-}K$6%DG;J3AzQZN8lmzcN zCRu@e2NJ|pIDw7=Yq1wNx0B)Ln~ipW{Xi*Nf#f4iVUiVwjltG{qtb!Q1&iwvnBi+- z;vbJ~2WCT4d9@TQ4U`gqPF@wgj2=dCn2Jr8HQ=#&CY=M@u2nWlgTM}a986&=VGG<> z{2}HDHH0_(R{kR21a?3z!IM=3dbu(DFMhJ%6mNo=p+17aHFpO--_O8M|A!@ZIyAbH8!@4T*znPmXUClg%Dso3THc)r_54 z$wiBGkbbahEQBtl5AB2HU^|IHbdYL?I$kpewgH{N+Obg6SQiNiU&g2~^)>A@C7R|M zTNsZRop8#EFeGU%D~=IM0WXXjaD_W;bv;ei>g?SSsuid_p70)NBVc!ARm3S&Qzd=%=iv z?x^+YW*Isej~NZ71Ew|RAwesGn}*uM7FAjayr`v>&W833{T5PeKB1ecv=Oysk@?|8 z+%+9XtS2nH%g&cPFG?$lgSN)IvLO{aZ8ITxy3oDD`^Z0t?JAs*rXXv;u5l9D_$T4j zr$r_J%XOf@vcChFz9jDj&qz;CVDQX==g@ARVcstOD-6!B7GKK?&>XBkkwGTXClvu@ z8}(ZCM0FqaCE#w~(G1X@(=F8J=${+*84sI!2PKD`4!s}txl&?8X5_BQ>natQo@)P6 zzQv-&cwmlB@a}Vdu+}SIP%^N1VDW{LnPuHA#&DAFuYnmd>pMt7}-VD1?$q}9!`5`h; zxqsBOaAVLleUQ2xu|QrUtY`Gzy-v5atZYc}hr**pcZ#Oiwbiab!Z*%u@&j??gKsmF7 zQwU>#GQAzyiCrh6s4)5-je_NmQ0!FHQErCDU5u)UDpVDtLe+~kb#)yK*~TrVR^}H$ z*Fz46bq{|Ku|9H3wak9h)!h5e-<+M!R|wU>_`Dg?&wqeX{ROs{FNH~b5AFpsKcMw51RB#3 zcXRi3_eIY(??B%+|9^oXHi&N^HU+}*FF3||h+^^@wVF;8KqrOFw~Dav!oPtX($ zRzFwI)qH^_-EZwr-9AI8sfxLA(COeIAq64YP*d2EuybL(Dy4-{K`r$2)CXuc5Q;~E zb%gT$=jvkbP*G8Kyi_WEP`0j&EbConEYB^!UNO&J6%sQ)ywCmb7?g|SZLkk)2JZCH z(s}W;;N(a0)wp#`cW9(;^cj4wytr?VkMy7MuM2Eu&as{OfG`%wFP)JI=yi<68LArna{3B|JAi))yOIni`pA8h;wv z7<(Ix`Z7~%^JERDkm!0;9efug1>T8EIEz2tyUxA9Gs`v5)yN&@zUnBouXnZd=3j6%0++eY=meoPXA-B$V@J7l%MzSR9HCLw{ojsAT-R^g#LxA3}7bC!uD!qv8*y5MN;Xl*6TY z(obTnqK2S>>GDPTlXx4;h26m($gGYb_AonCCVv{s8paZx!QK5AK7#;$2Hur?E_C** zi8*9HIJV*)Fvfn*MBB_1NNQhQ+m+KGP+yqS2U1>|Ky zq!OSs72`dSnF3E-mU6fzSZ(ET*n-Re`}SG%0Z{~=^O5oe-lrKXg!*qN$C904@7se~ zkB#Zu$$x~Y^nTJ zGba!s%6K1fgTE_wUbQliCygc>fYEy{mgwt<6Eupgkoy8td#kS{ew#R^)`=}WwfXZ{ z8MXlHNaYJdy?SagGa3)3J7b%HP~XtMM9fr*=r7{4@Km@a7V$TT)f9!*5eLJ&yj$SO zjq*+rRW|f(Mz>QI`75(u+^K%59M6NcloGT%v2{uATkc{&d084C;QLH zqp&xs0gh~WhiqB-6m(Jm%V7uj&yWs-akdFs;Qcp;A zd{eiW$bD69uo70)HNlYuNutEy_qXq#>sWJkueH zFnj+V7sW57|H3+1uB*G7`f^ijYfK%H=I-+Z zh4oOrVWCe8R+SA*4d8lrGH&p;vA;7<;~E4a)$QqE>oDYB#SdhNC-qKZ-O2l{G2rQUB z0?n=}VqLnkS3*83u87ANfsQ~%vPyItbqjgPFp@$&S=^4U@Vpp=pbFh3grUXgVjLK;Me^G_kfN@?^0=C6&*t2irUU^=qBTS z<|`ymdScZ%mTZGGW_oGkxz-X!{LS);2FPMAMty)C83-p|P;W}@-LclL+By80rnLxHU28AZ=T`tbM3eNXvM+6MkM$SYMf&sCrx2xJ*s8%$b7OhbA(>6Dst6TKMS zO8b;)z`2!rqz&Il>LjpxyY^KsVmxKaDYj48BN%CtJ8oU%+R0`;ag7 zS#F&-Nb^8F&)1cSRYW2a_-f)hibbpQdg&ci3$4j6LksAQ64+gZVOk}U#h?;RKS4LR zqp>e)KbFV}QY(V+Z>^uE~3MwV|=c3iCD<*1tvonQsN7j>Z<2L3gd>esOAAVn3>@1MMhGurAFvQvMmztj}wPe zTVy+bPnpL~WyYX`iK+M;bOZ4Z-^u%1XrmfIxrH<)1-{$IAX81KcWD=MX|CTyit;MV z8QpYe8u#XLT~*`c4??c^k1|y#^HK^Ht0RY?4Ma}5g`JVw3ENR#sgnD#&BS3uCn`bc z;NL*lwFjm5zO{-1^hltIxCJ{!?FDb^a50l#FK!`DAZfyEiV#+_v1kW^1C!Hcfk0Yf zf5}5gJ#voClqkZ4Fw#VEJTAy(oIxz21+dyFU?R5xa#v5e2Jou+%^Q7d$p)%go}IqM z#3cN!Sc_-jskJIhQHDwx#18o?Hxpba`GgNMgI8%N@Wh&lU4aXDPoSi=@Vq%fri3Dx z?m_+xYcD+$*UJ@nE;dR2g2j=K$k~*aM2K+3L-H3nU;SOJQ5;jW*5rbnc!74Xewr#w zGhR1JnLxh629jlp*<@AuHqu-A?H$DQ=TGHTR_7}3 zg1}0DF>?}pM}B_0{1{9dHav}V67BG9V6Hhw{K4;HkCF3mUVX_O=T>qJ*(d%u-(TLh z-sS$>Ksqy-*~r{v{rql8M22EBz`GL!Is0GG4c-C!fIGUHx`FztK!Lbx8fo5Y{$qM+ z+Gf5SoEw@L+C3=4e88+WR8luqQp#F%2zFF#!4GFI`X0MpJ7woRdn3!u(&1%e%Ab|p zDN|aGg7tTU6?6XWY31+6n79*s1BpP};QNRq@-&%GUV`68kZD9YhJu0Rg|trS52sak zzz}%uD*^tqDexOSj+p7xG5 zQZE|n8pGiE4kE9nVAE(bAJPEMrLN!y<~qTi;7(?vZl`iL%@Q|(g0NG#!ff&s+S}NN z!gC)}t|*Nvty?;%w505%g|BF59ctU`{Li~Hu#)}Gw~-RT6*?aO3eQX%s8!TS@-uM+ zOcYJL5ItiE*Hw^PkvF54flpt&H?oe;orAkSa@X)Hk z7lR6oJ+*U{9&p_6lL-C^qx5ZZuD0b>)T-!PUZWH#-Cnw(w6yeYxu;^dE!pwYwb45` z(4Qm4IJpQ}0RQeYqAhuo43MKql=uivo59FmQa#ZqZ08!V;~0OSYv7Q7jsL5^HgGoL z8JvB}TG_E+>YgT47T3d8*bS4=HqvF-a{u3uxBz@Q2jtyI0{R9rf=zJ~xt3m|w5!%? zSZx>mXTx;U-$C<2o`q(Ho(mPix`h{oFO5L{SJt@z*;SNz{LH!c&Lgjx3CWPxm}HX4eazgs`~UU-c5YzrSKX((PoH!8@pXUy{#eO{Z2dxO!|<;S|BvAv!(Y?<%{N;&w9aoy zo5$%N(H%oK4Z1a#qz96JtIXBzO#f6$3Ug14?CI_K{E7J|cJ=HzHm&ELo<%)>)W0ai zA-!XI|K8iKRcl)dy@j7^kDaHB|EWD@+e*7jn@i25pBAq!9w=NP&iZxXHR(Mj70xR> zT9{qTmGY%0`&McXwC&}$HQ#q!r`2rJX*sRQKJ69yhRzw9CLDOZ&UgBqMo9N-eP^@w z>eH_InZ22|>>HXZ8B%{^{eAT>*FW8GpZ<&dK;uP?=QQ5f_)6ojrXR`m{f0XlZf*F2 z>;(-^)n8x#@AYrim+IfHACNxhS)HxkFHO(nhVvWR8;)ovwJWqE)2+E5=T79F&gN5L zjP&<9oAYz!8?_d7QD3j-OHLN@`KR*#Sa_z;o4+#uNPbjdMPZzFwfaT=SNRcz`wROD za|+MqU&{YYXQPfP+*i0mE2f^w7qm;UR>c(#7Zw#?Dn6!v%YIJtDtr2~1Fq{p+no&VZaTBZG#?=4L#-Bo;{Frx6y{41J0Kbqg2ADi#YU!32S|5*MX^1sP% zD*U8SE_4+y(C(4iL9+C0skyJa^sUnV(hljFUhJP!?kvyN{_m@_>)}6Fo~US_)ygN5 zcIAFw-D7nx)XhxyX+`&@%$Cd?&1F5H+0#3$QraL2dSr#U|~p*r3_7mo?jWTj{0J@V*YM7`~b(UC5x-I=i`t$UE()pS1WxkV{ zmpP$1`{%TO=Pg>tGeNTX)pU(^8M-aAPWie%vnq2)tEa!0Y9>tUEuKoZrcLSO^on#x zIy*gF_jPG_ck7?;pQ>9X&HJ0lueIj zl}ofzeX3@wp3_d{|Drt!wH8&Uq3J)_qT2?p)ybMI(r@oCe_Q`<`HK3TyS1zJZ_3BY zg9avQzo8x4&+^HEUuaLuXEfLJmi}{67|>kQKye^fX_p3hlh&p^pc#Z0wVJ4?v(M%w zYm-Z*A>NRzO4cNsl8fbEt=&^Une3I$`ODJiKcurezmt4F`L0&qKcY30UrQcU$bV_I z_oK-@>M?H7`t|FR>ylln!3&d>I^}eWbVt`EHz%J+ZjybIcIdrUCqrGSJ(ITuvt9NU z<^EC`Xp6qRSZgF^CDWzzAD>KA-!nu0JPd(nSid(^FgYrtQ*{ z6Y^=*&>rmpx>vgMyOKM#a^sVl(b}oC?AHj{-I#nz^N@F|4j)M#7wuDtJeYh*^5ZtW zYe&dQN7A9MYL_aVo;)&X(|70TpE=8w(uKMs&AM{2Ms$%%t1E=BkZZZpx=^{Eq4?vI z(Mol@%ArGN)vX96dX-A?Dy8uwD$8qRb}Dp}XrulYaf$N&VcDC5dxzp&rE<7bch`qH z-5kp564mY|g%Wq0?9Hm{RZ7bRvRBLQQrRq3>Xxb8R*6=qq?XHGt@7LuzO+H_TNCbG zpnFS`1);iH zvi_g&qUaCWukLp`so_rw`HRlHeN%1cU7e)eqo?|`CqY?zEmt&eL~c(1;TurC`ZfCk z^;VASnWOs3-}N*`+t-MW=p5J{8HaZ(v|FioM|+UIF8Zs!`Ddl(&w*Z68eUPzD@x(3 zy7yW&J@07tzFVpHdynXf`;gvAo^TxsUpy?oeU2UDaUVJ?B2A>y&yvnVAx-a9Ox@v% z&D)55O!2ksLYk&Xl&AiBD1%*8{b~`mN}^AO^1{5otm;&H?=QbtqP|n7`KPQXlhh}T zGELz+NY^ISM%7=vse@cwZ*eT19iL>FLSQiRkb1%A<)Q z#n-aM@GibOBpD`Zm1z+_pP{x+YacBh*8g)(k>IM_He*EBG&m%tZHQ6{_j1MMtCqaVhYjffjVi%s5+%M45Tqcu4JE!(&bzCFS?kHooIm&%jD0k}e+)z8z5H$zQ zQ{7RY)a5+Y?!q8n7sy^1r0!zL$qz|dV}l2f;LC#~#_kH3pi8J=WiTt{2WNr&E)=4< zD4>H?RTn5{b-+67gf-Sm4zCxIz-*M+AUv`$(B>e=v61JN>2`q;Z9c5wa0v5bX zHh2=Buec-aklepQXskv%LkOW)3K3ix2p@QHmv93%q4wJap5Wd`f^iIZx`x_ z-@Huj%Z04A1_D#Zyj-k&I;WsDm%ut zIhMZKQYXf=gaZjW+&xi@N6Yn{_=ZX0E5xEDAjKxA4d5c)`AR5#0sRGSl6D$fCw}gNWKFbPV&bEJb(`i%`WG8)ODc!N-okwYsNl@d zgBTxRBb5my20q*lL(a8T`*<(~QW}|O`E40)DZm{|am#b;R!I!|kQ`Auwgg#%lmWLO zT`VV~#2KtG?m=8FzlOB`Ald;P~a(i$mzLN8%Yfki#QCoB{;Gi0;3tHA1B6kO-FX z9z_!q;traW)8#+D|4)p-kugXa)mx9`2o%_R`Uo6nH+h^xZJ)t-t*`w`atiN z-Ed@-;~tNJuFd18+i<$&J2r^YC^NPbkHd_(-I}m1qb->yR$Hj0Anh6{iS2f8^h+N? z?_q?DjdZg?w$bz8kFt$1O&rT1xsX+sWb|b8XNv@3$m~&sc7He2Uv?Amx@3Q4?WFfown`qZP46q-Ikx zgi6#foXL*4n;SF3ZH)^enr=p~(g~qWR>7{*HnmPZIPL)s%j~ZJ>Y3ma9 zc+^Od+CVd6e29Fve&-C;Cj<(lMq^D|*8m5=6|@`kOVo`;{RrGxC*J$u&v?eT%g77N z1EMMgoCQ(>9f7vMMri$vu&~hzaz!`T8#IQ;b%l=0=Me1UA~d7W(V%100)e2JL}!Y& zHin{uwAS)y&`F}Xv<8z<>nQC)mx)F*>N))!A=ZoH@_ph#)`$8&?spVpa@cS6vdI`6n#BG#T#UU`wr)VR|cWlET`1p{k}P*-El59+Eu zSbsIl?VgDK4+4YI!CO^tx!;|L&1 z>)5|A0;PwcU-9^oF@{~%St3O|vb4;he{nAZKUrQ`3d48qZ9p Rpf>`&9%fsZk74fR{{VJ#Zyx{v literal 0 HcmV?d00001 diff --git a/python/tts_output_ab2c61fb.pcm b/python/tts_output_ab2c61fb.pcm new file mode 100644 index 0000000000000000000000000000000000000000..7a805ffaf1e616071b0aa4ac2dd552f8bef0bf0a GIT binary patch literal 156952 zcmZU+1$-38`#8M2cYA)hxDg=<5Q4i)a4GH-FRrD6l$KJYv=rC2l+qS$fws5@r&w?Z zkPryOJvrCi_j&eVf8qOona|EV^Vs+^&+g5H-b^nD{g{DFUw8&G1DO60`a!M_gbyI? zC*}GA+#8;r5HeN1QssO%fVweV;pxJ3 zhO{fB-QHm+*G0m11!`xe)4NB8yD%MrzYCKrQIjPI;bg#5NCvnA(_YGTkf8QVI|v;B zgLuSY4&nAp8-P2)gZTE6WLpVBiFQm|z+sG`HSl(j;x>>&Y#Ye6f(PR^QV!vk5GdCi z@U0++ID{x5OfpEr9K|h|782AFQW+vSjGIfe=0K4jgqkzW-pQa2l4>T&W84(zO{Ew) zQ7g$dgA^f335T4B#kiS7!I*N0X)5VM3Dij15!+bO(?r6`8c?!{BttryfE2ZfYJ*hL zf*NEV#58%2f_N+qTZlD~>n_(CW#!r;7v*HVEdhf#Y!jA-DM=D1##Aq&P>qp;YDaCB zYecegy<17TX`HZR)POlm36f##V;Z5V5hb}Q4y0fX^$?cwD2pwpkwpsTh>tk2PieGC z4)Yj@lgdFE!eNRvuhJv)leAm|nH$T+fF;Ovka4nZq|p2&3eIfA$avI@7}QBRFs7Oi zh1w_6kQY}I)|6HW%8>?nogfAI5lia>`LUMr>O+|}k_O^KO>Lwaw2|bHM)azfRwTx9 zKpL*`mJm~2P>W2JQ!EL&+QEbT_>irTu}H^&vS=5GN)XB*MDj>SON1O~VGu$&!eR-s z-9egcoiLTH6{RSFbhL9MfiX!_X|hB+D2a5*oTve7Dr03lN}#*mn~l2BmXoFK2wJHOlqG&yBUyaP$#F-?ipzTeViALT z0_h~Z6w^+DJVfs#@lc7hqmVpmAS~7xxlm)r|AA0LGGOqL>2j%ZJ>?pZKHRskR-K@Q zsEt}cnlaZA=p=!3st@J~B5t|vM8}u{$#s(ILUodBhUF2ygS2mAecQu>a@2l;uoM~h ze#;1pJ2TcFa~P9$s&AD%mDCk@hyy7of%wjnBubzzd7npZouKXV&X0Mbcarvcs;7*j zlBsOcfxPG+AP3b0y$M-^j77hJN|a-24e?=_=#@}Peh5m+dQk@H#EpC;jXFC41+~jH zASujulS=ITe|`^AP!Hj;)}&MRfl#6=$dD$At6GN|N#g$xb$>@gO{fF;$m2rat2^Wn zhdvkiVw4g^_Qj~i|I0!8WbSU@-{FIDsFQT}e5bX$v1Mf?QzDS zG-*aGQRMk3&o7!s*jAdE#EG&vGpT;GT4?^s>jwFWS6)Y?8Dm^A6i@~Ots!~+(OgDN zxGv=tguKL0D+=Q(I_f2PtnvF0@?br&9K!!^Ox#o!mWfmfWEJGvAWpV6nEt;%dX z7x9p-LtfNFIBFBxOBpBk2-!1~K}Zg0eF>H=B3f?Q##Z47`@ft-C0mOyT6?OWYaf zL#{oRPdcd%7|S%2AWc{cnNE7B6x=!Gni3v&IjS?Ygvvr`+Dm1w|1AY`R12yx?WtHd zlItvKrCLz`QTf;(GL|%>JbGSOZz>h()Ji#~zDA#m^ka;zBTeMDP}#D6^pdDtjAgyp zQVfVg?}T8KC+~~&%aYV4^qk1=qf$wO?5&Xo)Q4K}3kH=(-Vk{}*pEo1o<_Rd3iQ6n zYm)sm@=E3Uw1+xkEoDy^OGWwqwpTZO^5B`N{SLmGXh!mm?UXXKY9=ZK$1c7?UJn5XLWX80bBh@E9Y8xUu$fJLtVu)m5l>jcA%-4|<$&{@V44}Em1^1nYDH^}MP6TF3Q_ z7Ln+<@==N`4&ul@5%qmr^}dZjn}phE?;%LG+DJjGMb@%vpLl=YK{~#vpiM;kPnMsg z-FyZ-hJ?M<&=C*`r1yO|NH(uzAvDsOP(*%@jE?wpdUyOey2y-z7Rf;0)5Fx zUmiK-9MO>nzx9)BU-#srgc%~G!z2pkh)!6{4SvUgG{g>JhC)CrrpSRY!Wf1DJnS7b zj2RB_@ONPZU@?#JaAu?wk6=c;gGVwS0&c{+2Xh}nZUn^0i?mS^6`?T_W)w3T!YBzI z4LF3yFk>O6fK>;z`KgdYd#c*u_j3D+=K%XeVh(j!f$$%vel$a#tCrS{}iGwJUfrwgI3tj23ZyiH2*P->gq^JdXfJAN+U^(X{FL? z$5luxpVlM6sF7?0=_4%3B1{n44WgjMAX|V|1+B?P5Tnf@{P=e;S|bd^MG)B`l0t5> zRcNgcMoWkGi!2%HMEixB36`}Xo-7-th$TAJfv5lK(v8>;;USAo`eoaXIkfg@|B)Ye0>t2+fIK8iI|EX2@1Rm> z=O77`eP0jlC4@m)+H)`-27z`Q#15DAA)a<9j45C_NW}+XxrRg?26?36K8IA?4RH@d z9PX2tmpSEh$U6y=Av*1o#Eq~lMSCpiq#d_vzr|e{OG18xNRA|km-G-G)r>Ym<{%qHIiiq-Av;3$hP)`UiUdyp9cULR z5LcD`BwtGQl+X^#))pxk(2mM>6@4<|K`e3*H_D^+CqHYVBt!cF`ejoAkF=@>wcyTx zf%G7RIthnZlt&pX6Y-O!(g>y)u~;|KG7%uG1L;Eu1GYd;t7=QFLJIX1?HzJI;l42r z^q?&EEygGz_wWS3;m$xi1?>t|y94HNuc;a>98>b5t7ZVr2(7RAHnrG7~WrSB_nO%yBOa~5Q}d#_$Gs4AiVG3TM`C(HA(N|fWAr4w-frkp1z{c2?acFLFY2?+y$PNptC@9K1DvOgJ*3TL%b zAz&I0`2>JtARwkX6Ab}#(M&Za3Ie88A%dw2;S7c_CiLAC!cYi?G*p6vm>?z)9*q4V z5M*Kkq~On(B&-QiBLqzSAQ+|Cz!(_46fo67z#OJJ2wFzN@bG9PNX4iaH3S``Jf!$w zj94Y4N-1!Rg5es{UfIJd;(kmv|IMZ~%wMhH0_Qi}4Z z1#_r{C{8GkV7sIXsYoY1Bq{S^>XGOOxd9>y>P5}i4uY^OYKa@#i&%UJ#vZ_4LA(e0 zhH^fsN3gHF@K7K6pvOgkS%@(e-i-j}Xgp|Sa7d6x9wQuAq~JKxDC3wb-U~`;Zt(AB z1I-VdK{!Wf{$LL0mHJ&ukPdP<<7h6*kP&7l!Z=HD?i!@Ii}ROeHO_3BAcDn5+g`60{@lr)XvBGD#38K|ni%IkH4(jSxb6 zg;uJ*M3rsV`zhKs3=Ji#*GP&HMjW1FM7vmZE)gL-yN4DO&py&QI6RMtXWH-~8l7gt zQ*5mPOEj{*Xm|147@hjW^I~**jLw|N=f~(&7Ja8i4us@y-)QmCy3;pi`5QQXgW}i!kNsYcPG0#;>#Vl^VbEA_aF6#NxN#s&BdSZzpu#2r2k$5biO^i7?4hia64P z-)`mKJV=(xNtV7$|GzR=9+i$IU>h(;-?(K8wgKyg?WWS?*3ma~`U;O_(sy?H>Mfs- zBRp!PUc@iy*oV}+2+_$lOmXj|Q+6^{PUVrplX>!3ASayy#8Jf&L@qjsh$sGJ7|$EZ zqmOfjPHfV=pxu{d2%Q;~PmAI?;i}V@#E1E+*@&lFfzp_n#%H+$v19Op5e zZ^iw+sWiWvK#VzD1@f+sb06ht*GDX^5aL2F07F9v_2EGX*BIh(6%mGT$bmd^iYpQM z5G$`wT$@z^Jqh$O>Pc%GbF{80rWKFty=vv7MZoos7JzI)qLf2Cc_2t5%YiBSASgkW zBoTO!3uO|4hB5IH58;u54~3cl*MSEEV$i2S3x;^KUgYakrRe#P_k$FyL5+7(D2=k1 zQY_1o4J3<*9+Mmplki?C2q(P5A&q#+x2g^_*}|f{%t^Y4g0kdwp=BmttcC<3MYh;- z>Exr4jBLv(t%|XJRk~0&(J+mLT&qyu+Oq96t(F^4-U#<>4Rz|M<%ZvqeMks^lvCeFCG1K^3}-$dLPyUg*+xb_(pn( z6LI86VNCwKUh<)2-^u`3^6$|1{#r-aA8;AISlh-W%jM1_gMW80cMrJXZ8p$$Lew7Cl__aS5XL z1A^(r0)1ZmhcYrG=TQs3TgbjI)&%`pe3zkmYovar@sLLhQ}j=<-Abq%!=M%~_~SOw zELMmmV!oIy=7?{^EHOiTCO#Kmh)*D-iI2qx;ynm=#Z-vzL++9IP@=pP-vW1zSSXf? zm6CVQKo1*W)`Y;?Oq6z=7O)3*fVXV=O}7jD?uz$>aQ|)!drl4D3x+wsLrW{gBGC3o zydho`{}p$MKZ?u6&&8SIN8%u{r`TC+EjAV#i1o!d>{0iRAk5`>h)lz?<{!YDI zJx(2_KBzLN2JoLK=PJfkd%MAV9y9nm~e3^Rl@4T=o7WxS}JqGpvovBVqU-eJ$N zlvb`U)0RvwT3gU5?}wZR*?Zm^-Zp;ge*0H8m&@kQD2yvPQZ}-3opp|*#MQ*RTxiQ2 zXMf@5DT);-3Y#KN@vnkYT;uL?JGno(W84|;HJ7T;^Vj)%s@j@ax?P4KQ`5kq8)h11h zCQaqwwY*Z_4nYu~l(H`K7v}u92~me}0e<`n+0YY+n5GTJ;kT z)_Pvckkqs0iRx#fdPFu2Iqa9A3s$9x-?*K2du2-Lz@qHj>Rw1&@C zr&*u&c|I}Y^UTdz19R0yt;&8i`|S5UJH*C{0%b>a9qk(3Q|%t@a_x3aBlSXFrA+76 zvGL4Iai-AO_p9#@VWc>MImO;r{-F+r9$FS;4O7Mh$EDV2QpZ|vPF;PS$92!v4XUlF zKB}5C+!Aau?B}D{jhdhqj+X;YqDesJaCz(?tixF;FUb218E zMdvgsa+b$hd%BW^HHtB+>DuG^Z;TdWL%)ZH@AVgSE3``018zAxfXVd@@Xm9aTnk+- zJhwfIz26Gmxq19v-8s{=;D5rm#r{!qe{G?`reQ9&`*Pqsm(jRiKXBjgqpUr*v=D~mW!%}Y&j92TZ+qpi0$t=ss==GEHvX=1CXFK^Mb{kNTFcRJbXd8<3^W7~h;ASw1n#NF^rzYAP-$H|i4a;|3io*#a& z?{>fcKE2%d(*7%}uXr!)zu50a$o=t8mcJ-@)wAG%rKOi;o$74AZ-Ux{|5a^OwY-QA zBd&xc1_%20&?oW=v6&~@k!VgSeObJ#@JT^<(MKf#70<27E`xYbdp*Dt**s2FcV@H7 zjt@IO?e+11A3k`TtnJ#k_uLM~q(jv{j(8q)k592Q%T>PmJ!8qE!fRJjo~HCY8-Jqk zxc}LX=bNQmy|n69)Z>(wsc*f72dwejC|!VQR#0HI{ncaQ^WzRxUlzR~@ft&4ZVh-iu%gSC_3V+IL$s!R!CTnn#i9or?>MfGKeg{j<0F^T%ClHgz@p8$F7P@30`mHRWp2JY%R*R7Q|&w z%M41N_2R$u$jm-(w&j~D54y+lI|KH_)~*-SVp8X&1Kx~zG3meQ3#Rw_Xu=4^@U27j zT@6XILmnASidmJ-Uh=o^Uj8Lz^NCu2rtC@FKlsn2eVGTEpAasjUB92||Lk>k4Rg46 zwen-bsnCz37siLx?3vi3#;od%qMn9-9e7ZCQ%JQ%lx63|y`J!**VC^bp18l^;p``Y z>5tzem-y_R6(#-+r(RTqa*mbVb z;=iBgT>0kMpZ|P$sA%`uonP&`zBhmO`9A|sxvv%86`u^vOfSrKwNNMd>4RTX`#f%N zLTZgRwT9Q27PBezp#+WEBz1(4+)yjcJfHw|Q}wpZnJtwsxd;{E8`IbF8z((W8^S z^@9=*#TM%W%$YCyKj?ll>f)L+>8H-0&OW{UY|7i( zUHts?gi}|~UB0;OMvK%w4?oV>Qc$gQVwt^C=X5xG+s>MIm`_`Ow&^V93jfN~iu8)V zE#Eu4d&at(+P7N1wC!;owFg$dF3l@hSsGih%o6WxA?EV)^o;|zMINZ$y!N`r#&+#H zZS3}I_tss<^n5bl{E*i}_J7d5X>s+d!9N;aDgU-D%6geLY#bJld%N~VH;q}vquH1a{*hlwNVjcs(INt+hBwtuxZw^z0~(&k$G zE*)yMJ=jcHV{+&Z{%NZ7&PyegS^LsW&n`Z?ao_Ujvy9xg9pC(u^+R4%S)+Rqm}WiY9z!rj2%?NFL7ql{01}Y|5$fllXFeAO|5M^clfr+%Y^ok zJ3>_2agI;QgaS);;!E*y!>4hX>)$TT`6RDp@!L|abXIZ8;>wa4#g#d!S+2~O%m=Td zvOmo`UYK0sSN5cALd6>Me5=y-tMyjphZVn?``89J+Iugs&$+&AF8hNj+n@}b64WAe zUPMgf(a3)y>P5Xs=u|VMc9S|sllC-R+vIWUn{8uT*Ka+h{`#=AfN239KEXEK8DpRP zdh&~-*+a5CubUP8Ruqu8EAL6+q5MJlmBr_ZzRP)#rG9fitL59+{Qd=zh22ZUlIX&? zyr=?mNu%-&XV_4WjCOT*p%Ho2DIG#x~wx>q5jO<6nk3{B8G-R-5@ug@2(UYiWU{a%;u) z;&X*@l`XCNO4=8M7IiMGSyGtweR^i*)EqIZEbCgq)Y6oaNBKc{8;duYM>#s%$Jj1A zdO81fYmZO>V$BJmHx@30NvQnoz#D2Eor1@Z_ zr>M@GQyCL8Tjb;y>?%wv{IaA~+4;g%ITs4Ps7N*^R$M97mUXQhZvMi2$K}sHQ9M_y z=RQ>))KnNomvm}LFTpwNil;&#PO3@*|txnRD7C*ReTyUQMOk990^ePZuavX7wuSQE|Vrr+H7s@Y2o2tt+e+-g3vWTNvz{>UFSp`5meReyj4L#-{#~ zAEjK)JyAvJM)jYVww9$9)F`-@^EUfz;ct~0 z<(*1Kfqi*izQB^~bh(qfe|ej_clzSkFkz(I>Dnw@XA;CW{1^IJ+6rAgZFMoiJ%w4q z26+Ee+ardDSajunQ-b4-TD3*HDbVb%Fogy6@f*fBRt?c!GKGYF9<1}TsIDuY2@{y+ zDw`^fZ_d{7HSi3xZYph9`lWflb&~x@^S1KFWuAhdqMt20+*3Tc?r&X9ZDMJgqJYxY z<>lt3_CVJs?vtKiMRP?vpUtWA^2}9npZB_0sl22wu)h8Mo8QO5C*^~TgWr4CA--~im*O{>-m#^a_`(+%x3_aW~%ehz!qJ;L2zF`v8ZtmPfT zPGEyrBh!lez<19P;_}%R+g>=m?x((=*<&t*1CUF_#?EYtj_3};J4BeRPe zqJFEMs*K=LxpMx3`UBle)4YH!{+a6CoPl}ZX##VpRLoR$@~!3^nmOt%?4Qm*9j_d7 z*+11I6l1-$d|G#d3Rh8Cd3y)vDip_Rw2Di;IUAe(rH|~x)NAp5B z;r`HF;W}M;%|4l1%?;q~V!R{GwbN^Gsh9-sN?`$W#{H#m$2ZS<#G2yk#2j_7&J-q2 z+1BH9gfkTGzPd9zlKsgu&C|k>W6$ztc?91!#RFA){y5v5tEn-_nNluUSzYMpY3I4^$g#Gz-*zr?e=GFhc;+>XsNFflw%uWJ z6j&oXbHzp8CB9Xhnv3HEQz{-&z2>V_}NG0FG6@&T93_cLjX zd$jAc3)KbU3U@45N1MR^p{g`>3I0g8Q0&e%(!6A{os+zR*hdWap7Tyn&rke*MR|yXdLo;a$JF zK5>3!-Da(Hz83cio0-!JBm2VlohQ>fmZ=T1;A_6EO0T@kl?wkbh3rLPCRan7W+*ex zGwwDmH#ODXQSRoqC~}!X@whlpoUcq)D^;u1@w$0_DoqE)BjxYxTrtPB)iKh0#~b0f z;4M>psvV=rRbCfM+!|Z|@;Akr@^IT8_Yv;_u^X4iPIq^++ASKp(&DZVT$KXv3G+P= zzwrL%`xSnq-sJk%^;irN=h%y!7lpU{MgE#1Mf-{0e$98@Pn?|?PI;O=%+A-g^zUh0 zuKiMfQfpQ(F+S3pRJFN7;^$nH;wx1Le{b-dkm;tG+DMoO@k|fT9-$3qVZ+#u#6P^N zJS{!x&brRkzR8OI;&kVA*GumLS9)b~d6@OBy{C1qeWEAQb={us;2nOp!V}47%_QA!Q~Bd{>}E{SMpu;UHsw$IvI`Xewu6Q8{8ssxwqWa*Ky0< z$9{jB?5vs?e2 z{x?mqafNZQX{ukI?pN(XzB(Jitx+vDd>q&!w03x_kWc(p@G2qDwZt;UvcaC<9PRl8 zz8UuPt?-<&)vOGx$S>Pp-mUVc&Ez@cKIgjber#te50%X-%Pfzp9AYhXCO9)4>)n37 z{=TE$>Ed%C!((>DI%|jv+0T^a+V6G6su%EmX$ky(wwJSN)@jdbuIq0aju~GYmK)po z{bgum;!OGaD~6}W1I8`-RAW-unb5bULcczy2D%hsq3but&58vUt?fH&HFp>jteDFz zbRTogvyLdqEVLHvDH>3I)Hd4vjr%*-Mf(-&X!GLo<7FRIerldnT2S&$c?(;%tF||U zZL0oMvq|%$~C`$%XQ_ z6w}xSLL>GP*Ov=Z?pJ^Ammg4FKU95A*U4~QH&~Ue+Y;O__!@lL-xE9}{8iY@@Y>=1 zBYH=Vh}aZ7GiZ)qC!Iy{g)7y0$=%uP$t(4gZK;ShPc-M-AGtoY*RU+8WGsK$M%sUIjS}y1TNU-Vm0Wez zag{|mP|=3ppz5HU%bimkQ@7K%@oOG%Cn!90U+BP)M!|Q2&V*bJYZh^+nl|Q#s4>+x zN6n0$9ML6krgn?4z-}+8n;n)lHut1?nJdP3i9fGC#T>TRE9+HKoTtc6EO=9rP^q^Z zu;f^#mTM{+Sh6dAFi*BOwSR7XQc+r-T0W$7edSH(4c`rJ7XKM?P!ZH}()Cqh5&A$-++%>68$bO+lPSS*!mDnqRI zTniW%AFD4h{BF!L*497Nh^i^-<@zGOg@IQ>0wQCg9z`0X4n+@$?ihErmbKQGwMNu9 z71JdAi{NeA;f`9xN!gyvE6>|K-SL*OZt-WJ99#^cjg?<&Mxe3 zFZWi6)tR1RZ{HSYg?UY>tN2Yx>(a3D?23)H2A<}Em9cVVieAcDY%Ska=K*W~O1^w& zS$ySL`)1$IO1rj^@uF#?-yga~>dnd|gBsD7;|59yfx7A(%p>lDlGg~Rf&QZ zlAQ78_9Z1n%}NH8x3NbF$CTr=oAf;mdAhc$9o$={gXm^@DqCsB__YX{8TwCHVZ`6n z{tAx_pC55QY(jWiMDwVV)n6rys#RIrRI5os_n2J%&-|rN4Id6n?^RI4xm?}TcuGH9vxwd4{><94%vd_Qe13(i;!S0a zWv~6NBiy}LxWV>UhN^}tilH|{%#kI#3S0%hl?B=NdS5DbXyajw%K1OVB<~$}p8F&3 zHPKJ?wZRbZHrOw$R#>}GSKtX#oZmv@UgK4hE_h|c%b58IKP9eB>Rjiuq~7qYEFtc* z$REXquTt)uIg@dy#?dp^V)J$S)$!|^g|zBfcW}fQUyH0Z4}VJi^j^|4cit@5FX|D- z=`>~~y$Nc}U{+c(!a#y-+vckLFwQ?}BLF&zt96S^d9UTAViQcy2b zx?!o|hJJ&=?Y|<#R4qL&G_gkAl)BaGEUUe=X8pK`*yf>Q9E+d+emVK@xIOj%ns@2P z!fmFNNdX-PcirB6ddyCr@m2ht#?OxY7{nEgrK|KRDYaa;rY%?m3mK!SP zSC&?`HA|Geou^o(Q3@~n-e%J zbZkV!=*;-A#QelAiKVp`)La$!ZPenZJ;uQNHMdL7pE@{TZ|vb-_qw`9M67N&Be`dX zT@8ANjlXL1SLZ}czHy~-rN*up;QQMiZCz^l z#lFN_$n@j4Y5VIV^#HDa!kEm&G3fM4%_RN|r)M{FyOnd*di{03Q-MDPp9tO>91y%Xuv$RpfLDRL zg4>1Fspc26y85H)2V?d{1w_mWc^mNBf4X?*?eeF0Z*M$OOrVb zjS08?`r0SI?fEqCZvMT0UicSkU5%9+wI-ve`&E(b{n7S|Io({}%vdsP)tn!=QXP-& zFI-K%$9#R+x~j>V>S}*wxOmqwuwrSEsUW4GeMyXUns1TvnXb?{0p9vsC@y)Q*kdi9 zoA+A#I757A6n)^=p=HMJjqUV@G&bdN)&;+no@UAwq3ScblYV^z9|!9~Ux(fbts62g zPzdN1cr`#9qzStk*(>^dYeo_4-u5dt(IK-R%d%*oFZ7&O;I%J+9P~T z`1c{z0*CwG_bc_A*$% zT8^3bm_61)M{^hNy6>p%yz1KR*7z2)`O2?UZB%Z>5%GcR8_U|VsFIl_T`TU}dkKB{ z3|*e_YvU5_MMa6%-?7Wmu5zk*x!vWeFE)gq;n!&D>K5ys!MD17njPwB=J!8I=5PE`1gTNji>eTy8GHUhE@JQ2d9OPsx~4jx!RMk&w{u3 zf3H`o>v(=F49R+t7IruGPUDAf-aNEcQ~VovGx}|G-;lSeq4pX1Co>*B`Q&Nns~Saf z?IG-M>V3M_+8-5deRu44%(<0$l@3d#LvWXSr~96I`}^X3*SxcY2h0&}j&hDNKv9D& z_l7&qSR>3QD?Jv*Io{V!v0a^}83F#uI)-;U>_1zYSl8PH=O{*0e8aET4AeYV)mP0? zOoU&VH*hr-E@eG_n(B>ev+5_!S?yf?defr7^5DT?gTqonlY%#!#u$FqexnZ7?lEi% zI2~3P<*crXYZS9SqE%2M?K$bMu_5J&lW!c!w21l7@Y z^t#H^a`vcQ_cEu`(cU${ zn=kBT_b5buuzDT5Uni-?t89EMe_7d3`JEz(OX8G@fBE0FA;v=i%R(=NH;FKXZ3r^? zU(?l8C-QfIGTSddXhy_^=&P~cNBJiBwzx0N-0W&Bay3*9o+N@l8aTzQj%GdUA;hZc-0`_X#e z^_#Fu^a{zom##+6QI0aZ%b{}@c>eS5^{(~S@m}{lbep_ugv+9V^Km@9Bb*Rh`aX5H za}IH&+uGR=IrBXW#nJ(x9GEydX;&OByXVbv1k%ccrUwOI)fdx>@^&7oXeeAE|16PTjtv>{4EY- zQkiQ^92>=aBu*4+cz3uvxSl)e!I!{7*9GrpaSAt-|3=kNbyZoxMho>llU=i%$6YDj zAZCK%U)2GPUOQc5Q14Zmxux6yE{$ue*r}|k+NV09nW`5JUH!V5nwXyWDg8KOlp$58 z)J@g>q#td#XB=dz^vi^UUW5I6nLaW7;`g~>w{E+pSY=W+V3Iu-?H8@N6@Ddyipoo> zm)|T)G!Jzs+%w#JJ;^?UcZF-e-DtgEnNo4EVq-;p^IqE=d#SynbG|FW?R2hjrMl0# z8+lrL3O)P0K5r{wmrzSc6JNp_Ef-RKR$nJL;V{Fa^K|r__au5#eVc?|gj}JosDZO} z4a7f%7_mTD>f7b(D(+x*vbz-r`Pu3aZIo80ZLd+N_o$XB*DFeuYJLiTR#l++ML)!l zZg^#!W}Ix;qnoGeq_3lYqC2ho*s#y|(lE=w8%G$|8U+2f##hEw22r1)3)A|mObU@H z^B#09bBwoMuRKy-S@uQw+46CfSK%wH(#?B&cn^3^xH$U=vrxXaY*%T6a+f*Gu5@g3 zt@DobG;r;6mO39e5*??Ub=<{nrRTJ#vA3hAg=dB5m3y9Noo}XK5dz=_Q3BIYnCm^{ zx!_83j&`NE+xk+){%{`U0ne%G!K?~mh6$^DUT>Umf^l;{@Y6J9+5!3<`YpOny49Ku zsxXy;@1QJF1Sn_osr(ex3(XLH7h||zPye!j(11CnJ;wd|UfM;f0^VOWSan*H2Ir01 z8YFBN0Ge>9VpSDs< z9rG~rKFcWcdUHElTgP@sbH_$!pnIvSr?Y{xzAM=^&w1II;J)Gh-0gAw>{fc~d9)s{ zx2f={7|twV?y~=~6PV?~*WRJnXsF+!KdNt~yP{pKYpqYv zpV5xecGJvIjpcj8>7q1Ecimt^L*s6PRaZyT7%uoM;)0n%p`}pao#k3>zXff|tXy6> z+MHm$Z;x{}bS`pjbQe0aZ0&5ftlw33EPq;F+ni+{W%1fW-RsaeGoFU65Ug)i4@_B`^O@!a*?@Vxde5xR=8>|IW;ti|`@ zhw>>(opPNbOp(H!RJ>6RRQ;iOuAQJ;r)#dwQ2z#F8Kg8SM=BffT~uw=Lo^e##oAUn zR<}yKNo&?Y;LrqMQ>H8x$uM4V9m8 zUo&aG4?W?|#}W4mF$?@&6rJJKAF?AvXfY{P6mYcJ~?>qoXrwtKc1+hbc_ z`(FDz#~1LsYn;1{yNCO^yOU?7d$MbW>zUi*`M|3dx-d)O{3*jU5qAsIeV==ed#`)@ z`ri2RgxO3KSeS7Ni!w#IiA!QPu;*9>^8<50;o)bhuW2fE0ft%7(p>d3euMIiVy&XD zawY$*>alvdw!W^TPNh4iU8MO>Ra^C(|CLYS=cw}4>okYd)z!0AXZWkir=VG@`a;!0 zy+wUm{grB~@~pz2i)W(56TU=mwmZYM7k;nwJSc6DaJLcMd zv!~k`hs73TQ`zoXwYC7;WP6G8fIHmN&$Hj7@qFQ2ZvV@kZLbI4#X`KF2^r#4W-fDC zY%COcBfT3u{_qP>j!!M-FpIee#YM$)Wf1?Ra<5{7qL<XPwI&UG4X5ynT~>j>F^<-02>LH_m&; zbIdc{Gs$z%J3vSg6PVAK95}(eOL*nm87_T3Tov!5$k^L^E;)#p^{$}`+OW{VIg z7=%nAihHHx)C;w@^j{dx>JDhys&~WJ`BlteWSgf* zF-3^+_4W9>16*~Tj~z#xr(MHgC0_G<3>U>d@*H(Hc9%GRcjz5n`$WeAM{lRa)gRiI z?9G5*2?{;g?oICL?wan_u;;w;y!3ALjSYV(*ukt-bO@gbO@tw^uRLZv z++$_9s_{gL`RmB8=j)nGZ6!%5Ln_?>AuoSD=rMkxls7w!`Nu&TG}cYZwolX8e6 zf}6%>vLCU@tc&|f*@my7TBT~B>cV$YW^!ZLMa*;YKI~#PAylj@s+p1OU3LVwfve6L zxra=t@VDf7ck_WtJG=Q# z-e#w>yP@<=Y%kW!zTnciPq^o7DQo2N*}2?L3bS$o-;-Ytd*>?USBjh5DXzBSn&Jbc zpo~yOs8W>o6fZdoa~x*DEHNI=)S9^`%6)tx--92d{EnNzG=yJ%jtbG@8F3vm41Ur4 zow155#UsKI-+5nx@HLF?NU zhPiW8oF{G&FG0C;AQ!~=#H-->|G?~Lny{g;QeP`Zf{kUBhqx@JwOHb7?)%zzKxo6f zV&^IH;a9YUuz%cAHdanhOy)jj55et_rQ!(jrua2@i?iYP<7M3UTz5`nSF^eB_g~7z z8KO?SD%2M$eJh2Qa8@~miRZS!FEtfxXEumgFD&*&`d)ie;XR8NmI!ZzK=`$7IGkIK zhcnCF#7W{-aUX;PW*_q-vj_IdufHQT;DhXV zHjxcrYr?#Lz}Dc}a9@H~xS!Rs^O=WmvidtX^W6wWHJRNB*Is+WI=#(qXP2_E>}#eG z+lIZ!Y-TRQy4)j97u$*&ShGFE^>F6fA8tn^K$)rHA7XE@NZ24u5_-WK*Hqy$oP53j zr?`XR7Egh=7;2OPZ@s?>JA?-?OA^FJQ0m9fgD1pv@h|aj@tC+)94oeix;GGC2$e!@ zaTwIf1G6cW$z+O|LgsJg3%LDs8?;^$*NF$k2)IAh0B*v64;CYe$%T{Xlf+=L8q{o; zSShlkC0&002?$Spv zMbHC_Mfe>V=EFqh0C*PRY$4F*!#AEE#Bt(mm^mN8srzJR8zVAv*`HxO+o6P$qC(s( zd?aiZnnMo^WsK|!n5(g@nYj+PG0;tn{Ge+*98?}KypgTYES z7h8(6V4a1+Um7^cR4}iZ-LRuHVa`I!my2`72{0NV%%{vjrjm(eb>J;chQ9TRx5a

RPkrH#n1&t`4Mvk^nT8~g}!PB_Z5b~ zh}3|)2^V1=6~lYpJh&%u7TVbn+A><)0(UPOK%eb^uoYIF5!UE-aSHS$+P7P9j-xG% z?KEZ~l-3UJ=)3`KE5%PB%of*x<$DIB+yMS=LLZ=3V~WKC;%9JwVln6_7rR3(HZwoL zT51RPJ~E)6_d`e(3t)aE0rnz%CmGKE%BFzL_?qp_mcgnih4!=so7@db_y=xh)P$3i zOTcFR#H?YyhQCYI4(Z zP65;g=H6p*BUr2@Q16}4r%mCnQ>|i-G5;~!q5h%J?$5>U;&{+<7-s53W+(LGf3U~R zh8g?{tj2P%^b4TB4vW{MF>#1^vnLeBDG2Ue)dBl}w-)i9UmV=6(!m_d7GJ>(@Q2%( zGhn7ZW(r`=mN5^Rz03;G-wswnB=Gs*Y(^6Nm54D=(h6wn1o+z#Eup82Kvn}~cVkw9 zwLA;zwdWt}H(lI)=hR!Cp?`xo7z_5m>8ZiD9Y;%PAjdiOQl&tc%MOegpY8&ja~ z7crl}TxbXyb&LgW@c2P%o57s_7;60m%#is2&4l^27@k>B*ZyEbgJ9)b;I5AndZh`} za}dmL{A(dof#Wlf`4X()bZGl9xIfbqR>&y$n<8IA-~S6U`4sF_^S~Y?Fm70{XP{Qc zq19!u(wab>CqY@`p!7!2$|ATSbOGkpZ{nZgA=sO*gAIBFPbRG2GMFO)a4!gN)i#E^ zKYol0?hfTbf4D^*^n54ys~iKM&s)GM3M&nw-At(G5Gb)P z^mTJ6w~lm=NDF=Lfc5VIi;w{0FdSz6Y8b1X%&)Lozk-qO1G6ttx*3PJp$wqAA@oEa z81L0EulK?nI|9~WC&1sq+rSv8OLNfdC*2EUp)Qf2w+_hQ-6gz(83il28l-q{6X#q4 zXw)+v7!f%12JJ0}c~JqW749Xuz!R(vvaMhq^@URFLM|9uD2mv|M3^%Jq`#js3`V9a zSVz3y-BW7y0(b{o1vOj=?U?{$*&Jq97>s=)%(wBd7Pmp2_rc!sIrK>zsEY~i#$m6u zgdSJ`a$8~5t^~;z(Bd+%nAczo^Px74L3$^>d*XdB{J)uS z%-e%Zf7th?LVte-b8|WKEtLBWjOsMN_6JV93El;CPK8;#p7~9x*(Tta40EzQtm`;v z7v7zWfZ8PicRy*C;$MoJ1hcsx>~5`~hw(0R11KMFP1lEUNr3)}fW8ieu}Xk`ZwkGH zcjcQw4@Q9%!+U=^SaacEF`9$cj!@rvz|DfUmk#Z^2DA7sK!q@d3h3Q1&=Un3BcLuO zkW|7L;!QdqP>nE0;-OT$+uab#!rR12P@6U|gNMM3qQA*F5!yQxW>+U@FW%;AO;y=6zh<{te3|1QFn-ywIqr5VQ^N@ZuflSZHk! zXi~$@fp-SoP#z2S2u)Id#zPzHK}+$*cp~uPU0b{{8x6Acz&hZF;$H}8D%CmwH7_VEfyWI!7^Aw&35S~E#7+RVRJx~Ze=qEGu z1ny=wz?Q*E$%Y<#0_EL@@DRc?C^r+Z#Os8*;$M)#dzE+(Q-s<(Kt~0Ph86l6g%7Z$ay8X*N8Eexh5Q z=-<4B-5l?8veLRhJE@b}<%0ge9Rz(WJG2r1ehuD6#qq+w{DL$qP~6h2#4%QZB>qJn z9`+s|@W?%y4_;dqw1ryp6nYl}j!+uZAZoqQ|zEfhj3O3*h#1t+`e${VD7!^wOdk( zefLyaZ`ga-cW0I0DfI}B`D3Y6 zTwjmg1!_53C>%c;MLDGr#WviAzPc^7g4%&2k3EI~M-+P#M-;>Dcbd@dQJbGa$v9#( z7O$Xgxe#)omY8Nk$OEfT47P#hy%kamtc`Lhl!0|9fd@ksrX0A7z&7ArYV04JV;FFj z;~GOdg7>L0;Jl>qz5(^ba1#QxOKuyr04X=#wE$a2mWVWBkI8ybH(7P$z_EM^Wv9V| zce&+2D~#qVjUKMWOliz;g#JISz5-6F>V5y-J3X@#+s!TuOC#N)Al-$^0ZOMR-MuWau*)ti8*JC~jsJP}_5OzMf6ixa=eg&+@x1SO-zV(pbJ)A* zvT0s*L9Ngqln7rFtss;A={&UbN7e0`u7~yxs)9nj8&60h$<;SQFQb-At@jdJ!#m%dPlp&dl8MLcSBo7`vi@mw?i98p&o$!pvRcvOgsm!g}-`bv?AOOJPLOX6t!Lh zTWAT-_Wu`r2etO|*k15EdN*7ZrHH**AuDK&#jKFrSyfc-qX2P6e7(Uk5$5xEd4B8bW5h-yIbDJb$q`2X=y#PfhGf(RlsMdXnh zO#V|NkWh>f97Rz=5a$kZWgL@UAlo6f2jYAnZXLz5qsVoL&4Hpu^THgl><}>n&w^z{ z%RqE5tWm)k6q`dmA8Qo314m#lj-hy8xD&+)qbuPEtka#b7X@cf9I-&$4jfNKy&_!| z*HxtqycgaMZ;B`Gf zv4L0}SjLp%sRiO~;3#Z^434=PO-+rih6o{u1Bkm&yb;7JK~2!}(3e4UG{i>>L~%j< z7K$1JSsh;?k#Y8X~Vmur=o8&8|oBQE+v7FT4+)2hUIMgV=D0EP?`Q4|9EW z+eb_diU|VgmZAtk28Rxd_#oJ-?x)y;6t@Fcz>*q81U&{nnnJFJgoQat-F^~5w#NZ1BGJ!ppQ@wLEEAJK}(<=XiXGni298hQ;1>~f$Gp1bPUBH z0(C*uBK26TgF3}mQz@cIh`LFXi`LP0L9-A?iH@T?5IqCcN@OLW`cJWyFs1w93hGsH zALnPgztc8ocN*V)AYq9>fPwmD4=AZj)+D?{TkmG z1-u)*8JqxZA@B!IK^&cWFHw9%enmn1L5o7q#0My{6>%u^W-Or>gEtTl zLu*AVC%#AR9h`vrAuUlqq3B~ZS#LsAH1rn~^f1~&%a|sye;^K8B9km|45GhL1YI>^ z8zc@j(i`nVq&bQOhhwmeBPfC$?Ln+M#IeJbXnWvlI75v`r^accE6{x?N*l$1!&!I_ zAe8h5cnhKrv<^CfB~T3fsSr&0j-DR1(G(=&iMb@8(JIjUgAb*i_|8mwFdYc zMcx9(Q+XoA=0((9U>Ry`Tvv6^2t>gJtx>5B^()BLY9T4Ryqe~K)}R-XUWi`F2KHAM zPzJ0KZ2=v?7NRyZrM|CH0QC7>Mg^!~D^Ue#5JYvLA3(=|?vT%>&#Kq422BK0?9E~N ziK@ksu7opCRDD9#Qg8>lvP!vVot_gE49}@jNYEdwVG7*?+6U1h(uxTMM?KIw>V@iv z=rh$G^b+81u4?^+>K{}IONc3q=)x*}qS(OrhALH3B@&`U#6Nf@r$7!N84Yq8Xb;J9 z;6Ef;+NvoJs19U4qAqBaXsINTQ%qj9T~h==iopwMQ|&3LmI2fhJ&t-L`a8weMW3Y@ zmWYu_@iKu0BK9TXZ&FN7#OXv)qv2AVQA8MR&TwBuy~Px9ND;#n5lfM49T86v`xLQG z5vdkSh`b706bdkAM4MIPyi)ElM04%T{)h%k8NeuNEae14{x9V7LR56bM@NpYZfu<* zxlx8s+DAFMkadf)k0KkF8cAKvS&A!Q8QH*aJPO5H56p2j$|FWgfvK9OOwCD#bv!pB z+je3FSU$z1rI@$0Mv-PP-Zl6%j`f^^~HQQUp`beb9HbA;e(@Mhs4a76rLb zrQV>+M6HP~gHnSk6J-XUi~K+8tm<)))IgPqGon4K+9%pN+h6{=e3XR?Y z=^9iT1$)qQh-<5Q5;!>NZ;;io1S!v4-Ro2>kG4P#02RkplIKYpgslQdI(jPlEiFOg zBE1Xi*p59UQP5goiv1){VjD>zw4|-RntHx^MQCqyx4<5{8r^{;R9YtLL2m*&qUs;& zGB}m#|7r!1z`@6epP|+QG=?Y*VHcn_SSS5nMG#b7U!_DOWvf&OIxA?9Du+X^!7||% zsxBXp=T*Hy)hp1JK%vl{0x}3%9_$jZJ7FuyAfQ_+?V@PDuw$SVqctNcFk%H`PImXE zYzg!Xe~K)O_{4}@+=TTPP&SHUjL6>TL$K3P3}wVsrrt(M&t(Vr>eciaDtp(xRGhI$?yp|0T$bhH{Nn&^W{e~AXG^cc?w8ch@$ zTU%AXAKnIUNYR~P83f%xOlYF@pc)jB8J09yhp>h^1$RJ1Wz@5}M6r@7?lHwX2BiRh z!S|wg!;m70T3`xV0SW;c0g0CoAJT5A)sXBAEskgbBy6A{B$25yIeL5mp+Q?mU!XpW zK7-x~ED*g8c!-MM@zsa{^ae;^q|+h)0rU*;b=Xcx10n4M+8eM+Sc{;=!Ip*sxq-3TEEJ{_>ZsAxIr2Y=E;N!p_tB?*t@xsqyGmM~>l zHBsoxKz4&ZNk!Eop;JOu140Gspa`Y$zaLN~v;@fIgdPW|wMx~&I}pPb+yzn^@g7h~ zlFZad#sTDkC?D+dXw}eCNOw_nH==T&Z|EoBys*oI^HL;o^f2@>*k;ve=p>1u&!VSN zOn3BfHP1jGe*no?khoNND-atWQWoS9%A-mW6y;5aw4`RBM@CZ0E{go3$Y(>jLE#So zzW`*sLEalR_b2k>AfqS#1KFSQ=OB9ya&=NZD#~qzTsxG5it_LbXKR!b3fX!na}TmW zAxj&k$oxYYpwxU%*n+%rYDOXC8A6sP${aL`ZKupbfm}_r{vO+-W^z)qCL#Y`AXgGH z9Z{YoY(qirC3r|+JLUMJbv3soG6G_mrttfq+?BK+*#Xt_D2pJnULyA;G7RDz%J@fj z!rA!aEXpg0IriZi_~Y8Nq+V5>t6P!hiLwb|j<>)&(c988*41su5v68&!t&_qbLeQw zY^By1<*T9^rzz?j*_}`*>lW2Fmhq(m`Sp;C>BYQwl;aEg>1(TV%6vyz#c&QXHqjLM z>!_6sWi3k0*h+buFhve0YGrD+Hmnb*Zi{G*$kasHXOWc_OMxs-*n@VA_B`;vR!zBX zk*V7C4Fh_Hnwx^C0j)#x2*@PRI7l{8 z^HV^+Xv_XB*>;i~pmqHJG7o7Ykdsu+kmLxgksO6}$QMMn)XWmlC?SOf3dtMfDW%G3 zP5z^Ol<9%8Kwz1uBc`fM0$SPV|0F<2Cdk-8G77RQsM#GT*8`}mS|Ftm-3`!TqREh1 zNah5U#ScB9@M+Wd572AQ&72$8l8%5YOkp93LNr~7) zIj(3grYbfBse_Iu%t*Zo*65F?RF8-JNp}n!M_0lzzy`_YpuSb$eO|Op;Qh%;M@yIz zBK2auk=%nl_@PdLPGU*54Psr*MMg3-z8o}SvW{R0Ul`@ZIplEq6RwU{Lv4w)Ptw^* z4}}(wRz|2gS!UFh8JI)#1mGpSF8`>5B({Yi%h_r~P9Kk$_Z<;8cVFAUAU0sFsH%~u<;7DX)yyp^;Rv`p|>WJp2@v|D67 zf&~faA=!q2JEQ%Rg$O+bx{zu^1`dS&r}9JeJMcil2B^;xpCfBpz`jeiH}Y)(cLPQM z`U1WN^pE(Lii{CmQn5CoV}uWYO9}tczyQ}Fda3#+fck;Sld>H`OlFnEb!O4>Lf3A9DsiaqLac9FXKQYQa z37)C)#uqsraWlew;Q0Yw7Qk&)q*vAIfhrM_jMhXP1$+iA4txXLLY2tSGSOB^nghiL zDvlPO%-XanEmBS|>MQ6e=s$!`5`D#(0MJoL#UvRAdNukq(H^1*ZI~2Kwv>PrPqIE) z8#*&Bp>wqj0!w5|Aw2?`MJJ|Hkj+G0Car^X6zD0)gaaG^<0G)%jp-@a3rv6ttwV1i z?FCb4InaRUuTGKK7Tb~OR^5kVdsY{kBjfFhX9uoBOW2D$(qFx@`XqE!9Mi4(I?$@< zy3ojQ4$l1Frzed}eH-kjcU0dCd+55j0=)rU6Yq>W&~pF|#DwIE9{VJ!WtmoSA!3ao{2mVQh(CEXQyhoPrpjgS_MJAy_F3= z%NuNtEtIRA@|jbnZpubZS-xo*dNzuhvzsz}Q{H+tAGey78`ul!_rP1;{tp2F4xs)C zg`u_gsu7ow|KTnwqJS}8zz~2f09T;A(rTV*%1S-D`UoHqSO-c$+p+xOHtfOG)cqsb z(POKxN(fE>%b@FEo$_SUd2}CoPE3I;5vuWaHL^kI2H_ioKOqA-Y5-^ja49vPIkKLs zwF-ob5DC;g<%}lG0bd1Q5SRlMLLPvx0b!#SfwqTsgg@Z~DoOx!pi6acMqelUDfE3< z5()1kt)46ikSs`gf~*7`ohS`y-l|LoxelBjk|c3*Xvu`#lN1Z9Ou&B&qeOt%gBF4_ zL)wO<4TPS2VIa3dy2qF{Nd9DbQ|(vAYEBD!46g|F7ogkVuF&3~MFlbilXnC8QGvUv zo($lw&J52*V2`_R}l^cOSk+-C;FqQ%{_vDn5r0Sp0WWgM z1ur7~@YBF(9w(ay3Te)yE2}y%JVg~YK8o5ONd=_aLN!lxh^kQI&clmgE}Ax#VNIOKBlT0+-ICLj$) zMeNYif#s=)A7ldH{*+&r$CyWy8&uH4f|E5Ig2>T~)G`N~C5k(xrC?fa{a9sS=0#2n`2-Iyf2UP{iJM_Q( zptJvbKK26@##Z$%put!t9!FLP+K(ep-mK=8gV<5TF9VztR64*-`(G`Vl}v^$%U9Hhz@s`NtiUzIdeen2uANhBn2=thjeh_W-4dHHqyFrq`D7t6zI#OQMYD$NtcEM zO`1KXIEv0g&!J`YN?1eoW_kwVs_OILSoKZt4*1g+Ts?4J`~S|yRusH5?ujKl`HS^{ zt58m8x-yP{<{x-M+K+Q+iE4q?)va_c-j<$;&ZnoMS|0850ks5*;^N~k^tugAZbTLVLYN?%U|sb+fY#KQ zQBB%H7#1O1z$M6QNkt(by^tqU05wy+5g^r&2OQ~WSOyAF>pvPzlp0hU=!9B;^TF#B zG7w=B*rIyv2Il0EPQIvwH<9f&gmp$B&) zM3}r+g=&nL(0cwq@lBo6Dq+gdy9qz}@1W{6Y>@-PUiA`T^}w=$&;w;5o(+Et!n+Ak zrx7MVV6cQE=~(Fg0R&y$hBJZJ(D9H8a1;=Gu^PLfYX+nRtkYHK48j&5hvGi8m;6Jp zhC)a^j>a+Sm2fnko1Tua3Dw>}cs+TY;OS5o*r)!;jsYtMw&O?0JnEOmtEpBJwf+gK z!rs7`7ksDx{eG(7DeN%#;`G(kFaDxW8T=f`r-r=9s6DB25VbdIi-eY_GC$fa+B4cR z^Z}BOFb(+kVF_N^)K6$6hicUV&QAWT=v(M-u$Q3+qK~3qs+P8Z&pHrB)o+4qc;vkZ zoCUfJNmGP;zi3%hZI9TdYD9#GVyb#afxfApU;$c3bdhK%QAw4~sx+G@G^jNwKcO|4 zlg}%7C$?b>s9AC4;Ej-d@!YD;@APsjCJs4T%G20KjPQ4 zjh+ZkrE*qq50yuQBfQ8>!CMF|CrlcMGq?jG&xA#Ts*@!ccotcGU$pXqdgBk91NrEw zh%&wweKW|!geB7wSwaGyWU5_-yikckV=Uc^$T27~wJS`ar@}5u$gyf8f)uY(UqX#R zYstSIM4@~(HhLjLrtYEpfGA78U%`@QanPa;j69|qKE1lU72uG&^47tsc1LW zapwTV#`6a3h4e;v+ZV^#fm09t_X@P*}1^Mp64e zwQux&6^*6-fu4gt)3&-dQ}03VqJEA339t3e)$+CK$pNnplGWjB4*iS#(1E`aMj6lq zApHYPRIx*74Qhd2MtX#*S6~ZiW55m7Keqg@9s&(c)!yLA1s@n3MSd`J1v*33W}veG zmBbwP#}xM_#0okh3N#t@S!oGRPj5gND50o$OSO=9jEZvw&@SjRz^I|KlHS^h)uK8s zfaXO1Ko5!jkq!)srfMaSP))ZWl~Ow+nuW1d;8SGnCEi8;^EFvJMQc^1O!A)xYCs%NwL!xMM*bk`h)43S zrrtn4A4K0^@dgq{W1LiaN4%IkX-Uq6tO+lAvYKIuWJ>Z0Aq)>zG?F;U-!b5AugU_L zLmq&H0QvJp?|bsVC+}Q3266@DP}LHLGXiTWLI}wN-j<-Xszgi2(KeD!0`dt_WE@S@ zIj~2Sfk}SB8hi|Z?F2j%=p4GTdJQ~NfXdUcI6^&&mO;Bn-X^r@McEs*0nUMKR6BSE zlGD}WP*;I{s4X0Ud#gMru!XpfdM55m&p_5qT*p?uO?@JqN%e_$QlFRR*oXSXocyKX zyF*9Om!W!4#}p7AM)efXA86DhNsa25N_Av3QGMc$v=3AA0U|#jtf|r~I0{Ly>Xi1; z$Zp_t0lo>&Q!Nr#b4Qgg5x*pk2|pm>StLJ$lhH^~I+Knf4Cs?QI}?!*}b<4>V0 z(5POF`l3ILw0l#n+p9a^(G93r}nry=^<~5F}Ye29m@&$aAF~*EW1{0o* zE5WB6F|)|0xriNs(P^d3LW(U#jGM!P48${!Z7*ZnP~er0x6yDJ3~7yIF$VF=WEksR zww+_~7t>ihz<3t9^p+CKj=9ZnP=Vz-%vIJZh>Nw3O>485xK%8oQ3=ba)t@`h;=Y7& zKz3WP*p!cy1}rn?R))2U%7@%dTGHpKy$8?>!DQ2 zb6A8!`0&0~{ly=$$b#2cWYF5&9@)X7aXw_RI|nnKSH@zkZdW!kju6WuM&%f8lzfc) zijPB}OdX0s@?A>1UnlC_Bsu_%=W_}#2;UxYK7N`CyKTsIu z-^t>vCbRg(zbMz41o0hrNaXo3e0%w2u3Ts%^-vB=X~JglsB*#hf#(Mn`ME-f5(fFl z$?f?Z!7WYTUQ_PM1Gqf-3vCBYT`^rW@h(1x+?T_-O+GhM%d7$`%+`}-{zkr`3Hk6n7 z)5JvKA3+wr<+q8+{2{rX{Dj}9=_q%WPf6pvW%6^wpV|USVtDi-s+hul*;Umhln<=+*;xb^-<{CVvKrK{V+vY{UIRB@-2ZrpxfjAp3MFTbx( z@eKEGmfzGlL?i#UX^-m$%WJ#WHAFi~w_94R>=X8T|594>A)3*~gGzgM3n@zbhUc;A zyk?hgqc7BG^S6=zFpl(H(R37^$dQ%P^(Kqk>oKxu%1*mRC;sW!!CNYR(wxyZ1fxQY*1-nZVm9@>M#pehen%UH|TL)pqb&^M6%-ftAnu+0CZ zWDYvd9rnJ@-Ow-bKJ@08O85iLaAB!(kz381lqI_Mni>8j@(0>e+!B8W?OA_qX@YKx zy#W;mODP`zlg+KV$SQd%N=5g{|?`iF0)3+Y2Z;0uhRLu1hONGCr>#mi$;rv`B zR}A5|_{V7G$VAE!TkmnoaWuZv3 zLUDO+vz(~~-l1HsU|`ZrM{xz0B6bkg3XFov4Y>)tQQJ|9kZKC6<@fvv!Yu7$`A220 zbb$Lyx+nKzE#J-ZIh~gO^o;g5*Vfd3CPn#r$;onxGD=e-)bnRado{aQ6xC0SQ*>W3 zO>U)ri{W*BnxU@tiLRe%yScwUSO2N0SU1gBWV~Q#WvHz?ug^5b8rJIzjq5cce_U9l z=`7j2oBSs{UsYWz-&uaJtakC$g2a+#h1>GK&cFElM3K4ZWWl^5ds(|mebq8&6Ym25 z4yBGTOW(BCFs;L5t`5ygS)V(|g=Go$|`PnRmyeY`AqIWn1dB)Q|5Ec%*qUJ8wea zf#Q_%&YrsBKw+cthIvKMCR>jESjfS!&C!oz+>ud{DKWbfqH2~VT}<-U%1B;Z=Suwx zjZ2%P#@#i)Y5g*GM(B9sG5rtxlnSnRS8-&CRMhRc@OW=(bn2q}k!hRnSW=?z9(~a4 zZu#A&kBrYw75-TIq^!8Ihu12XYBS9TtcxA?;9k}&TZ<4SL>v5veZO6BbP4ta4-E^C zS{V07;?Y{2lKa;^*C4t1)Yh*zDh}W3_?G3I++o+*Y8c`?!3E~L7WvN#-p^f}_Qj2R zSAExhxW4ep;Y(Mq9lhD&X0uz6;D{a^r>*mI!WU7U>{fYl;nJMHvJYkdkaanA(}lCA-#TqP)BMcE(_PNoxp?kc z>l=x;jcJbj>&_igbMAHRAEy1muf}#v5^6U~dO7~}$Qj{zVWWe4S(fPb^7XlL`8#Qi zv_{j~b|~U#)UcSLiQVcuT0eX3Uib1A0~12x`y`u_FC-*J&Cxz6eVEfGJ1;XV^cKq zdMWwC8aZKml@SFEvgc%My8nA>^Q++}bB~TYyyIZV;h9Izo-|%|-|T&7`GXCa<4Q;H zzXe?m85eOQ@=i>7%?)+`s-IJ5a}8retKgB=-}LpBFWqx1r3!8Nccnj;?RAclW*E`a~gP0zh#sXaRGkUpy*Cq44P?VHW6+b_lcz4osa zySD9)+B^8bzGJrYOK#Lj{ro}WtPe`oYK{kYh|G!EU*l-v*xK(kxZHSZ!!@<aps+jeq&meH}2Ky ztCwmfHH+B79m@SG?T6d%Urstd_~es)=YA{yb=mKYcMJP_{oVJ%%9|hEyPwhGc~igM zk{Q+`?t@ytBrmG7ut9^yx<-cj+N7}&R_kbesWiehxqMB*(x=~L?ar>s4J(Ott`?^o zGb83EJ!tfI+kxFH-@H5W)$vV7HR&;>S)1nBEe_US5*?f4ti>Y}j;!e*;h)`q$=nwH%NM`DweRSmi62Fow&dxNbF`n7G|8OvVE2tP=SQC^IXWLHa%r#SN$5Y}#ZlW5wj>{`$I>9ywj>lp-4Cu2w99aUui@)cb-OID zsO$5~&-WLZD|UGd@^P-4VP>#1W`FIXMqG>3cEW4#bT{={-QCn~R^#aUN9&wV*dE?q zJFCK#D`n1l_*rWE>kZFrJsx@_@#qhKZ#jA3RKmH0t2=IgbwBO#kis848cj0G>C-+) zA8L!;l30;AJpT2l;IJjZ%N#+r!Nvk^w!bFJef7-kb^Yf4)Aze1E3aw{#;4Y|!k)y) ziO1@2jixkh-f~vE#U1Lkh^?EJ@OO=rgxN6r&NS%<;j^?&q)=f62&2M>M zpU2&j4N7-@3ExflfMpRV)ppc(Fgfh+h5j5iC9;0(*0}JRuDbmjjBS)$FQn%An9~uf zqKa7V*k(a9`KRuNm0g`%T|3K%Lb zK_@M4(=*Gj_BPhHgZ~WsBXnBK-Gqwh4w0!bTWkClcPl(Jc&24caGlUj<_R3{Z|l{2 zp1W67TqqitH!C~h>B6Te&#pY}m)Z8wCyzR0{hGZtCp~xKb6rutvOSe6oEGm%|8;(W zc8X>S_qOhBvo@%1kXbiR`!gSEUmJYc^pxe*_}(!!Z8 z*TS5^kq$YmUCbvTnf8GpgCnv-&ND^1sa|hbYRJ_tmlHidI+wcEyQ5sO6)|P&iu3Zj zJnvo-UGaCx%=QXF<+sb!P$v1s2F0R<^w91Eq zj_AMF#Bd9Q*4$X-p%5Qpa5S<`)Mg1E^3%=jBkLQ-25C(ZhIe(N`6O$0$SuPF!`FNb zIYd}%YG)7Ad!=9eQ~ZfKopFrLq9l87dG2v7l#f^r3!`EZJGweJ-Oh%JR&4A&UiD^W zth1YUkIU+9QIg}DT$NsV#rLf*!s99WR;tVQc5n3W7qXdznBe`^^s2E?V-ZFg&q-IM z29}YA*``{CwPKiNsL3KM)+T9dSW4s}uAOo>N48<6Z?1eux6M?`Kb|iS(hKFDYeItc zH%)|Qing!jfNqa}9v2++mGp&@tNTgs5NBqj-K&nhGM z5^V`TM;|1#^mD?W0xyKKe1`GvalRa56YhxjXU%Mf==)3z=0D-zwH))ean~>wXq=Kk zK5Sd9(Ur0cWh{4GyzegmhIW-)>c1)$@GJfA3C;K%i=+5a`3Bo?p@bWxyyN#({9v4A z>!}Lwio^FD)@t8b`Tn zimffTy)VmK&27c=Iz^XO_NMLz%VW{gtPvKPA3nQhbl7isk8^3d8A3nrNNopQLtlHp zXpFas?yde9@8_DXnk=!mX_#=OvZnMY-`bF%dE`&f{p)JR4Hs*(Y)UI!k>+huh3B9p zLwl-di?&%dOYisI`r1m} zkJ@j!2I5X#Mi3wb4P)A)N9n2dB&MrSJcz#4L^(h z-9IXJ^Htvnv$wpPU^cIDy;dF<)5m2?hjXHnuiK;8NfVKUep+tB}9r+a=Gj9`>#`cjbS|`qKKL?c=KJ!rP_><>tyW!nWwM{>QF8 zQn?&1YBW>K^ObDZAnvhoj62k?u{Gm&`V+MozAj3>ztC&czQnTO9(TT0-crMhO$^D} zclnb_n-T+e$~4MbUtXij@ry#0Zyq<=^0I%mZ;EM$lqhXBDE>K83nfm|Sy*fkedj#O z{BK*nHjQzu<9RVfc!`fxP8$jh8D(FVFA8d5dY~-QXSzcwvNZc0$=nI<8)da;f>cZD z5Y#|Z;{L^3rR(O~QuVj(iQZJ+*lkpT<#C!;MnN2@lzY=WV>G$?iP}ZpEdLa4G0VPl zm1&J{%R7BfBo|)xN?K909jZ@p6U+LV*e{I_A`%>9r4puDQ z@8p_XZ{{zUs%<9BkiYWpc_Pxy?@|Sv+XcMI#{Ks-5VS{G2X9vHJUn=Ku zHLaUHzg6AR1e-mY&YrIfJ$cTV<-Tg(6XbLCl@=IBi(c0|#(#uJahh<{XyO0#R{48r zmMNd>|8(CF3uV85uKpAMcKvWUsa&VrFh=>0$_;e$D?Of0MuQxyFw{sqEw7i?iJ9_v z!w6Bs^7|}S>M_)QsdUJHS8Hb&$|~4jNDRllHbo4Xw&&4%-9#9pJ!;Q`_7PROwgV%UShe}BF&;HT{p*ci^=_w#-9z_ z&F6&?dW+#OpU=Og8>K(Z=PQq-)$(lVuD7oAo!G=v;Y@cAa<8lWy24sjt7^D&VcFr5 zK^4;~QmS}QSJ#U2?5eLS>iQMIC@t{T@&Bqhr0K#(=)W=7;5%tgIzk*<^$+cF)*j|A zrt(l%RDyM@wO4Rt$Yk4z$oC?q2agYa;J6x;Zyaj5<)~|{%YDrElEU0$TuXf&JcFuq z<%bF{6zkxPrl9>gh85yx+>j6LpS4_CcSB;VT19uX}Yl~%W8bq+{aSa zGTZu%BR6bJ_&X8y=$di6YCKI`S^61M7D``wdbk(5go@Dx zx|}+hrpLoGLNo5BJ0I3~(BS^2w6OH;k7s2&@@E!|EIL;9tg5|ty>y)~)^Vn0#yW;a z#!Z%D%fIFf^T)yOqu%(Yd4+XFa7g%!$jwo&#J->KS*=<1>Nk3) z&fvHPvDq=bBE-3k=doMKgjeA$_-MrW9 zQAO5{9CN`xB_qn}SFQJdrySAzY!aARcuUY(OJUI4_Ez@#LEDX&4Q2WS{g1jbeK*58 zqt6&=USj#wJ|T2n#JT7R30bv!)a}(!YA`b?J8ou;OEn52Bf`tAUA58jVqb3g55-kQ z+jDwl?0TTN*XYiU)b)1;-g@U&-#acA$h*^{lbOHe3@SWQ*0*A~tE+rT^VEFLrgIFk zPj|Fq2D9+cJt1f9S1p3M&^W^Ivtg~lWw>WpV>)2g*iMEF4f`w79lJ8|VA6nk$xSM2 z_KzMI_fAbQvVZu_klLmUp&jE$Kb1_as3`a-Gcmo+gM`$$JLm7XZtT8&Fm=W4v|Ih} zpUdd+)L8IK;k(7_s$BkexTXxDIcL9OZ|iUe-w53okr!?WS#29`O*KC-rWr4oW|;39 ziw&=vb_MN;U%q*lc%`u%fm6%Rgy4n{6`$7|sJHaZ-}!B=oxmf!oCE%WHZf@5aLW5;Ft2aYq=-R2yN$#y>|KWMM@)1VdB??P&XbqcQ$)gg9L+$-_% ziPMsH$GF3fhkqN95t0>BWItp&qQ9%@A*Ohed}Ypgr9+A)=jpTKv-qr$>FXc;ncnQ- zKlkQ8SeV}b@h4A9au(&Tcy21~R=^X!N?4hBd|v(>?2}w%XR&w!!wepeYuu z?YVWjwSg_s7He%|ZxlQv%LyN^T?s3jG<*yb`EYLsyGslv1D94rECTnxn#;l!BlX7hN`uvoFzl*n&t}B1j zwc0mY+QxLsKX|XEpT4DmH=HxgHAS0_8RJb~vdrpG^YPM-tX|`*3X+P2~)Na%-)=e=L8<(1onT}d6GpbeFHre)#{kbjQmSo*; zX>Pp{^ojMTb*=R^%Og{v!D`s5+o^T&&y}rGcb20s; zt>x1yvdVv~_@#1UReV*MtHSlfy@O>1@8;Ryo9E;F+x+q38ZlWMC-z}^(6hw}oKMbG zu5fP%2l)mXhxQ|#Nhj;a8oY*hQ-R5E>R`EPnH1y*nje%HG~P1Zl4iD9D$IM$pPNEV zdgEjLcHPg~4Vu@404{hR%(#ebyMEH~dIW}9ro`}sS<0Zk94 z87$M~=sfzj42_Mmj4>v!@h6kOvf#dC=FR&|3rzz|yNp|n%Z!hiF8okGP`^i4TQ^DT z(OebQ@f*4KluhzsDMZ@iZ|Wb*GV~UE9x{GzaBpPz!&_ly3&#Ys{l*(b}<)x+Q`p6Fvg))AwOw?tvfR64bjkYK`hNP| z`dj)F`UCpQ`l0$k`UU!)`dIx|mLW7<`;+!-ZHV@{X1~Uu`BsP(X7Jtloy_uho@MSl z#`47Om*S*D;(Ov%|75@5-|K7a8{~WHwfSoMO1+JIeSIJM&N2SJmDSER@u=8NIwF-w zNy;TTmV3->k*ByvEKBOU{58ISZy;3hjRcA1Cmk=05^4%Q{&gWqm@G^a4hXx2UxZ7- zCSi}TKu8hx3x5c+S)SIWESu?W{$qYLpU3^q{NRu+a|B#xntfqZgj?x2inOr4X6+wARX|2prdMQm`2oDbnfdk12c`|n zl6itJ}jb+Z8!SWm4 zm2>5T@)q`dljQO8XYwxjhJ07R?h9l?Q*KJ5SpVKG_fcB1oH0Mjd$@UW zN4_WXKsd$T)xno5gdkLTv| z1xf_}DXXy)N^jwSGK6o!-{*c+*0J}$$WK>#^6xT=(3x*5iu@(H6W5F7N^K~8r_`1P zDSt}}Hh1y-^1dQeINvLJ$bisiaRXCDfJj_X~=n)pF=MD>eE?Y>BP@eKH#s4 zclnXhHRiQ(NAAQwmIkt~@)fsHIU-Hv6QyPXFRc~UNTc`_(yKxyvnx;J)1|AdF80d@ z`DV-}zd#dKwv?n-UB?Ltc>Ojs|+DKT=2F4upL8^&kL^|*LOHFD$%mfv@`kSeV9 z*A~kBtEK7ked(+m%F+p76T8m3(QBMJjDIPvxZ=k65Y<5H50$P+UtTF+QKraKrAIO+t&#s>6u!53MaWdnaDU6+^DSAP>AFgsb_SD! zj!4^uwfuc;iQGq+$1jxc3x9HU=B=?@oU6C;AMj<$FRU&@g-Z6mHug>nSF;!{KJ>f?9b;3cG zJG`;Ku~5Q?3so$K`ExE>`B9s%{KYuX1BN`6XpRa?n0FU1{3w=dnzDX&f@SA*@O>Da z8>ab^TQ2wJ8%gJwht(eT4H~mdnP2ngrFd?+q-Xt`aa-BKbygP1F`^_nt>32YtevV$=NIYT zHQJ44V`IZ1-2m-LChdo6Cu%~4AuP9ds8lAtE6(*d@o#XSb^qnoS6*-yy4qL%SQT5< zrt+)G1C?Xl{oJL#9o} zJI^==dEXSTDhGvV-EW4y=FJw1Sz|U?8U_upwhn4#oo8)o{oI;jebw#=iw`$MZVgY0 znHN(U*3Uk`anZ5MmTK;7`q^+)H$~G~Tfbe_nED5O5@Zc3vn;h=^fIL>s#;w6A?oklA#^cvoxCydu5qnpxT26&?t28BMeLKB>r>l<{U}!)F6?Bl5o~Y+qhbndFZ3PL*EMtTMH=WLO&8 zS~)b12kcEYgk*#q4L)LXS?k*Ep}oQ$h5sA5fW7DJm}@nJnkyr}3BF}7b>uPaud%VA zE`{GH-*mPqE3POmcNHzpkIj4Xbm8Ou8GX__XSB?U%4(dkIQ_jRh1rRDZx?=3*1qz* z)9f+$2lE?@{ewcSjqGde#rARbPQimidxy0R+v8|td)4+zNZ0Vuk=GRstVno_=32942ib+)CB+{|mdL(Fv z{d(x7h^bL^V!Os0Ya}EJwPG56ka#uR>NpTS-cfFqET@g{Y39nkohu7FltxsAl?;FO z?vwNkecJT^`Mh_@-13hrTDk}O`w0sz{e#PGiuIu5 zlaL=mmWIuUXcO)TJz_7i>9Y_{0jg)U_% zYx{`#VfBKySSFhX*qep+4UVt|1&y+G4OT)5qCco%uk}Gv_d0JRH;Y;u{%6#OH5P|W z4C`#2VSLD}y@{UbRq3AlRlnr5e=;Cbo9;}TnzrQb@H^e_u1JZ!QR{ZEN82*DJbC?@ zKDVHtR{3{shd4=BX-P59GUi&k1b-P87x_cPXQAhVFF6)j##@#;(t_Jsr zcZQA*zaEttZ%%kKp>Lgk8~z!;Hp(BhEB>$W-y@cW?6#yD=4yxd>Q;X5+2CGPxb$gE z)=!U$@Bhv`;=a6Hac4lvx@&8%uX#|G@mXfr(|ga(HwMM#U_1`&~wU1MK~HzZ$f_&jNT zzYr9fI zAJ@(tn7RH*x7_+grpkZZCq$3-mSLK1h5nQ^Ayf{17}_%Ub^A6)1IIS&6syOP6;#{s zn^tF7VoEc|1bKtD*!Klb46{Y7id&!LsdKHKH@1FM@5m1m?#6VFi4RY9{AFsVTcw=$ z|0A#RhnE-RTzXoR*+1jhqx)$QcT4YN+%nu~b#vJLK^e_5>OXG#q)e6_;AH3pYx@Z&dOhr`*U{ttenTo zA8x+;Tk6U?{cjCR+4dkf-SFt|^mj5X&)PjdT6VN@x%(?=8bc1!G#41MHq%~iyI~Cu zYGL1En`QM{HFmA#yk2K;8VgLnT5g-Oj8W#dY|)NJA>AXI#Y~F59_NfdmQ*{=7~_Z> z74ucZZxQ!G2HIO&PMDYKki~noyw!88Tvu9FkdRk1SIGV_V{m%aqsRxYd$-esjLsPa zkDq03dh%h;rNVzoJ}95#+U?!z?I>;I)3mn@Ri@^~@rHG#8kVJ|S1s2pPtECudPc4B zfN_`QnWcgGzG;J{aZsl1>)?+=6C?f(dl0!c{Ezsk_&U*ZLbYLK46VExa?p`x?P1L@ z|DsJ08fqgnugOEaYn{f5&&!UKu(zL3CBwqpHw!)U`=;|SBg#`lf2jE4*pO%2UQO`jPH4Dn`< zX@Pl`*&Fn!b*9Z=@8M_|@;uBCJ~{gJ(6G>Bj#VK_ur>6r;LeV3tbMFg%!#J&jAe!y z+HTx-DbL%(J=RrF@m=ZaqGJX9^ZvL31zrm=RDzO$iNUtj-@VS(5olkR3+e#;DJ~qT@ z7wNV7vHED!7UnM_m`^w&t!cp>Lz{)n4T*I$2z@IgJhYqRl4FD2$?)AD%})&54ac-| znC?^Li}Mw`S5=*^xKZ|DDOZwFlu@{`s8{h@#p8>Ti^EIKmbNcHS3b3JeAVyHF0R+y zqr89l;>6|RuVOPv!=luzVmhf?31-ssAnu?tkBx@9$B>#)@$+*anW13=VWPQ^XYg=jG5b}-v6URyWr}oG8c8-&_KGu6dzgVW2ZW>bb z3$;$66F*lL{d&>pU+!7s=G_Bamz|ScN1VN!X|9g$L#__47M?5anV!8K+4GX;8*ioO z6VF1=Q_nc=>KWqQ&ioJl@iz2z^y&Pq#gF{6#BF|^++K>5pULmA zu?}1L6eW+h2rD()G%l^EU7?TD4`Bmq+MDVyj(^{L&pajQ2aC=6+;WJ?e#a~>^KSES zb6c~^_=a(yVZMH-?zVP`W~*T0qqy7hOY#V5uxJ%)`aQlh?_=*;??>Kio>#qZc)EI$ zJl)-g-HqJuxSg)eu7<8qS4~%r^J~{4*L;`Gy}~ulUBP@;{GP?k7pSv;j5uAak_5S% zlEB7|NX+Bi%4hJ8nXh`ha7dUaysaq^-q4QGysv#(yFt4}Tc$gyE77mhXY2C}g7LUf zYuad9Z^|}ZV$$P7lVloiT5eisj5U5~@G+EjxUQA9rKYBk#icOB;(+v*xRVV@?cf{9 z5aM~B0=LWE!+pa2uWPxxrMrz==W)8<@sztOJSJ~@?<4kBZG2;V8NQ1?lYgOqqu(L+ z6B~&>vAZ-#dP5$~@V-vmXG#|LlzW-)AoLN2Yj$b!G<&rpwT*NKbQ5%f{#CtCcUxy- zC~=yuP`6PxT6a@hQy0eSpV#i!E@f@Mu4WIjKs*rs6_zrL^Z|dEZ^6IMFXePh2X`w~ zawFwcWrF;T948ktWVWUhEor3`ai_SM)qb$Jmtp9mfw*@hDr`qMzE1pHyJi|kLgQ)bA1IHA1|EYck&uxK0iR{&c_I2_|xp( zz4;pqBU{E_2#C$ zU}YpjU3;>zn)wW6OW}at`M8m6q`@Z)f$qT#Q#LEpnMUbl2=`C&HTe~Wr$s9N$dBb^ z%6<0aedSZi9l0k%(znPt%3@_bL!7s;XjD@e22h`A;H?zW+QlhV&ivR3@td%=B*i0I7eyAMKP@LE_Xzp#!r;r;yWu-_`?iu z+{J&ww9*o}Bey|`;*PLv?o*UyN>|>he8DwhSnp6~n;FUdBhP0TbtadrjAdwRJ{vu= zlVOg1#eW!b^;}sc4_211?;-&{ANDGv8(l%kKcaG4}*IX!I=*S%3bbg|k!2irF zI-R+O%1l;M(ZVm%kD7f_xaOw(D|emK$OW38_xmI=%@Qb)T)KFw=| zSZ43=Y4hYX{*v+vzeah&tRh1g(psf_#2*mmNoAVW%2WSY;eBx+Cn$&HP28tSXMZDY zq<z?jU_Fjgfo#8_6mDcNvD%R^H(6%ARc)_y1VB3h1b{ZXFxfb~^3U z-3wGGZp9snySux)yK`~5P+TwWTHGm6cOUmjW+HF%ueY*VY9u+5uOsX)$AH1d?o z1#Oj!t^pO&S(3#2)9)D%8pcjyr(-)jr}!;A-H@5gUA6@6!2XAn(?_`B*iL2+%(z(Q z5dP95MJlk(fJwKYz7dCj<9LQ9FjH_Nw+kDKUtp4mLFiX_{x$^W!wa9xEChV^Fz`DU zkbjx4=pXJUc7r{MOv8RNC-L@l1AGZKjcx+-&kMOo+;;CHHj)dm(OeF4kw&=9h=HZp z4eTFu6d4_<1a(}m|NI1cNW}-!r7PXRA#g1EO_&_V2MnBYAZ4oET^>&@#-2zh>j3f>joNx>K5ld!wsf$$}Nt!RbtJ}+Cy2oCV& zg6aG`tOf4DY}f<1ZgwzXtlaaJo=JteU%CEqk&Xn%Yv)17ILBriX&-JIV(;OY>zHhR z;CyfY1;*1O)LUvB)yH$gQ_eI773(4{h3Sa?19M5pAApGP7vK|X#(#pF@n!txgkCUN zw2r??54_5C}^P3X}Wo*$pRJAy)Szw$cFHz@elIic+H7J>`Tut zvcGek?S=J@{is=6f3YsHF5YlJKfiuWEmikaZ#IuHx3&DSMA_%M_*7H65%ZND%=};x zESx9iWuuu$J8U`;2lJ~n+l$%Be55VzchpAENDX%UaP%Z2snt{q*Fmxey%bTPrPvta zt+0!zn27WcWB7oG&p~y*dSxs5AkjKu26CI8YJX|z zt4pgtQ!S`=7Jtp}RUj+4TJ)@NO3~S(9uJThR)?J;13azJ zdAxa&IK==TGQbczH!>#Hku*G|UAigVoX$((C*F+jkgy|aOi-=Y8S#DIW@JCv)VQH` zL&eIXF26-Ni+`ki`}HCH{riu@zNP-!`g>+BUc9Ylfbp(v3)!0M!&@%h<+aMUaln=! zE^tV&AY@Hw&!B^ThrJ%j2T3Erf6ocqU%WcKRf;IUK3T_t(%63$gReuIW z%{|addh?b^I(jek=R!2mxrt{}Ea~f-Rkw<57tvvFhuZdJYftjDm|L;SqZxlc@kd(a z_-M+hpI$Qk*Yj^tpMtXozDmq)^mbNu`m4aVm%l#G>tFV^vbJ`$-&ppe(D3J0PN$q{KYn~4_I=Nf zgL!$St!pT4GgC6D!cCHX-ktn%gUyk3@!J}iQ}(8JX_nj~vsFZ!MePP>gtXJN)HHb( zb6b2>GPuVIhyz5-+auz_j1FlhVR~ftp5Dq%Rj%alw@lSwo>OI zPj|sv)v7>22o?4yij2vP`xf^zwq10?&}iRkz#8KQ9-~;}*CeoMP^*x(A@hRg1{VZA^>_KDC=fm$yMioX+B+8O z8`efuaTV6mB1iNU=~zq_(^bwSOH%AmYm zIg@`S=IDQ%%TFyemR>EcDLYml;7o%jMG@!Xb@LjaDG%rsNCXVmbkJn`efA~P70Mp` ze8vK6c87C|=}Ya#in@w@Rng^XrFcnt$@*ed*}m#G+8w%B!xvL4C&ykV^5K2xsN}jb zL_NT-1kQGOKx)9IK;K|p(68Wgp^L&UhM$Of5Fe4WIjM7E?^r;GC8L#t)RBVMu6*se znpZUq>pz#~{x148>`%L&VZSyOo+}G48&Z0;%5Jby4Y7UL8%!te>hrIEi@l1A?>4`&n$7;>13v~?19^cT0u}^?hI)rh3Y!_;DQb6IV8Y3G-`J!8 zqxc`$Mz3_~F~(@N)jp{GRqL+GDQKRzAaDQg55MjgPAdEeSiAB^y{Jdq7nP+{XYe?2%Z))GW1U9waDxk zB)&ABh+iA?#;;b2DfHeiMC%#EJXIS}Pu4fCEGbMWSWqzKPvhLT#i5lyD(fn{)Ku%^ z$o@!AbRT9DrYSyn+tp+Is@37@L#kEEGWj04Q}_&->CPZa9idjaaZT;*isco3%a@g~ z#g|Igl+=}UsH&*V&}W&)*t$5^(?f~zfC`^m|)qa?NK)}R6P4JnZs1SYx6~#sN zj9L{_k?^@;cEj6=^TRKzbjowSzDf;o#5K!2L>r@PTd`LQEE+q`lYqse`p)6CxKy zX(AINo5Vg&P$Z=$pb1wKdNz!1)VG0m?EIhu${K~g@}+Pj^Tak#d#OrYwWU12AR~9= zZ{kP0AELbeMT(+^MPo`2R`oHaxYDVSoJ(1%z8`U}LHIfK)1EsX=stv0yFY8)Z zlRMy7@|UvDvvSV-iT^$H_x8N(qLk`|2CaFmqZ3nuZr}}2q-i?w_=9IZB5wPU|MpE6jQ1v#oEv}=^d!4{{$S;G*O)5_eZ1MYTIJd+xmd2 zvE~02Q@NTypL2clzWo`Jo0At@IJ_*ZIvPLg3vK3EDl9tdA=?bVhgv!XE^q3$+v0giZ(v%pogr5w3zDyw zAtylL(H3+ZHK4W1V(XYnM$a?_{OK57P5Z%`GJ>&y)^Qh;%VdHQ%fuSk0gy4W9Wazx z=rc47TZQ@J`|%XwBJqjvcp3b?{LB2q{P}=7e&Q|XF~nHn1Wsa2vA@_04J+{Z z>{F%%lT9z8L+EVJcF%6lTF*|;dCwuw9Z$6<5ZK+Dkfm`3a27QqU^I-3`3$(>GH`1( zq!siJPqya~sP#|5|0(w<=m2^g{e_NURzM)kOty%fz}OX1nzi;u^% zaXFDm3?h2MM@J%nVDS?CEZzrK<1BUt8;f~kH_>hAG*kgTw!NTF3qnXx-4#QwN-=kf zy9(JT54abAAG`p3;3;UUO1Sr+o=b%MsP2GZssX(Whm4gE+#7B`;0GNz18CMRuc}#P50w}zM z++Q3l05G#%@c#Q0FsI3I%+^o=U>WEbkAP}$3@Go~0j87&xlc!+9=!)tg1cc1!ayaa z0!m)9NTg&l~iJ*D!%Yd1-;S&*=z4k8@oo`@3(t>)d9Kn7+;&0F<>AU|_8QasJNz1{J6R=4@XWg;vF{!U56fmes6-#fE7V7nh46c-)IB2FQ}`QvdbYCh=3%a zNigfi0|K-Q`fUf&jhP1c)-I+G=$5)*ncNGQ>4VX4fN6c;t}`issG;0t(0>i&RzXG^ z&9p;DI0rAZIX0ZDrQOJ5>=#l6ipBXz z08b6tWD4Jfq+-p{PuOvE0M{EdHTBF-c<+sbE5Lz_X3wKZNLzL!yjQNr?z7{$$Cxko z9?bi3#r(Dl6HIv}^%Z0;&W%_l0@EvaFtW0;yrwa$h}qB#-BX*1F$k{Gsr8&c+L88SQ;>~x3Ww9DkfYddghNPXJ(55OVBWpu{$rGw6F-1tF{_Dk{5cm& z-(mE~0sJR@*4>vG0s7o9TH%RgG@zX-fj4;lLf}dFB}R67L3iS1nkI z8OWVQ*P_GOC~#jnxN+=67{@Po9hXS|;o^Y}+Q_8B$P5E*)JRZ_4FJt*8!i^>jQeoO zo-vF89Z!fs<=6#g_b+4)`jEW<*V5nWxQp;_#6fO0EdsS{BeVl@f>ywIR$_60t)_$4 z?Evb79Y8X19exM2owES*J&j!eCF(w89O}l4v2?)Vvp6rb1li9V;-+9`;0j)`H}NFM z!74*eV1tM%^dTsncM=7>aP$~p^0NVd9}75sd+=(!MaHrXKvUfmnE{;BLGZ$M#3msH z*kn8(55!M=p+@W)I*!@Ewgn%9u~zOHvx?Q@N3m`kAMpQv=plR|nhG3G71tWEfo@R@h_8W5LpO1IxsBk^ zypNv59wJ)6&RSzQ4L z$9b3;O&o}G>CeDIWHuosxs*dx3T))Gs@ui_-qfg^x>tHzt~x)LLJ zZ+V@uG~zeEN;p?C3ee#>{MW=FUJY*y9*f1{sl-04nmxj#0{3~BIm~QgF1aH-tDL>8 zAygYC+I7=$1deWU9&j$8X!k>EflKL{W9x0XZ69iPS?X--Tou4$&mps^mUIr%6c>Z4 zq5$q=Gl5OpgVzZJ;wbSLNxEc)XrS=1Fjewh)?3y?!hnDCqGXiRDH*Jc_c|wUBpW7n z^Z)Q?3-b6|@b5?`RL6w6mXTdu>s_149`<@mYs)m#MnjICGI(2P>tX8v+hkjYxv4qU zYPSm^r6iO3K^=xMpUg1M#;z)NTV^8HjF==)i3%i?=!;;2h%Zf*IV8b~RMm3tG0L?{ zKd-l-p|g2ERSi~uRj2yA_fmUZRMv|U_)mC|*nDO#xrm(XYHaz}tg+|XZRSAZe3RZB zW!`J*W!hsIZy#r!ZA!K*x9ZJ1jQ<%9n6FtwtS(!y%k9)U7m&&Be?3C(HW4Zi2slxq z)GjI!Ocd>rE|!m!7D>B$J@E=qT$Gn9pZXMP^86i|(tsgBHv?Mw2$fNaU7}dx7(U7K z5txoU<|6YRR~d&|V{L!Ag^!Nu)(e(lW-pVE@w}nZoNU==nrhx; zt8j$622zVWcen^_Atu9j6R84Rv_bG*kS`%+ePkbHxeB=#<8{>QgI9ugm}-#vkou*c zI>ApgY{SR&-8tbeXM`|cOUE`(0e?iE|ZTy|C{M{ zdaBtB{EnbX`distnXkxEE|L$HFI4RD>g2oEUl5!YG9btnP~~41kP^8w+8%r~=%uO% zf8?mFNYBR$zZRaW{A2uLtM>eayaAGqrH{Mao(MNi4Rnq$|EJT`vX!H&9@NC@wwn_i zVPq*4=?jIVH*$arkeoEo|>^S67Qp0H)QSdoXg~dyTisK<~ z!b@;KutQ{$Y*rpnTLSk*?2DcdTf&IO!d1I}s%5VJ)`KKS%Q>O4v@^eHj+1ISt-#etYW6s@#Qj1@1(l-usPuqq32N!{2x=I|f?bm_D0b#)0}1 zT3y|=I&0ll?PAj>XOZVFI|9~3y+AE~+OfxuJ6<_&y1%dy#6{s{Q7e%VwAC|+@1jU{)vzA8WAWC;RVg}8z+lI2f7ZL=jttW zTdMa||5Nv<{z(0ET^sWghnZ3`yHF)x$+uz*>*JZ?`ehqv5!w#B}ExI5Z;IlRObj<69M;ga86E~mSbZ+|a#5aD$f=Xv_Y3q+Kp1ymq z`&&2$_p1M;n`}vOyry~~ zX5z8nvS2Oo8tuz;bk*4ukRWApo^os1G58zaG=5Y5dZH`lgA$MywE}sM&EdC^{Px-( za3HEO>1LX-+0d4YTG*P#CzpmK%D%ait0KSdeIEB<;iH?c8h`ItbKawrJk~^oRfnDl zTI%B`K7~rCA6A`dlRj6wQ#-caQTMHGQ~e?Rc(b45l;=3w1~N5Y2<`ml_zXz?*kQ-5 zldN724LO5ujxHpA^RDq;5e@LK$XB@9b z+P;_^)hMFaswlefA?)eIN2=$(Z-4$?p?}JnWIY4&Lj1#41T9ug6#HUF-9FAUmN28z zkgvnF-Rd6KJglYb+vrDHhLKvfJx?Z@DsCi+7k0&DObpr5e#g4Py3~G?2o+lBY3(Wl7x+Jp{$z${G&>so0(e|9wg~)*<$#hZxdo^X z|A}O>*DuY9@Ky2ml1DZ1Z~n6R?50;5?@t;PcvEtPzEgK2XXcwTPntYopS5~doOfS$ z-`zr-rQQ^HJtQ@#uezIJj_?oYJ$ksh+OJz#W07`jU3vAODt*PS%I0+^j5+p!^l`jU zq>=xWg-R9)Z{Ww6Zj{Km)v?5R(6x)0k#`)Bj2HPFxnSN>V{r*7nZ1lzsJa;A6*=#&4v#z3W?(;liaVm%nd_ zCa9%vsaL8ri?0MvUq1ERHOksw-?2_tIi&1aab5A63byW(X&2cGbqcd(CqZ@DKoY?} zj@ftGXat`oZ=av0U?N=SRpbS(6~jQ z$+OY_xffI8$hFRoj;<~pwT9`0zTh2`U|x&VrT*JOawF-uK1tDywxraiwoQ>F7sZ!_ zU@9U1p8Z5+*6)p<-oGWYP47iH^(FV~&pEQV{(Mw2SvpUURcEm>1cl)kRu)e9|)$vJE&-klc&&Y@hKhrLGY(Gl2aSTnccy&-O35Jb!r zP<>oK9p4-!F2?N!M;Ir_lPbIh`S@zO1U(JA96d2%UBfOZ%hN(rN2D}NIue?pI>rC) z>{>k}@9mdYA2+`b{uuvre9?=lDB~z+x#t>|&dY+8!hUgASRMZ-EtNKufiebbz_xIm zFkP*iQkhU*T;8Q3zWRZ-n>p4INiOgdgA$BH4q-ouz5J%aAHr)Qt0+ylikFK0!+!QW zAUiqtI(^A{>LI-uc}A=eCP=FluY4r_5h4FZ_K91YG^x>l$@dy9Y2?#D5LM^@NRdGJ z*o&)Y73g!$e7*l^-?vr2V~RRgj?yhN&v*Uwn3(fu8=hQW0|Y& zG;%nslGf5Zz(qb269u87agtB+2Hx*{jX|>_%&`}f>KolozSQV^!#;_!h(yhEg_`H* zY@sbGpI&(LSI3|6zpmuAE*MoBS^cxV-q_!Ukz46U2=FcdH?cqK?{6P^g`-ZRQg;BcpY*zGApJ&HZuNU{FS)u*zXZN0{5wVN;`0? z>_RQCoG!@!BmccEZ+}5#iKXH~O|rI?F~jo7{+nW$PuK(gRS_!fA{B`Jgb42%QbA9k zzB-#YLT&3UAIt+xlML(icXhLM*YzKar!9LN*;FFC0c}R4@p}qd2rPUD|0Af9Y5r|N zH*nDT2_?d4VYT3eaFF=0^tj@_3e%{A7KUa+L2f2$UDW4jUDUHMNzfbLGqN~*H8sfG zynaN*h|+T*8POWIfjaau zyaP9OXObpIZ>z!7#n@CoUf;@~Frn6T`yuB&s-q{4{s+9NN$5HJJMWMnR}>}rCFvr) zB^f6V)cf)$OWGm0^`h)%=yoamos{1~x)d7A|%{9#c{|^Co0?zv%3A`B4&$qQotz<-lF&+~_4z+bQtu?&V z`DyooNA7fuutr?FxMpnaSnUIYzj=%8u2T&>vWKn&$H*H%Yd&IPd<1Z7%fZ3EnwjNs zkV9SdjyT6Udo%k!TLaq++iu$@TbUhq`BC#c{-DLYjb#(7`SpTNqWcoD?4A6yvc~I+ zcW<9g>M!bdzLkF4HSPVQ0zw16`!Die;$Pv{&S$I=BFhAq(5*}!)ya9^cGFU6>SgpZ z=(Vx+F?C$+tJ=$TVcHJ*lg54KZ`P;wE1>u9>yD=zvEx9IHXDy7E)lbco%nL>8ybS9 zAq#<1dIiZG8NnG%3Vgir(RK)sq@rVDvz>L5$^Wx zfsk~W1LdFE0%ICQZ>Jf09`grqjVgi&y(|q17mxGe~W*dKb^1QALa3Q!--3{8|#VP1y*i5@V3*r z5_SOlnMq`J&~DFC4-GESfo{b8A2peZr7Fp@TUPv5+`H z+$A0ncZe+F0I`@DMKmBP@hp5cV990JC2Stn2J^*OG#9-M9OpQ|R&9XXPk?NY9NPB5cIEA%zk9?);;3R=iCfdrZBObrvx4uw&^3p}?6M%o{|)Xjk7YsK{e25mJc z>vN&nM>}9ai;y_*8=OZAQ5zt0Qp|ytp?Sd9eh2>dJNgOIV;+N^|2Vn>`fVqA1ipTZ zK1ZLRPtj}e-8RUQ83~y#jZh)*09PTcr4i&o>;bjB3%G#e>^wG;ZOJxbV_{2zniS(9 z&E_!s066UmwiZ%tJgfwK`ON@99}K+mIM~Jl&Nu<)&}!}|XzKq~^cW3qV0VCNtOS*@ z4W8;eR0eMRNHhjM)TkCX;eC*OF11nl=LZXSHM z7c>B0pnW7KhVy6*Z%XZ;oqsD84+hqH*#D}sOold(2ZnL-|MS-)q2|lqI%BcG)#Jdc ze+H+>7O0~#6PzV|0DbNV8jYcFj5WY*zXG0D0BVQ^(E4tW|Iz{4_P4bvsOO^vtok*$ zGj4(6;u-f2v=8rqTdsqApucQI9Q1f^sJJ`{`g)mdzeGk9^Ps7&(8aQ}cIBIzr1CaB{pxE<+2nz$F5^fG$Rd!5IQu4mlNT zfj8d>V>TJ)Mjyn)wTE$Q4l_0iF|jMzdiEGxoBNo(Og&tmU4R*hWoS+D+AtSJY*>~ zWLI#VAlGIDa+$pg^Y|4wgHW^`u<}`G8a@;Ii60}r0-C&7@J$dRydfMfR)g1FCjBNG zFUOUGl=GDny#{(USGH6JDKX_Q*$c@eQ6xVXnE5a!jaGYV$wRJzjttvz%R19WquVgW zNSa=on_Ab}WcEt?0f(1U=9)^Lp>o|lXc^NQGO157qnT{xD)47ENT6GXUIabKAyAlD zfmI9VWeBE-mPnS$#wvDuHC4S;yEHF@*pNM8nh1Tw$jHl4Pr?=ijM2PN9Tm?8&NSSW zVTm=au6tkgy24(TUEI9zW}%_zW$E7Xtu-S3bn|h0cQVt1u%FQzz?0hew}iWdQ~5o> zGf>DBQ5B93)+=zkeh%%;B6BO5T%NDi%tob3Xk#I5ej6C=N6f2tJdGEA6OStGopGy z^{ASs^||^X#wivxsODFAF0seZJ^YrEGMQ5u?X%Ihi{_BOG9WT2F|>R5%ZS@i>ti&r zpQDyVjEWS6?e=Y|yeV;_Jo1Bil6F|Ny<%5s*OH#4$)z95GRu9-M^~+{cWB!gUpcP3 z_k&U{8}G?;@xMa4dQ09Fyc`nHUa?m^v)v<{7tB44g}R0HKJ^U%U1Id{rn{C{X8wM!_UCa7UwG(PD*7@oArWk9PqZxI=<79dw9J-HKC>Sq} zmfcaj@ILJGkGhF(A3tBs6#p}U$3p%MZxt0A^Cf0k%&3^=fQTRWoub?;?89U@t{6+| zbXA4rTT6GAx=WpGM?27%Yx_zqU^`+fc~Gg_x0CV#c-qRRxvrDXA$5C_7O` zRAg4xRz0irgFIQ6Dc^Cxt!Ja~(fl8v^?oWGE4Txw>m5+%yz(@4e<#~Gd)TwA*UWv4 z6Z9Ljs5U|;)Tf%x*uJ`GPbv2nGZD@Cv*5nt7Er>c;zhE9ie}!?YRY%1Mio#HSQPvt z^j)|i@>8@rrdRC7I5Kip@V|cHici=8a=ocVt-3t3SXI=mxW1&K>`djn>Yp{8>$hr8 z>5@%aTNg5tX@tGzSBuPIt2j>FS#TP!Mv@sLr6IpNDZAP>(0b7_)pSC?Kqu6V(!S6h zFwD2yar|;uaOuQ8!3~j3d_x>4ju1~3&k-M$?3TS&H1)>RfqwJ+!-D#R7(+LO*G7au zk2Q>*9@9N?WAGFW;`Ny4ardx>)hCsoFKSh&DJ&}bP^zjlR)4KqqT6P;WxQyvvW;@J zbZ=*e;rI9qyy*u>&WQR5a`0R(&%?MDJKEU>SRR@$nQKf=<6a|akQ?6VuNcOfaO)+< za<`n*Va0s0*jv(7GC@K}W{CsDPsFLx&GPYHTYNY_ZQ%Y;RYZ%Zw3vk06EU-6y2NNB zO(A*yS*k_iH(aUny%DXcEIC#Np7;7vr<{C3hN#;@J_U7IeKbx0ho(u6rb2vVk zKU~yB(o))3nlBMbMvH%onuz;Jl4Zq;{;B}K83A)cMulI9OpKPsw2Iyxy($U`zYwVP z-J_VtZ^|@xxb*X?Ta`8_8eG_*@IukLvbd_JwX=0;rdO5%o7M5gbsImJ|St+92) zHvU_|8^I_3S>hyG!Nj>Uods53^Dg5D!*s(*L#EN+lwej`23aNcSB~?p4({2^1f)6c z;%S6GMN)}Y5+H3O&6KW}M$5Lz+bV~7A5=H;FAj2t&5mjsdp)jy{Lc8!@vWk7g`CuE z^18_Xm$uj)`Y}}nC0RwyiZ&GvE%GWmRC&4DTz6J~#Q4M%V7+Yr>`bMG(Z!%Kaq^0V zi^Tq7m#~fCAui)CxYs+^SZjPs2b#XtXv=Ix-wW0jOe<_q^0d5Zb%XjQhGG-nnqrT2?gQqo#{Cksd9C1Cv0mMsm1N+Gx=gPAg&9%k{2Dd)d5NF(L^0S<^wy?{cmt7^~6F`w1%nt4edK;K; z8-IteLR2OGSF%G&$d1dl%lj#dyiTcF_KK4Ia{ z7y5`E2~GS)#3p13okDtSbIe-9XWb+1E$zR$MTTakDHh7+?|k4IN{Kzqz|DP)-H43D zMiEQ-Hespws&trqnW81=n@g3`z4E-0y?s>`K9_y18e5;D_gtGoU8NQaXUs zp)CoHH(P)R7YGjW6!;fTKo`1F>`%-dgHG2#w-z!Awi!+4{k9nAebVUOMt@;`vb#X9 zn2UTvgYdxw#d|Ec1lbaUr3Ynu!>IBHBX0~~Ab z=sZX+c2{|tG4nw=e2wc036Xcvxqu}vAeQjP@=rjG3O})rq=Pg|HeBK3^~QU%&ne$) z8Z>Z0@U+kuVQnL}M7kr7MFplT6p2(uC{$jLy{GxC@SUis^1l)&3DyQL3h5A99?FC?4f><$ zsdg)slD<5SQ@KOzMiZ-Vr*+j1t*xm&Ti3DvqV||R+!${9U|wKdVe4jJ;wX1!kbS5l z?$MCcyd5;%X3()W0gdDpra3*+{RI-}4UU!eHMV41k}c78+O`Wa${IMkyH=97s5&?8 z34q@Af;Z3C$VIdx;3vy*oY+8A5~;j{;2@9*5`;5FrQ&1Ko$|fPx!&D;NcAqiOn-fV zI*1os9^4@0Vn{)VD)_U%#kZ%bsr;qzGM>VIC4KGJ%>v^}-R=6B_2u=gv^TWxbY=RV zhCjw~(>3#Oi;uOft=vA;x!;vRA)Zn62quQz2kP_-%uV{3rCOeta_35yKY0;SD=ttIK#QFPdB*=T^VmULW56wrppCHmpqg8Tzr$M*5}uX!fiDyO zCmJh>ko}M^R%UwFsM@Qy`hN6tYWM;Efs&vVK@Wol2CobL7I;nbLVeWxt1LvQ!Mm~D zsHgVv7NyCl->6H`4cA@J{m>;r*4rY(bA#Bp#kj^a&O8Ik!(O*{aC(u2R8P-n+KcJV z1TzQeXP*1+`&1VB#8m?4{@L-`QRL7&+B;7=8E9#9vV=TJEpyNDjG-4YBiW`<9kv)* z0+|$NutadaG3%Z*8p>DSZH&X8uG97`N3=QU?Y6|MB-ib%SRjnPh_Wos5zvDaU(_@QzS@R1NoGea@+e_*VMP^}{raHKb;${|Eo) znlj%^pDeHG@>}A){Oj0Lc7-P&n6DW7T&uq&!o0IcnQueiYW2VBN$O!f3%xUy?d6=Lw`d-J74Cx;vwP@K?!M%H zXKTl8+Y)PM%M|l1(;!o^afDH6OgARLI=8v;w=v3e+_cZU!_wQzSk1Pl_GrfhnCoA80?khrrXS29p)l`e<1YPfv9e24t9 z+#-)r%urlYyj6TsbLD2o|JA;5Ueu+$K4sL`tovkWG~RHMLj!!*}C8GLN50N43ppXiV~ zOWm$5Ihwm z3v+}iqPC*NqQ{~#Q6X$jk+(QZ+(XCASLB9ShNUb+I6J0~#i8hiNOeuj`ndmv`=|~gIJ*Z`Kg6jqu2>u(+%94m_tk>HWMYV{RBRxDK7?c4@!uCh+(h|CK?eO{u@7mufqSu z*WexS=6DQnL0M4UISW#Wj-e+(6WtK~2(GiCkVjnzJ@p^po1FmD%;bDQ3x5P$ScBMC z%xY#RgEG76@pK@fw6YUD6@E5`UPJGMnpx+7GdM-RpgnXT0StR8px0^t z%U_R&V>Sf@KO3>a3=l!;G>#SlKXC)FY8K9+4ibL$a*rWf*$g$!I{>D?6O!0#;d(V9 z0!W|z1fGUyK-T{NetrZPj$?qK=fiOu0K(i8Fy(>&YmXh!=cj;1pM#9{6@Uak1?0X2 zxDX0zsRx6@F%i;-#M%T%`xS0IFiTT`*XRga2higOKt^{XPQ?i!oqige;Un-0hC({~ zAi%sQ0dJxOjGKi`3T#|^Xv+?`7oC7@2mH1Tq?rE!mfKz!CgSMXv)E;BRes9gJuN{7V3~ zp9H0^Z*RMD{Os$4`>D402FV6S5yDcEnyZ<*2p1|2I zgY^34Fh;SE9^VU`bHiZ%Oovuo1&;1M%!jW?9?XM6Xw8HFrQOej9+?e$Z44YnYv4W- zAh)S6%&aajDvL(7`-8Y`uBtpNC7XK6j-KS@Rbk8L5+zj@TmS|?}N|q2Kxb4 z^R0k&S`4hoCwO-0A@fW0zuB4t%)$xi?e)NDA@tQ2;9tH0Q)+}9dpo3o z--k1M4(`lzFa{5x&;NxC{Bdwbjo^HIfD^R>V*Ler?;qePuEQ+83~UJ>Mx-n3={Rr= zH(?K#kkiPj|1mig|I3z22M(hLFbmsZlvLoliiCZ|!wCKcj%PQV%WmLZw!{3*gMA@L zAaG27_csS>6HI{~7Q!9w25>-gxcR_}oQ99xaQp+%mKnf#^?*dP0np+Lz|4@~V{8j- z#ts;XzjI|S^nYWRD-Q5Oy@S743A2~r>cIIF4?N05*cZ+91V(H(oU<0%{{_b63-Sz9 z_bcJ(!+`y13vD(7tAZn9V9Y3Jy9Ks)FgH#??TDMe?EMQo+!JUeWY|NW9EU{r{%|MD zgg1i(E*|u}DO?OxqL>PO-V1)S0a&bs-~*inz0vM}y^;VmCcJ>H=m^f99Cice2erg( zkbw1_Jq3HsXZv#@;2o6#JCy?-OK|_dJ5vvE<^t;hz4ZycYr#UUAlnscSd3x)*m|ad zm9rM8#W9ePaPyeE%nafbjXAcswvo^2@62syKfoVt>_&VC_`^0sa!q&Ch=)L?m>XRV z_2MQG4E7jmEPO);a+`@bNc$g*;LI0DIe&+or8BUN^c_!AW*V~?DFFA|IPePg0v$mK z$}s+DI`EetAVvEXG69do>Nq17i8ljHi=FL>JOS@Q5~6{-%^hSTdJoG$y^&PzDxyI- zNb;&-Ho|C3rwceg>@)Wc)-Y+e~}5^2Ue?|B0nnM?Q~@Qmi7X6zZ` z2g;})Fji&YuO5Zp#r&}(&k%G!_;t?XXV_-kD5iifgtVicgo*o#critg>lB9F;wtGz z*kg1r>%#*7h@A$diJCJogU~bhSgsTap-(bbc%#sFh=OiQFNV5-_mKUbvCzW*j{2=Hw*e2&jF%sS0wU$cX#kP5zTemfb>*!A$BAd}TkF z*JKjX6!lUyynK=57b%syFEo`k2M^9ws?Q&%HxUNjPHmOq#Cya|F^F6!?35b9yR%Um z%Jn5WQ|Nh$e>#I?I&uvcLNpV1)8naQ>~#LQ+?#B~#fY7WI+=pFEG$HyyiPV+yv&wL zR_Z792-%?P;h25^hwGiX&FH;n3+<#=AWEGERqr#GNo=NLh%By!aE{nPFM&hljyM?e z!c3yb!ISGi+4{`xm3mVrM8L&_m&8x5n$b82(D0K5Irvf;T!u7~xFlY7z5$8fTQm!J zKQM0WTkaltNwV`7Njpb^95r9g@g9zbR72F63aEbUDt;$@jM^%Ovh(S5lIEWv-=qsX zv!|WoB^J)_0Lho1N-Se05-Ww)q_5zj_=%2>gN&yyL&G{kR>@ot2H5wI(`4htf&4W% zj5ol`_XzvhGgND`AvcZh!(1S}#9Q1Ot{>Hu{zJ^-)40i`H+_t+Wj`~nG;L+*z2bR# zA6d^aQ%Itk6Gxz-JBLbmoTGyDpd<18Oc(y9;mGEnBTZooR1hWN?{Fu-LZZQSVT`<1 z1kIn1rE_Gb$s6odeyYMTG zk9fkJBp1_H_|~YgbcQeemhg*SAcXL#P$kSXaaV`@l|Cf8_bd|C2u@9y5xT#cgnTneu=F9q% zx4ExKUHFgKK+P9AQm2U%R0oX1yW}3mh%vRDh7TCE-w56;>q&kUGN6e0O7$Y!3Kr1$ zen~F$VWAsw68@=SWM6ug=q(MF1xq{0j*^4y!w|R=JjjZF({eB$HGG94n{m`FBMfu_ znT5XBduFsGIEOG(c|^Z-#QBuFaOBR;C5mjJty^Jmr-&;&oq(hA@{W-co7`;nYb>S z$o~tkV>$V+w3>~9c8tJ^qbYNikKiW2+1Z#LF3#Z&kwx&tK8C~nrRYa_NY|kanu`pC zN75N4TvAACF#8rrFZq6y57AcYAxuN({Q)SXcX^9^1v!wNik?6TJ)2(7ZsvO`D#ZjT zj9*8ML%ynph$GL@Ixy%2B7kZk3l=Ai z;-OB=6n^JlGZST{qMT!xEO9IKMo1CV%wy3_cq_i7X`I1fr-u|n-zJ)KvEY{7MnXxH zvkUc(i5GjZo5f7zZ@m({g^p5BX1io(|B=ND!N}WrM|~oe3I3oSjGJy(Y_NIAm zH|B>LNhg~w?sG09qnYV+D&9NCnQqh&HW4$46MBj@QZRLt`Xs#LAJNXG#9g9{=tTZ2wj?AD zI~-ylbVVPfJaRUARe4k~7!jx8j;-TYVV+qn<%>O}?P4&|B9=n zlf*Mr6{17|IWd2U$nx5TV55<63@kJd^D&FuQ5NYlpgZuK~^mU_pdQ` zPtenQps9@!Z$i)WQ;dVp-h=Sw-@(`V3(tz5FqgVVAA%G98GRML)gM$hdO7n5s+aoA zB-vN^#^=yO7>7(omy)3}r)&bUZeNgJC3t}YwMQRy|+g@1~?kovmH0lmpR}V;(Y0tX}`t(uE`hhF-FP)6-sV>r{KO@@CbHii9$+(gTGBMO5*}q7MbV3t|gH zN|u&|l#D2SQ0c6mVu`fPvIU_BIUVyROEK~;iVD?mO}x%vIA<7Y?CN^WZNK{`_q`s2 zJjZ#@^I711$}7dYo6mHQe7C6{r_BotNA>S?nd;}tuJk;rQu@q2bVk*!sr|DmsM5Fe zSkak+j(KI-W!ah8p;^~6=44&WIhQ>($DX&kh%M$yyendA23R}QDOi^8Ewv|`Gd&f# zN>RO9`$o6h#bTW9%9=)*Z@7DS<#@(>w(uVB8|v53ccK40zl)xv=XAf{y==w;!*bW< z`YGxGD!nWNiBSc@JiDtkspd&#mr`BH$AUdMe`V>iuVtFEh>TY0?J~A!2j)J=@hVtb zGNq)T^s}Xly`F6iGNz|dy)YAfm2Xz<(f+MJpv%!UG`2GPxW<`!xwZ7z>-odun%7mY z^S(cPI`|j)xAk^&KkMDXzomOGL!hyT@qo^$;pGp=)kvexWglB_)IO}9P`al$sQ6;u z_N+&lT{3%Sl3A_O9jW&-m*wxw>y&e~AgeqNy!qtXRo`pAuP_x6bOaC(`&$NJ=Z`vl1eD8*h87PiOv}2Eu{rB;R(?iJ z`akKBSqE}HdeS`6 zT|(wX3y)MReByl``*(478rOS_4vaUi(vH$DGIY{^Reho7Vvl`8EOS1sJy5f*GONT~ zSW+|~Z(Qby^aGitnPFKCGPa}{vRXp%PvoC0<|@=Roh&-XHRn8}mTv%MgH@u%fF$aA zh7E@KE^^~X(+<-zQy23uv!DB4Zd*NU9?iX;dir|b^c&&%!1%lQobO1t?m8dM6Md~# zrFu>OA>G1S{+V-}rAKXP6;pPjFr(;f{^{&)ncp&vS;w>3Ol8L9%nNz#ii-1l7Pl!2 ztZr#N>BzUQWYy##Fuf@G8I?-=R7bj4UCLZq82g*rnPQM&kZ9iQHrj2Y2jN-cndUjt ztH9U8XPfIw(>CwUUfC{PG)tivWHcLP1Boq2$C}JV*<5O0R$nepD%w_b7QJU<)`Cp0 z%-GDl%=U6bzOD;>P?1tLyYm2 z>6*#x`q})JHj3>O{qM`gf?n z2MW`jg_e%B^Q)Jaoh;s3e4^laZoM3@tS(vma@OVkml>UvlJ`f^x1vrZ>&hxB&scAv zKeC7Ymv~Jbqh<16%CD*-%^0M~PSsyAl)HR(Icbb?{cMUfU2q-ccFJwDTMbfwzPM|= zo|@+(JvhmnWs2ASqbgNW>Wj*|%sQzd$Y0NpgFD0KZXv7U%BPmgN*5M63-0D+=guft zSg6jo96`Tt2WOt}4&k!%^j!$<|`O5J&B08l$sVqGC}CKd+gkOV^FimFwEO zNcx8^V_cdV4jHZ*eGR(|BMdK%Q%nO5BecsjPj#H0)}B!ulOI!@Qha0PQWHSR2oU4B z`_5~QDRpPiv+G!`ulB0iU4F8(ptQ97XhmeXz3f!Qn<{h7lG*^vSKBUon&S#v%Fl%M zpfhoUtfhRIQAp%kAZsK~R~(cTDDEl#L;qy3vPSVxDc7u0?^JY9durCHUaBr>QdLvb zd5Vw9dP=i$KN7XN$TjlCvf)et?L|K&3sHAFgdS!bw}g#xEVlQz2iE;<+iDHB##`L1 zi58``iFLX4wl%`m35g8>_RaPlj$=*_b{iYaE#ms|J%r65;A>G`szgU{6M2a22A<4p z^kO$Lv5XC=w?AZFpwPXLzm~fx97u{fu6Tz}fWjZYv&$*@9V7|3%62jdbP9Eynnx`l zt5D$_Db+yHo+{+>efSsX!wlh0v#D@7tb}Kvp_6g$bEq8i97?Ae|JDfKrPxjA*UW+j zcq!jocn95s9F?$X#5=6kT#+RECp-6JQ}C9Vj9+)+(}PK*3+eatBYGp< znogqbp)WOrBB(>;ek6jT*M?eeGmyVOqNW`HHvblo`t?|auM?IEvjww|!6zb5ql~|W z)Ph_-o9`eT6HW^kz%)B6#-hKjLZvMhRr)@tKOO`Vtq7gpMdT#19lBu0&`(-H9weXR z>mf31SK!}gU`5>(b?^3MD47SQOAfLNd%Hiz0f4O(vnYS}xGN?MCvM22L;QB|XQd>7Ts>F9ebLCtvy>dkw=olA$ZIz;*= zjzga5eUZYIxCZU~4^$&lp=Gc9UymJZyZ)$ScgJ3s#`#}DRka=56hn{|JOD`vr@)a{ z6LnCmKS%xi437E;ezt&0jtSRf66*INs@74cp6BDLYSF<^qlW8EJc7R71FSYTq8Ye5 zYw&j-;dpaUd+tpf$CV34n&>hd&0r*Hs)gED5N&ZiIrq5N9!#n1w%2Ax@(w5rUaRhiZHq7+rC*t|sgJWI}Z^Rp9C$xa`U>2(1 z>rtov4fpJ{*cA2Qsc^Nd7Dey^tKpEEjvDKnpImPxPSZRte}gv-f$F+(wwFvqEF3t@sID zqH9n_g^(rKo%jk*qVHkIfFp2%de!_UI+-O_Z1sZhlqdpOJZjztX2}V6oy*vb#(k{;rSbnYIb{aI&txT{wK0N)dm{1d}6rt zk~)FT+e*wCB2_5F3JoPK`Iq=eyaR{E6lvrCx|g6Yor03oE|!4$HW2&7Y0_2xCHkG; zcqic$&$FSzS>*RlrXGt0d?mS!P7vV60@qv9Wt>n94M;*`Sv$5he z!NSYo18eJ?DvTrTLY>o1+9duiGL&5$FVslx^bT$Zd4(4FcJTU+k)oMx#6alL57P;# zH5h0&MnEK1d#J;9ZR%cQPlHeW>khkkC-w zmT4sRkkuF3Q2)R?^+l zxt$u1Y>Q?fi8;`P&@v=>5!}%}B%{*O{ZLzR1^x8|Kac*21b`T!6D81{sr!7j7*2gA z&r-dKcl>aqwKhRoQ!HhrQboJ)Sj?5p5+c~641=t&4E`xQ1FPs3>|IF@c2+j=k5C_T zV<4`}CvpS5R7&FmiA^+%4pj&87^-dO#I`4uU(nY&K~+ z*tzG3V&_S*0sToh=3L2}Fzsh42v#?YhCxf+c*UXWIi?)(wdr2XV7E}G9GR#DH0 zrQ$v59N&fR*OQ2Y6ZppUIUWvUak7Y@9M$hB#Mo=jV~@{Tjv=T*6H{&)@&6t~l!0wdx&}sZ4&Pm^* zK+bgRl77mkQ61o;4xv=CtC$O7sMho`X|vd#7MP7<8{sPz!n7c#q0-xtbdbTq@6tzl z4_(VG2i>ZGss}Ib4q_A%oF*Vq^#eVDQt})4|Io7z;zjNX=D#GaivLa6LES(Na0LGa zV|xG`v1_T$#B1IP66X_gBd5SH=#4HR3+ZTNmJg%j zL8Uu`8mE@bXFAZa(hKS=lT3AkJIwholA9Y z;unah3bR+ZHE@lpxR-2e^f0Fjt$BA*g%uM4zGpp<&f-AL%OQI~L2^|}B}2%yP|j({ zU0_TOl?|gVLDP~+R>&e{da9Z>$*0ooX@{(%>^c1#eSqo31k-QnT)ab{QoX6(l3o@KALb+x^=e|0Rh@3!4`oOF_`n=_Kz%l=@O z2shD39E232QA9)f8*OAlz$H2&zpv=0+^=vbKB@Xb|6@^IQ{UD^X!a^Ip+kJE>7}}& zRI2wYzsTOp3zR*XcJRP)R3-gEoXksG$7;YJ^BANH7DcUf`@B`VdQLbKw)7pGZeZxC_xN?T#it494ootIt_)xLNo@gCw z-Bz1i8CGs9Synot_;!9)UPAt(g5tt61x@l^737x8DIZkvzT#!|OKX_p32PCiN*|~~ zroQ5+x`me3zSONlj@^2Lhat+i$n?h4(6!E3Wccao;pT1L>S}kL%Y}YD_)epDr=X2Cg*y=@H`;9$~#tR zECcL?T(G!<7|5h6qE-2-rOoGRlmc@wxj? z?^xf4ei;FK18?~)@s0Hx?DvoPipxfqA)3$3c}Z<=VRh7M%dX}3%=5@@mwx=$ft2$p zjelPGG5^=0^c`90IX(0Dmu#z^WK-IIXKzWHQBQlJT(0`1iPgqvCTRw044THOTzP$Y zE93^=WbV+5WzCd!Wna}fhmwd>+leQuK(9hs+5#Iun&L!VUTKF?BbwuXug07{_E85n&J0^>NQm+_Z z*-Ud-yAqW8{VsiVl`5TTvT}kv4vV9nVky?8qu?5SKxEL3<)_u#4P#wDx!Jsz1x^eN zX>_o0Y@@@Wg$>Sy%?e)Q`^dy;-zn~hI~`+cM(6*?IhJAj5tH=%Tfyi2&rK5+ep{I2 zlTwm?EZd`~dqrKXj{PYPp!1a{G&A*yhM&fn#$hfd{eA5LRa^N{YKFLn8}AIX&$2xP zU*?)UhYgeNQ8yGZ`b}>BK8*wWg}jJZ-n?IwOS=bAJDZMdxISWiu#Zoe{*}C$Fx>L4 zOp{mq%jd^m31uG~@5?@Xj#q!&{&`a3haX=vFBi=%pHQoJ{vzHgc4&IJRGJ*FN#>WP zt;P_8yKbPeE44;g%B`q-UemCux|}QzDxX=Qs5xwNV;$0WS(5IG`x*ZaAfxNw%D+tJ1kv#YFA0JZQNH1bv%HHcfUr11XzxC@* zPHEW?YlTx!w3YYN_!z>>gFVK(1)824X1EO2PLQWdXTJ*V~sL-u+ zY}E~mRF^A0mS56cc6ST3HqbYXYt_E(o(?;IbM5Zi?RnS#I?s#T6!3@lO!IkqUTs84 zNamEp`(KWID0=bgRoR>4uU~#pCVu@@lhLNoQ4wj)60U)Wc|kkEaL!1Yelu+|ywSB# z22gIoeP?CezcmL-WyLLv|HmJ>0LR{gGT*8W)<$eFu~$ZF+8b*}xSy^r|Shw5nj@Z<=PvncHJ(^}V?b_V8*>6qb!nb+-qaLG> zlM8D5m(0wH`{9!`G^zG$;J4jL=AZ1ZHn|xk9+j%vANDrrRHaOd?@Kt z7FSVSGshk#xD!caOId*G100askZj9phH2aA?0UO#mRp?H1pk!adl7|=i<|aorf9yP z)$Z1lnhg)=ttn)#2q&w;@|~%%Usr#uitqR_{PUyaoKS z(eBmUP-lTIc!F_}#VaZ_9StFFtgjT(zwx=IE1K<2*|O z2Svm;yW4V3t36RKTT4-8&AmdtX$G<@Yi$J!QaXIU{;Bls`gdm%RwRwgRF(6!32YBp zwR)=lFH?f4Odp^;#9SoKIaZ)w(yDMq-u~Qgxr_1)g=x53!z&Zef`QNit++;4HY)ytOqT77Mq*4*A`k=JEu zsFf+7m(C_?zNdUDk8hN)I%#T_tSZ#;MKH_uYToIO8O|I0bQ+mXv^uA;r4a;&U46Nj8slje^st(HzP8!m$PtZ>1^6i%Sx%PaWH0zJDCx6({{`cyrKt-7SFX<>BUk=*5ZZwg)& zuc*9Y*~h*kEOdQ&eZ?+tXG@t^U{c@VwzC7B{?4mhys$zFqTb5dtKYbEbGzrc$>&*M zQG>RP{%(@fXk+-GP(_HTUN>_9cfK?{pG=>Vy#8mqUmem5GA9)TReuuNs;;`UFg(>? z&@7NAk={aZ-OI|XqR8Cv>^r$>g#*g!S60__bqtrDGxOzJ+sx+t%kF%+aNG zNy`24F4dCxPu{Td!}d7(FPAf}uEq^6H#Fr;7jcfAtvp;XFWW1tc~;llrNt8~S6b__ zmC~QGrmF4g4~iggyB}hAve1!J_uM9{`(+=;H6TXFIw~6>Co04x%6#2D!eg$N(r-pR z|Inm}mJMa0V}oh}@A{c^ld1!<#SCrA-^u$^o~8et+o&YGx-tK|YKUu$hnKm(ev9IQ z$lJ54^NY6T{FiCV+?v%cFS0z?c9M@Fo5)?&+tv4!xl9V-4lUaT`v}`v%K__cdp_5J zSi$U9Zc|Uv?$XUM$jmp)tos%369H)<^TJw(Uk`r}x+6F?aJ7e4`chDm&Lp?~G9!6r zMr3YIVQ!T-=OaI1=Pj(j0JDgUbmbQ4>+#Q#=zlmY8DD`J;g6@c6f^jUorhmDbJ$Ua^{)*t>u=ubC zp&lW30t>ti>XkLIIZ>(gl6EC!r}$-mFS=0$%R9-b+n}2sWSXXSBR|)*gBe$g^H0gT zl(Vw%pYkczbYU+OqdcvWknk8quHtUm{cY`RjckuCw{5%FU(z7iIaQ9fpZ>kBu@-by z(2&0w>bq(@T>P&EtHS3td=ybX)Ex9*K!CAZtv2I+%HZVJ-v<1s&YDE6OS*&MH7h@Z9hO2NU)G^RJroR<5&a86mA^`%s$NYZ3#Myemk7ZAIgEp38zy>+4G zkfl@IDn6Q2%X@3OYI*Gh?PztB>WnfJnsmpg??d|DyN4-l5u5D7>DlaVaVQOxAlicCO;Z@%q z!>J2OSM6hUfB7nk5<58i*zzqtwqYPrzhQ%=mUNn;op!x0N*fQ4&oSnN{D>+>f7~tF zr+)Rhec<{hIYp;f4y<<|?|&mZ&P##j3+H4ROkO-cne-zxsJitToo@P284w zs8e(gU5@LOI#%tkY$~sl`78d`_A$$R=LF@4t!Xl+*`X#k!)62qdqhiBdDDKJ{5W)0z6478pkBFRKQ~LYcEng=&$puh;v))Q}ks zT_c-C5)Eh9Z|t{4-MHjvlJd*GPs6{QPkB-_#=>!{7*F+hQ%5h(z1#)bC~JeFks0y7 z;!~v5%emJ}d(_fw5;;@d+hwNSP3=uL;Gl=BI9oOptn9�m4-3sB(?&q>(j_a2cZ0 zDJN6WP`_SK4l-T$K41Sq*r&#B%?cxbHF_H&`IRc`l{EgL``r88-B0XKU14*JT$rI) z<8sn{pwCOsRz?u%t;Y*<(i^5U|2giLXLfASw<^*3fEl7oF|>ARrmmx2umddTDoe}% zt~AtCTX(ZQgj`wU;&5GJ-fz_DZ7Nr~Ir3yW$?Lh)y2}E5LjP>Ku;tt4XB*uM85Fop z?^<>ssr{!W@6LW&ki0cJyw+bbsoEPz_vJpKm#b@(BFdIgpiB??k&yJ_XJuApNp$UU zR!8^LoHukZTvU5eBb-S!%8F5Cx65}_&#UXkU#ALG35G=TXt#3XaGejxvYUkW!Yx{( z}io97L`5Z@^G z2dcY{P9+O6m;dxgJe#~aBe_sfZLzl?5327P%tq`MnJC`dl3aeNbVWsBb$>8+XOkAi zH(e{!S#zDKrQww39kWA<X&lpXb8FX@PZ~9Cu-W?xZ_jv~;COTR zb<2;Be>^Dkt{Y1?*BRUbeQ)|b@p|ZzDkWC^mupTPm2@`o#jlXueq}o?XZS?PhPB!xc?A(8%n_9I7OleFRBu|t zuohWSeOu3Ou|A?x&@uD4+P*&wAC^4d@w)8GmUNej%WSM7%<#nhyWdCOR_<@ran2>B zS2La@?@1i_V?kzGp{?RMsG=uT*A3rI!7iN@YlH;L_VO_$OUm9=4YUq-t`hFj(=`K) zecWc4^9=uJtWb}&;p+*7gc_Xb)sUqDew=F)D-xSYM{RW~@O=$ju)bq(FlT~T^bM>X$YyMyrG7ls!J~Ftd zkCOWwXRBA1FD=innrjKSui`cmPvy6?os9pvs!a=YqZIk%R;f3Vo${HXx^?a=15Smh zoB6kS-2QXa>4wJow>)C`o#`JxmcQQkCi~;D#1?riZ8YVf+2*>?cd~z1uYG!dBCxhw zK}y<-A3c7&O!dqeTkNd5<(wv)rlXCs4VTpys5{OXwcjcU(DLmyuC^zRL1Lxsr}nY2 zv1==1D_slu8S)jhFY(aR%~S*!O1%CGY1*`NRCN1OZ7)P_4Ibn3(co>PQX7BV{9?~* zCSm-qR;8QmU#KnG0@qyci$0S)Ug)aC=;|YRW7C?aSX2JUtjrr-+O_(weF(i&Q{>Xt z;Gyy+$2uO=%&A&cm0f$&w%R_I{X?A1ELR)!f=i}8QayvQi9T>oq++eqNl~ra<6#W+ zj3{mXruBe!KCKiDcLv_}=qi6ydjCh4_^+=l@1K30lQFC^$GMo%>toE*yta6?H>awe z@q4S}`Ry_`{fbCknOT%KxU^%)9z91AzQO$)_-az!zZh-Mc5m#J;a-| zMX^Go(fMjus|>PGaywj6_edMvPSH>M#?|gq8}ztQPV@MvUr~Y0=+N0dTTPMlnBv*V zPvf7wr4lL73tE^Yd0!EVTymyA?~^ z#{2sEd3pqBo(eHl;e~wG?lg1ygY@rUo|cw)+mBKM)g}5{+P$iYvIr@O>%rb|fZkw9 zsPVOhaVpZuY*iE~KPd(vy>A)lfxpldk0#cVOJxr=sjgbzwSiK|#75hidNhw}?$u~@ z@C%=G(@wIcY6XU`kwCdaU+*Ywn{POm}k}t2|Zco4q~# zN18b!HhWyr#_IKKclwpWr0TA=s}d9w8J_4S4qzke=2|K((e@ z_0^`Kp56V5{ayxi4RMd~YTTizC1P68ZvRB@TiP(&#{4%wu6(}f00FJ|cr`HC5~Wd2VwO%|tGq$$^4(mYpw zrX9k1XGf$jWLe%=DC;R(6atg$3C*M=vVxk!OhnencUgu!R5?q1MEjphjOm`c+UJn3 zSHPwEuBeP{44W8U7J51`-g~`ap|GXuTV6<7Ov;7i6+h;t`ex=9#8xIb2g)vLmK(Yo z=jx`bf@DpIP-l77q~e8n|K{j&p5^u~np<(T_Ho@%&PfEx534fO@6`t7G^P>xSWt5p zvBJM@6D*%CI-7@mJ2awIf((j_d*pCBP!^)7Rh-84y{Wro@HA=NR(me;8RZx5UmDQ6 zzBOcfgNGr12VM64&BIe4DGjYoDH@a4HS^l9vXt?uo3l<93@TICO(KUY7N{p{Oqx37 zB3TKU!|AQ}%R3g0E&NzGuBfbdf7$S=*4AL>Y;ix`Q=YH5sxT^AUQ((%(@l&c7|l*X48GQA}@iac_ zitvr-&>%5T>093;N+aR<>Q)q$Qg|0BNK^_1%y)5+YM>g3Wt3fg9dq<2dT$>^WGwxD-Kw531WK&mCj$VVv7$ZKUM zsman5_CQ@%>$z%xHOkkN`BW^goKal{f>bkSHFs592I@xw)D5*_5ITqdu@4-r?Af+n zwhOj;bwBG)+4npCW=-f~c~eK26!{?KQT09TS^YGFyXlrW+HJLajAwt}*#Tw#PXE^d zS$@j`8rPH6?-^Lt$&R>LD@32{Q4rua)R;RVO+OAvo*KV#|Q5#+xZ&`0^V{2|5Y#n85 zZ7*{Kv2r%q*?^tFZsMB>Dq%kV73>UmAx5l_Ldj5iHPb{s0Q{sI8hi{+g4sco3u>FC2Y;%^C4z>y53S3rYj zkY~#OQbwr`s-~(Rsz+*mYSZ+!dQbf!eP5R)hDc+q;g_MvINmr5U9ALTds8b@OVcsa zN>{6)x2{U_N!?2ILbjT;i0ApU&L_5`mZz3YmOeFpRdXxzkcARcJ-d2i^%QU|TGyVm z?8kHR*#4K}g>xo*nH|D)1-IfZH<5km^nqee=5Vza*>+g(S-M#Ef>7iHiDn;&3+J5a z+`s5LuZ6RiMR)Wg145nRhx`Q7SrMhatsbqNtZ$>61l@lY`a)T{20B5_tHL#$Y9RJnLJIF=1--s@{lrC`CeW{U8QC8L9mGD3y1h3p*!coE^^Yylag#vb(d|T z?M~fJ+fgt=rrOrn+SVo4v30}jUiRPYf%c6!i!%FL$5!VLM*=EY8=OO&&!Bl6>^R2W z!PE8+yO59PmJ7oL7bv%WC)7x@A2QuHNt<+nFMjqf>Y8h>!^TB$pAt zh$7ISkCN@c&&_~qem+!(TKJq#LebU{ju#fF!sQc!N2im)Hq= zg*LG2hYBRIP}n0C3xfCrDmGWJ;8%&E&;^Dd+wzq75URCV(s8j2p8IvkCmBQbL|#c9 zv4<>#qNN9QknTpFAiSuKgoAuZ77#C}9vBNRki)A0W!Z~vE0sX!@`lWl`co^Qq;!ye z$T(dFFK|7w4HTHMaQ#06Tc}VhA?FZClOW4M;5r8KaZB+8=Dw*&+)IMiU@CNLjo>BQ zhV!^CbtldUoh1gk)o3tYXGyDY^eaRXNeE*=Jnu~yamBk!_xSqc4WY9Lk}qi$HFbTN*YZ5l8{vkCPJKa6IrR-#1d#Z z?Sh8rFZPAn_NwTF`Y{T`-A8>CdeTCn-EtL%o>pH3-*@QBaYjK1lso#)Y_YNt0e@eOV zhW3D7vAGnF)39+lc{qmaa=r#0a7< zlD?Cq`S4r5CObisSx)qo>?8@|*j{wIhD(RZU}QFS7hS1uIGfj!f$S?W`2IrT5xTQ2 zi96C7qzaaiA5h&kiL;=f<%q?gBoCBCp%47#?W7`dv7o@!F$q24rj8(s#dXqMaS2>w z6Uci)B^03TM0bqnon)N!H(8B*OCPZf`As?voo|wOhU@~(=%4T?FCiYnkE$fz3-Qzv z(LpqU;!qAn%~9bRSr2>&6JZuJiG|{2Vjk3uTZPtAES`)O;H^U?$fLK&6=0|JzayRx zZLkXopBj{?g47>(^ETgzY7G@;6<7oVKxBvk?<|g-4JGM&@(*0K25=5Or@Y~|3qa;% z2jm{KB0{OV5)y^PRMLhO;3w$_If7_P?SN|bq!f!x5akU53!4Q1*7&qqP}#P zND}5k4YpcpCAA=y!U=qecmg%#R&l-Xm9X&P;FJeL;i?A7AsgkuF*sP<4N^%HN9Pf3xO0l(*UX)m;TIw=TD z={V#QpO(gfPO=EITmW=sCG-Gk4>d%D-;(Hor>Hf^+MT6zVium`rNjUzeoslr+eB7o z0{Kozfa19r&$Lr|icz-?Pf#PU9j-#teHO{TRZ=AJP1*(4dY1H_NXL$LFV4RfGty^q z|NrJe%q!kd@ZKiYQbFYZm>Ls7IPOYKg$8ySG|dOdWbruZMfj2)Pz~Q8k?jf3>p?uV zKXCsClV-6M$%>n#Rg@lj*E-=GH0d6slXAn`pqW$$opv%hMMJr0ayfK~U&&?szf>|` zLT(TxkRQyXAALmB5M^+RcOvSERxk}NASok-H$mAr5Nf3Vpyu9!5jUT@FO34X=Qgy4 zccAp8$;HGf(hZ3V%W#cP;x1;;_k{;^vM>g^^bF#j6bDs#g}6xi1}*V8@`Y4EUX`|y zIh30CNcv)g)j+xX1bo8IP&1z(UXx!4mKzK;R|}lWZ$uwyJo%U>s8(Wo3TzU}U2H*; zk{t8ubgB#P@OnIvJD5k%q^<+4=94s+$Pgou3vmO)v}Z`o9u0-pZQQrfP?Y^ILHdyN znT#Zl;|^^mGqJzj4V6_gNC!8dj2X{N6@8(8e=J-f#vu`QGOo=kDB`aYW2CPXCA|YZ zZZ}ldugTj;x86XmLRv;7Qn?3+F&L9Q$SUaRiE#VS9Ku}QpS}?Z!sqe&a>LL+MKNodWjW8Lxq5p6J$jRtS#ADR`h3BTT zsG(vpKRcy|PQOwaAmQU4@wNdF<3xEkKob-4N}aLeCAiPlaW zLb_v=8=$cMDuPsi?AsT_F65uhfL6XQQ34W8f=~w6z+q_yQfa-YKZsOvsx%II<73ck z`$L=85nP6K@q1EKLXnRQKv0d&hzxO$?@yFK-<1ZM(Ht;oIJ~bSkt|#x z!Y@nB#k=m1_%~F?A~^0VFcQM3lW>a6kOJXx-3&!p7s*%b1D?JfF8U@I>pJ)fT%mw| zDvcz~WW3ZDZ}BUbse{Nete~#p+8#qn_CjbPgOE@D8btR6cypx-%L$VtLpJO#X^6NR zDf1b4hut9_AhB#Dcq3<|;nWfkhAxrENpCPf4q)6jCq5EKz@3>4e#j==+f~GOobwau zC|tf@q4Yn1Inp04gw;|JaRK@3ZJ{ZhNz8(#e+rxqjX<$!N7%$M#Q&0*4|dT49K%v^k5I(Vfm7U<&)_21KUjFf!2T+7%ABv* zSI97X!ld?hb0rDquN!CvBK~5{875NGmWs2gsa=X$6*)Z?qyJRbw8rqlM zMHQ3Rh&VA!+|MuPcCeqE%N?)n+v*0`OjeEcgQb(D)H28V%G%MEVp~|}WpC+dyJEQ#d;$u$oG-+BFf&@TT|-l28q_=<&n{Vk`wtJ~4=% zO_k6W=x8R5xi5>6MauihPs*1o_9;A+oZ_AGpz^EoowAK;rD~1pvPz-8r8=P^l@}Bp z4?Cy1aY^l~8*4NfI_+(iHtFJBI))Op5 z!l8AJckXAOu!p(!JSl7yS|Bl`LJYzxZy?+}S1~#!Bl+PT{4cZMC(i<}sT*=D=E5(u z3rg?LWCsdSZd4Qc2fcwdGarx%^PL$aioFe?L< zMx`Cp_}TKUvca-D$ou)9u5|>p6#Ih)(6@IJX7RVV*X%9lWygCvY2Q@$TV3lqGboz! zItux!gX3rfevwK(-cZjob>v#+A3Gdo5;ik|~Y$+ZT<3OgY2N%mw zWSqRm8=@~9Dp`0^ha*+RNlu`SfZW%co=4xLpQGYxW+Fj{ThHucE-{Zm^UGiaux4B0 z$~Kq%C0i+5FMEtM<5#i|vR_DMoC=CD{bC07l+?z4>!S;@JS9_>^jD3gwi`^S!z9dIyq}~OySN^|ZQe6!2a6y<8PLl+8dkkE`>YW0RwwBiO+>u;{Y;Ir=&_J03YiM~biJn{(^951a=-3X1ML^qZy&7lkyzBzFG)T2UFs*CLE8cdTk&;apaczsUB` zTnkixjQ$+lhXJ^%+n58)8GO#+Y*sS!Fiz&;*E!5WW*w-sJMgFHm?umMlf#rSxy%>b zuZ?g))@MplH}8YF=NQ$2`U=;P1*;Ys^QRnc5klOKStEuI<72s@oRvMvj$qx`6wpKe zbuM!L|FL9D}c?hl}qFN`SI8_m-0c--=7u|1vS!k7K>*= z8j<52@h`ktKIj`fBy`xZKLW{h5%r1krDuRLm`)Rn8xzhnV_Gwzj31+95Ewvzg^K$f z{Q|n{Jg^sin0CxKW)<$(YY=xu##QEq`{F?AM-0=Kku%TeDYO96MN8@x98B*qk`s`* zQZ6nM1!QKs2uJxSK9O6>b;gK$1n=W`9DM{E!1}R4Y%}(Eb~3w}z0Ibx8m=3+hI`1> za8dj+{t2&w2lpuQl|ryvx(O;*LomxOVV&I&JKHCONc1Q7AQdVQgvC1)52wHi&=tQU zrAmSGsD~=9H{-(8;yX9#z4R(N8tI^&@kI5Z`{H-w>17z1SLtVTB3(w8(6$s%L z60bHI6YUweq|rCH`yEPbvBND$^K#;teNWq5A7-L8_2rtk&bzSPvR9qXJG~0 zZk0lPoYSfQF(IJZQHgz(Zn5dqKWNvY)@>Poi?9QuKLdZTeC82 zR#s-F->X~qo_o&TzpZ|Q&ol~ni)mUkI2Kocm(C4$vyo8senNGS13v~^1)h?3@GcdF zU9~6tq;uf=-VLkpJbnlNil^e4cmR*!9Q37RoCiPF|5oA?{3N~up9p`x8g9b#fuFn- zyah6JN+zIj;13-RWVxNdR?Gz6NhS4-vHbgjlWs_VBnsZQ5zw>z0B+b@@(tJ#S}1p6H|Ppy4WU)iIst3$EZoKkaD27{ z-&%EKKiUv76kj4gz`xs0ZUDUs8M%**ffTZd_yc@1oaUp+>!bpHg>u9J@bON>U*c!r zDZIhvVCOJ1OwBT&2htOxu$O2}cn>GRdHw{GAR}xn_61xV2f!mY3~nKP(Tl)yp`rKT zR2wRrfZN$tej!DmfBsXrFIpuhc<{WVZ~+cY7c)a7x{fUP|+% zlJGpwioK;$@^tu&qFhJ0rwmrV02^}|I7?GtcY6kF&WMe~8R92yCUy|3;9Va~Oe6PE zCFl$EPkKDlh#AkUV+Jruz`U)iJEJS5>!_;KlFBMT z{ag;YfTp6Sz>!IYRG!&kw`-l$qH^+Bt85%JT>wtqH_Q7XZUKuOtGIl9_sYP z=rwE~UIKWkZn7r*fG*0sWd34zvpc}CVAbE(A2hs!bk| z-|F)RvqQ0wqrz4-jcCl))U%+QI$~(1AIhq17CWC3(T>VKzHE4_-|N0uIHfQne@AY^ z99u4)Z}mL%cL*m5hryTgO^d~=(_7g+`uBzn`uFTC2BjtvDR>j?1X4w9D$Nlt@IUwt z;!ns^@FNL$OEQV6X$YBdyTN6TX%yEiesPhT30D(uBn?dhxKYBOB2(ks(X*Y?90RR> z&|+3%VzoN%)0yS7M*ivjhRwKeqYP-`zl7B@Lv@-PLbd6IPwo&Uq9TG zVi4(L;(?X#xrWC&-=CJ z`-2|?et-Hs^Vg7HWcp-J1+hTM)hy&b_AFxr{bF6?BJ*Zb4<-lt5S`@5kOUncZXTZJ zYgkw@Ke`~>-N8345Du3YN=c8UBFZiVB}dU|kcnE0Iz`+DQsqWq&9+qIC6u2Yj)6>p zOA(gK;I{Lba9wZw9>WIqxucH4!U=`K|qVnH-0qLu}GFY z%Pq?y+i!cwG0$a-^0>-JO^iAd)y~z%(cZSy(#1GjcY|@E$?orIUD6BwZ2cMiYx1AD z=|slE^!pi$@;5|At0-c@GRQS_DQXHy&~4a(y4Lh6q>40H7|B%$bq-DmwG3ACEpo3b zyz6-qm>=HBjT2|ftAR=15GjXuq2AJ)sY1K~W2?ql4j0YA;)bCfpIItj*!k{+eFJHz{0+ zdl8{P0sIGUItQd=H5I*zCu1SV)k_Crz#X*+aL9LSjbxi}8k}-(q!9q|yC%jyW9!ilcr>{L^2sjfDjUWdaQy(?34I?^Z%a#S$hyy#VdHG?!7oNTo4JlS zcR4pWoz9nz^^UOJWq)NgniGvXbpzQXA|Wy*PnUBe=X~bgv~XIn%p#dHGfHI~$R6t* z&#n63Y)R^=JqE_B3!6^%gZo`|yfO5PduSJwbeQMV6L)f5Lu_D1;7W*zB!^AmL*eg0 z&T(PG=0t?d?7L|C8&Q z;cMItexw)=d_O<&5nuZM=lW-SEFOhZcpr3uI!<~ebc0L>P1w(!4u{~r`Z!c0Ts+c% zKP{Mq5Bz;lq|8?KYgV)(wjL{lS~wS}h~30Vm`P1UyCaAeRDQv;m0q-3$GFLkZ&-L#AP_G2YbD^uYMb=rv{mTpGlQ5EQw^dHC~I7;VG9jH=N59m>3qSqTP>Zj^^>Wk`wy1#Vy*vBl#9$<4B zj7g!p(67jHcyXXE41i9rAm>0uT1}eGw~BlYzX<1sasuW2{d}UgqPLjmk$aeDhF9-P z^%nQ_^1p=q>|)^+k*@qF=(XLH`YSl}kr5!?Btu5f2Dp2E!|xI#*@Kva*TXB~KFkWF zjq)gkjzj7|$M6p9B2(3>;BfDt#=x{Q5&m9UO;*iN1Mh`C*XsYxuF-y&7dwLgCZ3Ud zfD|}~J_$ACzYNai!aCics|QZ1R{92dR{vagS|{kH>HKUB-8(jooymSqeY6%)7!atHrsKcR?UWk-K-=Tl7)%Zf_qSS|UfZO;l>=)J$pM_t9 z4#Hd@)O>&*UM4Vg=D~gPl&S|R^9HrM`dT@p1eH#Z2JoLMsOg#w?#h>-Cvy$o2#EtW z%0Ty`bLc}1!hU0~u!Gq{I>InpzlJTt#_CV#m+0EDli6ud3cY|lg(T5!N+sAEa-mbVfj4ub!?B@(!Ha>_{`J1OzMsBVzBZ6Dm*;x{ zguMB|#-Y*S%aKc5H-4n>N9-lff@g6Ql0|PJy&+$?FP4LKhuwA(ejIM{HQ_evfkfnw zsDct$cXT^2-Uq|9NrEo+VVFlP0a|!_Z8O}Yk7}i%6TKKFXH|jynu)YSfxb$VAl3m1 z@HN?&63HymPkn&?UN7c<$*9$t`;3h}#mr>JKoa8`rYlpPxk%rET#WJbZKw=>k?qMQ z#3_6+ye+fQ3djsCtjUU8oF(wdU(LVXKQSN&+5~?D z3qmC$mm|};6Z{iF6pPE_p>xT=thXGncm!lR8bOy~|6=p8G;9Dq6qm7+@Ts3;3VH^< zfqrNh`ez?uGM4~Z!8{P?QJ8p6g1Mfctp_SiX_$ANhPlmeq&?aiy9NEVYLF(82wkU# z#AEUz<%1fpDfN{e4C}Ee)aAg}V&2e6@TnKl&7p%FO_u=mT>>3V#glI#CtFYK#`Nem zWDRuZ$1CF?#r&~&LMVh>pxY5kq*wSvNDcN6mJN0YRuA%^+nE%66RaC52z3lMjf~)O zxt_d9fG(A^T>2ZRxi^*CaIR&j17O}b6(*=II04>4DzuFLgN0$mR>F1A4eSK(=wP%r zWJb4z6~scC!4Y*KWFs4)Z!iQ1=d;jnhzY}>XORQn)M0EFbU;qx5|KmX(;50>>qgyAsx zeS`hM`w`1YA322n21#*;bus$a`V4(t{T_XL<1kZ!QPXeGM;Tum!^Q?i(QwjeHk~mI zHq|nDAQLLhM4H@&_J$1oQ+-wD2etup7N^wdQXOtnXoSDHufS8P@J?P*-jcipxy^HP zbC%~76r6Ui^py5q3RI8O64pp-m0sEnlp;$}cc~F{J@y#8gUO>lkVnWvL@HJc`3kJl zMCq1rox2hq7Ah6$6EcMM2Y(04hWkXgNIdTsu1fLBSaqp(2)T*XB246a_*IuGO{c>i z;-L;uy{YEZe`FN(f~-RwB6(6HpHm4;CH4usL^sh;-q_wa#B|d9#j@L4*M81^&py)L z&+#|ZYXx?ly`GgYw=f?!{2*GXjg@Y4H$Edkdp8$M&L0c;tSz%LGk0cVxg~Scvxnqb z3!8fTz^rU6=-p3lvL<;7spDb-*Fz5T-Wqpx&&-e~c*MWuZu* zejpU62yUlH@O>zeGYXuzL3#fPvQQT z4pY;6K#zX%s~l->uukkf|R<~7!aw(9orj$%jZcj z8rW}J));>p-1OhbX<@dI7D))U_QVv7&yh2eGlyrC$Y_`GJd?=ol)Wk^J8z2Th|d`G zhrVzr;v=OrdK;S!-3$qKt2VR=zU5fDCV2<%2kh$-szr8+3%S0L=HXu6nJm3!)05Iz}CJ_H`KTjO~W` z1gu+`n4{!!gZV?DZa#0p<-D>vHM4eQ=A>t*m(9GET`M;wCzLDauk_yW-w$o$JYq$~ ztu8@d1I?j7eUE+5UWHS0FI9nRPUHfUWwts~&KG#DTlh`zU#McA2k!Wz0{8v1f(apW za$d&Tt1?qWFt(3<#JOQQ~vteeCN=+pm;eTVzvHR#qAhdyE3+58(z@*u%t^&PM zDk#JzQso#sFln78o3*ZEiECC=wdm83@Kq^pZrq>PUa|LL%EfGOO?Ni5*Ru6AFEV~L z>?GF6`H}9NJFwD&6!gs-oO3#}Sw`QqN@+hcdggr2yPG$z;D}rAuM~U|ek$}=9wDEB zx>%c>LH?r0vR-yAbC1E98q{O_J<>uODG!p?2sBqG+%4ERc*oz>U&qJ!4h6mjJB6o3 z2J&}=m(atj4}G3WSR?4d4<_Q^w69C7z}--@-Gl7$>&O>Sq#On+WJmRy(orp|wFk9A z4kqETWIy^G>(#R+*>cQ|Idffi;M2v&q{i%x4aUrfIS@T9`h)AdgRoDsx-AWjdkkl( z(b{Y7An=7NxUc6U`JUXf*H;$7t+@)9pa zwW7TAD&`yWit0Jt%=7e-31@BHABQC()U>p{O8j*3pRzIK|gbwCQnNc3d^JIsz7v|s{&ERSMkpuk)w+3Vl(5XOR8+PuLe3&F>V4 z$YVf17e;M+4Ik+JsuK+)WEkWOdI<5#X_eQFdp}t|0jG9@rW$T zRM)N4HP=aO3HA;ZMNC5l@E?y9?LvL-et0pYcTEjM`RDoS`Re#1{)FJb@GedkenHY? zB6PpoLd9_vawb;bHGuN-8rQIjPy;qcRG3@UQ1WCqJiU13Fx&$>!7R{=ECdqne8?K@ zt1mR(fG4-YIWy`?bn#d&c6waVI7{4z*h#T7V;V(wihAO#?zn6ywW*avW!_(vKC~H&t$WnW_`;NvM1zSExhmT8f?yWhyA|-Iu|;ZezJh7#YC7a z24fqter6!u2Xb6nAdQq^qQGqnzYD$y%n#i3H}?B|tNauEU;V8EMMJN`2;W;gA%9g* zAx_@-3)omCoxANP+|%;{ z*&DMwnL{&+W**C&nKdbER+c{dN{&8%TVcq1HQ1i-EssYg;%~@tG|!~4msysr&eCi) zbBq2+Iml6XJX%?GN;$wjSrq*0zvR>T=KEUt;R+V~7MvTN7>VIg;a|}seNk3x9}pl5 zU^nowL=?fnq$>coh&6aCU^b1%SHKi32`>qCt{>k*G$iLz1DM*nQHFuA7T?=$0x5TB zlsS4t^y6q>^ilY$Km7BesBb_JPO%wGE;a{$rgZ1V_(^v-cR_ZktYw*XGTUaB$tstX zoq0X8W7hQS8#%80cJ85me|VGF8fboTR5ElEb96m*JiCaEWn-CX^l|D4IgPjj-PYc4 zUJvDFgkJgYc?&$6XD{U4)eKldp71E{FyBP5iZ4V;RzZb#OM8F@@tNdz>NxcJYcl)k zZ0appiOeT*ArEv0xe*c)Gnq^52HjcxRl^J8J(I~Y(CW4IcIpI$(Iy$}O=Ke>2=SmQ>Z$UfZlYHW82fKJ{ z6!yq}n!7qDD(6#nmF#s{MPMIvXZFonmwh02V!;;AoWQQgezCYZ5N$$)$@kO>+7Ib^ zRcVo0PJJPN6PfrTtS@2(4)IVSKe842vEu_K*xP>xs1O_O85st-NYw=uK1VgV8IUJ? zAe}Hhkx6c$C$fWemO@>+h*HQ+fUmK+hf}o z+g$r1d!fCt^RSM}AO2jZwSSmrVd3}uQ+YM>?&LnpS(%MwpULWz zH8`tvc5cr6{1kUrzc;iANL`h+Ybb$7K?lDJ*`Gu}9pNHPWC!9UJ{hWuU+QytgNX7? zA~{guE)EV4>O)^cpTf5xA^RG?2J)bPNEMU~K+r#qaYO}r37k4Nj1{2|SKfNxS^^l_ z7i}+W&Fm}fE{Da@-%;OD9i|r3?3jJ2O|xFMZnq{w#^Y_%RzqFg73vL^t!9edICpTq zzp8h*drslpf8dy59t(0Q)2I9~pt6xSMp3UUbC z*0a%c@U*Rl>^nEmO&36awYYeWpU-WNFp+=4C&IbmN0A|1JHDPUT1=73Dyu=?7eQS_ z5vmN+Sl8E3*>u}%vo^9BAceA@W4q(ELvbWHX=lLk!ZE=?I#Qteu4@}={c6cKZ!|SC zOw&1-9%Lr^uX;$D&S!;31poHW@fP*ec1IN!FUZeZnTO}?%H5uupR49oEO5D1PX+(j z;Kpzvw_d0vjhFKvdFusaMKpxU@)^{ZVW85A>KSD{^m!_XBLt1V!yo1;VZYE+Oa%(v z-_SK&3v9YA=m5Mw`4_#1eWbr-oMH}Iy4x1mr#l+K$}a7i=^E>*>=K-dosFDZ9S`k0 zY~QS(tOqS_Q!V(3&(Vhn0{sSQGxPbw5jMOj81!HE#rOt!V%*CiW&By*sJsq&%kwVe z?<*+jUg`;YEBZ46y+hZ+8IfIl6ERJysdQ1t!fmb+DAVd_bAg6JE1my;7XAxpK4G~# zoZ1;Mn_LfCiUrzEBmp`o%b|Mxo9&~oVtin-TY6eo+x7$7y_eJEYUKLI74LfHOm~!W z47cC4^{`#FezJ@(_cS{79hl=}Gpvl(Q64YW6+KeeMj8;B^9t?h7yyVk29);esYMkgJ38rmU)iX-A?`0JYL8MO4Osx9OTX zT@5H}pvHKjY=Y_T`2TS($;xzhMr78o19X@4MU5{^(;=gGn|-QdsN=i6y#2JTt<7c& zSbJL^S!!AOnyZ_(7zXMTIzpC!OnH~~QSKvc5-RWuBE!Rl!7%~Muk!(G-+kG=-u)W# zyOTVFJxe{mJUbxexkzAXFfYVLY#hUP5VngCq!;pGB>=jB`QX30soqzQtC!X0;0UOJ zmc=e&FE9dBN&BHrngvN2L8={dhW!L|x#_^i8Da1nnwZL(O%~A-XX|7eY_(dRnqo`~ zjYW*n#$3ZQLxLe$XJVF-Z}1_IyQpcW)ssqh*(7%5iic9bQ~WD%HE;^@I?Dwg`+NCn zcz-|!>0#tQptgs@MO*=Whk|@LuxgptgHt@Vs~(mdLXN|JAuQk zX)v*fm;)-MGE{q@#?+%{K&N&GGmMR9Pq7-?MmNRqQ=g*u>b9`mbXAz8Y%$$CgJ76o z7_7U&CesgywfHemkW>M-@MXyGU5v!2o#EzoB+@Q2FszGoh^&f4Mf!(dhu??x28;XW z`Tz1A^_2^(=9Yhswblt5gj%8?_8=d@`2NB4l;t7}31O{Jql(Du|EVmui` zC&FhLOxo4fQYWPaB-KqJ0%Qx~402Gu!*A#Ig+B`KmAzUnzFy0g$_NJ|^8!QtB}D^j zA=1!O>MOBfq^vKI>wxShx{(TW&?~7cxp~1{ZWH7K6C&EyMe z8kGX_tP=crp}KM#qad?Yq@Uu|#G>juq9b-v_k(zhs#r6k3Z5xr)JW8-I_YLqNA(Bf zm+pcTDh9u9VW|5G%0DL<&7q&E@OEet(SEqf{r$G3oMtzNgxd)`KrK8yT$IPLu(1Ky93?x>@@VT`cH{U@Ib zH)mEuo&k%ukX8STLOq{{T}N_t&BzS&O;Ge$xN?G7^DAe}eGGGiVbK455Lzrx)M^?= zT1m31-(5Hjl35EyifU;`^n)}q_gt_VcR<|0X4nX0K>h8-JXN_nY9q7`OqoAogM{9E zBY#hyK=|mkrsc$H?U{0m8Mb@}Jc_u8FY2H`b9FD%n>(R0N>F-) zUuHP;KQb}6%72hMt;|GX*yFCZkn=Vx|8kCA-fk(Eu#S!4+XZii%)uUbDMNs{Mln(a zxlAM-DZ`FM+7e4eRs7(4C7+|`Mqh*;x2Og(Z%UFdi*0GT%ubJ#7G5cPvF)MLQgK7H zvNm#@K1!_#CxM#31?YE1sBa-(?;6sR9D%O(Jyxp%VRw^IjI6~X%0TfwcM$gMvvPM~ zF4f##A2H|62_ZzB)=Ria^)XDxODm~iA6Z2>Y8nl_M=6sre1ROE-#|BTbjz3x5eabdOlC+E&q-nsNW;S;<^W zEFRYOV0FYBTFX!!;vfrIT%a^tDJS_y3!U(1`nGs8X*m8?8UzYmff@k4h6h6!wN`0FVW}4SI6O~XD-?Or&qr>TkH2{@6ZW*cPl&JY{v5~;PhCD3oI2g?y3>WUNHxwm2up_x{L z{Yf_ZQ_zXz69IqS{?+6d*C{qNfEF6)V@E$$fTajhd z9BvObRidfR=qj`la!g{_8%j*Lh+e~ni5U z|Cb0koI5L}Q-1wMY@JMk)7Yzd!W9i>NMV!MAE6|_g?&uk3*T1`=~Sw-Zz5XE)KB^p z+C}Bzv(;ik3fq#}sy5>dWHS^|YEb8aCx1!1%N0kbllzfbhHPYomJzP!yMV_!>XQ?} z_jfrEj}GIKNYeHL{{dROMCq*dKz_p3v{aUEVOv5ve`}mT30qKiT^gWub(ac;k>Qq` z%uaG!qyo}0Jk4`~)yytE8QH5QiUh|KC>2fr#usbpe5RU-eBuncQEYGV9$yogK`tfB z@EcLpJSSM5_aoQzKgg|tb)wfgUF#R|%I{4ZwYUBX`eoqf*bw&XEtZ|38)6$GFIZ7M zA3X}c7Fna3kpBXl#M(OQc1SJM?Gd*)S?fT^2r}`xhA4HzI}v? zH$~^t*9Zk}0Y`aW${@cPo)9MWsn}ia5Wa=ynKP)3Qh&q&n!^U#S!4!Q0A2l;>PM+H z-$z@DkE67(o}Q}}6N^&W@*}FLlJ38SuC)IrObNASj?)>z6uuw*6ts%P(5l)+^t93? zl!G|*70Cgr%%6f9vJKagzGu#twg=mVx(vp6`W{FR@UrL5hgQ`Zh zR-ai$d9MlMaa4L>8jCEKSHN_#mV8zWQ7gfBu?5K%E2^)Mr_^Vmxb%nms#?V}@P;+P zziJK~S1M{g`5fCyo*Vg1X)16B<>!1R(iH2eRimb|s{-%Uw!}MQqP zDjq`ns{<*PfC@=U30vhuR7>(Z*+~t7UOEaXMVy43)M-*%WvyHs4Uk`u3E~X$1aJ+T zLNdT;Bp%-^j3j)ze6G7c7N4biqnwaeqaEp9Xo9B={zR|iu5)wDWsMJgN~AqqNj#`7 zBW=u8x=9d&_h_Fy23x}9U~MEB85zzOnpmpfm6egwN$oneLpdXi!PXf_al2dqYUB@3FVFc)IE*hQW522FvlM>1}F9zvG)|*HVVJkUVVtpx6Exp&O z3G4Va@_DhOGM+wyccrf>iDFl@VQ?^Ui0rFtN@)e#6p>Aq-$$xiUg_e(r308$-E>Kv z$Tzjj!Iy+BN^~R(+fH{Pic%~$Lt2M?SH6&+!8tsJ=!?7gfJot~%&{<|7Bj9E%Sqdm z9qK;fA?S9F;hnif%4lktTp2eg6EK|`;oeySvW=@o8^wF!OQxB`EHz2nhh7eYvw#d4 z52Bsle*u1i&d~;N!_ocpGPQc-6q}D!7rVomF&S$v)xm3{{dor@qU(`tW{oZudO?YxwPrr5kYVIEC;z1^bP$B`_4;J z3^EZNt5sII=_WJR{rAEPb=L`2ZI6zZ+M{#9g;s-5RUc^O8DuAkp#8v8542LHcX)9kmx40+0NEA4B8))K(GFn(r$dgikRGi(MHZv`5VO=rDSyy-+KefHjbKxAJggxCqpBVljLH$BV8Q{ za>F89rP`#2h7q&&NW3LEw1be_o~iXEN}$iAKFUY%VPBOy5a;l3icJFE61Zr9UWsI* z`{lBr>Mn*gCwwXn#EDDFMsP;6;5to1;5$-RL0*mx@`XQP3y8mwmr8MPt9Qc-(MphL zvkrZZUcp)Lv*Sb$j6|cbb@)BhgsG6^bQc*69p6t_E98W>UZvD0;J6zIii&&6Ch4kJ zO7z2tJXWkH_XRGhpHm}Kz;j|1CyN!q>xN5;xJ_yyWAa0Ay03>^rr$TRT}E zneP~`v#;

IKGN-TQfjHLB^DN~kTf#>dsHds8hf5mB_+sM zlzcPuhGb;@Y4Ushx9y)!eVF`y)4Q$jhkai8{p{~G>ASPF{8PS@k!U%Bex+~e>zTGg zcW#aSqNAmAmE(lfWtyq0M4|Xvq=K3!l@YCcwMfbE%Wxv!TAGe@qn_*MSjsz-VumGn zO1vufppsUpQN;#j_mv!9tVVn<*F0NI<2t;rknG={*EVhEkH=rIk1OBZd~@K{e=qC5 z9{O(4r(!=krOn6=6c_@N_=U<@>&3)Z^xMRb$={cy70vzX`4Z`+aM)tz zr6FQjtFQuuSQSN2<)MalCf_x;5(QYL}^+T(*AkqcODk3VA^NH?q$?By;&s z>*t?u=f52J92j>m`@O04e$prG`|;GaSM4{n#!M($D_T;^}0NBV`s0}l8GmZ zcPLY({JjeED>kWova-GE{c6oBr zKDPL};OCIk*6CBTk^BjT)x5nz!-XMg0j5AwMFaK@D=>x3Bc?9Xm_AFUp><(>9OX}i zW(6Mm(|u=sxxUxF%f4lSpTQ2{gM2Av1X_$7$<{W^Fn_h#TwHWGZg)cYqN9o@mV8xm zUdj3;_3&52QjbauN!S~;#x}xmAA2q>t{L02 z?q)a48&ELSeZsppuqb?mzbUT)^=B+L4zywSAx&@`z6~FY9Yq+en?g#Tc^~JE%!_o1 z)ZyB3Tj&#B5jgIBQMfVhM)v&7GU+wbn`WHL+@IAvCna}V ze*J>I1)JO{zGK1ikX$)b*$J68_2E`G6zhcNVRNvaXdCn-(p-yCYJ&DGOK2(#=J)fb zz!7^<9)&k$&PF(NTZlyEN32JZEQPeyKT>RO0KW2D3{ySDXLA>UDx}l zhB4P-T0}=V?bZs0do-MW>Tq#@&_W1?rvyg&OrHID@3U)X?athkt;@6JugTwD_}FvC z!9g*pm2Im6Xn@(u9_P?K8leYi|+kFZjj z4Bovs$d2-8qmVu@llVrD(>2t`8BQ2Go1PnI8dsT?o10onSzeot!CWiB^h%#?IB#Oi zF{UXdi|K>0gYl%U4J5%1#3kfCbheAij1(t2x$NMFfFqdfzvbnA|>^f?nM|1$q>H#K|InPXBlIVQ=61b=cU^}g2l64ad z3r)!eH}wfCfh<*q$RpJh^g6zs8p>Mf^Z01&p|((p5y!x{5CD3N3y;S>L$=ssskS&) zxCmsXVsP@-)gCA<x4NXCq5H#d6ME*@_>}~SsEmL7u$%a*Z}4# zN$Ml@FHrS2QPY$fpe5c0-YyMwVJYC|TZwH$CxQ;S9w@68qRHS$d5@mKzF}Ws0E1oz7*7;{~4oq^ z+@mbkwn29&gSt!X#}C5{;fdT?jsm@;N2`s^01s#>b8q$DPWo11V!*wO$XE-z19jvU}t}fJ-~j!H&6^TpdvY*l#*&IdNWG=coG*2qUt_*T_wtKT3ktN`}PR-g)61AUOs zz;`$gJLhLm=W38KHw|=%W3Wtcl&psO{x__Y3^f)$Ln5Sut<%~9*QYfkFs1-oY8-HU zY`|7I4VC#6(1$+;?nFMM)fr)J?t;wDYe;nX#;NIci48&dQ(_YG#OIpQq*L4kFUUYg`g|ZWJo)ofS!O=eFD{E`RFFN zxlDm<(HF4lASV;n?h&Mj)&tlnWwiQ0=x79-tWDZ}Rj1sR71=9~R{uhJfx3GM1|1wA zLK&2U(lV(5(9+%^%dnT=_RVWq`M}NF2^GXZ=>6h&CVbwaP&qhY-?9Kbs0n%!l-QH8(ZDx* zr}YEU!Eo?u57hP}YtRVL=n%9EaD;Ay(mVlNEsa3Ct<%0CFG2TefZO;|&^|4P)K~;q zDCI$yFdqKvA0Q|9Ev%Ia$XfVhBqSG7;F7P8^wumYp&XGX$&D2Qr~!(As(&r`(Eoz9 z@&@6QWOyoF)vk~`SAbnY7vS?@iuee5h7Ls*sFQ#|GDrKPuGW%ZjqHa>_Y$Q(uuezA z@3sf7S{oqnSu_?_`f8w?eMJ7j=HgjsEi@Y_FnS_an$Ir3zSQTs!B(x@K6%|%~Cw&EV(HKOJPX;wu z4?KdrRx-iO?-onQk0EPyEEY}t0d3eqOwur!72os4gcg!P)uDBXMCu*zLRMhQwbn{o zDIn|;ZzwmAWUMlIl}sRNU=xtXN>iXT9FohZ9w^3Xd^0HFuS2qIuG$UOT7lXg$Xg|d zosdL56LKGyXo#{`EacA$*ThP4jP?;@fQFGpb|dBkFK3(-;dR0b;k2|+i{OW-^YlyV z3GRiN{XJnk|6G7ItxbhWd@I?Ltbv=6o62;#yeJCsN=@Kd^(U**PpKW$bNr|FO{S#D z!Z?1Ga8Sn3IIN{aYP?UPMP=<%qGw3CL#Jr9Dz}lr8E3wVxJ?9)wkp1ZVOZxftZaZj*fU;HmhuF6uC4i);r?BdXQ__slcw zCUzE*6}^za+!u0at-zh?1AC+qc!zzk2^dWHfkdMNl7|^ie;xJ=h!gj~({F*9|6*ml z+)N$;$-ULE+jviM0$H0VkCsxWN;So);(VD`L&!4dX>2C;U{(|ulX4x|FBd3{At$vC zVJBYU25h3%M>z@ARTt>(ZvP*3UNwm8Z6uc-;5IyXlwee;^4(p|*!_GZd?j~PT3bmzZY2bjI z#)5G2^g(JuGUgENidt4}1un-~aAv%ODkvT3oAc4H$lt)Fas!p5BAmPocrELojiHMj zLT6%?u~y(d#L$*N=-Q-C0b*Tcqzn8!z0q61!0L`pgiO|(T3M(GOt8D&K&Ar;?grFj zE7YGrqZk5d=h1K)zEid<^I^Af%gyC=u$%r;a@C=bYJLj-e?5WaGau5>%gC>#?XXLX z0k_If=-?cO6=H!z=bD-X#I3XFF{~NhAFl@vn_l2w+(CAxqQEKiAE@L$(@W`2^b6`V zwUb@|e1y8-`P-~}pp8%efKkd-gm_p?SJeq z6G#k93akYd0v-Gn>KFk!x6m8h%|DeN>LOr8#>2U>LwyFW=Gm}yP!$(Ajamyk;N$9%y2wX2(6mL&ROnQ=ZA#p_F=Y+Yj1MS<4Q>cFOb0Af>&dE>fpE^Ia zYwFwIpHnZS9Z7$Z@gzH(ztwXp(2}33R70l$pZ7ne6KGvdfE#for4VbNgAOE1DTSXM zHh^1pv*(k$v^(8B+WW~jF0eavDPrSa30vgz>Lz3x_JCMVRiYnJdx3iOiYUP5!-+K$ z$ROoF*OP~u@LEJUawoNqnXbEP7-3Ga*_y`V>zC*m>tuJ~sJ zZUxQ+28FsrZg4w<&4Q zDW$Jv(kyrF@0=r}-bb@>D~c3N?3I*IY+&&X#XcwfN*a;y+cm~ihOr{;!ix%jW$#bB z_Ur!7@jtu$Sn}h`ue{VvX?HWlyvyG2p&UU~Ls);Z0zC?xj=yOec*xFEi;3pgQtg+t zn)?(iB;vT@Qm=R^IH9T{QUwuL$kST@q=;z8G@f8X}T?~P(!G()OBh)c%g;@ zh3hiGV>{4oXbcvGdkC4T$xhZ^G4?b6wCu7iapbuU$J~#LDY88wI!R4jpU^4cc*6GB zBeuT{MQBm^7L4_v`HwPhL07tHnl7~={Jf9SCuZ!=E-3K%Mu$r9&!x8NY{+aM2&^Ch z8$qxnMXW&wYP;nd!oLwVWC+#?y!6lY$NFpgy87DrYXk-aXNEiSC!`gSX<7>l;0wu# zRDW=RK4e?##_Dvs9_(CZBVCvNi*C%wOhetj`Yndp#{OmoG{;ZvU!2iV8>73%){9#n z*EDWHoDer5uC%MVc`N$}IF`4=oqekdOXLs9$;#{lOpfMhP1BcUXqoeK zf$Jv$8H}Y8=jj}Ful~0o#dy)U#5m8GW}IPKV7_XOv80(13t{PInPJ&xS!DIwe%ccp zRUIy8w6l+ER}|;^Y8znw*WjhrAeyv9u!Z%34!#7>8}Rjv%xRP}EBjDRPJU>c7e;a?tX6n@WH#WzxS`Go8O>VjM9rJRzZ#WT?VSj;~U&j~T%Qjx2X?UB;lC2lrf zL?|tel{PDbkpp->S(F~gT-EJ2v;aT*dGj{w3h?pQvDdQGc8{&NowdIJ_49eV&2hrc z*z4Fo+fZ9q>qB!-Lk)Hwy_D#n31W9)BZr1I_>OzFxUUx)3MUk7DTpcjQh42+?Ah&c zddvD}1lxqNLsKG+_zJ-M-YISn$BCF!SK1+-6>172g-ybBz9Qd%AHhpp9RC~=mZyn5 zrG0WV;L#|o22q{*O#j2S(VsV*HPYr$md)0~wl?;4c7x-pNsZBZp%N!R4y*OJ^068$Gh2m#a+}xd49OJxtF;M;hR+5>98wp z2ynql;goQ@$OP^+5ZAX0n}GMV1Gq)m;#F~}NCJuJq0~Y8EY5*@TXi{CzO7Dz4n!Z! zjsHdU03CmM{V~H;V_nk_(<@Uo%WdmpAR)Z8rdaz}*IK;hKjt!)ALdc!spbKe3*e9` zp+66lqDt(0x+a}OEypduYf6B7^DE%i0(n$v2AnHg4oO8oW5+|6?$ZBpbe7>!WNi~} zAD@XU8XyE`7k77ecNTYdcMa|?ySTgW;ts(rfk23jOMCZM?{{&9A3-vibe}$_o~paV zfbd*+Egq5EDch72@l$>egY4QpA0;#}VP<3L+4A6{^;;i*A^xm%UNYgmqreWV0 z0h;JN=m~Z8L{LkU@Oub^wpCg~EnIVG#kJlz(~QtIX-lyW>k3`$KGd1{`YW6ie?p}T zhhkQrIEg800AKexUh;F|H1Uo2ju#T!TEZvzD=v3)dO|?xn?CZw9eSC20*&$MhRe@&WHE> zPhup9giS!Q_NjBg>^)0KbQhu+_U!M~R=NYK>0|7Zk6~?JN<@-dsYav;)cK$$K&7Y+ z4l<{&!^vrd;!~X<=}#yAQ%9*w@RK;LyY=$aJQD4pXhhvh7RM`3&^zdFK%;#NBH0;j zj51eU53RO_z6jdPbTwAmr2kF3DGyY(N199&Bu^2m=`Z9bJx5Exx{`tf^anbH9i&fF zZ-cp7NbiuB5Dg6mLe?^9Xk9{0V|&d(q_C7WTs7d#woxue z%@$)RGto@?s63P!VKy4%+Uu2=y6SoH1h<6BG~a?2y^=T`{7!7P9bwBV38vQa)=)L* zClw9li2GE7kVurEyvhu^hIEig=2m+JT@B9{cLdVOpO!9aLTDYH?uy*XI2!CmoBk?l*B)Vm3B(ssi;d2S$zdB`3TtjbRIIknd$ z2Tx0TjS);)@ilYRFiD>0f5AVt|7l1MtR@COif}_*_m`uJ`%j6PNwE@%RyA0#17V{^K0cjR2-X44mP$U zZU&oyAZ=1hn-@{M;k+rzYw)6k1BM(d}x;5yS6l|h;=&p@Ni zNumZ5$9*GX!EODb`-yu*Z`xp3NnPZ(h#BM%x{36eyJ2gfNu!Cbudk;|qfO$OvYft+u22n>tR!NLSU@jryvv-#(@`Y)sGmd&y^!5O9F_*C zO_*`|Q2B}0ll%l~W>I<{*Pf~)%~BJnAzC%HCiR@1NvdiXu~wZbZP46!wbj}EdJT~f zIcYYLY;0}HV%qD;prc(@`q3vCJ2#8|SKTGw!ZfH7v6Hz>F9Hv_f__Ss^^(+Dx)oCc z{PCaKer>@2uV#a3iYZQfRrA$r&^brwV==*$!6B@y6w=BNE2wDd4$(>^WKTMaEC@wzzSbNW z)*o~pa~67PD)m@zi>GRLq9U~r8v7-phc;JfCig@W!+rfM6rpgmLpN6EY3ubVS}X9z zbBX=rYotM^>n*fuP|BY{dym)pXe+duYI)75b(A;B+wqe!fJMGcU7$>c4%JXUtlt6; zyEI`2(|#{zHU~*7Jsf)f3-C+IfDJK_7z4%Pw$>IisJg0CiPnyR#?%*7nqI_lsAG$@ z&ERR~kiBRIG?XMNmApWtVa9QgN}|dULqHv$2o<+4o;Ng}f*;6vT9g@%kbK= z@Qm6BjitHX8msVnOh&fp1&F0!2rtsxXt`=-bvh_W|7!y1ifKzU*%*ZPC*aV3AQq9W z@ied#WAsLj}|L4Wm>XJhonBzMgCe~ng4_zDI@O|Z<7DBuZZsuG@fd~;-T*1Vdj~DmSJ0fsd0}R#@=Qf$b%j+HZd=^Ot3VzrrJ_% zYwhbDl^h4`>m1h{tL^EwXnU&dh4q}Zywz-;W4dELX70z`#yqFecxmAT=Hy3lT-Y^TZ?KdufAGS-pew)MC(e@6%qU2hz?xjHOLA%^u4{TQz%U zyTkt7Ho*SWzRA7}e9&d#caZ8!1cA~Nu`6OxWShwJ$gfeeB1c9Hjp`J&+3}|}#~g2{ zNE+4lvMzKB{Oft+t?e!6`jDUGQe17_Mcg+%H+?SOFz-O`7Jt*gW8WOV5Ns9Nh>shg z8+fI^16RRqyc~!N^a(5v9Pt}VhUA);;MoJdbpRLqa){OCVocf>xAT@w2^ z_E_wwnA*`VK<*e|e_~AJZ0Kk&%r6h-Ly76{s)=)28Rw(C1ZS9Mpy#1ymVX8M(L8}) zf#<<@p_8E~@Crp?ns7n*DpVHY`N<(EI4bltcswvF@D@2*%0JZKAnZj!_)!;kiXCB$Lu?O%e~ybuJWb7W=s6peWQCm8(3z2=VAm9~5KH({}n^}$^1 z921PG7?%{kI{rv}tAz6j3lpX!bV}gj7lJE!JF0s41IrO^5Vb*Rzz+*&If)$AML&)TUcO2}UOPkJQhll)cruk*U+arvxsmn#MxWkviI0;>X5z_F|k zbs>(A5Izdy#e!h}9+%A0GO)mZ36+FAz6rk{^!e_=^MOx+Cc)NV5zgnskq^2IF4HY} zhH_Jxs2)|ftDn?zT4|6P(m{JmRbQyhwNqLl_zX@FUa|qw|E0OM#!2Q>YpQ)}ScQnx z$OlmeqlX~>-z~0syc(a8KqPKVoRIi2p;yAB_`|V7Vp>IRx4$y&W-9B~ka3#o-|V^K z8th!2FXWxbtDILRe}Hq3OK|t{R`j(3yG0D_0tci%KSJ81BF+?l9oN&-gxZPA6RRcm zO85@n-tCyrk>?$~EX@p;DZd&L*N39~vOC%}!AUwD`E0(``NEm(l3Z0i5#Gz*|9qeQ z>477`v7sgW17SBZ*PX##e*@Z60r{vD5UrS@-3Q4tDReqGC1?$X1qUIw`Cn)}UmBU` z<6=GN9m~LJ-v|!)Gqn@e`=;<=+|pB^6I3DB!kv4Wx=6of>L6+Q1ouS*6pw`;;85)3wY!z>^BSwXVNT;IH7TP#$QaBBqN4K*w$@r%S7)Oq>B8 z3em!7p5Rx6mf*@e5%Qy-eKFryAi&RGBsGE(@>-bzKHv8am@(7T#Io6%VxQ;84{HjlYN4nu(RZQ;#FULa6k8;2OWbwbA!Fi>#TJd7 z6MZtGu7k3kHqK*u5@pmM;+>E&K>AL53b-#hn>j7c+xZLf@8-{R2As8BUtF);w>(3= zm3*uH4+AfQk)V(@hNmk}oG<-G+d^^aiMUvFh|{5X-QcJ2QG6MG0)K%|624#^7z>X1 zGx@wSLM?#Rsjz+l=g>FA9(WLT(}$VE?0?)h!zbfA6K^hRZD^ZlpN!{N(eS6?(<9nM z=0^69dK*B@2qcb{!Bf#ls#j(2;fdnUV=yFNPCJ6kv-ol(wK&hE|w&WbMH^~3$mlkTeI7Cbnlc4nlapfl{sc^CFQwQU!DM3^thfq7|yNrz+ zW;kYiYEsQrtu65UUF_HvHZeRd;$g&)$h(nVuw7H4hDJ?}Y8jOpH3ig#^vIlu*&uYc zvX!xXFdk;psOrQ)wW@3rd-B(UEV^W)e39Oop1<7--L>4OT@zicT@77*UDI7JUF+O` zc=9}-yk~vO{SyN5!I!}Sp(7y+-;_;{)q{GiS_XVyNNJO&dtLyfM@kY4t;1%~Rbo%w5Kv?0)N->6(E| z{W8~DS01Je(VpF&Q{HdB0BGYaF(;km4h z6|pLsgr2}XcA9!f?_$Pbuh7r1(zxE#+1%FB$vPIiIn93DF()iBd};Wh@Q2|-xGy|6 z{8{*x@DAajumNG09q;YqY+07+=1InpNHuk#DiXc5k;+hMztDjX1$P8C`@f;*wYPVf zr-%KQ!d;(Aubw#@bz%;|L77h4H?2{7?~ z+Olm1`%7D6+b?T7YX?h;InngPFbY2S*>IXI#Z-8#=D@7HtrRCF3dcjK!CirxewXjJ zPxU_aI=#`p626W;pRW%HW6jWz;|(4NMe`z`C=M3GB#%@EeJz!6lD?++l(Om-yw;Uy zoms9&L!0bPX5;))99;!75hy#%mIwV#=Rn^wWE+|qkAt>Q-qhc8#`N3t!F0)V+%&=z z3u<=><3d9^H-dY^vdGpSqJ7jrxY5o-Lw%=-P~>_mJ>;TD{4bFPin|3tcp+31B870_ z4!?ML|xv;j4CnNk>i7=@Lh_&pit zFsqWNj8&#VtsaU$yRNiQlW^i6tWEPIOYm?O zAj6NaB*d1oO-N@NacQJ7=!`0DX%c(UsB* z-HJ=mh_)NAd;reP32>&ihI8uy-tTPWd?w&2RRX)UH0(kTL2bW)MAYBvMr5EXX~V&R zTZ42;5*(jz;2Zb?1$GnEmSuV|B&sfJ*=VUOi2lHF`g`IBddR}yKD&yRyz1m1#4?QjwIQ(gi66*|ink+X@* z@a0}n3o0>MVO%S}6kTnj|EaAc&M6FiQVYZTe3V#C&CoxPNw}XIGQ-ryX#Gf0-qB}p zuK2{fQ0 z-&nW?FU#l2ka~oygm-8(nV^iMbJULTQhruk%oPQlEL2Ce9p2gbR8jPvWw5>FiPrW? zPi~|xscCSHimK6gTDz{b;mqsmQy9v1?ZNs$g|0g%00Ry6q_aVb!ijbhNvTsqf%&(%CoDq6q?m1lK~BVknkqO zajn&=rf1p~wI+LjNTgB>g_SvM19qKwotsQFq{h&DeodoV{CRI&#+4#tNP@IxH=B$kLaIN3+*4n2jzf12UDO0bQJn4 z*D&SvJ4zGkIZ;r_FbtN~qebcluTyuxTr0tiKs(?N<|8JH(+R)Wn=U@ z`gnE{naNIJY}7t*RHEeqLIcx4zf4ay&VaYR1ZS6TGgv90owZ@}x+*d}E-=UxV zCTZ=1>Q{Oyz3~%bRWCV8{;bsI2J+MN@dl^(l0B$zqgP=9R9X$-dn7m>lIT-isdt#%x8(LmSWsQ2APb7a66_k~10Ntka6XZ{11dwc8-z7BJ?jOK65)P5-IyP=4`6xT^9SZ8f`7I16p6 zi7=Lhr%m?Klhs$uQFVaYlc*ecgn8Qo(L{YB7Q*LyTfd-mhtvNP*uE>Fnr@W4D`%iC z|4{QOd+3H@r+N!%=t_2@i*qDBNSJ1LAkNa(5Y>pX#=q#2Qb|4pn>Ua8lZ=K4djDN+L+*v{e&GM$;J z5SBwhll)O_>>tDKLwD&*wBi0Dj|ARoHoc{OiaAUu$~=9N+*563yiZNgoMc^)pbxQm z#@bR7#)h`{h2mgsq&P(%M_m`+Yq#kZ!cDCeX4kU0hoK$2k`s}gnWWYtn^S)n{mg!@ zgR06~`Fw4zcz}##Lc}MomsWtd#ZTmaN?+gz9%f#|?om2O{?I%rpqDh+(TFvI_*Y(w zjB#&yI6dFcg^Fdc{=-T5KL>nyeZO%&^+MTB*ON|&qxBi8Pl+_m)%P&jq%N$|?u4@R z#Z*Tw6Z9Lerb%Xb9ekn>(RFBM>JVkcI(j3tllQawnelp0x+niz`UO|%8H!-s>_qZ_ zvPEAnxygszG$xVFq`rXZ{Fk1l))Q-hQ{Ne`=o3U`u&cB5F~n=N0@EG@AC|bFHfLJV zZ<)>L-=L`VnwLq!?z0ZDT8l^j*>X4%8;hOglWGigp4~%!k>=oD>MfQ=|JN%L&0pwF z{h)26f9kX7euie4C=}J!DOKgM*jFu3E}%szRed5g0L6MTSrN?;$1qb4sCW)DA}Fm% z`ab10=_FIoT-{WAqLd-tqS>;VK0z&|Mj^>L3%$1a>_arVe%9YBr}b0X1TsS(&s<|J z$=lR_p>xDx(pm}A=4~K_hNLc-akpWUnTN<&nw3X#WB4-Ti4sg_vaj-t7^e)Bb@Z{0 zC5q7JR4)=wZRC^Ma_u8!Vl8B0c=MWJH#~{p$f4wDE`hqrbS5Y?Qnyo^V((H3x_oUS zS<8dRzLr)=9i`7C2VqZ8h%88a)7xq7;8~4CKlWy-G_n)zk!`su*TXLAr@or#NX;M% zY1h=Uihv1dcjhy(8grcAaO!N)qp6Ehnab0Xs9DtCTD0;) zxvD=S?lApWk~%_-q3+5J)E)XuwV=M2szexw_T(EV&MVY6>J%{LR?s3^RE_!qWx2W> z3gQR0Iokl*VrT84Mu2t{2cP(8Y6p69zi5q=Q}QUxd%P6~X$*WD?a>lhi9Sny)-NIdGDfY5p5w#tH7;PB)I+%Y>#C!*lEhuAEpwhJ zM)pKPVhZ$oxsJ^F4Zp;055vSGJ0gGh!# z;vpY{{u01$^?zQ54{!<(L+|lxu+Qzt2vpX)YT01=js@HDF_J@dm;qZ$P(dJ{M~ zqVTm6;X+8zM`~?wy4kJPP;Y}W*;otVBw>Rh>sIfhy}KElC{>YNxTrQ!4}&|mOS`4j zL^H5c>xQ553iPpt!MmKLR>XJH9^RFC*gN#0$})c;LEgyti1RYt85Io++v#!4P_`l3 zKM%9J*{XK}*ry_}&d#17)+M2yUSfR5KeI5Qg$+ z`4arkkdYsX4$zI_FzF&DgMH+e@Mdk1tWa-CfY-NCw?M6AnHaQ&)L>2A1H)PLFf29? zv~)2COl>W*t?R6U^?_}&y*YYb+S%6O^xMp~&)US+$9lp<8oDs`iB7m%J4xaEt-vTR z?W&pgSI*+>joGg3j=6ccZ}T4IoAXEHw|5`%RP;RzE)gz@C1e4_#S(A}ZzDI*e{eU^ zf4YrZ3J!cScbzM29Ac_vZf>q*nTJj!w{?|0CaiLVGjdS$KQSL-^Ww7NR>VfcR*5bV z*2Uh#lFpr=3K5^BQ@-lZEC%HK{`Kbf%B+`}4}YG^O#S{}=Gd&tS&y?vx+M2D&kp~k zAP2tnS1DI!wIHs%>Euo1S$2{Um|_yhFs9I*&<`^P`JEERJ?3;vN!y&T$Kj+Ec*{9^{qU_3tD*+Q^oy+*e>$O5fg*)Q7xovqQ0zys7lleCI%E5WO*ho19BO<1 ztiP+rns@N`j$i8cW$9HiDt`axNB*x1+1GQo<==5_ci-^X{m%lJ=%B-`ASUG5=v|fJ z+16@(+0QQc0KPtLiBt z1!_!luAr&0rHXZ)-4JmvN{T5SPbE4Fd@S^}@QK2Y3hylPtw>Vw;l*AR=pK_4(bQB^ zyBccc8|iGC=gztLEAS)j$IA>NeO1QzpJ*k>d*^=Udy9nb)6iu;O+15VZ?3igtBny) zwWi8=DN{I&Sw`PbrO@Y~DY!bYDBue;3@sIQNz>H+#4+j$ys8%s2Td`Scea9Id%}Z} zTcd^Ote8IWHxlm`7+Yvc;pIj87MWOdZn05CnEMxKXxRL+I03z;o` zq<=q{u{Y!7kDOoIa!xp_cyIfchgJy3(d2d(E{tDbbG$%ODhtV!NO;-Hh*!a1Y!(_4 zED&rPXdAfef9babcZIeH<>lviMn_@=;kea?L8jm6pO|jH=NKJ!B%DK!-Sengu?ym3 z6Pp!iT4+?^Wkr@1$t-rL_=AGxs5bVlhG}wyFX-HnXU_he)jsoL#*y@h^rv6fr{`yu z%UR;``09pw2p*{h_83+50k~J|u#?$pEQ{y;VEEPh3m?&FP&(K!5FTiTo+qDou=kmF zt$#=G13y`=gdXtqR6#a{n`fA0insK$UbfA*FSQ#SOC5(CkHTUj`bPGRz7Y32eoI2d z0&L-#h0}_*ESZzMr+_DNhGQLjhwtc#a|Lq0WDojXEHgKK_P4uV(mvn#X8ZY9?tV}6 z;C((v49L&m?D(MjctuNhD8iTOjXc76{;0{hZ$`9K%u}=-&KzvDgOiBV}TvQ zOKGgiK34W&8?6Yw8?~d8w=OQ{r9gAraHzR&o zffp$#b^DpKkXD`S)mGS<|^e<07Cw_UI(fIcT=fps| za9d2nIqtoxY7}*b4H@E02aJ=sx>N~my5!^!V5)HxDSumVk-xpy>bd9s={f1o4waQg zEAiS5xa213qlpgG0p<`IEc{?g&o?yV8n9QGR_q4&&sq4pUW$z5&M)az^#S@{Rj8VP}bbUHWL2$ z)-mhi1}4ra)V#>cq!lIJrW7kZq6}4vE7~+V*1C%d@+Qx&{INN2eh&S<_v_VQ~fS$}8!qP(C!&KgL_t z-5!+VdCnAfJI_MzP+#Rh`A{vfzT8wBPL_aj9?q@;gE?xEQl( znk$I4KhAd9aXz9^^x@bg@m&hMDD!ShrHydUkOsC8l))tOy;Ul6fu><0jghK^B6jTd$F8U(~E2kNEt@m!99+{n+{I;qOrH7}sX+ zqQEF|g8CVX!xA(SuR*u(Eo4p7KnY4#zKX~Br-2{7&ECbH4Q|;byEfrf+db8M#{v!b zpW+Ysx|*QZB8wm+o67Am{9|w!KCqLSrpyq0Y(Nj#T6Q~|0b0R!Lq*eHmfN=f9G39I z5iwC`qwB{Wjk_FwDq(A4=YlN@)h@K5V6lSr6EDZ>akiK$j@71#Tr%}dY93tbt?SCj zDV^2f=c&wy%z-}+{W$ltR@RrS_?)Qx&(4MJBwuv!BELjT1p&A^QvZjbcYM|o)iTNo zw9uxADSWkHDSv%m2X94hiuW~A34eIc`$`A+U`xR-j*(;4Or*U(l9SP8IDzYnzMNRJ zPqj4NHeE9Bw!~PwShrjI*(m#M`#Hz7u(x4V!s8>BL>!7xBCbWYj#`Drl8e!OWA4Rt zk6j=84&9BZQH7$SB1K1<`7$?>89=sHHBkvMftjAlu4L!Myw^F_oT!|E*;Rhm|Gh7} ze6EuFN8a{)#r4T;K?A~+U<7*dUSf)Poo|Z?*Ky%*;T5k2Ex|r$HT^qqEwDb|^gs6Z z4Ll5v4YDuybw{EZ=u#L4pvb(I=rccJlNS!5{rkgJt zX41Uw*OIlt=n9u*PI?#o<~P9svHNu%|ty~x>cr)=Q_|5UuDyk{f zml?^mVCK_<87J4k7%=jj&D_^=*Ie6(tIRsxrdqmT8aB#2k^5#UXPId%ZmwyygR$9~ zUdbhc?A*iTHYCxN$hv6bN?~fCv1Arq0_x;nbPEa&Osy}R;1l(~^iuG_-N0^r1I|=K zrBcELquUl7%gSV?lRdSg4PbCtv0}``QI3@X5TNUm_(5(*p$qli}~E%YO*% z05c;(K7k`dQ*|_EW7Ckh?un+RWqJ-V0<(y*;G;X~k@6>PD#yT6a~C~f)2JClF-%cM zuwA$gNU~QoJm&6@+o>GmRrVaYg)7L~=(WsR_HV;+avwRAPM|pMPqexB!D&)gml71) z*Z2~x%>kT>{Kz$qCdM-vObxxVa!CFM=OH_Bg!HT9(I~YP&aV_AK$jAqX#J?us)x@I z{!_=RP37I{I%c-igHM9VRvQax(}*`lGaV&c^v7&zY9`dH z`EX)3XSmQ9lTO@DBNa2rntw zpG=~b;lw^yzU)Vu)xeVX)uGhZ;J)Buaw#-`MN}FQF4_WK;vlzx-AY>JFX~zTy^=>x zM{n3HX^0%89*|eydEUrwH_Cc5Wun{xX$X_{8BA+d%M#k+EWJc5N`JR1>>2kEt%32q zxJ!>T8rj0^1)*y&-+YGELSY=w>{anIQCHLblu2|l*-V*bxkVj* zI^-Wh)iICI-zxRw8uUOg40Y3S<1BHL f`^2r8j4p#;Y?xN~won;3|^O<7Iap@NC zV5`wCVYd37d52RPsoxcn^gCo_QD#4ym-D~fhd`BW8Cs4m(>uZcgd*vg#f_&g}r3Eqtm4poOAbZk~A}k7}8=n&G{QcFH z<^-+2WTVB<67oG&oWD;$C3-4dwf)3NkOy~Ci9&xh!#a}O;OR)E*a)>Rh?4~j`Qjzv z2^+)RQyp>%W`r?TzaZ4nSZjIhsz)=Qv-Zad;1b%%-OSJFzGOY(Axl$vE`!Nznkfx5 z+$5%G8klQP=HO^O$+|{4 z6S{KnFks$@Ply%9XxS1ZxVwf(aWmPEoTL9sliDA8 zb9RGXLTQ6jX&X91@1Rwo-UnJM<4sULLlMZHKW4}9xA_jnpG0fvp^|3J)cSbS*bj8I z;3xVo#Hg2pII<>~Me~LnsSdr4IUfqD_oz0+b>=Dcr!ZMR!%orWE5}UNglpPTs-iVg zobKKiwu#*zT2Hqz2IV%AL2u1YG>lMQV_MlnIjpocZX$1}^~l<4I_aUW@DA#X)#ods z9JTZ$h6`c1!y7@fP9u{+44B21ks0Fv=Da6Xdtu5E$4F`XC(h|6w~xj~DahZRlV7C0X_EY^L5?EJH0J zCK(9zlxP6k@r`zvOhLD46QYB7nNnFPu)*}%^jg_2zE@h%x%4QyC3j0&K|azt=`9os zJIk6EsGyBEM3FJXJ%0^rVQw5;!&Q)fZNVQVkJJAUHT7R=7&BHnLAvQk;T7qkc}fzd ziTAnQ|8up|gNZF_PVg#JsvhcK`h{3R-^{f1lZ=^tC*1}A&Z5ncHcE|6|7h{lKDN6O zAL=ZZGi+zxY%r|0dV5XK7p3Zdk?I$lVpQV8Wuzt)a^&O}wnVPCwxvJnajMA#G z)xjv5%TP=#(M(S>JPq~|pK+;FU#bvQAL+1f!K!j&%Po^ZEgdoub(G6wJ$*F&lwII= zP-ep;;hw2EWeGk5``{$iin$C8Zd35B(uU}4jAz>k798M&56`D2)=nn^>%AKba?=yu9V=_Xf>?SR>S z7v+;>JJZ0^RqJa0pikx(GUH5A(4`*6l!sURg5B)rT8A=~59t5(t4W}A)-%pl_xj?{ z;TRJ%vwxV6NU6k1u>vuU%a=|=kDIKH@z_;o><)2iz(rj$991`l&ND4chv;(NnL-%z z$uL%Jquw_U4ZI2cZPrPb_=D`t?Ut?!&#A{@WjwEV*%D(gs0Vz{>ukXwoXf~5VyBxK+n_^2ajhca@KZNb4d^UxFz363h@;I4J_7uMnUCcpw z4(9R8xbl2;`j=&(uvl1RiX!I=$%NUuNIfUm4CTdW?68Vk?#Ne#FWeHTkeY2E)mijj z;XQr8csO)TZe^H6z2x6Rhwa8rga4uwHB~JrHzieRrMaV?E0@sYw5{YRWizu;d}3Gw zr$$M17OZC9GfRbY%x8Kxzf;a)*09H<7p7{85c)zr)&Dl0B1yqcucMm;yAu0M8QK%} zqtZ$$XQbtuWCXoezCw?8l;)c|8%Nebn?o^Mgg!v1NKa$x@ukRrEI){U`AEHxX^!s} z(JgF(&hiy#j@#}Usb<@v>~{Cjz-sF&vI`NbR?r_B21=@DwduJ1bfA>7n`vTvs`Fa&v%&Sd=VyIOMiado!rqc#$^!62K0H9uASKpB{Wp+Q6&t}E`i7s3`pJ6TXB znU9iFgd~5YrJv<5zMwkaR!qF^AHmczuQi%{;CUFvDpkbphAw84Ka!Zsu4ChZqs7X` z`$kId5xikqOYRVndm!c-%jyO_Pii4w=DM;qm6bSW6%|vYIIgaBL2#>-Vayjv>0iSh zZiujwxXG;Ju8KbIe(MURlh9XbW$MYeJnQK{m^;2+mQ+h4__hD!MoK&N{#-HPt+BS= zMokfYdPVyK_bd7%cLvVY8fqGO5&NSIvW7epD)?GWFg}!PfWrHSE(C^J$FYs1PjW4E zi=HChGxMn)%+BCjX{_nDT%JBi?`OYiZ+sN7*0O^>CLA$of&gmPB`TlW%#;*cN?}+J zS_n3CC8mqkAe2F^XS)gm4WHnz*%7Km=OU-(CJf9XcCYgxX|>EDR;dY$#6AwJ;R~VH zq!{JUUhzMf6~sU>T((#jI~wN<4@wDRL-$>e?eA@0_*!|<#-)z)Vt$~l*>0JaL(5xZ zax_x-gWjZ9mKIQ_SrZa2dzhyD3M2~)vF(`I$^>yg@yxu1>LDDL?pwyHv%KZZ#|-Pl zL((I-N9vG+$c|hCegd&j`-2RaItjx`i7Adgg`LKo+A?Ehp-GT6G)J09)k^Cb#-ky0 zbD8dd#_PiDD_MD_7Z){oaFQla!82u0Or+ioI&CQa2 z;r_fLw1*GCGG`6lWbrX=bSF4)X3va(8C16p#wgdn{Wq0V~4gy6nc;_8P8Z@f<=mdC$kLvSG@Ad!0Hf%+$p>&ao)QtwGsa^hOnsJ1?w#muS zr6?|co6;%lh;qc=)$qmkK`N5VIgT491~hS#=_m4!{fMe^FRNYnL;Tn17eG|yyh7yTA)Y-U%dL^U=!s)xliu6=zotB3GWuW-WurvIbZ-R8vTE(|W ztzde=n5Y(FY^W|h%X}R3*%WJKU%1}WxC~FlpP?~i9W6u;ByZ~;vNg^zO@$;9P3gw< z`la9=ri7HERxw{!vO_Dl4on!?L+VR=wP<0bIg2VS%%wIn6a9JAX=6(8g!+mtmT!#vnDjGr9H z)^E{+jD0kbFJhR^wD;E3gJDOda>4rM|K;oizm+>==Yp$*aBiRJJYQ0|Nc5q9Yx9)j z^i!<-dHh##v+bb%Md>CiH-4rcx?38O&7$zPy4JWV^iV!Zl3XG2hWt zmQV{Q2FD{(c7IeivO{ssnm`1(wZvF43>_v8VuoIW}M^%%y@KyfKd9>{#Dr{kq{GwL<7DHev6w zX>vGKj|qzB(Pq@!aLE|yXZ4oU22Emu>ON+%vP&{CLH!L`iM=Wums=YrsFU~s+$^@I zN^5EK2#FRdTQjNd;zgn)%_=|DV``Ls*Zz{c<8>=Z1|OKuX45dkT)CxRROecE64fwt zxkUfv-%d!(UU3_Dj(ZULA!HDL8Ed0;JkpY;7jeF#E8EkQ-%?$=srf%&qP*9zk^K`n zBBQY?a~e-eH_?juM8*;I)UoKlyN~&BIeQoGm3Nmf#dyS2mXc-gofI}u#ITcX_rGR0 zJr&(F|EmAV^9?~}iEvB#!oJe)hxQv0l96vB6)=}NMf6g`lxFCc9RprcIf^7Yg8y5V zknv>R8~C6c5JF@1q|wb=Tpa_)iFu+0=Ob z7Fk}cr>+Lyau~5kd`mdcmhO)XWT$o^at{ZHi{F@(Jbc5NGE>W1q9r1C!K zt^Vh+BuMHDh@ADv|D-qaLER5_=rOekxe6q`(r}C}Q`+i3$og6ooEYQr+CLG`NJ%Xv zHB}zN2bcir-cDK3)2RpA0ouY{!i4^?wu>G`PGLrwYp^Hj&Fn$eN*AJ@GNVjWjm5cj zP(}T;hxW6NOj`{nsOv;?e9sf;(qwi0j@D4Qh!n~ZWu`QPugb56FMPHbB}@%A3seri zf%^`cT8))-LwvrVnV)?9Y0s>rA+@F*_Gi zVxv|Z&*Di?FP2I3gZ+YkhQ@?W1Pcb&1)BuU`0n|x`B{7}D>Rpn-~*uvf-DXfw~IxT zt6;K*$z8R}NO07{^!}*IVLqdh;Y2g0x-lGNu4tMuW?@eAkW1#;gEx4~Sjv71Jzzk=yhf`I@i;?@~VBKUg%d z%3t04%Kf(|94VSPzI)!u-eSJC0ek3#kSrAv*9e8Bm-1A#De~D%@l#Gy`l*f4VYgjt zM3o@Z;lmxLogqF@2dMq}SS3%}#K=@8wThjAY4=K`uPU2{S!S7rSdwjT>`U=_=7e1f zD->}cazsSyuw3Yrm#i;M2aOrV3fwbtv!16GQWlEw{QY29pfD09!`&6#LtTwst6Yy= zuUtFa$2^g~L;erJZ~PTuxwufCukKfug4BopWn@HBL7`l)Kh(w(5&B`QF8#DHynhqb z2<>mRvfNBNsLLvWOy*^39le;&Wak%}gQ zxf5~UKFM0ba=|p$7|pey%4jpB>HM=`)!+<&Id22dzlp;LBhIX#En$9^_$v`n@Xvi-2%wBK=zh=`4@AALG%M^vMjwXttwAH~*;EgaoF z?6c*SDZ+G;YeOy2PRNHtwS6_bo4pa9Q~85(O*s>?cV*Ye*_eARFPPUSKh4?J+aoYD z)LCpKUsbAVO^DM}IJ26a%$)-DuM21ki_ioeBEDz_#Vs1eM6s&aM5w@@54{XM31#!K zk|JA`!I;hUCMwYP+0%yI#$Tp4X!EY+*cRR>vO5wWgQ9*%KZ?<#o5yN#&Et|{`o*Ng zxWaE+H=~Pn3%icIt`$SJZk_j%ySitM`*r^NoK4w|>@UC7?1#BRUi^vmG_7eA$z-w53?@^aX}smTbqO*EPwZ8}R@)nPKCFC%64^WQ zOn4bI%&v(35M487Ms&TX=Mm!_ilwhP+}NL90FRO^rH0n|%6j76eO-6*kLE7TIi7vx zwp%G75j(=BKhRfJkiP9X?wm0Umy z34}0&Uw|Iap251ovcWV=e;0_$q`62ho>3R*vQU z-?cl>nKK~gTXv`H|92Q@@!u&z+ zq&iUr$Rz!{vQgS0l;UfI<_B*CYN4tAuD?}aAlkDR3RcM{k5J#ivD%#Cm<8+&Zl6Ij zj54+`4K*iPB=bFUgvDZUSV~&k+Rj+lTE>B8z1DFC`QcVb7&k>ms8&?dsEd(1!Y|sF zSZbSGTrceV8Y@Ml@}Yy?ckavXHZEUYZfiZ-MW?2=7-ta86HwRI{3xttX=UuA^L0GK>H6 zX`z9ku+WxZD@^A{f23R8et%_vL&{X?U`*Y3u2 zVLC8*%o5hdK4E^dUkpEtbxf7a)8H%EY3ty~3zNbtMWlzfj5r)Q2pp?~h;?Ci9Tgp0 zt#6F2xL34G-=pl2WMN3?kT2F#z%#}(4}PIR?iBYXc!PHO+5}Pq7X!sZ< z*2-nwNh|>qx*y$?$)wxTm+75M7#oLQCD<>_8Yam6U}oA+4? zTen!_Yrr_dZgf!v27$X@lty&?=$_e$CdQ7vz0m>s&d5^Ntar8hqq@FUP84sER z%OSzji`fI^u?@}^voMLiz@-`r8P6J*m~3W`DQJ3P&agpd{!_eaM@oQjqvY% zO#^aZL12Y{yFVC642=sV@U?}NLRBOb1HuiFmdZ)@q~dbElqanQznQ@7?Tpk{&|5w*}fZJ7-dH>v+ zLXk)fflyKq5)uLgLI_CqCcvo%QUs*Is+?byj)bcfId_m3{ll=E{dxZn1JN zb_|$~?7x2H8LNJ~>e*FCfv+!QF4TlI_pz(mSoXl(ecg%Axu|*O(0>mv;5!JPVF%|E*zf%A-fR2*tM_?!b8Yoc8Fgv@HT^gDU(xq!@2vjC zqb?t{Q~wI~TkIcofB$35Dmb$Lg1#I2?&zO3>TCUT`XA~aGwRg-RegK*e~JAA$M(1S zX7=CM_vhZLdVke>aqkjn;1rOc2YVi22F39`f9U=Yb0|;jdZlr2Ve;^cBVZ$=dpBSVYq!2*`_5#x(y4t1^-b*Cw(oO&&A!8sf~WMK)IXzt zao@dt)B8W$zd`@gy-)Ei`fvAk_08_>?)eG37v8`(3|{GZvS+aS!<6g0-A}S-P`mqt z?$5Bx`~&Pz<-FeOT9aB+hIb#jv^l-`+rhbmLj!*q`1Zhi2F4F;H88y9r)xgB=H@lC z2TmF|b>RC01MI}N-{7YQmkplU{4)E?-PC-sIcjK2c1~+E`|k72A2tseS_U<~FtlXo z^`Y6U2)nE`fgQN|8<#aEvufx(b~n9({4{&EV$RAk=7yf!a~Izx_(;zsJzKzspXR1 z_p#5>7mVooAa87H5bs5(-=JfGh}AK zg63gEiz(X=SmX9N<|IGP&h0;I%w)gzBiM(IuW@y4L~VbZU2XR5+KzGUlaV#gz>~jZ zCFZK0?=T~CR^P?FU+KM}_t)r3FLnQW&wf1@bT4IR;I# zVy?3jKv4d`loqVRS+VJG|_o&~c z?7@Ct`?>ZJd|Bc!_Wf_LTJI8ab~WoH*XtQg>1K5wNdEWj-m-fds|@?Qzrb3=SGq3k zZgrpCvjAyzT+hqw#eY=ynb-?wGfVz$M)a0~ijC|3ZP!U%yD)e9_v{6~F?;;YYuwQO zDEqw)kb}>%xBAzxJ)dh`+q#wY5?|)diL6k(jM(|i7(cN6V(VX9uMOW=%6lt&>ns|2 zjIWk#I{Z~Eq&-_rq~?FJ8~T?h=XcqI`IEyt40rQ|ieE!3e@B^r+B%orDyFl${-to~ z!K?*rGVZ(+YY0Ece?7$N%|ltecs}0)_(0dcbzRhTc-JwU&%t-c<-NLIYv?73YBQcv^Pq2L=`XLaq&w=2HEjP}df6YCasqdSZ6Ty~4= zXU6_~{_Qm8wBOfW%&NuJ?IFICunW96zJ?Q9D3tsjAgze}rLgFIqqBlb?X z6}hw>U*-KW>pMTyV$ZGC1+AM&p^NmVvPab2d~nZQq1(}+ZsnT>=TSd7X2Pd=v5*qkp0yqh|j+~{rG#eRh6wU2JE-(JxgOFAoAJ+e2u zJY7gj?twjhHMaEsfrsA1)4PDR%wZRvJKBF>e*JT3qvtgKNb5COk2;wZ1Fy30$`{!U z@oIKz_yxO8oeR}{wf!6R?Z2Y&8Y?HK@db=0oR`TCN$ar=^pEYIu@~Z{wBhK+w8l*G zwUTz+oPXMk`S@2;vVB+)dpNs%oy#`?u4&)N{@cUw(?=WcWADXn8-vVV8ABbl*k}Li zd{yoi_C0)u8h@Ua|0n+cIm)|&6h}b~cd|R;di=|#>?!$s`134y!o3(j0=J&Vjw=U1 z&#$p-7jq=}n!%f_eqGADPm#)p+Q+k|_x-Hex)Lh*6E(OyZF4c}vwy?)PUf=?!j@yE~988YC*0`( z;VfEd2J4?+hU$MxELLWe3@<3IX^G?6xAjms>d407_y;z2qr5wC>{xhVcWC7R?i`9t+qE%~ zdRg9n5qgng9wMJVrwn&M7mv1|AV2p~lH0hxot2fpr^I)(ucv+HvpW4o!oQ)kcS2Ry z@SU8ic<&y{_&TK<4J~cn7*9=aMp-tXx7>i%-;}E@;jU@?|A~z=oL@%0pWZl`c00Cl zG`x2-<$HhQcw$cF{u%iHfctRcG${Pi!gKpg_JVu4{Z~SRtd<+s zn9!JlJh8OfQGeS|x~+&aC)*IWGt@Z~O5c<Q0y?&Z~s@!?@d_o_i29Kjmvq)uYYGYHJd?1y%HfcR_*+Xsy zq0Ya;TZ@swf1>RlfgTM>ugcWg11P zH!Jlt6}dMPo|!{#4}j{9p|wvYN2k*Ay0Z#BUjPk%iN5VWpyUhT$Mebmr;sln;^{+q zZ(rWthcfOl(k7dc?+vIgIcR{kOntpUJHEi)0gtsGfOqeJmgm!BT*-Q`Z_*pMKkk3x zzD(c2$}=SU*YUqeUw#FgdnLBP4|)1W>`fqj|AKzmQaysKd6slnvpeC2g+gXhfQ1G$v-9b>+p3vfC(%Kk0 z>4T>Fpop}OL)Rs1)prMKJc|BBokMOij0Trmy#um`lhH?_NOar;4E??rMP zF>)MENO^K7PAMdB%%eSbr!97dW2Tah)U*+$;Um%XAuISt=}0PCKwCV3Z2Kd!MFKxaz1-HsM=Bdz>1=-_Ik?T?_=??boW zg}T3m`#O~T4V-&Kf15bnx67Sx5%*;XtZiPnnhc*s@9*#g-zYh-39ad;sIV45w1Z8hiWdAtYs&7Q1DQlml zj{k@M`y=&sN1^HY9 z371|?{(phKa3>Uh5A|;ume7w$F{`Ni2LHSs^{Wip28!4b`8kU+><+E(S==1*yEjMN z9O7q>Nc3rxVFxH?d-{(F)WW9pX74IevX{~flKz|2)(ezp5hb#hd;~hapK|?y`urWW z`fH9m@o$HIZl>LCfj4iY#I~RQP0*6mb2n{!Ke=C6^1p}_U!d(-@re{z&7OTjl*5v+ zL<4?(7x}Oc-JCpajoXGCPNKG_mL6{^IiAAR_PA}iXYV%wIM`ud0B}ZcoU6k8Fcsxvhk%t>CZ#!i;AYS7*2Z{w}{^U8T`e>E-AjDXK~MQ z`~_Z=mR}j6X9ik|i`MoI|FMF9TTRK=l=|Sa6eBsY%qg`c)u|)L??F=b6=|u=?5AG! z)w7JPA!DoS;f{Kn61MZUck@OMby(ju&Z|*4)5@XmwJzLYFI3(7)b4tPljP5Eike9@ zK6z||@~pg8dCqse6F;$D<=MQG=aX{ocsHrq+l_<9Y~y$1HYp)Fa}(UgBX>dpQiDgw zC0<`y5YA4YD(9!1(v`Jqy;^?jPOY`Jhg2v%*0Xf&wJ3n$+zG{p^7CeGN7FLRb)Em> z;T_vY->|xJ&PgK_k$2;T>J&A3h%gKj=RXcj%U&EogZx9&t|> zZj!T}!u=WdB>G7FCkT13ChT2j>k8*w#SK~bE9xc6#ck)i2@oDec z^E`^yW$Xg9{e}1o=#d^Sy1)AWL*+^x=VAJ8HMjeUKBp$Pu2aABj=tKSzTx|eZ$D=! zhuWXl`gzVfrl2z}@zD=`M;$V`(IQb#R9p1C5Pu=glBZNppp89VN^9*rUJmQfT1;L3 zc|?X;*Uyx&{^BCjlyX(pEhSEQwshoBD|?=Hv?b$SEOPEeq@3>M5%*UpNsU{I&`J%Z zEQfNWzU74q-$Bx@C`WpM$bS97LcjI`_5fOl{-k*6J(93;V`Q2{xdn$k?A9Ya?nFXr73$Y&7?aAO#<4@umGtckgEQ<{ zde`)?YT+|D)Wze}CU-8ng8IUY;_U0y9rU%U<8~=MvoRj&ccaD4rYDZGU)DvdQ+r5w zHhuP99CPTsjrA(mdzMhN5BqkH=qFVVnNzeAHI(Qj^%<{x&otFnOg(9;A4G46eyJW| zPG+MAsWYe#X=f$(>Kf6J5-+B-+ej&Am0D0+wbappyh=@3Z_}yW>BXwivaznUadui; z|LQhr0q>?oY#&=kKWFW>sc1rzX+!NL^~YRkKdIB$#%b$ZZ%5lp0XlW5?Kn#p>SPoD z##cM_jxIE$F6!0za;^Smyjq;T*J@~neIxpv@y5n#^4Vy8d0xHFP)#eT`I?XzCxAM=*!kaeB<$WsZ6AXrberfm6%j0{MoW`5 z5{t&1g~r5ZaR*nqZxmPxg8#0bqO{7JX71**pI~r~UmGo>IqD=ZwY~``T-@(P*TxFrt?lqo(S(PJP1g^SqHb ztq`qsZT08TaMf(%o*Q{@Dc3%u*1Hs^&GIZ7vA!{ev|qfZ)Bg9V=+DoTu(4tV9_rWC z-rcWr(t5@d}gQ%YJE6APbzmiT|LS({F*NF8N8%|#rEGih5h@RL>5U8LqVopln zYSAf|J;Z}LPINZ7kSMVzkkVbbuT$dN19V)_QhNyd3dh9lJA#%*vyQgCZa)*mH$9O( zl0A`qlYNvum0GU8J(zf{=W1Elx5eUk53z09k% z?QgY?5@X2zHodU6VznHj-&V`9+K?5W_N?Ap?M=^#QR~f9oj9*!zjfY=-kfLiys4=# z*C&0y{zFpm>1yTXj=qQb#H_WYi$-Co<2p5v`swKVRlmqtt0AblmO`~4Qv2G2u|c#r zY!h21t)+cpD0YnPSFM`pAhC2}>s2c$7M^xf)k8u>`Xcj=KuBNFMWnOPU~mU@5-HPJ z0u_%CzYO(`gQkO51ou==QBzSn(W$36Mxllh99%A`yd#!bv0PD2(Or?=iU%96D5QKC zbhC10t}DVR=SGJKHZ5-(5}T3Z)n;_jXdL^iF-nHSDl3`=-SIjoPeuXs6B4l$4;K*{ z7}0sEjPY&n3*u+~$W zd5A+*EXs2b-PChMrPLOy=4d-9&(eMs>lW=6Kd&yM7`DHXEBb0^MY?fpr|PzKoJY#~ zf8~}`86;vNw5-J+iB;`(>3i~8de?dv`;hV@w<5{HIr2(u@oJT?Yndy-g2Kpo(fYNy zI~IU(9UEQSU0f^{Lqd^u#&}QeH^vdLyjSHwm5#<5r|(z>M{Z@mSAcXD+&sf zl30%5Lct>}z2$dg%X1{UVQa=Zs>o0<4}C}Gv{$NyV!a3Zv0v%nF~JxkBkXh159!x- zRU*`W%JGcqlnWX2kSa3Tl~GBrojnujV4oP-P)EF^H^ZaX`k}_^XWS!}OeBS)50Ms9 zv{#{YMv;t ze=~*>-V9HgqdJmf=`sT5jHZmGse5FkD@bzm5M$Lq;;h9gdp%p%)@}5V$Y-s{*p!Zf zZZy(r%5>W=vOVKe@~$ntNuh%D6Y{ZiQK`lrL}!1Kv-{`E$rB5;ZQBSICk4g@ag$c1 zSh-dg^lT?+IvgNATDhU}Rn8)=9sR<-+7WGg^NNzCXBQt3G0S*$(B5ERq6ry27A@{z z5{`U3)-6UMzLgm_q81h13bGMjEJO?>$cSi(p&(4v7h{SOVF|k9Y>ePP&i)g_@yd|b zL4gd51|7ld4QKZ_SMbP@E5k>W`#$5{JmXns+)+6F`p)6yPG?4lZ{=NQ5#_!5uGhY) z%f0#^Ih&ijYe;8W!J^D_uqi`gUp|>qc91N~dvJNfTCt8qt;FKQn2bwElqwjNh?IC? zP{IAFciX_TGtYElO~ILR&Mbx?m+^xvIYO{Ec#>4n!9zQv0b)vGsv=CmR--#slu1gH z-b9tsJJ=6Y9WXtF{X?)|CH^#M+AHZgRIV(S(j(W^_^QSols{6vqS85MeuX@vv`;@+ zLmBIdtdFFRjwsHp#IKyU9lWUg&)L}Rxw7AtN9}9X9TWDhyc-PNJG$*lOuZA{uKevR zp88MGOEcFcBNV~h&3CZ&zs1;{A!A=|O~n34-B@Qqo&b=S|WX{tx?^s zrENN+Q_v5MS17?YuVYlf8>JE@L1$)6C`xIdT!}R%sk`zgjbfbmejK|+KwEF_inAN)Y!VRQTZeGu5_vr*mG@%_m0Fz&U9L= zgLtPcl{dVkB^n+jr&Cm)k6s^KJPMP~;NDDDKidJDXzl5|7#a3c1s?lV=i+WG& z!q|w>lB%9p)T>4pCv~o1IyDq4sakunsdTmUdRTb1aSoJDUq<0EtE#@RLU6E_i zX|F35EjA@?r3-=;>{(RVnZ4r9FB1;dwJwe<8YXHSY|L{);=wO~q6H!LN{mfE=vu{q zJqP!#xbD(|%?0nxonUgt*STMr)8afZ?b2zR%o}oa!Eu2gi}8)AV-T5tl-ADZ#fm}$`fouQp$_T9@s5rYbJPVf(3baD zQ*8V-*zIBvj;`oLC|Vj1Bi2LC^(uCRRIbIK-4N@&gOKp)A~>TuXTR0ip>mMeiyRe8 zeqBsPT*f=$Lv8xlWOAl)&WDcWCco-LdBVe558C^3cAPU+A_24-lm<$L*#G+Lx=4$l zP2%%d%YI_73RZhhg@kv8UtU7DKQ0~@w2N|CWG8So9 zv4~)0b>>2@>P&{3it`YHUYKg$RD#xd6k@MlMQ<_`7lb1+HZf{giBbr|--M`(Snb%z~(+%DL7i@F@>O{?IhEJi>mi(7keE{+t{jYq~@)0HEP=+R*rU!?c-WawQO|}Th=z7PJ647*y{R0rlgxm zBNU{rACxKxo*IV~87m=lE=AYbN^(|bhLQXwLRIBLN9PFE*pWj)B7e`jO!Aqh&taPNadmZNXDrnToIgCsU|<=T&0>)Oc(4*eyq4d zc(~f6$`H9;xe(u&*r!UBeK(8}f@W0|E3>dFnv(OpV#|6bYb~{U zoEKE*|I}GrowtI=bZp=}k^lByCtv2ztGHOu$+K8oY$;2YIYRoD&6wC%)`8MeWUoqf zX92~ws`8KtbW8uEBn!f5NR+{zDlUDR60Y`u=_Tzm#VabN5t^v; z3~PTb#n|JkFN`mGfT22fGTMqryY^I&_Nq_CimDRMapSsrq^=o|enoSYb{i1NY6f*U z={#dOv8yu5BbqE?Trp*@wWqRLLnJ!uUn@$Tu_M>XDGw`-Ezd;;dJZS%oNzQ;`82%h z2$r0yudA}s_(;rX%GzUjqRzIK>oX#ju{590b?i9*!BCaE-p~A{jQ-UtweF0dMej~- zJNoy!Wl$%#1fFYJwVbX3^q$vwF3)&v{Zv0IimLWrYp$L%24M;rrRyrGR?R&kQRLv9|26QU(UefAdW=G1z1GWLY2{V{j~=+Uz0l7Kye~IixHrdLP*df z7}ZG7y?HcA#@cv_9UY=3{b7d~oiUm+(qX#B;p$<3 z4D|O}d7;&T0qrTG`1tsw=L`St|99~BuJWkpMA|nui`q-^@lgPvSwU*3syTKZiyAH( zO89hg?wtB7;TqOyAIr@zbaB>OQ?)$QK-|cYGCi;XjFT);nT11Li{aI(RpVdSrvqe$xMJn8#I&{DtHyC zgd*o{V{=3TKIxk&8Ydx0GjTa5yQo3R@Fn_U+mf4%@O}O~K|A@#_X{o?TsxW}@uJ5y z6wTqBofESM(kG*-VsxBi78-#u-0>sh@o=uWw&-zn6PX=xgr6r=s^ zD{IcL@C_e^eiwJWv%x=~k~2Ap5Xzt~Sq@BOa1Q0i1CeW`L;dA^iMwyf!KxlsInJ^S zykZ~Vxik8OZ^x(p=r-!Ss!@o~FFRXlonm2|;gi(g(Be#m<1yd+{q`{TGT=%(6;s*{ zBT=U`kDG}ZyVRib){`4@F3W%H zJ>H4SR9L=~UHl}B>i?FgYJ`^`hog;w^Xye>mW`91_%tdmH~vz&h69pX-?NW@czO(ISUc^YWh>V@ zx|B^@xCTeewlPL4Ik_ojW$7Ad)AU8pb+fB~73cTC;1>xu7KgxkTP3sKu952+a!7EW zS^VbF4)Uqc>UB(hQkI;gcCCrSEFKz6jt{XkQ~>Ew>84vTd@BrQEs0O0<<8}kKS?j+ z(x`j(iId$0egoVySX7*FFC9d9Iw~R6lWnvBf1YqOgD1=m5p!)8?@p8f1K+g)HzFJqo>#{ntQSNsU-JMNZ z>~G!v3f@p+ZY)h0DIu4y9$~X&&V(o89mE}Did-3{QY*{jnb&CF6(^XiK=cTh=~4az z8=U{1WK`>6nq%GPnv;~Ez1C>%RYZKGswLBRGCy#M_OWuv4?@eYdq1W@&siW*9(5>KTeiFjw+|TVArxd;^-` z*E=w;TQqY2n&?IUnpFRJoslbY@$u@X#`=$UVzH1jr)yrrPfb#n&L%#I=#HC3Pe0c# zwKAT4CZy5H0g%7>lZn%l^fuF3dppmT=`*ENgRz84J+bnA) zcKF~rh^SJZs_^V2wV!{-ptWeVFP?FQDCdrEOJ<{Q#Jzx78d6_ zM}>Nj0%ru+2=(082ChXNndzS=!Cj8pl(@T*|Jy#%Lwx<+ugw!H=TZW}xy~%0ka$qK2Ip)s2k_ z=8^E`NV>L?QnEpGM+`1sT*3~s%S0Rv%L~DoSuQ_0WsdBI+Aj7ZPQJ^dL&d4h;p=5L z9D7TF5BEo?5ddVMY*TzIGcYa-l>|H5oPv*=DhJPIjyj*)!<(pbG}aw`QdzKeS3^J> zn4@_heJjBtTBLAz8Nwj3+SVBT?b_oaAEp#?sYUsC5@o27Kqjl~+XO!| zlk=dzPQpaz=cbi9U%I6wI%vRkwt`x}3TgM5C8nknndZz@XEieOSHG1!Un**;AnaXz z_SuwZBnOaOm`IH%rVVK*1+Hl_@FPE1M7Z#bmC^klfZ_iFhtvG`MH=oD8e}U%fEnv^ zJeNkwHwGK+dvvvh8iy1#GHo-~!30sTg5qqarJB2M#?`iTWJv zz=rKuJ(j6>L$l0u{-lA`9$tB!{>u!ul4+u2n`jfV1I~U!4WwtH%>!@!u#@A=X~TXc zDiWjT0lwp;ZB$o^9(*Om+Ku-R;OGIzRHqz!|B7mEe@FCaJEaHqdXHeHnHAnR+6;=GL=0X+0MbI`uaU#2+?tq3h9U(s}QkVBrNtR3kvWQHUt zN9gIdHn(=g?lAc}ldpV915)7g>v;E9@~ySxD0|xJU4F{Jvh0ID@6R{77Vx$e5ed`B-_fWyPKYVO`^w1O^lGp?v?BGckVa+>n z_e)Xr9fXu3l;yJhLi1pR+C-EJpPl%#HI(UHk``%MWN~1NscV9jF&9lr&d?wLRav7}Ok_I1XnwRoZfh6Ff6c$$#N;as^j_g_N z*1lxaJ4HPwN%uCW+0sFv0wQoZF)0~Q0Q)wCNWkuhZbmZYu-Yh@CX`6dZ&(Ub3pHtI ztrMZ0y-qtKH;0c35FnkS$I6{5)xeLV^AZX&9u&7A;1?Jsnv`cI%+$Jh1J1|~oA^ww zp4;n=OOJ)N;9rl4hN5um^5>82Z0$ezxER6eh)RG`W~(pGDgTa=FLieL#ZU*oo$b=!|CP*Nr1mupEk<{7`H7A)?7o zsq7+>(KaPwgmE}NrkW6w3O~#?oGNnoa5CKn0}qNydegqnV%OCF+K9(#fRHs@4n>Tz zz_rwC30ve{UU?TIDxn>=2oE-DG`<=QDhj@tB#aG+LHUivrcECe{0$qO6vljKa_8r@(LUv4CCepSBl{?UB$WuqbTw^gJO$=^ZbVfCbyL{;#@&j^f- zVVVWUNyc)0TK!U3O-PdaozH8gEHz#pEeZ>D8=HvCRxqM<%xTX952DGJc1VQAf(O74 zU;=MhsHxPzdYngcSz}!nbC>GFQazg3|_U%njrCQIGjX1Wl2j3If0EH`-xSRYh?|reXvzh%zZ}g6?g;tlHM)mM>@Raur zAzv=XQ)DthDK7=%vP9U`mCxU&`$di$K`rDMP{C^ zP44BrW}f>zh{l`ERYqrBZQSXu8YoKL1{)9I`X%#9JVwSyHe^zE6Fge7cW>SN<~PHi z=SUq`@Risttm$~!?XD#1CgEvr>Y+o4LB`sWBb!p)oqKF%QR7?CYE0?Ftd#_MopQk_z%Im z&rewVZc|%}AcE0hA~zHi0#f0?QOJ5V6(ffte(-{iQ4PM_gBWSN`nw`nDq}V~xow5| z*%$rj^fhKSsvtx16T3dtBDHo?+Ko60N{*mP&9uj5Q8_ARzeRgL?$N<>LAmyHoQiO+ zrTq>9urlGnQm+CotKOPD)0L!gXq8iQFi#y-aSBwsFb(tSIM=sA<^nGuD9JE|z3o^MPo18L-2Yvw>B_qN_*kwhp5AA zQ8wunP*~m749KwPYZnocoNI4ZU;tQ_IjX1Chq3KrF~uc>*4lM7z3!$Aha}x*RBDD} zlAsV*mR8--n<+H7z%!qHWE6LCqXDDa84nSlYCS#Is7%Vv_OK;%OMh-l&S}hw-L_tK zu2|;mkPp%;DrXx|N6;l}wzjZ!KR@%%b}fZ}UA^EP(47X|1i= z1!&)QtF<42Nxqt#$l3g*_Cgt5%+ojYQ=vo z)?vY1$BX{qA1CJ*vB<&!4q=Zz=-ar(D1dF5e11C*GLIM&HE{dC@k?Hmv^_;`cJdWa zXy2ypG!C866`K_{kwq{F3fmQt}7>v+QS@n@m z2Uyl=%laF$@92~0bD#6)l|%zF1h8jP1wE}k+;ibz#y_|2^z^)2$l6LbH?2Q;nzA( zCskLE4JHMDoE~5E`nL&wbu#mK)3T1-I^W#1SNexB2WmZ?cuj)?x(i`BhH z*M&cEg)cuIkyl^W5??mKg#D(A#{*leSP+?nHD?=eP$)vKb>_A9vrmbHeX}3_o>geM zrv%WW0ozVFLSt_&uw5>C8jsNPIIhJ+w2AvM{4ed~|1I5Lm9O}Ldl&wKN8b3(}V zv}?T~zOOm2B@h|jTqMo6ov$rF@=~lGc9}gaBC5L%x{BQDZBBjEyl*|~f9o@K`gMnT z{@?K2wt1BhG+RD~q)Afv1qo%h#KKBqqmupjLbg=Z|%@>&^b| z8$TNF&ooHM{|zkvzX?bE|AH`FgA|2gUIuj9g<5|0Wd2zl4Q^ehaLbZUVwh1OtKFZ* zVqyW(Ma#fqsRw`(M?9Iv8I#9Y0`H-51cXe1Bm2Y>aiy6A-8sXlda=aK8g%k=b$V|$ z>s2O55iOE@yZ9{mou>Xu&J|syLLT%I%N|y&ux32XGrf=W!r~2ea1}$zzQHsZpk~hy3(NXVi}1AHH>)ZwR062l+Q3 z8>FrM8;mVo&Ye2$zEt=p{kdCeiflab&K^W~Xun&2_Suut|6xJCXA-*Vh}+rZ3o-GV zG5>fOJW57~YQ**basVQ|sz*7px$xzv&>7bp)f9;#oG8#afwgo%w6>|unPG6_2-p!H zqRXW=Qi8$(%7#`_%groFvS;!LY!^y+p@tXdo-w+{dx3|C*0i{74&;^{mj<9@*kB%P zd;!#)%vfdk4Iyq-{k%+Kn_i_iJDCP2$Gqv5$+ioX+2N%--%D>A*!ZZQ+MMp* z0m*D*`^EBhSE!vdl{W$(>wdOL@wJ8gLeIh5wdguzDsFv)7B&4C*|dU_-$pL)Sf2v# zB&ll^^n^z2{kjmuVLH%Pt*I8FV{qe_s617u5!BJ-;Nyq`Gc@P;aSZ@jZM7? z;A2XWtd1#nm00F7MamMPV8o8!uw}zVViBpF&7nR@;Bw8e^25ydD+zc0j7Z>iB8CBX& zPUF42Eq89S%$=I3Fh9t}D(2?`zIVZn(VD?$u|RTn;81(2*?n0XHvk={b*&F0Ju@u# zS~JD`Zh11j(;~)mv-6EgzX?72{8VftB*WdyETSqlW~Jghy7%B-G}SBAzw;N&)u0+C zraR&+#?Ad~8b_O3f18j&$!S_8nEfI*Ubj{vq+$xi{mzzOz7aF}${@ptYBI(mEhzVC8mk_zX^fYN7 z!=&VIkKgats@?aVAXtg_w4gWWf1rc zdyg_C5qp)gfL~H9;so2(+I#Y1$JJ*_OPieK<#KE2|Mj!~Ept%kDP|1MU&&!$XjE!; zxm#*n6mrQ6GGkRmpWJDz@SqI+)*u@EsZ$RYemsZ010fBz*?Z$Ra;hkL53+P$pJ(wf zm6Dg!O;4&hcu8sy!D?{a0sQ2MqgN!@ zroI*12OB>A9Fd^pr@2rPwd+`WWhyFaB5N|X?3uNIn_Spk_}LHN+tyY1wQ(Ukk|u^G zMxi|*qegH&YvI}FOlA!eKz2%rVJT#wPu;PF6zif1+BEVC><2LeF-l!fVW&)T6E*;V zmItw;B{^)@nO|<<$p^JOH?}mfF;ZEUzoa^&nUSHvoEM23TX)Rts@0Q>TO)iI> zTy~kdkB#U^2t#s1#-&!|t%20!A^1*%jw(jQMk&qRi<&M~>qYgU`6*zRCi(Yauu?4h zRBE${v?xD)7J6yrZxSY+{RclOXHEWINE()V`m9o7b~NjGHgcCQ=!k0()Ktcw7QNc5 zh3Dj?IaL+$`Q2-8deHtCVTwg`R8(|FN34Hl_XNUea-M4c%OB-I-~-A1)>E*lzPF?* z(|mmn&Q!u&)^u{wI1XsO(FpVrR(NdXa%UDGlv^-4$V99*r}rbxU0YPQ;e}c^laiGj zOYh8t{x)_yawkPUHST2*_@=cln)%_VI4glY=HAZrl`(ZHJ6AbqP3hs*3)+27mS}3P zIYbCLl#P^9jH->NtuqrUVbv`$1Zl(m)j|!-whk1~gQMtLCL$z?B5;h`@;M*%d~Bt> zq*6!%oAqkf?{k3J9VlV$-tWcnocU95$dV$%Ko^1;y7@4>yHQKBYJ2ix{)V_YSU|B( z5$kjc)L9ko;b24*0}Ac-Tb)ehon6bQWD%XFqL`M zmn6T1kCb2h_xw>xCU}Az(HEV}T^I?^X7OAu0t<9TB6#YZKcUgm#IA!rz-WzL&=RsU zCCZYaoSP)6ksqrvj171&P}1Yr&Uh7OvU7I(Q$HeeZv;(v3pMkNUT{l5T_iV#Yw5%s zRUT{Gi~5t_;it+sboGQ$DTxj4tLUDL0qt3xuE{Hee2Wp`j?jagL7n~O47x%IcyEQV znr^*4x&jNSguStzfs8dbojp&0SMB;+22({Q*JN>RqN|w+m8ysYW||w)T%= zZbd%jxahFmx2>cBj#DDrrgpMDf#xi6YvmYrxL^eF>3=@PjleU=4MPZ9&kktOVZmJUG`TXoSwbDs_5YqcJR@~m z<@>GXWdYYL=mgw3Hq`4Cd9FL*L!lIM4)H1|!8tzf_0Fv7?sSDPaYRw+3ZejJatP$S zG~_U2eUHBfffBrR3D9}P2rwfv{CGH0YopqAB^E$qeza&_dko{lYT+7muA`4+X7%wL zZZsHY``X+E<_T)QC5YBsTZhc}<0PWLaH*pvUswPqIHO;3Bb*v=yahM?_^>3xwbwBt z;&*3s@J12NZ-6y8{`@Tjq|yCUQNZjo<|w&$Wbp6gudqO^GyR-OJ1sAjDqloB1*`f* zl&+|dt3CU)XeR^D0AJ_1%cj)>EsH?ns5JR0^$IJmR2`0Yx_ zRj@+Z8g;pyNv zuAn{=f8eRie1v>hJ@^4vhU-)@Q!{603h?Pe;V~u-O#%q0>+M#)W={MqqH5}0oz=SJ zEO?9s6i#G7QcA6JC`Yi8Zahz%_*zxbSouufAUeikN>99lRx4((w>p;sdZnt4^aZBk zW$sn8$F6>@L%6xPmIqepGdcF(6|UGOCWL5$@_4Qn_|Ugum8w;XYkhN>P}6ypG#lMv z4I&lHN={fGjHe_H)zmiA!F;Sg{vmatyQL!8@!2O%6(9H+aI^4*#^G_0mHGs-Y_ zQ$7c^FlO5s&~uSe1zF9NfD4FHOG1jBC5|=t82QL4w6q$p&QE+b`|es0X7!$7VGNli z?mDJ>eZ{qQ5j)lKj~)Jb{kU9-^ONQZ`nb^vA27P4$?h2u5@j63Git8P#Vzaqro{xQ zEHugHSpa9_8VR*F^!ZA;a#6JXdmMZz6pwHKL@~^lbNUcD zhi}dD5}K%LCz}OQCY~Y48g_zr?-xs|%^a88nv6Ij*;w8k;gRse3_ejw^8&T^tpfHD zN&*rjoi0UQKZGJ4AsDw0M+8&H80GS9tFgkYg@ls}1X@LWDkBl!TxkzAB9-_`ijY(2 z<=>utLZ$u4(aCNo0q%iJU3ZtZoYb@$ZY02n0WJ7^cgRk}NaXe>*#S16Ra`}WbYA%+=G_cI2W`^oD z7c1)>(@b@%tluWMS8ceRCqgA0h=D8;4d?Pr zYgx9$^4N-_`j0Ad3WjSeVwdTHO+h=sl(|R>p;;UygkaeANDTiD(>q0mItR;TM`Z%C zGsTVL+uerP*GO?kxRtx&T81`v?eZMwIoW3&cvPG_wp$`~ww1)vnolg(N`e_YSL?l` z`qCd|p|+~iOANdCKPuqnl|=jouTgtqxmjYLXP*=_;4YJ9`goQfc zhIn|rsW{`?AB0fP!%(_MhMs2oCWh8=SX#^i_i7AlvnyS;O8t`N*WlvB^=%#7I)jRf zJMJz`MtY_tU)V*BXZW5mIeSV7;gBb&MZ}7V2)A6%G4@1Y=`pJP3l8&0H1YNDke6js z1lky>jA!hFmn<#WB}=<|T1B5(LOjpDpMfp-mu+TF4hJW%SAD|Du(%J2YgU16$3&_o z|LC(%l`Jjr3HOr0BGT(yWuT0>Nf{N3n1HQbO>P}2)I{B`fqMrV3v|s>7a3beI-|Kx zpjThz>16(5L$cEF)(qyx`Tb%N1#{#Rn%*v5O=(Y8mjdF~wsrekkItJvL24XfrcwlyRaO58E6eL_8&o^tVi0MuOn(@**}(5W?{u-#*1(&UYPAtBC#TVA5c5Gf zu+!vP4j+#O=74pu_}c1Cm|{pNSV-wejbEHrDcqiS<4xMN6^ew@(xIah&-F(8#hZi~ znwYDjDcQ+KER@i;gnv0k9GVWD_NIpg^i}PI`JC`XyW!k@m+|4|cznTQ^<5%XSE44T zdo_QwTaN&#e0-MpiJe=0d{*?Pg`Wq;+-PPI@$54orbLeYaFAPgv|2OUDQ&hLup#B* zdrOkd-!H-xY3g~D;ouswu!)(H$hWS_MF<3?*1*i31 ztF+TxM8;^xG?-`UchKIY#h*+a88%x`uBYNED&>e#Byw!)R!UG6(y5p(@UMTm@YmKs zE@iRG?8mgV%kaT}(a%brIYqO=y2yhX>}xjFPtUk|+>^ojpUFv7e}2>QB$%<_`m)~^ zok)x_-yI)JUT)_R(68TKsOP#r(?KO;!CP1Ztb7L&PpRWNpWybJQAXP|gyy)*iMp%n zdGCXseXbQA$T9pbtU|U|sAR31-%}hIyQrUp)sK<;3zxko_*|lPLiezI==gtAjQ`)t z#{XxB!(J!Ok|IC}oX;w0oeeg;BU? zl#Qi$`nT3J;@dNAHfA~^Om2-02V^WG5RI__4@`$3F+I%Rs)`~(3M3`5JCrLqX5gHh zJ1aQ+K_S> zVb?}^a9vJjUKl&#*=Jjlg&bIXkV{09&lC3+(MsDJ8;$@jrMkC1u1SQG=U0C0EP?V3 zwGIWMu5beQRvR$+Cld+cT$ps@lUoQkLz#NtXOR^bdw#VSw#2avawn#!&Vjza`ao8{ zW<@BqRY35`q4&T<;3IctRs-q0%Si*cAr}$*gFXyoKmcz`c)`A`Rk>4&Ao8L@R zJ@v_rCOf);Y+JqFH*ZS8oQkLIlWiq%6c_wrL%3d0|UHab#^Q9GRy=UEi^g9BvjuTJ_`O>8u=I; zRG-fCn?K9sJ7GP2+Jd}T3<8#d&K>T?axN1Z%2w+#rDRZ2ROPIpLj zGTxX8l30}So<+*M4G=F_jBh=`(V@OA2DVmMWJ)#Nc4u_;8)7I;H2OX0MX-N&{XsL^ z(O_w!WF|YoRm97QXP*yBPrwJjU!OB(!fWnqg)VE$9pvJ)%gNueo@F&^N$Q?L@GlY9 zFBOJ1eOkHWygcQJ@@OOOqhd#jI?9f!(*M`*{x`M%|8IvjW{Pi=69HW3)vKmK>xuaa zEV>B<`^{^~NEdmmWLT(lEUyZ4(11auZi^cmwSfIj7w&3DjNsj`Exi_%&guYvs(a@> zhyF5~OuN9Yj9Z(}A%hLX!H^E$OffHGjWB!-P3=_GL$+yyapg_Oq`uv?Wcc@3{W30v zVC@_R#wICkpY}iOxWX$vkkY$T?sO5fHJMd7ZQ=1%zw(3&XSqqg(8=sCF45&#Yl4ij zl19Zl-y2fZpW%pgOTVVkl1*@nJg)k)&$tK=AvWZ~L^?t7o(y}-dJYt5&WYXYY6MUNZ^XzrRpN3hpFkkI33`A4O*y3=pQ&inEP!mVmdJ4X-RN;G9a2W^==fbrRBG*|NM9 zn(GS5oGfW$B5LF>jm?evQe`+);jzE;N)60xHbC9^In`QEuuV#>E*)0{-w3x4K3`jF zQ9)fYp>j=#_;DcS+gm|t=#=D1rjy0v)`d4Uj@vW2QslQ4%XHr%;~Ly=DnT$`OJkh< zZ*4>p4q0<_l?qsFFnFlk^$pXz770VB6LnX>!lPeJe>02dvT0+nlHf^(j?+vIyJi2C z$AT(XtP|GfBY_Ec*slraCf6k4L(*rTPcmb`r_R6iQ54pdQVY93XkUrm-hF9o;s+@^ zI6*=wqsWQu!Fp&}s9+ShdiWF-O_G+xjpq6z59fEEe3pFVtJIwzEdajM7&|TZfzq`) z3?>Qj42StPuN1#}R|j|4gsnk!dACW4aL%QRc6MX{7dLQdkPeD_FAdr`MU1SD{vBV_ z$C%815z0~>*{;Zya5J@(INgEIVwFoSSa)m}C5|5$dm}Z$svP z^hwIBI~G*l6$QKj8#!G}2tpjnO|>bmiPtKTR6}#kdMe5y3t`oi-Eoj!?zQfY;9__* zQ>x&aa-47sUU1=0ENnENIyPCXOKsEIcS7iWd=UgdEBewA#Q16%cW#BMP(%m0oj&6j9Eum4-FLz zMXl7*G7+U;V2N9rC7PsrXi2VWIlZg5vZ{)~1r(%v$)DCWaHvH(Qc`Eg`^TW57Tr3w zZ-k@cMt5v*0Z=Q@x~=U{p+u^&Ig|>#dZn~}-vj_jymBMk8c&XRhM)BNfj@r!lda)( zsb@ZFCIL$S#pDX@E@7d%BVciQcbViMIY!Gi5yr#AF8Wg z&r!19xQbNk*Jm|H*xPw>hW!}N5T3M3*ho*C8ErMv2=8W_1zIL7e|WQV(T)6|!!inr zGbR(p%1KFu#LI*0=RnwM>n$(zgoA@nz1R~iID`95R8is#5i>ObZcQDo?>#g@)k6~k zm{(;H5*M)ea2A5_d7!D7&CA&@o;=2Oqr8e@Y!XK~q2`Agx+x<6^!UNGvX##3oP4&4wjj4gMhKt_9sD1mFTh8 zOh2wt+-5RS)N}76iY~PSVQ11ALKV;nZBAWAOFEZOwmYCABy^w00YGH@bqb`Fz3dlFtynPDFam!LnsbPxSRkyvoHGDhgLSps;KP45}=w1Olcbw=C``%Qafln1yq-AT2mPX z>e9{)qd<+PFXBqR7!7`$G;6Z(XNhHn6~q6e;5Ro3TfOngjbmN9atr**@t!ogOJseg zWy`x1WM`YxCck5^T@-qN-v$F4RRI(9m3DSz2fnZx|A9?UO;jyY>z{4-;+jr>6ky^N^sWeLwwlq|J)9Wae*yo z1tYOMw+aL-y0>;uOhufi=faP{Qdyf>Sn`{D`X?iO9dDwjER-sia}^@FyKrpi3qhXz z;00#_86GTHd+6g9F|-}`-?sEZDy+23XaLF;07JNoX0NtP1du=(<8;uds$40ah0QTA z|88%zxyKE+vi>&9yywMT^V72rpF#+EyGXD%t*7?H-A%V?ThZ~6*SdDTsqaK0u9DJO z5(&0Va;ORdV^|SRRyr+BYk5uz6Plr*h|3_MsDaqY3uM2>B>$H&a_(YlthwS3S+*Px zDs3GT+&5bftF37KS`h2YoGhw1asNu}3uf);2Jf7Tr8Yf}E0;OCA^jez$3QwNKNWd# ze)#9ze%Ka+F;iFY)<|VE?}YZDtg-#gC1x1)$XSZuqg8ag3U||H#!!=^%1nNw>OYH- zAtTx7D+a86^9nBj(FGFIL*WxG+P9~bEF4{1Hc5&!H~WW4!u{p=&Egicaq zGfKZjV;4Zp)8{=s5%>T38)y$j|z;96??F$Ze43|*~lu>jL(PfkviA2?2od= z1pZLVu5$KgOFuj%SiaMg6Q)Hke4}I=FRqV8l4syoI2M1&&wjy44Hrmk6-kDn^aj5lbY^pHvDbUBnd(_;b>-8-xus9-&GczhWR9H~fehyQhkF zk~p(O{VJGGH#HOzP6R4M#Y&zP^=&}6092PngqJps^+$4P;4;;TQp){Ze%P!2fveO) zj_%!TlDzk(@Hor5;H_~{*?;4ggt+AIeDM3pHdEn$H;-H~wM6=28YoU)1$FQNa9SI~0pf~Mk5r~WRW$1H2pEM# zaaw~^xqbR)ZVY@-c6sIpn%{TvnAs5`KS(E$Lrr~(jov0P1CMAbzjr~`snOiMqT^Rk zEIwdL)kU$seB&P)xKQ)6`(AhUF~#^u++AGak8k6yy`lYDn!zRYkKdG&d^UiKwLRbs zDjp5RrEN1 zhK4+V)Ic~`GpSV2kqvogw41&tWH~+6706j+P!a-E#GK4 z&%(Slg>iIYY=p{i)1B8uJKa==kk8)S*n>9b7VE4yAe9gpcC=Ypg&;9wIhti8%HOKb z$QkVFP@xxPvG5(=vwb+aQ*mVXXs#I_?WEn2L+f=IE@ z#~OYxM;|JtS{uLHQ51G)4?g_<>{BVWM()lyoxAo!;S55DkCWP+o@?`p4*#$Htl=Hx30CU?tw(<_c zgu55dxR_JC?JGk;z4`FL?%Ks;LFR{p9~KL~(ZOp3EJa4idakQI z0i~of1xz-Z(I#AM8by)ADh~~ry$bQDh1}_S^8NimosO{z(c`$0YHIP6JkLI>5|!ks zy1}NMrUOEMizzgz4l^4Ks_*4hCdxxs z>^8`@mEhhro)n&q{rQ<=V5@-dYssS1oaB7$jXIoJVZ@JDw9lW!IsXYuy8H2~se zN(1TXy3&g#nfk6oNw=RPF@v>cN$-y}r##%DP;O20(A?HN)gia+j~QCzb>QGYC1t(+w?5V&q;K|o(=%BcW=xx;P^!7;0WF2kti+t zxj-yU?4LK+y*5jE(Q*@1WRwor|5V-fdc^feKh@`U#tRYUgH& ztz{-_eSfxca%tEh+H(1Bf%K6s9!0$vlPCu+x;Y?b?YZVdjV$YO(C=cnc(~}z03ke* zxl=lOD@=@l4b?{LsC_D}bv_1VN>dqGODb^!FDUFE+Q_u(*ObmLdF5YblD?>X#S?O| zZfsSK2-q;61xlrSvarO-gY;8IDeNDzF(f#Fb93E3)o+R#+?&g;M_wC$$^CDA{#wb8 zJRESeUHdll``{N@w+~^~KWQ6YI)0RJ`P$UR<6WL`L@7X!`B72o!xigJRlIHV){uOQ zIh`wUc{@r58cA{cJq}UcR$G;NL0i0m7a;OGPk{69()bw%72SZTND=5ZQ3;p&D-|jhoZsd2#{Q!HEgK7abVWTJZQ3KH+;{6*NR_`TZ zPHv83B#vQW9cLQ9;1Aj+sz#PA%AECOn>LKy_SJ(34t!xnvg(2~m6pW?(~-;%{jVRs zd6vjnM|_oZdsP6l)C!aMk&}N0kw!sEa^*wZY=1#!6;P zVliznPuA{OhELXhfeGJub0JMrKl?Eet173fyY-taPn|wz>-FW?O(-`+>o&RGl$5@rH@5Qz+e!W)_;E6chJ!kK@$7F_R^G^=gVGod>%j3j_S| zcEYDG5N2_1TjipzjN_c}A8MCpu-en)a~HvM*5hURyqA^ElzUAo?7oswnwuWfJLCNJ zvu3X?9S%Au=3cBAOjV1c&uZ;9Ub|mzd}+QL?WhX2Viz%GDb!ULGnlbkO`NS~;>rp< z@rl}w@hskIbPUO^)#fEhG7P@vbJqB8etIhpAT=CP>LYYf_ja!dYO=S zIvYAwvOCLhpyZEYey<^>2#2ZMpS9C8VcVJdZ&B0ONsXrvVLPLdC}Jgw;nw~gy&Zu=ghpE!(HrS6qK(8Jf6kvj z#(v}uj5j4xRz^nOP*A~y@&D>ahg+5A(NJd{723ZQMtD==MM#=vJT1L=m1bPt&9N9U zOpJ!R%znXTI`#C`g%U@+k80!g)>oN0Oe; zz{RM;VhHR*-1jD-b%6J$LO7Q+&)c(Hgidy(3(#Ut=zvfWl<+=pM5%&^ov87EQSDie$`czKj?FGXT5tgsg5;_ z8Izpu!B?58guQ&Tk3zsE!163p&X>XKI@SimSFp-G(FW_}vAP;Z{~QyFRo{sJ0gwJMwVm@Cr5SFiaEah`0^-V{VrCk~XPj~};E^VKnF%t+PqWw)Y0b5c zRuim^Y_0& z_GDyW+XF^L6e=I4Nu)m2$a(^+cv4)sX?#pXbl^t$>Ttyo{6p7nMPf%C-tDO-C+Snl32Tfu-8&Ws1aO9SHpWu72nD7!;c=CS`Q}$h+r9=YQV^ zyR4MRmADJH01l(!8AKfD{|{Yf+16&$b>R@C!Gi^-xJz(%hv4q+QoLvz+}&M+yK4&s zx8e?k;!;{DRH(i5KHjg-KS<7F@4067thL4l1zwJ1A%~_Bx9|>6Iv_NhbO(WthgsEp ze_>N0K8WowT&VWWKHyOdKXA4*lqv zqi34EHMFB2=-Ewjd03zK0>|-(;U`}p00YRH03VA%+x)=M4ihyFp>Le1^=? ztPK%1ys?&ZbL1#KWMO4S=!ao-XY|@vm{#6c>f#jxuS&GQF1+8;)5LH-8XptHZ`5m` zhsPc9Ow_Q$nKXAD9b(^Jr^sy2zTdcWq)u5R z@W}dk3S}gyFe0SGD8UMMl55s+Z{qUH7~K?~&}S8k*$xPO>aH}T)csfX4AYJHk4-Vg z8*$z5Lvs|n%+&EKi-#N@2e`vvMn`1M7v$Gg3(sHG&)vMlf3oNGJ)79Wa*n#L76wQe zG^sNXxAj^Qci=NtQ25zrOs$eUvlue8yuQSI>{;_J{C;n%jH8AFrjOsA&gT_IpYRm? zK8Wz|tieM0*I(3fV~{wM%|L(;gBLNh=r(nI@&b6^80ihNvx>1=e2{1%|5W3Bl8vtf z?NFI&)R#|5dR40_B(GX{`7!59dDr$MVSTWq&H+F5Gu=8ucQC!5TQQ(ot`Ma&nysQZ zuxN-{^(zUHu1T@^exajy&cvmQ+^ZzODYg!ej!=8f+R|gPuB=F+Z?}^WvbTr&=3BHM z7qo9cPe@dlJx%SnfH9Y?O1}zx%ues$BzEY`*)M8NsBB0lV`oUG`X%r5HOIJ5A8duu zakq6i>NS?tJ-{PlXOPdAs@sgxmDY-x@bnG!yiV(}Y z4_{t*2fXN=eP0ArjRllzVE70^c>$<$Dl+m|K1E-L|NDM1$*5;UmF<(WqvK)mj@ps( z*j;G$S!aC4%FH(-pYF;#xFf@gXv^kQM-Q}s0`n8Ankjz5y~6ur#wBJE$*mX(6GnV9 z&ezeu5+2fdnUY2jig$DN*~towW3$*6qNauJJ(he~3_TX!L8gM|&hZQ_XC(Og4aRi` zoVKEw$j?|m4*2nGOyL?_G~`rScjz)|q4jZjOer=?T4<{$9embs(PR+Ndu4K6n4S1h z_>OU{19QD@=*at_2A|vOUe)sQ~O&Qw_2vxOSI(qGsPTUWd3Spmly%W%!1Pla{l}>4 zNNV6qn?vxw`Vo@m&xw}XH^J12!6nZ)Y!=CT#5Zp?6$Mn%=5rRFP@5G^#bC8Iu1->| znLEM>tnE!Z6P~}KQl=pzh_!Z)a;_b|e%Rip3X|Ws^!WI2Gk0|+asRsbmMehSrbnXd zEUnA~biym@vNcWYjTc@A_X`$ctYj{x&RR`9ap4g2QsXMj{Z;=QYm1!(cTD%-Qa=NW zBErpi@UN*_hr?){OP*)edd1HAl2QSOBxj7U2J{xvMmHIqAqZE5m9kW`Idd4G@KNAQ`wz{??JE4R=r%o6i zD=a@Z_tb5=$-M*C+Q8Q7*wjox?6j8nNHV-cgy?Z4!LAEM<2n_S2YI>X!?Z@b()mr6Zbn>@A!pL)?u?5|Mw z7t_bf7R!HpA_R}5yl_neQ8rGZ>NFdz0;{1@mf`C z4ppA@PaMo+`**qzCFZqSevHm(vHi7f+|^_|l;|icYq4VSIsT7o3_32>7`tv>WZEck6)@VE z_LT@A8-u~@on905*}WoChEAI}6L!Rg&ua}BgZj2b*5$bZQwsL6yC1N}iWSD6apfOslfg|`aYXEfT_!Mq7;qV!Vnl0@Jfq*< zOZaG{Tm_0Y!7#zW>IZ0AU7Z1O{x_S}74U#G*whl3csoKns#62Z-DEstcfmWNj}V}wDSIIA6iY}ojOD1=cI0<`R=FwhM+jZlkH?MhIyB@{Vg52eDs`*z<)+TDU z_J6u{b8jH^I=gFGZ%mR6voGQR)95Gg*|nQ4Y(hO3r@3krV&9QgY!_-p;Ax~p+@L? zaxKDfpr7M-y`S-kJjaS*Giy8{*9F_DL_z3(*TfN1&CD!_>W@b(dW>;@hSSc2aO`1p zK{_*Zogq*#F>`yt^7)Rqb$h)yw|+S$8|3&tN8>+zc(ACtr8D4Wc~RGm-X%0by+L)p z8<(X(Mh*jhXIu)4yClwyT8ms_ildav&(auHfn=ypAx-DB(}>A&%3S&Al_0NGFZu}h z2-Gra+8YgIR7R6^f)t7C*bQ+*X8VG7W_AbWe^{{?{r#a+JrR?3_FC&+tscfjp3zU- zJ~bzWPAw8mD-c*lXehx7wfjInQ(GS$r)GMwX=@Wh2$(%(snr)5mILbNQdc{cWx)6F zSrR8xFrhTVs`!WVRMn2`G|0^#@pU3=xw$%e?W^fUzn@rJVl@&&UY$w z^drbvM;v_WqBqvzZHe0$*)l~`0f1+uRl&U&qItdB)?by%G+7gH@%d2rYF&oX^A5IB zA}K(;=}{?=2DcbFQ#?FER2$lgaO)A<@XE2DTm=kFt*oFjTnq|z5pwV|AlbPX;WBl- z{FTmzisCnXK7S8mlI_%t2M$-ahx#V_9Lwq6PYv`AbmLV+bC`IXYvd$@Nc5!P+Gzk> z-gDY>j*N{uQ!x<>2$#ujGA3>^E;}*Q4L|6@vd45xsE1D`Cc(+xP0pR5EsQjxpCu`b#hnj*V;_*%WxhRd9-KP|ns*-r5=s$N^-XwRt5?RRRG3 z$muIw;9q>uIl#nRjKG>k`+}g+4*dO3{3rYthZY&yYC_OOTFld&lgcf9z19_`NsE|~ z6g@wut|Bxd=1$1Iiu2xAzoirR-@UD;m&bjCE~rj^40=XExZ0!d6A8Yl0bVn`_{rv^ zD>fbfkB`4G8YIRfe+uA9UdNrn+dagdphDN60Uiotq!35wN7qZmLAMn37^#^ zgd9wnFfgi$hz>cv8!(Tt`nI&;mL4x`_m~*B!eu7!ucs5mmxIoCHNn`BHm~p{6x$n$ zm^ET|7NCcVCn~w@cCfr=(lIU)l~o00i)F0s-pCJmYpbP)gc1HY318Gf^gs;Z*%UUM zj@cObmCkKvMn4I-3jMu4ioA1YOJtNQ33>lEvgT@7@;m;4c`Cx z%FN}3>kmJ=92BsxIiS^c1e4615v2`5qzF8a$Awrv%GS+nFSGm8R33{Y0qirB6M6@y zSJ%nflgI)_s+G4GnatZOw^-uyy(QGONG8PKnK^;?m*LaaGXy^O~0I8I9x*eOdU_fj%a1gL3(u|-#o|f_@G>O&+88`Ks?*j zxU}6CczLbu^@zHRW(8)mC8A-F zqakeVCYY)9(4%EXRXi6&u0*T7=C6&Az4+j88OtW-YIOXEu3{#aFkQ-OV^=;OjgLxJ z&anzP|M+N%nBygDe|Sz3+#vHIwg~&m6Lb7NBa9WE?9>+oBy9WfeXKjlRQC;cDtK*c zH0lkjit|@8@FBzOW$RCQyr@fR@(BK^i^{a~bh9ouj%+39kvFqL;DJ|>H=2Kjl$TPm(Bt(nF1*^`fq`#y=BW%q~1&CZtnhvHDDkcBV*VpQJUKaRKkx#&Nw(&!PzDqz)Hsh21qDuKNX8!X zv8^F0Aa0;?B;_dsp^m%F)P7xKPDw`AjWLD{IIWePOyvJcRLjSH6hj#}Lq;1h zOjB)vszgP{Qyk%P*oHf|tco;Tvk&&Yx zymJHS2Mjp3PvkVP*%UUmCLDCOs{JwgyXo71W)1ea>F#>0FRZTKCt}W|{u&}6GySF$ z73;Bk9F_JIZ*@SRJ(BJa$BDy=B1MvJpQ+PZ<TQ8366O4a+Bw)ml5{oB=g9rf@x}dy5ksPal zHHTafyhp^=hxsIzd{P^u3rckW&5Ik((ixDtoeUsFN4CPs?<>>Aq3;{TVEjgkw;K$E z1DSV8E&DARS$z@mDi_bBG_Lmq8Glu{#x(v;$k*7Xt>rT# z&fsh;{j*Tk%o-Jnst~NxnDkrpX__;ShV0}8vP=z6-W*%0k>Qz?gcc*~W!nO(#oeNP zlI2@Ha#E1w|SDPKAE z=CQ)Q*4$c;H-Ayl+t6v?OACL?AMJXd=0ck{L5#7cZ|dejn%4CNn;@C&yD+Q7Xc=iK zW;}ZW83;#$Q4XYFg=cSts%`EK`!!Xhtz7ymSR&*fA2|{6S5c!!D^$s$ZhrZ{H1sIm zm>n6GuKg4nI{oyTou<-JX>xZOnhI9}d;8f);3>HlBj&79MjNN4v(r8T?_@-o|{A(oFhn3KLa^?WoGyA`K*C{oQ`kU8pUh z{4}2h_`mvNz>^Ew=St-Rx8QFmxWKZGOXp=GkfE9oi zee`x=%v}NCaYhH94_G}BzhZ{+)4Fe(v(cB<*-bM0!-ti|;8ZDJX4oxzH__!sM(#U| z8q~&87}MxZcPf2Vr>@pZRT&>!{3coyeM6+ayv`+JC5{-0|Avw^OlA|~(5?(4p&v%G zJ@8uV>i);aPiP<|gL`L1gdbB%WFu|5y3&kocXZ#jp+*qM>&qy} z=!~WR*us{sZ%T}c(}6+2XPM_9pbT2(GcSSW3oB!gJ7$Mglzf!5{Ppc5MeQ5=+4DEw z7S8hZwt`M=t>u_v(3D@V!U3q#!XXk&ULRQUA5>Z!gWm*~dH@)!Ggdj}mKi$kVsUEG zoL4ad*X<6q#h1Sfxb8y*Fub1v)0*~EI*(__b000tjD6XYDx}4=8d=>$@NpqcJ4j&< zvrVF*?SZ2oJU|Ri|AuEUh2rkO2!-i@^12x}!}6~fZ}J2O0@ih)RBT0a9d^i!IFjct zP;uj4JcFZgo6jU*Vv$79eG<6Ut$nANDRnaKG@i+D^N&xXXkkq9haKFh#z0-a@7{zK z4w)koTgy5RD8#S~wy@W8I-^SUA0Opi7zQ2Y2{JA|Nx$%Q5O|zrLl;mZM2XczNXe4? z^B6oC3!eVEr0z}gB+>o+wB%P*_^^&?@*Er`&)%grzpO<(;|r6VbADzS4p2ABnj}1= zxf0;D$_d3=psqA!)6tc_#LIJ!mvL@hQld{genpWV>oG(3gK`AWt5atX68QF${0d#@ z)#*uJ-9kw+jF?GfUNE|Lf-(`0viEaJtpYI@GhyOHyw(Dfafv}Wl4mTg%0AhQqHk5$ zLhqyD{GTK2ZI776f?p?#Rg*(J>x*+FCIT%|vxu71&4;WYF}Yg_D6*Sz7Gly}Yz}@Q zECQpcul&bnNt7Wt{lf}wV=xHz=56PPM>qgOhM#r4@usS0Kqj1W6Ixd{;S*6FT#a);o;z`T7eHi{@hr^N~k%0<#~)8y{ts=2S-VFIg?GEz zYDz0*_tW~w;Y`ME#79#e)7Ca6^Too>}x-KP!tN)$jil~sR##8 z`NQic9U|_!%~{R0=yO-{QxyQTuX>x1c@aMtKUUt?Os#Y1TUlXOlRPlbE@i7>!!Vr_ zYS2TPSp`}fjl;b;E3D*AY7$|&Ei6`TxDADA zB+-3^_DbF3V^84MN`}T$OQUH$ow( z$;E?xy1^8UVqZ+FGAlA7>JBT`Y~rW1#q#hbj?S00U|UJbpNa?0*Vu*SjI;6FSF}XD zd8#THPNw9;QKFZV`lSo;7IQ7mw*flU;BM+EmgrRMfFpw05!dxtE`eM}Fl0yyhj@ zSc_!3L2|n&HBCy6lhm!aKKAP^u4drBHo^MJ8oqx@&N$qP|FOjS#?ORv;*Rjnm803f$4wjm z-Ev)ORw*N2?%&ab)u~4*z)% zxQmTRA&X<;{)z=WY|)VFn>N(2`7AsIDznU^^ttz6e|=OKgoFZSpG)Xxjk|M4B}c=3da+P`?_Jy{ab3Dtb?c+Br~%oTL)b7RJVGUfq|hr zv1wL3m6n2MsiI~P zl^I{FoCi+hyQL@2e<-r$Yd?Z0mJL+SFS&tZ#x^n`2pkNf zmO?Y@VwTiqDKQBtDUAj5MkXE1)6^80f)Rd7A|e;9p7M1GUz^D&Vq~k&h1DOk06rD0 z@Ei+>h#t}IV{30;ge`PyKt*I?P%zOM62QbwEv7l<+6b{a!rLGkzdnYtLyG#5OEn#i zXtq^kWSf++^2LL*1J-E%Rl2`49wQxwXX~H=vYrCbx2;>U)Y)m4T*dfFr52BcHWr(( z(;c5_B#fJz3#wc$)yq<&KyYc11H5-A9-$DK%ltmhBInvjqnZrr8h$1A5keIuTER6$E@7&K+&(yK;Rf@?9^^_lnfE z%1a9=T*4(NQTlqsDZE;f81r!ah{uLy!{Ox^c}3^k#qa}69Ppym(($jM6M-dslyYKAQ0qKmc`o zmrpz4+r;%Pvq_mKK97jc7mac79LmDq6LND zq*))@w6_39xcMwNq+)x$ta9$rsy*B7v}5e+h8XYFX*#*msCc4Mbg(wp*`F)o@~c+b zsA&DyU$RsX51E}6s`LuO4IKl7k8>U7=9Y4ZMuT!HwPK zKo<=a1_n+>(2X3dS9G3}^==4izsqQy@`fUVyoUFxwpK&8*!*??c~gG+O98(o{icRx z2HAnNDB-f@X%T5p0X8bEpD;jxSEq@~y zIg7v5q}-Z^QsH2KkIzrtPKb}pjS1B?SCT0eCIgs?C10Xd zH4uLOVQ}Q&_DI+&SY-WewC|U!XpScL--%2x zcOJr;I|JX1bG9w@?lC0)598%O17jU=r zsLpd&A%pqS7XuEH;!NqSE+LC=#=|ru4ee#EPXn&O$h~G%=MIc zkLilM=FRe?WQ{PHKQc=yGx6jhsF-CrV)3qQ)_1jnC(si@N$&0%M zGp{^z9Q{WMN(vIyPF9F{zjGJZlJet88Zbe}&>mH{XD<(BmdWj!I6ar%AXljBG*oR9 z)13}$y~U$}cx%Zk&7n|%#zAtTRWAJrV+s5O9s6c`0h zwmq>hRj!g@#=Y(Ct5IL<^$F=e5LA)3Z^l($#xyAYcmLjFc@NPBeB-MPM^q7#a-N`q zD-;F*Y6yPgi?5EXraC(6F}P&l-t`f9c%^PQ=s;htjBT_sfC6B%oOR;AS5NW=NoxBs zmwrXeXHgxtgP_o__7Ox^BuL0|X*Hm*?>_}O2c8ISpzoX3o|s}=&J?q+=)4qMJ7`|+ zo)X@KABW!@N^^PZzFyf;u0xoaa_d?=L3|=%%gWwhW80!tn^qA6pt^JU zhz;lNg!Kq*)mukk_$X9=LU!~PDcVURHc z2h~UE|H~iKR5vHIuei}MA3>433^RSqVpfeF9&WyMCf|_Fem5stR}Y9g+V^!_fH+AVk-(9x~-R!4N~k)lr=dz zI4OsGXZ7Jb+>OtZ?tO%ih@E8P*Qa&$76k^N_s%@9*7L5bjUA3;mIlrRN%i-q!9NE( zIl<*x#FE*s4l$j?JFp=E7lyCYm|HfAU9Zwth;%54NV*6272WWFIFrg6V3Z_5pnBeF z5*k6$>tfgijm$8SAr*QQ9`E<_pi0>T5mY#Maa>#TUw`q-H(1&OZuS>@1Bb)YbtKjS zauxRSm~yoZ+48tl!^`-%0{&u2Q0K{tBSyZHpv_@M=G! z=S1+(>SJ0p7Z$VRvXe?v1f29_rD95Q{N=z-!X1ey56b)XTf)5T1&-E%+=`9oi*P~m zHD%0~!Nr)+E0O07e!siBvLw)ctJ1_{^I{7m>}^*G)#`J-k1B5~*J?1zk&om$Zg@%;%y zm<8YiIly~mCv0107-*}D;ay&3Co=`+qqTw4dcz}sB;0uCz`dixM`DLZ5_*PV0{mT8_EM#ja;D`9%+)anCS3Coa{rmea9nzBg zZX2TcSKDk>8shJRA){!^874C;9!b*&{MCAq%`2)-6V=+71rX%RQpEPnTj-nyU5c#E zHJC?DBDJZ`b%d23G(OwF(qpVfKRWzfvL2>@My?9U`o~9AGYOJKv%@#I-3BPfi*jP>D45AfwdEM&2OfYixFXSR8IK zs$)O^o(}-}mOkGR`3^&x--46Llbuu8)>(?XZtNJQosqKi6e20+3An~zmcE+-tg}A- zb-5eTDr(wAyuK@ZdGdLW{~J|;Q_tS}l1u{{)cdx^*4jWq4PjM5%$AO5$4`nC60gy; z)9HB2n=2bR{_&xc8-&ynt5|j#WusrB2KO0$pg@p)QACR(8HQqK((0#Yijuv~)IF8k z&r%k-7f#iwHH(pz_DLVP#)Oo~!rxMkuD%R@k=WC+A#86X(m>rx^Wrh-Uf5KJqxy&T z496&$g_`bh43lyPTN;8k)>hyxhjj}FD{QUS_INosLqMHqB-9V3o{zv0m@OhDf82u+ zIDu_Ks~=~wsM$U$@eYNbg)rZ_;+F<4>fp6zc<3d0^4ZpB>?J!1Y;tab!>34la3HSj zocDPpriqAzfy;{5CQGXxsK+IG8Y+Q*Pf7Q=MPiH>BuApm;DSwt1u^vf$emxU#TI88%louf@cHKg&JH{FWRt?RVuPqSn%KeneEAcQ4CkVP0IJtpGhZ( zJlf)hW=$L$3iR%=siQQDtc(+8Rc2`{ewjLOmL~>-Poi~aP8YL=ToM9QZ>rt$UD&!f zjanGv3bZF>nar|c`OKHxB$hrpd2cp`60Dgbt`)79aq?ZL37S*h^>em6QwMcJ1}6)? zuv&gf^nFF~)8C&=p#GWDJ6s9S4BH{DD_!BU%D`hD)1J{&DrUZ8vFjN+^q;$Ty%{XO zC%la$boNVLm()rkn(jUHg47d6^wASJCUa=A<-HP^JNtIfm`RE4KYBMQTBscL?!9OI zsU9WmQ#~R{)()du-Q&ett9+LO$4A~NP!wgFfL|~y(ik#+SU&&7SWfgt*oV4-UL6ggBjl%M=~|=+ z3v;O9F6xazWYPprTR5zZA1EkFPM-%dvG7?+b#+b@JG}pKk@BwXYQVk2dw{e2xthH{ zK${kzc9(3JjG%+Vm9Y4z2;?07$}_Y8v>meUj?ZcG1vot?%9J)2?O7Q?C^q#p;Ac=M ztus}hm6$k~lE;m(yMNt!D)MG_OW_rDuGYfDvF@~awdTox^Jf#$j^!Acqi0!nMl_?J z-0;7&PrMJXEKQ!*EPp_8sQQpWxZF0Inj1xT(h>6xmRcOcI+Q(|V&g3y8fIiAr<~1& z393=*r=CIaevl0Fad~O;W~|S#30br1CTN07r~PP{V3b>Xd0n{W=P&EH9g`o-@|I?+ zMeF6e4bGL7uHWV3W~f$2%PHood4=xl!fk({&Fd<4)+Q)bOQNABNFX7(>DHQ1UYU(O zC^qLJAW39wrEq}|$7OXIS?sTC_+ggTSJb|x@MFP*iUY7PP8zau=+EtJQ{4E9&Gh&M zc6Z$zF)nzH@yULL-~gtMqkQ7{YI@A=oWRfM$i2s*GO3?l2^zy`O?j6ajJ9rD^96}r z@Pe?R$se~|fyDshZlCjcNmjDA6 zn@>DRBLT$zSYzmNoU{bl>=h`7bn>|G((8WnV)tHi@E^~L5+rQpe#(+1z~|?a3Vv-~ zDo!^XnocU&6ceiJ+~*=i2d)GJzDW1`#dM%^(?|tu30uSJEk3r;pn{hJr@7;mE}hq{&Si zYT`)y15a@V=B%4HSC1i~i50sM(&1AjqD;i1(7kQ+LXOK0+MB?iN7QYd^pz=XaBlFy ze)wU9Ly~Yz^SO`-vuTN!f6XTnHBf3P^(@P1;H6|yHj=g&R7>@bPrsP_S1-Wqv+P7{ zgu~<&aVA|ymnVrjbwo#@_$Cvq6dXQ%MM+El?BjBq3#asqqWSXPVlDSG#Q!>e#&5fG zUQBy0dH43rOq8eK{JdP=%Y(!yw6W!0Sq3-o1@($rt-P6%O7lYU>Zj{pb5<5uG5r#d zF+r!I?p;I2f(N3aK)@;n)zQi8RPZvH?~-0>rpkD_`EAMxALNVNyV30)E7y}RkwUL& z71cXlKGgnrSL#R>Qt;jRUTaY7IZrenBWj9J?0Rp%d%6R}QhegkXo*y-M02js*FB`$ zIhKh0H=l)Wi!uauw7IT8StE|s^eX|i@5=9Ex{a$dUJJIsc&Lc+;6PXPfBWY-5mY(9 zr}?2btpd{yA!hK$9v6+1ffT*E`5%f-P^kD#F}@fsI=RzUc>ZU7heh7_F(m*PPCW57 zkZiac^EtXwSvXi*!c(koXWtf44)W(Gq#CL8<;#!*A?Ha@l@6Ej@nhGVUEt_o9e%0L zIkR4I>bS{|HxQV84>&pzfOMv?v2v!Y64uC&v<|7 ziw4qO*eupP{Ejiza{uRAWX9U8oAaKZ)G6)0lyc>oko9^>QaBVzk7!bA$X3pO(`25zx-wQD^W@(`=pjom zDo5sfigYo0nzpGH&tfS8OaHsy`Ky$K;a+iS`Em21Wx?P5^@CND-S59|Z@(4U`R~>B zYrKWPIsVI8f10YM_ehRK0U~ih8s}-y^Qt^FGbor-Nl3umOCgbeix_#ps~r>tj4_QW zq&K%4*@_)Lx1#r-!(ipznVvxP;K_$MC=^h<^_t+SbsS?F4$ zA{=5Fgpwjy^;-?gKAi{b}G`RPiBq8b@vNu{CX9f*yBo~^0*&FdxU)7ocKrunM_Was-S zYYH1TMnP$<`r4!N^d9qN+irIdEE?x%<^RCS}^zU;>w3(C7O$p_?+qC*8XnQXFe0dx$JhI$|egXR2c*$tn}# zj=X+jvgwH$ONYyU8@B(^e3qOSGefItO-Zn-)0ohUw^8IOOD>prk?dyN&F7vNH)>-dQWGWI@}@hr)VA zwN!TJi0QFOQavl%wzHt#R^!ZMwFkMSzAz+~eoJE+h9F*_0O@T6-an`5MI*0Kh)%?Rp(My+_NN~lrd zRQ3|ce%jjG_@lP>2zT0{V=FkJ0SRqSj@4|2p?Ys-am*WMhi9F4-nQNm0a3vg;s$Qs4j z>d)UYDvU7$z`f|uWv0ifDrJ)lk^xpN`fA5HAKlv|pQra>)kg%4>;)vciWF9s%=y^L z|J3z=3>{X9MB(*!!&9n;{w5{~e@1vdsYFOjgbJV;b6L~1ma9XjW!KG_S9dCv(J5V@ila|5SMi*?)W@_#6I&cAtXR zgktiKD?Qk>{nS>}Eez)!f`4VUCp6b`YDc*yq!F;qEE-49J_kqI2QB z=ONoumH(jQP+q>e)@!S0B~@M672nQe?l1q$Aemdcl@?1!LZ0~dsn=8g<8g_`L|0Rh zk$K-)mzRTe;E?mN69%3Pv{YF3+e$MO0IiC(bA=65EkW!+Ml~G85rk1?*TLb5mCu{k z!IrB?mibu5xr~7@udOd@nQLF^VCCbGJ7UkN@O+jff@rYF&6V-`>dS>}M<(pHpR6{c z$GDR5PbJ_M$-k=e+_=cT;f@dg5Q{>mI$ksVSycj~{Y$rOuvU-^5MV9oi5Cf`br#Pa z3**qhR-3{}1>MkvVf;6rpAe~xv3|PvaCg+ok(Vk|@o~!PGT8`p7{#ywA#8mwlZ7k> zN4h{|LB=*Q5#fpIawx{4zmMKx@F9KZ`Jo&X#JmEsOdX7p6cRpZu)1hDlE=Q+rd$lh zJa;hyZ0l4Pf-JwyhceZyi@1{%H{N2#I5OK4Y`?EH(YHN_VxKMS3i^T4c`Og^Xu_h2 zmgnEnz7IMcPO_KKISUuzMqfPlkt{93aSrTbSg^mfGfQc0G-oE?N-Svdh#t=#dJIz* zQ`Jw-A$v&kned~=!BDsukCG%w(VQ2d5XCIF29F&ss$wZ6Q+^ZImxH_*au&q~5?~NE z)#1oU_+9AM*mGjVM4R+RaX)WZ8>3z1i6oGbeR|)@3`GS)8Jm**>|gzS)o+C819xsM zwT}UH1S7W|OCLEtJK#>=$94LJ=zjNzMCm=X~knr%>ObABfS z$Oxii@XJui-LZ_}?Pj3O@F`N&`p_CWI9b)Q;RA{Nc%L3>Zt_dTp#Z7?aG@rstv@*W zu=0sDYU;`5>r-(QyI)e6)wW*N9w4AzJo4)0%>xM`>$?*5_A^@9e`ePx7eK(-S6M*Q zb!d`U8YP4AOA7B<9vcFq9a2l{BbrXQ{uoxPX>GTUwF$;4;kZ$CK>=IEi#N_M7<@>S zl=d4a^toe4EV)7&4rp&8B|VmJo0^{K%GK>uPE_BWeXQ>MMzF+P=wyL)TP>bCm|iZ) zi;)odF=*I)+C*xF%)aTr`sudDfjH|=2!`t7`31#EbKwHKc9KmAyhmW_jp-%*8!zNt zwT~5YBY(2b+fS7`?osA)I3EiMzM3*fwl8}OZ_6=6eByIer|)bCV_L=y>c#7av11%t zMSs2HFo)s*<#Xl%2W`C{Xxr_>$qD77b(#FbQE~TlZ-X# z51p>_ZYfG|rLmYyhCEVc9mWc8%oIAn@&hj}iSRSei$qn%B=uLF zp+4u;ii;&9jLG{9*Qt{OlG%)}AyKg4_(#RcxmUBvQ@57iggw+abQ@r`>h#4&W=YS! zg;O6*SLM%}@w+E$y_bOrcQ~KByK;@wL3lu>2*FHF9ng$9gmzT_U;U_v6hYF{UXfdG zT?A1J6{19p{uGdNKiE^bLUXTNFH=s~J}P`oGupMibZXdU*mtG-YPzZaa^GUEWTm8A zU9&fNcgNJ12ZuDK{o$Z1S7?R=mbp~p-r^ZcAc|OO3vkW1faSv)v$2q;77kMiOh#&q zy>y^SCuN1Rgz-9iS;NEI*`5G|&J_N0T`N&Z(I8*9pjCz^fwRPPVvC2*m9v9gl`CM8 zeZr+RChf-BDV7oLadSE!;LL!5CD-?)tFkq8;c}eNv_TzSj5rUMl^MMXrNHXhP=K9l zCw$K@v2W++%N{GeUUV=rfb45gWVs^biN4&o;yk4+=!2k>QZXnnxyg1Wip9bDsEWke zW`5z`BOfijsbqAV|MVMyLLDh#2Rn23Z%`VjlyuIgOXAh=!AVrC_i?qOPNqtEP0Rxs zSr>QFf{21h5z$MS87vkI*Nw2A!bt-Y*pCfgQk*B_(XvJ`wxyu4oKL3bsa6V6+O&L> z(3^uTt4inka0C0PV-OY?UHt&bo$ThWN*rzx&dL`Ge2e4D#S=IJPN~lXOkFuA>Q%sa z)-p=AJ~n4cgK~B!N_@noCs0iQh=LcXbpME?zD zLVwfRjxBV>$$~9mOFyykw{!qQdvMRThT?Wn#*CfSQJq?M1+rmAwQQ=nMYzrKxTubZ zXzAzTEkoy>Xq#wOe}fY>dpeyf?3itWG!d&!?ZFOKyZ4SQ@4x$6fQA9c@WJdXxn2l`CB4SZqn^95zr z@+^@=;cLzS0Ux)mw2*ZbFBSJGpUB<9)Yotf>YYUA_fQBV=Jg&j^@#hSzbvA176bOo>Gm(lFmf717q}dTXk3XKy#jH1U9`*05^5^XY}9jJ9O$ zUj|O|NsQ_C%xJE->oHF6`dGet&bre3TflhQ4#e>+g3u!s2!Bx+TQ8Dbe7NbGGxj5l zyZqRPS#xx+qbuCBSFHeKLh}l8M7+SMk{M(fOkP!|=0KZ5qBG@-lvs|Rn!E+EMDE#t zBS8|UXLixP2U>s)X|-e>*i|>}i0*w_^@v$v-atwfo$r#)rh>afhUxhTMiu zT5$#MU^wGgR8`J8$z$}dE!sG@+-DQY+opeh`x)7;b z;HtGMwYI0efPbO?^RBz?<@IqV{orD=ak7pd+KD~bJf`9@*l!|Dr3YdL|GlL!`8!lP z%ct9jZz!)}y)!?hyoT$}+rn|u-@j*eeQviIkTJvT>|Olbla$kAlmGj!lQ9Q3oLv6q zw3UO`cy{qCzp{Hhw3lG0MrlozXK6@u&31r>(5ZFZXKFXgm)pD#g$Bpt5#JWbGs!A|}iI>j5NcZ`BADn7+dqN|70E9vV$ zM50;W%@L|DcJ*v~Ofnn)UwLQ3&4$+QakC(lNX+v*RZVR}QIeP=H6%g|MPsHlR;l)w zXIdeMp;cp|sG$_q)=UI7*IZ)_MXS|;)6;V~?^^e+yViT(FL3uq_^s#J&))yNpXbj` zchVP|ZV)rS)wP+Ridk!DvYA!7>H1RHv()B|&9rs)ko0Ak;`5T6O}@yvso6UDgVA?} z<$8v{?sD}GOSy-t0eLH+js*GNQ~PNx3G2lIQKh&=85K4&KD&B~29~&=X&wgia2Xt0 z+fnH6&xaRL2?t>zaXck0xV&yuo&1o52_fjI-RFD413&vO^YubCS$3e%jFq2ED_1i* zA3%1>#^MMQ2kH~l1Vus!@8mHoQGWEsc>3*!VdGAf;??x((J@-{`9!wK-WbIk#2l(Z z>$+&d9LQCH+e=a3q>M!5eeIn0O)}@7_xA(X5m&B)#&tKIsAF_fL;Ia)P)ClFl{b3$ ztGLx>MWWB9W@?a~HeWJBr~34j7xay4fS4*VVf~cvOd@`RJNQN%8;54_S7A;rM!dh? zRwXM3{({O1jEQ%~tkHR>Ae83+#b#Q_W~j)L&b5)zAk|u0*g9d!jSiKGc3lwP>|=9K z!=;QZS(Tx9tHXkpi$WX%QY*_tNb|YqBTwc^2PE;P*a280^19Vvs$f2G3{!0{`^`Ez zX-KGGtc#DY&yPvwlKMuit6oZ$oDN1CZ&Dy{+9mT+(wNYONL)$?O;SZ!x5u~ZWl^RL z%fpP_ZCjfOM2mL|C~}Cme;uiC?WwipgIOoX!sYh!O%z z+V}ccK4wAAtf#YxIa}zB+<&j=c=S87$wsqo$}m#sxvYL8yH>D7{T0B9jO+8A)#y~5 zAb%#I!_MCbWDir$uTa0h`(OzdlI-WPbC+k5JL^#e0)KB}(JzCq_(77{sCY*5uT6_< z_XEUyf^59lPp3)B`ER2|&-fe|`16Iq)>(($8&b;0n~Tp|%Bt-^Q5 z&y-7IfZp6)po3(YGKPkUHIN3?s>VT;(sWP@*Zw+uKKRp|Mb5=-J-)}H#>fD=*%DX1 zXPUCS9l6Hoykc&4z-tk_DK0*5?>jVC&l&6uJfBZ1GEiG!;wXWvHfDD*4KS>Qx=V;~ z^ERLqFKspd5}=xWQw+P&c=uGx4vYz+2Z7^YV}{E<&U-|055@<60AQ(Ni_NKTmW| z0AwUw#iB%Yx!bMdB1U{+0IOw!>UBd^eKT8-UX~Ip)HD$7UDp2T#B3EAuHCKZ9;#wA z=#+REs%_t|kY5OAx}4Bj2`5_Qq@||xor8tY`#2XUFRZS9Bl(DF;`apIy>x6X`@dAH zAH=|ku*f2OfG8Qx!I7@q{r6MP=71X8PwNygf=sXqDji`5JLMmwnu&%ld>W2J;y>_s z&TlwmB8pZu&iJhBr5)f|7Dn`n{<79`FD5xRG+hb~YI-uC`bMJqEPkr#^Q-_UmuwDh z&bMkDbe0U~G)6Sj<*c|)+oD0s!W4kcmK@t_za}k1dFsB%vxe{z=vVgZKT)bozFz_ICAgbeP;R3Im8;8oeyAvw_CFRM zNi4MQRWqcO;^kcX9$VN7OIy#kU-@xBwSW(jv9)Z66~Qk*&>;8ry+1GLc^ zs7LZh>qeT?ZRr`occ_inUm?BoWSv12&NA%SI1A=ejslq zx9xIsYs(xRYH(|T|I(eIp(|=RU9l+-hd1}um<&=9xpe8ZL5V;W^)a|O9Zv!v+E9kE z(-Yz1Ud}-MBte!Kb1=Y1u-X^kn0N%d17&8%2Z2bs#?9jk02ze=6W)C>D`8o;rxlJR zIK^wC`NMqg9Ge$svblnaWc$uL*Z-BQV}3wsLH+p^*z;iGvTEb$EA3uyVQienmf|?N zVaunbAnVHWXS^Vs2LD`Q^g^l9qfC=ulc%F}kn^*sJlU{#Pi315btEpID+RIIJ05J! zq!+qjD1VuMMlN{4x&PHtM=h>9zHZg!c=woQ7y zYDy#iqd%X(Eq+TdEO63>dO2QtTjwp`;#dk{w&60T6;@B5#m{MK0X!J90@eC84b+^s zATt^g9?ViDAMPZ2da_7yd&+c51g=>bvj(fd_1R5T`bEP**a1r!3I zJ}-H15P`-N|1>yyx3Kk1bfph0%Nq$nL8y$RTm1oY#;IZTM9_^&-;9|sZG4@V5lKEq zKfUeBy^lgUxz#pQrB+!{V;3Hh>s(LII!w`5Gk3y{QL>AvMdtIOs)C)ye7096nunuj z2%aX;D3X&cX7vpPjSA1uB3al(py64gWlG^BWn}CR)=J*d$D}Y*oK{5k)4m7=j4eo( zJ8;E)m%|obgSh=Bw|!;yq=KI+=hRY7q)7=^#Z~<6RplK{hALc)UUVgQzl7QDH;M|u zN6GBa=4%?7is%c)#)hg=^>g*F9`7j+vuWLsM(k%T=O)byk*xJ?TDzXMY{{erx0w!} z<=5ZF_)~wh4=z9-sD_I4-a`0aCOWn2Q?|a8Nrpyatw(=v_B!GI;Fu7@Dq}Orw`p>V`hU7S90zV%&B1WcK_JJq-5MA%D zC&$JnF#r1yEJ6d>xa8in`YKGqWOV%n2^d=IzKGxZ)~tw!ArMygsvNV#kDNeH?;P~B>T_4 za&jqOMUIV?huEMFLq`iS4eEyNK_7)g*;JPgRg)ZjH#sV_r}k*NIn`fD-dkp(jDp;o zI-tSg>-y%~NfVKpy+`-S*R7R_^^Xz8WpDdKj!*Q8aqR)66lTnPeTJTVXqMZ`So@%( zoE)$%kuyV8LP5qk7VpN_E29-<&Qa+Qb?yxj5!EIbpq-pi=a!4NFs8%gst=di;$^Jz z5zt(Am*j+8mT_iBgvlA7H9b5RKzCtMl$BbxcPa6ma*~T_z>TeOwRD?yBf&S32Kh-0 z<1r5bg{Cfq1-0Y?fl|x#DOiF_A_*V@*S9_Jz=_>!G4zd&FL%htB&YRh<=oLpZ>3^~ zz^hb1FHF_RHnop&b81u_8M^V*`#COjC5AbOX*>SQE+RgS$m`pspIE0Ym{UcIf#UVq zXw$G}(~0ZuZCXXL$=H-kAj2hR5Tz=S?f3BUI~`)>u23-!1v4`Uyn(p%WHk7qTP@XP zHmXILyXP>LgP_=z;eqOGaRM71jy(L^Lods-n*16xkji*SCApyvQAtIXdj}TYHe#i= zs3fUp64`BGj)LZrenJ2X5?w{Q7=;@RuOgOmA=Te1*QAI~XV#nL6 zCwZK6l_Q;bmvxk~$1QFe?Ifda^&A5Y&OK*SEF<>5Ki1(3S74i01ZFA47pskvr;wp1 z_z(7OZtCcyU48%+A-bD=d@?NS-mwY?RfS9kM^F#zo?X)r-}nmyVaQRSM<%KwkgOVN zXs(NfAu!rFD}sM#l9>?*K)vLs>Q*CH{62 z4rP@N*Ne8s1Ka*EEi$)9)kiC`Hny&sYKR=HiUEyQIXu$CM+=>XE4th=xZkZDyb1oijyAYr&09Ok{WhG}kUfP5muIhS`(ULn zxGa@CIk78qYE)kHpV@sFa6Z?6&%1!O50OnK44xC>L zYo4f|HFQPAj(ao6J+%w6CS$yt^P}+ye2G?+7jZ0>D=7XD zm=v5JC@=cBxI~oOe6uv-Pbs%Xk9R@9y#q;HQ~VdoIfTaf;dtW&o=Rofo9MCR1<<_6 z{f@}v`${bgS>|<4k^mc#N>l#n%a@a^_i+3Pl-*srV>ENk2B_a`Z6;SVVMoRFwVFl5 z2bTf}`G>}l?zC_BUauJr;v0W4B{WNwdvb{AUewB8-kx59c+7tEr&HzO?;%s(YS;lq z8-?h(tEpX*mP&*YS>gt^<-S%ln+ayPT))}ddW|em^_Y_9ixG|tGR~1#GLp(a)X7cR z!>I4Res)bdYbPkqiB43qGY{j92}a+vcpl;YY9DnZg7Un zJI&LgdI$`lndRZn_xrZjeN6&ZL~Sgwy@q0qWT8cFcUA)D?)kH`FZ+{v2T3-E*<9im zV8s|%M$MWuZwPa<|8|=Zg$q-}?*_f!2a}53;hx<%($+ zJ(UW_CzG(kOU^=^!DG5T{#+B}XU^PVxw=Qqw%w(EsfGsGPu^T-e`NX$8+DI?Yva;~ z2EgzWYT|gL!T!*bjft@Q8##;b<+(VL_LSc}0^YO`%zb$df1q^Xg5N%8LDf_kvS3M* z>XD`SV*1F3qX9fGt>X4}kJWrn+UC92$KydC%7>qjm{F`cCNqada1+bnEYv{-|1Pzb zX*FrsN|=8_eHb_V?T*Tok})S^J8~o?nyUGF-~s< zQ=9(49kYB6X2b8W1GRXmkTT2rO2>n%xm%n~td{Ng<<{!Nu(3c~@T1TIt$>i8`c0)J zl!-nQsyY9R&)--k$O`+{&vccke~~YUa8FO!g(W20HYcLL4itWOSt`P)hTBc*`YHS_ zadnG@OFP_5_b{2>{q60obJ9qGg%4}x^1WJ^orFKe25QEBG04FAjNRJy_&Opvo6wZv zs1@WMpiO+ohv$7_E`8B}@7t5BAyy$TfaZQwmGM6BO|?03x3030_OdO91H!}by8?CAyuCd@aC?B$ zhxnH_@v(O$M+t{z*+1k*FW+=|xEFE@aY0I2p4$vADex3U&^#8(HYZmmXb3bgk5Cgb z>lPd*hBUJf_oM|5s)FuU1|hGweQE7{gn@_|l^s8-pF88zqOWp#{@HcuaD-HQ2|Do! z5`no+6V3?CjE7#>GO~}p<3B1 zPo1aie&-f+C~H4Ad7p7x#WDUs zCSv+4YOtJ8Q&Ush>M+T1{Jb{w&Fu~Kwn&zIKWPSFEp`dl!;BnV_Q0hrrO#}`g2y*@ zBI5@MWSOGpkysEzNOS*Y#Q<#-E%d->;s{odP(D~}+!|62GuUu(V76`pAwF7V<##yf zyEBn}(0u2t24plBvaJ;pEJG z55pl|tAFNWkLjnM`Jc{q3`@h#2ho%>`QabDJQ^VEtXP#Gx~`-41jxtWFVieO>9#vs z8D10lj#K~X*vO?*O$ioxLpOgL@>M$!Ytbmnc;lmw3=e~pvZoBe+oS7-c^;#x1Nj)4 zjQ#>va40vuF|Mj;MdATe@kx2Z1X*K1I7FHaU8hy@#itjW)sc%Wi@v7y$t1KwV6s*T zS{V= z=PM;Koh9yx^@x$QT|@H#sptYp7!2@Ir<8zJGm_%508|ljI{ER?#A)nDS5b|Lo;++z{UgihSB}t}27`bAwK;^$L7N^qT|HJiPWOn4s literal 0 HcmV?d00001 diff --git a/python/tts_output_cb0e0ad4.pcm b/python/tts_output_cb0e0ad4.pcm new file mode 100644 index 0000000000000000000000000000000000000000..d88283bff07e07ae8e5d4b80d0875a309e469993 GIT binary patch literal 185524 zcmZsE1$-69^Z5BajVDA27TkinyStS_aVYM^N|6>TrBEnZpm+;yp-79nyE_Dkd-C+& z*?;E^*YN#){>XK@H=yBLI@n){c}Q3pGM(KMgqaY~$y)r&>|KZ|$er5H5fr-yH@H%|BADspbS)_{-*0QvxlhX8)DV2oCMds3xRrN;URF6GAm1 zSX07>68Ip2yv9@`LO1e*A&+$YbRP<8%m1q?<4033S4QRgEUWb071 z3DhEB^aBp`z!I=}emNKkt_b9d#sxW`p?^((S#$-)=uqQzz?onK9KQ~sjPs%_oExqK zC5(PW_W(WcD&UzJ_l4Jo*J1FAo*G;$K7XhIpeKxt&jhXwI8dTw?T>X4*O0;9ST-Pi z@Xf(ffwAz77mWk+0A+FHI)rXWBn=7Z5AOrdTA#GRZ2EL2;XFgG(FXGn=N-rvaRF~a zT8udfBg4#unTqomXF2qO*$(5t{D-p^&40jv2W3-#J4!VnGR7)`UMK}z9KFeZ>j~ts zC$u01w9yOJAW*PoVHLt^1R7T{P$&Uw7_nxg4OVpbuyvpxP1)^cF~iK7+EYp92)M8@dm*8_=yk>dW>Y+fipi z3&^(rPhSFt04<1tKJG*g)We{&+xxXNV4$trlNvNPXzNaX9%ydlfj)qYp$?L+nb*wU9^2>l4RAJyMa^&@3J0(}YH-;Y7d06*2A`ix)*fDNQR zC;ZPyJ&+ni;4?yh{t*WnsKJB_IMRa%{RM%+ga&LVfiI{b{{uq_1w3dQMvft*96}BM z2#Aj$6tqGKIAFu6k<=(c4<{T1paDjb_EFSmQjhV|SORAZ^(BEZeryaij=(5CZ|q0j zm(*BlJmEsySaOUf(&MNJ1fSripl!k@^h82W^!J!ZO(Gc36G%D9FE!bZO{M@QQd0;_ z_2W}X4LEXunoRI%)bx+XR6jPAnn7s9p=}2B6`>FV3RIN$Hu%O^#`th&&<0lnX9pZcnDgHk(?4sV#Q8FlynC2G(1P;^W(~AL zJCraNp#~|S0D}_v2vf-1hFOSn*5JYX1srDjB>!y2xeqvSC-_$fP~*ulk* zP~-g)uy$aD0S8vncv3kMXbN(F7k&)-|kjSn;F%0Bs}v z8Ur*0=nJ5*1lrIjpj}Y2fEEFK7->a~gZc+F4(KA#Re+)X8b)*&>bJrF@dka=Y^eVR z`6a#}`VzDu=seJta18!Whkij?K%=65MGVUR*u!|U~_<5WMz8$?GMmB2^Xvp*d(wwu_4L~}u!-Ht0d^AX9@O#L zKTtvqUKIL2P=oJdNC1uA6?j(QVSzMo@Bl9id@}qZgAypiOM`DP0lh0-h{-pXjBchiQ1BK%u`2two-%@kM6%%?7@3RHQj94P@R61=RRszgfQe+uROoCJS6$R+rX z1X2T(CR7`^1s9n2#9Z zKmiW`Zw7yDQnIQGLM}qF-|cu z65__FFfyD2_%H_G#@L@yz>V;?;B~+i7?^Qx7!${U5%Bz2!~Mf~;T&+LPp_efi@iYx zq~UqsRlyT8s966q#3u@40gZC-7LbPbhkShE_~hZu7AJgYh4=gEn+7VD%n@jb|9IdG zDM2K0e!y&kK0v`-0~!vPj|im*g)_AjnVSG*2o3Ypn8hUtj`J4U0D~EhkU(&xVGQKM zD!{b>bXot(fz?!o98klm11?aw3SpI&Co2?M00SAQfrlloV_509s*N=d>l#-->H*LU zs0&axpuPYcHHx8AK+k{<0$l`sQ11W^+-e^I^;R_^1v(5gUGMu-v_ zS`ui`r>I3yo7VF4Ke2{bV1W{fR?{>9i3@-g;<8Xx5_W>kmhc8HmPz6Ts7AgY7* z0b@B3WdS*enjl~l1|uy72WrD6A#Svz?ZU{25qE*e2v|3x4ecb-fTLYR`-#>NB`~^) z78B)~|0io$TEog>d--6V}IbaCM_8E zDY^nY8;p&2(A1CNUE}%Tir@-xv=$%l21mksKpaNE_*1h_&X0YKdx86h=VClH92@Q$ zdSZ=l3~_wZ_&)Ic0Uxde+l?0B01h%mJ`?tUt1_Z%z`^m0WQ*nx$l=@pIf&Ci#2jWF zNE`7ylq!ni!5lT@4Nt6zf41Xj7(c|gAk1pG!e*pyKt_a7!7oFf4KcvMr^A>edTqu! zfK`Gk3f3FQL7cs4?P07Fd^_~wFy0C{NC6jXgGTQU+KuSE5x>Pzp)}&LAc497d7u?Q zBLIMB2~ZRtHX^u&&VZgqZ>W(Er7;Tda12A&KpXY~j?o7(91BN6FB3`xxE{C?&|3dH zKKQO6_vyHwp8wNxz*t2Z5HZl9=;@*+#k&9x7bEnjPw~1z0n?b3jkL zBIC&bg;!t1$NL2?94LubW=H}BGsb9#SqhYq-+^8*C-F{jjvC`*<^Zn_=ODDeS+Ebx zU%+u50}s!FTmy%8l!RvkD++T1*c0bIe)j+$&wxF!G_DY8SaoKIGv=Zna)PeZbh}Q&T0Uv6#$ABXTO6-g6a9ybPAPa+1&~9MH zSU3(`3x3by$VGC%#j%?b8Ms>1?1%#et@y=^SA$v{xu9iH&tfmo3A2ga{-= zCV>Wy5z9m#L_!e;kT!^e_VdR>AqomO#7B*GjFJxcBwmWK($7D}PcdSOCB$1H=LJz% zjJkpp#9RlE*esNg0fRU#X1O2>h7nuHe?gvWke`OwE`pH@gXk{yGunWL_%B3=k%ts; zhmtnPi(&q3h+hJ5h#dph=mk9B01Y)pq%p?^*)wRzyqb|^gNQZA88RScA#u?_1w?hj6#@VsmI0r=G0XG2h zdB)j{3?I~ZEjS89@QwI9wjpP83-5d+;Xx0)Z+rsq^q?J|2|gFRBDg-|F7VBO z9A-yH_}`2JaAw| z0^eAJC<7E`PYgb+@K4t|u4Kr7<4Q+qD1ir>0r;S4fCkL~*>fW&1DXhQk)f$T{}?*# zQ+mqt=BIGB==$Q6Hne22F3|ZJ>sI z1yG|kfEw}twG*KK!K(E1TOYu2?*dvCYy&%Ea50~Qdm7MU88!(m8rV486H#R2fCGEx zz^*|~2yGtPN3g72$pLm0Fr>kHVrB^FPw|d~GHf^6bR+9y*mYyi2iSYC^kB8|K>H6| z+#v!OcnyXm?z=-@0&+vR_vHU(htQvacJOWtuLddD>jIt%_)O^6pbTb+(6_?44dCEC zfxic_7sSyY!zc_HrFMds8oDk!P@Kp*C zNr*Zk4tX7<0fVfK0f{8u36V_$AS!C)Zww505FagykYbz^GdUPPHR7xw1-Tj{Cj&8C zBT5T3#&97c1Mypk@eAH4KZ_!tV2!(Ga*GaM&vOz z4{ew$F{1jI8Nqlzltozu%oae2`3uaHVEzK~91&C)X^9|5ls|J(>>~|X3&>rB6D~mb ze-v=S{b1BU0Ukz$`XPdpfQJ!o$VUkE*P&D}fe{Ky9hr0k>y2qGNd8CW2}khb|-%#@9?5(xZQ1CAWKAG3YJw^Ek>cz^*| z2$=nR6RB+kGZBDRsG-H?udM_Z{g|1wnF$8{um(w#H4zyA;DbE$Fi`?IL{fr0wgcb5 zpalSW@dTg+dODlmRJdhbsZh zI1n>RSWURvfWkZ?WD;?uVu@=R^NyH{G;)cUDTK@(0JLGY&(IX8Er0?( z=50X_6=@aFJ_wk*GxQQ@DBwVi0NG>ITSi6?wH<0SBP$155c6|}#)P~bXi~__K^715 zbO!Zl-VQV1sDnWZV`jX}e;DZPqMRK_z*v~sGqQS^*~8o)Uz}ql|I@7 z;GwLM4J_}s7)D+YvxJ!42Oio9%roNIVRRTD0c{Lk1C*G9EV^1l7ITz9VUE(^r#W8W8!Kc|=v~w_5aQ+l!h0!MBe8SlSoT7HXaE=*#q=1j3A_iB1cLjXI-hzZ- zjq%=KY~zlKo&vVPT*bUHU^r(1gQsg`nel1E^9MfG@HSy)!d?$!Mu49IGYI?&!`lF? zlAl+_&jpVJy%O+LFn5gJ4CIr+y8*uiJRZy(;|><^hl>0o@S+gVm#Rs8D5KTztibca ztT5(;amNj2BWe@>3w$=n1f!>BWG=w3LmYDn;PDk<7~98~K9=As8gX*Ww}1@B*)aov zQFw@m13>&6Qr?-~j^{-(k_dCBp-T-AuT@0Co`Iz5|#ihF|-?v(3<2I2WNr-G{p(VE!BP8Zn&x zxIUo7^^BSTR!)%(K%0Pe0(@26MS?zQl;5VHy)kz6fK5V=6zo-`-#>-g*f|4!Cis}J zBL~6oEYb5sdudor@H4@?1fLQ8O~BBaqNNS?+hpLN9|BgM|(tSco47eh{(z z$Ons#-eZv$0KOx52iOMQB=i8v@COhF3dTV& zqv2WL?E7C$4s9?yK?CE=MH>h>%y6`_SfT{rF#8SL2`dBSKwslmAkeTI2sOVk4$!FQ zp+viGj09^3z6?PYt{H7F+I9nn^PzPHyNx}e2LSL5JB+Ih?hCCFJR7)Y!(IZ7fL7A* z#h?f5yu!VB_}p~%7-aLPwTz{EO z#(=SLOgIow}O<+zo(C?pz^v4W-Y2|G@e5{^1!&MAG9wjBA1` zfxFDsQ}twWyeIHZPtxD&uk@D$UieF>pX$#@`9gpGk@K8j&Y+pc}B_19`@VVX;QrCw0~Qn#r;sms;H1eU66)nC;^ z>Mb=}4bfU@^R;uDT_2@i*K1O{sWS9-x*~Ie>B7EcXK+FM4!(nsD{K^7nY^Zr=Ej!C zmQL37*7Me5)`iws>nzI_^UtPHVvz7N$FRfc^LmIjTsh_omZo`LySh4G7S1lHk#ETh z%x##nIlEbQY<83EHQ5z&v>YurA%AkgqrzU!7p^ZnkGw5>zsai7Q`@3np|a^Hwi7py zpCC*TmzY+W=UKW~gKST2Q|;vgo(9Yh91+wh`16o9q4{B}B9<0oB40-CiE0wHHF9M! zYsA6O?ZL$YUt4#ZF7S7mMfz{bQ|X1fp3_q>E$>Wr`^>88o)p)I=I=9;uDu=ncFWtc zN%=|R-p^0Inc5=bO4i`ql>CJb*4^A&!KcXg)LD84B`{^!#@rCTz3@bsEar+ok|)u@ z+}FI<9AsHIrlH=jy%C3_UPLd6QDSq7*DYQ?Zg|{Rv7@6- zMyv|61b=RCZ3z`R(6zNaa*SttVcYx}Ij=H?rVdLkeAnddlUKK1o_#U##p@S!UhaE2 z;mw10_dn#O49f`3Ih6mS<8${1@2@hi^`LZm9D9K)CIpL5#M!1a(?rv1Q!Vp!^E=Z_ z({s}}b7jkJ%WUge+iUy!z;eL}p^w7$MYtmO#C%^oxE`E5G7MmMVnB;u#4O4e&o#@W|OJTNfQ4F=rwWOQFEuULjnYWrMn7$KB3*o{K zd^vtB-&80edc_6ij@I7x8G(98PFQNO!_kf7xl*f3uPJ}BVt(1i2|~qf6~ar*jP4Zu zIO40om!{_IR^SOz2VWa;00PcFJ?x1DTP-##dD@7A5|H?CaXa`nos(3|J43%8X=zdgVBYUumP>1}dF*FAZr zc9Fg!4zqr1Ya8GR@&(=w2nq@evfF>MoHsi~3m3zlV`k}%)WzCNYKTrTk^E^P$2>6b zWmwl@o8p?6RLZTcJf_y%`W)R!6t-Q49V%2M-ZydcAe`CnqU5_uk2uj+JGB#^_fl2yRYt6P1U6ug5 z7BoC0Ie1)9YT)FcM*-uk6U7K2gLBZm_4VpC<)s{{{;VydDl>O^%CaiJ8@fC4VqEvq zA1XSlPpHi|UR2**YfrtX<}GUnmu*y$9YFc{gfrzX8JF#wWVrExrnTo3#DdPdRo11?Qfep znhmO7qb}d_ucqmhe=XfNVSUM@-~wTd`oW{*#%BERw)xYU4-ejry?*NQ%qxe_uRLAy zT+HQ=%d0Q{eRITvwa?REzfAcon{{+tNCM>L)S7TcJ6)o2^X%5jbGDUs1{lS8VZExMWm~pY`rA}uKofOZ9T^@Mp)|H;O zr#*i4a?ktMX*csGN&>T{Ic^CzARfV zZkS~=UDY$9pm}DA4>^zG?+m_E=IY{e_s{k|yYz(gZ^yH{&bPR<{L0}ww;z{#vpwZi z=0L|YrKcd8{|bl-FN|Ck-6SRJLka^D&B6R@>U(vCbltPrDLLDD>-laf zPpFEPDnY#>-o_3n+c|N69Y>Rl*7uu!+n{Qzk{t%rJ6B;`x#DFDqiZKpb@j9PtlTEGdQ$wZ{ zyB9k*u5$6^#T&w0MKf&|dh?yS{Q2Iu+*_&w1Zty}r;V;OkH>u4h91 zYQ1Y0HtEuCcC&*G%D2qve5%3Gim%F@EWajpOh6Fb+pXj}vu3=Rey_>RfZN|*sBz-u z$>OJu{X5`T?^Bb{{CF|;M!UNQ9@l@9lG!jX(_^Aenf3&n3sa&h#a4*hAD0+kF?MRP z#LzlHRjp>B1=U_Y;|X;xa};xY<_hsXQ6@3lEW<A=66jtx5g>Uh{czJI%%seJK| zo6+|VK5hQyPL}T2<2%EM*2lp=MdrkvkDpTfRQ!b!$KvKkWCt$~=x5HOrzsJhX3i=3 z({rB|L^{vATPZnQp-m1w8%I~rY8`2GxlL|2zGa=J{W?bV%4_hVd|>(A<(5Pi<2U$B zc`MRRzg_XL`qjD@f4Fe*_}IgXkC~3Q`KQ&fu{ zVUFnaaS!7^#21gxD*i)E_3-WijV#^xB$ahfE|`@6T^5zKC6_L&>XNh}=Fp(LVyhDt z)Tr5HdaJ74kM*&)-`sp{_kF$QG+19IwDhU?`@#RHH*#a%@vrVb`{KsGC%*o7$cg2L zuN~}rxWbX)$6lV8c=7Dj@O#>e#N<91&E4NHZA`I&3nF^NO)Gh^bobKBO4TdAAbMRy zLBL(1I%Sb(77ok#C8I@p&Gf-p*?AM3_4KaROJT#J2b5n^S8uhxW5@n4Kik-;RO=&s z*7tQbOe-_GM8Bw$wq3sP^cqjUebD=Eo%7ueKRUSQVBYUb_HQ`I9@&4a?#Y)ItKUBO zyhU^5n+j*kRpO+7;`199&gLXR(Y(CcLROadD7kl5gzAK(}HGhL7nhHYON3D#hP-1(+ zvvTiBS13L!+7X^8ddiT64dYyp$$k-BdDi3I^bgtUZ zJ~VU8&cRCe`@P}^CU(fGayY7D=y2gg!K>Fh?uJ}ib#n0G)qCIW-uqkpzH_^R4xIQW z|NOUC&fom&ed`_TRX68^o8ONi}xs*o^ZPC!4h2}uZKwX8+=PSEx%*to8(b% z&9B_wUzkP32WlRjjYPFH=8z?7cMp#QGz(_IKO4ZrAYrH~;AI zXSbt?=NsQH@znJ?EKPTG(|-|o`~1)^qN>ESi~2M2ZsfvnI^bu%zP?WCRG5`{Ke=+! z#y8<_7rcL+zCOR7RGZr!Mwg9B{I_1smZ?1&4P89u(U%D$w|$n`y-CLzP0p8(i+I6} z%b)T3+@o_>CmtVnu+bm$4)i^P4`D)h2w6qW1KCDjrJ?nA)4fj&rWeFx^j-Hh zpN|==57S2c+w*9vzO5cNmP<^x2h(gpsn=KTSHJr6x%(%jf5!fE@Y}T)udKUN{@O2hFFuWU+4XHw^5L|stV;Rs^L{GW>dJMsac_4eJ32XfIvy1KnqMc^ zlzS;BKWklP&D@cN;m+gkG0I7b6IumTjBXo0zufY~x3xUA)0(z!C$>M)X+syKm7{Lc z#0?b|m2`yNW-hzlxP>qP}*s7&VmOEH6 zw%Yu}&uRzPw=|7x8qngmCestE#Gfi25pM~lgeKe+_xjXz@5dxvdUfPY+S~E3JHDx# z5|xpXnw`Ej*O60@?oRHIeCfma^waomIqs)uh zb^O2iSJKlnmcKdry#3pf@ABUX$xBlHO)W^RlzBOOM1~_JH^rM=KY8tkpOWL#C#LpJ z-k(vJGb;DTybT4_9Xp)eJYBtJUuS(WKf%1;J|X0Xh~TJcaUDw(mXu1aFZnEitMIJC z`pOHd&q(ZD$zAH7QuoSEipve@WZ!JEOH$U*jF<0gei)yT@}Xq%4;k&!cBM>7*_v@9 z`)S6Y^oY#m>9f=RO3O?y%v_l{GX48>H8VJSclOQPQhEDw1M`;@dZiv}l%CJ`w5NrY zj4mHFGU9l#QPB-zrbpL{yRQ^+Y0kbJc>RVc_(-#Z>3vMGYgia zYuPPwDx|&2*qGfeudic5;omu8-k4l-X5+NYskbsGXXd2#PIaU$%wV#cX#e5rX3LYB#O_(Q04qFiSvZSNLtEiaBAthgx z$t}qje;C&~wnK1lGedL_Lp{^yxphZD!LK=g=Nu?J=s1+OFz4UweyNL-#k6Hv>$95W z7Ul-zbjq=1Ps#W(-{cN)-YBFCSLa>Iw>V=Rlf9g_mZ>YQF@3?8;-2xzmR^AiLl%dv z33(m*eMGh3jX}MlgX2DnnG!cN{$zC9;IFOYtD5v-X}&MQanQNk zJE-t}!R5T!xr?)+GwbHvE2vu_6kc*Ra{pb>Df@MnmUA+9R*qKixo@fSfg{+v*LPJ) zl7}+a`19N_hGi|H-O|wZ((=Z(AaqpFN%IM_!`?PvW>8Rgcz9fBmEa=*j{{-?rr9Q0 zu3J*gZ^VB5Z}bUuhi{EHS-LMLdKVO4%{x#qJwKON+_CPtlI|{W*LJllSde!wXJmG< z!tTBl&#wGy1^eVh-Z;soSJN7iFPXcJELS(ltnKBWnMc`QgrtP53i=S37SP|e+nN|8 zTe^uKgnQy?>ov1vjSg61+R0p`*N8DDr_jh0W0@wh+9LV1>UDoraLM(L+Js6`9Qqiw zxU)%CtIW~)w}?*p$#+aU?|a~tJo^fNE|k1Wl`v*Hw_J#0u2WOA1M*DYTB)J;J0)7F zuPAgKF2Z~wuvTc7z)ivdp&rwnt805=ZE5~W_)N&5-f45_>%3FAB@VLow=QM7sb=3P zcNO_z`q*?Kh>lUX87#-)B4U>-5n|iZVni&>AuQ_f&tvBm&qlZ6Zs)13 z2prA+KsDxOv%FO3j&rtlMfvWljhR`3%<9TpWhHgcw8_MY^-VleMT_*Ur;k&m^gQc^ z!11QCd`Z3|^$WF{9;Q{ILusehOv|J*#e*Eh4z}2>UDb3KfZ4Go=~S~leppHUS=cJ zk-nuGtnd`E)sD94%xiOuOo@(1;y)LUI3PT*JZ zo#`gN-+j^QJ*k-2qSY1N^H0<%^aLhCp_E$G6KN@l5f1R=D9@=?;v`c^ajEryHixX; z)>0RzLvCwY$@dXg1hf?xy`estPSKO7AL%T0wqBO*BV-Fp%=c|$=)=+#DPBKB?WYC{ z+2*<2OG;EP(c8pt=}lasIh-3N#pOJ9jii5IbnY^-j3*_FGfJX7i5kYwVYks;H3z$2Z7B~k z{b(C%5xMT{k9tG*7Pm#Kq3!4L1Ih+9VUNgVe9NT6-ZESt^99p8_Jejtb8BaPOME|i ztGFLIhkL^H8~SGE2ipSM1$HPsRIce9U-*mrx{{_Ir8bFKmYc#a@)7l0S#b1ogvu58 zMeJ_9su(LYSAUceq(a}9>M(Yx_`-UC|AwDTchFPd%l{- z?OC8-RaeX1wSGby_6uFmlJ)v>PrbY)i<_j^)=%l}$y^!1H8&sNONnoVyR?T+U}q^o zzS7!z>H>*!=aZ;bC;gN>L90f8&{xwTQ~|q**{Rf{7xPoi$)-)r8SX6orQ?@ENy(y4 zQP;&qmSoD}E3bOoOK^8`&QQmghWd3{qaMpi z-V)jwW*K+Q^oDm(@1?HJ*N*P4j?z}GDS6xXObL8nX1Zi9q+J80ie86%4gHe)lbgfj z5}VwPtiScn7*{oEyjs<_lPY7bX4)-=icWU2yvF^+J5QOaRa7Q&OH7@GT+=*LS>`)! zkW#30Ren$_=#98N%zf^%*n@5)ndFg7Wkrxj>pJ}_zm9!NMKeq2Ag!Uc*XNWfDzX-# zchuL=Khb|Ele9T1tyYuU(P_*MPX~>of0x$EbKGI-zjPk;4Le2{Xxk~?*PcrqmCcUk z?#*%`SJ$+J{ej=e?54LUQA!^D7yE*L!>v%iP)bTkz6r`WCX9<`TXFN50oq7klvCsPB}PEvEN56P4yFnieo_H(@qQ&~IfNs?O-FZQBdozGjb?I{LM@%Ts~%VC$c0Lx(pK-! zz9JFUXJSu&f~tC!sYle=?m*vE;XW5552b2YZt7p@_n2U66?KfhL9f*>X)}pFTkq?w z6!Ts8-4`pZRKao zUTvc^NKVqXD6^H3bZgOR9nX$tW^>P^6i1Tdw$hUB%RC}}X9a$P_MF5bf7OPoKKC_w zkFs0tp-t6qF@o4(aZ*B19gx7 zRy8S{ny)OQ8q&Yf3xzu73E~6x6`jD`)XmC|%CCAYb&xz!{#%Yy7E)>YC4DSo6K9Ll z^#ba#-by~}o9a32+oQMB#%Sl5WYb}B8S_N@Mp-V6@xGK+s5j^YzB7M<3*f6TJG4I1 zGGD0v3zaQTQJ<5@T~)oGaE;$g?_?k9&lFA`qMoOgNDbU9;kP#x@cH~rVJg$W7wS6c zov5%{6t#g(Aa89CvyTm9FQ|KUGrz`1xjMPt`~K9%(UN(ey^?t+-&+^8w@OQSzpt`d zgH2>tF**8ewLtxhif69SGniIFH@211%U4D7YLk_G-|y5a&PP90zhtJcljJldiEYJ> zr-$mL#J&2zl$-uS-LDn%-C@q?dpzH(KeMcFtWuE))#fVq)CDw6<+2XT5pE}?u~)b> z)#Y67QItJ$0zH9BBtF|BqOBf#pUH>3d+0y7>+}Vt3O$03)%&uGh0;t#sw2}^o9^A{ zeW023>eMs(IrmE3&W)kcwdGuCW;@MOd$f|8M~WwZ18o`UwVVxM6R9TZOKq4sglfS( zqo(OG%rmAdm84x}a=1p?IpX_lCH8WclBqXmpRiW?J1T{FB!@{|w7%MWMkiLPgm95A z!<DT;s$Z8*qrI22kI-em0G-Zh8jqVR4B{x5BN>&V|p61OZ!*hXj8Se)GnqU$*xuq z9%1n*2?-xlF1?%Rg!XOmks{xZ2XdHp_ZOJTJcB+R)^$8*0z=L&P(h&V9kX zHBYj%7n<>=s)7Cr3J<4^+)0#QTa$0XTh5q1MCz+&B&ky-e3SPL^xL3Ll zdVeN&6sx>d_sYrgpWau}SH6kTSf#0QgXoH_%rw@k-O;NHv)S5OH+nF?lnrMG5|3=N zX|_4goN7Kuwhr$wEjJA|M_U_OZi~ajY$3~@21VRf#yI~qmtRW z+;!g+SCHo~*ZlksxdDzYt^@Ako-3X|J&V2f-Q}HsI{Fkob!{*FJo{?ymAnLpr!drY z$yY}vISlvb?(xq4>GPwGF+JO<{l0@2X3+*J_xyi7w9n#xE2{m{W!E{BdEs`7hgc z+myh^0XyyASt|(^OFye**<|zCzX)j;dMv~ld?KVppe49W=;6T2_KtSN+CuEew5GZ# zqVq%U!~942N%!T-oD3P>_%}Kd)GJNbaHhQ-!4*NrkN(-u$wKEepOY zIF~=W@SS^)tFANK*~atITUweezttL1_o=FMRT9j4s7_FZ`}WD@s3%lD9VI+Aspdb- zFReXnb*#^$?N+)VjauSC_M&*`D$2}ej-o~<6)^FsPXPE~%SPU{RE$<|}C+1p$j{wDtu zKSk&#UKMu=r%Yw76D@14skTx9n*y5!=GlJ@Y9IJdz=0q-a7SRh;JmP<5xb(_#ojA^ zHFjI*A5odXGJV;%->K)Fd!P5R`@61b!!s`D&r;%eCNOXo;*Cm|;| zFUQft*IAL2B;RB2XzxhZV&_W7C}*_0gD1s%T>f1vp$E}(sjFlMN^^CKeA>IoGtIro z{lMMY`;*d1{h%jP9a({BpiRsIrX78kT0+fXIqoz+-1Np=()N?>qBX!8VQFBtn!_yf z><;_dKu7SE!1^J>L%t8NhFuLUA9XkOR@{;JVKEyb{|tQ?aEF_vM7aiLFH0NtcG~;a z$#>G#!oPg6Bt}qKEW?JWV?5#ck1`9=eogmedUF~%e)WXPKg$w{kBs&>T!N#LW1Qod z>#j%ey5(8QIc=Zj&}!?6x}u);jh450Vm#;EDb9zU>e2@JPwhN?jd{rY!UQw5=q*|g z?Y6d5o1)*Q%Cqf-pG=P|>GrmPlLG_nm#r&J6330S(gvA!rDfDq@-SDPiJAw~{ zYzyud;tW3?T`6W*OvA{xq2ACxZB5zPzH`n?Ij#?dZ+je2aZw>p9dBdM#a@c|g7+YEUh8O3&2VXb1HbObmZb z$T4lT_OT7O&$s<)>ua-{kDDAqwrI6%HMg|?Y~K~!IIMMWbl8iqvZ19zvx1L>+9F9u@cUSKaNHpj~B?^3RP zaKEpUdOLeqq0QUIx1FrfKGIzGS;qk9ghH9*@-p2+r4QumaDzHbYpR{l)@mEHoy6J< zm;3p?keYh0dO!GN`H8xZ5?CMCj=RFI;3L@?Yz^WyJfM=*D%4{7N9HmgDR#Dm*|ysD z+lL4Auv#oJ=Fz4N;%cF}aG9{fAq+Ib(zKvEre^+537Ot%|Ec_Mx=pA4+_$kPR>Tb2FdPwQ0 z9a6_?lhmIyFZm0wCT0dxT9Ej8++@BZw~bMWrd>q$XI?SY`5UdIfze$@p+EZd*$#FppMxUsyzTlkfHXJH86i2qJlCe{^K3iD0-Ovz#& zQw{SiODoF?OR^=(Y&OS2MzYQJY4Yn~z25&jWZnaWv% z?M(w*_EXjzQz2j1^f`M|tEQFlWxA^6e3i*(ex15IrA21DfZbR;Mw^&Sw;6j9%rk~AI&4aCcKxg~Umg$yfmSj_!Fi=p$7AC<|&!m_?SQeN* zm?oRritSCcg*W0vvrAlN>MB+ilDV(ASzJZtn7&$5eQD0*g4H=?GWVzdo%UN+o4hv# zC*5bgC4GNMC*7-^0}JZpwaR&zQ#*fsL6SpqDV{Ulx1O@zi=HX&p6;#g5uSW+urE!X zuWr;N?W8`Q>`@)3*U@K_y@vIv%hVxqS7X`L>;>j`_8GgB?altccH(z(f!ri+I-kL> zK?`HJMX-Z*EH|foN<}%jP<#%3JV=&JmclH%2{8Y=MPsK$AjFotftwIbL!?_DlF%& z;F~QUl^wnt-d{buyRNgMYpc5s`3AL;y-9EBwak3x22+jc!E9#^GE=!_d^i3x-pL=~ zbGT((9=C*_%$F7piP_>5v4`ju9Ku3jEx(!X!`t~oTq~{uH;PN-z9u^!uk-H(w@^)- zCEgZ-_zv7bHi*q&x-#9_NnA_r9CwNPnYW7j#C{~+|Cg|uYtKxjt`U!FFZG&!$u<#s zi4BCC+!VGcy_a}_{q>ggWOf?gOdMglEF9&AvmCQjpQ;4=qDY+PM81%BA}1w#R?e2Z z0mP5E>HWhuNDh~8d78Nb91HTYb8hBL&bwO>=v?9{<69(O_SN)tl=geJxmow$?ylY- z5~a@5YS8UP*=|fjx+_zO`;i|mtTVN+JT|{EH8L#~DzWyf z*%j;vt}NeyugYigqlMA@DlVCQ%5Ws&`mNrKN}_ef%x-7raJ@)eucg*c9jE@R1SsdV z#Wct4B6F}COVbW@yxLP;CJ&ZtDaT3lv$j`t1v-Z0m&$vedp5tU5|hPP*!yf(ey1=}l*BHkPNw1FK7Kd1 znO(=sVLGrYxZC_A;kp=NN*Ak$XN2lPFyEf{@;{Q@u&u@QrgYO$v59zCctqyU6m}lb zjHBsH`X#fUVc2{&h(FHFWtTJL@6D@rWtaTWx14+hKGRQ9ok(0Hiy1|qR!1q#loVfg zX{YyrWR=JG;(fz>1AXbzm);g$)jQnlb^qvY>|s5Hu54GFXND)qea7><_aylSF6Eu$ zP4>o14(Wn#sXRz|CHIq~-6^2Ch8qko-Rq7>4EfqI+i)d z*xCKe0p>KjjJ*ykh26$g;+}Iq3Q6K=Q-5;@b9+;W*jSjx*W_J-YSPUYtp&F3Bz8Sc zba2y{9aIj9G8E%n!b)>hYrOTmrKP1as2Im&xAT7RUMrt6caUN`y?iNsmy z?Ia)bk~%^DZozB)N0Lihr=}`@%BtK~sjVKaS4+_Cyjc7uA3l?G`R^}|B z5&K?$q}Eot%d~PyZ9$!8j&h$1$HW6q959`=h+B;mGGtbRIFjDXxb!R5gG{&eh@!|A4%esUy_JcQ{g1voxjJw z;Z^QC?lku|w}-pMjpyzXE4q|c^>tbY5)s|4J}q_*)(9si&Byn0Kbs)7MHS8-di7%6#7iDbM?j=cs#yr-QGjvO-;=&!jKVidtR!O>3YvQbU!meSM{a-h59F&krO*(oZ@lE%2R_7b|a+ zpVe{NL2Ze)KwGW#(@2K5gYTtcqnn`t z5XM#2>yjzB|79WPS8h+iU6CO??@asz21uYUi~=5+A>-)gc+0;&cT@ zX38-`=~DD5@;k;$x|RHrVIF;to+FTnJlrqqZRt@6Ae-x>{xRG31_>lK+b$oVu!QQ6tqX<%u$wy!&Rv z#zxVH=o2K)IhO8Cax3GBj(<(vpi-$O^lW+$eVo?mR>b-}V4~TfY&t8k@7ceJzjude z$+RIbhDj!Vt&Mxa4dZw6b9fWk%Mr%%%tHDI`Gv_TswW*mGJZ)+D-w?!$n2oI&~vEi z#9ywe`?O=^3;Tq=QXi++AYVE&^l@5y?U8y(@ya8WUzDE8QRO6=#jn+d>L9fSc>TRoPA1N+c7yzGCP&aBU(pf=Q7{WQ^{{v@G&#nLsU8e?q*vaFWrjLT@E|XHvE8E#$Xx&-6s7itvw;=j`1G|kmL)PIO>L)TcXHuV&HByU>=jLz) ztc?w2_K_%gQ%zNGtA*-j^1GYn)CNkSlF0vO@F z6|0H+^i&TiFDtv1F?5dUq;OgMQmT}KQjIh~dP;nUPB-mU-&4=2`-T6At*E^R>YTc{ z(nT>`4ALs^0(B>yqBKx%6TFVbgev$;2 zO6$d~!XQnwz(v(NkeRKk=BU#^imQH+9OVin@a^-}QLOW9o=_lRo7C6noAc;|SU(z( zN`(31A<-s1C4DB{p&ofeijmT3{kl+TqU2CbFQQen6{IVfBN=tky6sYsWW0^SPBn$T z{+aSVama2|gAQ8hTST=ogwBom=@godVa@BpRINlmA9sX;_tRq8~N@-7P( zNzR)oRMSZOka~k!_N?MmpQlrCFA1B4zeo~&TYQPi`wj7_7sN2}HgTMP)G=zjnyuVb zx~spat%V<{R^||IdzIF5mJp5HROhShsBTl#Zo&_OTl`$yFD@7Ri0Q;1MdD1asBfwh z=>IgG(W|1fdmYLCQxmcl0K21I=@i{!VKTYKlRc_C>W}I>>LfLRYS5uRP2YWk%6m#( zt^SAVLQpqRz3rft{dZNT@UxI4zDay`rPx$FP4BK&n-X=@DnZgPo~71#U$`Ym#C;D@ zpZS8Yd-_sI-XI%iz3F_OL)fkUq<*RnR$o=G5Owq;xkD9X;cxmKEnFtbeO`T1?Whh{ z530?`hTR?^gVqR+2utZK`xR;f7jas%+MDRR8S%g0g=4~ZWOuEpP(-89T6G)kZzxyY zG!pkGp4f+eWop$wh;jz0k5QWms*y^wlIp`m=VqJIY0=X}Z7--vYCusGNmXdo{%M-4 z{YfK_oA}I^!Y`!rJtl0WGlm`L45C-4pp%xZsNQ}h>Ma*S#C%~p)%A09M)fku_E+g! zr>LHB2DSygzksZ+H`VYN>eo)HzsbT5;R5x<5YZu43a4p= znM7Z?uI{H3mkZSybmnr9+Fk9YK1lqcxB3)O*DA_^Nautfq#pM$QD~}qjC#rl^%-@X zI-cUMQFGNK>R~ge=EjqxVx?Kpue7Q^LLEhvw}x_WryBi$vL}3=9 zjx%aH?GzbAZDSBS(OTk@w8w1^)xV;CL-gE>Xl@blwIGcUV~GP#C0)KpIIhm6eF+`Z z0YqEBQ>ms=TVE2Ys8suC#ONd3Q#VjgSWGprky4K$D-N(<_n=@9vgms!slLLfJ!c9Z z39E@7XOP7>8}ZRC>KDW_-=;P>PW;N!a6;Q66sXBme?O|s=v#$Dv)6D@&H<>v3 z6*{e2M6GEdnoU)AP-}EmBZ%Hx)9KUW#ChJK5(lVc#niS#g&^^RaU^*}(tjVKltXl8 zHjFGeJV`x@?Nq?}!~m+9_Vo2|qPUyt-|BDl{eRSaDo0-`Da}i%GzpZityBw7Q!7lR zR$fQD1M=wHFC87D!_#GSrWfaV^Qqpv)CYP{tqq`_5KjE^7Nxk4{!^#~b(Cf&3hhl+ zButdzdFsEvQQIA$FoDjN_n~vUu!Q(DwQ3^e{xa3}_rzVkr5s(RbIf+i?PzK%*sgqm z>M1*jS1+U5 z=|R*Hpccuclg$EgO;F_<6tavk(YX3OJxYp3tiW*9N0hWPc$c|MNmGvmq=VA2%y%A3BIFmTW4|M8y zD@n1-2@`EB)ouskT2XXlgXVHT+YPlPD`VitWqlx}|QHz^|V*2I@YMsNBtGm>m zk<>oDsP&$pI%-Y)$x8jNz9EO9lwxxVh0T{X^e)oJnR{5e@{s)noWF)`kf!7gBkC-n zGN(|zA0$3`n0oL9;+9230Xj+(_Ob*jO99ne7Ew+a`Rl2s;^}=@E{G!zA(13`o%+sS zbR8j%aF6Pt6Vb*3!qt19aPekPD|ez?nCQ&DKzV3NwpE@cs+dbW^kt%t5mb(LRA;c6 z<{(OJMlIN%e8&?1nLxi!5G}Q&yrPy2l!pJm=hbm$zqa8F{XJ^89Lgc`m`4}R5E~2;$n;cA{$<3u`INgrDcY&5uwDV%79JYaK~*=^OH{{KiN6%lS$xESB@H)y z+fVhCN%eP$a(9(lBA-S)h4>yUs=@j}J%!&T|I0*&C#ZD}Qym|r);dik0*}E-d|WrE zY!~Sp$#kVOlr)uUqqL!9zLHIO$)uDE>3enbMaW99cV?!qibRXG z4JCt3f?BE(*b#uug#eYdv>`v&D95N()agy)3fYuW8NE~2&_1X=)ZIOLzmmRCPA=F= zK+9-WR*diO-O|cP;Y4%cJQ$n+%#+FZDr4Y6%VABFtLSVn6 zIn_UGU%+x9>`<_!7PjODiz#f`knN?x;sxwqXiseG0ybj!tLQo04`B5Twk}}35Ep+J zR!`WD4Xm8Nx(QpiVVgB!%;aqDr>F~?8=+KK{ zB?dKtJR;ru^TJ<1-q?B$LNyC8ux*1jMwwvc4i;xni)^_DsloyuZ2Yn9KBgL2=YUNP zw($o)zCcg#!y9-9y@-1fC`F|n=KH@3b|=uv_(#`~C@#lF3b6FSzgl|Q7eJG?hWbZ- zH7h)9MMNtH%EZ=pV21=2ZD0ilrQzCzy+foc(Jyig>x2AFwjYB2&bBa+Up&E9h(dnI zGc06)uhut|rLG|^$A?`FT(BwvACys{HP4gCfsXTGAP1G;D18*F_9-{1@J za5dIm&42kE`V?%4z%mJJhQMA3dMJ1l?i|LUY*mCUim;Usj>$Giz_pmaHKvJF@TFSn zll(>WVsKb|wXWg2aN!@;QP{ExY@FP0o1~C>xz@+oj)-O%h3%GbTv#u`1 zuJK%ORfKXmnTKdk6%s+N60RHM9{;dy!tI2bKl%rL z`2x+NpP?se)-<`_F)gF#;Z0pbEPjXIhDA=e5aWMSLrPk@+~@I()HyYzh}`kWh&%ge zxxz1UiB!?MxL<*Hz?u*8i#tE_9r1CYWLl|FZoc?C4VBkWf7~Woe}X^i60L?dX|!d7 z*5x*aOyFy1d(Ey*qjejmY|yiIaev{yfc^p({y12=K&RBq=$VTw$#HT8?5Cp zU9*KAjCAZ%KqDTm0+LGd=@)lMD7Zsj$!WOm(ukTv|7>dqa#mJ@w8g)$zJupX6(e>! zNoU#xdpsEbQ|Y=xvH(j0aKi#mD#c4}@a0g=P7iGKq&38W#U8fVgF8QIsUR)9k6*U> zbBo4#Efl{u8?O7`gqy#NP~<{OlT$!yT3$GR$jSeEp@ivFR=zSDN{_PRLOtNp>MFaz zg=fBUsa{d1T0Ntd^QiXo=|WrJpShDJBck2VTHsY|cZpl~e(qG(KoOt|@EC9&xIsO5 z0{;Qe(Kruta_}CeMDP$;VbVqh<{_Zw1~x#n55B-QuCyMY-f#aX2Mn){4uA%1MSi zUlXx_3#EOPe-Ym3haBSxx#n>GHtq;vdz*Me%Oz58jKg_rOp{aN^f_IA54DH4kRty! zrjB^9F^U)*&fn!6;eF1r_Er8S{27G{DKWAof1SgThE`JkI^Q)vSlj2?0lpRLkn0z? zSC5jL@37X75cr_vcn649jV}1$ZNx`hzIu~eyAYq<&;|FVf9+!5#~Pl29MG5k`GO0` zjf_>L`D*9{z_?;m0u8?r7*Ies00I>52n7a|=3?w9#ArlIKsaM6FhT;~fvUh4TtI`u z#cyf|-FOQ=0~_veGeQH$9MFK{fH#5Z08A)OgAt(EAJ|dAcR(BfD&U1$YH1Je-3xW#}> z#uyJ;+rx+3Sfd2cAX5m_k4BpsorB^**BV{}@CCuY7*7!PeeuM$fEjNa)_-9$7}&Df zoh=T-&M>SG133ZQ7ueU0Tp9K=8|`g_moqe2jb%-iMIjUT8YE3f2AaePS%KvUmN9t_2b+tKHz0Xn zKGkSzQj;qov+%{zBqW*w^2sOph9yc!IV@%7kt_tMhyNjCvV4?F{*W^9gx|)CaYv1Rb zz!y2^+#}zOc}ED|!JXx4zC*G`Jk$wG+o&h#1yM)13LEMVHHbPyopOCP)-umxHK`u* zA^tIkWf!*-+xSGQ!JpfZ?PqE&%JW;yW+6Rd4vvdw8$6TenJ?~mW(o6tdSN%DOK2fM zO_=Yn)&PFEcm@P{6H+HG?U&_Ho(p4Mi+|`Wpr7G+uF^o&Jf{MMV_wU%T#;t5EUoff zSDW|ZNt?4lhQ+*%ab)&ucMhtV<6NfEv z$knhkuh|u6oAkiTK?tPqcK;m*FdjhOW-IlL_Q(;d-GAk9md5cW+o!)D;~a9jW~CmX z90!s+T$%;+#`k!I17no-7EAb?4##5)>Im;l>1dYIwUqGTuHjB~T;t;&c^$g4IJkP-Iks2+>ZXUZi9ADts6hCXejEr=@ANv5;0OKb*#A$S)lfR;HN?{UgpZj^xA>i#@v{f$e+J5DTmY<+06B(NN;HiEuxG$EHB01- zRl_SQSl!X|5xlAaZmg|tfGa~P#5xDdgy7nYpQG8ohc$Az`IqgKgXi7-RccyTO*;x5D#pe}UFZGdr`RBAHjcd* zQ+X7|s0`_o$73F;F?K_jB+$A$etDgOHKNdoYVs)Dwe$oF=e#Nh$pJD1uKET^f^CLF z-_N=%X!%*g#XedHc9%Tf{KB}hiN zAOpjn!+A{rPb@J(&kC0ogWu#;0i?&@!>%agNn11E+*H$h@GENwYm~FNgj#u#cWtc$ zH2`@_lf3we*A=uoOI|GbL&k!|bx~v&tjS5h=S@+SWVGa%52kSV1waB^&=qRAQ;Q2Xb?ZA^}eS)SRU|j$s zL;^t)n9oBSe)$fRXU4PyMkRI)0n-vFmfFQ`MtBDDGjKG4qzS}M#@uB5O*{{4@Eb`FYXLd7Y zHSjn!j86^K8a|BE30zJMu@gw1s4ZY(16>pK28>OhZZg&;*DQSaVoeL$f?Gk;qp-e5 zYcmaT9QqQ*!t6sWh&Jv^nyJScTtHEW3vCWPmxg$$xmiQPdN$TrGU7b+bF3?Yjsz~& zku>TDS;LAuyI7A4`ebb{o;6J`^e3#>WyB;r0oUh&hJU7VJZtpMzpPsU?K1+V77m>> zOSCLuvfQin9P}Q9@&yTqy%j=*m&nSc%LtA%>ZA#|9$r7?;xMZAKn0VEUyS?Wkc^_?#%s&{lTsAtZ{EH z4f2ccaD6a;M{V&x*PzzNxJKcJI>VDz{~QDQOKvZ2L#=fiTbkRLTNZAnD%?4QT}&&W zuZ|5Ar}Zz;BqV&MWbOs%Z|G6l{D5_#JkNm~kBjFuENMg5W~8^qIXU}4`quQKSnp!J zsD>AW5R9|f&x9~Y+<5x`YfUv7T+inhET5Vtp!*VEKZJcQWyvah?#y zk^v-Z$kzDhT~Cm+88=G9b7i>#ni9A)JTBI$;I3U*edHBLMhJpL&ilD|2NLh%Vc7+m z8_49q&C>S$up|z>PNQCzH9~lXOG9DB4kt)PEFJOwE!;T{R!&*6XCK7n_qAup`dCl3 zH2C99#w}_L=P%(+{^t@sudDY4aZ52w1XVehxs0G$< z!wnZ|(LuF~yS6V*t6}XIIxp9M+l1>Lt-*67cf(AHcZXr_#PcWZ4u9ysIGp#9;k`z= zk?~0J4BBBj!VHaPY3y@9J%Os=3o2x4!%jH(;L>){aSV+ry$y3h4##^OSDP6kEp44z z3t_s|QbkP8ofghH)N&lr@LkTaRx&)@Urx|H>H;;xbqD&_dI4$|Gt2u|A~3hq*4a_t ztZn2rgG|mENS=W+`|wCjWqfL@8E#01$$LBoVZ4WIOuFx zhokN8;Qbst^J7gkMku~`jSt!)=#OwgtHjzSP2-Hw5Be+~3n8sy1ci1BzncDyWl@$| z8__O#{ACFeZVrJgs7cBg$60oS42aPkV>ip+kQ4C^VnYJJ$j>ggAwRHmsJR#im3=vO zPTHxXiBjf7>PL~=v(2>GW8{WHBn z&j?KgYa8Lq7>KNI1T{k%;@#os4TuW~iDf4E@ahd~L9mL0e_q4E_!Qaj#A63g64?(U zi#Epa7{Zbgk4!wau$~fbt=}Rhk16P<@a4YC`b>V}a2|zu+(tiVnF?VnS!pX-8uBN` zdDi(rIsmtTjKE_Oo)OM*SZ+XUgyJ3c=R3=12xI92akMdv!?ckM;Vh*f2JcK~Ud5^M zS9#T~F*SZii^pm69pfeZQC7s_e1YqsELxh#FLH-F`}22j#|2*=nYqq*gvNNyG7YE3 zBRPCn#^v_$P@8JCkCtLwRBkiiqe4EuU;belKsZaz_ytV>)fQ9&&Kpbr?1mqx3U5KC z0sVm+gBF?EK$EO12VVxoA{_J#`qiX;gn;64hhClebOQAVZKi-;(>QnF83gX=bIi$k z<^kT#I)CoJycPgA_jC03`&V$755Py`;knDYglL*L z{PG?t#KbPCLG;hs&p{1oL8CXg!H;!&c!GY9^?cBfLhlC+ApD^z)bxVT7Q!DstT#jm z+;|IN(4lJa5rg%Oe84ibFgBqw3w8-@M6g?xHcjAGT zLAUS$Me`GU_~IRhyw48zzW>)tc*i2bc{d(wm$_e|4{7`FplwDNVsih(9r4g-(L1pp z61^9`+6n{wxIb&Xo%=lRxzzl)m*Z{l2fky~0-VN zba%{?z@reKc@tvsYKf+M1OEb7g9eTLcn2~2fG4un62IV_h{wE=^_$?FjXF?m&*1;^ zT0B99Wf_`fTTQ|R-)8w1(sL(rLk@n3T;TVt_k|DZgSF9tb;O-%3}M|dw9A@a4sK|r zwQ;3!#hu3-UQK6R9L6GEfx@~s#w^T1c%*{#a#aIkURU4zV@tP%8NSqkMA$LMH#Xn?DjQfxY_z9ALCMmGK1aboFQXqvk zN*j!xAO#EDb?R0h#E2$q1SWer6pKq%Fv2xHO55HE{4{%>?hOx?i8A zoj>4tEi_=zL*S0tFzY0shk)jx@#0-xydz8t;S)qWqsE>wJVPe|9R=$wH2nl?BCx}Z z&k^B{IXUzYthM01Xqv`Cq^UmK+8R7&`S8K4p6B||S-_Wl;D*Kn=^`Hf`Ac}_m0JGQ z-27#PYOA=K52uSVzy(bUpMGM^0!pCiT@a4aqpYlF;QG;g@Pr+!Tr-TB&TGS{SJW_c z4bX3*-Zc#bS^*cdnyeAJUuUW59N@?LM@{db(E(^fqYsw2d42%-S(_=aYzj1R65cP@C;{`#t#RImUWX^#d5;QuCT5b{ zD_Ppr=9Zc+o%hoMJXe#A!CxBR0$;g5Ci59h z69S%t_}It8(zPaEYrp(H?%-HFBS#o>F}%a+BMfPQ$ASCdm*X(kL!Nk+{=emcjF0j) zay%|2%l>e4J;22^qj5v6et1^T9Fgl%t8a}X@{Sm zAZ>(bvoM~EHI@qRYX5kfL$o|=?}57cA9T$l1XDfF_gF{4dJA@AmdL#Y^GD1ic@*Fs z^5}IK4bTT8sE^{8_e5#4Vr{m~eOy~>V2v}cn}E+_1%!2#*8g%9-jU1P+|a;lz@QHEkx`LmU4|e0b z*zto?#@d-;JZZatpsD6(E}>Qf_{E=A8>kCBvko1;c)~O47Nd+-htR;o&9#jX*2y=H zNEpZP9*>0>-*~)3dtqGRJABcGy!VJl9Qg2Q3GL2fIYt(YM7)Q)@l+y4AJB<*HOd2^ zA>K{LJLxoOLDQ47{J?8)eCHV2N(aKNB#mfqgF>~HHU5QkqET_<${yZne8M}pkShE! z`e{C}MS_cS2^Y&TxNH5PF=w1_9&@!apia0}xUZmoP$PWTq#*Peu4C*Q)JAgdMR-OF z@a}j>AKF@j*2^F{u=K+H2(8Y4Od}fAus{6xkEw-ynYKWQ9GhK;hm^E^Yuu}F-UYM_ zs@6`zXuVB4Tc9@d5%iKE?V!VsL!5+Z+)1aMaHyg%-g~E=k7?Xr$a@X7x7eRg%3!}B zpRC}M7sa&q5B3Leg16D80Q_)L;~t&#zzG_-iW>eoUP;4l!jguQGX)fvPlVtU3DPKS z_yTOCg6J(lT5aiZqON+LQ3lnSxCA@Z%8yVPbK?l zpv)^mvanhCgX}7f7jLWg$iCd?N)L6pa*Qk|jUd}zo0NgUFnN#kDd9Q2p@b+4 z^odX`tWrA@hD=X!G}$*BEp8JYP!^#i>N4e`v?Op@y-Xw2Y~9LWxcDzwe%nB{ zF;A)$!QJ8=;eE1y*+c9@d3ar3DQ_3QB^=n(%JIOkz$oF07$T$yMe-40p+5dluc)his|D^)tM0iV~hRwAY2!&s2IF28z*^Bq^c3zyA~2V@Z~p2ezv#0%v@O zm3-Z|%2Z`b;2%HP^)#jhmj~A<{q$>mcHMk?Ufn_Qb>Ex*Y|~^zN24IGlXv-c3W~Ty z=Q7)ZpDLxw$AJg^bI4liKH-U=Rs1q=GiWq^t8Y#CU@2;uKUR$~Z4}Sz;>5whKSjb+ zvm6Lk*UDryzk{z?;9Q7HH?V%O`G)khaxI{j4w=6T?D7vcH`m{*=_Bki?a{CD52aQ= zCmW^F`W<3hWp|)j*`{95w>Rs>?*0}5NqHvFNw{S!mtGeik`Jm~^#AAshQIZFjpx;m zg+97TfrEyhjh`!HjUDx;>mQT1NH$|{Q;6Ydv7_=_;EcFIFIsL%%fuyeuRu?-U3=P) zZv2f9G0I`$u5?ZYl<~@5cI*p!G-E@vA?0C`5E0v<)h$O zrLFR+!L0vY_m{4K2CzFyUvWFxT}>oJwBfqQ;G5DkT@TTudxY$D{vdusx}XrXP}rzn zrE8^b7ABA-)$i1S!au?)DMommY`lI%^lR0ps}q&BLLyl_%_7TD6QydgSlLQe+&&{a zUlC-<|3&@V!ZIb@UmR?%d&n?H-(6UwydRtz+$&7gKczn)6{@28vii5UQNNNb6dx3) zi>uTr(hU7kvUZ;$`Gv2Px5Ni^og};Tk90`9p~RCNxJAkfl(*CJx#0RheegMX8`+zG zII!OTj_-MY_u#|6_v#<;CHbEB6$cEI>q39uz(skU`m=t%ewuE$?uM{XvYV2vV(3H~ zMEaXwv?hm5bnJJYcg%GphmEsGJ6?5IoHLyxoWD3v*=s^xw&WU{85inemGiX+D*Kl2 zD@iK)x$tc66It)3eRpSk>eCthvqxt)$;`;;mEAQzrMP+7;mVlW{Q9H*R?4T+9pm@b zqhVIpcJ~F(KyRC^Y5EJ-_qY|bnK5IXRMvV z_8T^<^OQfUmgTm}@#YLltGyMxz3}>>i}%hwc|Pj$xa&V%KYu;)mYUi=`%u2Qq-*)6 zng#wn%5v#BgT+#Ao9kTRdcbwgz0s5D`q8!4v(ug8Sm7*nb#XoFIT1M~W>)OBgmujl zTP|tUqx~lx+BW^$t9ZTM6x%!I-3Ej2lhRei$MgE9)!cU79)GzyrQNxQQsPqDpX+|^ z>kFH%|9a<#v~Jle@~veP>aVG-bz_WIt!?a`!h1(8kM17xdGw!=8zQbp+>R&+&vt+9 zTxhr2zi{Y1_1=B4eG_wT z7e{V#FL3U1b#`}kO?Dm&I}$q1W^m?4d>Qvl(xxVTo1JU%ONZHAOFG?6*b%ijW|wOkv5 z9cFji-*sXOXUx3#gE1$Zp<(+BQswIW%z~`!bvFZ7Mqf%x-g`Rl#KjX`&ir-uPV!F| zU%Fa7q!W2avydUI@gC0ex^0tnq*0_ z=_->;8-M2ZnTsiw%PX#y-)Ne-q42%RRe`?Zn}$=?m+dRv4@U-Ly2L#iC&qM$ z817gX*4D8+?0m?N)?Y2LmeP>DPM!B+{PO1iX}h~!r;by)i9Nq-H#Kp5Qglp|<4fl~ zYf9BWc{lQYPQP_E^-9u(^i%6jd~mGa;XcRLo_X=?x|DY=t-d}rZGZ0kk~`I}1?P$f z%nMyH5ho)aj4{N|jJp_rB7SD%K}XN9$81u_`{oM5?wDgLvrMpCypt1mwCvn^O3P`T zUVd~`_a9pvPPm=aIeKmQ)9y6=BW0ZmX6GklZ@SgxYR0*1r$6|&@@SuFLmZ<$S>B8oIsQ)4hfTjsydC+gtFJTY$hOZ6iw$v@ zkDCvN-gLbY)zq)Z~xIY%XTW{MCcz5dw722?s#j{$6EwjzR+%7=er$#X#QJL|AfI2 zqWyMgnqjc7xIDdRa8Aq2q|`Rop1g27dBWM=XLgSc}%yY6;Jz8^I#dT(@#=$nx}A{3X?HNiQnu_Pl+yW2Ez3_}<9E_#w@H zYq_RHw>FLrt=r#hk=0~j+?U>o?iZZ4kg4kYstd*2^B>KblezBp$SWVF>^xn1dhXf2 zXLC+{e(K?~-V2Mb%)hxM{rkLD_g<_mQ`Q^&W~Z%(tH1a4sGZT>qmOv+gcpS8g?DzB zIK~iu)e48rrFV4;|4&4p$j)&!O-kc`OU!JQ(fV$@C+4%5cOv_FD&2jZf13mHsJbVr zHk9rxoKf_2?r%5uT$v{zHS;Jsm?aE z3R&v1MznKZauhm8yPolM3I8{InWxtNxAkv(i2GspfT-5arH+N}>d0}?a?H87^YI_V zKN_DO^>Re5cck}i&j$A~TbkY}k0%r;eeJ=D_lhsyU7gzG=CK=JT>s;0^5yi4TQ2mw z^v;!TH(I8Dn7hB|^)g-M*Og`Uo5fMqkkAexdDeVOXWMz_@uGq=34P7FKPDk|lI=rF^RPwUVIEV$ zfCMG{aCo|1vc2e7>VDjlY%4LG6ZeX9#Rr9Bg!++KH>jfZyQOo?(@mwi zA9Oz%CJNzo(<;u^&ho_*idw4gcFFpjYo&XtJ6F%CI9z2b*5|D#ORN39qVQf*|A`t) zSzYOafjDV#?IyL2_;_uq@S!|MnjG3ox7_ex*nZt9!-x7M4u|tMOP&4Euyo5R(*e_L zM>}`>kO#tg7)-jI`r)A^?la~cl3h7pb4J%9>@`yr$>9#UzN%X7ZTeB}T{9(+ti0>r z>^o6EwC+}IAz}2ktUp-zXK5Yb0`(5etdc5vR5vNLNlOjOq(JsN#S>jsfysff;#2kr z@tfKUA#a%q>Ta5y3HwaB`7=YT;lEh2LJ#P6i(gtMs|%$0?hQgBVN-OnC0qWGw@F_0 zq`9x|al0ZP)BP;3HGF5fr?fS_r-X`c_@*coqOSfGnnyfQf3>>3?`wZn{bAwlz>=Cx zwcCZa%Ps}F8ea(hE*Dq!Hcgd2u8yf)W>XE-%HhB${~vPmV1}v6{FG{vo670ZL4BZh zfc{PUS>amET*LOT%<@grNbj5Sbn&SDs4~O9T-av!>x}iqrvADufdjgwx=)m+Xl4C5`o@v6LUdq;dd(8!|HMBo z(52#=u(xc(vrpFFarO@!uWDj?(-K`Q`13-FrH;WzjD-3wt=CtUv@))Cy{5#~b<=-g znN@aKe9z|9<*MnGPTPLt#)8h4Cc56fH}r4Fud1IKljO?41^oxgIzzC&ld*q&J8_G+ zLY=0U)Y!TtUy3n-P{l2#LG?dWo-&S8!)t%gHMjH?R#ZH!oUur9min2AkVtEM=J{bK zYRpoEenRD)ur}28lZAH55%o#3(f+Lefa&|1E7kAOqDl|KEBrV7k=l^5iPj1Bl#1e- zRMT!XJ5V4L=;p}l3~PL+t1cN&sGX!i`dL0%NLKtcT}-pY!A5uBu9{>RS8t-e{x9Jt zT=BOKJtYkD9hC=$tk*C0&z8Fj9mUnb*btBJL!V+9QNO(UH|uu6RsM=T#4sZ8O#Q&R zvubUKHIPv|(Qr)OTlTO)XYTHsUnA&`89u6;U3c2r%~V|UM18O5@%0DGL!F8;qb{p% zt?PN=>p+CrBhOQ&8gJ_6o1YfH()S?)p#wt~3Tc6pj?Ca&wMOHY!VgAgFfI^DIB}u1 zIf13B9K2GMWwLB%8OcB3PyCE3T`t zR4)jdDMu;sLYZP9j`FZ{S-v8CWG=5CZ`foz89Z9MC}N?0bY+U|Q_E}8zjcwJk>;1` zIx7!{w-Ig^-LoF_MHuf9MnYfNQYNYog`70C2ozU*LAL9+_&zZV5nk{=RuQOH{i95` z0wvNfYFyP6d1n2Cp|6VTYDencRWB=jYM%_PFvryom)-WSDoWHW+ah(oImtJhP{97S zd~cYgcnn2qsNrpMy#B6nV_g?H%koLc+d4~~Nq18@qiZTYU>K=5s+LHDbu*>C^<9FW zE45WS{6q8!V&@9Nweb)1rz#U`cLe5zjI95wX1?$qp`@Sm{}sAN*>x|~@spvd;!oQl z-3tFg!f8A!f9BugC^Nn#)rj@Fa`SCvl5URW3CmukMtoOLgCor@b5~=QJTUlauv2X( z`(?ue#P7b9s>D719BFv9;M-QWU+pVQy4RLe8=HIs34!QY9OinHLI&H)~v7CTl94K$G*>mt3jKuy}IQd;pBvl3whLVQu)~Yh^bERv~`VmKBApz zwc#W!MwZ+E@){#u_F+lik8K{I z;=~SdMR84&{P7o}^f7r6k2t5;)>vm6`iaMavA(u72g`dG{Ft*VN0W#LT!qo7&s_(PT=@D^brzyypJPo#e_fZx&7jLTYtY zKb9XU{i$F`#?I@{Tra;>cysqP*X52E?B`otdgXfYt)pq-nV)BWp8tI5<*Fi|R}rKT z({5{*uq%#I=Ty(uh>6~ok>5uaMsALp6m=?kUu;PHyx7sP{)8u*PHj53g|AJ|X3^2# zMs1CH%j0v^I=5R^D@y%|s<^T*N@o;B-;KIsx_0wY$d$8KH(wfmZf$b+l)ulvcO~=I zfz~pah zvHjvo;)|P}ZC25;N4rf;*GGy2FAqw& zd)|Ac#re`R{gQt;dnNh8wXy zvlte%Pjbdb#Ks(nSsvq$`pTQ^ofFwL@~pQ>lq-5!^uXxNG5$CyXiqOky^v9Cv`c>fMJMC|oSk$1dDq8^Vr z5_vr8@wgcYKQ(#1+09nd+n#88H)@x6dF1f$Kf`xAj~J@`@7Gw%HWVEBY`L~?!Y;cmc*~+z z5RJSSG1+t3(>*-SyD#e5=z_?nqMFC(<9&%Mnn$!a*yf8i|0L{+_$G31$qx;tvZbmnx?C(o)+ud>t(sEjXZ zlQ$x3ZQ6tB-P2~>{^DlO8@?;^ubjK~#;qUIoS9E&znHtLaB!lR78nMNagN@yvCW zIBwYQgnngSp!cflzWYK}N`{iU;izl25DyV;)%d*89nwZ{3VE0%OZKf7w& zj>t6c*oeuIuSC5R(IvtaKHc%B!{A&RmKc^F>a?6Um<(akV6~01*#B;gv10SRA;t3x zujl`gGa$QH=E?L$>6Xlgv){=v<+aW~UeL32W%*at>GfIuA&N_Sgf!wC^j^#N#xbU8 z=H8Z9j62Nb=Dn6=+hS9cW3VaSzSK6)AvtFe-u645$?oBvZSKk8TbynuLHIbM?fdN? zg?$$iXZgtVl3}Y51cPK2HCfUmD-X+$Au0G>2KX&e$@D>;br|u>3w00(jr*l zkMJ4mB5OBQudZxc@k;rHvTkL+-8*t`&%NPgzI#Pw50;mgzg{`4YFKsOnz?l^)&1a` z;qON1Ts;*lS@rKK{z&MLH}%gMUN&|!%`u-bUpDu$4z|8*O$zxtWKxJd^ib#vp$~@k z32h$wSZJ%z7ehX=p0wl>#^hjA7vm^H6a8n>2yrjzCqIza25%6eqosag-N4!fHJ7Si zu70e#Z&gaw$5nHy%BoIO>1v*-9zzI$hiVVi?XQ2#_lQ3suraVA_z%#C)k%bvvsC<6 zdP~<&pRBJmJY-yMoNE%zZOymM2kAe{959bD4>iv=_cvKhhm00uh+(nbuUjQ0O5??s zgzbcZG*)2DU%6@Z7HF0y+DX%I_Yhx8R>}M)ZNwH(*2{$(D`+Fy59*o)1v!9 z>LaBQTBL{2Oh(X};9rEiG+XUQcrb;8)^tkAQ*J5OluE+IIj*cHoR~IhGs1}(qMFq( z)k`Zh5$a^Z_UNtlr1!oeJOHd))u`qz)4z_GDGP3}N5xAzZO?LS!02dDu^ARDDQ?|0*Gk?4Z@NF7(YE zf+7qg?3bS6RB;s{DJ6@gVu5%;{F$y}^mJQ1OvptW#2>|Fgk5%na<_s|KZX)w#bLre zkqI~N8|6_YPB~7FX~O65FTpSA@E^MGnZ_l&;D+LaqxcE!3|Gqh%|t*L4)W zBK)E>p_f=ibEgjo5BgX7j$1NHq7+TodNtxZgum5Oa!5VMT}Ao$QJg9E5=#liW+k;k z4k1EKRZl73k?vtQt&dbtDPJKBxE1me`8WARc@xz_q1;7jqkKsyh^2&7G=@-&f~uAF z?z}~1-bw2pPBE0wejXBE6XWRntBAS_#hs!oR*R2Fmqe44Bj(W>$3=0XxQGzrriqt? z8`Q$HgcQP&Sx#tPz0|GBdBVAROX*LTR>KKBvAdE$_+y_avy`8dBg#!BM~Ngv==TZ3 z=Mb$(=BZ=o>pf}T@?t`zT0zLC;Z&Xk%ENNeC$u9RtTAFs@k4P0AzIBO?5*D7vxLc` zCoC_o_@%I)=y(k6FnNzsT0^wllF*Ri2`4B*-K-=M3X_R&g9?=zDrq^by8zGZ5kk3o zoN$09(kjexqLE)|t@T5~w0NB`C7iU^Xguw?1t!Y|p@OiD3`E6S2*Kw!p`P5W#Qx%6 zw6ggj;ri4NDpeU_)pRD>eoWZkfQ|AMt+BpCI6pvMIYan7H>qXQ2rK9`;cGlgE3T>Z z?LCCJG>Z_7Zc!fR6JFHkgss(;&|1b)?3ILLQ%E$}j8^*NDK9@0Qb}hakx;mX(LUOI z!bdtGR1)%28_`R7(up5aE@x65tR-qqq@HrF0eNN;)#rKj2iiIH7~!ByB1<1>gr78> zR*M%1pA!z$JZkfugkt&|@vl#5rR%8DLOG-+D{a&mT6X`L@RfR~vk0$hs=AQsww<_L zDHKjoPxMk>-bJftvbs;~Kxj~tgacw{%F|)tuFymLPMkxkj6y8>Mkbb9-D7;R2kq~s+62j{gI-~kZ%*t(Q#!uZ5ICao$q6%*BH@fr1$FqT&1dke3q8AN^g#M5j z&xlVc4+>_bx7bzA7E9%1D(#QLX{Au?s$M5Vuz!VI^;@d_rqW5}gperB6XL`#2*YY6 zVfu6uZmYuxyXY!?YqvN|St*W`e^);gO9-F#ckwOa?30D9${^uqWv|*-EhRL~@eMd` ziPBIi|3+aXePIEioqeM06K1Gky8kE!D&axeZI-O`qQ3Vfwc#4#r80&7B|M=Ph~3rK zseGYA3$?$PC0R?W%|b-C~kmBS%?DGw3X$~Sa}g@J)s;@L?`jWjj5K-rg< z)F~#bFy6RFumz(H#u#6HWwY z(pY_2%?n-?i-LZsRD4<99t_CWl@FB6;33^*c{U-cf26jPUJ{?wy+BgV7Q%N6qZKs#xi?*aWDpI16cIZ=W=rR~(VL&b08dTBOE z2Q}&_{eC$#xL5jH_6hGQiDGw>J_idqy5>T>Zoil;HItS|19U&hrwFSynMVI_gnaoq z=>ftk%$D8{9;DIfJ^x~Lnqo3k2UCQBYJv2b`bF>}p?SVVXovMdNqRZ>r1YJzG?*fN zM{;1SJWy{{@@Zd3tg*e^Q-3!wO&p=b>T1L-hV{yPX+rRfCX+whtxW- z#dM*5n=U6XS${QfTmN0)WkQcE6RLu52tGotTOOQiwbwV7#suG0eh{9JGxb^Zf9o=R z27Poe(J)%-rEK&gV(KY~>qVtlanb0w5yiygXkgp=7>sH3^gOmU-suejg0Hsry&FAcNw`@}+j zbnvn`QePz7^k4aAScg!G^MlWdxxu~uH+)jCCeTc}s~!+?%>U{$g}H_=rBBpEeNddP zZ%t$H*Z!8iF-j--OR>E&s&;q%?7#(TpL@aHhEDRQ!C!)d{H5Ys`ccC7=2OBzze@a__|;1N+29-0*K6ezB~hrC z#|591-_`%-OV$$}xVl5yulLDklx!(gr^>(59+G%*r8z>qF71(askefClsDAZq)YP0 zl0&xW_v@p34V7;A52^XO zwSg7FXa1Vty1G5O(SdnFjOr7sgL~8q;(B$9{E6;;b%L&|)Lvg9eIgAoRY@k@L4BdR z&NRr-QHqozb=mqH(%A~SuZ6dyuHsmAh_s40)OLTCoa~<)^va!svVWTVbnTD+QGx6_ zk_l?8s-v>Glp6TF?s4U~{~NJW@TRg$e^xbFTN(Q6n^-sMV@xK~OU7?ZgKfRcH6ibW zEODH%H49x6*2&s7WRhjC{<7|K$*I37eiwW}S>rR;S62O4wZ3L&b#g^|#q@jMmz}@& z;JwlJ$}8&1f37@SF}3!Wn(*37{yhN_bA;W}UNwv6;+;*`LX6h$Xgz6? z%{7Z=*Ig4ni2E_BWAs>O8&79k<86`CtF?da=G;b(@N* zrE+l~Z+nh8yG73QoK<&6-z~p8JLlQFP5D3OzgKd!yko_`m3wP0_!E?`bZ&hQa}(}Si+kzlOqx%{^NYWv%xtdY--3lP1y!%RAj0l3$elOvcFc#I%zcC$iGA>{%PqU&^?WomjBH@T=07 zDt1;*t?pQ#5zG)bn=K)Vd1c5H+YwuaV~0CGe4{rZszcPG=;%0KlL1YuT3l~?r%C6S z9^QW53C@1*KF*nz3x;VzY0cd-W7X`6f|5zaf8^LQzeq2<^Xcu8sk5?HWUS8EmNq%P zRnG5)SBvUOXH=f8{-!3&w_T1gctU(ugZ1Z-LlU%a|VDl4pvs(!paLz%As!CY-EF?-CVp^rP> za@=)o3^#;3!b>7@B6DLdCuKH2(rjzw+o)k9h}}ieN$Tbt-Uv=r*BW4erIP|N&3aCzYE?hjxCNY?^ZpwW~lFVb-ex+ zbL)_m7TJ8(Ho|e-G0mOp>FN2zQyA`wRAYKHscv$u>GGz_TF10>#MeeVA9*a|8%Ho~ zt+`77ur5JfT=}2M163KNh56s+&d;2j;YoY!&fc4!rQJw9e5X(9z4X7bPUSscSXg+V z?Agj^s(-KhOWq@PG<#?tP=fVY+c)+S`wr*F?n~}tt`2TBqB2s9lN0wO?Py9}yUn=f zAH*H-c8>bPlja;|Uu8LM_+IyhKeqBxywx-fk^;_-cU=N*2YiBQ*t=5&cx5F|VuQ?@8pYU_8agKUVY;=d1 zzvKN0&on7cTGg^y%MMAyqduU+cCWbKc5JfkG_9gNbe>vsRnMBe<#EMd7mmnTO`Cq) zsoif)zhg+tygmN*>N}UxE@pSk-JJJw(b_T#wc`5v&B~*O{pO~Y9CIt%oAxBsL4H!UkU1@F*qxtluS*+~dgIoxJI2)Onaguu$bY0T^q#L`OXca><$(#( zJX4x!jCrgj);7d3jX3l=m+HFYSYn^yXzQL6dCj{iGAX(+E-k)o;*^%Fo34odGyK@tyU#f*oCVhLrjxpVbLo%nw4dDi^k<7-5sB` zKBF=&x{E1>_%8SXQI2kyOVpjdxa+@VnXyoF|!ipBwlZpp71#Fx@O*!;qk6=hdXq;*<%=} zmizk9p61f(jb)aS$@y(_U(fz6qhnfqTI8Li8w+mizdbaqBIAdw+^o*IhYNlwK3sO8 zc2h8cbY2F1QvjG z&pOvSlO3X?uWO{|XHT*BWYpo9=VDS~rG(+pTWMv_6~5cq&G}{60qbG2Y#b@BRC*~9 z!Bw@v>N91nOTr7s=e5f|pRqe*VyfkK`0cdYJ5r~o&(3%?^RK%b^FAtAUDBa)W8FOe z@A9vLS1+1>3K?a4!9Le1y9yi+Ih(lGxr^vPV1{F~<7a23YlKVh84@u+{K@dQ!jrro zN2P^Nbse^Ea{L_D+;+?Av2-?XG^7aCgt=~!NBcgneX(*%`In{JisJHr&Yhk+Dmyu& zOUCJpPqJoY*|WD~Z^$jqZ&i4?o=AoT|lS2lFhK8)QEH+&- zBoONSZ&JC?S}_ND)IVA?y{ct}r|jv{FN&w-kIDTp$CvYc?tk*W&XsdL`9BmKBpG63 z#hcad)_zp4^JfPw(sA7a(_ZL%dcB-K=F$+f&`eL7@;)g0Q( znr3}4WLxORVVi89+cWJig*_BHCN#_1-Znn;uaEalKHH0h4CAG7D>Pplp%pq zpHjD=)?M{LMP!+)WN>jt(VU{UXwTH4LQm1+q6sCDr8~>pRD4rCs`}sB?REbjM^^zB zRn~@YPWRB=2r344V|QbBch{RuC|f8SCci3cC7&m2B+HdN7Bix@!hZ#yh)gUQ?aW_b>eHV+Zr2K@%ihlR zz)}t?w=1SGrWK|}rdX5Jlw}%d?rv>w?Qj2NPjftU7P+17VDDr482yQP!X|Rd0V!UJ zSkPC1qMpaD;cG$Loka8^W)f`#ndAt6huejarA>Q6pQ;MOlF@@|7t`D4q8v{GxU~B>Q3LlBL zgtDz6Ruei^*alnm7SQovqkb^gW!W{+1iVO<|8QflOce4CPNv_s;cdL7P+JiSVBA1bf{c z6==@4c(c9ly?U>Z3Z+I<>#0U`1@(?zNY`c7FlJ^ZpyuNN+inZzN*@Otaya@HZHcYL zskG; ziC8G+2W-dytT{Fm+l1}M&SGiszBFtk7J_A=I{@*Opa;RX{{s~H{`_&k%^CJS`yV@s z^)jECGUh*K0<(%q2L|OhbDb$-7$$^`V@I-k;9Zq$IG4ix%k6~k-P~mka69fXup9=C z^v$n1%dPZY@`z zD`vN`GuRev0!y+ECX>l$ZZJ=n^UQ6goGD;Xc)bNXhfQbivB8{xo64O9E8g#@K{s4AKW>sp(keJ1MvWyg)(2j#$X9p5pWg# z0mr%nh;RsU56-an;lBX}*c;dp3;T{e%%-vZ+2L$5+YvaD6~L9;Wy^srNZZ5?5KZSFuv*6U~pMWfX z2S3^06V|^1j`(TaH1uyBK%So=p8)Ckn=C_un-&~7zy{<3ntvJk z>o$K1n1*ru9;jpSg$7vSGlmR&qbM5@_cc|K}^F0ai5^_<;;) zffIm62Eb|DMt&#w;uOI2v4Cywgt|XPW&-Er2j{x?gWvJ+N(p>l1;!!?$~+jDiVFS{ zB#U$dZtw|z0Nj_&foW+0-s*#VX9Vy3BQQF_U=b#vVd!G`D-J=?t4KQZ zvkX}ejMOZCAaaLq0{4A?{yVn|+DFVc0K}ewJ0ujCwkh0CxcVe$)kfSO?i63ewSd-B z0^c|Qu<=Yz$%jC#aC8>%Fhc+hw?m7$phfTSI{-cJfE+-#A>)8KsNkDpzDN{4m>sZZDvB1fK=`l!21~vvQd4!)*cN`xYM#e9LiQ7fO*IfOzi3mH|`Z=I^ra zk-eZ~tqT~|8y15ytl@s~@6l-t4NvVPemYXaAK*feVSvF7LPMY~+xZi0Q*1T62LHx9 zMq6?=z;l~{KWGxDNmrvJ(t@2vv;&`l7!BlqVA1SvY&2JbEJ0QQRxd|xbFt`2ZXh<4 zy@D=eTVYEXHJQjP;9KCADK(aa*x5WRkuJff(fg4b_+0J_i|}E%i!0zaV+{9(or2Ec z=L=ZZA96Ko;{u8E++2e4-bc@n?_CQ7t+?-eQ|Qb0%vSUnL!m?Y6mXBpvBP`~I+7oa zWirzdKN0PDL*j(VHBGpe%_sZQUr`rFcpnM7(szkoo>X))a+CTYc*k^uXMZf)oZm|f zV@dQZU5eXK8hUCS{(vdPrXjDmc|rpnr(<<8(=V5B0&kEnR;Dg902VI7#2eJzM#A+txi)hk7AibB}e+(^ucHvr~A z%3VfU3&2rGuLqVo1#5=3rW+vPLYHSDcNh0%+Hq&G1BKEjv3o5)8Q+Y|7lcx={1ALAF%BQ?-O2a~4q;C@ z%>9j?FRVl-dq?o)oQnL6M7x`#DTI@|K@XzL_*r5e8fDGmcZi+=KlRY5LX1Q@zn&Qc zYnKRQ6&mJwjbOwhv?+Vs6N23&z?M*){U-LqGyjgi4|Cj5Q2SC`DVc#txpKhhAEE;68GeIp#_tx~ zrG~@Yl8>!NhhkE9G2V!rf!a8mH;J?ZN4SUE;!Y(9>;UTrPQe)R5w(Cy=Npm5=y5j6 zeH6KgP{vZU zFX9p2kYC6J;rYT1=xl^y%dsZtDP91hMjhbtdh(apQWz7j(YNUUV61v0zH~$C9CsF+ zw71!Z)C=Ys{TSA>|1hoS)!sDEL}m`x-m~6&!}E%M${eHR)M@V*wwNK<-RxbaJKK|q z<*SfQ=zgpv7LAsZTLlX8v!JfvfiPUMLflc*UXmbRA$=_=5Z{&$RU|8#DH|)!$VRI| zREL!V)Q^>?WS7OX^nvWCsE;5T)1h-v8*8PKycgV;?JcY#tJIigY@~Np4bf4$;OdrD zAyq0}bZvkA7kw|oMzh!2)?skGb6=-a^dt5eI5FR18TeA%OhgC>fgkykSVG8&yI3YD z7;d5{@T7OR_At7)<5$C+KNPsv@t6qS`%v%$9EhzHYm{46YRxj=z5#iG#X&Da7Kcp_ ze-pYl+#R~uU*{JQ_*=U}c1J>r?N~2vHGRf))|zj^^fM~|DgU>uyf8iQc7A?-W?tj` zR)vwpMCtCz3Z1NWq-m#poNIzNh6{sT?R7z=xQpzxtiQZQ?vU%{ClxhPiTJQEl{`cI zLMCxj=m2kL*LqjDW44X4l2+Dw);_{f$JyU)^&VsD@rBr4!9`J5slTeP_K{z1U}^C7 zu=SBSv9>sU-10gBbt4i7#V5tfV-JLU4(Jj{YrBdI@iJaXe+CRXUzb##QerQN%NhT> z^)KqXE_1?nZaB!%AJYu4~PH-Fscf+MC997GK*O=MicIUw~~S z?@1P`a(ue_w+`$Zb~5Tqj4?JgZb3rRdX4Ip*6mbpdA;q4!3l}+TVsa@uTgAL;^rk-xvpl7y^!9(Ir$*6 zi9AZP&L_lgp1&|)Wxz2|%+2yOsiw+aiYtXSJdcfbFR(7PXe{du6DsePrIiF>IPyHyL+u9`>xq7t1BTC0l^Eh{% zigQGms}0-rI>0)s%G?!X)yT@=s(Cew4gUc7hPX}C7p^1rQcxlZRV+|9^ojS22nYyn z8&WqoF}NTU3tJO9Hnd$x!_Zk_hr-&1%?n!{{xrN@xG(&5IADYD3LYq*BRxwA%^UO~ z#y9%4m3<074OM9=aziBQiJg zU}SB?p@=Tp{$z8oo^RqKnE{jp{j{JH)6eb%Bs>+@&l4$Apie6z-D zO0~SQ?e|W=H%rT8gXCK^T?5>pBW>)j44C7atRy8TM2iKZk@;S${iUUk@m!6l>V5f> ziXG)|OBAKm)wA@^YKH1xTcj=lwUIdwiVQ|Ti%&^EDw=7oYdUD6wV}Q#e$_s8wbwL# zd@0{}-+z3@`R?-<2m6F93B4UQB4T&c&zL!Jr(+5uzN>Buf)pz>`?1c}KDsJhqngv@ zC-YK%)%)f8<&#zQ^X8vl`NQ&Z^KO@oHs;t%oeuY6ZjR`wYOlJNx~cEv0JDFtU!ebL zUrgOdI-gV#UUVb9)^0SO(l4kzU1cmal&mbBR9>fiONC5VW_V`0Wc71i_qKug^9kNx zutj_YP?<30TveQAq2|5jqb5-MMr+n2XiS>VK6icHz90Qo1&s>b6t0Z?5!o-s6W1xB zTl|)o4ZfIYlgy?5PMok$s(DyhTq!QQkk$zv_To|BIj&UhlJC6%Nk2Gl-nu;_Yiatxv64u4`U7qkK|n=kibG zEi1LvIkkt(b!_A8JKYxztXNJEwcvRS;@bM83qnE@DtFt@4N!;Yfp~{m&1L#E`vQkTO)zga9ip#~nv-|(N z{qyF}${%=EkKBnx7YbFy^Q%W#=XvX}0o*05sk{_0`f8u{{s&@@oPk zFXJWxe&}zu)YMkTSL-XH%HNkAEC080eN}<3j!|Ia>@A#!y@gyBwuy8IRN{`ZO2s+l zKH%8SYsxeiH3E%P+sEgJ_OdqL=ciwlzddkK2p765>`LT{m=kd$;}YZAMjq3s#oy&p zMFoG`x~pb=)$R(i^nA{vEbXuAtg%0bX9eVLD?D0AgLkx(`G6~iR&xWeUXpLBA=)=E zuKw^J@0a8|)@QorredCGG&X|&$yB(jtWykWx^q>FD^HeBE?ZPKp!{w{$7)>9nYvgl z_B794b~)BY&_{S*^jnsq-mcxIb!h^C6Y=#Y{Ez$j0gKky|Cj&Lz(&E(Lz;&cg+2-I z6ZIf!Wz^KD+Yt)iD*~fnsZ1j9ILm4`RTflo72At)vVZ(mXOq9Qzoz9z7xyeS6*euq zu1|2LQ9g788%^#|#A!BYQ+#>fK)>UD9U#cBv1X~PIr$$7HU@gDbEo;XzC?GjN?Xye z>_Yjv@`t4h%QCA68y1{5jEiwnH6WWX?_|0 zI|6nGrG=gh?;6=N@=Qctc#}wJ^nvJlQI-f{#I%Tx5$D6GfMbgN!giuX!jpUhxaVT@ z_iKW6X=QnZbit7PA-Tiz4ix$nhZG+xep7Z>*Vf$7*3$mQWn{PF9|c3jFQirSSxQD3 zqMoX;s`KS2Fry2^bA_F-Hp~(a?KHew0E0&ZFDBE8VRB^wouxxLIu3D-mjCD;PEd!h*J&!1g zjYDr>Tk!23XQoI{6Opqb;h^9;OB=uypG#bYD^YXj0y)w6SylkCpgY>N=PO?T)DLyEw z6=(#9$%RByVjot9hNHLmHJpSy!+v09(9;1=6?tEI9B#^W(lyc5-PO)D(DmGv>OSqR z<9X~E?QKGRq`J^Q>2PKTqh<%NSJ<`eNx=S!L1o(nP_%Ar1NJ9VmuY`ke=vjbRVc%?|`B<30n?$=3&5x&to}Q3O*elho1vn^9=qQ zXYgwH`3YZ#_r_CjE&dVv2djtuLbsuPL4iCLvO#g=2JG@}+;zZ5`T?$Xo&AUPXKyjP zm}N{yriNZmcLjZSG;O24Q0J&qpzXF&QFJQ3mHt8dF`F4Npqjf`Jv$N<$qQf=TmgE; z8=$IO4r;>;^fmeeRbs=j5m-AwPgU47>>_po$}j<&0eI;{Kp~G{hp>HsM6Sou;b$tm z2Rxvl9adtm&{LpXzKq@nyk!n3ciX_KI|_Ayiggt-1WARYwtM_|p5e|xicepT1B1L{8?-2#24M!$nr{UY24EZ~J1{C0jiph!)4 zEg-dlfJ=_#Cjx5w7w`OgQc4HNqwNgX&tkyZ(gA-x3A*$ru#3D1f1L$o>@~oKCPGPv zL7D5r`w`f|o&^l>I(+UD(Dz33L4c6y0o}X=NZKXt3zRb(wC{F69=kwI{^Esa0iATg z)lk6uU2S-VFFz1ibPW2Lz=hwCQnp-)ATT1!!6e=%G%?96-T#B6pD8uv_l~yW)k= zXAzLhYvMII$o^q3fo8TnSIPclUx3oABQN9EL!Q!4t~=oOL--89$A9r5NIqz+ zL!kB30JV(-EcQ7lv^OFOKzb*F4!b`n{6~TM{05|pZQ_~%YFy1d28?qGplFl%+kmGZ zf+y_>(iu3|zu2qb2N=PKkag%1z76t} z(Xp@iWKi*L;68%3vJKygi$Xi0Bv-}khbL$SaJse3Y`}|@TpT-sJI&{@_1Siy{ND+P z?`aqxu0W4XL233HAWW;d`badWf3@H(8G#IAy7O<*Ti8C(q*t)%=xzL8zCGIqbkFb{ zVyWy4v^PhwAJMa13buh;j11sMBFC{ZVzFq>mtRSrVw<2Vxh1R&P|E@A zcKQIQ|8MX$tl2|zY2+M?WdBfOkw55rA`R(G-{srm-M|ati>zQZppv}=<4-QzjH{qo zkYUf3VOp`L@P|pm3T%X z9fb{;9$q6T#%S!m=Nfp?!%?vN7zJfKe`2P7Tn@2kjSh* zIMJ?58|EWFnca>|r{2@ck(+=-Kc#v?8i9rV!}X_P`2I)`cHBFMiNarEetZ?1%7-&S z=o(;uj)5m+FR)j?*csxcpmRM1iuPS(8}vLVoST#9kaBJhAAujln$iu}e&}vI7=OfF zV)l~?JRDG2U*uoV?;EgT{92+G(ZF2#0dFO^#G(8LaDHgeK)f8=%WCn#+%L?FPXnJx zUqIFbfDNAJ{L#ChLT|;aR-p2k;Wok5fThj%iMxp@2@ewQCe zHOAtJaBv|l0qy@fNEH|iPyZ9NE>VP*u#aF|v9k+s1wNc1+3)yl^b=wR55^?G&YvTL z(3=d-w?md=R^%r_F>BFZ{8S{LLl8CB73qxj!B+DYW;3TECXm}WjQ+*8CVpcHaLrfj zEucQOZ$bXxBViWXMZAFd`62!Q4P!rXW~3dO z$L;{V|0p&D`OHj2dIRR(j#vULYX~|G%61MJ%SBNFI*p5=ViA_JVkUkbd&F&{mh;{4R`@se8uJ#}MxMoO%yZ@& zYC-GqhfxdC0-Xz5@>X!AaBMW|rB`rM@O1P8okbr<<`Qek5&UUDs>hfP?3$HFAoJ!;YX~*brVp z$Dm4l1vZ{>Fw4->NFHeK8!)3`%{2zS2xG+&b~SU2$tG5ly@|PKYjy+Iji@FDqf7ZS zOcnM3SpK)bz#RZ>`7(AR`d zAmk7-9NZ0Uu*+B=b_B0NP<{@o#mAw?f%)CYhJmZ30i?Nf0A9A7d&`Q^x}fFXi=G9} zcOu6DqwmX2L!QITmcXxuIdwJfK-XhS(23k2m_P6kg@J<#j7f%)73yz4D&Heun5sZs28bR3aL{6NujnSrjXLdDk@#SnHWI^U3HpscX0sDr&cwwLI!38snSE9|(2jH6X;U!QPFF0RXB9D++*aAEeQE~HO zj!eP&!M!<)(lH+X2$IWB;GO|P--K_9ts=SrTHXwK#P>v;>-vxC^J9w&m*vp`#_u+qWC%_?emun6B zgK$0(-;4c$RrUd76S(JQq1mv0S^)c_Bzz&{__XJGaI27PB!%$0&%m?b6p(Fb93Dc5VD+#LHR0chlV|~CEzT#)us=j^;RUiUmJh3)c1SH6 z0Y1y_f5%r~_%&z;ybt-Av=ZO2@o0O@4L#+{9pN%4DRqxZVwA8R{0_PWH4{TmVGu5m zGqT^AZFDwsgbQRRc&~YVX$!rG-cGjzMU9^OhU`OIA={AGd_FRc>?r6=93epSBWNO? zB)uj1B_X9N#qCA?gehW$bgU>@bWbEB$6+3<58O4)gg*qAiT5atcOe=fqqr~hJP;Z* zwjZ!HcJy)KuCdOSj;*dPo*Axx9iv=r-6x%!TpOJiowwZ?9>_9rwsY=rtpg|T3FaD7 zfL=qtp$G5-cn(R5e~Rx&6p}5Hf%1!rCkkA%M|;jU#lMdKAAinwxOS6rjeLqCT7^ls zimxmB%lb;>0w>mpzwM6j?sFcqG_xd_Zq|G%Z(BB_>O*a&@qwj-ZLDpk&16Y4E;qih zOtUcNE5=v)Aaj4vejju#r(En#aAjWQmAH%0kr{$Zf}_F%B0up#aiwgD=CI%4z{(&; zNd3@vft!OTgtv_79c~K=4HWoHRSpGBA15!9JSU~dSo`OiX4TKDf9jU&cGNa8=Nnkv zM%}yW%Q_$HNB2}`jJ3UfTJ?*{-IWJ)gwbpHV?`~o2He=zQr8yYdQHpu&j^o}Kvw5K zL6+Dkzo#0asn!&0*J&l11DXRq-~7m+lE4Q+Z1}e52Qj;2TE+Z|J{?sY9IvU6&LfV} z%{@Vmlg7rzZ8fLLkLbMRhpNo>i?*KbhK$DB&t6qKxwg4MQ+u<0GswjS?H;2zJY;<(@V! z&MkH)+8UemwaseUSLIhkRvxV|S2s6KGyOJyut5_pdMg+`m(JXwr@4pN+$N&BPw~;hh9!^64_5uE?Pcy| z)7j=(Z(1i?6KnyFId;}D%`=%6u?_h~m`?B-tYhIaLUmU)O#P4gih7;TeZREzD(Mil%81HY)H#Vb=i<*KGmWc^PK#+pCLbEf3Vrz%bL{)Y$Wr5v3jPkchE0b zA`-^`!@c!XTB@sqN_yn4FIZZ9ru0YEDDy9;zmsr4mWAW0?Xm5FCy^D67Av;ql~#jej&WH7RS-JmKH)K=o|8 zrt;ui`m%S+`+NR%dxTOEbI)im|RT$E1WDoFB_`qs_Cn_tX&Se z^u7VJf~Q9p)NS5)RMWdnT}|J$Fg4L8ObneO8AA7}p8I|Ao6*nuzdZ2So+GVU&iIH= zEB~nDm4q~%K)8QhpKR?+pK5}uMwUjER2QX`%&6F0lW!U5R?$W5D{eYlM#Z{Cj>GmU zdv9k;PZMSadWS%TjYT~n^C3}~E{GHdNvh=iv`75o!a|}naYYI9>%OhOu|Zg)%*IEW zTy6HgUP45K>Y2B+c*Lj3M+tXsJn(%}`sa*(1~Nl=%(t=sKN^2o5}{#AoiAQ4a+5GmI7L{G zTuF=&-Vvos5LK+dBLuL~n6n9o6TT;YsJB0FO8`T8X*>&4Zo(p{P$kY ztve5gd`K?nZ7USq&GY&NsfRnOj|2;V6ApT2Ps;Pqp^& zjOOPMA*7txf%at9y5~C*>^9pt*Alvj--*isUrZCMAe8t-d?xWi@J{koy%d7F-b6o5 z7*H=bN!y@j!;THhlcdSjjfTZ-4m=?)v(L}J^ycyX%{L$1DSY9ZHCI>3eo-0%;zG^^ z2l)wQV(d7z-1)|8Go=|54EeQFYMxeQR;Vi<>$(^=S*E+&ano>)7((91Kk^IcmF}Xy z_pn<{eP?vYDuN~M5yx>2UJs`*1^GmjuDIhnD|mnS?^sveo%KgISlY06GSR4hqoiir z>)#D`tEZwPt7d;a|7ibB{QBwJ4_}An46@0VMl6%&;2YVQ*BdmaY&}?)+dJp_*17IbUhUDPq zMaz{@eyf7NM@Zt=)C+E4ZD?zJu&FM&rpb*ajs#Q4M#U0u$CBe8(;p}^MqkdjG4I8n ztiv_4xf!bD&{t8Z(WkvR?ReH8qspkaOZ8CKg{mYj-?)kDRhv;B|z=ClEhw{wF`{W9>8f!&2JU{nOxA^3`U$S}baQs>#PDlDf&EZFPEropL|u|1s$z@)h^W)!#IrDxi2{-p$;={Mh2t6`Y}m z;}xYraC{8eTyUN|O;E&9V!vRuV2ogZa1gm0JI^Y--5s%(DaIPZc=HIm!?TXRMc$G| zs;Bsb1Y`$Qg*J`)9yg=jltx+2HnjZIdTz@X&8Iin5`Qo7l(dxDt$UXJ@5i?^;46+11D#Y$CpevX&2n3oA2&>L1@ji-sF+qP^ywZD5p*qB5OOgn$*+xauCN!M z?mBGTST((LdU0aWqoPrz6DsG_bTw|a^t6Y$$9n_WQ~WuyT=Ytsuehk}s_HI}mz*L; zp=nH-=ah4`V~WG$SmkQyy~r@E4;o7@7j>4?nt_20A|mRnZ(waAX!*6Z1&*kj)^uZ& z1ql%$KH9#d%Mn|#@b{e0&0p_*I`C<)7cbv+`ks(;qd2SPkE!%3zszc>#OB)*q_)z_2tP= zn~iFrY`L`A(Iy=l3*yQ{?r4gM0N3cMxV%T1r5|3tw!G@|w$rDX-^XT;D`-?P&CtL~ zxf}481+V27G?)DogS&*h32qxOSbIyM5?w{-&~n#gD`#MI+N#$Tv&*KJekc`|zpIec zj5dkvb39A9*objROa3C;fZNJDk$C*8poes? za+lAcz%Jov?87><>%DGJ*x0Y}=O$^%35mm^wgq;S4yU#n)|UkS>6E$QGx2%Em(0u? zKimF3mh+-eUuv#27}`0*DKdq6aZl-Hd8p!5w+H z1NNVzusy^Pp}!SPQ%D0K?Tb0Sa)}n@or^t z37ub?tIJuJdp~E(AA7bvr#3&oFtmJM?Lyl%?`p(EB9a~QG2jd#m9G`+AnWUtOec|v zZs8p{iI=mxOreIVnvFVTO}E-(wIB4f;h6Ea*=3#Su(`L;fA}N#XF;h*B@L22kY1C{ zk@f-xyaWK$C%;|(%EHH`jjHDx!mY1dp%lZE0S5mTpC}k1 zrX}xWr{yW~Q0adnf3h<=o_j|pQsJITSEB2?BhyA&`&nj~JDZPLj@W#hB+T9W*`JUq zp(c8elLbRXffBt0ku8unQOs4uE5a2vxmE6`xTNT+ZphV$AEbJ z2WskxfL&|{rY;UxC?kIXPDZH$_AM5?0mne^U(8v1w90x$w+c0@fEiL*SZ;Hk;(9Bi+Cv{)ePav;8c=vz$$+L=6Ng= z$7Iqw>7KNeIzf%1l+;V_ChsKg7;h_Ys&|F=j@RWKNL{3=se1HG`aEEd5@rfuEdtHqKXe98@VtffWY1$K;h_gf!4VB?!R8sZw>1iz0>$5`;Ni~`N~QQ%+q@haGj6|ue9YGwtaV4ea# z5=`Ht##8Z>+nehx_By;FRBtLBN~ofn(yQqw^mFo<#CV`^)J^M_@Hl)EU|^10B)F8 zaQ#8xnK{6|WedR7V_*vb`8oky`4;f1Y+#Q8GI*JN1ld|AA!F+#`wHGMk~4AJz~^8_ zmVg^&7+n84IPGp==dc~Xna>8NjusHPd%*Z5gD;^LP_6Hv1yDk|)DUph{DQ2jc<`?b z!A4^}pav{x16H7skT`Y@80rw<@$P_6qAz$0EZj{3}mc*0=@ewNdMZ)?SfLi0+m55FwduO?g5x~7R0@gGD zuGtz8_|}lz77v_l6*wnegO8>bd{VujRM%ne{2I!89{9)6@T5fmKmF$~^9DS2AP^uF z?B-j8f8`3)RROI15U9r-$gKkQ4S5U6O*+H?EcGXFgq(!buengtRJd02|9g2@;J>T+ z_n;Cu2Hff*aA-{eSIG+SHqd0K1And#(f>KpB(^vWd_TG!EFr zHjr`E9o$*)WydciEg0Wym= zL95J%ajYlwMj&v=ZWzJ7!*xDD-HSlckPF|1(Beh#DORYd_y5eg3VQJG`IUc9-;+YR zA5c+nmsUecUp|!bDfGr!_}a|R0hPlzV9;9tI@}Mw216@v<&OfV`~^PW%?BVd_>69# zV;BI+g1Ml?SODeuTkoaNixc7BbHIt!AHIjc&jIk&8x#*6KxNV5|0nGJJwf;H$&!E1 z1#SgxH3ZP)w!rTP!--*){5{~?mx9W`k1vD7!3=H{mkLjgAE0PvwT}^j&9cNF8pVC*Wo0?Gyb4)Z-t`P1VWFzh6 z77NSps7>`RhDKVf&GA7Ld&3r7&XL|s8N-jAcXCERDq#jNK8!28w| z%>qWa7o_{$1U}3U7=|0{OIT$hfFI9>{O{qw#D}5J5i>i5yNS*LwSOlh3e&*deHL4V zbwY5gjJSxpA@K#CV!jtL6}<&xi4b2%bOcZ2X2B|=46iG22lvJCk? z86{QAf62Z|mw`U2NZM0!Nt`NFk&`e763gR^lX^?#dak=}J1;x#*$kFHmKNZAjkX@K z&a-Z@72BWNJ2_@KpSiBN!@Z}dj*Jf^4IYMs!z(aCw&a3=#X84>vk`c;!?+$V!cX8d zagBT+Xdxaa8>2j=iqr1&>FPVoZ?XS{fIC6nU}fl>Fe1Dl>_*t!AV%9$d0iBbdcBqQ zYvwZjCEdl!o#ocj#FFHq9|cbfP8J<0{aMko=9fw9Sna+{ePmfk)Otr~1+k(J;&zgs zqS=B(q7<3WM0@r-q_&=x(WX%2JVP_Xd%dN$nf|UJ(VT8u;Oa=nA{~gs!aT8Fx?NGJ z(rBOhx&l1GM?%Mi^$mB1bqhNiY6`K1SVAkp{tJ(dXd9u9d>ktG9jF*74(APy#}tGbBjt#yyeR(XVtW_nw-U+bmkTJfKNq>z$rPMcq|w#JSs>e zO;`c{n<{eHtY*_q{rlR%`ce8ZhAV(GcQlSPbukMpR_h*T5`}X)s7N3X*OBB%Vx%u5 ziPAjjBbiL0Q1#F#v>DoTp9-JlK5KnW`t=Iz8Qd$ZU6d!r5jU$&-S}0Jb%X9`^rE`l zA!n?mvA$k)exwSTY8(4U!AS7al2&shClFz}n00%QOZy>NxpGU=%hHv7)o$ zE8@!{nQ#;VN*g-H)!F*U@C%YX11{;9Fm#u<(n5py@oL+dWbW%nYwf?rA86xB%e z^3{rl3bkA>4V8A4T$cFDQsi3{B2`PZOtU~UUgOdP`5y6)4@wD3i5d%M#C%SWC!CKt z8T!O0K(-R??@BX&udS(!ET2%`smxY7zjR>n?!qaB1UT}e%c<(l=Hspa<`jBII7Z@- zJe5wBrb^V}qe6~cMNGiP@CWI-?kwA7)AZW->Nk})D!W&?su$E=Fiy05wGD7SaeKX& zn30gyl|eobb&#HuU6AjVua|w61c^Tj>k9J(kAxX4FA-MYA)+q)wpUm8<$%LySh>i)`IRK^yEE(NZ3$VC>SrOFBmQ0$ctn{ zvL7)NKMR^gCpr;}1)XP{C{X%Uq1QzFr3S4F9T(9&+9xh6es-OY3B`%y5+}wbM(z!q zrd}z~dq0{ptBQ*T=040GkX@cLH(y*-x3o>gx~kghlQq-zF=mhLt?L2P7M~>|R!IX1L}vwM)*Y+ z#wg+s*6C7*tV6|z$IXfQ88Y3ESGMkg zzB3ot9FF$xEA((Akw_Iymt`sx%9V;(S+?*Kc9A{jiE^y8Trn}mv&K25WQ*83!dl-Z zus^d+unn<$ASb!n(+d1wCov(}L1+;U6|NU-BtD`xo@W~{o$20mLne$(;rf84Y&+hW zTrcb)CZyZtvsF#CH~j*GsF2L?t5G{+OtJIhQsVxN4UR#hj)b)eY^FUT1APLmvPT*= zRyHWUT_7yT&;MB1sq|Y#CES_&%>8XnyWDltUEz5`1+mBYcjyd4Ba9FY6y?KH*bDE- zucfcKKiYZAGV?IgZc~;y&01~S#ah*b9yG6)>4POYrUhXWG0hKMTNv2VVLy1yoHL^I3TP2ivR9FYfwpq z+Bw=KbANF+fPBGZRtJuxd^l6Elklyegcu2#nn|?F_1$i1;jl(64|U;C#?|_`w>@0AHJs_Ph(u*4s|6rDW7A>NP!?1!W*sLe>@U zmK|3rHEnzxzB<1G|9t_bfChn^13iJegQf&u3Jwj~5wbRWPELW`i?6lMAzU+yj42LC^+cRTEF zdT>j*W{}DU$`8nfPGhbxi`g))Kb&H@65mKhi|mrC@-IqXO@z-D-wA&G{oVdS0V@K& z1yl!I4O|jr3ECCBJ>+@FqL5p`YXdWUJE;q$*+ddI+?{Qis+Ux+s>m+SFMm{dTsKvp zW;$x6?30}rT(NGW%jpPN!w zymhD-R65<59mM}aM-Z4WRFWg>r`)H0rR9B8elEX}{vG{i`m6l)escdee&POW{D=8p z^sn{rO&2OvUXur3<(|j93BFzHdKfZPScKP-8Uj*s(O?+mk z7t7a(p5aG7?bqLHR;v))jMmp>X#c+ESG>M4RBSvqTE{dc-Lj8*qP(NoO7IN zS3mb{&n@p0>K-j*-owt_m&)-hb7QVtM=J*oIpzs)hSGV+tLev@_yyR%#2~?S;ZD&P zQJUzH@T#COIR@X07V{0b*UTCEGu4tR_jw-ikZr zZQ~@ZGmTC4>e{|FJ8Q&xyWxeY#1dxDa~yKYT$5c=SD-V|vDxmlO|gx%*=;AlS2@Y~ z8pf(So-y9%-W+d+cd$3mTj9Cmx$bG<^@U9Ic}yM9R6-gxK9lso;l>w4WukAQFcBj- zLv|(hVn2}H;Ig+fKFm$}G+j$?V@9y+xc&TiWGs3Nn~i($E5t6crJzJ06s3r#OKwUV z$nPi$0ili75ZcAs3T<7V-aZEHKiV!@yJmzYO!HOU8P3?8qH-wi$T~{e3WM-m?gMqo zHOzL-lw`PCE3Y}I+go$I_LhE}v8!2cF<1}S>e}bq1MQD&>un=!3Y)}s+&0zju|IV% z&PaEj`?ROOx73?V^`cf$pQsS}Upg8xKn!dGKM%QqvRD_Q57|u+E!-zOARHz%2?PQY z0ogDZik{`?aC0F4vWPxJpQIntBxIkgW!rNJd~=v98)2>SRN@?231^ojicd&>O3P)u zT%r7j)CS?LLbd z;u6|Mn%w&8nwsiO)qQlVj;t-yJB^Rc4vX2EX&Ywux8Jgzur0HFvYxc2*s5$}?cE%& zoK4(aJfpmes9y9YXn!5e(P!Z_fdg~}JqR*dXtp!xoAc0C_#2{}TrV&PnhW0xj3i02 z_%Un%+7xNS&*iGXKd~3Eoc549aS?RdQK%Iy#|rVwL_5+$UJ>*XRtk@a=7_sUFzE;B zLs&-+P&883Ree*jst)Sc>TZzBHBmEDGYHbTQq}S5N2+q=Jf%f3UapdU6x9)|#nQQ0 zdaHYk{kOTw*wV1NR$6PWP1E-`)Eb|fHP#&KK-)uGwr#P^Y5fc4Q)>7*ZTd19I z)ORXeA6m3&14LCT{eL0 zIeQ;x*?h_ zo*;>qK9Kg3Wy>bWHHtNgQbkwgNo9?4km`);zA6=bc=c2@%4tfcV!T44*eO3EtB|x6 z&k)`qZbPO*CcVQm!}-bf&0;cjHa<06F&s10F}5((F%y;=O9u4ZX4?!~A6u9$%evXR z)OykS-YT-~f&LA0kB2bBZ9HXrvV z(ufy;sBZcnRbK%g#nrt%x}Iz{n~f_3f`$ZlEfh*|D23uuD23uK#Y!nwpp+uT-5m~3B=u9*GInR?v}UzZ|`q>cIMuDuADjY9IgW}KgY5)usDo`ob3^Oysy&PbW3I{ zQwcPHWVSW8oAcv0@p*hN#VtjUa=J1@IY1Ss>aRYerr;m+USrVq)9%(*X?yB+>a4nc zz;^8EdDJr#kvRPH#VGw_&#s>1JkIOB*OhB~Xr`!|DQEL@nS1h0@uH)H)yI6i=0=rA zy538dcw~img&qB~-4hY>cnzvz5VB!>TxVY{@knYv-94 zStQFCYoT?OEz?%le#^eoG0ABXM4=9B&FjDxJp^*hHHfM(fcu3z$n8N{M{oh067ts) z_6B>By#_nGw=Ck}vAft!>{g`h>^__efSmLeSD)X?zvX=u8x?hwCzXM!#j3Ze)`*4L zTXRU$Mf*rws~xFRdVKG3&?DW$=$Ym5z~h2P6OSKt$y!mP)XY+w)IC(`im7} zrp9)056}Q=tVb-4+6^^7A-a-B)n!e{NPnoBheYhfB|zG9hb{meGj-rQk9#E){}fw)PU2y4;D)KYjnY+--_!meafAakC` z?Er04xg72lEa@h5^|?fpa4g%Ajbewgdl7A-DYu?0<>v7ve3YV#Vh(K0PGWhhP%6We z9hIk)tyQyC>r{7Cyt<`&mimDDp8CG}y1E9jyuQ~=(TqlFsrjJ3tX`uoR|To|D<>)Q z6!jGwfq)gq&H-9Nu?#zTp`l~8t=cln+^TkIO*(k-$%tTi4rA;2>Z0nPn)2$S)eEZY zR=X8Zfe%6e z6;CaPpVb6dfrqi9fTuJHh)So~Cu|{GjXIddo#(7vL*9>X!=K`7c{7mB!WDjsw$K`+ zC_I$ym9v!hlv&C`rKifIDo{RBK2RQ4ZcuJho>!)zCy!A5sJe&pcT)F7JlYcM_fu_B z1}gth6!Bg7I=lslWH;Cgz}U`YieV=@n0hF65kD6?I?vlD+n!kaTGv@>&86lN^LFz@ z^8u7-tU15-Z0)kz@|wvt<7#GN`Ju+MHokU<`K5U)dhI@|-uBSe$Q}!AgpXsrqr$Pl z*-}Uneij$PgQY^AP3eHnq+r6}TegpR&RCcrwk=A%i+#k#vt_J5*NI!lrE?lSiXYGK z*FF?yVAYB%h3qzda9dqnI z+w!dwtgQ8o<*?-k%NolFi^-B{-fNy|o@(xE?qD8bo@YL6PBHt#KX8F1!Sbo~wAE-^ zY5RbY__{sJ@iWTX)p^d@2H0AgVcUFK>IpggOxVxY2a?lEI-HpgPrr_^&D5by>-kCi zQ$8FBYNJrP(?FldRhS{O>!|!mc~$uyR@`2yXjKE1pnR%auMAe6SBzAc6uEpl+JV3) z^0)Yl{6>B>KbQ~Wk8?e_5H6qH#(u%}VCz8VaTjP@i{O>Fhi*lmfxe@+d!xm@VVg1rN-n!1Z!Ftg8*!s}A*E-!AV=c6tvV3ouVi|=r*YeoX z7uPprK7Jyf#fWo81T3FZ3h1X0bwHO+k-Aq2?i~f2MC~bkz zCe7h4aD`lJ{#U++ABLXFfqEO2yOg!crm7Dp->=He$_V9C#Z_1=L@I2&hXOGTG4l>m z%vbbOL@QzxaeNFya6Cde2cVqyoOR%x_)=&p-Vyu4pKg=f4yagdA$JXghUY$`Vf&%>i`YTX zk2ORoRgi^TR7i>dv`#2^fLSdnoH%N#Y^UsxcDqY?TKQNRue_sNrTh#d)(6D|MJ7Lw z_u?;Mw2S24vr}L}odvy?me~evO)9=M8$&laLpC9v#sWyK|Ayabrf@>&BqTTwImbEG z&iAlfUg?N-#M#$?x;EQ(+d|t^TL)W|Z3IgByX~Z{z!qR{f@`PkX1m%E>iE|2mm}37 zIlgfwI0J>UK9o(PL+Qo1Q>{@m_ zyeT*~4&JXbnbz?3`GkIq@1FbcYK;eepa~Z6_aRx{Bd!p?fOoA%d@gJehQK3ew{xJ= z-Dyoa8(K9*`GW0bl1&Ay?2rx3@|> z39r{!#06Rh9aSuJ6$V)RXHz|4GnPR&VJ0&_fSPJH20iI4E3=I-iI+2(9LHX44((TMZ}g(rKR>Bo35f6)Wzd}x&>LHqImy1;qxtPrIl z=`k>@zDJ84BlVU#qO9Gd4$xhOODZW55{Z@KSh2U*4is(-JisqNp$=lSXaHJarhuMT_1HQHUslR~Luc1AVJBg~qsG9?RUJbo*UwQ?77PCzj zEDr*ix=aJ6Ez=4!fsIZ=?3@Yk#twxaNDlO(*@%H8P$JgZuzh$8E$ff4J!l0C!wPsQ zAA{C%75s_6flb3uAQlcqq?)0KP|yS;kOS@N18gH6gAxxh8m0jkPljcLKO%Su*sH~v zS4hurPnBeZUvDfl!y}*r>nWc-11`ZK2QX4d3J;7|U8h zD>)3_A?~_Gg#Ic_QjJ3cjJW$aMzFQH7Ej;a}bW z`e6^0I2XQnNhq}v=LSGKdI+{G53yW@@AzI&dp6P{S6})E+TMD2?`mkyuRvRT8h*kv z@cw@Aoryt?hhiMtiWxAADo3O!3sr>i#Z{?nDtp#*E-Wj`HlY#<_LeFM$*3?$+m-UF?r6MA`bXt}$9j~NKd zjY+_LTnY{QMqohxfR;1`XT~A&)tB%apO3lgv`c@V2Jgaqc*}BVqNhMpz7T!t4Cs}P zvdOSR&_d@O0lR}{ko`9X1?r%_i5Gkq=#oc63%wR)-ik8K1ieN;me&PZ@&@>i-@l6w zXr!go(3^{LE&68xwB-*Fo$OcG3amozRwHlgQL@9x&nb+E2hnooz^{F{+(+&VKle`9 z4nnUOhuPpOl&Uw{WkaM$xjw8l2B9o7@sv%V@IKfN96;S2MXx-IulK9+O|-pB*gFS{ zfMY1tIlSS7>pf>ttM}!9kQXz2=fj~XZwIaTXXpttpjTgmNI*ZsvSK-q87HG(jD}6b zOti*jDCY+1CtP2MelrU9cS2pLfDVucjM1xj+ZC*@U_>JO=kcZksQq~;4e8b0T=Z!P z`t(IPMx&QZ21UL?83v$?J+US#Ycwan_ za;szkxDVc_>$;#!0NN4p@XrPH64CzSQQHF0T0PKb{9%V+bm2eH6xdPFmIYn(=#7z} zZWJim95il<(IpD>4h8)TxK87F1ebsU^(^3Ya`5(l&>J2hkx};*jvnLqp8N-T8^M#< z3!GBY+je2Q=U-|Z$4GD(N56o!8)2F811P@&#i2@2in`ae<>z|Dh|{q zNwp}6-9-%!wmnLeLW8yLUz$dt&qcY$dtc;74}U^$&@l*SA|S77h>|n`)nc%2fa6HC z#=5R+^>Ew>88vQ3uP#L0q`@jG5s7TmFp_1$9>xx8DDYnmo+F{v zIZ$#L7Hhu9YZHw9ZIP$;$QfySEkKPnIMdOUFG9UR=y?+`qEE-XFcEXq2#ly-U}hMF zG!pZ|K+JwULDkME13@n7=1N`hL^4~Dl1IDhF9I|rqmTwU(SoW*w5AZ$Qyo{^Cp8$0 zr3vmOt-lc#vTlNZ$KVQiPE*%C&0X~zfq(m=h4`Y4n6M25Jp%9s(n=#x|MihbTM9+r zB5f%c=iMm)G&F*OMx1xQKMeo!!x=II=<&o*ytx_XulA^ej;M{6czbi?q8ai+dS_$g zs}XWZa!2S+Y^s{#2wnzwcNpFkh-bU=LQ2;FSDU+NPwJMW)<~po$kGB&h;i+c*75Or zE1YZUdTK+wFWOZDgi>vBM?2&w7VnG1dr1HAL`(HV&PfmSbhQ(*XKF$0r`cR+weEs`9Q9zbYGsM!ih<-{&e%95?Nzeay2kHOrd&$^H?jZCf&mpvCafbACJH|FL zMpys4m~mutCGvbb76;ZgShzt{f_(?}CA?9@LVjfQAx|a?hv$+6wG!53ge3J(S{Xek5l$lUSiD!|gk!QK{OrAz^V#D%r?cO8#F}re3>X+0y$s;*K>RE8@6MC5C8kCI8 zKyE6K+>sg7T^D5Q&Mm1E_s>li+BE}^GvrwW@4d#g)PUMm*suCGRpYn}ktQo4)hxlb z!nKgA)wrL$nOIAbQjpd_YSdj0a!lSy-cFMHj*t89`XlR)`IPWqcP+S|M9M%~FR5eq z|4A<0t?%ReNLk(GBK7ZX(d0iLOHZCn+M~O~AKSkBsqVG=e`McXA8vZO|M!1$OwPb) z$yI^mKjh~+aOLp7C%UQs@w)rHAMYghlPjcGxZ8mHKJx63&vIXPpC>sYxhE~f{pSBD zNS^fnw>|O%@+9}Y?mhR~-69BW9RH(&n^xpl1ijpCgp}|9KGU6Bk{5UG{;O4T7kRe3 z_DQbX?aWPm_o(3RRisb3Td5g)ZceGz)nYAJlSJAPNoFkMh+HNAaF06VEIIS>KKI?E zjgnScjaKPynPgjmROU+MIC3A8bMEu*Gv&BmisZiUzjX;Lu}hGOT#4+FGbDXHR|x*7 z1WO?-hx5Uc7r3^CxZiz5&XB9*dYT?M^cXKZR9LD?|zs2?YYQVF76=tA@`Ag zxYxvjo-AaY?Yc^?xbsckK=Sw;e+b964};srMfsr_M)&f0B`6{ja~dKSvPU+b$c`Z3|m+*^`kl6NwTxOth6{Dk|Qd+jc(n}2Y)`a9|S|ILvf=gyCFue<+~ zZ(x#0of96H)HmVB2tC|fuM&H1zLI>|xW9V{-|7B3Am0X_pe*6!30F_P6UeyWrn~!# zfP5#AHsSuJBu5|R5FfdGBJmA$eczEWgK+$$osmRF4EG2^+Fl4+AQ?T}S4n$xx6E*i zD&elNB+Ru(_QU_zdfnqngsWZG#hN7Y{Yct5xy#+&$rblEGdXtm2Qu!EzER(G?3O~1 zFW^WlQLe>(pS#zP|C3(hegnCSj9z3-&brT&E$ljQ#y#G-b53#{frXTZ^fOXIQdY7T z^lv?oS|Gj6-S5agsV7o%q~Cq)eeNw8gWZYLIr)Mh3+a*Wk=oluBlj1Eo09G?F+x-F z?eX6?;Ky%@k8Oc`qmcGNW(d+&NV{=w$(q69{wnx5yO35#_Q{%XON2Z7$ho@tSJH0X z-&CZJI?%#N%XcStA0T~|^eMuLlV0ZTJ7i1x80m3jZv2=C??Sj4GN%^1I2tm)x@Xu@ z*KF&aeaYNgV}@8S^%U*YB% z+?K1= z8;2wJI?g4ted{`U3khHx?s*H@>?@>qu4A(I8s22DAys^VXL!Jf|U2MOOE)$ zGustD6c{OeGD?# zU9R;3c{ilx`yrj)4$1iMu5=92+20|Z-H3BDAe&tU$vV+0G^El~p&j_%C9hr& zdG>hhkA(bswEQV_5AC3>Y6T5MIHdBPh^1A7cy2byB4s0zmk3=-fs_tB;8)P!{SAFl zB6Nc3@HKk{bmI%sacBm=kTxT(S~uxeX{F3aErn&yC&D8{l6xi86FwJSi-V*erS8%U zv98n!`huf)Yi~%*BM{T+Hga-6T!XUQz<)EuFQviIIY!BYq=`U_yf3ejVqgg{8~1sj zSHA|(e33T z32^uHSn2>|`GwR=DN_E6Swi=M4b)KSHl^k#vQOwfREGQ|Jq?I%h)zazmzuKcxJ)`j z?jmG~JutG2pr(k&g~RecR2pTVOXd2^EBIgv%z0iw%*hw5H@}h(VjBTRTFZvBb|#lv zE(OuP^drbS*Ft}=2YQXqfhT)MUI_j4BBm>FH=7{l&Oxdl(~H|JZ>1)~7Ih<22&w2& zSPEREyE8+WRGOwv0V{Mmps2Bf) zf5dg*I!dBZJ^>$L;&D1eUM?+z9Dg1=kFIt$lYeLWb7ScYalP~hN}tUfl>3NZ%B6HT z?L~ED_S2Jqp3sY~WxtUx3I>Un_A?KqNa+#YcmOzipHuVb8LR`6@wL=>lqg#Amg0e1 z+!@Tt-(qi|Iu{|5eHCIvNx%}UBTb}%{RbPNzVckCPXC|}0l&BxbxORBzH*ESXQRY# z#rdp;AsVqZ)OF^DI8T~Q&8O$U{dKo6nqJJTlA{sdh^3k`zsjSj1wi5(2@J(auuIMX zZtOSIIr<560{ZfwsqwT;qUgVvB&v&aO9BT2AJl`QpX?BqNp+=m)HLS4R8K5)4hOq+ z3mW=BDTO*tD`mTMUwlg6MBKPj^nCE5iNKE>M&D!F0r57PKIa@Ozh@%h-@FdxilnZH zO6~;zv$K)?7pk0I%WkA9Y$-w{cMT|lbrJe_gw%)bDea(U%ke}XN@q}J`mT6SPM226 zF^mt@#c7vM@bQ%7>?Fj}7WkP*I!(?!a&KlcHBJ1<(OljFZ^vBux-g3BMwdw;)Tfd^ zvz7VeA_|^O>LFMQsf5k6hv&55*{q%C~HoU*PGjVJKM8gYU z>QRr_htfCBn^ITaM9+7O5K5R|xpwq-qSNVQE0}HYpzRC2!X41ZpSnyvm%6hhz(^fP z9f1Xaw{%Q=gI?TD2zF%3VajgQQDM2%liLEx@)cNNr?bQP-qLr151YY2Cn-9_N^T@` z(UC94a;=!z4y{zCp%|;o^e|v_bKFh(unemkrZtx%?REM|m$)iQ z8kz?l>_%pY_!zNDPf^|uom9*8M`<=XHjBS=huD5%pxBQ-&HYJtqlU;L(~`%GBc5YT zY!C5@FoWsME*Hkzx*;{IW@o}4=mA1nAZvo<#L&s7!!`tjl~bJYrEt88ff4n;O`(HR_I!0 zx71ni=UT7Zp4h_{A5=ARZQRp(ce3~h1c9;elKivX3(A43)E2OTsaIeT_?#$ zq;Oe+1zU-@l^Ot4>Oa%2-43W1;k$n_>s) zQ&>IS5}v~oI!M|>?G+LPyD(i&1Ma@rc@>cXM*#1N#Xff46J`RV^cSk0lm?rv8tOAxSNth|CTgf~lr{cXTYuv5g)< zb)W~)vD9tpj69UfXK3I|jHLr%`_h*U2Y%@{h`1Zb&O^MuNO=*g0w00Pent!MF#Acm zC7)&fpe_g}QOkWWTC?z&H_4+M!=2+{U9i*n$o>fE#re)4;9%{vKeKlco#Jyxnxmg1 z8g@CogfE2Uq6$$6>H;;k13ej-2PMF9b~4}do0wsUMdGix#-CE;!LquY@|KcOuS1;N zLbXA&Q#B1pF!_pCh>`wW(HbaBH`sl0Jll`!PMwxgq;e+@o6%`D!Th0mNA=R`iB;a^ zx5~PfXO@+fohuQGe=U1jxu*PV`Gl&%norFW%$)rfAwz5;m(v+sTlHgAH&uxCwbue~ z*{jHFxp!An7r*DeOMDNQI{4oRoacAUe^($A_}+BOsPVmP?C<%D?yY9NlHYBALZBOFQiDemq**i17N*|ZqzR+2+xh$x%bM15+ zC3K~>aD9|R)NQn-P+Z^j{mJyBx6xz^JQO@OV2$q*|5?FHLJET>2W$_#7yKdkN^ok> z6Vok2sqY8>IM1fa$*SAxHvBZXm++ZwcXik5)T+OVq}<$`-dV>po~0!uQHX!uJMlwO z>y(8l$I`w`f0@G~_Vb*Qwl#m+FA80u`aYuqN}@+y{R;1KrXT#AzTN%a`x^pf|0w@u z0i%On2FCeM3iu-UMabchs=&X4e+%j4f7{s4|Bc@c{a{UNU4dp3S0eu`ZnY1y+^hYi z{6=B3LVZEotYN8PsTnDeNuPX}lUP5gGVyV8WU4OxT+S~A&5NFuR#%R&UJ!nktEubU z584R*T;TBNedhUIGkKXV`1bNk^&8>)gXtd7gzor{^PA(}GpKt=X~_DJyP+?GSNe_j zdl?iJa8W--`@8m))>FBbzTsF0%i;mG0i`GNR^)BY;WLIO&rG_O@cezR53z}VeCPrM zpo=Nfa(oK1vnz87DsMQmoJp3KPKWYSk5@X2_L65;?|Z%u(_x>BK39FyO~XtpO+9?) znueMjes2Q&0s;bqgMSIJg)WWw5KJ2v`JD}48swqdu9@o5-NQ#YksfQmZT`(tUh}B< za9&tmb>@YX!^wu^Iv+;IwSC_sA@swxgxcgrslFMX=A{?REb*&)XMSz}NqW!pR|Khd zd2I9QVwmRbYr1X<^^Nh3^SOga?>Bw!dB5@D{Z9Ly_0{E) zBO_uW^7S*6Nt!tQaBX+yxwW{q)Ea8Bl|<)$nj>c2NDWBllUKf9_ik|fnuOsAD-)V0 z{*}@!t5?C00=B4sRX>~ESt-RM!epqn6%YhocvTxHQ=aJ?Q>M>DBkldx*xJWxXyLWf zn=&=+=j{t1SQ6e|MBg7n!eBdp%$O9_Zh$U9qLo;9p=LruNnUG{?R){U*+}8JHZ(3bJn-e?_$8tU`1$3cu>SL(>KPQ z5j7DiZ-w>~eYrke_nqRX7-a41SZ$NaQt~?#nDQ!9+9y3pd6xM5ySZ^;?@QlbO6-?B zI#Ei!lOIQ$;=ZXT}G;~N(+F9>jg5vL;(d}_QWgsLL18cQ^v>slFxdURCvlA2hR_5%Cm zs`mwh^4sT@rq4^sN@<<&cU=9rC7{B@M8Bkfq+6-o^Q;BM1-WJO%$*S<>=XKDZiniC zuFCVO{;=V#af7kQyT!~(@_u>Z zfTWNFF1db=Ptm4=OC{5*C)ocMvJo5iiE@Xohkn1;SO5S-BVM4*_^YXp@tA(2exV`F z%b>6JZ0TE@w_mNlD$58unrD+ez=vynmUnGwJ+?EeV~n_T|sZGZu$bg_`TxYos97 z!q->7(5};;^L}bvZs=v`V;bn2>^)px>N(LX(GaU&@6p=xpkbiTYU2++DJH+54?*uj zn}ziDo$hlZcud#{(_zmTj}rYc&wiRzYO3>$lX2{-8Cy2FczW)Z%$4aSX_<*5-s|Jy z;*AL*Nt+X1zyBoVdCtK+pMsMm2P&VNlbmm-G!ePvS9gog1k?_Yl~q%cXH6FyC;%x(z;f^Mb9D|(sJ zo$tW6KHz$*V|B-XUHye&tJfv?dYg?3?{I@fpW(I5aN6rD{nz>$gP*ZJJXp1+?Y_(W zYXe>ee&I9DFxONaFwC^mW3XnI_KI$drU&OOwsLwq4p>)J|5(1D=uYmL>}}amnT=A@ z6Q3olPFj?DKCMg2o>V@oHt*}AgHRGBRoAyI7qexF>8cnEpV>m)MR=^$)sNL@>l;F} zH^B3vM}%JORp43T!C`Eu?_FuI8K!!V@_AvJ?|a6#z_3*RgMszk={;Q+rCzCNtUavu z;vPvu#4W;g``@)b)fdXI7l#%G7Sze(b1r5UrO(V5m^~vWGJAdY-Tbb_(WPA~CR8Vw zGi@WCI}v~K3Kz(qQ*2l5fhj_XCPo{en~x}5bF~+>3SFwUk#@QEh_+IDTPtff>NX-$ z0C_Ht{*qN*7+cWX}923oq?H1^q!Qs-!4ys!~bES!ilv4HAB z{{TDp`s`Z9&RmCGejdA-iw3?~0$0Qx;TQ8?!dGYme2WGtJHp$hm+GCeq3W>esj8kT zQrS^4N%5m%3H;yIz|y@fbDs90ugPW7Xz8V>6b}i*omNLMkj>88+t}aRzOjwAb+*-k zw?!9Q1KR`ZAJ#p#PWDK92m2`d1N#iebmwsRkqm%U`xbFHzP=-1omomvLPX(Q!~jTO zzvGnfnz#(Fo+tcD#R0_;EK8AtX^JI^?-Wk{1V5Yq6rNye{#STB9%2WRc&nAbBjh%-l5jr@PT#BHq>s*k7-K1jR%>b6Em+!Q0lrCSL;1l|%G`-0`xsO8Ocy$mj5C zzJT=>_#3Q*#r{`PBjj%fP{Me~c3J>|YAh%<0kZjQw93zb5I7$?#pkg7otN0ug~$aADtuyfuFd8G|h0d^wwHN40exjX3SLnTu2 zKnJ)5l)6w*WfCkV-^w=H1bu=hXn%#;BL~u9pxq4lDC{*SLk@8Y@!7}V>}qNx(CJ=F zh#OCtp?%njCz)tpe7i;lUK9d?nSVYh3;rqahPr zfE+vrBGv;Sbsa(8Z^Gg~fVv!ylBtVpdCixI)PQq(~>cU$SKfq)CmaGDL`cMZbXrWt`MZ@Z~xne>8mOffmTb zOF=+ROl5Zp@2RECFho|j$Pqxa_=g(9)R!+X_tArvv18=(>>B!z^ni($zu|bqX+i8t z>KgwKJzf;0Ra76Y4lTiB=OhrtXUXAAwxTQlnaES8 zPoHD!Gow*66X1RH9rXvho_PoV{Ug*@%oD{isZ!p^sHj&=FS-xCjp`$fVEy?Rp-3_) zp2-(j74=XYtym=Qf`3pg6~(uZ=TjE$OL?}kGxNFBL{Whje+&`XKBwQx-gGzB5n(qZ zAj9ZVz7tSR9@%TYGzw}*%5 zU16{KJLOC|-aJaYB&*?#w2f-XEv#)JMbjTtN11oE4Qwx^E$ZLppK81j!{jPEKs+N1 zk?(N^{)n`kS}Mfzy~PkjKx`||v&BGTsOP%Kx9y8<#Y_=@9=?FRZ4#FRsp@pGqtw@4 zU!F_XGKEgjc7tAqGR$(EvkxFG#5&tQL2-gTU}eyMt`XyjNS zRM_V$+4 z6MDGhOZ_0G3*DJHh`1#=s)g3fpNJ0BNlbFymBumaoK|NreT!=2m@fXte8w&sVDCAKET{SHn(;zgM>l$l(nRmK71Hm;-H7q^*1n9MO67tQ3Bqf{EXxyZ z^0(4`CX%gn{3=hTds9m2zuHKpKsV~iBrs;-f$$@=K|iqz94+J)yiMvMmP^Cf({i9V zl0Gf>XD!aHi0!FTH07^4--r(w4cA4mJGZl?^c+cHZ$*EmTq{mA`^jN^SBy$}=R4so z*G)D{TZD1^RqDBz>O9F#VoMR{hIf9_%;TP{(JET<|@J z#cBBDbr6>WV=TtmR_-SsXAV)5oYUm3T!gd$-gpWsm8p=v5xOC+>U3s;RV%lEkLhaX zY+)YaIdx+ZTU0nEz5;S=XCNSX(WjhxcrY#l_tt{mCpV(%AlBPXQ2`CnDb~(LQ&Z(U z&Vy-Bw+E*)T2Vm7OFR2Q-$le0<)(jFrVY;##DEakv)Nuk}2k3E@h|* zjw85U!4#2+p+?B6i*ou1cRXc4@0qOO2zv6q(dYQ6VMq zdE6Fpp=@X7Q@z=`+}i@|?+X72`@rkn6&J`S9Yq2I&)Rf>al8;Lj+yotdsE3r%(V8gx1lA-k~=`# zu^v9Y!I(XLsoU&5=)4ZGyAUfdfbF5Us;mdyil1^V&??9Bd)fMYCq9;Gt}M65;Z!SAiLwgCB#;BW12Tjh+i545(h40ouU zjcbc)o7y)xGHeOv_qG*cUm?xD(eb4`hkXW(_ZW6Bp8*u-G5kZtRK;|zmDZ%*&(Bua zRFe9hs)LGF*HxA%@-+@sE)W%pm{r^>&33*4-GSY~{Y~GePBHI5H5D{wQ>8-39s7K9 zsWsC+4Sa{PreDo+Yp^-6c67}bHNV&FM=Yw|wHs;|T3%W2+j==dY~haWB8^{T*^4!E zw-ibI9mKxcpo-9L)nsZvc+At)@ff3j>rti8*LBie)_3%r>G6ejg)UxuQ$1Is*6dK$ zC}n;a%#-}MFlx7RzgSn8V>6joK=oc(@o7au#l`AHRqB!#g_ULPE7z6A7yDPNEbCtp zSruM$zWVdphQOKr)9EScz~52qF}^v_1A;XxVa(XtqnGDq-Biz=hEjbK{Y$SlhFY&m z!zjZI!}p#S^q%-CPSv;ZxUAivd!c=-ELGL;8yShd2-MiS;&+xGtGCov*DkF5q{O>4 zw)9xhu{?9$!-9i(&YTVT)`I&5zZDpY5=!4!?ydZ#>ZmyuwZH?{EQ|h<`(FJ3W;I`F z+j-p8N8>wO^a|IPdA%_{Fn()LcozX5X|s2UPpsh^!$9LPuO6NTZx(J}vw>3DS+kr= zX4cS?M769G&X}hHha|h)uk=Mp^P+dT_M8E^b#sccPG(kS1!UWEs&dowpA}6iJz0LQ z>O1p4whG5!se&28594R4_G=e=Mgy0rrD3eMhw-6LiqF?R$Be!{^-T4Ay-f{$SkrS; zC*NOuzBL~7&h+l!U7>%cYoS@HZK6qp=JgRZOe%1cnNQWMuKu$;tZ00pwdiT?i}cd; z-dPi}_NR|ZElInXwJv*dj&HsdnuCTF>e>=(7e}gdo_vfeR9#U$QoYl41YXiK!&dL_ zjH7*=KI435nJC|7kRP4)>*=@FZ%)9Tp!{)wVLYkc_r5if(u9Icg>iYax<+uZD4XnQhus;>eiITnb&iQaz_?SDE_V@qt;^U z>I{-nnB$6#>WA9J9-*Gc^`+jMj2FFG<4R*U9}^^X$;OL5-F+7OJTfiv|HVJquQqUA zaAW^m-(7*r0=k+UhO>s*UirE~ihV52?sWFB+^X$YIlr_+VP5w4nXy?%QuYXU&PrqO4IQeOrRnDRlfFX#yS|^HgYh3js(!dv zM{kqimFIoW4_?Q;BfJB=&l-pLj}A}<(uiH}^xqQvU071!G5=`4C5EH=J$i!*C=>Eq z+XVB{%8HWm0)5Wrw9u5ji4jTPyzlpJV%)dy*CgIZ4o`BVj?TMY7++FZb=z{#VUxe% zyQ^!o@gDslADn0$Z}jwTVi5I>pv$P^abNdD(_h_C6Rq3kQSNEfzxN6?jS2WJG&k&0 zaF>7?VKMdZhuH%H{r4EH-g^u&$}@D9_{Kb@dTXh(V1L%WlyeCk;mqDV&i~Dl*N@*^ ziu)w#m*kVlTeHR$=a;Rh-eherwr9Jke00C-gS@vG+XJ~)_G#wx6w;|Y;14fVYn2VT zMeKTZG&fYCSLLY=YHj)yqavVtm}lMj5uTyeaHe5#)UvRg0Fz%!({W=TjfQUJY-y&; z5%C~*WqP0Y(%ZLhLf$64$$c^B`GPm*_+!b%Y5Ox4<<%{lU$e}4k)=8Cx}KhcyPpZYn-gdwO;DI}!3vow1Fx8V{(y zAgW7DN^D5fUm;$>{rwwwKUEKqLM)RjjRi;3A0*FA-2A5hKNJ2r@=SO!^%ei}^6Nf{ zH`9Z2XB9oFxM8t?7psb3@i&wYm&`+G%s992beWz=kOn=Qv|uKA|6 zhxvv1s@3Q`M(u1g%Wrj=DcJrz9%{TS( zz3kiH6zv1mhkl1jOFtGqbquxT)C??tR(!o=Pq}Z^*EIvJjU9G*rlz$|P|(ou8};ihSIr#=3Tdl>Uv zi2pn#Du*g6DL-a=MW^%IvQ#(Utz?F(ta9 zxS|Io0p%+z-_~|_)@SA``*{?Z285rhKeF+)nAvUkE+2Z_?Df1$>zGST_BWjuzSJw9 z?`aW>&Sf`F{^Paf<#$gS-GB4&`xiIfXyTr~Kc2R!;7YZ|wpw_^PFAhcWqKMsn|l`+ z3bl1qoWhTvzzlXwF-Mu()I6zZS9-sAN@;azWZAKbH#NUnFWARO+t}9XH2v@1sXku@ zEvqXxSk~Cmq)W3w%?Gq=&^fF9)&_qD-V1EtSE2oi`nCK~c3668!r-_U?;F4U^u@iG zgW|R6gNwpT+LZiOHPLZ_KFnJbiK^SmFSsL$HL9<<(K2QIvG#Lov6-uhsTfhBENfk{ zuBvBkevO|w%(mSjODtEZ$Wt~|&(}%%Zr*gF*93nTo?R!s?iW$ICSzi!wmi{f zQ&5cGKELgr4Y>^ay|Vn=wHO7PCCyAZn!Mt}%S0~c^OE(IZK~JR_}R0i4fG3E4Zi0k z^|w?=z6za3%sCZzDo#{?T79XqQDsyWQ#-*j+x84!Yj4E{;A>B@K}v`6xI(8$Rd&$M zL=2BS{XpYNzxqM3VRa(1>aA{45c{~*xR~By!vb~$Y}emW91;hVTXNzN(`kJ2u(T)1 zZ9aq~9?x!F=2fjRdtwH9Ah%?LI2C^jld;`7+nH&vw%n{!hqX>f?P8ic1@`IQ1 z3c4p(rAX2Iu0Q2FB_uE6aQ%>`CtI=|UUzujVqk>7U#52h)dpw%itn?%k~+kH|F%P1 zY0~_RFiwSp~Q zNS01h5;s}ZN~uQtxsm)-_9EncU8zEe757Qc5aVfp;0anR5fkgxYdj^3G+cNN+O4p? zusyLg1&;a%-cxhfbGc7kXmY*DQO}#Sh~3a?Q^(k@FI%n+o#^$QI$7|jEi9Rx5%az+ zv^iDD&2oko{Zkfg_L3Cb9OW>LMY~&djB6&3v8}C+DN_}Hng3_bXW0v~kLGnR4y)Ky z`@yzMP|(MCyE;$(fd3M*<^<+bIo{da;k4x-J+rgo8Y-Gwpk_S^4GsMJg+hIXP z;&|&%m2-=db8lx$8M87{v(Fh@ND@Ox+n)RV& zk43PW9fQTC(2?8K7d$U}_x1ZS@KWfo$PW!d8W%Tx6~napvemkV`;D^{Q|Q-LkMc3O zl_?pCOH%XF-)5gGp)7)MUT)1#)|NptxK-Im>TFh2^vR^mD~s z%MEb?sD4{HPW28wGZ8jLvNOW=wdJg3qotj7AfnOU7Zp?!?r-H(ZKYo8t?|kB_Ybi| zWY-(lAi7a*bo&;Ot^RH@(C4V4BlF5KwP=6V#FUwd(W!OQ&Smy2ZEa;4A62$yi|2g( zcN!yq(BWCFtyq|UD7{%q{gjbuGcyf&mr8EeL^$6we=9=ORhnt)SY?QEAU|I2Sp` zC6V=9$$!=XIG; zEL67Dd3fY{T+{uc{F0U}KNK&{qcc}0bxZ7&6rVo0ph?Bx+Aa18^eWYMUAbQe~*Na%@+zLXB`Q$xM~({)X3U@bjNhv)bF{ya$R#;kw?yg zw8csOiI38L%nd2&Q?0e`7B});G#(mBeM;4dYe}U#`dYhK|FSA=O>G10*PPeoHrz?o z7n67(qtLpER`4XX7x0! zT~&{73rpGy)*I#-7QxoevDH!S{6@OPWGO$>Ch9zO7u0_!TPO#p=j+e<9QW(u-#_43 zkasv&zhi^w#=WCo)NAfJPHJNLyh184W&fI{O23wyS$v?pvo)8kP_Iz^r5MZ2L9Fs^ z*4L$zvxjF)PG69EHzPD(QC3j9&E7#=L?2Uh(uAm*aJLX4{*ZHoeXwn$qaJi&mBM0q z9=}~ZQCkf>$VKXAs%sjWY%KA}AD_);S7y%4TT}d|GD7%=zpkF58mm0O*ql$T zNw8=6Jja|qChbUOVQxU_&Dy<=bK+U*I;-YSK<08lTJJn+A8R#RX!~%%o9e;#S0t$} zX|`+nX*Q}`X=Z6_bmR1w4YN#H{*J(&q2Uo1B3nn@s=uOsddMi1-gc^Dd7&mx5B>a; z>`g`O%ST&G;x)cnyG>Nt>y)8 zG_zf9A{5wiEVN~wb)fJywVnlrp)yka81b;fJ@P#pdzrjKy_Olz1R5ev*PUFqRh<># zJ?bhN28Rq)wzh_rh857c^D{rmo|(6z^i@@U?FR9pVu9|gwtzb$D9vRR7s|R7%t8c- zSD6j6)AH+7L^%qnKbZS8ydxM{zZ~41^~ViI{QN^3)%CCM+u*xMIdW@*uj-uk*yhYFiz+bW-^f~+;gLJFIH$6Sb-#3j zzo9khYPf5n%2rfWQ)0_AW^K!i%s!F#Q_+!%bn8t>*$vDWtS>j6t)OaQZ9B@^#@yVj zvo3cWr1CgMm8||p6RCNud8-@l`I~;2XH$;{20rj!#M~%#qdtvxMmZXCQ7?QS%X2H5 z<~_{nn;M-Om~}d@qO7C&iSv7Yw@0Pt&)ToJ6T)8e@rq}KZL@Z!32FMQa!kSHfqr5Nh3{k+lZg}%JL0aeUqw^S7&s}*5-XtHmPQc;|&+%dCd5;{+dz}Th<;g zn^*9A=H|2`X^k?aoP@%fsu*DcyHinDahko1XyzA%hmLNxixvgqGDKLXiG$g-s*aj| z>cOhHstXXOAET^e9c$b=X>szv;ZL=y?7VXI~rkABwr)jh1=T0e3s+~=(R}4^H=ZC-> zV2`{^IA`B(ePdSDG_5W+uM)@d#p)H>ueF7mr`o2Psj7~uh00Y5L9xr@aGdxE`6`xyHNLMw#7&Co;F+{3fOFx>wDqWnL zmo_rBEOm57O!ltA4mGC)nrj6fx?FLG>p?|0|FHJ7^fdon)2`;2C0WR0Y7v!uthS%7 zzQ;n11E`m3;Ck*;G}6?1M}|7p985G^B>GPOQF)IJdj)Qr75~n3ZB+X9Rp5ak= zwq}7tMIY6DXEOR-)Hh=6w$4?nitc59NV%AtoAw}UPytoe)E3U}Rc%-2@jBLrs&EEc z&(y}&uC6VrVyl+c77KF}^>l?Ee|jv|>48nXNAVc=s&|1rsZ?I|%m^A%uds=4%;=aM zO`AoB#%v91#LX#NmNGv6!28XKn=*zX8tPNqG-;*kh=KE+;XOlHA?&OEviM-`-tDH!)nvM$J$#<*hkh&~xPTb)Sm8l~O z4As{iJQc5MYlt*`W~4N`r3*EN;)0yi^pw>2^yI8@`5lXYu1`e{8)4cvVLi zHoEn=#uE|}2pTN7yR^6z3M~bSv_*=P7AWq}7Pl5DP+W@@m*Vbjarc}Ymo4|5>@R=+ zd!KvubI#d1duGkdnl-c5de^&>*U7`){Q0{2+YL#HS%+-D`3>@T)gbfbP+!QO`j4{K zd8c4Y)~=LGNpDj^GWX{0D?DdEBs}4c>*i{sRbA-$LSv87aja~IeW2rvqoMPvXOgsp zTcmla?XKmuV-SC{Kl>EEHcRMeW)J^DS7!Bu*NqFQ*`v;mdUCxF34E<-3CC+RH>TS& z({iu^)aiZh$441sidT8Q5w0>v43lAb7GWO4p7DNBx++hXxiIBc%AWM@*?fMN(l_4D zv`e)@vyhKtCP|BYv93JF1?LP`xHHUQahC)rW(v;%!ML(IOx25j47BGW=r$HXTQE^w z*;p^g5I!vWPW;ZAK?z?b6eb+6ZAn;IM~rfccXG7vjW5O5w_+dOZ_TyW4@!TFffXrtY5EttJ=i$m+tslx~DpiILhol zmYK^2x?+Ugw1I!Zf8fh_9lsG#5FY^vv^iIWoy7K2w=;end^)^mrJk{Et5vVDyk_HC zb!vTIV@!>0)zp>}mnEy?$9wNqB;};+$*fX1%B6;8akH+P)e=0*JW*v7KH3izR?eQC zdN=8(=W(ISJ|-}OP0$ppg4rZ_si5{1d)9+zUUD3_cXUK~_6e`)t6Uqt3U>>U z0)J*YF-G9(F5xC}7x+#ZhyI>5Eqq;+EqZU|b+Mk19jH z{we(tqMl#QXq|W4w%N1T-;w&L>11kYx}`ZlP4ykLw<_9|-6uUKtxkGE=7OBxiyk^( z3SYDBRAV`gJw(}rW&XR~iSDnQwe8=O)pT6-tQI!N%b3NSi95+~%v6kZwVnd%SeJN!_QdrW_lnGfO z#gucpZ$2~F&@zY%dSwXWoq@j{Ckse#hWUZH!aYVng+3zA+AQ>+$STpp zqx(m{is@3hXUyozt>e1K->W(-UJmO@|73fUcQa#c+LIJ*%Eq*)+}~lLzS#d6|5RUU zIIDZXuc7+-r#dr=>*ue@?vUOrH9XyulUTAJbJ#c15V{F);`_lF=AMn@luz7z8{_E_A|xc;&Cqi0z@h(_D%94c*R^5B$ODN*V7vm=Ura1;wy`8~SE zMwfo0>LQgW#JQK)5(@p zG0ic}xzT;cvl&)&Wq|^zH|<7zISnhr;w+XK%vRzHRR&E!W7d`F`IrseOKTTg%l?@8Z`Q8-l+s-1dQY5xkwD2+>Gur9E@Udn zYyCako1E92Rb4lnEuCiPac32G5AUf!KRJz_$|S-DXBr#Bk5n=06!j09Tk3b}D;k?F z7ZlZ7R+|M=H%tBCf;jz7rE6k2;mIOdjE^S{d3pX1HFStymfC_CnS z>2(L%OaD-9nJP>TdWqCHP}BFu^N0I8S0iU@XRc!@;w>b3_WN6l^X21IduAy+fJ;U^ zkCv*9z>=S@o}uZiouHefKW(UPv>P{>#+X}Jr&~V{9vspjv?)9RW`*ysw7qgd-2S)? zaYrlLqtsDLtbQidv#7LL-n)$R$sLj+lP{)88Mkw!(%W9A)P=S)U-Pw8Q#h7>6NvPM zBi46((UO8{1z`ol3KL6~mDO_Ybw~N~pc!8YO|}&?xLQKGKh(d<+s<>`^{w-`V~X>T z>of0fh#>H@I704BXE2SpZ}=&|+cvA4sFT%4HQ#If+7-I#`sN0+@uDdjaVw&&HuE@3 z8!H!lH*{|JmGFI$hoXi@oru~Wbu>CJDkkz$*j=NZ{>^JIJ718M`&D-1j7F(_(r%<* z%DPebiG8ytKadE&;G>imK4q6^SsLTt4X5_;z`(cqjQppU&UfKi0o55HEIs;o6^w7+nxopWWd$yyoJ0>tq%#iBJ58-*#S*+y$ z$34!ac1GCSl|_|_Hfz~vyU}sZwcK;hI}Awa27g0f*+&NI2EzS`z6h`0+tIhoUl!;u zv=L4UJH&6~->7x;*Gw&7Lf>K=a=Q_=d4bBHPSlLl=IV5YMB`*rxOt7`p(O`V3kL-? zfVY4%hzVH`vI`p5;dSqe|(fg4wyJbEaeu z$a#}Hzo2Q+@Zue1>mB{wS3QRjlV_0ch_AQTh{(>J+`C*GT?wvAPLnI%_1@Lqy$6W( z&Dktb?dIIwizFWhALVguk^0g4H^Ap4! zn8S78Z>c(Iv^tCaYr|&aNYhv50`pqSP;0ZGK+u?=E7sfA?LofoR$h_Cdwd%EYkSMc`nedasl?clxav3QF;+r1AxH9VhsOrAZSe>^?CK2I)UN_Fh*x?J_O$oq&9KpJz%F9HVc!EI{sW>Zv*#<%ia`3(M)>L<+>NR>AICCoCa znOd2Lm=BuUSt2aMEE;R6rJ7~4rMYFc`8)F}b2sxU(;kz_SjCX5zoPGHysQ6A-JH1y zE0j@Un17UKnZs9WotNB0y`4SXy|a9X zu;$H2#EUMz*g$)~h}t^i)p!?qzVcS`=6afWYPy?wCU_ZtrNA%3X~bXsUfw_jp(M=_ zNwpq7K;?t|_ZHyhH&OqiKCXG7*@l=MlXSo8qIH#ZF6}h^9>ZUTRQ-G1X#GLNr^zsE zK^&gjhB<~Y2HLP)|A+o_!!EJLuMq{uLWLoA9c{~hlV*JOvm z@u|JA?0VUH`%!yrSxcMQR#4W&QOB9(D0b9y_I1v2Wx1OJGUgKE?R4_S_<{hr@*SSm z!%{8U_btHOCi|cJE&d(8PJV4*wlEMep<%Zy*QCe5dgc`~miv=$%?I-~t|}j@O2sNe z2rMo(s-o1_Rfp7F)PJg1YObovR8Ld`)EVkX?LKvk<{R~JM5ZxlT4{K701*)=%~*9) z)ntCB`mtuXsu}lyEn#;t!R(LhAM{W<1St9IfkRLvbrj=8jlcw={r!B;eI>ph(SB-s ze)Pn8I(h1QmwP?|MBXq@Z_jhjJ5P#-_V)3%^c?c2P&3#@t#+f>!~HoP77B#ZbP%x1n1 z;!xN*8#@*;y0@{Lu;w%a@>dOJ0b>I~_jeq}bzx=zyYi`IqKoKkcxR5rXn#m*P4AQs zP;vAec!l>u1TQg^_QFu|Nk-6B>4Fn;CuTRR&6UKtMo1N6*L@;00z<+`{UKead&u*E)c+iwrD^gM>9RPVx&-U58&o@?r~I?O zzuZqWN!@{g{yY4g-$~!n3DgX!MAXX-(SM(@gRlSxcQEP#uzm{$f@8AsB>Aj%uAi71eIFa^>E0{R(Tiz$8GoQc~ zI!FGAE}<6CJ*Z9SPj`XoAu}>itH*KS(r(mK7QA|A&_|>YdOeUf1_C3yDYHi01sz>B zY_{vuPH{N%78b1SBs=wcpb>jt98I^N=7T%ekV;_%{FZtl?vORKO)8*X;C;90=zx)@ z0=2o*!U`!@J|>-kMe7Usd+8>pMcqO4-^TDtSWOAyIr>i^UX;?;rRLOA z*pH8gmHZWg%R-M9s?rCAf9Qka=kz177Np>3)ELn$?V^?e=i?i!BlEDF&Y-g766%=T zl!^o&Xa}$T=kQi|1RsDNaunsI)=I0XucdZCaoR>_1U53oflTTS?w*VmFiM(7PZPB4 zcxoXNMco1>!UE>3G>5_%5(rk=0;^%qx=gx9{Vgx2e*tp$7UXmfye(YRLa7-&MZQ3v z5fi`@VE--e5hpVj#Hn>qcAM%YX_z{&?dQ2W;tEQ~?h_fv6xW#5 zVhEimp9WIH1$vY)linocF!|C{DpS59j-`GPmM~tSIuj!dgq?mT@rE=7Sm?EZ;oeOa z=z+pYx-F3Dr^rb_MsiUHA;DG!CQV}|8__3jO6O$@qSPOj3#7kLzmugJ%xq~QHG%Fa z?WZz9*)aJmGY+@_o#kP$$`7Myq;m)Trnz*1?IV6<{}gQO=Ybo*FK8sXDYe*&IU$W= z#)~iLmr_8S$XWvt+yJo`X0RIr7tsR$pzew9nID8`L>=!hl~JvvcsfkJ4uqKAltyk3 z{Qa$R5fdS2h>Z{-(=5l+gMqiDLkmfhTT}7CoR{ffDGheaf1@`@)Zdbc*$fZ+G`S(A zW}b^RfM(E#YEN&JHqzJOfis87l$z64pn(@qrF0c>8QL>jCtdg>3J@M`oe4ler7b4i(}76_6q!cuFF7DmR{1I0nwob zvsU!Mdx4^!f!1wMhsWr_z$Xb2Q)v}?dkuQ06vj4{`q1O#ASzd!$BYAF&NJaLP`5hC z;dFms;5?Cj#Y}Lebc^eYXska`m&Lwx6R{;zB0rOZspUZB-%V-2VXMfG#C6OU;&kBY zRF>*8M`Sae4i}d)o55kW$RSdx+@F3M@S;U0$!4mxl!}=2-!N%`CFt)*M(M1bF zE9R(JgH0BLfqd{O6(m=tLYd>@KDsIRL4T^7yp#4z3CudN8o2Ljx*OtwxPkQZD|r7i zsU>qk>dj1!BM90`A>*!U&c|`Kn$*16f@iTQwtj7$IU{5XH#AvdD z0v?6zLyScykXRluX3KKb_O})| zJm;v5c>m`zC0?Y@Nv-Hic__7*xhO7U3Zk<0oK?UcocO&)cbAlcX|x# zZI}Eba|V7X?WvJ+4&6em#HC0iM#Nfp&!ov`sKxXS*z%v38Z&=EvS`Y#mtq-}tfy^M zZTh7AJIOV5U+yFAWoAfwsjl!u`iz|_Y@H}HAM!!XrncKkeI)Df{GetYS4n1!v z{7K$X%`oQuO-s-Y)s$8Osbwk0O8x0i;Qe%z(lXAJ(V1unf{Fi-nsTfQB3LZI8dO;+ zexbKZIyzE*PcH&~$p!hU9H0gOq3JT#I(jmkT#R1*h5Q#VMq10KsE*7gtY-F;hk%oP zg*CfS^shw3w)rR*0Euc0@_Ul%11@?IeuJON%OF`jl+Q>Tz}-IQtYSNG@+2E7dNII1GwHK{rBXYj52gSsF$rBkE_RIqf0st139 zqjC-SU|y8V2+u~O5Q08Rp-sGzUjq|t4Ln13)0Kb?caPqHsKgXJAD#onur_4p*YHg| zBz2$>6NB1D{Ui0Ix4|d#Ptb1)RUbG}C*&fk7201v^szSdSKtzV!$UHLIuA^}fz%F2 zJc6_gwR203KnX_5UBIo3)GE0jwI8)|2=O%{sMFxh<59{eAoTr>QJSZ20{5~L#=L9r ztLqFLm>=-03%#Z>bsOm>z!z~V@~{bcGGJD)2xBIsDIm`ckWKKT>_YvE8~~>UmS|V- zHU~yc9b~IjxHc8Ok)hNEAQ3XuRZ!|4&V<3IuOmDQ$5SQno~(zregt|~JXHW{=E;em z(AU_%kJ@o!?V%B_3`G4^19oF`#O+8&yB>v^b|mDY2za0Nfd6U?_QMhFrxP_2_w+{O zq7Jwoi)&R8lcpY|s*yOF2~WoX=o9ULP1z3KkbNM{v98=T>q(;h=k1r{q z56@@eo>V+T@T=32QVviJlaN{-Vz<1)nb&Al4}f_11gL}`(K0{6Z}l0@JitFeDI~~+ zH<7EWm|b1O5sAff9(aYv;o*A%h=k|SpH3qV(J}a#{tfKHy^xrW;ml!dm%wSxR<& z8T3``KSOSxgDMYkcM`sjK*^`&ba{@W*SPkf{67s(rIkPR9;JPW?}u^`GJX!9h}5{te>kbVj7y@<0E+I4Yxi!DG(Zd@Ul zqa{e4MD|g^XWN7Q64bGXyWow5&52|3EQv8hqE!%N(+Ko#f|RO<-!VaP4TUUJ4be2J zp=UNg@9B^BOJb>z2qh#ERCTI-dFyToZdV(TMJLA@mxIK69X((E3U+&pD?)FhaSS?dV_MT z)l!s>LU~n4>n$iM<4ds5U!z9Kz^hVGVgp+FB^(n3_AJ!jQ?!tWsGTS9dM-c<_!mzk zp^v=+O`f3MUPDH{gQs7h7SquF9)V6qr11t6OvkeXeU$VW(w?$F^`|)F#$6x4kvX7N zUP4YhI7i|h-NO0%xVs3klJ24>5ef4;j-R8we?V$y(faS;OgehWM|nE68?!tfQHGWS z`EonZIVWR|*%5t$L>c-W=$NO0Z=gob{(@imIh5y1^o7gt#lMa+M1ik9!Es$s>=LAr z8^|AtcB8iH24DI28ub)ff z{?_+(pm$)OuvmH}&PJJNU`~cJN9g*{zy3|@uzr!tsF@h1Kby|Ds0Kvq2c&?XfFnpz z`{0LvP>L3Z2pPg?`JPB&tm-WVp;WmTI~y^tF+U!OHKfJT8tNt_$bRs!SwQD79(p*v zlPbXa(|)vzTNvBtAmzq%B0V3H3Stn_r>Xl=j&MwDhWYe3c=6|ex388YxdWoY+>kCw z|CHBEw(tW`M_XXl)fn~H3H8te<6bkm5$1D)unO@WHIM*W_<(APD15-+JPbeksTjN6 z)Gqoa)dd&?m4MEN<=p z1lu_i{!*Vo9!ZtIL*&2xkaf$b?TE%`X8vRzu^Ox+u3)#arR-*QETV8GBTD61b{889 zjEWA36#a_(mj9D`!g9c>Xv;U@UL!tqFW!krmL|R$v@9~$6q=TAc{L)FhVhlTGwek! zl{>=?fX=o6u?EfZ60wCa-@np(+`ZJ5>)7B>J677;*%#Tjl-;qtw)I6s_MaT99NV2E zTt@c`_c>3b@22lHK#U{AeTcaET<8(8Ov7 zVl|sHBp9tGyXl7cYirA(Qfr}goAr=&Ur_tt(IF|J>7fy!gM&u~Z4F8cdL2{{{M3@9 zz04kksqw|qSw)`~4$W(q8=EyG{YdJXw6__3a^<1|+Xlx&=Q{Uf&m!N@z>m@lY729N z-XteUq2hVrh5vRSSeW7u_T6;eMC9sj_EP&wFv02W8Lr!|NcS~&gugJbLA-|;q%%cM zC=8qgl;kpDW#FFwX?Yyk@!o)MSKw>$H0pOH-IZO<%~9oR1l<9{aHGW(ZK6$+;M;W3 za^HH>Iw)vZ&}D$Xe+c?4WJKtiuzKNRB5Fn+kGL3KJL3C@{h?(c)k21vM81d$3FsWI z!k~iA`Rbel*)KA;X06O#k-MxQuS9U_ee3;;1+`R9Tp~^rJ!tKtr0c?EUzzuk$Kx8~ z9ODdgJ$7z%%yh8MFI*n?9q;FXGs0-GIXv|ufM{D!ZX&%E3s8oq-YK3^S8dl7=WwUR zSrZniD`7Ex)we(JOt1ijbtZF;+r zw=-I1j?J8!*(2*-?$!L~MJ`*gFNbo{bC_04Pr9Z&Ea36Y^gZE4Fa{rJV`^P(4p*5Xz>>!W^FSd#-wtc`G%?ih)8@~JzVo%%jmWG6usTB(WElh zwk{4j9Mm@WM(C2zMPc*8`G}{Hwu4O;mcr4Wj1awAF}MW zTr;!guPno?M}uIi82Vj!ld!1JMWHW4ouU7PTEbHz!oq(Dc^0(8vd6U2FhPBlnJ7N- z_OiDt4A1{9uWDXW?q7M^3X_ZHl`blabx!t;5Y`Gd(I*B8qPMr}u4B19%NAiPEp2Wy zmBp0RvH#{g>q+#x0#V?s2Rsea%?_&AkUEol4cLyXN$ zt4*CuHB5eZ^tCV_wA2ln8MGrfEhyV^($XaOU8pK-SXgRg?Wm8TX+bN3*IJjF`kGn8 zWPYDK*}vCzC%1d{pqyW`7i5pm<50RIWg2HIPgl$YzlBV3m#QZ0adaxZSMsE2ZQ=5w z{v{tv7uZ(VR@zQ&ZWOSm7nXWVQqjf>=JAQEp6ZWMQzv+)bnY3eA= z0rgB+a=g*T8KR7xOe@XD%xBFvEyIE;2lK)6f^)1pgL{V-hIR^_6Y2=75!x^~(lXq# z#I)IzZoI5L#+8U^ZmP6@z9;W>K~UlF;$yb$j=9c3&X(?X?kfJvh<2R^D}tlWdA9Y% zQN>cx_Tpx?pUcwhDUK$tg{YA#{(S#0Lb149Qp-u=AdwX}3nPRH!mq&e*a=jNvjM07 zoIlz3(s$hV%zq8YrJaRmKv4Q!SSrZEIWY>Q+)6Ega) z0^Y!mz`;NvqJgUgG0-beb`=eTd- zQFTNfO`WA%vWK}(csJh=KKS!hpKEUF{Dv;(<(3QP2S&AVK5)N0hU>-~=FZmU)@PO& z%RBSGmLII+t@Es_g8m2&3!Y%AZkT2oqWhJuE+z(UI5kBFa?^7M=ibQOQy6VawkNsj zL%&?ZH^QIgb9nlCUb{y*#@W6o)s`$RT2VZ`^qK91W50V7V$=@^go=&DnxY+XmXC`j z#Eu>=ek;5}l=Ei7aUoW0CjO3y%|+r_VO=2CAMgJGqxdl(bNvZ?+OOpEz;C)JZj^da zYv{&|jcLhF0Pc4ax(_YUx0$x=DE1|E@3)u)20p=jw5F53k?E}^*!rzyxM{X=urbZx zGfXkGFnn(qZrBJ*bpiG zB*;ABsMJRu2~6-ztX|M^2Psj!FWd;+4#Wqnhz}ke_)=&ht`ei9+1@F16^;aY z3!jRdcp1^c?~BcW#dTZSL&Y;+vwv`(0clLl-{Qt`alj8ag|@qh9mp-^{M^r~u9{-) z6#ZCZN7Fjv3&SV+#)iuVn|`sro#Bw-qP`zSPQ4-5(8Dy%5){-37882w4bu$6FkP}b zUY(}%g? zOS84N4Ytj*-*et|kM?HxPWshCb>N0=0>;*J>ADmz{)zbLjRJ08ynlA!5o)kR{1>vO z7bs)ng*}03fr|mjpBP9)6!^o!2hl0r#cFzc%ocJn51E7+mrR{vy08y`%R7Ygu^H?r z$d&8()v6-ZN7ZCinCgRS6|BQsYeIBe^nV+^Gi@-*#!SdOrwp_{O-JkBYyFyMTDSg~ zalWyYv6eB*uo+mpb+k>iXEet&x#|a8AB@{W{FB{d?bFIa9np@j?GF0{S3mb}&MwXZ zS99-4?^rME+u+OejB{?a+spdHCg(!gMMst^*>k~L-S?S)8A{PmSS5ZfHWJ4Qp9Q)E z=s=S|TA-t_O#B4MUW4S@(9gb>E{RjcSa7X7fhs~SW*+OH%^Hn4SszHzMbKVNLagjA zbWcXZ-bBQ6ntKB&VLAT~|BU|~QgLhkBqF`Xa9VyNH2a^ZuW7#2zSeGnmsL$&yjIdQ z)b7%pRUcBz>JFNJHSM+cG`% z15w8(N*%Di1?>X8h*klcZa%#gvu9wMV0~{3^)EGxZq7KFsTg5*bIW-r|Fh~OtWLgA zHRlW1e(YM{k_2;ETwQe>`1D>~ZQUwefp&pro%*cW1sjdY>i+5(@Wk7sDbQBcC+Y|4 zujtz8+G^XV-|x#a6X_io=}ByDZurf=-UZ!6mqbs$vr%BCy}* z^7?$u0;7Z%;z-Q;7Rp~rEijjofjwtMs2gY;00MDz)=w(g^HVa2_PzK52+7pno6 zsPS|p^8@O>fc3!EkLOqLgH$D|#_Ht4q|Z#-LfFNm5@> zz2Wcib5&PWE7dfDHXYIGbn7%{)cKl1Z8E6wL=&M|t1|F~YyrE2+r}kwF{+W;A(|Yn zCNm5;G2gluJMO|pGTe36J;^)8*Vi}SJIdSJ%lZDqc-qZ(&hv$vhCN!0{d4x#@3aq*takscg z*gW=tH^@x1g{k~I_Aj?^&x&WR~eBe<_fL-17S^f(i7?3>?w8Y zJ+s|cT~pnXXQ8*m+tt_G*VOmU^9g329bJoDLtRZ>b6i8*w>+(VZ+ypmi+wS^FTFvY zQ|=(I-8BXov>2qFSG_m%VwzoW<7nRgTU_`9~cqnF3b{Hpk4Kb+%cA!0)6{Z zNTpMlbap1EgHKpHP6e#`Qnn`_t*WAasX3rMu34{cruvoZ4=e7r;PrO+d0x?mX|vP= zRbO&L*y@nnDgiZffQnW9h*`A2&r(^{ZuLiX1GSwW$u6YxVJE=ST88IF^AGsld@gr_ zoyM$Ya+!{72)mTo0&T+};JmN%r}--mcT?CmZS1Y)M}1ZOhuWpO!i$`NZ_hvE z7pso*JK5XJGiC!lo7zN&u{F2=*NPv&O=OzUmw+D`!i;9?z)t=N)17WE>tJD1Un~`B ziW9|T!5En4>*ZbHN%Oq-X8H;sF+2R7{r9|Ico&uUMw_kees_l#$m`?;$KR*j)v zyRU7ak+4b#6>|NR{j7fjY|u*mAN_}cjTP&+VT2R{4aGOmwp*A6u#pz&jnJp{!|yh_ zI+MwK$xdgT>~i$*B$ZY@N_84mYEJG1e~7QH;?*0~gERqkPqhKwy??0pK`O7MX{JuX z>PazomaPVx$u3+dKbucbO;9D^*`<6TH;elM67G5CHX@{$5JzSm;-2h4op)lF!Q%Wk zrZzK(+03*?Y>G@88aug-^a(J@S_pRGn4l6bNmghuN`ODvOY#UFe|>Lbx68G|B{(;_ zMtL0G+Ta5@m?PEjH$Vv=`TF^G`(Ajbd4fTqOYWtfvA%x;%fwAm40K;5qE@sDdjod^ zr-V}Rmh>f}+hj_au##H}JHuzdb(+PtVmmM$fzr4XEhHQ$bPnzc{~YDG!RfgR>_f~@ z{^Uof)~oKRs;Q5wcvvK=RE<=%RfAP#m6mVDIk2*FoIVK@&W%hjP7B|uS*m|9yZ)a4 zm;D2Mt%z<0tvg~`&<(KHgq}bjMMRt0%sohpo#;8xem#-iixE;|=_n-AE>c6Ozo-*W z2p@pd`l~LO3N)eA?wV>IQSDi7D%1(&{!V88tE5QDs4vJ zf60yE2l9E40$OqB*%bCEdj@jQD;Dt_SQ9slo5uz5fAd}Vcc}5B+_R>*ULF)y{J5eeWn~DR4je%1CM*l_s0sr^@OMX7^ z4DH}^VDi;OOosE|_S*wC{{a77UtM2s|M9>I;gmQE<9mO^Q%{GUJ{N1e8|2!E-1G;| zZljt5J#{l&x`3L>s1N|*?j8U;U>^!Uy*5VWSn_MjCVJb6|z%g@Sz1M^J zmOaIWa!0VzxEf=`NPZ9Bgny3Gso0y~FVnDET?7k?-pmM4Et=hd{?@sCm2?&4ED;fo zYCsom!+HmUToh0pu!<@GSM|DlQi_vW0L#4_O@)bm-Pg`h>xzb{-A3WSY7c+~TRR{=65G5o}Y$O$cr{`d;uNz{N9F}Hc4SA6C zBcA_ET8HRd30Qf)290Q4XuBUlB4`E!!q1?4=mXr>bgZ|#@c%V62vSiH)|)#*m-7Wy zzdwa8`W7VREXd0*fvwvC6!`)gHld;i26zq9jRFKl&Ql(JNdp zqt~Kt7lV%R&^bAvr@l%B(^Kg|;Dy`RKY^B(Il01u5!NXl!1hPwz)muT+eyqoI>Zht6aHda@q(F2OTDLI>6u zxgLT12dHY`c-?3Xy&rU|1D#hb(6%`!(i~bfH{`CBpldDqGvEpPL4OytH}w&}Y%LII zSK|$B(Qe)$7gecqpg~8JcocdLJ4cy>Eu$4RtuAK=w8DOCYOjPM>X*(pJchCi{ z2ZnLDd<|NcKm{L7$!`Ulv<10W-q zVB6FIC3_6*z6Gtq4c*wUz-m4NZPHF?VTrD6H*~u$Sax+osdoZnb}(pl3G^5a%ge=B z%_Jk)O!S~}$X^cV`WhO>uG9)3Dc=IE+JJVak%9_Of28VyQt{BJgwl5rttk;Y^lkD_ z&>c*Irt2V{t%3Snh}1^H!k{i}i#{T!D`1JZ1=_0z_!9lkXI?{J8UdXajnW@LiRG_vJO;`%nZC`+gX`okZ1RXtzL0Jm@ z^EPM*cOx&~!@71oO7{!2c(?K9bd7D-$-CwFNPlb zKD3NYpapq?R#6{(q7}{3PpIF~XF9`LVJK$cLt*JK08hq3D{6r)LLJyR^Z}I`;am;0 zflp!0IEDHRbY1~Fh)$qnI8_W?=3}&AqH)ZCPEmx`lScVT9NgOIudr8wP8YT((60Xl zI=q3FQUwYHqeeWS>IszU1hj@Z&mLFTEK3LFzJi;0E-R zR%m_C%60y?VPOyh3XX$~M^Eq_7LrqkSa;x%vt8Xy2m7 z2B6ONqpvoEB)=b;!E+c#=D~iXKT;>!=pbmAWoW>SsBJ6s%9Ze|0xEV+xrG9;6Zn8S z@t~E)mFt;F|13jUw!lul5%_U)^tlC~8?hs}1MTe_=uUe>eprH9=z)|j%S+^OXb($} zi@WGi8Mx~R_WuUINCqG429)+uu&S?%zFr2sKhY194+VWV(QCIvsXv2_eM{6=4tmrU zAgS*snnP%{>!Kb=Jmf^wdn9;kT~NFl@~1|>c!&HyLu)TYFE^lEB%*6w+}Q@{kbuTv=lk}i2A*XvXgj~@1O@QL)!UD--$T zpp!>+pmxJivM-Rw89+y$0Sfg6om!)$t#Q6;IZq;-4bM*Wl_NA*yyR;USL=OC5WKB<2Z@5x2!NCeVCoHe3mqssfd6Fnsx zSF-U&4cZBbQ)@;00mM1z8wP&V5-sWraEo5$Z>tK5ldA#bf!J^8aZfemq9Z8O4ZRuQ zLU@K)IhoK4NTga4u~v_igK;hfEvF{Fao{2R!&yr zfW$Vh0bW%HHQE9zk)7~ufg{4Blt{}V$XR8SAq=!2k$H(7N_EtALp+g))N7**Y(Upa>)?ViN#CDtjGP<|4FI2dRAsEsVN0%FyXi(Zh6 zGLp7K>Wl`BT_|e?Xp@3c6Kfj2+#UxoZlDOU$nv86BxbK06e02IT{tFXm9SR~zC)ts zk~sIpxK@NTvhl7oa1LUnlKFr3Gs@qqMCm1VLd0e(qx@MCp_iO5#XCrBYrGgGBVQ5k zCGRKJLvHYUCvreG7mk&l2lrfZJ3hp=D1aLDq6{U-2g!{a=_xVA8I;9^H;@Rv6;X3Z ztX~rCSBW58g0hj=!%B>A66L!LTM3>asTJZb5@Wao=g9jBHJtdmk&}u%lU7995y`od zcNgw1Ezb#wXY46&M9ggvgD@(1 zQjI4`JrFu65tT`-WD+fzl!Me)8QxopoRe}maE}k^ko3rJ0LP?mmDWwp5}GPys3-x6 zMou;*%DEFIC-p&MlauGjFDVVl6^SXX-qB3l#sEBPUHL2|9!rPL+um0EH$rI#WrCljCN7{$N^GMGpe2r|xaun{QXqyU$BkiA9kShQGwO!$V zZM~vz{MW+EFZ{0;RB$HJKPxuEJ4jz7T!efTPF2Aj6#k${Bg#3#2`Vd``GABU5GJOB<8X(js{8^!SMZHvv1`5xws9iEXDBPFu`wBixIKI*r6ke?SlD0%X z3U^l86B#3wwno||*_1I?`XB#P#xuf870IH4gOY!x*C;)*qDLt`jr22xthYH9#)+ily8aUbCX7xoixH+tTAln z$+rbo1<7yo|NS<{Ud!^W)&G9mU=H63U$V6>-`ZkU*$&_K_-%(@a@3)GuLF)cVxMds zv9>XuWu zUile9`#PutQXAyA7XC?XDRosH^%sx&BQ+UUKEG3b$vn5p|LUB~DJzw4QJDEEZ6l(* zwM5`J9CKIYh^>(jye^_}^Ho?2++V8N2_JF_k$6`BgR|Nf17%d`VAKWKc3MA^SdD|4;I) zkS$2ht&lJjSw)d|h+I=KYp9SA32#+oNo9}l0m6NWBtyRBEcsT*HzXw@i7MxnI}~Y! z%*_>9MvWNBGHiRL{29XF)6siUh8390}wj6jP*{ z|7fYq1jx9f+)*(LAksal6Xloek-AaFD`k&JHe^$dl>LgC2pRoItrFRXjFMzd^B+G` z=75Bkky(!->kyfSv==fXA`*|Xk#Qe9q#Y6o$5g(Nf5H`&mPzhW zt|;R?xrdDOiX23ah$KLcNgCwXTE0(?6{$gy704BGrb4n(q$+Zjq(IV8u9CY*uOR>b z_f^s}$Q5$7;(jG9l0T9f$pbl4(Sww-lCz}53b!Xx9-)jP_YtZn)KTX6q-QDf$qM=+bR97VrEC?*NS{i zR>73{zcThI=Sh1evI;pz`kXRnSEQPXmaMdUrMD@)!d^b&+REh>8%AR?E|W1?*~mH) zkvbG9;T_g2Ut;C*305IrVomcA)<9pC>oi_sE%Xh}5uZJ>wx5h=h%7)n3YD1%Syhs; zR;w*<35vg0b?{ZffoqrZ-o$dQng||BIA%C%gDMSVdnfPX{`|a%c+{<7flctjVhN z39QsU!3umDsAUExPsG^N7c2g2p|QLMJz+k)N}{1f9z>5pe9$fQU-UU>VzcN>TBO4n z9TUaWf!#+XM24-;1Tg~bpzqNK=qY$Y1rMVBSnaw9joM@BQ|XS_P85W1grdOcfapKz zU*vZKTWbky4SM+o`G)%D`!4x1d;|Rtpmk3Pj29fjS>WqLW36{Gl>iiup83f3rR1V;FNcfY_C^jAbfSWq;gaB<$k+?RO`3x3J(obSoMU39l}o?UXxcWw1r zgcnjCqDcTjkizgqo4ds_dy@vM2Z)g6==;tjbI`b*e_usvaI!fJ;t4SN(87FH+p zIO5yuLR7&C*0IK0{03Nx{K;mBdfzSAVf#qifzn?~V5mkg`DnrV%yEKOOBPUYMwCP$Uu8ZO?P3t@fS2!!z<%{Q<^zAs9(tR(AHDS za?DxkEPF<7`tZ!|Ip5{(&$*v#D?DCy-nG@!##=iug1W%nRk>Bm)YG)B^(uW;?OXLI zwS&LM{3JCLIwBTxiZi3^PH9q!resd>(c;{qr^Sy;)%I^3VXkW4)Iga0JH3SKtf{B( zY8qzg5i~F4e)z%2>5*q64n(f4^kwun(X%VKv67(IK>* zskh36$jA5T2i`{ZdnGpud*yG>{W|mal;z2LQ_d$}PIjc;%{Y=dEURAL;o`QABko2% zQ(&)b;fHHQ-FY3aKMX`g-c+PNg&3P(@+;|XQd*#eFUj?7*@seBiK^s8@!X>7g^dag zCD&~~mJPKZcE&WVCCwwd-%?KK_u-GhbEbWM&^jnOnVWSC}K zEI}JW8iYrO7l&>OT^{~xWS^*&5xc^6g};ehSShX2H&IKY=R1@`CR^@ycz{TdG&L~<;*B} zU-GxDhrP9Pn%6D#rt6_)z0=Z$YsT-*?=5{px`lodN~0ye2|X0HDeP)!&rp5XmWWvq zvm<*%t&LX4oQNrjUQ~HU?2obCqI#J1>al9AzMjhIA5~hbU{~Jiys_DfQ)j%N_;%&n z>2LSFE&C9gIw<{%^ii211+^VHzRif8cZ2GwZf1I7-Dv4+-eDOLG&blhK+5MV#A&t$FURHVxD@ zYh;Pqpb9q*2)Y}TX&oAr6ciMcW)3qx(hTP3&|ipQzRIqYGFP#x@b8?4IWu!d=k?90 znjM=rq9n(**YS&MumX{zR>6MCLyQnP2r22%NdhX zPksFCZOKc`i}TOBJfHWf&4)p$j?{ta`*YTpINeW#G4x&5r*37KXzdc*D|lkakm3g4{;=eG5M?-cvHccDbyPXNtGF(1Ys1 zedL#_#%X35Ear9QYx>F!7Q_b1=`@Hp#L z_y<+en$)H_J4yoXHR3017tMO(4C|_3XUKP9ZKAG46@>Q!#&qdkYWQy}nTTjD|J8 z4Y?5Rjf}4}vQm1~#Hf0at3wu=hN%0{qXT;P#Im-iZhc8>bs@8kZP*7+V^;>-uO`s4m0%Fof?2%;N7f%XNc| zn=FYT%fstOhsQ07&#jS|psC-zp}jHRta-C#^`2GvDg3T=zhMD4Fc5E_RB$!D=-r=B z*5CW??&*6y9tihN+|PeB<$0$!Jw9e-_zIhQW>7Jj>V{{Qu3@*LOfgb)c;)7?iIt5} zF(Ii&uiC{d7ACvTl!g~&h;8lQ zpQx8;H|m=i)*6-}n$BWRe!heQv?t%nM0VU*|vSdbh)^s#wcdKe|y|lQGREx0v42 z-XgArEAe6VK2bF+y|{7SnBv{pL8-OguY0-v@#%YWZnL*8+#Ga!-Tg_=-oK;L_}uO# zX|5>od$yBqxMfI~5EU7FGVXBfkeD-(&qC8JQ}p9i6M>jE#9d%JRq%awM%tIjLz1Q> zr6ku$r?Oh+So2#JXW4o>Pr1$h7V-$Ty*i+6ZCGp+jWdlc49j!@&3sLwdNl83H#1{t zX!sF@K2QFK-pAF}T-IMPw+I;?VXL$#_DcNwTCM9%Osvs_ZhoxAhvv_l?P#d4H92~1 zkWM`|U?|&`KRok?Ts`_e8lu!KsRK@vfcU0 z>hIw7Q`>wZ=##MLkEdk$9$&rt!>1cM|U=#8fpzM*lw?odt9hSKEN+ zj;%|waTk(c!M(VSyB&cdn(>QFFq*Nbbb6 zP~X&F^>ll$@O$9@I3PSQ-=FhQn0)n|GK>5w%FaI4+^U1+)g>2-Iu+h15c0`_zY3xX z4aI%R4pxdaD;#nBCixuYsko{-p>b<{^*i-9^qk();AI%3SL&u{o~e2&53x6xX-qlO zPT^L1XySCojjc_CeOUj0f|`e^YdK@m>uO?;Hdxy5aQ%Sj`yp?Art2)^Rj#dNU-_US zQ{MP2CS8|0KDo{hB7Wo7DPJ$gI}_Ev{40AnmygT|I z44M(PDsofQl<3Ye&10_B>KOXif3nH0*-GUK@%CBO=F&NZH*(kgo}QkQs{gq>@o7SG zLd}nVlNbFOl{K`mv|^9#IUkM^*xi~IhOe+2xV_SR-ue3bUG@Fo^T=zl#|>>$#Sh{L zP}U9RHRbI~xWYdQ%L|?sloe=;8Wk@u;Yznw$~cU6v|-wsqMP)#>So`P>#Wb zXiD<*F|{=fH4QcmFol_dO~*WYc-lQSdTuc7^iKBO5^yhgMOaK^Nv-%=ap8GEF}{M~ znxeiu-F?&gyDGf=Sjq6B?fHvyyJvk&FHf14{2=i`Vp#HtRPFDI{GR3CEt&3-@+5kj za*5`s?uNdLQTCVug%ZkpymykSGu?? zth`>uwaT>WVU`8<5pI~-C9fz{+I+)v&l6sAz597T^=b>Y)I3vXFAWf=@A!U&n7(bm z^?*kK0|VCw#ss|y+8nYbv_t5(pf&y%y{70lKm(A*8E639ct@zigU)$49XALfBRzA;?@2*WuVEV{`iS^yKvD%yHS~{5_>_s$(3#z*YG`@mQ0g ze`3^uPj{Y4VS4Ks?>XAD+;~-gT=P!BP+uj=z1aGzYFT+|Nr&RfqSWH1r8#BOE815@ znU`CtZ3~^Vxq;F{6wD4)pVU9~Eca&p&iD@wSRC+AK*xYi0Y3w5fz?6hLl%a;5C0u8 zC^9fo4(}A=<8Sr+rhP>-(iX=fv!y(+WOL!O{E>OhbNl6N&+3r*F@0IuptQSbmomC! zFE4meHnFCzYnODLTBhVQEA>G}qleP-il@`Fj%mATf~l=%fbqRHQF)&V!JXazTK%fu zlrJn*m!uVMFX>U%pyFHQw(2uAgsq*U*pWk##t=sp^JJaRoQc>2TScf4tcmyg$V&w9pe zZByk5a;iAkd9|jzVsYuj;;lucMO#X)mDR00R-ISV#Fpe(>)s{|l)q9Bl;3pao;Q4x z0*8c_gl~vkTT36cD(ZUF#%Og+P0X{}uj}ln-5`nztM+$z=#=jytG%RhRPpeQUQF86dvY4suJS&5@KhpD^LJ(t50S@o_gza+e5b%}Rb&x$=&GtFBqZ)|@#>u|Hh5rmHE zt=HeeqV~`g=|379 z0U_Xt*Gg|+@2jSKqp0;z9wzg}gRUCuA@lL78sHOKzG4<@e60C4o%68UA&7Dr zU0a=PFna|A><{S>VX4(J#!zQV-MD)H)emd%sKJc-$~yOJJqn5TIjJqAVug3MpOu=@ zlLZTNUuLz+?2%R{S;O} z^S!S5j|ff-+Z4Gy+M~{?db$Qj8hvV%)!=l!fS4tr&wbwME-?$FQs*km%Bp>3zQyD7 zi?X_;$Nu#DQT*-sSKYVk->pd})6RfVfh;em{%jrO+`@I1z7rwLYSkBA9}mvd-#ZW} z19n5W)=L>pzal2$f5mIUaegHi?Ed8338aeJjwMbzcq$hWotej~d%6}L=e!2`jSIXV zqL1hmeY#G!*v*Z;H15{0QN7*K>aZB!j)ulcEmb9r;A5TM*3c@p^lIMN%)*pkiP;Hn z6I6*+$^zc_nfMu%TjKW8PUCaq4Eeky*A z0?W_foNfh&N@`cu)O>_EW1zf~N?^yRYShm(-!vOFsgUE+fGuieoC%3JJWI*EJ<)6ZMc6|@6gMe9&YluWFGX#^)( zk7=)n155UD-9P#a1Mktx>$}fc|G$C;h8ze@3EdsCB`7@Lj&HJ8yvJL8h}Nd`VBQi~ z)N<<`=dE$((UmRA(@JzjME>TStJ&AHPv?~6ZY-Ev{BP-_@>*46%?&MAtdH$eU6jxo z*G0ET1+AxI$=NWColN#+D!^GWo9;+9MHh%-u&?;QbY%~^9=)DgO|?|?RQ6N7Q5{f^ z&>qlU(?HmzAK|gj^vv_Shr;uM=XF@YR~WbJle7Wqc8W|kj;+lK)F2csJp`JH;0&-& zwZ?$uH?8_prK~=bK8mL zjEY@DFF;?3JSk2r$NvF)#zuCaqrpEkf?7&!rf$

I+H2eVxNDReV-KrwPXo8*+jIS8M1eiNn34V<;eFJu}W zMAW!G*+-$a%2jBu5KF$J@8Mjl8f{R&2LgS()C|7{%fMFAOVLWKB`)DppjZ8?JXi3bbc50|o88}?+0+cOrK?oj0nV}~f?gO$KBGb;&anjbXMDK+%y*b7QGp2{ z6eh!yR2<5aJgFPRHlZ%!q$5NneMR!)<6yS+Pce#l&ihI_RVmJNjfS-;hr8gK0MpWH zHjw@Z^!=&Ocv~9}N844RrULJ_{VluI&np;ytnsjV0oT~si8%norjz6t3h_UbeIEnVW>eW>BRm`E!Q+T?_EF4o<5XccLp5y=SS%#*bW z!-}FnS|aKLI2M-059+wh$h%i3tNR1%Dv7gp|{_2`H*v*ybf;#&dh85 zEA|Nfh^}zgByX^>dNB&B8U+$oR{&io6uG+*bEzRRE48MUx%(?>+=aHa+5q}Gc&z&) z0dME7q7~}-@@_5;ujVJ}-$@I(HB6)s%dT-eS1OnYqPck6F+sPV8e@smoTfi>Z-7j^ ziMlU86Fk@eE>!i}y-@g~*vXm6N9JIB+H z6>;uT;uYoB z5-*Frp;(&3{t!0Gbx~bKLs%7)VFj)w%tc|UU_2a8QNEWT=MGo#rqr&)yHw2>6L9=j1MmH=vo+sCS*qYgN?6IghT6#dGL{wC7_zZ) zh5L>>Tr&#ciV5O#Ls#XsnxANg{t@@hoWi_SZAQV)WMvSmL5Y@0lufl!4k5cqA7HL| zmQyE^svE4ID&4N7hDuv&-V!~%Sw9{Sa0ad+SZ;39tZ|(-D9TBKy)@2u5zChp+Bv@=Y(h1l0{8~yxdW)?1a3;e(Zc<16qzt z9aUm2?^XO++f&-lP{;YjjM(rxNV2A zoiux-dh#dgIyVmYrATg%U{|)+>~=5Y=aE-n5BLK`a0@+rY{&3Ard*h$OmUw?7#tck z!Yn~joR9PU>zofI$GOsdw3;oLMKl)5UeSGJ-Xi;r+Ho{Ues{{YsFg5tTB{BLBWi^O4a z20ISNbIa+Q6gX4(kzfs(hrzx_`3YZeZ$*ad6M35mroQ1i&>L|KWizA1Am`9_lTIGyFTQ2yftg$&0`XoTBPRXFAL6qe-{&p)g0@!m_G? z_UE=?N-aAdY26*DH0=@*TgKuDy+OEu2Px*OBzLu|12vY|g1QiMmA9q7E{zzi7)<*} zy@^F^Goe1$1nfXp5zG3~L%0cO7(Z9s;LcL_VIITXIzY_hCOhuP>y%AYXNZsDV(F$M zi)cvIh#4NcsT1YdD`cSUb~`DVJJaoiPkga9i9Nsv2n!T_dC~DxG0YIfz2~1W+uSkIWo%T=VI-lNc`7V* zCjkR?K6w$|od(oiblM&*)M%Q>MO+WC9X%pkL|;CQjAPDAe~4@F19lf$#f_s>WSlgZ zU#R>dBMz)Rs@t+ZA4znQvhZXg4E-y#H@p<;S$5Ft2@Osr70QM3WLYPi6tt9;IL97D z>BKPch4ZNt!|bMB$)l+U5EndhrQ&$i5c;JwgG}Y8GPC*LuA$n$nL9+ReYRLE|3@R@ zzVL?pt$A!KaA78z{4V_=uQEKw18l(}DU~QYk`eBYy5}VA9_wC6EM)vd4Oy&sg<@O- z(BC4ko%lBFb2x8Wh>ecsn#KHl$xZfFyp?;{Pf>NHHEblgUJPP(A%pEL@u$(wcYrC! z?ZPQ}1g6>Nlz~u+o8%_sRLLctQ%nbsbs$&EJxh6?Om%`4h^{1iNOz@|_@;CPY}kWU zyWQU4O*lpLbrp+|%7^q~>=NEVPtszT@t!Rv!vudnHkI&l%u_{Baoj!rUuGjZC61+8 z#>y=g7Ex)+G4^P&3!J3>Lya9*s9DND?xp=OJx3QvUAKPXud4S*f4Q5n*~$bV$pzdZ zJXtzOucelvP{HJEj`lH!;CZR5Xe>Uj{w*J%&r@5d&Ez1t1kRlI$UtBcdQe?R3%Y6=b*(f^Ign-myYo+p$3d&TcP$eoqCVU z&|T>^uVjCMU8YQYg{PwnsUNJtt)`My#OPNP!kt;|kY657DD)MCPuT1ov<-jKCGswtA^ zQ1zJe${eWqO_Z!+BHqC6Q_a)tQf`(_;!`*&T~-}eO;??u4ho%IRopcqfxHLjk#j<| zW2)2TY|f36>I#ot4_uAx7RxjT=FdCZ*t)n&ct2McXPh92^#!eaIG%{MN_&XyB&JI7 zV!9H%)Qy-BwMBJJby4Hi{G;a$(T02-W87?b<~hydkO_PJZ5X7zpo&s@Ds75~OjGhM zek``Z{rYhEbkFz32NT1sFp*M;xrxJ2E7sLBLeMo<6>&ImSd? zxv~x#&NZ-Ks`;z3VVS-7WkKzneVNPC8>KHwAC~zwYgleoUT8sO5%^opW%hO)C7qRB zs4uNi=+w)!^L4d!jCQU%S2;{^idjnMfssoIY;U7@SXd}@gtK2R9*u1DG35wtZ{vHf zb$;f6Z^5s^J4IXTer}K+tBZLVc08!D-zZZZkAC`0_M~*&KA|e6_kfwt})}c>^;?{7U)xGI4g|lf*rVTM`qJpQdJKoXTrl z;#;}JqH?7O^@-`seO0xVG?W;c8?PD8>s#u0HC8;O+kj0;$1QUxZRs_0%=y(LtNT}f zs;)3!u%32~5!T6OYNm3$_Pz1E_t^k#=)uS?F~jSH#m2|hZ=h|spiy?C{*Bw#TNyUY zr@tYXeJ;*-h1zacUMifOHSt$w(t|{OlJ4iz)T!w`Grwi!=AJBEURKY{I6pydC!UOD z&M7*mn`;ZSgS4MC|EM1;&eE8;B&mcet^>B=H8-liR{l{D1!m9x)t?U5gxh*MUvopG zK=h2+02SQYo(H_&`Lzoy4qgyeC*nxt<)}KfTh+<0O~o{cei@Y&)h5avUf=({fl)Rj zCb~CTwdQ-}Wksj*-ex^bk4`hCpUue4YMCb%Tr4gx9bLYrs-v~ksT8*3VZaxwrf)Ju zOkcJE`-V1BXV5b_Ryx4VbxO7l)=@RK>IcO<+3f)_bMvJU^gnE4~~YF2FC%R*FIyF90&rTMz`p2MFzF0KKu)^)0s z?!z<%E>sz0pq}6h5)xZ*w;h~yzNOflP@Pg;ZH}^RupY4$+AYqx+-so|_D9JS$23*E z18-*?)joBVW|wX`^y5u3HTB}Wru%I3_3-~0FfX`%*w6585zoW>hF=a7!a^e3)EXX~ zV=B--X7hyzTSN2ss-|UUiW2kla@1LwnSs9tWev>3MX18Vtg-yEy6p|YMA`{@b#cLRqlM#&W1i!QeZBpz{g(Zh{Q-;-lsS61Ho9MM zGX)m>i_3sNvJ`CEkEyYAK7Ei8m;zw-X&FD}EVG_%qdcIF(G?oho^MR7_er1rP<7lK zFd3@2i-SG|T?xX0>jMn_D!(=Ull=wLN8J#0U8c7*+1c27!+foZs!S>~lv~TTmVGUC zl~$MStW2pXvW&A@ZK?J+TPv$%X>MI>+h9+zw{mWEopf$<_&W;iU+vEvPn@@%LtS~U z6c^<}u5rM(TkifBNbF;z92^fl*=vYma95S1hSU=JG?U5BRLJZMb~E!gbBmp&e4>7$ zD>pv({Kr&f>g`p}>x9=~@992sp~kz}C)9h2*GW^U=StIBuc1CF-;+L{O^@_>%4Srt zc-{5ZT2@o9W^&ExYO!*8Ra)gMu<~}V_)$5qdRfgy%U+AGHOKO}=9c+t&0WZdw{ZP% zhwx+gZCrErTvwQDpED1L@t?pfY;-Cef7<5TUfNGM+i}U_eK1TtChJkHsE1@Ckis&k zEp%Oa54{s?wqNNztPNb>N7c79^|U>-7?{>AbiMU1{d}+rABK*GI>xTX{>EHGZR1F& zce{;)R#0&fwcZH+9^jf zW58Z}k)I+IiV64=^qn7vm8@90GP=Fdp-> zxEE&-4R?3`mT*}33en(vV4c}yKk_^3fJ)IlAgB0> zf!_8JsCCWBT&S%KChWv*N&^Jrck2Bbi{@YT1LYWnjy*spQKh64c|dQ^D72JPurZ2a z!pZE#N^TxlvJY@E(oR$WEXx(ZF%G3>gWKx|4wFXW5_n>t0+I1B`Xck< zP+SHzsovynrapUzE+$7HPIPj=fi0?&R49(@jn083yDwDB8lWKHusoH`(go2XeiJ4O zEkqU28@u69pn`t~n%Mz46Kn-7;aOS1Y=U#+7rD9Q;+yc3f!dfaJOM+7AM}4cgDk-r zVlkcycWj9CN;F9RasWytIWmh}N?FK6aFDbj>!X8&K>k2?fK^o~d5Z+x>7H;VyMgS` z1;^4caN6nv6B>gd%hDPscW?1+cy7bUNAOJtqVq&LZYvjq_3WaoLpov;P_Htiop8Oe zQY!ddIuS2X9DR>DLNzAu!X19iJ>>>*H~15{09DhiR0CAsncMV!Vh>Nk`t`v%!+lX` zjJ3oyG>P)2Qo!c%jeLT-p?P3U^8;GePcSvOV74Mawh~jpeKL{gOZvcfUJd8%&p4Hs zjkXax&;TIeP6l$)2iy^Nh5At=sD+MF9ApZ>PSTrd1rE0)>9nvN9c%ejp~h%kBPPSD55#EzBcU(!q_QWC91J-6IFgPRCE z{axS-y#vPLByc~r1;U>d438P;13j9V#{@G;loPF#%O$P!7hJ~~Adg)^se}PXNH4`M zVl`0v|3S^^3$&FEVJAX1VlW;p?Gsw_9mQ9Wo9qtz_IcnvhtTg)BRoTDBn1n5#75{N z^_c0ae4^aK)FnUR-CRHL$cH#zxJHQ=iA3@?(~x;d#Zc{u^Kb%WgaR%}7$^53x*!EQ z2mYTOpitEU4{Q+l8$*C_8cFsfD2U+yRRniCD4|E6E@#nMq|106UW;uShe61R%O@;eUx<;8lZKBaj($ z&?&S9{ekX575g!21payz+#LzU{m<^o8@WTmT#=C~i6LO5yiRza4$?d!PI%8Z;txts z2pe)y>2w0Mhs-6PqXPs<^(JSdKPWqS7+7E7c$;7njG%fL!v8J&4VB+bXb4pf(*`Zs zKEV16rZd_!6xU6OkOkLx|WpI31mskd;EYseEoA+9D8 z=&9^RwjbLIa)fcBRsa(QHxEuiZ_pIFnoVV|QUi$RVr#w+cZqAux5Zs3e|Egmsq#`b zpTf?xL_1*FjCG1bEi>P!f3r z?U6&#W1z$B21Z#4m^?p$aj*h+mU@C$B}+Pvfu4ivfn78lT#`LtelJa43Zs4Ffp-~0 z_>qgj@fi!ewvE7I9S<{dFM;jljRvDqn0)hr`N3&KCAPz)+W&lNZio;%|q~GpL`IQ!>fZNlYg&C`>0|QWW@%qv1X1 zD0%?Rd@^)~WJ*>r4=ja>_Y^V(?wS%mhYa5=K4<}) zt^WqntOA4SlDq=^=3n$sdKvP=+l6y{KmNCng1^AuXay=bOaCU1%APQ#wa-1!-G{Fc zVdj;}qciD&bUGM*H%Si!e<4r!3OTbr)K|s@od!oyDB%FV!d&?DMmz}Ym}gNetm4Pe z86W|Ap|)rx`VS3(=WYPdQPpSyc++Df$ZiXf5-&Mnr}#;31&*pnC6m*L4|u3}hbN#n zV2+q0+o)?yG&_#@Og4dx&>qgfmGP%xrJhWEXRa|r=mb=Oe~7f$9*DV@@O-dlS?JNg z>V5`bib`3Mrie44C*%mXQFO}b*M3Dk%j2h@9+NCwvGKR``gf**h#HwaB9kC16#Gi!@55NN+i0nz~R4Dh12 zNd-6-g#hih9yN?yj-tSj{22FvUkD~duY=WX7Lael(NP(Q)lz+kNLu0%L=kzEYC;d7 zZ=*=LNUAG31P=)aiR2IZEIWmrMBgJqrJr0M_XBqip&DzUvh;>6W7bjKP#YX9+~cna zounJYQ2GHA&i={tC7pka4&vz*(r@`V8Uy6^-jpYJYm3B@LMNf6*cAVkAE8YEn9wmK?I72pF7gCv zlh|Jj6r-g)tb-jTncPJNz)Wd1v09#rn*s3Wgom&Yy-9B2jXOio*cw+avtoXPIL(Ul6%74AA&nU&qq%% zv8;pWW(+zGQ@HhH1Y2fw4%SJeZQLM2pb>9CJV6q#)t3FgN_K+yR^~e*h`=3lMWV0OfLlYy>ayUR(!% zhS+|jbY6OacLFoi7hQ&R|2~R_Po|W2NsUE?sF5CEPTq@xsrJ-S@-1P;TcmjLj<{30 zgRSxtpnrA+;skhNWWV<-t#SB#n{oNosi`@fyhxs~G7G zR0UcBY{}m8sQ=N)(0KA5HIQBcFC1b32C3Iz~( z{w+@hhU^?%OL`4#{z7+Gu84C(7gn}(1MdfVZ7xod{*XS4x#B+%iS3bN&>XT3b%RO+ zX80jED+JMJ=%p}W7^rBboU1BRY1B7W<5ZGzhVrIjh~gyJBf^vel&w@%s@gCijMYsw zNt$M0$??&2R!1wH%-_)Ygrr6MZP#u4Gb?K?ubE^%ZRX8C%-zi~HOFfn)2L*TEff&04(EC|O$n=npj&;J5;{%Tj2GusjBnC%F5K5`C* ztV%zwfS)Zclw#%nkdrQ_Qs@=T0M-E~C63*quqwQiN0q%`W_KKT(za?X`G zuPi-Wnp?W5Y-IV%iieea^>S-_M}IG)00VFPOL+}$?o)d$nU%XhJ7^s zmb5}#{Dl~X>cg8f8FGaO+1HB8;HVj>>7mOuXg&9PJ@Pr}m+XHaU}50#z==VHK~I7o z27e8H5p>vpy4N^;Z$%bf;p}BjEXyg1FYqhqQgEbTY~j_y$ikL|uM1;}N0s_iKCX#! zRto8agElJ)RU_4b>h`J;$^(jQNO$nXzO-$(_&lO7MY zm=EeCsHI$2yn|R^BckPWh=Fo>KfW^;%K7sL1icg_!)!h)skZ5sc{K1|?DsHmSICsG z>k;8m%VNr70&4HBom)F8rY7opEgaIpXRCG#Rq0$)J}-~@efO7t%G8wd)V67!8C^3M z{BD=6%Kx+2zw)o6ZjT8IZiuyS0TSso=o>wh3OBQ+W0jL+8kOMu`x=H*-#hNPpY3-KfZoVy@z!U z$Fz%5hJH59QZB(ate*?hGdiSpO`e(9EOB~rmz3sdJ{jci+1XVELitRqH}69xsMmNb z_uk?&#mC|8GM)0s&{MiyYLl`rwNjeqI%7$%I9jwfZ*7hu_et)){3C@4C8H}ERL9k< zux)fR(h>x-ekzsjPlL-aSl>$9S3O19fZ@?n*?l;~w*)tdh>wn_*SmqUk`$tb(kE?2#@y^SMLyNTo!+=T>#J9JW%_*dUFOUC4E641x@YXI+n{pM zX582nTr;SAW07wjpEWisB0DdqL7pT3ucB6Ei>d-GQ=JFJBC<@eLYt$nG%hk8FgUc! zU?r?#40Jhh4__4~aSlfbKW%@~Vp~@jnm#7QKhgjDiElH$uTRMP!6rZY=}ZgBeOGR= z-52{ZP4x@CF8Szu)xJ-B-9CXn*tFkcqHdwmN))=H&AUsz3isx0{{1qu;P*>_Xza~i zko%?ZQCXR}wR1GS&uFx^G0Eejv7aGS-&r?AYgV0w{+K1wSFXY}$+^jS%H3Ve zhltz7tWn1qj9#t%Cx%Xpo=~4{Jh<7O7B^ZxZh5iArlzOrMu!HO;*=>|M#ZAMyhx;nUswh*z1{XRl&YKhJ(1(>=a>D!fj4$N4@F zhzYTUZVDe1t`Aw|H^P(BnPA?(uDFbwYQIy1D{7Y{=jCU8|NY>1hwRt6tqb#uZCxl_VvRJ8PjPr#mRFXPs*59FZf{7Tx#&sp z$kI{eyQ}_!rx?0G&~N64YKzWdnCN-cE8KUPUyA>Tz=lEkpf!QF0`B=M{j>a;z%PN8 zz)yifU{GKq;6E(!9q-Xqdrozo36^JY16)~-YZm{is?xQk_F`vozan+RO4#Trrs9cDgK&(SpmlbY6q$UXT#O~2s|5D z7BD1Ww|^b~4gPg~@{I=V8D$2YCg+NCgae!lD&Ogr-Zd|({sbsZOy&NnZB=R2=grpY zwl%+N65$;+xfXJ(`7^?PaVt2x-idv|S20vtAwGl(&Oh#s&N4e=pJMB0Ra+L-oB`rT zxXlkBR2{kP&~xw)^j4-)8H$;jExM=rVa8`3J3LoGO{1RAY~LMzul$1p)(0%|f8)2+ zua}>%pNCJB$ziC`d{e$+hLL~6+0)FAa*eiMvg|dtsNPsLvZ}bUUe&QGzVc|Lu`1X+ z5&kaOegmp9X~3c|gHLiR=3tJ(g_B}ROG$fcd-AT0ha>!!0o|(Lav353%wa~C`k5Q@0qTDqg$xmsxmSA zVGSzRctLSDyk}MQ)Dj=Eln=_yJCHXcV&KMH`puRJI}cXa~7_v zz(^HxI=P(c4yWWN;5$;0jpzetA#~7eAa;A?-M2;7^dE8#el>Nom<$Aa)Tn*f-+*R&-+(E7fw+(!<8^D&6$F~7LP@v%C zR|*}3x)2LvK1|pkoDj5NLJSgTiiu(eDMOlw*MlFasXPV9Lu0{1k_8#VI*?zy3}-3= z@)Qfm+2ks4oSRV*DnUx<-lxED)E^8mb;(*_g(-zBs2%A@6Il+~$YW?T>JJ&Q!AOPf zf*oQ8@TrtU0!(>~0G~-+d<#rPSH$|F77T^ZVGYKkXZ#d?IzI^5Lr-~;j}ev&XM{(B zKb#g_Vnb;+814Rq)B8E>4P8l9K>u&}|5UwBkZWHCM)#$}RxryfgS_Ja;KOeM!v22v z3{SySk^t_NPhgx;!qr4TwlowOkQ&uOz2W*Mp?PqUYytVO3h*eb0#cs>yyM%z|B;2S z;T2$J^2R07P3gE4CvAXVtKgsSqyn%|d%<~hGnmU+xvjh!I8O<{sILn&z=`lv_Q17( zVGVo)W1+jLH4y(|fb8XhtIm>(ffSVoEUKTtj4A;NRigYqg4O?~79Pn@!IY8m{~Rh6 z&9OeuUL`vS~79fawpzu@}~MI=fg?hu!W^>D?bfXny? zFy{Y9XO+Qzq6fO${~Rbmz#nV~wFF-vq#1xhhJl<_1E1!9_K_>{C2$Gc1mnRO@GC8a zy2c23xZF-|3eFV|StVOxexVvFU*(YfapFkmfNKdRwpEZ@NC4tiBz(p>FhlVgz9BbZ zh0`rU4CK^pU$;=jQNV#y}ovC4Bp{;rCyV zp&SK&>IEKx8sLQ;ruZZJSMN93UeMDCRd45@Z?;8 zJGcm*#IA6q>wx6=zbn}W|4$FdIt0nnf#0|Uv zl^i4eje9_U=pnH?k%G1pDd2MYCO;H^Ntuwr2qdnEz3>3}DwuxKz#EZ@CrBOOPA`?a z!@E@lKc9f7z8CS4*oJO`+vO2he$v5i7zx)o1z(fK5_|Cxd=uS=T-sm6R-lxvlq--E zwE%*cMXrKp{v^?wB4seKkUppj_9Bmy70}gp96UxmWaK_l6x`J%WH9c7=8^BA+cS;& zM>-`Z5Yg~HCljC0e5j+PLxv(8$I=JL_q2k0=)3_LTNPBS*2(S26ZjRMN<5%GlY3DB zWIG=by96)FpUKA)scq01_zULrqUno-75g)Pg9WVzGY&5zjgYs=CXT|lw2fXOKat)l zrpVR&NZCj~AR)UW-Bdr|dhtA2MqXfd+xxSlh#kTa;H3R8_pyUMA&iBdzCB_ZK1;Wx zhDa?4KXj6sEWO2rR2*>_s$|dMecA!t5lxTVu>#tB5B)P~zaB0j+O+U^Ux8g@7opOGDSJtNULnv`m* zb5Oe5hpiNUNY&(iHlOUowi9;n&(IXqhwXwKx>Ni*?!B@$zE7=UjOx$evkE|CU}`Oo zh*PYU=Ae0Ej5r$cd^44uK93iHYjGU2fw%zkhL2QF$t1Co@#1bHg{}uofn>9vnc@6m zemC=li3ew2p{oRDIwskd3X7Sos=7phy&C4hXS?^y`Q#}El#U!OJxvy9mBb18o|CmdaM|a zhf;6(?q~oxPrgn3ma175c>tVmHgcu-O-e!W#2&#D`BNU;DlUfjCbPI$x(9WK!F-HV z+g-^HK~AU0WC|yx&hCpuLu4i%sfVeQ!W8=`emgyxEXaJ!8J&y7?*Qne>OtGYwYV=C?;cxa!{Hu{TP%l#R7LJ#yp zvNnT>btFwp01BQ<-YXrTx3HK_00fL>W&#kdkon z4%a0#NfF2l7dHu=T}E*d=cR0|X(}%uD6XLh94Un9&rmabjOU;+LY{jXahV)Jk0FlX zC_WhaB_Ib%yoHsxvltJ?yffefFC{NSbzqv@3^##!HBV_EwT3AH!+8pEo9qS?Q+*YE zs3c}5yi^6Hkc2WGv#jM_dQ!fmsK=)f62-O{6Mtna~Qihy4QjI2Enw{;*TU zL5^k%ieRTO4~T(M8|gnOUTQ)-qWzc*>Ni7zmtW)EG6}USyR4utGb4z_(pO0%4uc%=E#fRKKsEa? zo-56Q7-2qn5Bf*H6J9t@I4gh=hknggGJfG8o0Wy*o!cusnib2kIaSD z9DIl96=Y<`ffZ3rG>6Ra9H>mJB&MLt#4Pk$o&q`QU$P$Z^V^_aI0z}|L{cQeh*S80 z$O;u=JaLp9LwcfAc`bB{_@hutN7bhvG852XaW+3x+$>Ka6QKINm@L7bP+7N9F9!R(u0#Eqe2ra#n7_Q*4&BVf^;Cj?1Vz_5LS zyWqpPiKr3#LbV_tsxqe_()%v2Cr*>6p}I7jGJtt^AXE)zz?y%ZEF}g31+#_hBb9=u z5f)CU4tE0|({6~XZh*P(r!)w%Mvd9s^bo2JY9iN2ALS&p1g$~)P&vlJZlRtu4_84a z5_El%67dQ83uXWvQwQEUZz5biiBH2FE0;sbgH#vFL?%My&DTeBDNKap;n(k ze1JTvNXzzqs)0~D&Ve}d5?l=f(dJ#GhEwQG zG9JaE;lu-o!6w36UIw*>r|1RP0`nn;nFEp926;akNj0KYlMzt+$rpx-FQh5(#7w4x z7%RCHcI#`>LMafQnx-&!%@8B;csT9M6OO|(c#S*^zS&LWZd3%%gH24vFNh&14JOzR z$={^+&@p6#zLA0W1XKfJ!7ld@oP`831N*ZIK518a6}ajfKxLv29xCmE+V2+V417gR zpp4`QA_qQgEMAEp-~?cM9)cS1YrGC3y=TzTf=PxdfvQkG-Y*r4r=X&-AF2v1p~9ml zL%?Qv52_cRp=;qO*@!3r=k^txC8mfYp<=dH?hbEP8*)B8^P6EZEmPK_I>Z~WQyPd- zc(16$Hq1aDj5kzeHiOYmheTu|i@_o2izb12=q$Jym&(n-pLi7Fuc;^jY^t}2UFiQf zx(4t%vNk-P>##^|+qUg)ZQJJ7+}gJ7rnZ%0Yo%>?Jv?XrcmF5P%{Ftj=Fw#iRTCY(BZb3~y)U0DLW^1yABqJgIBV9-)n+`BO#^F?QSg&JjG@l}) z)q%NjN|*G<+9>Upwn`VE8{3WN*a&PAKbeHO{*aZ0`G$nTX~+P40sQphkU!fZ9c3LhM{)ZXc_H#= zhe}nYVo0Q&EWHxr#H&IGNs>R2*II|ag40+_?4u3LE=E)RsK)9~w3hlBq@p_X;@VH8 zVz^!?TWDDDuRzYgAOC!R8Gkl^OMg}WQh(k+bg+A9ap+?x9MVD_Ww~-wsRJwNX-0xE zmh{3rE6>zs+i~b`6-gX{zj&XK(zH>}>d~=j^wss~vPrJ&w|8{v?&7HFymF)ZES-74Nf(r;&H6{}K z>NevMG-2~qw=z5Q2Cj@xe8+qhe22YzyrsQ0yq&!yeQWxe^s?TnzSh10en-#|N(l7~ z$AyQ7E(i06jL_Tg4K<5?Oy6mIFg6*ljYZ}@a*D2J9&)U(Usxx;5_gNg1QnUJTfv*2 zDvz|)u%ELxaR|=S&g`zTt^`*X_ZwGfS0&dj_{YV#F1jYVi+J{WzI)n69QMrdI6ZmX z%iR;*om}y*46g6?0ydvG5sH@0<{fRXG9h#C1o{M011*F0;Jd)gK=(kyK>0xLz~w;Y z;Nf7K(4x?VP(-+MxOaGRI2=BTPQ)WMK|6&}G}~N624Ie_0Cv+B^~5op(JH}v_$+ds z`{L}p5a*O?nDMpvcwvB~%Z2S79fzFlT%Vzeu-rpDZ#*hZ{j~!<0&N3>178Dj(1VX{!MvdiAvWX<9Spw-7gzjBgjxtD)upuC>TR{Q7Nt?J z(h@YAK1Z)?q#4uA9N?plrH6q=Ek_z-9xE$U=Bv=1XihtU(Q*~IX%6NKbDe#}Wfw|| zU8J{iZae4r=ty!Nbv<`YcIWmC_HYr0A}T~)jw~28HR@SZp6J8TzoR$9LG(||(3ow} zy`yeK&W(8EZsUAx`zoI2{;^J(E3}$Q>Cl3}A%8WP$;bJ-`*-=5_^0}>_%Hj{_&@k7 z2l@u~2OPl_7)wP%KSKq=HNyXfTPPEhdrEb6ArhmXs+!6pS-y@|SzE59YOP=wztd;{ zZ-FJ)ZAQ>bSgpSyi8sdjLC;{vUxrh05$p(=X#k9hiQtF!2Or=GbCF#HhI3Qc5bgtB zIZke6%VE#q$l@&TYVI!X`R3UZ(K7O9WCJ{}&e2ccEj2ghT8uk3CYFnR9#c7{96Hof zA`3)xca63;kX8P<_0lX2ZBmJ#-+vRMZM(OEud|Qy?eyO9O1|~p(cTe0zpt|Yp#NlG zXD~9(K4 z#?$I=wS?n#Z{$`EvV7=uZJ-5^n!Juo#p@_3hK$?-!2jEVd2kqrshv;cPYWqx6?uv6 zt3Afq&^5+A5v#zHh>DSqBHKnKM3s$h8+|sqcubj?Ncg$cit)sRqpwGY;7WHnGB)zI z`>~_1EhsMFmeA{9a!BC`ftOeZu6R?^t9z$;^LRg}*Y=L|Hutviay}QYqpwvDO2R zO?yLmm=FY;>k-&|O~SW=B=FAv7*DW+&*59;ZRBn1<-B9lN2c@M5#IUU-oDfR>4BWV zexXz0CdxRaliEs~0A|sCbTKRGm$WmQU;C)d($;Ery(apa(Z)So=Bd$b^XKh!oElPZ>As z6zrz7Nw~@uw;r3L^+d%J&KW8f{O*tOfAyX4<@Vk8e(_H9O5Wu3mfk7eao(5S^S*}u zkpER6OUM`68y=z5RWGYmv<2D|WVY|s#%fiyB3eQ4wxYDM|G&~+=+hQ6ZX5N@Bc?=# z;FMDYwa5~rfy;0$ae%A02&}xN=nm#ZLdk5#iwyGtsOZ*nW%$cL_G^o=(rxLeeB1V~ zeVwDDbFFK-`;ohmM~FBaks9$eqF`j#$iRPp}YFB?NhT>E^s~6RZ+EuN*en>BCTrgUgcQ9tR z5eaLikG4mZEaUvN7hOsg{n?@HHuf;G$W^u=*N;2FZE` zUpSUId%Jk|0(U*nMUO3_N5pL?DIP~`intoFA;J?e*E7gd*E83Bz%|=d-{o*Fvp2P6 zkb8<5_;j#uGLbsQbFGb<1{KGIP<$|BaAH6RZ1G3>cl&xG_UxBe@n-W4@;&iQ@OKKh zg4cuVLzBaWm9t6_b%7eM-huK!QP1Kk=c=o~us@_;Q+0KqmZ+80x9cU0V@753p4pRJ z#2NZ1I-U!_v&_xRLEd$Bc0K!%?Eo%!L;gBnUw9<+7Qcw?BvyVPkFn{tG4^Q3S4UIl zQ|ES9efMd%2RlWwr%lA1h`teqC(Tne;)AD$C+r^KKISU!dh6`(ThaAA~oB_k<6H7l((2JB1I1vnz`g5znx{HUK+&ZqvkBBm(D^>^M(uU<+{PxemO= z&l8G^e(|AnQEqR$VryW(i(2=#CBW z^L%p8!U&z}-s4Je-gV}44h8>dhApq`7w-zk`0wl&>p1vHQD%3&kv3heqNIezgp^>W zV2i*f|7LjICHb!Sw)n>5sfB&j{MY;$0*9gUNe@m$tui|NDI5qFQl=>96pvaSt1jj>1z){87#Murbu$OC`tFLQ6TzpgAx7@egnLV96!#pm}8Fzj63|DTr*1vZ& zcWkv6vb~jtNK3_)e12{Q>%uvD5*UXby@UEJd@%GRXa;`y-Tvda4%53Et7Coa2;030 zUdGqaC;Q*~7Y6bLYS}!tFY-{?DL;{>Ns5?&=ebg>3sq+ar_AW5m$+Oh=h=H%zR)|-z|Z9%p73I_9GsXH&2-#%?)V!WAT4j}uZrfy+XZ_EhnA>cNpaGp27^8A2~SXbyD4s!yR$adsr;C+q89yX1w1(x|1 zwl?^qr&tYLfrnSg=n}tv@F9=nUG2 zxJe20TAPy<=sa$vd$H^EqA%z|Yb-5<{zZtcMh)1Rb_9dEr_~)-zJ|5|vX`B?YrSJO zSxtdWb)yf^@4Sm1RtY8n**qoDh0KgqeJ0a`eadK1Q;h*um<>GW57qb=`t&>n7>|o-!N|-_S*=yDmC?Ht23gcsr0GF)E93lbuv}|K7%tb2zwaRO&Ff)nm38ZYZRfhkYTx3?En^}&#$@JkmTbJ17 z=+JV=m*0wB)dzBxSxjet39r+~gJQfllQD^C!LCsK9iq9}2bO3SV02Op z{iJ`$ceX02&$a|6X=Abj#Vc-=W`;wx_JJvlF3l9SEWyc>%HWEPVxEI%)q(b8`jLYe z;Wq6gSfdM7IzJC%Du<_PihG*JJ4jT_uz`T*)5ffl5b z$XL>s9R`1}HdY2M3?0rdvW897UR!WoLjQHUUWR*1Mq~anKzs*tQ`q5bBeIss#^=Pd zi~trh+RBNajptgE{y-bAlXz~K?&jC&@3}liX09n5C|fi4SqC>82|4RY5jI5ba4u#V zc}Kr#gV@n#U35kX+n&_1n)0zmHEsd>5A6vp?R!!k^Mo*QW;FWxZOva?ezS_To(wU* z!s96wxNss9FgM_uOW~cZwa$UT1J)_+$9`n?7;u}hmZ55G%H{(a^8%{+oith7YfUi? zQ^mSf!)nEd+!T_Lzij?XGcf1KU1)fGY$Q1gUCjLuR5SO9)f z3!^ay)0;nK^yC*{^--aCe6DRH8gob)D?Vh~(8}Bm{V=V-rWmdGLDneS5pfuMn?56- zwRCe9mta+f>)$aWFG)i0whEKmeiwL0GSg0P!ag@DV3uZLuQ5(hX3JVHm^XB{^tWD5 z*vtH;A4wyAhmp*z;x#hH25&cRtawy!EsN$_J(iQW!PX!qr#v72RK58cEFl$z>12^O zj4)&v^Mk*@CP^>Y?a~lFV4M{?8L_AvMYTEK#KQHN$xIo+&9|m|j1zWM&CMUe6IpD_ z!k*>dST>B*dS)V1NSMc~n0JGWAxuvTdku3$UKm=+Uod`YPkGV&#Xhm6aak>m{|gn@ zQPkokt$02k>sM3wI@%@S4JTV;Y_sJ=p$nUZKH~dZeMm8}gVl){PQLQ8(u5gAJ94*~ z!M1jC7j${Dn{UZiM{B05u)%t$)ikQnLhzou2VKQjBgtCF9x|%&2k|@L{y>j0%9w&Z ztGe#tT5?m&@?0#N!c7&gn^VBwf1@wth8x@2c;UHt!zv?h(G_+sxySwz%UjE&WptNu zLk+3%+5uOC6typ$iE3L;=NmqYFihy8FV&}7^{tjrq?Ti{idD!#(%zV?^$}Qh z7L?n?_@C?weZ5hSzoEAy2c(63J9LVhG3|_VhKpMO9A&kXja_e^u+Ez8wV(V>^Cwwu zuL*prE^`O|R?Vziz_+r?7t9pxhWv=IMkcI-hILrrn0*$@)g)QM*u=;ccDLLT>%b=K zD4h}7V6~Fpi-YZUb`3d5&og7pIR2FQk((*C!p8(d96MW!nMK}p{9^dD$&;56)Tyq&UNRvL&b+)wKdLmj;}-K;d`BF4Zf5W zBq8gpaSXcax7H`RmMy^tm_pV_t|s=AF7k9qmAuT8GT`Sf7)C*}dR?ODotZ zq@Fg^=*Rvo?O`>_SoO_^)Xvuw4*x%W?l`jtE}0qGA6zNxKSj=MW-|94&wLZLm<&Kq z?5KlwF@0#7(UUF~o3m3`J2#F*VGV3)#iJwe2`f`St0bI^egJuCWBpe{J%cj-E^!ir z%w!L8iRKG7#B4JPGMm+5hQW4$MroLoUru8_n1}Rw?Gi!U(K9kEb_j_2+ahKl^>q02We4gT6*xE*lAGS z)gACBb>=2NqciOK0!0ozY$Rj>PGF z>f_sFj>Xf0;33treo++_OLw!2m4{i({^3?}%~^PSk*}n!HHSW==iq=m3w6Y8emCRV@g69}RxvNQk$74^X-TMkTal$!3-k!~uyufM zrlRLDmzm5=XC5*>E)A>aP3($)FvI(roY~d5O?a-MPy*ipKL{viY3$9tm||Q}VJg1~ z7|Iq>flh$(u09thY~#ibn$S~WP6fF(>}_TyT)Z;U zyWq!MpaYpIOfImdF4F_l3zb|X6wXiJVafv2{R_&x!gyCAcZd_&U*s0qf%^Ih^MT!r z>bNR8E8}ScdXkDb0sIB7Nf-FOBm%$eVs)h(EfHw!N>om@=u>kkwA)pPU^QZw;xv$z zPho&_(?VtvcHe@id?&E!+&gvzW70BE={Loiy#pxoS1!ODwRX{D^j1pJo>mD2CP%T) zpzQoa7m>%96%*KaehKS@RyB`Rm8P0N!w7OQ`B8i^t`NJ|dJ9G7PB4ZuaJ9K~?S*n1iDj5e{YxY^7I@ao1xKlcmz z`)Wjnl6NDx3H!+aa*4D@*SY}CDIefOF&+rSU%+nTaY{~P@^f{$RAjM=Y%aDNdX|0wt7qpXzU}bebzLlBfE-S0=)H{CE-N17Q18u(*$?ufYlvmg7WNYVE(tc zT&S+=LUGoK<^nJ84f=Fvpv0R7J|1Hw0YTVH^Wj7r0cZ8n>})75E|Xs517^}2==099 zx1mihfOAu8+{01Go-Bx@%!bxHS_$3jYj~o?aI(|DDm-nSzFagg%sd<}Br#De=-^Nw90N?El{{At7 z6$MB@qLmEJU|Fy>&w+&)kNWaIlztxj9B1P_2*0gL)4*C;2d3vndI+4OKja_!oMyqh ztcZGhJNSsDm^-*%L$K~u2A^>Oa~24A00?^vRCE*J1#pyY3n$p7SW!md6x4*R3>`er z9pS=UFYYQ%QD<fNs;gZ4PaBj-ro8)cneF29{^eT;%Mev?Rt)krOckc zJs&)mBd$e`i0T+sHmYV+&ZyFn10zyBURM!^U;bAt$!(+k&9SO0v^p@)yB7XKO_Mt( zRsS<0seZDSd@VIwTIaNi=|jDTe7F2!@MtJIFw`XQpo=2cbeKL!KVfWwT6Yy$LRi#} zjYtpkHcpkfn3nL;Iw71DdrA4^0&;y@F9+x9>^>23B`SCHi>NP=Gk^)CL~f3n5j`Si zO>BplchOg3rbM5J_{&q+J;vTh9LQaTe{+lQS^wzt^pvm34U&yNPygIaN=oXUTq@;5 z%JbB$>72Ka?|^?>a3VU%71d+R|n)9%tl6h2}LU zz$F44URLI}2o0oz@>g3m$8%?@YnCT5qGQzX=*%&dVsgY}i5VZWE9Okhwb=O?`et|+ zdm&@>OgCfVqTfXpcde1GbEWB0^>ApEzfs!T9ufY)h6>v!vZj zU*bFJKNpw}pQ-6;JN+;aTN_q(1-MZP+&4a$$I$ONX0+0sdaOQ7JBOOItF}Tbg}Zs1 z^su^ur&m(gEv}U>+Z>MFPPh9KFr=#yMMU2U!W8y*wRqwGqpH@^au35 z>F{DmWViDTr4hEmj;GG`uCcCq=rfme{pEh*aYrq{a}{Fi#Ey^28`CfLVul$RH)a~2 zrC-*x%uOe^Ie2P%U^ zoV(6gmDo8@RaBAFY@;0A9Cz%$?Vs_Q_o_vwZ;1P8sQi>L14#aNHlru}Q zEDN)c?EA9c%VfmNi*D)~!)LZ?7+XW7{5{i~CKvm?NAK(?jW@?cq+!ZdKB~ z`b}fE*^R8FKdkyJ%WuNTC5tp1oRs|dd|Be;y%?p8qYD(hqI09Op3CR{711LqEjkfe z(_EQ<#P!YEAzO6z?m5flTAHnE<_@t>-8Y1H#HX$aR7$^#3OKUocDFY*DBxl z|LphscJkD;dEWm1wYaxxxVyIB*hSx1`cl>T)xM4`K;8J?;}riN%EV{91HfqlFd1Y@r0s4Xv;? zy_UY)98SeG&r>Jzc2o>7`M3;kGb))AvpmeUF30U0IdksI)iCFj%&(&Ph_F1Bv{mW` zU#4eHzVhqSkE`EOzZUxX@JrQi{eNEj{WiIC+8giOK*7-W&?;q^{>3~;_cD*r9Tai) z-wib5zP>~ssC7~kmFB?P9t8^qD+b4f_J`Ay3tCUCpoK_0kiY=EOt-QnxO3cmxVf(6 z_Cm#w9cq&iOm65ij)FCJkZ&gd;sQ=%Nmd%Y1|IQm4?WGE?*BIC{$ zam;z&R!YjsPB0p&i^G|N-F;iqSEaT|uKefgud|6u636^n^84VQqDe=Rt|re>uYG5TelgAc@9W2}(|oc)WMS=|KRy}e3i^_Mb6nFy9hLv@!rOf&U) z=4R3t-Q4l;eptrV=cdAO<32nle8LN1nou5WpHhZl+@?Xmp}EAGp7_!>5=sNch)~`l46r{ zr=+9_{!D?rz8l`Ze7*dQ18ahXq36$~57lk}b6KeVQI|n${Q`(sR_(s>1)P}2;e+79 z#Fmm{gEw`t%h7h zdIL|7_R;|?@Sgr^5@2mHQs>0J8Ow3HM_%G8uHsjHJW zC8c107E)wf`KnYSwLn@D61E%r5BvGxu25_^HGB|Uw>f%PdkSZUty(GVfL2%6{6 z-)$(yAaeoXt;)`2L+k~8H>%AC~n|JQP3)A#xc2U>wGvMKyt;nePGHZ4Y93n!d4 z#x-MrQOyV$4}nJ~krQ+va1lz=t+rr>#`Brre=t^hzA}xV`lp?7lGfv6L{0;EXb#Pxr?i$yTj}@y*Rpgg472b*( z92)038@N6=4@<2?-oD251$>Be_L}l#sigg(v$SWotF677y}FcJI%n%=zbUU2vj}nQ z1nUqo*=lpGFf(d!qCRJ_L10SI^s;ULmnmR$}vXquj8EK5B zC-peBo6(KNnSJ$DMqSfqbb^0Qb2AxyzOL9|8euO?X1j=W*aAidRD0!^=R!07sIZ4` z%v{t{&1>8)cm&RZk90+@D>GWiAhfmm$&t?Ujv~TjHJ{Z`?r+a%-!1JD;09-0wG{q| zG}p0J%Ey*x+Z#Wq$mf#3GPSvO_GBikEi-EfO}Rqo)s}G{6FShWWTx4K%Lle@DQP_W z8y(EtPznuT!l?2B^b}AV8M=eo+$nmWd}PziFLa=_#JrAEdIfm-Z(>DgFjTUbWYIr^ z<>Ct~Ms{nr(Ez?lna#E87VRdGuH_`Jkw>qJ{z5l+B>v5eV&S7m9tvOC%X)dEJNJTL zVflp0!cMjYonfpe8~GO8NSa5gFMekFn>URN%tUFkc%Q$i`(n|t*I#O{8A1${Rr}Ly}nVL9us*xr$gp{CqfekT+tFS+YT^7>)* z3Xf3FN>yA%_$J&~bD+{1{imrmm#i2XZOfKY+tF>d4P>eIw|E?gQWdip$!y%^elW?v zQ8w#Um3M{*$qKK*mRGGs^pCa@4w7}OT2>Wwf?63Bc{_T=e<{Z;MuLZp>@m0bUYpOQ z?%Zp3ig1GFCQfFo?q$k5`|u}`>+qiYDCL3+Rc5BKxZk=(QpGI%O=hSt(LANEU|x$W zWGDS0RAevubMUX_Pw@CV#xK;f>Wi$eHYYd0I$~57a#OYyan%svyuXQIE=@NE3`WI6fhk4EF zO~#?Ce}r2jZ4+LFrzvjvhVvxJqIvlnj=uDnh9o=jrnOYBVawp))zjJ#Hc9@ivR0x! zR=j8Yqh+z#%{x{Psk^YsYHb#QcH;&4W6tNCVgo_an{y4heRMGtz!|{zy{SLr9tnfE zD6^*48NO=mR7!H#mhc75%QO{zy;So&|4`4zq{~f=M07fesKfSq!Dw1OBS1`H%Vb>I(kMuwH)F+@u%{hUPIEyIBlo78d!m!Swz=a3a;Q- zxP_E%n?<@Awa61;EBi~oD>ZRe(tV+u^u689b95;yau(@oY+!Wh4!T{@;OrizF|?q# zm7l0zFgD?dWsejb_3<`0MVV-OW*KaVDFQ%EdXy z8ob_L-)_lrTe=IXidWQbPS@56MfuKH)rXlg)df~g-XWnoL>e2bfi9L}s`Aab_U0R7 z921ms3oq1%{7!3Uco%=t@vk^tc^J-Od(J&lcS8k{nOrkx=+CSHjt^i6@WOgFJ}3zv zp{}sl<=inoHq3};ncezgYdG(4OyWi~~8m&ksnX;Yr=jwF+mi?VtUlVC#TSZ1w1#;is)4Hvtuy3Kk zdmp~WcD5H{-kH1(-7QxSelzjnCK?^?Pjkb+u8q2p$!)7|-q*%kW9=uI^C7!2-3`yY z&}*T(SXS9%%@cQUjp!)jBr4LiT5a$@p9nT)hrXDZz%L~O)NRgI^xtqu#mec-GS4*GSm&Oy|g|bzb%%Rt9WsMg4 zMyV=a1)Qg%@^ztsk=HCMBp}rZsvh=<)K<oLIOsKl#;-Ke z3fgeZ=qF>p_|uwhEP{9L47o1z-e@2NjEve^Wu2SY(mbg~s?Z z=E@xFBbQ{Hhl5QkZD44NEh``LzT?KZ48akq$8Kl0D+l=!?)QdU;qCR9=43fr%p5~2 zIloy~)SUcJTlv5~b)YleGeB8mwu09GIQKy7<}kQ1Mh~d2zS39PHKv;FJpVu$O%94R z+0*K5bG+Pw|BG!zQ^KFo4gNxhMBn55{_6U2y(K?KjuBFY97>h&3$p}VPQ#?K!Gg^* z47$k_b`BYB)HBMumpDT3BHLkG?AZ`VR=P)?=jsHyDRIsY&Kvq{q`7{NOb=D{#zrQ~ zj9x+OYQMn@(pF-f7=qmRb0*<@+DPT8wA)OR;-qCrVoMNeg~}<}?eU&y|r6i`ImMV=@8Y7u#ndQg&KFbX1yR93}SCSB# zpohpStC#z=mc|jYg?5zf%0}6VF$ygATGl!H8P!e7IIpQsjonfO)Hfx@!BGd z*9P(Fbcfo;SyAA^>uGo43IEHSq}GJm=$Bf__`$_V9ho%bieC|Gm?V5fvvt+hmd|f(G_uhN{C<_w8+c49!atqs0;bAAXy8t9 z`;33cX}*fBnXV{7{i%JUSTvlSnc`Tkz9uu+3E0JNn<3jn*3j-M3++Gjj^vuXgyW9> z&^t&!YCp|KGIfMc=<6&}zi45;rp?36u*MrTV4%K}@rBO1ngh%2#q|wNp<_Hl&BEbY zY@+Qhi4Qb)6t(;PX@YhB zg776BDI=bN?kUQ8zNeW5i7~muzg-nwC)MTpHn=C2N7~RK=QeRccqf-nu^V=ABNwuF zw>B`9jb34Dv=UXDhOhdVr-WPHZ)ypb+m(~73tOV7tu}j#ZRC!8N3)pT#_|j6bhsu* zG~u%PZfT8i4tb(|3-9o-ww9?2l`+mt5y`;?zL$=b?vVGha@AJVmCs+n=;{u!Taf`U zHS>Gnd-@rxqck~KkL%zbLt7f%nMAXfGMKX*<=F*vI~lM3p`W?^{9am#+a!!Ol7nZ3 zKhkjWUvk%Aq{3Ab8^A*&L0v$G@&WO#K8~z%Mk~9t=Jp{{ev&;{Seh*@(dJn_Sl+hN zY>z}WuV@+N={d1A8Ks}MHaOq&ym1`N1Ibz>rc2ksKKV$N>(|wL@@rdj#zv+x$YW+6 z)BEfhpn$g+3HfDRNHL+T7&02DndBTsFYqLKvSaz*>cmi4`#a}!{{TIYyRjTfOVGR9 z_VJ@=S=0ro%mVGBGC`i~$ZtJY+SA=)y0%B#?4g6(mHd|M|X_N*F@FG$`6*In{|r!(BaJtj`kz75OamSBo|dgaCJ;!wbULi?e~~TVk73gFviNOE)>o&$+QU6 zmGj_U@mamVeQ?8{HNAp)$rTA*%XY^``Iw%Z(pxNQ?@d37_kbmhQkojFP?w8`oAg+< z0h!A*HPgYxx-V@2GFXNbAt&^H{95L*+1ULJ>4L4SOtu!JE<0L^Wh-f~X$%*(%8M)M zOL~QTR9((2>_KfcmCaaJWfG_UgY?pK9E0ALVcyf4>#XySvryn45_#Hj+W3d+YAnms@o9DUw!m!|4BiS)U%t!8rh6@|yUgm}HZeg+bMIXWr z6TuczqG1{s_z@5_QZrTcN zU7N^r6K*BuKxB3uvFltj;}uj)y~!=xPHPF1%bB7U^(B%?@-f>{c>l-psoFpKd}g}z zOk8AW=2%l9@ysUC!F>h4>Iz$g1rEhdr?HL#T<1V#a}TQDbL1O7r|VH_J!Z8~&C0_b z5;vG(_{?w74p`NMm0~7()_e&!kVa5vwx{3B0Iv(ht=oDWUB+Ie#l)l5Ph&A$2p*dA zEz14PX-o%g9aBQCNtf&O=>g$`*_fYVtE-(iG;o&YunG2`>>Yg{>BEkJwts?syVOo? z3|`_6^93EkO&2%Q%`}=E2Ywag9=tI(tyJ5{I20Mz) z59RbNWRBiqDv~f*DZfafRYKfFFPMa`5muuH-b4zMevF@+OZzbcrMdbCjar3R7kqc$ zFcZM}+-rVj^K(u3_BqY~t$6RjJ?X!B4de^2}%t z2Gbd^dB1Sg;F>!M3{nH0EPI)!v@J|G#{KFA%*&km!Rk+)NcJ%&DNEEMv!nM9qM@q)lAqnnOn{Gz zW_B`dd>QTo{9YPD`4dkLS^3!=>~-*lvVtL-h>rhl_}_w!&VPmnEra=V5MB5y+;F%i z&j;@~9Xt|^`@#846YEA!VJusjzGFIoKe&NhWZR3e+&@}IvYvkckD|leY;Go*Pp-rB zbT{{$EyGl`Ea=9+Ss8^`p*1s=jMD`309%`@#Lwp%lbm`{GZ*`nJ8l(%!ek|J zmQEW2q2ERmzz9!+tI8^CHS?M*M8^AI+6n&_!BU`>W=K#+ax*od5 z8inrJJZ7ks1A6XmTvp*3KNNSpExSPIC%xi#K;5*Tjc0E0mE_ApJw62v>TS3<^cIit z1>mjygssli5H<^gx&Ck^K7BLd*aVH)dg{ZR>&0$>SM^1B z?tWz+@F~J6bo#pqX9Q7N2vu1JaR>iah!GpxHrbwwWl%9)5;ggy5u4N{>LLQwn^A^YDMT!Tw?j3p2#W{AB(lms^aKo%WnIUYa9*hl;zit&XFk zN+F}o$=U}f%=d*$hqneZ1=jnU`5XDSBPpmu z;68NEvxAvKUx2=kR9|VcF>Z33@n#M3jdX{q_W}_39Z-mN-A2xs?8@t=u02q?U2z?7XZH+sUvjQ;e0Pk6>S%}KlzphZ zuicVEVze-ZTLOks7wA@ona|X9;iT{#B^Y*vT0mX&G%zKgLJus5mISB3d+~kvS$JCb zZ{@o>UlaAcx(0`!alnWtlBFaXNjw`(8CO?`lqAc|PsRCq3`*KyzZA~40(?n ziAP|YX0;}urfCdCjm#coud;o?6pCjug2mMv?iAivLcaXz+b- zM|i$^M%@5D(GRV?{t6i+4Z(!!Y~I6s`mfIO7)eG=^EpM^-Wrv1Ha5y?VUE!%DhW$S9IC_fZm37Ldr+%Kl3l|UXCEwz10Ipu0NA@n&oKbQ*&+oFNB zftta!!JWYyQ1O=x4G(1qUkN9KuS18q8hz`TN}949deamfle=ji?Jsq;dP94n8~Rp# z0-Q|H#Wi}t=ll|QlP$q3dkj@UIdGrPxwqx=wDLe8pMoHP^vvN?LEH{=Kh?Ai= zt|(Jrf6v7hVv2BAVBxuPR)`Yffqj=2I`U!cr=_3`xdWw3OQIVC^jw-#EuoAHo1uN7 zj-j;RBy}6q+N&N*Ba!;tjmYh?|9asBn+*S@=)T z!m8XXt{FE09im@grgr2m0`Y4Cb>CVrHyXluX*!f^1FSNr2GgNUD-R`p0(Qwo;Dz3U zwy-$Zp%ch4%+QjCs^>LE8jpZRA2doCie3r3|0!dGvA`INyr94ILizyx09frm^diPk z0|_%&y_SIay8zw|r|^0QmR&rpk8GXE(9m7CZa|f{49x4Z&;-uJs&yZ)2V4fs+%1^F z!}+p!)-v3KKJj)Tt56JM(!`iNC^QE4ZVBy$Wc~%R$$s)N0t;UFd(4lu+-|VehjHz( z0>*-WbCZoj?YtbjwGXV!z<*ALm_seu)9}^&W_^G+=YG_|8ay)}f#sTpU9mDf4$s#6 z<_nWWUQq}0q)`hDnFM{eJ__Cx1@t&QpWYq`Z>5kY*g!vs=V>>R^+)=@dLd(vA%VSq z2fWo>NP+fX4U_0ncpGfCN+J1W7jp^@QXTLN65&mXIgM)n0#x#sxM$oqE`Usn2K)q6 z6j8!JVLDh^?Sx3-J)goi5cUe+g&>fZ(SirLGs%1lAzpYU3>EGpf5VUUKAlVDo^a#2 z5S*um!t?YItFR$3b0)C4SsUww3gQ&}6n0sEz#XtiE~vg1!snzYI^;{pbojgx@{3GD zFQ=3_&ME{DRaeXj$f57EnH({VX z%?~AJ1)Sd2K0#&vzn5>gn#TaRKf+oY3ON< zg@WQ1lqads)RtwsF=L_VSPq0jXKJ!Dp>X~Rw*)uzVC%WZ+-Ho^F!!Ciif6Zmn}St- zCY(iga%16GM)7kDbi!5OHAvvGFdFE4b6nvhXp0)NQS2M$Am-07pe)AvHS&V+G%pfv@`6pN zVa$IcJ|e^W*n_ktiAG@VPox*=H+WC~!CD~VtkW5HbTqu8dq5q4)H3+WT!*jmC-g!0 zVOAfr{Vg0;OyqYxmSk6F9Qao2VZe)3jCSRGDpGmf61i7dFKuO zy$UMe=}>sj$H!D=2>ha2Fn__(`5eyo5%@igNrkg5#b5jaH>tr)A!tk#D1@$CSE0MO z14jP|_z!}q0*){PCG{2DmCjhdBXB|s(tpvzxQUN*SlcdAWHQnZ_}(LEmX^cw=oU2N zg5|cN!D*=gc79K2#QS5;jsyFDGCudlU+N3@;&qrk7x4f3h(sRb`9VG2AFn=muhrq2 zoQmsDz$*GLs_Z`&g=(l79Dzq;?)AY8>XWqzow=i<`+MXmA`m0WJl zEBkx%KickHxI4dPd_`KfCS}mJQv(EGw2^Ocm6Y>|D9U%`^LDkCOh>oYNPlgvEK; zouAWBOV_1WFUgp1$Ztqq5VJPl>dcJOlkSt84}OxI52eJnQr?@f52dG%CFhS%%%Ua9 zDMEsb%Bgu(b2#z7pZW2<{FkeLN-O_1zb5c+SvB8JjSnY3+K``$95rGdo{}~$ihWuP zZKh_wkS{+=pB#TF`7$EsrJfgOMqZIIxh8Y}+L%4#H_x{RyEScCn_mrIk?~ua6ieft zol)gmmAQLCQeO~vb;fZ;@>`PpPfZ^kPfI??cPy=;R@7!uN?w{cE7AumhgqG{&&$o6 zm8r*yn6uMf>Udh>{w!%fOsn2aul!%e=xFTsljl#<`wNK?CMIoQ45HMCp|uf}r##Y8 zvSm{j{_K%l@Ez$EXI?HFby+!DcUFA#^qHvveZFLvrNg%@^;$MUmZttoQYs@&4>Fs` ziMe%7T6Jz(vu2Dmzw`bp!>o;cez5crvw%Kh)q`IbbKx)-g^GE7)M?W!k&UX5XexhFMPSow9 z;j?VUfH66DRxUlha#rp+nJKIlX8ZEtE)V9MF~-oyGh>*G%QE-;@bfuiiL-31#WOM& zmu4157%)~$Hf0uC{(yk;NAJ`dPjR9z$us zLv^s<3zdRSNrQ5Ec!tNN(f)`Bd_-cMT9D{L;Ymt1Cmw> zv1d=T^WCI+Ki|<&Hy}RD(Lq(o^SzND{`cd;Au}|o5ENhq&hvhOpBt z&PwD1W>+c&I6G_09Z728N)szhSsrS_?<#>iEAZq4!zyLx2PVw5>dGZ_MKFA44%aoU z&wZcV%%y4Yft8+-0>2ak+V;!wV}PW=>`MBf9i|`@>Wm9bH150&1v1WxL34;hE||KO zDourQwf=1_F8>3?-qA;2(U+XtaHU*OJ}H=e&-nn#$Y`(|192X3M|K>s^LQ?JuuxQd z*ceU@*nHT`1D2HJi}}sUa6M>CQGiRgx~7Q7c}Y6N zS`%XBx_YHOoV%bw7^ng?K#BpK;AEzOT1b_OgC;?Rph^5s7tYf_+V8|YGJNmkm%k5> za9qui;C>Xt8UE0)-;VFd2@GL}b8ZGpI0nq2VDewHPZ;30hIxC$u06T=RihD3ydUP% z2mEGoBJKai7{Xay4ne;*oDmRdf&VAA{+5i-63u_A6@E);d2$2PhE~`bVfh8pwxxvI z6Z8}PcqA@{o_r^LN=#wGfb4Tegb{EQ7?pR%e)8kklW{*eIxxT(N0mK;v2{=Il-@lB zA9ID7;11G#;{D7m_YG&8e1bDhTHjqjiVkPo`3yzxOcs{XGx?eO(0dGfz;sR^gui+E z&st&y$ve1~dOpDIX@FA&hEoM=kdp>$)N_pI2l*>-4P$k?;#ujedgwtZz^7)EW1{a9 z#{o|2;yG;bpf=#nNGiD#&x4*1rBP5iAk0~bB@Kh3NyVgdQa-|<&r)w`J#-S9I?-L} zuT+&#C@gdt3QU+B+;pCXhXc>)7Q^X~^C5P9a4T>nV6ovESLFn*ue?da((^mq6d`h1@L%#+@Isu~%YEbHe6GE20bT*_%NU;AIordzak2;ERDUvGB)`@W zU3mfcC3qCf#&9JYXVAt#nooy&*?5A3*)*U{;bP!rYQVzT;0M|q7`_nxYs)ZOV{ab3 zlbEgH7q^C+s<~pwmoATe*^CF{ziq*h!Hr?Vmu(w9cr|#l@@3n?!^y4f2rmbAXWT1? zeN}9*SH~bL*fpSQV(*&4yTTU&V~`{4jse2m9jU^e8MHUt}z;4$aTujRKyZpe32zM7ljyE*2T$ewN)5I+6;Bd^;(!+ka|aWDsB2s<#s z3HkMy&y5%d;u4M@b1*W(gOP9@4E*^S4t!z4gn@|9|FI+f=kveE4i48i#G5zyHI)&M z5-39#93cmj`ip_^kqQ_CRy;Pa@fvQN+eREyYnz5p^ZH_>ySL7A0CVfe2ME|$q@h;e zT5}=rgiFpK}%XmcTa* zJYisN9JATD;;@M$j=9fTa19W$Z>$Mcka+Ct^SP$3%lg@u4;hVEU{)Y5hPB8l#B^=$ z3dCC7Gvt7{tX@N1#a-R5>T474>U^Y;3SeWp{tbsx7_xJO)`p%yQFeryU?vD3R0ji| zn8H&`>63AYf#eC<5_n+bRQNDRoOX=Q7~qLf$rSMR8QoJ-HSd!`NP&`w|sVR#%#aTmBp|@x#kTAAo>zcNu6lYo1)Rav{3E-)>wFV~i(ilRtEyLcmWP8oD zQyxkmDev-(1UZqHITN=%U<;=Z!U!cMB^%Gu^^qTSX|J^%$jR+TLob{8yDJk)IQ9ft zzUhG3#SJGNa^U*5B!mxx%oLwzfX%a$0H=j53GuwZiNW&(=Lldhz!wjLG#8@}8woFx zRL(8fnELC({ad&B`_#qC7>N0jFspWi*x6 zcv4qqqNG4rsX*lh$OeEbMX1D}+=E;LHe3Yq0$?}^4BQ6%g`u2p;1u!-uVwd1XqOLbpuy4 z!SYD1pYvxt66;CLM%NsxvDzs)CpaU_+VDhbX5^JFI^pl?mQ(7gmmeamv;eJ%IwrCB zF>p<4cub?N2Q0J({f;zdiX{YIehYj3h^-ACotillim!2uZAvs;#IsD|5epmm=Jv#Whkl zsoq5Ex`n@M*L6I}%cT>nf9Vd?Kv_H(AgPS{qsr&;A<-dh(U9w$GVEBvstH%VV+?S7 z^MCq_Rm)U464>ezCdra{7!!TMl-oQ!VTA~rFKg026qlq1d{KR53N*YU$|6xRb(=S;d8;l_rejw^y@VD6v&c5bR+a~JKw!1!<<%FWP+hW$u>hxg%p zx`nKAU0UsCv#`@sX$NVjo;T}o}QU+3?G<+BU5p9_R}ewY_# zzUT6vSuxMY|3YpX>igCS=$nDQH8U^9eIfS|@xPSs#n>3!S7N^s^HN?gzm)&X_Ht~^ zD}i4LmQd{1@)4IfnAh^X8UsZ5>%%st_G<|t753}-ULE%9BPQ_cxgSX?Tw`eK2Zz6@ zxJ`-g59eYxRb5IErq24PBV}1XA?otl$Y+WVgdu+0Y|BkaO9-Kt2p6KS=nebS-Z6xp z6#HUaAVk>!aqetewZQ z!dOXP2^Jq8tLxGDy8;Q-fO#YkPa%jl! z>O%SM9v}2jT6t&a=AFTop5lUonquRZw&I5pOP8U#w+*8UJ-pe#E^#X7Bin=Scw=Ln%VwiK~>^^n^4u(&;I;O0SzUDNRj{ z8dJ@XIqV*IWZIUew7b&nDZSEeW#5*6ea=0^*5|p0oXydEz*;hpxQ4e~oSrDpcvF7( zk-%GjV~~e+B|lO&7i(hNlWk%U)3y-Lwpttd#60U#l3~QN{`#$v{REyI+ZV)DTOi)n z8ft!x-@L6QSTMLv31)Zv#kM}SV)6-DOKW1wXe<5J-kI_yMU8PN8w@pV2tHuPMSUZF z&%oAB_~&g>P)l?my7-Ny9~fLUo7c@C{OUMK$tj$eV0t1)Q=(?&+ML+ck{WMH>G_?$ zQ`fR}zqDJL-LUJQYAfLnlTAPyQ_@&Y??64mXhuR+@a zhWO+x2LiW2PTcoZGXwsrQNFR^O~lEu;3Fr~YwH6~UBF?`G~+XL*DQoMgfv_&kfmEk zG3cc&$@1-k`7+ubW6kHMUYm0Hnjh`a*k0;Tj1YYTMq9{o84o|kx>|B@>cfC`kF=c; z&W8E%?@V$&IscrK*wegZraJGLKzTnW?qaAir;z`B-Q$M{)&uE^2{*RoW-oL_lA z;-H~tCtA?AT`iXeY) z5D0PN(9bD@6zZXg1!S0bVp=Novy1I)sJ^zuHrWTZvb|(4 z(PgH(Gj94^uE!SnGd;_x00$c#D}TY5Zxg@Za1kNssD zk)ERysO-G{b&=aCr&E51oL%WU@;xQ&$ji}J=prFkj;<_S$sk$~Lev{7RrfVVwIa$B z`$B`;XBwoClMKBwNhOoY)Y08|2hMwNz43+&UAZQ*bmDlU4p?bAvUQ-|tDbJ;aTD1O z8T)jPPx&djrpj8;Gpd2O-SYb#sDVtQ;}7x2hb)IJSmKCxyCJK za*f+^t5KNB2ZOJ7t<|2A9tk*ZZA)%SHK*oFi;ZR5TYB&FlLsNRAD3|Zjvk*IYJOHE#4vA_GJ}=>qah_GYe0PfHoo3FbsaRUE5Z0^2GkD}QgdJ$@1gdV z>ZG?~#ff!AVyo#=yE?7b`qhqc=hb!Y{Z)KuB+$63oxs<%FNQd3WXY=1sRvXqxHe(a%~v(O(nEB*)s>KsI>+9Mm1?4! zBsN+U!quOEo7V_SYl)%G7dnitW!}$yS#-k_Jy+xFEm~7tnDFXiO64c*3@O)T$8eWW zW24@;I79HUuc))#F!mq(>^taddxr%dJCe6q+?S?3N~rr+Z`yj-mL0Gy^P-rjM~?Oy8(PjdDi4|*hT_Lyq(OsC|XA8r+K$H*H* z+T3fJuBVu|i4%f%k+ew(#u(m-0`~ru_orHdr;aI|_n%DT zJt}jtX10K|-j^bE?^^W^Ra;z_(~4nWxch{rjb5V13ft4Zowfgs$9P;i*SFrH#;!Kc zvF(j1&OeOlrj&upNICjpa_dOJ%yp0>zeQ_mtDy1JHIUzuIA5Ewg`cONQM-|C6T*pC|Gj$>-#dQRevoVy%2b}M4A>zLM8VAQKSS@$>Vs?YMx+w|0#eB7^WyX|-H zp^v)%bPuw}#G>c6H|=NpzI%o{20O!=jDTb3%Li$_Bg)t_>gUCFZq!{nW)m~Y({oSS z%(~7&<|gyBbJRJzac+h)_dh*8Any=L%e4FQ0NN(qk`lPic`05h12w7sTPni(my78e z1T^02z`=7{7kj$DJMmB3!$IMbvr;#X)JN&iBsr=C2|S#c(iy@hIhJxBc(qD!OjW5( zQz3b){Dv^|QzAwPka%EaWt9gh37TwED`je(jBDMLG7*lUokCZoKfv~`w6~?{A^1u9 z(R%~jZHK`qM{x)-t=GH*2UdnfPK z&Ng;=-`RNYlXFDxYm{GOmiLn@gDUmp#9gPJz@$WSV6HsYqIdFG_wr1fTYE0%JnT98 z^qiu3c{RPpsx7Xyt3r=oUgNah0X6@@Z!>Um-sNew&VRJF@42-boQPO z9Pyiq_jiq9uDr#=^!;|ynVUni$37KXs=6)dExDA(&_EC H@8|y?a0@Hr literal 0 HcmV?d00001 diff --git a/volcengine_bidirection_demo/.idea/.gitignore b/volcengine_bidirection_demo/.idea/.gitignore new file mode 100644 index 0000000..10b731c --- /dev/null +++ b/volcengine_bidirection_demo/.idea/.gitignore @@ -0,0 +1,5 @@ +# 默认忽略的文件 +/shelf/ +/workspace.xml +# 基于编辑器的 HTTP 客户端请求 +/httpRequests/ diff --git a/volcengine_bidirection_demo/.idea/inspectionProfiles/Project_Default.xml b/volcengine_bidirection_demo/.idea/inspectionProfiles/Project_Default.xml new file mode 100644 index 0000000..7d133ac --- /dev/null +++ b/volcengine_bidirection_demo/.idea/inspectionProfiles/Project_Default.xml @@ -0,0 +1,12 @@ + + + + \ No newline at end of file diff --git a/volcengine_bidirection_demo/.idea/inspectionProfiles/profiles_settings.xml b/volcengine_bidirection_demo/.idea/inspectionProfiles/profiles_settings.xml new file mode 100644 index 0000000..105ce2d --- /dev/null +++ b/volcengine_bidirection_demo/.idea/inspectionProfiles/profiles_settings.xml @@ -0,0 +1,6 @@ + + + + \ No newline at end of file diff --git a/volcengine_bidirection_demo/.idea/misc.xml b/volcengine_bidirection_demo/.idea/misc.xml new file mode 100644 index 0000000..e771fc7 --- /dev/null +++ b/volcengine_bidirection_demo/.idea/misc.xml @@ -0,0 +1,7 @@ + + + + + + \ No newline at end of file diff --git a/volcengine_bidirection_demo/.idea/modules.xml b/volcengine_bidirection_demo/.idea/modules.xml new file mode 100644 index 0000000..c9aca6f --- /dev/null +++ b/volcengine_bidirection_demo/.idea/modules.xml @@ -0,0 +1,8 @@ + + + + + + + + \ No newline at end of file diff --git a/volcengine_bidirection_demo/.idea/vcs.xml b/volcengine_bidirection_demo/.idea/vcs.xml new file mode 100644 index 0000000..6c0b863 --- /dev/null +++ b/volcengine_bidirection_demo/.idea/vcs.xml @@ -0,0 +1,6 @@ + + + + + + \ No newline at end of file diff --git a/volcengine_bidirection_demo/.idea/volcengine_bidirection_demo.iml b/volcengine_bidirection_demo/.idea/volcengine_bidirection_demo.iml new file mode 100644 index 0000000..86c78fd --- /dev/null +++ b/volcengine_bidirection_demo/.idea/volcengine_bidirection_demo.iml @@ -0,0 +1,14 @@ + + + + + + + + + + + + \ No newline at end of file diff --git a/volcengine_bidirection_demo/examples/volcengine/bidirection.py b/volcengine_bidirection_demo/examples/volcengine/bidirection.py new file mode 100644 index 0000000..99ee8ba --- /dev/null +++ b/volcengine_bidirection_demo/examples/volcengine/bidirection.py @@ -0,0 +1,169 @@ +#!/usr/bin/env python3 +import argparse +import asyncio +import copy +import json +import logging +import uuid + +import websockets + +from protocols import ( + EventType, + MsgType, + finish_connection, + finish_session, + receive_message, + start_connection, + start_session, + task_request, + wait_for_event, +) + +logging.basicConfig(level=logging.INFO) +logger = logging.getLogger(__name__) + + +def get_resource_id(voice: str) -> str: + if voice.startswith("S_"): + return "volc.megatts.default" + return "volc.service_type.10029" + + +async def main(): + parser = argparse.ArgumentParser() + parser.add_argument("--appid", required=False, help="APP ID", default='7069844318') + parser.add_argument("--access_token", required=False, help="Access Token", default='osFMEJr20SSTWRql43cJlZkAOg7iwvxu') + parser.add_argument("--resource_id", default="", help="seed-tts-2.0") + parser.add_argument("--text", required=False, help="Text to convert", default='测试一下豆包的tts') + parser.add_argument("--voice_type", default="zh_female_xueayi_saturn_bigtts", required=False, help="Voice type") + parser.add_argument("--encoding", default="mp3", help="Output file encoding") + parser.add_argument( + "--endpoint", + default="wss://openspeech.bytedance.com/api/v3/tts/bidirection", + help="WebSocket endpoint URL", + ) + + args = parser.parse_args() + + # Connect to server + headers = { + "X-Api-App-Key": args.appid, + "X-Api-Access-Key": args.access_token, + "X-Api-Resource-Id": ( + args.resource_id if args.resource_id else get_resource_id(args.voice_type) + ), + "X-Api-Connect-Id": str(uuid.uuid4()), + } + + logger.info(f"Connecting to {args.endpoint} with headers: {headers}") + websocket = await websockets.connect( + args.endpoint, additional_headers=headers, max_size=10 * 1024 * 1024 + ) + logger.info( + f"Connected to WebSocket server, Logid: {websocket.response.headers['x-tt-logid']}", + ) + + try: + # Start connection + await start_connection(websocket) + await wait_for_event( + websocket, MsgType.FullServerResponse, EventType.ConnectionStarted + ) + + # Process each sentence + sentences = args.text.split("。") + audio_received = False + + for i, sentence in enumerate(sentences): + if not sentence: + continue + + # every session can have different parameters + base_request = { + "user": { + "uid": str(uuid.uuid4()), + }, + "namespace": "BidirectionalTTS", + "req_params": { + "speaker": args.voice_type, + "audio_params": { + "format": args.encoding, + "sample_rate": 24000, + "enable_timestamp": True, + }, + "additions": json.dumps( + { + "disable_markdown_filter": False, + } + ), + }, + } + + # Start session + start_session_request = copy.deepcopy(base_request) + start_session_request["event"] = EventType.StartSession + session_id = str(uuid.uuid4()) + await start_session( + websocket, json.dumps(start_session_request).encode(), session_id + ) + await wait_for_event( + websocket, MsgType.FullServerResponse, EventType.SessionStarted + ) + + # Send characters one by one + async def send_chars(): + for char in sentence: + synthesis_request = copy.deepcopy(base_request) + synthesis_request["event"] = EventType.TaskRequest + synthesis_request["req_params"]["text"] = char + await task_request( + websocket, json.dumps(synthesis_request).encode(), session_id + ) + await asyncio.sleep(0.005) # 5ms delay between characters + + await finish_session(websocket, session_id) + + # Start sending characters in background + send_task = asyncio.create_task(send_chars()) + + # Receive audio data + audio_data = bytearray() + while True: + msg = await receive_message(websocket) + + if msg.type == MsgType.FullServerResponse: + if msg.event == EventType.SessionFinished: + break + elif msg.type == MsgType.AudioOnlyServer: + if not audio_received and len(audio_data) > 0: + audio_received = True + audio_data.extend(msg.payload) + else: + raise RuntimeError(f"TTS conversion failed: {msg}") + + # Wait for send_chars to complete + await send_task + + # Save audio file if we received any data + if audio_data: + filename = f"{args.voice_type}_session_{i}.{args.encoding}" + with open(filename, "wb") as f: + f.write(audio_data) + logger.info(f"Audio received: {len(audio_data)}, saved to {filename}") + + if not audio_received: + raise RuntimeError("No audio data received") + + finally: + # Finish connection + await finish_connection(websocket) + msg = await wait_for_event( + websocket, MsgType.FullServerResponse, EventType.ConnectionFinished + ) + await websocket.close() + logger.info("Connection closed") + + +if __name__ == "__main__": + asyncio.run(main()) diff --git a/volcengine_bidirection_demo/protocols/__init__.py b/volcengine_bidirection_demo/protocols/__init__.py new file mode 100644 index 0000000..00d9367 --- /dev/null +++ b/volcengine_bidirection_demo/protocols/__init__.py @@ -0,0 +1,41 @@ +from .protocols import ( + CompressionBits, + EventType, + HeaderSizeBits, + Message, + MsgType, + MsgTypeFlagBits, + SerializationBits, + VersionBits, + audio_only_client, + cancel_session, + finish_connection, + finish_session, + full_client_request, + receive_message, + start_connection, + start_session, + task_request, + wait_for_event, +) + +__all__ = [ + "CompressionBits", + "EventType", + "HeaderSizeBits", + "Message", + "MsgType", + "MsgTypeFlagBits", + "SerializationBits", + "VersionBits", + "audio_only_client", + "cancel_session", + "finish_connection", + "finish_session", + "full_client_request", + "receive_message", + "start_connection", + "start_session", + "task_request", + "wait_for_event", +] diff --git a/volcengine_bidirection_demo/protocols/__pycache__/__init__.cpython-313.pyc b/volcengine_bidirection_demo/protocols/__pycache__/__init__.cpython-313.pyc new file mode 100644 index 0000000000000000000000000000000000000000..cacb2e6cc772fc47a4b6fb42c357c9dc91a1ba75 GIT binary patch literal 691 zcmZXRJ&zMH5Qe>*kImQaW|J!r6%9owK(q)U!2v=>cM=Lvtz?g|fzVU#+3C?>9BLxnsr7*WexNNQ} zWiCXas|pH|amoJZkTRaH%5wi+Abehdu`Wd@K&?S6_f-y!m1zIfiEmF1G6O5kI8=aUoHtx;QD=+dAc6~iW>MQ9TuLWj^L&|I-k7!YDYLP!ZiLPi)7#)K0O z7YQMKH{u7|`Ym(kr%&<^#(S1O&R>GLw7Sl%Z}2%em#=kMK($a6h)-&!e9z>Nn88x# z$7*vSyoXkZhxNvFo-XxlRl+m8>*Z<&{sp~h B&-VZT literal 0 HcmV?d00001 diff --git a/volcengine_bidirection_demo/protocols/__pycache__/protocols.cpython-313.pyc b/volcengine_bidirection_demo/protocols/__pycache__/protocols.cpython-313.pyc new file mode 100644 index 0000000000000000000000000000000000000000..709b05f4de47a77537f12dd2b6856484854c9371 GIT binary patch literal 26949 zcmeHwZE#!HmDqd00|?^#iv+(3euyL}Q4}dkqG-!9MSYQyD2q>Y91{%`vk)FvI#ZFj=%WM-A=cGpqTt<&9ZfIwa#FI=xWo9Wb@?F>?} z&92+&_MH1Z@BluNlH+vqBiG`2_nv$1$Gi93bIv{Y;`yP?W@aFKn3_B9J;pG9g9$m9 zq{zdBj$z(pc!p_S`1F%jN)FQzibO)^B4L3$ITeeKspgZBW}bO? z6tHhHK?c_YtOb_nc^%<+Ju&bcG4cjd#2bl;FCxXfiJ19fVhI)#EAXnVOUDC$0zcS! zD{)NP0(PP3RBZC>E0@C`+Mw3ivQyz$EHoMR#{uOJL#M(d6rY-o5^ViLTr3~bSTV*d z2&@Pk00bim$7e`%Oj=TaVi;UV`1ddf;7w+j8G>hFXps;hs7sro5d;C`$U~s2zz(8d zx4w}H=m%#_(z~<>Y~UT8z(qrs!h+#SC^8d%hZVS3I5H8#&iRGYeLcb9SeV3u9l^ul z*v0ttP{`1Mz=y^=8XEkCz1{)ZR-&4rcV zyRO9cKEOQ07kdXd#3`6YN3r`*qj_}n()9RD1mo7x(HCbz5h=$pIyx~$V(|#{G&&90 z(2McuF^u#_;kBp61=rD;NTe?^6^_P-!Y|IiD+&(!lBc7QS46zvMjAd$u7t@@ICgnD z8Vjq4#0gpVHij`yoOMMBLK`ZHX4e@$<(qX8{!aP6ESQI$JPJ9 zYMVQfahJ@U$T+=o{TX*D#!9}}FOC`(&>l5hqmMRflcqqiV0ji67c3e&S^+3KYn3qK z7%9U;+98wdLLd&0dE?A!JaBt}K`8Ke=T2rk-Y=dM#|LRYk@0bX@R$N&HA@u@9ik_o?%DD@y#G=- zetvqqaD`FsLG80O_vnX0FA3ZLe|k_bo;^>dCgOszZzdL>zN9%IN3c=^*coL&8XlM} zbA1_$eeQ6^=9)X2v3b6DR2&eb)gBNO|68w}$)bQsaP&=Ix=cU`%WLN_l%4gdup117 zY7B}uUO^yWK&c7bvDvB1WB{txeD#x&;BsS{;~`0C1ABU#>C%R2huk0EE1 zx8}f1F@Tw305io1W{Qzmz+|z)pAF0wJN!AobaC=#;^HmD4F-#cw-GOI2b0%9N_i(3 zwN6sTyGS|jCKbGgRPtT|#v`fbOGypyBei@P@$==Rj;|o~d?jh%t4JeXO}6nhq=~O3 z&Agwq@O31>*OOMhfo$g+$qs%SY2%y7PQID6^DV($U@`@$$<)EOlFrHPfgM6ImAceu z!ndC-rD<)GDW?a>L7@F`H-at%;|RhCCJ_7%f}02y5xj-q>j>UM@IwS20hrnWdTi=5 z2u2aSfM62Ac?44kE+Dvv;QI*v48azKY;F0OEv({_(6h zvogFb#0@&Wu+cey_?f7iV7xpzAf+m9qn zN5pk2s-4{%E*dfj)d>zh9wPC+>1b562Epb*#Mw~nqToC_6`hKmS7n+-49#`r@U%#H zT(Dq-HiBBvXN;Wz6@KOFm!%mYEm#$ zlk*f_ypG5{kwmRNv)SQmK)n)KsdG3DuES;7@9DYYOu- zn2P{qRm=f$AZG}I{p>3Pi`wY|Q_xqI;Jg`^du{;G<<#G6H;_SWX~t7B zcM?dvKClM>oT2~_rR8&j833n6pk!rSURtLIZA}1J7%Wh1#_5?m4iB{Ry_u3SC{ImO zhZ~GC(fF^dL1Q0l1vmG%oqrTqeqP@Wz$00P6q-_sZBv2C#DBwWxiWEDx&kQ4Zgl7c2n^ z6QwBAq$m%T0Yx!VfF7<0Rzk`mrK)JkN>esc9jt*oyOgS>DF;nCi9c8ec`i%^>%p~E z$9s4N+&x~@tBND5f%gRKK--p3ZQCf(l`1Z*ZIIs-Y!0>z4XuCMc9t*g(&3chAJkGt zYiWI~GUc?)cD_Qp4d^xYrjk+JZ`So^@^6VSzsuhNIlKK`{yqM^ z{(b(Bi7{_)`-J|3K0%Q8*tE}xk+zw*`Ggdu@q>rTkJc*^i5NdRHe#3t46Ui9i|(`n z5)L1ED6yOxrGfcG-!6YQDE3^vEmGcvb{Ui=I<&^c{^#K1yq#F8rCU7`>Y6^GnQPlF z&RwqRj~x@=uCVy&%jmugMPz0;@-moQxWSZWypSH#+BE?aOijquP@a0q-y!jcRxO*= zv=RNr_|JW!{Iqd9kCU^}IEi&U6M7{w9a_hPnhk7NQ_GbQ_($MOz#jppbo~4l@wsY7fOeP05HCk+CJ-c!K_Yc}Tz5-ejmUx;7`qpMS31anN> z+KhsC+dL-j#~@C}FhUG0 zJ?7y(0BWCMaPqk>-nd^EH4Gbupj=_d_0rD_8{j;oXx86H!mtMe zhmm-uBWgka1ew0%KlciF-s zivpNq){KnRF&}?z|H6x}9awc&W!$|#Xn1%0`+;{W6V6i)^*WC|%jj%&*f^9|FP?d; zXx_H!saQO)+?%XyOL=zAn^qk)i?1%vCTsVn96j^gf3~|8UQXJ#&+9WL%XQl|+rs#L zQ)R~Co;OoI%k!JyY*U^RU^aoLASni|ldO8>P&bNaU7Sptd-7}>)CPGt9tEKdxCe6Z z*rOmQrO@YI5TsHX`xvE^y`Tsru~fT03P+C{^ab8Ksvp*mxa6|K%4%qXUL0Vf9G)j& z2$ev;bwlXmDG0o-ogL=dpe}hG0B5s9KwlU}U`2`{*N&(ki1%1w{=Ux9X;*g`z{a`1((i zuL6!-N1&`A@;WBpK=8W&1S2>i!r(G6yhNtraF{9bymfRk93Q195)(|2pog4+B7!3! z7|+d2OoWMG6a_790_ETM_*8UKD3Z$=r3lI$Nezh0t4La=aPB3Fj-3+X$3PiFFvtAN z<+)k$dc_-6^F~-ZcK7w*wcz5Jq^)MDF5OGt@~ErvhkZI zlBMklOZ)u3_bu&k`gi@*wNr~7iw#RfZ?)aGwmdM|uUoHKzc#$M_lFV_Z zcI(xfU3Jg|~RRSIv|8dS0*A2g6K6kpLrjj!46>9<+u^GXRw$3$|(# z`1sL!#f_j`7u$nt1qHoQB+Q7iW{0_Ty;5WiuLl{SAzyG^M-99oYJBclNhTC2G6Cd< zc3+2!a;p>SRo1=S-`vHRsAMFkcC>xa`}Czs}hVUvtziwX44RL_^Qr zP_p4*%J=j<_hsv9WgyYo`|d!pbud+VdY-#)Dua^6j_a0dmWAFg+aa-S`<)ZFPpq)t z99-#0HttE7>Q<|FCfbj`*PCoVm8u@ZLKUl(t%>c2-70M^eM=|GsT0>uEL!hdw?SK5NF)ljT3L2nlJvq;stXhQTx>0SMFX+ zR1c)wClb~ZSv_MdS#M`3w(DIgsoEK8LBQA*h7m=+Y1tP&&w)N}hPB5Ip-w0W+SUbN zm9?HL(5_l-+UtKru`7n0xpHz$mFt#qxu+^u!@sJ^)wuMh%EkL91){P4Z#HbRaeWz8 zn`I-w4`QI!o`xjPmxLR(Ba2eGI(X*V8D_zX(#=*K3&WNJF24DvC;Xyy;-8p_((6~T zk1B?vv6;)4VUGfP6M0jEJB1#9poH!g=!F-80-XFy03iHmC8Ofr(IusF8%WXaG9i5f zf^7)!g$a%dX+qG608eZMW9af_w8b1sJ>p)I;HwF8?W%nzN?XA$QA^v;fKHUYe*k$g zT#d2>{Cy<$$`Vj*;8{Ta#r_v$&oK|&-ua>j7RUAd*Y>~dNSAda%Q{k)j*QiFeel}g z;^A~vTe7NcIi7Aml59Vcs62Y#dQ2i;wR+OlZAt4k8fi*en`op3Y%&^YNLm||NY-L3 zH$P;IR&&>oh_jdEGwzt|+wr06=UFph>WM#+u*3O@yVB3GU@lOKZ4cx6vR3AyXk0z`~ADA51 z?bqxJ@wBfs>1(}j+MaQg&f7N;cYpCqi96MDRg5SYWhtm~kwFTADpy1Nsd6c-6EYg+5r_~Cv6owjRLJDIqQq2hq#^iJLPony4RNSyvus2W zhg8TYt>z*HLWUXIeBAuGl5&jp5f(EDC|v6W0mel`5CRruKtTX3uK0q`uFt&@w4pr? ztp$Z3sV=o%2#V%YP6(2FP$W?LD1r+eGNM3KL>T$^fCGsnnr)J+OcY;E5m_L;RI=0} z5l}arM4gkQf`rLAQ^bqI+L}X z_no^p6J)!RmAl@zc5EcbHWJVoS4rAcmvq%Fb)_4+lMUT>8`C|flRc*s&S%#2q8qB% zDGR|s(igaIYRw5jYOUvOQ5C~)97YkYSF=MfT!lfkcDcel27mRifg4Bpt$|dhpPAHw ztHbgsbVc~7PW?#t)YM>rBmWBO6^wB8cV;XuaF;`47s=NE1-?PL)xcdw-lTsY>2s5= z($WWT((!^UC_8CO|Lo0?*GHDTOYu9iw`Wr&o$s4=i#h?-ryP`#Sbz#Px@f-nNT_l@ zVSUiWQPU54Hi=`cp%aFbEw}taaOAES(cn1NaHXM(jo0_UK!>1oZadC%!+N+DZ`iF! zBy>S*I?faWSxYMbXBda|>$w10EuyW0cG9j_z1f~*;g=7lS*OS~lEm=$A0GV3FcY6> z>;7AGvHZi;f4Hh=X5lI*y|x6|;?3BWk4ggIj~)w$$7B9Wp_f}`rlRrPodMvxe!7*0 zoiQ>Rz2HL5VGLISnLuzJ!S4V7FItoy1fWZe?tv-8lKYr^9{_N$!l!~WC)FeuGlwS? zFRMnuVBbv7rLY zE(4fdR>tOeP+5EH;9CbpyJ@94RoRm;m90A52~R`H(Kyd#ERKcNl%#23iCsnfJzNrlh)xFk@JJXZbPA19&?^|1OTj||oP2rgSf08aGGM|XH zwI6g}tkl6~)+x;GgK0qV~?DbxIgj%?td zR}@arWN`)lKQZut2XUn@5LX%=h!MpQ*YY`lxZ*(YNJ>F&)sG@dqb?A`YV{%YC0AxjXWM}@aF^E%j76`x(=5Q}`-F))Kli;_`69J2#Umjn6HnID7qPjoj9!OXR zHj)6MUR^kQGk7ETzNvnb8U8J3a-)Tx^Je4B$`)}bpgtWP;h+KWV{w{O+h z)dDN%Rjk0FbfESPM+HVVwKOzrB(P7QHyEPaNQoE&T296e>*>A^wEHlpwI|~Z3MCU! z-WY8bYPT3?9hB)*W{b#rxZp)!{!bvbr4@1k$tj0Yo8!M?Qas-q4^z30W(qKI&I&Q3 zcoDgj$_nxUP{eRpKw!us<1Zj7$iLa#DR1kj2?bXoE+X5a>HSzX2sK8~D+E3uG)6=p z5Evuin;y9_vgCT>GxO#TEG4U+@|y=`NJ89XCd_3%Ng*^KXLns z<#?*0E8+C7dP)<%=9H&p`Ebg!E7P<$-E<(?bl~n}s_E#$;WtmiLh*KF4UDr4fVFh} zl0hkgvhv|m|0qkQOHa-B7bp`dXK~OUDQqAKj{(ywET!eJ(2{>DqrPdQ_Hs-=q-+c1 zzQDF2$NWr0xhXPf5dQMXklle+$i%n*iQXS<>Xc zBbF*UoWLC0{s>ZqY@2f&d>+{r6;D3f<{8R4CN1KSNjb2X%}j;=R^?ljOJ}}OGe7Ww zqkPp@ee>1VUtK!8+>`R{U3oF-+rPkNJif)cH@Y)TJMLV(eQ~8R)wD0&^i;Cxsk<+w znvTibScTkJk+ng+n{ZurXfNk!L%V!oN=qUB8BnV%5~>ho`qyxlb^-y+QhBX1?)DEX<*QZow@!Wi)N2U3yoxbY|u-e_>=4Wu(?S8EOBpW{##Na|dP z8#tKQCJbg}-K{6ydSdCtZ#)H?y$>vvt2K?cE`9yd^5I11p;QeT7&S*>I8kU?t2PVkSOxGdg&`-f3R#&Nc2>&FvX#B%*i-vD3vCo^$rFGQO7iVD zsnVM`z{epU2KaIGSnal3pMC4I%U!A3T?^csRv7a<9i@I%)C*Kc{V_lo_^r+lIiN2H zs=+rFWINc&6$9>O@x!{+2&yU5CAHPN5kU;Tl2@jvFh)()R z7=MioH;?HJnAu|K>mEJ+S?dn}5j+byiwDq{f{!)OtH+S%*x{GF1Uy*rfUp5E-be0( z>&TF_DEU2pf*T0II5ioaCgFfXb+Xe08R9{-)=|#aFcwYt< z-071(P;v`JV+Md|ZsEbQFI~PXS-$H#&FRkmWM_Y(Y#?PB0MmYxW8m`orLH^sZ|`5) zz8r*u-PZ56-mQ8!m>7CCJv5pe8cm#eA@RcW{mZdL{N-OT%naMB`?>gd$S^Omhjbv$ zFSC94C_9YMby$}vsS$4tE?!)&QofW@d;iSY#PFxn!=dDGD0Svs;+e68XFOpYUw7=R zS-kqa_>Zps@M>akG%JkGcSZ*ti?BnOy2$eQ z@Sa6zJF9!}OOM3GMC5Wh@^UirayoJ~8MzAe_Uevf^#i&gZ26MdWQ3({mJMT;Yj}ep zseJG3kAgo8rcb?)JoQ2%bUtx`q)x>WC*ujvOu{-tZ3M98-$1@V8(riO%0JgJN%bk^ zq}MTtTTyzmEU?0UEj(~RHB*q32&@P|B80{_XSt};#YhafJJsb##FGOGCUn9;!zpNyFFoOIGr2h_r zB?PEg32vivH|hvpy&!iHd>_FN5d0|ubfA*=5TI{};C7qf=7peTOwgty2?XT`wj-!Q z09SmZuiJbDV+e3j#*TsI|J%&Zxl)5EyNju6PFJ=kE8FLe&5xwG_Dub*bp4ab`X}d3 zEYzg9Co|s4o2PG_o;y6>oZ=cXRol~59m%Q=NVliBj!biRy7@q|`M}(%gr_mZ9mq6v zibsl2yf(#kKk)f)UcGU3?#TT96xWm~Et?xy(5LXHv`WldGIxA_EQMd#@rk*<2k;x* zWAnp6_rT!H>TCwjVmQmdW4ZVtJ|5~Bql@CRHKm5S#ga7!9@$;BhLbE(;&Yi>qtEOi zw$$KT9AD~Q9{Tq4?>xVJ@@`{d$5U`QFIn?6mh)wIm2E-*d0F^PXV+5aou1o0a7*9N zwbHnTkF3dM*uJd$w)q`%mVxL>d<`GjCY@p5(z!bqZeKv^eJf{?dSBM0GwheCA&S)S z$eM}_4NF6Jp1=KkmVxNX;Wd0@-JIb#yHtOt^>%BP!T5@IjXtwhm*E(@MDP?6n?1&^ zjAOgU*ld#p%SbsG#~gfSD>y?RE4PAiYzCiME2pXr<5&itS*y{|v2^Ip!0mx71JRYP zHGE{97Q+?#qh)-GJcgVl6u%Tc7n>ft7>PsOMhSp zKhZ)H2lmPgu$Oqf_*+n3U<=Mp1&7p)QK_S(7z+G8{KftN=syHYB+FS1b}#^Le&)t! zQYG8cj&1YYs-5*smUGH6EqWWOU{dB_m^s3Fb$h{p-+Zy4A1*`7z zw7W6sZd^K>a<|U+tx6YhTbKByBZ;!s`_}F7DT4U{dV{0;kGyxs|82!xt8x|X=Pt(C z^ml7+xNZ9ogoS-oJTgi6z|pzVkSN)E-?T4dviD!Q*uEn6OP)hj%uV)C z1-IDS3ekHy#NN}FVZ6%R$La4il^;5&zjx38@$Ykb$R*#zK{AWS5;$dJu=2P>^l`^7+7D=(v_f}^?fQd754*Q`C~8!Qxj8T;#tq&tXH)JB$ffrT z1_d<_kYi=;!!adh0%{I&$N>fb`1MElR0`UG;I^XziV{%n&;wRJQxQDa@Tk}@oT$K_4z4vhp^868 z4mk~^D4^C%jK%%6m(spnN#CyTTutvgnS_7lQ}Astclno2ta9exKJiaaECd$&7WX8a zb@#dYjM;O2=e3=S9`u!dqdH}7PIF+{HUE7KmJ9QR-sav8_Im-gx1IZ5s}bVVG|m$R z3OD>mDDZgPfG6)TS}Ht~-1kh`z?Q=(mtH`kbtJt|2FB zKszbt)wwN~=Cuti?W7@JzzjuaOhM3)I-A)eHc{$GcR;Afk(kB4g{+A{!z$O+MjZ2w zT2)ae7Zp7ml+LLtn<#wbUf{g_4`iSaQ01v9*&@l8Jxxhx6J?>2+AqOZ)*jPF5yj6T z-61P`k7Ey+xqAj9#I=ppnqLJ=>9$}gori2;VT$^DQF0*P5Davl&4>w(Z}VhOVI2ih%8bIT#|QvQm~KFFOQDO zEjI#%8Pp)Dg9xby@EZ-Z$)s+kf#7!$up^GcS7E_}C+-0KxaE@Hw8k+Qt8M!ZXtU3_|oop&Lo`n4-IYZX^kA5C|H3qEi*MHbEgvaCHzI z(1If)!Stl~e|va}?1WtS$HaG=*a3J^}t?|HNX=-i{Prr7Gcc97;S6C7^^B` zTU6wjda^gGhvx%B@tOgiS?`7@nq9+I8tF--h-1Ncx2(dTb5?i x&Hc&delY{iU}#2hUi+BB_VIaoh(2jQAe}8+PkQjsCqc5l!T)K1w&=;v{{x&TIurl^ literal 0 HcmV?d00001 diff --git a/volcengine_bidirection_demo/protocols/protocols.py b/volcengine_bidirection_demo/protocols/protocols.py new file mode 100644 index 0000000..6d76488 --- /dev/null +++ b/volcengine_bidirection_demo/protocols/protocols.py @@ -0,0 +1,543 @@ +import io +import logging +import struct +from dataclasses import dataclass +from enum import IntEnum +from typing import Callable, List + +import websockets + +logger = logging.getLogger(__name__) + + +class MsgType(IntEnum): + """Message type enumeration""" + + Invalid = 0 + FullClientRequest = 0b1 + AudioOnlyClient = 0b10 + FullServerResponse = 0b1001 + AudioOnlyServer = 0b1011 + FrontEndResultServer = 0b1100 + Error = 0b1111 + + # Alias + ServerACK = AudioOnlyServer + + def __str__(self) -> str: + return self.name if self.name else f"MsgType({self.value})" + + +class MsgTypeFlagBits(IntEnum): + """Message type flag bits""" + + NoSeq = 0 # Non-terminal packet with no sequence + PositiveSeq = 0b1 # Non-terminal packet with sequence > 0 + LastNoSeq = 0b10 # Last packet with no sequence + NegativeSeq = 0b11 # Last packet with sequence < 0 + WithEvent = 0b100 # Payload contains event number (int32) + + +class VersionBits(IntEnum): + """Version bits""" + + Version1 = 1 + Version2 = 2 + Version3 = 3 + Version4 = 4 + + +class HeaderSizeBits(IntEnum): + """Header size bits""" + + HeaderSize4 = 1 + HeaderSize8 = 2 + HeaderSize12 = 3 + HeaderSize16 = 4 + + +class SerializationBits(IntEnum): + """Serialization method bits""" + + Raw = 0 + JSON = 0b1 + Thrift = 0b11 + Custom = 0b1111 + + +class CompressionBits(IntEnum): + """Compression method bits""" + + None_ = 0 + Gzip = 0b1 + Custom = 0b1111 + + +class EventType(IntEnum): + """Event type enumeration""" + + None_ = 0 # Default event + + # 1 ~ 49 Upstream Connection events + StartConnection = 1 + StartTask = 1 # Alias of StartConnection + FinishConnection = 2 + FinishTask = 2 # Alias of FinishConnection + + # 50 ~ 99 Downstream Connection events + ConnectionStarted = 50 # Connection established successfully + TaskStarted = 50 # Alias of ConnectionStarted + ConnectionFailed = 51 # Connection failed (possibly due to authentication failure) + TaskFailed = 51 # Alias of ConnectionFailed + ConnectionFinished = 52 # Connection ended + TaskFinished = 52 # Alias of ConnectionFinished + + # 100 ~ 149 Upstream Session events + StartSession = 100 + CancelSession = 101 + FinishSession = 102 + + # 150 ~ 199 Downstream Session events + SessionStarted = 150 + SessionCanceled = 151 + SessionFinished = 152 + SessionFailed = 153 + UsageResponse = 154 # Usage response + ChargeData = 154 # Alias of UsageResponse + + # 200 ~ 249 Upstream general events + TaskRequest = 200 + UpdateConfig = 201 + + # 250 ~ 299 Downstream general events + AudioMuted = 250 + + # 300 ~ 349 Upstream TTS events + SayHello = 300 + + # 350 ~ 399 Downstream TTS events + TTSSentenceStart = 350 + TTSSentenceEnd = 351 + TTSResponse = 352 + TTSEnded = 359 + PodcastRoundStart = 360 + PodcastRoundResponse = 361 + PodcastRoundEnd = 362 + + # 450 ~ 499 Downstream ASR events + ASRInfo = 450 + ASRResponse = 451 + ASREnded = 459 + + # 500 ~ 549 Upstream dialogue events + ChatTTSText = 500 # (Ground-Truth-Alignment) text for speech synthesis + + # 550 ~ 599 Downstream dialogue events + ChatResponse = 550 + ChatEnded = 559 + + # 650 ~ 699 Downstream dialogue events + # Events for source (original) language subtitle + SourceSubtitleStart = 650 + SourceSubtitleResponse = 651 + SourceSubtitleEnd = 652 + # Events for target (translation) language subtitle + TranslationSubtitleStart = 653 + TranslationSubtitleResponse = 654 + TranslationSubtitleEnd = 655 + + def __str__(self) -> str: + return self.name if self.name else f"EventType({self.value})" + + +@dataclass +class Message: + """Message object + + Message format: + 0 1 2 3 + | 0 1 2 3 4 5 6 7 | 0 1 2 3 4 5 6 7 | 0 1 2 3 4 5 6 7 | 0 1 2 3 4 5 6 7 | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Version | Header Size | Msg Type | Flags | + | (4 bits) | (4 bits) | (4 bits) | (4 bits) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Serialization | Compression | Reserved | + | (4 bits) | (4 bits) | (8 bits) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | | + | Optional Header Extensions | + | (if Header Size > 1) | + | | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | | + | Payload | + | (variable length) | + | | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + """ + + version: VersionBits = VersionBits.Version1 + header_size: HeaderSizeBits = HeaderSizeBits.HeaderSize4 + type: MsgType = MsgType.Invalid + flag: MsgTypeFlagBits = MsgTypeFlagBits.NoSeq + serialization: SerializationBits = SerializationBits.JSON + compression: CompressionBits = CompressionBits.None_ + + event: EventType = EventType.None_ + session_id: str = "" + connect_id: str = "" + sequence: int = 0 + error_code: int = 0 + + payload: bytes = b"" + + @classmethod + def from_bytes(cls, data: bytes) -> "Message": + """Create message object from bytes""" + if len(data) < 3: + raise ValueError( + f"Data too short: expected at least 3 bytes, got {len(data)}" + ) + + type_and_flag = data[1] + msg_type = MsgType(type_and_flag >> 4) + flag = MsgTypeFlagBits(type_and_flag & 0b00001111) + + msg = cls(type=msg_type, flag=flag) + msg.unmarshal(data) + return msg + + def marshal(self) -> bytes: + """Serialize message to bytes""" + buffer = io.BytesIO() + + # Write header + header = [ + (self.version << 4) | self.header_size, + (self.type << 4) | self.flag, + (self.serialization << 4) | self.compression, + ] + + header_size = 4 * self.header_size + if padding := header_size - len(header): + header.extend([0] * padding) + + buffer.write(bytes(header)) + + # Write other fields + writers = self._get_writers() + for writer in writers: + writer(buffer) + + return buffer.getvalue() + + def unmarshal(self, data: bytes) -> None: + """Deserialize message from bytes""" + buffer = io.BytesIO(data) + + # Read version and header size + version_and_header_size = buffer.read(1)[0] + self.version = VersionBits(version_and_header_size >> 4) + self.header_size = HeaderSizeBits(version_and_header_size & 0b00001111) + + # Skip second byte + buffer.read(1) + + # Read serialization and compression methods + serialization_compression = buffer.read(1)[0] + self.serialization = SerializationBits(serialization_compression >> 4) + self.compression = CompressionBits(serialization_compression & 0b00001111) + + # Skip header padding + header_size = 4 * self.header_size + read_size = 3 + if padding_size := header_size - read_size: + buffer.read(padding_size) + + # Read other fields + readers = self._get_readers() + for reader in readers: + reader(buffer) + + # Check for remaining data + remaining = buffer.read() + if remaining: + raise ValueError(f"Unexpected data after message: {remaining}") + + def _get_writers(self) -> List[Callable[[io.BytesIO], None]]: + """Get list of writer functions""" + writers = [] + + if self.flag == MsgTypeFlagBits.WithEvent: + writers.extend([self._write_event, self._write_session_id]) + + if self.type in [ + MsgType.FullClientRequest, + MsgType.FullServerResponse, + MsgType.FrontEndResultServer, + MsgType.AudioOnlyClient, + MsgType.AudioOnlyServer, + ]: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + writers.append(self._write_sequence) + elif self.type == MsgType.Error: + writers.append(self._write_error_code) + else: + raise ValueError(f"Unsupported message type: {self.type}") + + writers.append(self._write_payload) + return writers + + def _get_readers(self) -> List[Callable[[io.BytesIO], None]]: + """Get list of reader functions""" + readers = [] + + if self.type in [ + MsgType.FullClientRequest, + MsgType.FullServerResponse, + MsgType.FrontEndResultServer, + MsgType.AudioOnlyClient, + MsgType.AudioOnlyServer, + ]: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + readers.append(self._read_sequence) + elif self.type == MsgType.Error: + readers.append(self._read_error_code) + else: + raise ValueError(f"Unsupported message type: {self.type}") + + if self.flag == MsgTypeFlagBits.WithEvent: + readers.extend( + [self._read_event, self._read_session_id, self._read_connect_id] + ) + + readers.append(self._read_payload) + return readers + + def _write_event(self, buffer: io.BytesIO) -> None: + """Write event""" + buffer.write(struct.pack(">i", self.event)) + + def _write_session_id(self, buffer: io.BytesIO) -> None: + """Write session ID""" + if self.event in [ + EventType.StartConnection, + EventType.FinishConnection, + EventType.ConnectionStarted, + EventType.ConnectionFailed, + ]: + return + + session_id_bytes = self.session_id.encode("utf-8") + size = len(session_id_bytes) + if size > 0xFFFFFFFF: + raise ValueError(f"Session ID size ({size}) exceeds max(uint32)") + + buffer.write(struct.pack(">I", size)) + if size > 0: + buffer.write(session_id_bytes) + + def _write_sequence(self, buffer: io.BytesIO) -> None: + """Write sequence number""" + buffer.write(struct.pack(">i", self.sequence)) + + def _write_error_code(self, buffer: io.BytesIO) -> None: + """Write error code""" + buffer.write(struct.pack(">I", self.error_code)) + + def _write_payload(self, buffer: io.BytesIO) -> None: + """Write payload""" + size = len(self.payload) + if size > 0xFFFFFFFF: + raise ValueError(f"Payload size ({size}) exceeds max(uint32)") + + buffer.write(struct.pack(">I", size)) + buffer.write(self.payload) + + def _read_event(self, buffer: io.BytesIO) -> None: + """Read event""" + event_bytes = buffer.read(4) + if event_bytes: + self.event = EventType(struct.unpack(">i", event_bytes)[0]) + + def _read_session_id(self, buffer: io.BytesIO) -> None: + """Read session ID""" + if self.event in [ + EventType.StartConnection, + EventType.FinishConnection, + EventType.ConnectionStarted, + EventType.ConnectionFailed, + EventType.ConnectionFinished, + ]: + return + + size_bytes = buffer.read(4) + if size_bytes: + size = struct.unpack(">I", size_bytes)[0] + if size > 0: + session_id_bytes = buffer.read(size) + if len(session_id_bytes) == size: + self.session_id = session_id_bytes.decode("utf-8") + + def _read_connect_id(self, buffer: io.BytesIO) -> None: + """Read connection ID""" + if self.event in [ + EventType.ConnectionStarted, + EventType.ConnectionFailed, + EventType.ConnectionFinished, + ]: + size_bytes = buffer.read(4) + if size_bytes: + size = struct.unpack(">I", size_bytes)[0] + if size > 0: + self.connect_id = buffer.read(size).decode("utf-8") + + def _read_sequence(self, buffer: io.BytesIO) -> None: + """Read sequence number""" + sequence_bytes = buffer.read(4) + if sequence_bytes: + self.sequence = struct.unpack(">i", sequence_bytes)[0] + + def _read_error_code(self, buffer: io.BytesIO) -> None: + """Read error code""" + error_code_bytes = buffer.read(4) + if error_code_bytes: + self.error_code = struct.unpack(">I", error_code_bytes)[0] + + def _read_payload(self, buffer: io.BytesIO) -> None: + """Read payload""" + size_bytes = buffer.read(4) + if size_bytes: + size = struct.unpack(">I", size_bytes)[0] + if size > 0: + self.payload = buffer.read(size) + + def __str__(self) -> str: + """String representation""" + if self.type in [MsgType.AudioOnlyServer, MsgType.AudioOnlyClient]: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + return f"MsgType: {self.type}, EventType:{self.event}, Sequence: {self.sequence}, PayloadSize: {len(self.payload)}" + return f"MsgType: {self.type}, EventType:{self.event}, PayloadSize: {len(self.payload)}" + elif self.type == MsgType.Error: + return f"MsgType: {self.type}, EventType:{self.event}, ErrorCode: {self.error_code}, Payload: {self.payload.decode('utf-8', 'ignore')}" + else: + if self.flag in [MsgTypeFlagBits.PositiveSeq, MsgTypeFlagBits.NegativeSeq]: + return f"MsgType: {self.type}, EventType:{self.event}, Sequence: {self.sequence}, Payload: {self.payload.decode('utf-8', 'ignore')}" + return f"MsgType: {self.type}, EventType:{self.event}, Payload: {self.payload.decode('utf-8', 'ignore')}" + + +async def receive_message(websocket: websockets.WebSocketClientProtocol) -> Message: + """Receive message from websocket""" + try: + data = await websocket.recv() + if isinstance(data, str): + raise ValueError(f"Unexpected text message: {data}") + elif isinstance(data, bytes): + msg = Message.from_bytes(data) + logger.info(f"Received: {msg}") + return msg + else: + raise ValueError(f"Unexpected message type: {type(data)}") + except Exception as e: + logger.error(f"Failed to receive message: {e}") + raise + + +async def wait_for_event( + websocket: websockets.WebSocketClientProtocol, + msg_type: MsgType, + event_type: EventType, +) -> Message: + """Wait for specific event""" + while True: + msg = await receive_message(websocket) + if msg.type != msg_type or msg.event != event_type: + raise ValueError(f"Unexpected message: {msg}") + if msg.type == msg_type and msg.event == event_type: + return msg + + +async def full_client_request( + websocket: websockets.WebSocketClientProtocol, payload: bytes +) -> None: + """Send full client message""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.NoSeq) + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def audio_only_client( + websocket: websockets.WebSocketClientProtocol, payload: bytes, flag: MsgTypeFlagBits +) -> None: + """Send audio-only client message""" + msg = Message(type=MsgType.AudioOnlyClient, flag=flag) + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def start_connection(websocket: websockets.WebSocketClientProtocol) -> None: + """Start connection""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.StartConnection + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def finish_connection(websocket: websockets.WebSocketClientProtocol) -> None: + """Finish connection""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.FinishConnection + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def start_session( + websocket: websockets.WebSocketClientProtocol, payload: bytes, session_id: str +) -> None: + """Start session""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.StartSession + msg.session_id = session_id + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def finish_session( + websocket: websockets.WebSocketClientProtocol, session_id: str +) -> None: + """Finish session""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.FinishSession + msg.session_id = session_id + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def cancel_session( + websocket: websockets.WebSocketClientProtocol, session_id: str +) -> None: + """Cancel session""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.CancelSession + msg.session_id = session_id + msg.payload = b"{}" + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) + + +async def task_request( + websocket: websockets.WebSocketClientProtocol, payload: bytes, session_id: str +) -> None: + """Send task request""" + msg = Message(type=MsgType.FullClientRequest, flag=MsgTypeFlagBits.WithEvent) + msg.event = EventType.TaskRequest + msg.session_id = session_id + msg.payload = payload + logger.info(f"Sending: {msg}") + await websocket.send(msg.marshal()) diff --git a/volcengine_bidirection_demo/pyproject.toml b/volcengine_bidirection_demo/pyproject.toml new file mode 100644 index 0000000..827d227 --- /dev/null +++ b/volcengine_bidirection_demo/pyproject.toml @@ -0,0 +1,11 @@ +[build-system] +requires = ["setuptools>=42", "wheel"] +build-backend = "setuptools.build_meta" + +[project] +name = "volc-speech-python-sdk" +version = "0.1.0" +requires-python = ">=3.9" +dependencies = [ + "websockets>=14.0", +] diff --git a/volcengine_bidirection_demo/setup.py b/volcengine_bidirection_demo/setup.py new file mode 100644 index 0000000..7af91dd --- /dev/null +++ b/volcengine_bidirection_demo/setup.py @@ -0,0 +1,13 @@ +from setuptools import find_packages, setup + +setup( + name="volc-speech-python-sdk", + version="0.1.0", + packages=find_packages(include=["protocols"]), + install_requires=[ + "websockets>=14.0", + ], + python_requires=">=3.9", +) + +python examples/volcengine/bidirection.py --appid 7069844318 --access_token osFMEJr20SSTWRql43cJlZkAOg7iwvxu --voice_type zh_female_tianxinxiaomei_emo_v2_mars_bigtts --text "你好，我是火山引擎的语音合成服务。这是一个美好的旅程。" \ No newline at end of file diff --git a/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/PKG-INFO b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/PKG-INFO new file mode 100644 index 0000000..7b6a7ab --- /dev/null +++ b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/PKG-INFO @@ -0,0 +1,6 @@ +Metadata-Version: 2.4 +Name: volc-speech-python-sdk +Version: 0.1.0 +Requires-Python: >=3.9 +Requires-Dist: websockets>=14.0 +Dynamic: requires-python diff --git a/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/SOURCES.txt b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/SOURCES.txt new file mode 100644 index 0000000..63667dd --- /dev/null +++ b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/SOURCES.txt @@ -0,0 +1,9 @@ +pyproject.toml +setup.py +protocols/__init__.py +protocols/protocols.py +volc_speech_python_sdk.egg-info/PKG-INFO +volc_speech_python_sdk.egg-info/SOURCES.txt +volc_speech_python_sdk.egg-info/dependency_links.txt +volc_speech_python_sdk.egg-info/requires.txt +volc_speech_python_sdk.egg-info/top_level.txt \ No newline at end of file diff --git a/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/dependency_links.txt b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/dependency_links.txt new file mode 100644 index 0000000..8b13789 --- /dev/null +++ b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/dependency_links.txt @@ -0,0 +1 @@ + diff --git a/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/requires.txt b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/requires.txt new file mode 100644 index 0000000..e3c64eb --- /dev/null +++ b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/requires.txt @@ -0,0 +1 @@ +websockets>=14.0 diff --git a/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/top_level.txt b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/top_level.txt new file mode 100644 index 0000000..64a4ea1 --- /dev/null +++ b/volcengine_bidirection_demo/volc_speech_python_sdk.egg-info/top_level.txt @@ -0,0 +1 @@ +protocols diff --git a/测试流式传输uniapp/node_modules/.package-lock.json b/测试流式传输uniapp/node_modules/.package-lock.json new file mode 100644 index 0000000..e20d4fd --- /dev/null +++ b/测试流式传输uniapp/node_modules/.package-lock.json @@ -0,0 +1,20 @@ +{ + "name": "测试流式传输uniapp", + "lockfileVersion": 3, + "requires": true, + "packages": { + "node_modules/@types/pako": { + "version": "2.0.4", + "resolved": "https://registry.npmmirror.com/@types/pako/-/pako-2.0.4.tgz", + "integrity": "sha512-VWDCbrLeVXJM9fihYodcLiIv0ku+AlOa/TQ1SvYOaBuyrSKgEcro95LJyIsJ4vSo6BXIxOKxiJAat04CmST9Fw==", + "dev": true, + "license": "MIT" + }, + "node_modules/pako": { + "version": "2.1.0", + "resolved": "https://registry.npmmirror.com/pako/-/pako-2.1.0.tgz", + "integrity": "sha512-w+eufiZ1WuJYgPXbV/PO3NCMEc3xqylkKHzp8bxp1uW4qaSNQUkwmLLEc3kKsfz8lpV1F8Ht3U1Cm+9Srog2ug==", + "license": "(MIT AND Zlib)" + } + } +} diff --git a/测试流式传输uniapp/node_modules/@types/pako/LICENSE b/测试流式传输uniapp/node_modules/@types/pako/LICENSE new file mode 100644 index 0000000..9e841e7 --- /dev/null +++ b/测试流式传输uniapp/node_modules/@types/pako/LICENSE @@ -0,0 +1,21 @@ + MIT License + + Copyright (c) Microsoft Corporation. + + Permission is hereby granted, free of charge, to any person obtaining a copy + of this software and associated documentation files (the "Software"), to deal + in the Software without restriction, including without limitation the rights + to use, copy, modify, merge, publish, distribute, sublicense, and/or sell + copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all + copies or substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR + IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, + FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE + AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER + LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE + SOFTWARE diff --git a/测试流式传输uniapp/node_modules/@types/pako/README.md b/测试流式传输uniapp/node_modules/@types/pako/README.md new file mode 100644 index 0000000..2c5125b --- /dev/null +++ b/测试流式传输uniapp/node_modules/@types/pako/README.md @@ -0,0 +1,15 @@ +# Installation +> `npm install --save @types/pako` + +# Summary +This package contains type definitions for pako (https://github.com/nodeca/pako). + +# Details +Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/pako. + +### Additional Details + * Last updated: Fri, 15 Aug 2025 08:39:32 GMT + * Dependencies: none + +# Credits +These definitions were written by [Caleb Eggensperger](https://github.com/calebegg), [Muhammet Öztürk](https://github.com/hlthi), and [Thibault Poisson](https://github.com/OrIOg). diff --git a/测试流式传输uniapp/node_modules/@types/pako/index.d.ts b/测试流式传输uniapp/node_modules/@types/pako/index.d.ts new file mode 100644 index 0000000..985c30a --- /dev/null +++ b/测试流式传输uniapp/node_modules/@types/pako/index.d.ts @@ -0,0 +1,161 @@ +export = Pako; +export as namespace pako; + +declare namespace Pako { + enum constants { + // FlushValues + Z_NO_FLUSH = 0, + Z_PARTIAL_FLUSH = 1, + Z_SYNC_FLUSH = 2, + Z_FULL_FLUSH = 3, + Z_FINISH = 4, + Z_BLOCK = 5, + Z_TREES = 6, + // StrategyValues + Z_FILTERED = 1, + Z_HUFFMAN_ONLY = 2, + Z_RLE = 3, + Z_FIXED = 4, + Z_DEFAULT_STRATEGY = 0, + // ReturnCodes + Z_OK = 0, + Z_STREAM_END = 1, + Z_NEED_DICT = 2, + Z_ERRNO = -1, + Z_STREAM_ERROR = -2, + Z_DATA_ERROR = -3, + Z_BUF_ERROR = -5, + } + + type FlushValues = + | constants.Z_NO_FLUSH + | constants.Z_PARTIAL_FLUSH + | constants.Z_SYNC_FLUSH + | constants.Z_FINISH + | constants.Z_BLOCK + | constants.Z_TREES; + + type StrategyValues = + | constants.Z_FILTERED + | constants.Z_HUFFMAN_ONLY + | constants.Z_RLE + | constants.Z_FIXED + | constants.Z_DEFAULT_STRATEGY; + + type ReturnCodes = + | constants.Z_OK + | constants.Z_STREAM_END + | constants.Z_NEED_DICT + | constants.Z_ERRNO + | constants.Z_STREAM_ERROR + | constants.Z_DATA_ERROR + | constants.Z_BUF_ERROR + | constants.Z_DEFAULT_STRATEGY; + + interface DeflateOptions { + level?: -1 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | undefined; + windowBits?: number | undefined; + memLevel?: number | undefined; + strategy?: StrategyValues | undefined; + dictionary?: any; + raw?: boolean | undefined; + chunkSize?: number | undefined; + gzip?: boolean | undefined; + header?: Header | undefined; + } + + interface DeflateFunctionOptions { + level?: -1 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | undefined; + windowBits?: number | undefined; + memLevel?: number | undefined; + strategy?: StrategyValues | undefined; + dictionary?: any; + raw?: boolean | undefined; + } + + interface InflateOptions { + windowBits?: number | undefined; + dictionary?: any; + raw?: boolean | undefined; + to?: "string" | undefined; + chunkSize?: number | undefined; + } + + interface InflateFunctionOptions { + windowBits?: number | undefined; + raw?: boolean | undefined; + to?: "string" | undefined; + } + + interface Header { + text?: boolean | undefined; + time?: number | undefined; + os?: number | undefined; + extra?: number[] | undefined; + name?: string | undefined; + comment?: string | undefined; + hcrc?: boolean | undefined; + } + + type Data = Uint8Array | ArrayBuffer; + + // For TS <=5.6 compatibility: Uint8Array in TS >=5.7, Uint8Array in TS <=5.6 + type Uint8ArrayReturnType = InstanceType; + + /** + * Compress data with deflate algorithm and options. + */ + function deflate(data: Data | string, options?: DeflateFunctionOptions): Uint8ArrayReturnType; + + /** + * The same as deflate, but creates raw data, without wrapper (header and adler32 crc). + */ + function deflateRaw(data: Data | string, options?: DeflateFunctionOptions): Uint8ArrayReturnType; + + /** + * The same as deflate, but create gzip wrapper instead of deflate one. + */ + function gzip(data: Data | string, options?: DeflateFunctionOptions): Uint8ArrayReturnType; + + /** + * Decompress data with inflate/ungzip and options. Autodetect format via wrapper header + * by default. That's why we don't provide separate ungzip method. + */ + function inflate(data: Data, options: InflateFunctionOptions & { to: "string" }): string; + function inflate(data: Data, options?: InflateFunctionOptions): Uint8ArrayReturnType; + + /** + * The same as inflate, but creates raw data, without wrapper (header and adler32 crc). + */ + function inflateRaw(data: Data, options: InflateFunctionOptions & { to: "string" }): string; + function inflateRaw(data: Data, options?: InflateFunctionOptions): Uint8ArrayReturnType; + + /** + * Just shortcut to inflate, because it autodetects format by header.content. Done for convenience. + */ + function ungzip(data: Data, options: InflateFunctionOptions & { to: "string" }): string; + function ungzip(data: Data, options?: InflateFunctionOptions): Uint8ArrayReturnType; + + // https://github.com/nodeca/pako/blob/893381abcafa10fa2081ce60dae7d4d8e873a658/lib/deflate.js + class Deflate { + constructor(options?: DeflateOptions); + err: ReturnCodes; + msg: string; + result: Uint8ArrayReturnType; + onData(chunk: Data): void; + onEnd(status: number): void; + push(data: Data | string, mode?: FlushValues | boolean): boolean; + } + + // https://github.com/nodeca/pako/blob/893381abcafa10fa2081ce60dae7d4d8e873a658/lib/inflate.js + class Inflate { + constructor(options?: InflateOptions); + header?: Header | undefined; + err: ReturnCodes; + msg: string; + result: Uint8ArrayReturnType | string; + onData(chunk: Data): void; + onEnd(status: number): void; + push(data: Data, mode?: FlushValues | boolean): boolean; + } +} diff --git a/测试流式传输uniapp/node_modules/@types/pako/package.json b/测试流式传输uniapp/node_modules/@types/pako/package.json new file mode 100644 index 0000000..4b4a187 --- /dev/null +++ b/测试流式传输uniapp/node_modules/@types/pako/package.json @@ -0,0 +1,36 @@ +{ + "name": "@types/pako", + "version": "2.0.4", + "description": "TypeScript definitions for pako", + "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/pako", + "license": "MIT", + "contributors": [ + { + "name": "Caleb Eggensperger", + "githubUsername": "calebegg", + "url": "https://github.com/calebegg" + }, + { + "name": "Muhammet Öztürk", + "githubUsername": "hlthi", + "url": "https://github.com/hlthi" + }, + { + "name": "Thibault Poisson", + "githubUsername": "OrIOg", + "url": "https://github.com/OrIOg" + } + ], + "main": "", + "types": "index.d.ts", + "repository": { + "type": "git", + "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git", + "directory": "types/pako" + }, + "scripts": {}, + "dependencies": {}, + "peerDependencies": {}, + "typesPublisherContentHash": "1aa5b0407205ecaf32d7e7dfdb7cd3a7a87fad829f92f3c51eea48dc08742b89", + "typeScriptVersion": "5.2" +} \ No newline at end of file diff --git a/测试流式传输uniapp/node_modules/pako/LICENSE b/测试流式传输uniapp/node_modules/pako/LICENSE new file mode 100644 index 0000000..a934ef8 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/LICENSE @@ -0,0 +1,21 @@ +(The MIT License) + +Copyright (C) 2014-2017 by Vitaly Puzrin and Andrei Tuputcyn + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/测试流式传输uniapp/node_modules/pako/README.md b/测试流式传输uniapp/node_modules/pako/README.md new file mode 100644 index 0000000..507b0c9 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/README.md @@ -0,0 +1,177 @@ +pako +========================================== + +[![CI](https://github.com/nodeca/pako/workflows/CI/badge.svg)](https://github.com/nodeca/pako/actions) +[![NPM version](https://img.shields.io/npm/v/pako.svg)](https://www.npmjs.org/package/pako) + +> zlib port to javascript, very fast! + +__Why pako is cool:__ + +- Results are binary equal to well known [zlib](http://www.zlib.net/) (now contains ported zlib v1.2.8). +- Almost as fast in modern JS engines as C implementation (see benchmarks). +- Works in browsers, you can browserify any separate component. + +This project was done to understand how fast JS can be and is it necessary to +develop native C modules for CPU-intensive tasks. Enjoy the result! + + +__Benchmarks:__ + + +node v12.16.3 (zlib 1.2.9), 1mb input sample: + +``` +deflate-imaya x 4.75 ops/sec ±4.93% (15 runs sampled) +deflate-pako x 10.38 ops/sec ±0.37% (29 runs sampled) +deflate-zlib x 17.74 ops/sec ±0.77% (46 runs sampled) +gzip-pako x 8.86 ops/sec ±1.41% (29 runs sampled) +inflate-imaya x 107 ops/sec ±0.69% (77 runs sampled) +inflate-pako x 131 ops/sec ±1.74% (82 runs sampled) +inflate-zlib x 258 ops/sec ±0.66% (88 runs sampled) +ungzip-pako x 115 ops/sec ±1.92% (80 runs sampled) +``` + +node v14.15.0 (google's zlib), 1mb output sample: + +``` +deflate-imaya x 4.93 ops/sec ±3.09% (16 runs sampled) +deflate-pako x 10.22 ops/sec ±0.33% (29 runs sampled) +deflate-zlib x 18.48 ops/sec ±0.24% (48 runs sampled) +gzip-pako x 10.16 ops/sec ±0.25% (28 runs sampled) +inflate-imaya x 110 ops/sec ±0.41% (77 runs sampled) +inflate-pako x 134 ops/sec ±0.66% (83 runs sampled) +inflate-zlib x 402 ops/sec ±0.74% (87 runs sampled) +ungzip-pako x 113 ops/sec ±0.62% (80 runs sampled) +``` + +zlib's test is partially affected by marshalling (that make sense for inflate only). +You can change deflate level to 0 in benchmark source, to investigate details. +For deflate level 6 results can be considered as correct. + +__Install:__ + +``` +npm install pako +``` + + +Examples / API +-------------- + +Full docs - http://nodeca.github.io/pako/ + +```javascript +const pako = require('pako'); + +// Deflate +// +const input = new Uint8Array(); +//... fill input data here +const output = pako.deflate(input); + +// Inflate (simple wrapper can throw exception on broken stream) +// +const compressed = new Uint8Array(); +//... fill data to uncompress here +try { + const result = pako.inflate(compressed); + // ... continue processing +} catch (err) { + console.log(err); +} + +// +// Alternate interface for chunking & without exceptions +// + +const deflator = new pako.Deflate(); + +deflator.push(chunk1, false); +deflator.push(chunk2); // second param is false by default. +... +deflator.push(chunk_last, true); // `true` says this chunk is last + +if (deflator.err) { + console.log(deflator.msg); +} + +const output = deflator.result; + + +const inflator = new pako.Inflate(); + +inflator.push(chunk1); +inflator.push(chunk2); +... +inflator.push(chunk_last); // no second param because end is auto-detected + +if (inflator.err) { + console.log(inflator.msg); +} + +const output = inflator.result; +``` + +Sometime you can wish to work with strings. For example, to send +stringified objects to server. Pako's deflate detects input data type, and +automatically recode strings to utf-8 prior to compress. Inflate has special +option, to say compressed data has utf-8 encoding and should be recoded to +javascript's utf-16. + +```javascript +const pako = require('pako'); + +const test = { my: 'super', puper: [456, 567], awesome: 'pako' }; + +const compressed = pako.deflate(JSON.stringify(test)); + +const restored = JSON.parse(pako.inflate(compressed, { to: 'string' })); +``` + + +Notes +----- + +Pako does not contain some specific zlib functions: + +- __deflate__ - methods `deflateCopy`, `deflateBound`, `deflateParams`, + `deflatePending`, `deflatePrime`, `deflateTune`. +- __inflate__ - methods `inflateCopy`, `inflateMark`, + `inflatePrime`, `inflateGetDictionary`, `inflateSync`, `inflateSyncPoint`, `inflateUndermine`. +- High level inflate/deflate wrappers (classes) may not support some flush + modes. + + +pako for enterprise +------------------- + +Available as part of the Tidelift Subscription + +The maintainers of pako and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use. [Learn more.](https://tidelift.com/subscription/pkg/npm-pako?utm_source=npm-pako&utm_medium=referral&utm_campaign=enterprise&utm_term=repo) + + +Authors +------- + +- Andrey Tupitsin [@anrd83](https://github.com/andr83) +- Vitaly Puzrin [@puzrin](https://github.com/puzrin) + +Personal thanks to: + +- Vyacheslav Egorov ([@mraleph](https://github.com/mraleph)) for his awesome + tutorials about optimising JS code for v8, [IRHydra](http://mrale.ph/irhydra/) + tool and his advices. +- David Duponchel ([@dduponchel](https://github.com/dduponchel)) for help with + testing. + +Original implementation (in C): + +- [zlib](http://zlib.net/) by Jean-loup Gailly and Mark Adler. + + +License +------- + +- MIT - all files, except `/lib/zlib` folder +- ZLIB - `/lib/zlib` content diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako.es5.js b/测试流式传输uniapp/node_modules/pako/dist/pako.es5.js new file mode 100644 index 0000000..1b411dc --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako.es5.js @@ -0,0 +1,6688 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +(function (global, factory) { + typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : + typeof define === 'function' && define.amd ? define(['exports'], factory) : + (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.pako = {})); +})(this, (function (exports) { 'use strict'; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + /* eslint-disable space-unary-ops */ + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + //const Z_FILTERED = 1; + //const Z_HUFFMAN_ONLY = 2; + //const Z_RLE = 3; + var Z_FIXED$1 = 4; + //const Z_DEFAULT_STRATEGY = 0; + + /* Possible values of the data_type field (though see inflate()) */ + var Z_BINARY = 0; + var Z_TEXT = 1; + //const Z_ASCII = 1; // = Z_TEXT + var Z_UNKNOWN$1 = 2; + + /*============================================================================*/ + + function zero$1(buf) { + var len = buf.length; + while (--len >= 0) { + buf[len] = 0; + } + } + + // From zutil.h + + var STORED_BLOCK = 0; + var STATIC_TREES = 1; + var DYN_TREES = 2; + /* The three kinds of block type */ + + var MIN_MATCH$1 = 3; + var MAX_MATCH$1 = 258; + /* The minimum and maximum match lengths */ + + // From deflate.h + /* =========================================================================== + * Internal compression state. + */ + + var LENGTH_CODES$1 = 29; + /* number of length codes, not counting the special END_BLOCK code */ + + var LITERALS$1 = 256; + /* number of literal bytes 0..255 */ + + var L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1; + /* number of Literal or Length codes, including the END_BLOCK code */ + + var D_CODES$1 = 30; + /* number of distance codes */ + + var BL_CODES$1 = 19; + /* number of codes used to transfer the bit lengths */ + + var HEAP_SIZE$1 = 2 * L_CODES$1 + 1; + /* maximum heap size */ + + var MAX_BITS$1 = 15; + /* All codes must not exceed MAX_BITS bits */ + + var Buf_size = 16; + /* size of bit buffer in bi_buf */ + + /* =========================================================================== + * Constants + */ + + var MAX_BL_BITS = 7; + /* Bit length codes must not exceed MAX_BL_BITS bits */ + + var END_BLOCK = 256; + /* end of block literal code */ + + var REP_3_6 = 16; + /* repeat previous bit length 3-6 times (2 bits of repeat count) */ + + var REPZ_3_10 = 17; + /* repeat a zero length 3-10 times (3 bits of repeat count) */ + + var REPZ_11_138 = 18; + /* repeat a zero length 11-138 times (7 bits of repeat count) */ + + /* eslint-disable comma-spacing,array-bracket-spacing */ + var extra_lbits = /* extra bits for each length code */ + new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]); + var extra_dbits = /* extra bits for each distance code */ + new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]); + var extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]); + var bl_order = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]); + /* eslint-enable comma-spacing,array-bracket-spacing */ + + /* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + + /* =========================================================================== + * Local data. These are initialized only once. + */ + + // We pre-fill arrays with 0 to avoid uninitialized gaps + + var DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + + // !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 + var static_ltree = new Array((L_CODES$1 + 2) * 2); + zero$1(static_ltree); + /* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + + var static_dtree = new Array(D_CODES$1 * 2); + zero$1(static_dtree); + /* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + + var _dist_code = new Array(DIST_CODE_LEN); + zero$1(_dist_code); + /* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + + var _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1); + zero$1(_length_code); + /* length code for each normalized match length (0 == MIN_MATCH) */ + + var base_length = new Array(LENGTH_CODES$1); + zero$1(base_length); + /* First normalized length for each code (0 = MIN_MATCH) */ + + var base_dist = new Array(D_CODES$1); + zero$1(base_dist); + /* First normalized distance for each code (0 = distance of 1) */ + + function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; + } + var static_l_desc; + var static_d_desc; + var static_bl_desc; + function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ + } + + var d_code = function d_code(dist) { + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; + }; + + /* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ + var put_short = function put_short(s, w) { + // put_byte(s, (uch)((w) & 0xff)); + // put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = w & 0xff; + s.pending_buf[s.pending++] = w >>> 8 & 0xff; + }; + + /* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ + var send_bits = function send_bits(s, value, length) { + if (s.bi_valid > Buf_size - length) { + s.bi_buf |= value << s.bi_valid & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> Buf_size - s.bi_valid; + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= value << s.bi_valid & 0xffff; + s.bi_valid += length; + } + }; + var send_code = function send_code(s, c, tree) { + send_bits(s, tree[c * 2] /*.Code*/, tree[c * 2 + 1] /*.Len*/); + }; + + /* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ + var bi_reverse = function bi_reverse(code, len) { + var res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; + }; + + /* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ + var bi_flush = function bi_flush(s) { + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } + }; + + /* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ + var gen_bitlen = function gen_bitlen(s, desc) { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + var tree = desc.dyn_tree; + var max_code = desc.max_code; + var stree = desc.stat_desc.static_tree; + var has_stree = desc.stat_desc.has_stree; + var extra = desc.stat_desc.extra_bits; + var base = desc.stat_desc.extra_base; + var max_length = desc.stat_desc.max_length; + var h; /* heap index */ + var n, m; /* iterate over the tree elements */ + var bits; /* bit length */ + var xbits; /* extra bits */ + var f; /* frequency */ + var overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS$1; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1] /*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1] /*.Dad*/ * 2 + 1] /*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1] /*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { + continue; + } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2] /*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1] /*.Len*/ + xbits); + } + } + if (overflow === 0) { + return; + } + + // Tracev((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { + bits--; + } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { + continue; + } + if (tree[m * 2 + 1] /*.Len*/ !== bits) { + // Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1] /*.Len*/) * tree[m * 2] /*.Freq*/; + tree[m * 2 + 1] /*.Len*/ = bits; + } + n--; + } + } + }; + + /* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ + var gen_codes = function gen_codes(tree, max_code, bl_count) { + // ct_data *tree; /* the tree to decorate */ + // int max_code; /* largest code with non zero frequency */ + // ushf *bl_count; /* number of codes at each bit length */ + + var next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */ + var code = 0; /* running code value */ + var bits; /* bit index */ + var n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS$1; bits++) { + code = code + bl_count[bits - 1] << 1; + next_code[bits] = code; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES$1 - 1; code++) { + base_length[code] = length; + for (n = 0; n < 1 << extra_lbits[code]; n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < 1 << extra_dbits[code]; n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES$1; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < 1 << extra_dbits[code] - 7; n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS$1; bits++) { + bl_count[bits] = 0; + } + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1] /*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1] /*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1] /*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1] /*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES$1 + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES$1; n++) { + static_dtree[n * 2 + 1] /*.Len*/ = 5; + static_dtree[n * 2] /*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS); + + //static_init_done = true; + }; + + /* =========================================================================== + * Initialize a new block. + */ + var init_block = function init_block(s) { + var n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES$1; n++) { + s.dyn_ltree[n * 2] /*.Freq*/ = 0; + } + for (n = 0; n < D_CODES$1; n++) { + s.dyn_dtree[n * 2] /*.Freq*/ = 0; + } + for (n = 0; n < BL_CODES$1; n++) { + s.bl_tree[n * 2] /*.Freq*/ = 0; + } + s.dyn_ltree[END_BLOCK * 2] /*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.sym_next = s.matches = 0; + }; + + /* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ + var bi_windup = function bi_windup(s) { + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; + }; + + /* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ + var smaller = function smaller(tree, n, m, depth) { + var _n2 = n * 2; + var _m2 = m * 2; + return tree[_n2] /*.Freq*/ < tree[_m2] /*.Freq*/ || tree[_n2] /*.Freq*/ === tree[_m2] /*.Freq*/ && depth[n] <= depth[m]; + }; + + /* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ + var pqdownheap = function pqdownheap(s, tree, k) { + // deflate_state *s; + // ct_data *tree; /* the tree to restore */ + // int k; /* node to move down */ + + var v = s.heap[k]; + var j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { + break; + } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; + }; + + // inlined manually + // const SMALLEST = 1; + + /* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ + var compress_block = function compress_block(s, ltree, dtree) { + // deflate_state *s; + // const ct_data *ltree; /* literal tree */ + // const ct_data *dtree; /* distance tree */ + + var dist; /* distance of matched string */ + var lc; /* match length or unmatched char (if dist == 0) */ + var sx = 0; /* running index in sym_buf */ + var code; /* the code to send */ + var extra; /* number of extra bits to send */ + + if (s.sym_next !== 0) { + do { + dist = s.pending_buf[s.sym_buf + sx++] & 0xff; + dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8; + lc = s.pending_buf[s.sym_buf + sx++]; + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and sym_buf is ok: */ + //Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow"); + } while (sx < s.sym_next); + } + send_code(s, END_BLOCK, ltree); + }; + + /* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ + var build_tree = function build_tree(s, desc) { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + var tree = desc.dyn_tree; + var stree = desc.stat_desc.static_tree; + var has_stree = desc.stat_desc.has_stree; + var elems = desc.stat_desc.elems; + var n, m; /* iterate over heap elements */ + var max_code = -1; /* largest code with non zero frequency */ + var node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE$1; + for (n = 0; n < elems; n++) { + if (tree[n * 2] /*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + } else { + tree[n * 2 + 1] /*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = max_code < 2 ? ++max_code : 0; + tree[node * 2] /*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + if (has_stree) { + s.static_len -= stree[node * 2 + 1] /*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = s.heap_len >> 1 /*int /2*/; n >= 1; n--) { + pqdownheap(s, tree, n); + } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1 /*SMALLEST*/]; + s.heap[1 /*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1 /*SMALLEST*/); + /***/ + + m = s.heap[1 /*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2] /*.Freq*/ = tree[n * 2] /*.Freq*/ + tree[m * 2] /*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1] /*.Dad*/ = tree[m * 2 + 1] /*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1 /*SMALLEST*/] = node++; + pqdownheap(s, tree, 1 /*SMALLEST*/); + } while (s.heap_len >= 2); + s.heap[--s.heap_max] = s.heap[1 /*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); + }; + + /* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ + var scan_tree = function scan_tree(s, tree, max_code) { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + var n; /* iterates over all tree elements */ + var prevlen = -1; /* last emitted length */ + var curlen; /* length of current code */ + + var nextlen = tree[0 * 2 + 1] /*.Len*/; /* length of next code */ + + var count = 0; /* repeat count of the current code */ + var max_count = 7; /* max repeat count */ + var min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1] /*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1] /*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + } else if (count < min_count) { + s.bl_tree[curlen * 2] /*.Freq*/ += count; + } else if (curlen !== 0) { + if (curlen !== prevlen) { + s.bl_tree[curlen * 2] /*.Freq*/++; + } + s.bl_tree[REP_3_6 * 2] /*.Freq*/++; + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++; + } else { + s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++; + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + } else { + max_count = 7; + min_count = 4; + } + } + }; + + /* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ + var send_tree = function send_tree(s, tree, max_code) { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + var n; /* iterates over all tree elements */ + var prevlen = -1; /* last emitted length */ + var curlen; /* length of current code */ + + var nextlen = tree[0 * 2 + 1] /*.Len*/; /* length of next code */ + + var count = 0; /* repeat count of the current code */ + var max_count = 7; /* max repeat count */ + var min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1] /*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + } else if (count < min_count) { + do { + send_code(s, curlen, s.bl_tree); + } while (--count !== 0); + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + } else { + max_count = 7; + min_count = 4; + } + } + }; + + /* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ + var build_bl_tree = function build_bl_tree(s) { + var max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1] /*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; + }; + + /* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ + var send_all_trees = function send_all_trees(s, lcodes, dcodes, blcodes) { + // deflate_state *s; + // int lcodes, dcodes, blcodes; /* number of codes for each tree */ + + var rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1] /*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); + }; + + /* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "block list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ + var detect_data_type = function detect_data_type(s) { + /* block_mask is the bit mask of block-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + var block_mask = 0xf3ffc07f; + var n; + + /* Check for non-textual ("block-listed") bytes. */ + for (n = 0; n <= 31; n++, block_mask >>>= 1) { + if (block_mask & 1 && s.dyn_ltree[n * 2] /*.Freq*/ !== 0) { + return Z_BINARY; + } + } + + /* Check for textual ("allow-listed") bytes. */ + if (s.dyn_ltree[9 * 2] /*.Freq*/ !== 0 || s.dyn_ltree[10 * 2] /*.Freq*/ !== 0 || s.dyn_ltree[13 * 2] /*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS$1; n++) { + if (s.dyn_ltree[n * 2] /*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "block-listed" or "allow-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; + }; + var static_init_done = false; + + /* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ + var _tr_init$1 = function _tr_init(s) { + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); + }; + + /* =========================================================================== + * Send a stored block + */ + var _tr_stored_block$1 = function _tr_stored_block(s, buf, stored_len, last) { + //DeflateState *s; + //charf *buf; /* input block */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + bi_windup(s); /* align on byte boundary */ + put_short(s, stored_len); + put_short(s, ~stored_len); + if (stored_len) { + s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending); + } + s.pending += stored_len; + }; + + /* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ + var _tr_align$1 = function _tr_align(s) { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); + }; + + /* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and write out the encoded block. + */ + var _tr_flush_block$1 = function _tr_flush_block(s, buf, stored_len, last) { + //DeflateState *s; + //charf *buf; /* input block, or NULL if too old */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + var opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + var max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN$1) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = s.opt_len + 3 + 7 >>> 3; + static_lenb = s.static_len + 3 + 7 >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->sym_next / 3)); + + if (static_lenb <= opt_lenb) { + opt_lenb = static_lenb; + } + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if (stored_len + 4 <= opt_lenb && buf !== -1) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block$1(s, buf, stored_len, last); + } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) { + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); + }; + + /* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ + var _tr_tally$1 = function _tr_tally(s, dist, lc) { + // deflate_state *s; + // unsigned dist; /* distance of matched string */ + // unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ + + s.pending_buf[s.sym_buf + s.sym_next++] = dist; + s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8; + s.pending_buf[s.sym_buf + s.sym_next++] = lc; + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2] /*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2] /*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2] /*.Freq*/++; + } + + return s.sym_next === s.sym_end; + }; + var _tr_init_1 = _tr_init$1; + var _tr_stored_block_1 = _tr_stored_block$1; + var _tr_flush_block_1 = _tr_flush_block$1; + var _tr_tally_1 = _tr_tally$1; + var _tr_align_1 = _tr_align$1; + var trees = { + _tr_init: _tr_init_1, + _tr_stored_block: _tr_stored_block_1, + _tr_flush_block: _tr_flush_block_1, + _tr_tally: _tr_tally_1, + _tr_align: _tr_align_1 + }; + + // Note: adler32 takes 12% for level 0 and 2% for level 6. + // It isn't worth it to make additional optimizations as in original. + // Small size is preferable. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var adler32 = function adler32(adler, buf, len, pos) { + var s1 = adler & 0xffff | 0, + s2 = adler >>> 16 & 0xffff | 0, + n = 0; + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + do { + s1 = s1 + buf[pos++] | 0; + s2 = s2 + s1 | 0; + } while (--n); + s1 %= 65521; + s2 %= 65521; + } + return s1 | s2 << 16 | 0; + }; + var adler32_1 = adler32; + + // Note: we can't get significant speed boost here. + // So write code to minimize size - no pregenerated tables + // and array tools dependencies. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // Use ordinary array, since untyped makes no boost here + var makeTable = function makeTable() { + var c, + table = []; + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1; + } + table[n] = c; + } + return table; + }; + + // Create table on load. Just 255 signed longs. Not a problem. + var crcTable = new Uint32Array(makeTable()); + var crc32 = function crc32(crc, buf, len, pos) { + var t = crcTable; + var end = pos + len; + crc ^= -1; + for (var i = pos; i < end; i++) { + crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF]; + } + return crc ^ -1; // >>> 0; + }; + + var crc32_1 = crc32; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var messages = { + 2: 'need dictionary', + /* Z_NEED_DICT 2 */ + 1: 'stream end', + /* Z_STREAM_END 1 */ + 0: '', + /* Z_OK 0 */ + '-1': 'file error', + /* Z_ERRNO (-1) */ + '-2': 'stream error', + /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', + /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', + /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', + /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var constants$2 = { + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var _tr_init = trees._tr_init, + _tr_stored_block = trees._tr_stored_block, + _tr_flush_block = trees._tr_flush_block, + _tr_tally = trees._tr_tally, + _tr_align = trees._tr_align; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_NO_FLUSH$2 = constants$2.Z_NO_FLUSH, + Z_PARTIAL_FLUSH = constants$2.Z_PARTIAL_FLUSH, + Z_FULL_FLUSH$1 = constants$2.Z_FULL_FLUSH, + Z_FINISH$3 = constants$2.Z_FINISH, + Z_BLOCK$1 = constants$2.Z_BLOCK, + Z_OK$3 = constants$2.Z_OK, + Z_STREAM_END$3 = constants$2.Z_STREAM_END, + Z_STREAM_ERROR$2 = constants$2.Z_STREAM_ERROR, + Z_DATA_ERROR$2 = constants$2.Z_DATA_ERROR, + Z_BUF_ERROR$1 = constants$2.Z_BUF_ERROR, + Z_DEFAULT_COMPRESSION$1 = constants$2.Z_DEFAULT_COMPRESSION, + Z_FILTERED = constants$2.Z_FILTERED, + Z_HUFFMAN_ONLY = constants$2.Z_HUFFMAN_ONLY, + Z_RLE = constants$2.Z_RLE, + Z_FIXED = constants$2.Z_FIXED, + Z_DEFAULT_STRATEGY$1 = constants$2.Z_DEFAULT_STRATEGY, + Z_UNKNOWN = constants$2.Z_UNKNOWN, + Z_DEFLATED$2 = constants$2.Z_DEFLATED; + + /*============================================================================*/ + + var MAX_MEM_LEVEL = 9; + /* Maximum value for memLevel in deflateInit2 */ + var MAX_WBITS$1 = 15; + /* 32K LZ77 window */ + var DEF_MEM_LEVEL = 8; + var LENGTH_CODES = 29; + /* number of length codes, not counting the special END_BLOCK code */ + var LITERALS = 256; + /* number of literal bytes 0..255 */ + var L_CODES = LITERALS + 1 + LENGTH_CODES; + /* number of Literal or Length codes, including the END_BLOCK code */ + var D_CODES = 30; + /* number of distance codes */ + var BL_CODES = 19; + /* number of codes used to transfer the bit lengths */ + var HEAP_SIZE = 2 * L_CODES + 1; + /* maximum heap size */ + var MAX_BITS = 15; + /* All codes must not exceed MAX_BITS bits */ + + var MIN_MATCH = 3; + var MAX_MATCH = 258; + var MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1; + var PRESET_DICT = 0x20; + var INIT_STATE = 42; /* zlib header -> BUSY_STATE */ + //#ifdef GZIP + var GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */ + //#endif + var EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */ + var NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */ + var COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */ + var HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */ + var BUSY_STATE = 113; /* deflate -> FINISH_STATE */ + var FINISH_STATE = 666; /* stream complete */ + + var BS_NEED_MORE = 1; /* block not completed, need more input or more output */ + var BS_BLOCK_DONE = 2; /* block flush performed */ + var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ + var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + + var OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + + var err = function err(strm, errorCode) { + strm.msg = messages[errorCode]; + return errorCode; + }; + var rank = function rank(f) { + return f * 2 - (f > 4 ? 9 : 0); + }; + var zero = function zero(buf) { + var len = buf.length; + while (--len >= 0) { + buf[len] = 0; + } + }; + + /* =========================================================================== + * Slide the hash table when sliding the window down (could be avoided with 32 + * bit values at the expense of memory usage). We slide even when level == 0 to + * keep the hash table consistent if we switch back to level > 0 later. + */ + var slide_hash = function slide_hash(s) { + var n, m; + var p; + var wsize = s.w_size; + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = m >= wsize ? m - wsize : 0; + } while (--n); + n = wsize; + //#ifndef FASTEST + p = n; + do { + m = s.prev[--p]; + s.prev[p] = m >= wsize ? m - wsize : 0; + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); + //#endif + }; + + /* eslint-disable new-cap */ + var HASH_ZLIB = function HASH_ZLIB(s, prev, data) { + return (prev << s.hash_shift ^ data) & s.hash_mask; + }; + // This hash causes less collisions, https://github.com/nodeca/pako/issues/135 + // But breaks binary compatibility + //let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; + var HASH = HASH_ZLIB; + + /* ========================================================================= + * Flush as much pending output as possible. All deflate() output, except for + * some deflate_stored() output, goes through this function so some + * applications may wish to modify it to avoid allocating a large + * strm->next_out buffer and copying into it. (See also read_buf()). + */ + var flush_pending = function flush_pending(strm) { + var s = strm.state; + + //_tr_flush_bits(s); + var len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { + return; + } + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } + }; + var flush_block_only = function flush_block_only(s, last) { + _tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); + }; + var put_byte = function put_byte(s, b) { + s.pending_buf[s.pending++] = b; + }; + + /* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ + var putShortMSB = function putShortMSB(s, b) { + // put_byte(s, (Byte)(b >> 8)); + // put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = b >>> 8 & 0xff; + s.pending_buf[s.pending++] = b & 0xff; + }; + + /* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ + var read_buf = function read_buf(strm, buf, start, size) { + var len = strm.avail_in; + if (len > size) { + len = size; + } + if (len === 0) { + return 0; + } + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32_1(strm.adler, buf, len, start); + } else if (strm.state.wrap === 2) { + strm.adler = crc32_1(strm.adler, buf, len, start); + } + strm.next_in += len; + strm.total_in += len; + return len; + }; + + /* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ + var longest_match = function longest_match(s, cur_match) { + var chain_length = s.max_chain_length; /* max hash chain length */ + var scan = s.strstart; /* current string */ + var match; /* matched string */ + var len; /* length of current match */ + var best_len = s.prev_length; /* best match length so far */ + var nice_match = s.nice_match; /* stop if match long enough */ + var limit = s.strstart > s.w_size - MIN_LOOKAHEAD ? s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0 /*NIL*/; + + var _win = s.window; // shortcut + + var wmask = s.w_mask; + var prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + var strend = s.strstart + MAX_MATCH; + var scan_end1 = _win[scan + best_len - 1]; + var scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { + nice_match = s.lookahead; + } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || _win[match + best_len - 1] !== scan_end1 || _win[match] !== _win[scan] || _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; + }; + + /* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ + var fill_window = function fill_window(s) { + var _w_size = s.w_size; + var n, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + slide_hash(s); + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); + //#if MIN_MATCH != 3 + // Call update_hash() MIN_MATCH-3 more times + //#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ + // if (s.high_water < s.window_size) { + // const curr = s.strstart + s.lookahead; + // let init = 0; + // + // if (s.high_water < curr) { + // /* Previous high water mark below current data -- zero WIN_INIT + // * bytes or up to end of window, whichever is less. + // */ + // init = s.window_size - curr; + // if (init > WIN_INIT) + // init = WIN_INIT; + // zmemzero(s->window + curr, (unsigned)init); + // s->high_water = curr + init; + // } + // else if (s->high_water < (ulg)curr + WIN_INIT) { + // /* High water mark at or above current data, but below current data + // * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up + // * to end of window, whichever is less. + // */ + // init = (ulg)curr + WIN_INIT - s->high_water; + // if (init > s->window_size - s->high_water) + // init = s->window_size - s->high_water; + // zmemzero(s->window + s->high_water, (unsigned)init); + // s->high_water += init; + // } + // } + // + // Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, + // "not enough room for search"); + }; + + /* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * + * In case deflateParams() is used to later switch to a non-zero compression + * level, s->matches (otherwise unused when storing) keeps track of the number + * of hash table slides to perform. If s->matches is 1, then one hash table + * slide will be done when switching. If s->matches is 2, the maximum value + * allowed here, then the hash table will be cleared, since two or more slides + * is the same as a clear. + * + * deflate_stored() is written to minimize the number of times an input byte is + * copied. It is most efficient with large input and output buffers, which + * maximizes the opportunites to have a single copy from next_in to next_out. + */ + var deflate_stored = function deflate_stored(s, flush) { + /* Smallest worthy block size when not flushing or finishing. By default + * this is 32K. This can be as small as 507 bytes for memLevel == 1. For + * large input and output buffers, the stored block size will be larger. + */ + var min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5; + + /* Copy as many min_block or larger stored blocks directly to next_out as + * possible. If flushing, copy the remaining available input to next_out as + * stored blocks, if there is enough space. + */ + var len, + left, + have, + last = 0; + var used = s.strm.avail_in; + do { + /* Set len to the maximum size block that we can copy directly with the + * available input data and output space. Set left to how much of that + * would be copied from what's left in the window. + */ + len = 65535 /* MAX_STORED */; /* maximum deflate stored block length */ + have = s.bi_valid + 42 >> 3; /* number of header bytes */ + if (s.strm.avail_out < have) { + /* need room for header */ + break; + } + /* maximum stored block length that will fit in avail_out: */ + have = s.strm.avail_out - have; + left = s.strstart - s.block_start; /* bytes left in window */ + if (len > left + s.strm.avail_in) { + len = left + s.strm.avail_in; /* limit len to the input */ + } + + if (len > have) { + len = have; /* limit len to the output */ + } + + /* If the stored block would be less than min_block in length, or if + * unable to copy all of the available input when flushing, then try + * copying to the window and the pending buffer instead. Also don't + * write an empty block when flushing -- deflate() does that. + */ + if (len < min_block && (len === 0 && flush !== Z_FINISH$3 || flush === Z_NO_FLUSH$2 || len !== left + s.strm.avail_in)) { + break; + } + + /* Make a dummy stored block in pending to get the header bytes, + * including any pending bits. This also updates the debugging counts. + */ + last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0; + _tr_stored_block(s, 0, 0, last); + + /* Replace the lengths in the dummy stored block with len. */ + s.pending_buf[s.pending - 4] = len; + s.pending_buf[s.pending - 3] = len >> 8; + s.pending_buf[s.pending - 2] = ~len; + s.pending_buf[s.pending - 1] = ~len >> 8; + + /* Write the stored block header bytes. */ + flush_pending(s.strm); + + //#ifdef ZLIB_DEBUG + // /* Update debugging counts for the data about to be copied. */ + // s->compressed_len += len << 3; + // s->bits_sent += len << 3; + //#endif + + /* Copy uncompressed bytes from the window to next_out. */ + if (left) { + if (left > len) { + left = len; + } + //zmemcpy(s->strm->next_out, s->window + s->block_start, left); + s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out); + s.strm.next_out += left; + s.strm.avail_out -= left; + s.strm.total_out += left; + s.block_start += left; + len -= left; + } + + /* Copy uncompressed bytes directly from next_in to next_out, updating + * the check value. + */ + if (len) { + read_buf(s.strm, s.strm.output, s.strm.next_out, len); + s.strm.next_out += len; + s.strm.avail_out -= len; + s.strm.total_out += len; + } + } while (last === 0); + + /* Update the sliding window with the last s->w_size bytes of the copied + * data, or append all of the copied data to the existing window if less + * than s->w_size bytes were copied. Also update the number of bytes to + * insert in the hash tables, in the event that deflateParams() switches to + * a non-zero compression level. + */ + used -= s.strm.avail_in; /* number of input bytes directly copied */ + if (used) { + /* If any input was used, then no unused input remains in the window, + * therefore s->block_start == s->strstart. + */ + if (used >= s.w_size) { + /* supplant the previous history */ + s.matches = 2; /* clear hash */ + //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); + s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0); + s.strstart = s.w_size; + s.insert = s.strstart; + } else { + if (s.window_size - s.strstart <= used) { + /* Slide the window down. */ + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); + s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart); + s.strstart += used; + s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used; + } + s.block_start = s.strstart; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* If the last block was written to next_out, then done. */ + if (last) { + return BS_FINISH_DONE; + } + + /* If flushing and all input has been consumed, then done. */ + if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 && s.strm.avail_in === 0 && s.strstart === s.block_start) { + return BS_BLOCK_DONE; + } + + /* Fill the window with any remaining input. */ + have = s.window_size - s.strstart; + if (s.strm.avail_in > have && s.block_start >= s.w_size) { + /* Slide the window down. */ + s.block_start -= s.w_size; + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + + have += s.w_size; /* more space now */ + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + if (have > s.strm.avail_in) { + have = s.strm.avail_in; + } + if (have) { + read_buf(s.strm, s.window, s.strstart, have); + s.strstart += have; + s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* There was not enough avail_out to write a complete worthy or flushed + * stored block to next_out. Write a stored block to pending instead, if we + * have enough input for a worthy block, or if flushing and there is enough + * room for the remaining input as a stored block in the pending buffer. + */ + have = s.bi_valid + 42 >> 3; /* number of header bytes */ + /* maximum stored block length that will fit in pending: */ + have = s.pending_buf_size - have > 65535 /* MAX_STORED */ ? 65535 /* MAX_STORED */ : s.pending_buf_size - have; + min_block = have > s.w_size ? s.w_size : have; + left = s.strstart - s.block_start; + if (left >= min_block || (left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 && s.strm.avail_in === 0 && left <= have) { + len = left > have ? have : left; + last = flush === Z_FINISH$3 && s.strm.avail_in === 0 && len === left ? 1 : 0; + _tr_stored_block(s, s.block_start, len, last); + s.block_start += len; + flush_pending(s.strm); + } + + /* We've done all we can with the available input and output. */ + return last ? BS_FINISH_STARTED : BS_NEED_MORE; + }; + + /* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ + var deflate_fast = function deflate_fast(s, flush) { + var hash_head; /* head of the hash chain */ + var bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0 /*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + + //#if MIN_MATCH != 3 + // Call UPDATE_HASH() MIN_MATCH-3 more times + //#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ + var deflate_slow = function deflate_slow(s, flush) { + var hash_head; /* head of hash chain */ + var bflush; /* set if current block must be flushed */ + + var max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; + } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0 /*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) { + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ + var deflate_rle = function deflate_rle(s, flush) { + var bflush; /* set if current block must be flushed */ + var prev; /* byte at distance one to match */ + var scan, strend; /* scan goes up to strend for length of run */ + + var _win = s.window; + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; + } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ + var deflate_huff = function deflate_huff(s, flush) { + var bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ + function Config(good_length, max_lazy, nice_length, max_chain, func) { + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; + } + var configuration_table = [/* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */]; + + /* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ + var lm_init = function lm_init(s) { + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; + }; + function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED$2; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.sym_buf = 0; /* buffer for distances and literals/lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.sym_next = 0; /* running index in sym_buf */ + this.sym_end = 0; /* symbol table full when sym_next reaches this */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ + } + + /* ========================================================================= + * Check for a valid deflate stream state. Return 0 if ok, 1 if not. + */ + var deflateStateCheck = function deflateStateCheck(strm) { + if (!strm) { + return 1; + } + var s = strm.state; + if (!s || s.strm !== strm || s.status !== INIT_STATE && + //#ifdef GZIP + s.status !== GZIP_STATE && + //#endif + s.status !== EXTRA_STATE && s.status !== NAME_STATE && s.status !== COMMENT_STATE && s.status !== HCRC_STATE && s.status !== BUSY_STATE && s.status !== FINISH_STATE) { + return 1; + } + return 0; + }; + var deflateResetKeep = function deflateResetKeep(strm) { + if (deflateStateCheck(strm)) { + return err(strm, Z_STREAM_ERROR$2); + } + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + var s = strm.state; + s.pending = 0; + s.pending_out = 0; + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + + s.status = + //#ifdef GZIP + s.wrap === 2 ? GZIP_STATE : + //#endif + s.wrap ? INIT_STATE : BUSY_STATE; + strm.adler = s.wrap === 2 ? 0 // crc32(0, Z_NULL, 0) + : 1; // adler32(0, Z_NULL, 0) + s.last_flush = -2; + _tr_init(s); + return Z_OK$3; + }; + var deflateReset = function deflateReset(strm) { + var ret = deflateResetKeep(strm); + if (ret === Z_OK$3) { + lm_init(strm.state); + } + return ret; + }; + var deflateSetHeader = function deflateSetHeader(strm, head) { + if (deflateStateCheck(strm) || strm.state.wrap !== 2) { + return Z_STREAM_ERROR$2; + } + strm.state.gzhead = head; + return Z_OK$3; + }; + var deflateInit2 = function deflateInit2(strm, level, method, windowBits, memLevel, strategy) { + if (!strm) { + // === Z_NULL + return Z_STREAM_ERROR$2; + } + var wrap = 1; + if (level === Z_DEFAULT_COMPRESSION$1) { + level = 6; + } + if (windowBits < 0) { + /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED || windowBits === 8 && wrap !== 1) { + return err(strm, Z_STREAM_ERROR$2); + } + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + var s = new DeflateState(); + strm.state = s; + s.strm = strm; + s.status = INIT_STATE; /* to pass state test in deflateReset() */ + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << memLevel + 6; /* 16K elements by default */ + + /* We overlay pending_buf and sym_buf. This works since the average size + * for length/distance pairs over any compressed block is assured to be 31 + * bits or less. + * + * Analysis: The longest fixed codes are a length code of 8 bits plus 5 + * extra bits, for lengths 131 to 257. The longest fixed distance codes are + * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest + * possible fixed-codes length/distance pair is then 31 bits total. + * + * sym_buf starts one-fourth of the way into pending_buf. So there are + * three bytes in sym_buf for every four bytes in pending_buf. Each symbol + * in sym_buf is three bytes -- two for the distance and one for the + * literal/length. As each symbol is consumed, the pointer to the next + * sym_buf value to read moves forward three bytes. From that symbol, up to + * 31 bits are written to pending_buf. The closest the written pending_buf + * bits gets to the next sym_buf symbol to read is just before the last + * code is written. At that time, 31*(n-2) bits have been written, just + * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at + * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1 + * symbols are written.) The closest the writing gets to what is unread is + * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and + * can range from 128 to 32768. + * + * Therefore, at a minimum, there are 142 bits of space between what is + * written and what is read in the overlain buffers, so the symbols cannot + * be overwritten by the compressed data. That space is actually 139 bits, + * due to the three-bit fixed-code block header. + * + * That covers the case where either Z_FIXED is specified, forcing fixed + * codes, or when the use of fixed codes is chosen, because that choice + * results in a smaller compressed block than dynamic codes. That latter + * condition then assures that the above analysis also covers all dynamic + * blocks. A dynamic-code block will only be chosen to be emitted if it has + * fewer bits than a fixed-code block would for the same set of symbols. + * Therefore its average symbol length is assured to be less than 31. So + * the compressed data for a dynamic block also cannot overwrite the + * symbols from which it is being constructed. + */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->sym_buf = s->pending_buf + s->lit_bufsize; + s.sym_buf = s.lit_bufsize; + + //s->sym_end = (s->lit_bufsize - 1) * 3; + s.sym_end = (s.lit_bufsize - 1) * 3; + /* We avoid equality with lit_bufsize*3 because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ + + s.level = level; + s.strategy = strategy; + s.method = method; + return deflateReset(strm); + }; + var deflateInit = function deflateInit(strm, level) { + return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1); + }; + + /* ========================================================================= */ + var deflate$2 = function deflate(strm, flush) { + if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2; + } + var s = strm.state; + if (!strm.output || strm.avail_in !== 0 && !strm.input || s.status === FINISH_STATE && flush !== Z_FINISH$3) { + return err(strm, strm.avail_out === 0 ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2); + } + var old_flush = s.last_flush; + s.last_flush = flush; + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK$3; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && flush !== Z_FINISH$3) { + return err(strm, Z_BUF_ERROR$1); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR$1); + } + + /* Write the header */ + if (s.status === INIT_STATE && s.wrap === 0) { + s.status = BUSY_STATE; + } + if (s.status === INIT_STATE) { + /* zlib header */ + var header = Z_DEFLATED$2 + (s.w_bits - 8 << 4) << 8; + var level_flags = -1; + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= level_flags << 6; + if (s.strstart !== 0) { + header |= PRESET_DICT; + } + header += 31 - header % 31; + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + //#ifdef GZIP + if (s.status === GZIP_STATE) { + /* gzip header */ + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { + // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } else { + put_byte(s, (s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (!s.gzhead.extra ? 0 : 4) + (!s.gzhead.name ? 0 : 8) + (!s.gzhead.comment ? 0 : 16)); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, s.gzhead.time >> 8 & 0xff); + put_byte(s, s.gzhead.time >> 16 & 0xff); + put_byte(s, s.gzhead.time >> 24 & 0xff); + put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, s.gzhead.extra.length >> 8 & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra /* != Z_NULL*/) { + var beg = s.pending; /* start of bytes to update crc */ + var left = (s.gzhead.extra.length & 0xffff) - s.gzindex; + while (s.pending + left > s.pending_buf_size) { + var copy = s.pending_buf_size - s.pending; + // zmemcpy(s.pending_buf + s.pending, + // s.gzhead.extra + s.gzindex, copy); + s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending); + s.pending = s.pending_buf_size; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex += copy; + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + left -= copy; + } + // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility + // TypedArray.slice and TypedArray.from don't exist in IE10-IE11 + var gzhead_extra = new Uint8Array(s.gzhead.extra); + // zmemcpy(s->pending_buf + s->pending, + // s->gzhead->extra + s->gzindex, left); + s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending); + s.pending += left; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = NAME_STATE; + } + if (s.status === NAME_STATE) { + if (s.gzhead.name /* != Z_NULL*/) { + var _beg = s.pending; /* start of bytes to update crc */ + var val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg, _beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + _beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg, _beg); + } + //---// + s.gzindex = 0; + } + s.status = COMMENT_STATE; + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment /* != Z_NULL*/) { + var _beg2 = s.pending; /* start of bytes to update crc */ + var _val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg2) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg2, _beg2); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + _beg2 = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + _val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + _val = 0; + } + put_byte(s, _val); + } while (_val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg2) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg2, _beg2); + } + //---// + } + + s.status = HCRC_STATE; + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + put_byte(s, strm.adler & 0xff); + put_byte(s, strm.adler >> 8 & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + } + + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + //#endif + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE) { + var bstate = s.level === 0 ? deflate_stored(s, flush) : s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s.strategy === Z_RLE ? deflate_rle(s, flush) : configuration_table[s.level].func(s, flush); + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + + return Z_OK$3; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } else if (flush !== Z_BLOCK$1) { + /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH$1) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK$3; + } + } + } + if (flush !== Z_FINISH$3) { + return Z_OK$3; + } + if (s.wrap <= 0) { + return Z_STREAM_END$3; + } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, strm.adler >> 8 & 0xff); + put_byte(s, strm.adler >> 16 & 0xff); + put_byte(s, strm.adler >> 24 & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, strm.total_in >> 8 & 0xff); + put_byte(s, strm.total_in >> 16 & 0xff); + put_byte(s, strm.total_in >> 24 & 0xff); + } else { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { + s.wrap = -s.wrap; + } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3; + }; + var deflateEnd = function deflateEnd(strm) { + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR$2; + } + var status = strm.state.status; + strm.state = null; + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3; + }; + + /* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ + var deflateSetDictionary = function deflateSetDictionary(strm, dictionary) { + var dictLength = dictionary.length; + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR$2; + } + var s = strm.state; + var wrap = s.wrap; + if (wrap === 2 || wrap === 1 && s.status !== INIT_STATE || s.lookahead) { + return Z_STREAM_ERROR$2; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0); + } + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { + /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + var tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + var avail = strm.avail_in; + var next = strm.next_in; + var input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + var str = s.strstart; + var n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK$3; + }; + var deflateInit_1 = deflateInit; + var deflateInit2_1 = deflateInit2; + var deflateReset_1 = deflateReset; + var deflateResetKeep_1 = deflateResetKeep; + var deflateSetHeader_1 = deflateSetHeader; + var deflate_2$1 = deflate$2; + var deflateEnd_1 = deflateEnd; + var deflateSetDictionary_1 = deflateSetDictionary; + var deflateInfo = 'pako deflate (from Nodeca project)'; + + /* Not implemented + module.exports.deflateBound = deflateBound; + module.exports.deflateCopy = deflateCopy; + module.exports.deflateGetDictionary = deflateGetDictionary; + module.exports.deflateParams = deflateParams; + module.exports.deflatePending = deflatePending; + module.exports.deflatePrime = deflatePrime; + module.exports.deflateTune = deflateTune; + */ + + var deflate_1$2 = { + deflateInit: deflateInit_1, + deflateInit2: deflateInit2_1, + deflateReset: deflateReset_1, + deflateResetKeep: deflateResetKeep_1, + deflateSetHeader: deflateSetHeader_1, + deflate: deflate_2$1, + deflateEnd: deflateEnd_1, + deflateSetDictionary: deflateSetDictionary_1, + deflateInfo: deflateInfo + }; + + function _typeof(obj) { + "@babel/helpers - typeof"; + + return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { + return typeof obj; + } : function (obj) { + return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; + }, _typeof(obj); + } + + var _has = function _has(obj, key) { + return Object.prototype.hasOwnProperty.call(obj, key); + }; + var assign = function assign(obj /*from1, from2, from3, ...*/) { + var sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + var source = sources.shift(); + if (!source) { + continue; + } + if (_typeof(source) !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + for (var p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + return obj; + }; + + // Join array of chunks to single array. + var flattenChunks = function flattenChunks(chunks) { + // calculate data length + var len = 0; + for (var i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + var result = new Uint8Array(len); + for (var _i = 0, pos = 0, _l = chunks.length; _i < _l; _i++) { + var chunk = chunks[_i]; + result.set(chunk, pos); + pos += chunk.length; + } + return result; + }; + var common = { + assign: assign, + flattenChunks: flattenChunks + }; + + // String encode/decode helpers + + // Quick check if we can use fast array to bin string conversion + // + // - apply(Array) can fail on Android 2.2 + // - apply(Uint8Array) can fail on iOS 5.1 Safari + // + var STR_APPLY_UIA_OK = true; + try { + String.fromCharCode.apply(null, new Uint8Array(1)); + } catch (__) { + STR_APPLY_UIA_OK = false; + } + + // Table with utf8 lengths (calculated by first byte of sequence) + // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, + // because max possible codepoint is 0x10ffff + var _utf8len = new Uint8Array(256); + for (var q = 0; q < 256; q++) { + _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1; + } + _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + // convert string to array (typed, when possible) + var string2buf = function string2buf(str) { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + var buf, + c, + c2, + m_pos, + i, + str_len = str.length, + buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | c >>> 6; + buf[i++] = 0x80 | c & 0x3f; + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | c >>> 12; + buf[i++] = 0x80 | c >>> 6 & 0x3f; + buf[i++] = 0x80 | c & 0x3f; + } else { + /* four bytes */ + buf[i++] = 0xf0 | c >>> 18; + buf[i++] = 0x80 | c >>> 12 & 0x3f; + buf[i++] = 0x80 | c >>> 6 & 0x3f; + buf[i++] = 0x80 | c & 0x3f; + } + } + return buf; + }; + + // Helper + var buf2binstring = function buf2binstring(buf, len) { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + var result = ''; + for (var i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; + }; + + // convert array to string + var buf2string = function buf2string(buf, max) { + var len = max || buf.length; + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + var i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len * 2); + for (out = 0, i = 0; i < len;) { + var c = buf[i++]; + // quick process ascii + if (c < 0x80) { + utf16buf[out++] = c; + continue; + } + var c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { + utf16buf[out++] = 0xfffd; + i += c_len - 1; + continue; + } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = c << 6 | buf[i++] & 0x3f; + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { + utf16buf[out++] = 0xfffd; + continue; + } + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff; + utf16buf[out++] = 0xdc00 | c & 0x3ff; + } + } + return buf2binstring(utf16buf, out); + }; + + // Calculate max possible position in utf8 buffer, + // that will not break sequence. If that's not possible + // - (very small limits) return max size as is. + // + // buf[] - utf8 bytes array + // max - length limit (mandatory); + var utf8border = function utf8border(buf, max) { + max = max || buf.length; + if (max > buf.length) { + max = buf.length; + } + + // go back from last position, until start of sequence found + var pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { + pos--; + } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { + return max; + } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { + return max; + } + return pos + _utf8len[buf[pos]] > max ? pos : max; + }; + var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = '' /*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2 /*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; + } + var zstream = ZStream; + + var toString$1 = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_NO_FLUSH$1 = constants$2.Z_NO_FLUSH, + Z_SYNC_FLUSH = constants$2.Z_SYNC_FLUSH, + Z_FULL_FLUSH = constants$2.Z_FULL_FLUSH, + Z_FINISH$2 = constants$2.Z_FINISH, + Z_OK$2 = constants$2.Z_OK, + Z_STREAM_END$2 = constants$2.Z_STREAM_END, + Z_DEFAULT_COMPRESSION = constants$2.Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY = constants$2.Z_DEFAULT_STRATEGY, + Z_DEFLATED$1 = constants$2.Z_DEFLATED; + + /* ===========================================================================*/ + + /** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + + /* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + + /** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + + /** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + /** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ + function Deflate$1(options) { + this.options = common.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED$1, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + var opt = this.options; + if (opt.raw && opt.windowBits > 0) { + opt.windowBits = -opt.windowBits; + } else if (opt.gzip && opt.windowBits > 0 && opt.windowBits < 16) { + opt.windowBits += 16; + } + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + var status = deflate_1$2.deflateInit2(this.strm, opt.level, opt.method, opt.windowBits, opt.memLevel, opt.strategy); + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + if (opt.header) { + deflate_1$2.deflateSetHeader(this.strm, opt.header); + } + if (opt.dictionary) { + var dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + status = deflate_1$2.deflateSetDictionary(this.strm, dict); + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + this._dict_set = true; + } + } + + /** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Deflate$1.prototype.push = function (data, flush_mode) { + var strm = this.strm; + var chunkSize = this.options.chunkSize; + var status, _flush_mode; + if (this.ended) { + return false; + } + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString$1.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + strm.next_in = 0; + strm.avail_in = strm.input.length; + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + status = deflate_1$2.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END$2) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = deflate_1$2.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK$2; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + if (strm.avail_in === 0) break; + } + return true; + }; + + /** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Deflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + /** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Deflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK$2) { + this.result = common.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + /** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ + function deflate$1(input, options) { + var deflator = new Deflate$1(options); + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { + throw deflator.msg || messages[deflator.err]; + } + return deflator.result; + } + + /** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function deflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return deflate$1(input, options); + } + + /** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ + function gzip$1(input, options) { + options = options || {}; + options.gzip = true; + return deflate$1(input, options); + } + var Deflate_1$1 = Deflate$1; + var deflate_2 = deflate$1; + var deflateRaw_1$1 = deflateRaw$1; + var gzip_1$1 = gzip$1; + var constants$1 = constants$2; + var deflate_1$1 = { + Deflate: Deflate_1$1, + deflate: deflate_2, + deflateRaw: deflateRaw_1$1, + gzip: gzip_1$1, + constants: constants$1 + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // See state defs from inflate.js + var BAD$1 = 16209; /* got a data error -- remain here until reset */ + var TYPE$1 = 16191; /* i: waiting for type bits, including last-flag bit */ + + /* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ + var inffast = function inflate_fast(strm, start) { + var _in; /* local strm.input */ + var last; /* have enough input while in < last */ + var _out; /* local strm.output */ + var beg; /* inflate()'s initial strm.output */ + var end; /* while out < end, enough space available */ + //#ifdef INFLATE_STRICT + var dmax; /* maximum distance from zlib header */ + //#endif + var wsize; /* window size or zero if not using window */ + var whave; /* valid bytes in the window */ + var wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + var s_window; /* allocated sliding window, if wsize != 0 */ + var hold; /* local strm.hold */ + var bits; /* local strm.bits */ + var lcode; /* local strm.lencode */ + var dcode; /* local strm.distcode */ + var lmask; /* mask for first level of length codes */ + var dmask; /* mask for first level of distance codes */ + var here; /* retrieved table entry */ + var op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + var len; /* match length, unused bytes */ + var dist; /* match distance */ + var from; /* where to copy match from */ + var from_source; + var input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + var state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); + //#ifdef INFLATE_STRICT + dmax = state.dmax; + //#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = lcode[hold & lmask]; + dolen: for (;;) { + // Goto emulation + op = here >>> 24 /*here.bits*/; + hold >>>= op; + bits -= op; + op = here >>> 16 & 0xff /*here.op*/; + if (op === 0) { + /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff /*here.val*/; + } else if (op & 16) { + /* length base */ + len = here & 0xffff /*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & (1 << op) - 1; + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + dodist: for (;;) { + // goto emulation + op = here >>> 24 /*here.bits*/; + hold >>>= op; + bits -= op; + op = here >>> 16 & 0xff /*here.op*/; + + if (op & 16) { + /* distance base */ + dist = here & 0xffff /*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & (1 << op) - 1; + //#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + //#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { + /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // if (len <= op - whave) { + // do { + // output[_out++] = 0; + // } while (--len); + // continue top; + // } + // len -= op - whave; + // do { + // output[_out++] = 0; + // } while (--op > whave); + // if (op === 0) { + // from = _out - dist; + // do { + // output[_out++] = output[from++]; + // } while (--len); + // continue top; + // } + //#endif + } + + from = 0; // window index + from_source = s_window; + if (wnext === 0) { + /* very common case */ + from += wsize - op; + if (op < len) { + /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } else if (wnext < op) { + /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { + /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { + /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } else { + /* contiguous in window */ + from += wnext - op; + if (op < len) { + /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } else { + from = _out - dist; /* copy direct from output */ + do { + /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } else if ((op & 64) === 0) { + /* 2nd level distance code */ + here = dcode[(here & 0xffff /*here.val*/) + (hold & (1 << op) - 1)]; + continue dodist; + } else { + strm.msg = 'invalid distance code'; + state.mode = BAD$1; + break top; + } + break; // need to emulate goto via "continue" + } + } else if ((op & 64) === 0) { + /* 2nd level length code */ + here = lcode[(here & 0xffff /*here.val*/) + (hold & (1 << op) - 1)]; + continue dolen; + } else if (op & 32) { + /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE$1; + break top; + } else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD$1; + break top; + } + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last); + strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end); + state.hold = hold; + state.bits = bits; + return; + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var MAXBITS = 15; + var ENOUGH_LENS$1 = 852; + var ENOUGH_DISTS$1 = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + var CODES$1 = 0; + var LENS$1 = 1; + var DISTS$1 = 2; + var lbase = new Uint16Array([/* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0]); + var lext = new Uint8Array([/* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78]); + var dbase = new Uint16Array([/* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0]); + var dext = new Uint8Array([/* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64]); + var inflate_table = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) { + var bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + var len = 0; /* a code's length in bits */ + var sym = 0; /* index of code symbols */ + var min = 0, + max = 0; /* minimum and maximum code lengths */ + var root = 0; /* number of index bits for root table */ + var curr = 0; /* number of index bits for current table */ + var drop = 0; /* code bits to drop for sub-table */ + var left = 0; /* number of prefix codes available */ + var used = 0; /* code entries in table used */ + var huff = 0; /* Huffman code */ + var incr; /* for incrementing code, index */ + var fill; /* index for replicating entries */ + var low; /* low bits for current root entry */ + var mask; /* mask for low root bits */ + var next; /* next available space in table */ + var base = null; /* base value table to use */ + // let shoextra; /* extra bits table to use */ + var match; /* use base and extra for symbol >= match */ + var count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + var offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + var extra = null; + var here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { + break; + } + } + if (root > max) { + root = max; + } + if (max === 0) { + /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = 1 << 24 | 64 << 16 | 0; + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = 1 << 24 | 64 << 16 | 0; + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + + for (min = 1; min < max; min++) { + if (count[min] !== 0) { + break; + } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + + if (left > 0 && (type === CODES$1 || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES$1) { + base = extra = work; /* dummy value--not used */ + match = 20; + } else if (type === LENS$1) { + base = lbase; + extra = lext; + match = 257; + } else { + /* DISTS */ + base = dbase; + extra = dext; + match = 0; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if (type === LENS$1 && used > ENOUGH_LENS$1 || type === DISTS$1 && used > ENOUGH_DISTS$1) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] + 1 < match) { + here_op = 0; + here_val = work[sym]; + } else if (work[sym] >= match) { + here_op = extra[work[sym] - match]; + here_val = base[work[sym] - match]; + } else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << len - drop; + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << len - 1; + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { + break; + } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { + break; + } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if (type === LENS$1 && used > ENOUGH_LENS$1 || type === DISTS$1 && used > ENOUGH_DISTS$1) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = root << 24 | curr << 16 | next - table_index | 0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = len - drop << 24 | 64 << 16 | 0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; + }; + var inftrees = inflate_table; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var CODES = 0; + var LENS = 1; + var DISTS = 2; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_FINISH$1 = constants$2.Z_FINISH, + Z_BLOCK = constants$2.Z_BLOCK, + Z_TREES = constants$2.Z_TREES, + Z_OK$1 = constants$2.Z_OK, + Z_STREAM_END$1 = constants$2.Z_STREAM_END, + Z_NEED_DICT$1 = constants$2.Z_NEED_DICT, + Z_STREAM_ERROR$1 = constants$2.Z_STREAM_ERROR, + Z_DATA_ERROR$1 = constants$2.Z_DATA_ERROR, + Z_MEM_ERROR$1 = constants$2.Z_MEM_ERROR, + Z_BUF_ERROR = constants$2.Z_BUF_ERROR, + Z_DEFLATED = constants$2.Z_DEFLATED; + + /* STATES ====================================================================*/ + /* ===========================================================================*/ + + var HEAD = 16180; /* i: waiting for magic header */ + var FLAGS = 16181; /* i: waiting for method and flags (gzip) */ + var TIME = 16182; /* i: waiting for modification time (gzip) */ + var OS = 16183; /* i: waiting for extra flags and operating system (gzip) */ + var EXLEN = 16184; /* i: waiting for extra length (gzip) */ + var EXTRA = 16185; /* i: waiting for extra bytes (gzip) */ + var NAME = 16186; /* i: waiting for end of file name (gzip) */ + var COMMENT = 16187; /* i: waiting for end of comment (gzip) */ + var HCRC = 16188; /* i: waiting for header crc (gzip) */ + var DICTID = 16189; /* i: waiting for dictionary check value */ + var DICT = 16190; /* waiting for inflateSetDictionary() call */ + var TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ + var TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */ + var STORED = 16193; /* i: waiting for stored size (length and complement) */ + var COPY_ = 16194; /* i/o: same as COPY below, but only first time in */ + var COPY = 16195; /* i/o: waiting for input or output to copy stored block */ + var TABLE = 16196; /* i: waiting for dynamic block table lengths */ + var LENLENS = 16197; /* i: waiting for code length code lengths */ + var CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */ + var LEN_ = 16199; /* i: same as LEN below, but only first time in */ + var LEN = 16200; /* i: waiting for length/lit/eob code */ + var LENEXT = 16201; /* i: waiting for length extra bits */ + var DIST = 16202; /* i: waiting for distance code */ + var DISTEXT = 16203; /* i: waiting for distance extra bits */ + var MATCH = 16204; /* o: waiting for output space to copy string */ + var LIT = 16205; /* o: waiting for output space to write literal */ + var CHECK = 16206; /* i: waiting for 32-bit check value */ + var LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */ + var DONE = 16208; /* finished check, done -- remain here until reset */ + var BAD = 16209; /* got a data error -- remain here until reset */ + var MEM = 16210; /* got an inflate() memory error -- remain here until reset */ + var SYNC = 16211; /* looking for synchronization bytes to restart inflate() */ + + /* ===========================================================================*/ + + var ENOUGH_LENS = 852; + var ENOUGH_DISTS = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + var MAX_WBITS = 15; + /* 32K LZ77 window */ + var DEF_WBITS = MAX_WBITS; + var zswap32 = function zswap32(q) { + return (q >>> 24 & 0xff) + (q >>> 8 & 0xff00) + ((q & 0xff00) << 8) + ((q & 0xff) << 24); + }; + function InflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip, + bit 2 true to validate check value */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib), or + -1 if raw or no header yet */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ + } + + var inflateStateCheck = function inflateStateCheck(strm) { + if (!strm) { + return 1; + } + var state = strm.state; + if (!state || state.strm !== strm || state.mode < HEAD || state.mode > SYNC) { + return 1; + } + return 0; + }; + var inflateResetKeep = function inflateResetKeep(strm) { + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { + /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.flags = -1; + state.dmax = 32768; + state.head = null /*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK$1; + }; + var inflateReset = function inflateReset(strm) { + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + }; + var inflateReset2 = function inflateReset2(strm, windowBits) { + var wrap; + + /* get the state */ + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } else { + wrap = (windowBits >> 4) + 5; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR$1; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); + }; + var inflateInit2 = function inflateInit2(strm, windowBits) { + if (!strm) { + return Z_STREAM_ERROR$1; + } + //strm.msg = Z_NULL; /* in case we return an error */ + + var state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.strm = strm; + state.window = null /*Z_NULL*/; + state.mode = HEAD; /* to pass state test in inflateReset2() */ + var ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK$1) { + strm.state = null /*Z_NULL*/; + } + + return ret; + }; + var inflateInit = function inflateInit(strm) { + return inflateInit2(strm, DEF_WBITS); + }; + + /* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ + var virgin = true; + var lenfix, distfix; // We have no pointers in JS, so keep tables separate + + var fixedtables = function fixedtables(state) { + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + var sym = 0; + while (sym < 144) { + state.lens[sym++] = 8; + } + while (sym < 256) { + state.lens[sym++] = 9; + } + while (sym < 280) { + state.lens[sym++] = 7; + } + while (sym < 288) { + state.lens[sym++] = 8; + } + inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { + bits: 9 + }); + + /* distance table */ + sym = 0; + while (sym < 32) { + state.lens[sym++] = 5; + } + inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { + bits: 5 + }); + + /* do this just once */ + virgin = false; + } + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; + }; + + /* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ + var updatewindow = function updatewindow(strm, src, end, copy) { + var dist; + var state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } else { + state.wnext += dist; + if (state.wnext === state.wsize) { + state.wnext = 0; + } + if (state.whave < state.wsize) { + state.whave += dist; + } + } + } + return 0; + }; + var inflate$2 = function inflate(strm, flush) { + var state; + var input, output; // input/output buffers + var next; /* next input INDEX */ + var put; /* next output INDEX */ + var have, left; /* available input and output */ + var hold; /* bit buffer */ + var bits; /* bits in bit buffer */ + var _in, _out; /* save starting available input and output */ + var copy; /* number of stored or match bytes to copy */ + var from; /* where to copy match bytes from */ + var from_source; + var here = 0; /* current decoding table entry */ + var here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + var last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + var len; /* length to copy for repeats, bits to drop */ + var ret; /* return code */ + var hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + var opts; + var n; // temporary variable for NEED_BITS + + var order = /* permutation of code lengths */ + new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]); + if (inflateStateCheck(strm) || !strm.output || !strm.input && strm.avail_in !== 0) { + return Z_STREAM_ERROR$1; + } + state = strm.state; + if (state.mode === TYPE) { + state.mode = TYPEDO; + } /* skip check */ + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK$1; + inf_leave: + // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.wrap & 2 && hold === 0x8b1f) { + /* gzip header */ + if (state.wbits === 0) { + state.wbits = 15; + } + state.check = 0 /*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff /*BITS(8)*/) << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f /*BITS(4)*/) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f /*BITS(4)*/) + 8; + if (state.wbits === 0) { + state.wbits = len; + } + if (len > 15 || len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + state.flags = 0; /* indicate zlib header */ + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1 /*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = hold >> 8 & 1; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + hbuf[2] = hold >>> 16 & 0xff; + hbuf[3] = hold >>> 24 & 0xff; + state.check = crc32_1(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = hold & 0xff; + state.head.os = hold >> 8; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } else if (state.head) { + state.head.extra = null /*Z_NULL*/; + } + + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { + copy = have; + } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set(input.subarray(next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy), /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + + if (state.flags & 0x0200 && state.wrap & 4) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { + break inf_leave; + } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { + break inf_leave; + } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && state.length < 65536 /*state.head.name_max*/) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + if (state.flags & 0x0200 && state.wrap & 4) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { + break inf_leave; + } + } else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { + break inf_leave; + } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && state.length < 65536 /*state.head.comm_max*/) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if (state.flags & 0x0200 && state.wrap & 4) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { + break inf_leave; + } + } else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.wrap & 4 && hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + + if (state.head) { + state.head.hcrc = state.flags >> 9 & 1; + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT$1; + } + strm.adler = state.check = 1 /*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { + break inf_leave; + } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = hold & 0x01 /*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch (hold & 0x03 /*BITS(2)*/) { + case 0: + /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: + /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: + /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== (hold >>> 16 ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { + break inf_leave; + } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { + copy = have; + } + if (copy > left) { + copy = left; + } + if (copy === 0) { + break inf_leave; + } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f /*BITS(5)*/) + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f /*BITS(5)*/) + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f /*BITS(4)*/) + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + //#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } + //#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = hold & 0x07; //BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + opts = { + bits: state.lenbits + }; + ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & (1 << state.lenbits) - 1]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03); //BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07); //BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f); //BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { + break; + } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + opts = { + bits: state.lenbits + }; + ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { + bits: state.distbits + }; + ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { + break inf_leave; + } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inffast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & (1 << state.lenbits) - 1]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + ((hold & (1 << last_bits + last_op) - 1 /*BITS(last.bits + last.op)*/) >> last_bits)]; + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (last_bits + here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & (1 << state.extra) - 1 /*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & (1 << state.distbits) - 1]; /*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + ((hold & (1 << last_bits + last_op) - 1 /*BITS(last.bits + last.op)*/) >> last_bits)]; + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (last_bits + here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = here_op & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & (1 << state.extra) - 1 /*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + //#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { + break inf_leave; + } + copy = _out - left; + if (state.offset > copy) { + /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // Trace((stderr, "inflate.c too far\n")); + // copy -= state.whave; + // if (copy > state.length) { copy = state.length; } + // if (copy > left) { copy = left; } + // left -= copy; + // state.length -= copy; + // do { + // output[put++] = 0; + // } while (--copy); + // if (state.length === 0) { state.mode = LEN; } + // break; + //#endif + } + + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } else { + from = state.wnext - copy; + } + if (copy > state.length) { + copy = state.length; + } + from_source = state.window; + } else { + /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { + copy = left; + } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { + state.mode = LEN; + } + break; + case LIT: + if (left === 0) { + break inf_leave; + } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if (state.wrap & 4 && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/ + state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out); + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if (state.wrap & 4 && (state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.wrap & 4 && hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END$1; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR$1; + break inf_leave; + case MEM: + return Z_MEM_ERROR$1; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR$1; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || _out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH$1)) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ; + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if (state.wrap & 4 && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/ + state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if ((_in === 0 && _out === 0 || flush === Z_FINISH$1) && ret === Z_OK$1) { + ret = Z_BUF_ERROR; + } + return ret; + }; + var inflateEnd = function inflateEnd(strm) { + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK$1; + }; + var inflateGetHeader = function inflateGetHeader(strm, head) { + /* check state */ + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + if ((state.wrap & 2) === 0) { + return Z_STREAM_ERROR$1; + } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK$1; + }; + var inflateSetDictionary = function inflateSetDictionary(strm, dictionary) { + var dictLength = dictionary.length; + var state; + var dictid; + var ret; + + /* check state */ + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + state = strm.state; + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR$1; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32_1(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR$1; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR$1; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK$1; + }; + var inflateReset_1 = inflateReset; + var inflateReset2_1 = inflateReset2; + var inflateResetKeep_1 = inflateResetKeep; + var inflateInit_1 = inflateInit; + var inflateInit2_1 = inflateInit2; + var inflate_2$1 = inflate$2; + var inflateEnd_1 = inflateEnd; + var inflateGetHeader_1 = inflateGetHeader; + var inflateSetDictionary_1 = inflateSetDictionary; + var inflateInfo = 'pako inflate (from Nodeca project)'; + + /* Not implemented + module.exports.inflateCodesUsed = inflateCodesUsed; + module.exports.inflateCopy = inflateCopy; + module.exports.inflateGetDictionary = inflateGetDictionary; + module.exports.inflateMark = inflateMark; + module.exports.inflatePrime = inflatePrime; + module.exports.inflateSync = inflateSync; + module.exports.inflateSyncPoint = inflateSyncPoint; + module.exports.inflateUndermine = inflateUndermine; + module.exports.inflateValidate = inflateValidate; + */ + + var inflate_1$2 = { + inflateReset: inflateReset_1, + inflateReset2: inflateReset2_1, + inflateResetKeep: inflateResetKeep_1, + inflateInit: inflateInit_1, + inflateInit2: inflateInit2_1, + inflate: inflate_2$1, + inflateEnd: inflateEnd_1, + inflateGetHeader: inflateGetHeader_1, + inflateSetDictionary: inflateSetDictionary_1, + inflateInfo: inflateInfo + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; + } + var gzheader = GZheader; + + var toString = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_NO_FLUSH = constants$2.Z_NO_FLUSH, + Z_FINISH = constants$2.Z_FINISH, + Z_OK = constants$2.Z_OK, + Z_STREAM_END = constants$2.Z_STREAM_END, + Z_NEED_DICT = constants$2.Z_NEED_DICT, + Z_STREAM_ERROR = constants$2.Z_STREAM_ERROR, + Z_DATA_ERROR = constants$2.Z_DATA_ERROR, + Z_MEM_ERROR = constants$2.Z_MEM_ERROR; + + /* ===========================================================================*/ + + /** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + + /* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + + /** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + + /** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + /** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ + function Inflate$1(options) { + this.options = common.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + var opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && opt.windowBits >= 0 && opt.windowBits < 16) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { + opt.windowBits = -15; + } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if (opt.windowBits >= 0 && opt.windowBits < 16 && !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if (opt.windowBits > 15 && opt.windowBits < 48) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + var status = inflate_1$2.inflateInit2(this.strm, opt.windowBits); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + this.header = new gzheader(); + inflate_1$2.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { + //In raw mode we need to set the dictionary early + status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + } + } + } + + /** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Inflate$1.prototype.push = function (data, flush_mode) { + var strm = this.strm; + var chunkSize = this.options.chunkSize; + var dictionary = this.options.dictionary; + var status, _flush_mode, last_avail_out; + if (this.ended) return false; + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + strm.next_in = 0; + strm.avail_in = strm.input.length; + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + status = inflate_1$2.inflate(strm, _flush_mode); + if (status === Z_NEED_DICT && dictionary) { + status = inflate_1$2.inflateSetDictionary(strm, dictionary); + if (status === Z_OK) { + status = inflate_1$2.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && status === Z_STREAM_END && strm.state.wrap > 0 && data[strm.next_in] !== 0) { + inflate_1$2.inflateReset(strm); + status = inflate_1$2.inflate(strm, _flush_mode); + } + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + if (this.options.to === 'string') { + var next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + var tail = strm.next_out - next_out_utf8; + var utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + this.onData(utf8str); + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = inflate_1$2.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + if (strm.avail_in === 0) break; + } + return true; + }; + + /** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Inflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + /** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Inflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = common.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + /** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ + function inflate$1(input, options) { + var inflator = new Inflate$1(options); + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || messages[inflator.err]; + return inflator.result; + } + + /** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function inflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return inflate$1(input, options); + } + + /** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + var Inflate_1$1 = Inflate$1; + var inflate_2 = inflate$1; + var inflateRaw_1$1 = inflateRaw$1; + var ungzip$1 = inflate$1; + var constants = constants$2; + var inflate_1$1 = { + Inflate: Inflate_1$1, + inflate: inflate_2, + inflateRaw: inflateRaw_1$1, + ungzip: ungzip$1, + constants: constants + }; + + var Deflate = deflate_1$1.Deflate, + deflate = deflate_1$1.deflate, + deflateRaw = deflate_1$1.deflateRaw, + gzip = deflate_1$1.gzip; + var Inflate = inflate_1$1.Inflate, + inflate = inflate_1$1.inflate, + inflateRaw = inflate_1$1.inflateRaw, + ungzip = inflate_1$1.ungzip; + var Deflate_1 = Deflate; + var deflate_1 = deflate; + var deflateRaw_1 = deflateRaw; + var gzip_1 = gzip; + var Inflate_1 = Inflate; + var inflate_1 = inflate; + var inflateRaw_1 = inflateRaw; + var ungzip_1 = ungzip; + var constants_1 = constants$2; + var pako = { + Deflate: Deflate_1, + deflate: deflate_1, + deflateRaw: deflateRaw_1, + gzip: gzip_1, + Inflate: Inflate_1, + inflate: inflate_1, + inflateRaw: inflateRaw_1, + ungzip: ungzip_1, + constants: constants_1 + }; + + exports.Deflate = Deflate_1; + exports.Inflate = Inflate_1; + exports.constants = constants_1; + exports["default"] = pako; + exports.deflate = deflate_1; + exports.deflateRaw = deflateRaw_1; + exports.gzip = gzip_1; + exports.inflate = inflate_1; + exports.inflateRaw = inflateRaw_1; + exports.ungzip = ungzip_1; + + Object.defineProperty(exports, '__esModule', { value: true }); + +})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako.es5.min.js b/测试流式传输uniapp/node_modules/pako/dist/pako.es5.min.js new file mode 100644 index 0000000..5ffaec0 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako.es5.min.js @@ -0,0 +1,2 @@ +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self).pako={})}(this,(function(t){"use strict";function e(t){for(var e=t.length;--e>=0;)t[e]=0}var a=256,n=286,i=30,r=15,s=new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]),o=new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]),l=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),h=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),d=new Array(576);e(d);var _=new Array(60);e(_);var f=new Array(512);e(f);var u=new Array(256);e(u);var c=new Array(29);e(c);var w,m,b,g=new Array(i);function p(t,e,a,n,i){this.static_tree=t,this.extra_bits=e,this.extra_base=a,this.elems=n,this.max_length=i,this.has_stree=t&&t.length}function v(t,e){this.dyn_tree=t,this.max_code=0,this.stat_desc=e}e(g);var k=function(t){return t<256?f[t]:f[256+(t>>>7)]},y=function(t,e){t.pending_buf[t.pending++]=255&e,t.pending_buf[t.pending++]=e>>>8&255},x=function(t,e,a){t.bi_valid>16-a?(t.bi_buf|=e<>16-t.bi_valid,t.bi_valid+=a-16):(t.bi_buf|=e<>>=1,a<<=1}while(--e>0);return a>>>1},E=function(t,e,a){var n,i,s=new Array(16),o=0;for(n=1;n<=r;n++)o=o+a[n-1]<<1,s[n]=o;for(i=0;i<=e;i++){var l=t[2*i+1];0!==l&&(t[2*i]=A(s[l]++,l))}},R=function(t){var e;for(e=0;e8?y(t,t.bi_buf):t.bi_valid>0&&(t.pending_buf[t.pending++]=t.bi_buf),t.bi_buf=0,t.bi_valid=0},S=function(t,e,a,n){var i=2*e,r=2*a;return t[i]>1;a>=1;a--)U(t,s,a);i=h;do{a=t.heap[1],t.heap[1]=t.heap[t.heap_len--],U(t,s,1),n=t.heap[1],t.heap[--t.heap_max]=a,t.heap[--t.heap_max]=n,s[2*i]=s[2*a]+s[2*n],t.depth[i]=(t.depth[a]>=t.depth[n]?t.depth[a]:t.depth[n])+1,s[2*a+1]=s[2*n+1]=i,t.heap[1]=i++,U(t,s,1)}while(t.heap_len>=2);t.heap[--t.heap_max]=t.heap[1],function(t,e){var a,n,i,s,o,l,h=e.dyn_tree,d=e.max_code,_=e.stat_desc.static_tree,f=e.stat_desc.has_stree,u=e.stat_desc.extra_bits,c=e.stat_desc.extra_base,w=e.stat_desc.max_length,m=0;for(s=0;s<=r;s++)t.bl_count[s]=0;for(h[2*t.heap[t.heap_max]+1]=0,a=t.heap_max+1;a<573;a++)(s=h[2*h[2*(n=t.heap[a])+1]+1]+1)>w&&(s=w,m++),h[2*n+1]=s,n>d||(t.bl_count[s]++,o=0,n>=c&&(o=u[n-c]),l=h[2*n],t.opt_len+=l*(s+o),f&&(t.static_len+=l*(_[2*n+1]+o)));if(0!==m){do{for(s=w-1;0===t.bl_count[s];)s--;t.bl_count[s]--,t.bl_count[s+1]+=2,t.bl_count[w]--,m-=2}while(m>0);for(s=w;0!==s;s--)for(n=t.bl_count[s];0!==n;)(i=t.heap[--a])>d||(h[2*i+1]!==s&&(t.opt_len+=(s-h[2*i+1])*h[2*i],h[2*i+1]=s),n--)}}(t,e),E(s,d,t.bl_count)},O=function(t,e,a){var n,i,r=-1,s=e[1],o=0,l=7,h=4;for(0===s&&(l=138,h=3),e[2*(a+1)+1]=65535,n=0;n<=a;n++)i=s,s=e[2*(n+1)+1],++o0?(2===t.strm.data_type&&(t.strm.data_type=function(t){var e,n=4093624447;for(e=0;e<=31;e++,n>>>=1)if(1&n&&0!==t.dyn_ltree[2*e])return 0;if(0!==t.dyn_ltree[18]||0!==t.dyn_ltree[20]||0!==t.dyn_ltree[26])return 1;for(e=32;e=3&&0===t.bl_tree[2*h[e]+1];e--);return t.opt_len+=3*(e+1)+5+5+4,e}(t),r=t.opt_len+3+7>>>3,(s=t.static_len+3+7>>>3)<=r&&(r=s)):r=s=n+5,n+4<=r&&-1!==e?L(t,e,n,i):4===t.strategy||s===r?(x(t,2+(i?1:0),3),D(t,d,_)):(x(t,4+(i?1:0),3),function(t,e,a,n){var i;for(x(t,e-257,5),x(t,a-1,5),x(t,n-4,4),i=0;i>=7;h>8,t.pending_buf[t.sym_buf+t.sym_next++]=n,0===e?t.dyn_ltree[2*n]++:(t.matches++,e--,t.dyn_ltree[2*(u[n]+a+1)]++,t.dyn_dtree[2*k(e)]++),t.sym_next===t.sym_end},_tr_align:function(t){x(t,2,3),z(t,256,d),function(t){16===t.bi_valid?(y(t,t.bi_buf),t.bi_buf=0,t.bi_valid=0):t.bi_valid>=8&&(t.pending_buf[t.pending++]=255&t.bi_buf,t.bi_buf>>=8,t.bi_valid-=8)}(t)}},C=function(t,e,a,n){for(var i=65535&t|0,r=t>>>16&65535|0,s=0;0!==a;){a-=s=a>2e3?2e3:a;do{r=r+(i=i+e[n++]|0)|0}while(--s);i%=65521,r%=65521}return i|r<<16|0},M=new Uint32Array(function(){for(var t,e=[],a=0;a<256;a++){t=a;for(var n=0;n<8;n++)t=1&t?3988292384^t>>>1:t>>>1;e[a]=t}return e}()),H=function(t,e,a,n){var i=M,r=n+a;t^=-1;for(var s=n;s>>8^i[255&(t^e[s])];return-1^t},j={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},K={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8},P=B._tr_init,Y=B._tr_stored_block,G=B._tr_flush_block,X=B._tr_tally,W=B._tr_align,q=K.Z_NO_FLUSH,J=K.Z_PARTIAL_FLUSH,Q=K.Z_FULL_FLUSH,V=K.Z_FINISH,$=K.Z_BLOCK,tt=K.Z_OK,et=K.Z_STREAM_END,at=K.Z_STREAM_ERROR,nt=K.Z_DATA_ERROR,it=K.Z_BUF_ERROR,rt=K.Z_DEFAULT_COMPRESSION,st=K.Z_FILTERED,ot=K.Z_HUFFMAN_ONLY,lt=K.Z_RLE,ht=K.Z_FIXED,dt=K.Z_DEFAULT_STRATEGY,_t=K.Z_UNKNOWN,ft=K.Z_DEFLATED,ut=258,ct=262,wt=42,mt=113,bt=666,gt=function(t,e){return t.msg=j[e],e},pt=function(t){return 2*t-(t>4?9:0)},vt=function(t){for(var e=t.length;--e>=0;)t[e]=0},kt=function(t){var e,a,n,i=t.w_size;n=e=t.hash_size;do{a=t.head[--n],t.head[n]=a>=i?a-i:0}while(--e);n=e=i;do{a=t.prev[--n],t.prev[n]=a>=i?a-i:0}while(--e)},yt=function(t,e,a){return(e<t.avail_out&&(a=t.avail_out),0!==a&&(t.output.set(e.pending_buf.subarray(e.pending_out,e.pending_out+a),t.next_out),t.next_out+=a,e.pending_out+=a,t.total_out+=a,t.avail_out-=a,e.pending-=a,0===e.pending&&(e.pending_out=0))},zt=function(t,e){G(t,t.block_start>=0?t.block_start:-1,t.strstart-t.block_start,e),t.block_start=t.strstart,xt(t.strm)},At=function(t,e){t.pending_buf[t.pending++]=e},Et=function(t,e){t.pending_buf[t.pending++]=e>>>8&255,t.pending_buf[t.pending++]=255&e},Rt=function(t,e,a,n){var i=t.avail_in;return i>n&&(i=n),0===i?0:(t.avail_in-=i,e.set(t.input.subarray(t.next_in,t.next_in+i),a),1===t.state.wrap?t.adler=C(t.adler,e,i,a):2===t.state.wrap&&(t.adler=H(t.adler,e,i,a)),t.next_in+=i,t.total_in+=i,i)},Zt=function(t,e){var a,n,i=t.max_chain_length,r=t.strstart,s=t.prev_length,o=t.nice_match,l=t.strstart>t.w_size-ct?t.strstart-(t.w_size-ct):0,h=t.window,d=t.w_mask,_=t.prev,f=t.strstart+ut,u=h[r+s-1],c=h[r+s];t.prev_length>=t.good_match&&(i>>=2),o>t.lookahead&&(o=t.lookahead);do{if(h[(a=e)+s]===c&&h[a+s-1]===u&&h[a]===h[r]&&h[++a]===h[r+1]){r+=2,a++;do{}while(h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&rs){if(t.match_start=e,s=n,n>=o)break;u=h[r+s-1],c=h[r+s]}}}while((e=_[e&d])>l&&0!=--i);return s<=t.lookahead?s:t.lookahead},St=function(t){var e,a,n,i=t.w_size;do{if(a=t.window_size-t.lookahead-t.strstart,t.strstart>=i+(i-ct)&&(t.window.set(t.window.subarray(i,i+i-a),0),t.match_start-=i,t.strstart-=i,t.block_start-=i,t.insert>t.strstart&&(t.insert=t.strstart),kt(t),a+=i),0===t.strm.avail_in)break;if(e=Rt(t.strm,t.window,t.strstart+t.lookahead,a),t.lookahead+=e,t.lookahead+t.insert>=3)for(n=t.strstart-t.insert,t.ins_h=t.window[n],t.ins_h=yt(t,t.ins_h,t.window[n+1]);t.insert&&(t.ins_h=yt(t,t.ins_h,t.window[n+3-1]),t.prev[n&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=n,n++,t.insert--,!(t.lookahead+t.insert<3)););}while(t.lookaheadt.w_size?t.w_size:t.pending_buf_size-5,s=0,o=t.strm.avail_in;do{if(a=65535,i=t.bi_valid+42>>3,t.strm.avail_out(n=t.strstart-t.block_start)+t.strm.avail_in&&(a=n+t.strm.avail_in),a>i&&(a=i),a>8,t.pending_buf[t.pending-2]=~a,t.pending_buf[t.pending-1]=~a>>8,xt(t.strm),n&&(n>a&&(n=a),t.strm.output.set(t.window.subarray(t.block_start,t.block_start+n),t.strm.next_out),t.strm.next_out+=n,t.strm.avail_out-=n,t.strm.total_out+=n,t.block_start+=n,a-=n),a&&(Rt(t.strm,t.strm.output,t.strm.next_out,a),t.strm.next_out+=a,t.strm.avail_out-=a,t.strm.total_out+=a)}while(0===s);return(o-=t.strm.avail_in)&&(o>=t.w_size?(t.matches=2,t.window.set(t.strm.input.subarray(t.strm.next_in-t.w_size,t.strm.next_in),0),t.strstart=t.w_size,t.insert=t.strstart):(t.window_size-t.strstart<=o&&(t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,t.insert>t.strstart&&(t.insert=t.strstart)),t.window.set(t.strm.input.subarray(t.strm.next_in-o,t.strm.next_in),t.strstart),t.strstart+=o,t.insert+=o>t.w_size-t.insert?t.w_size-t.insert:o),t.block_start=t.strstart),t.high_wateri&&t.block_start>=t.w_size&&(t.block_start-=t.w_size,t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,i+=t.w_size,t.insert>t.strstart&&(t.insert=t.strstart)),i>t.strm.avail_in&&(i=t.strm.avail_in),i&&(Rt(t.strm,t.window,t.strstart,i),t.strstart+=i,t.insert+=i>t.w_size-t.insert?t.w_size-t.insert:i),t.high_water>3,r=(i=t.pending_buf_size-i>65535?65535:t.pending_buf_size-i)>t.w_size?t.w_size:i,((n=t.strstart-t.block_start)>=r||(n||e===V)&&e!==q&&0===t.strm.avail_in&&n<=i)&&(a=n>i?i:n,s=e===V&&0===t.strm.avail_in&&a===n?1:0,Y(t,t.block_start,a,s),t.block_start+=a,xt(t.strm)),s?3:1)},Dt=function(t,e){for(var a,n;;){if(t.lookahead=3&&(t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),0!==a&&t.strstart-a<=t.w_size-ct&&(t.match_length=Zt(t,a)),t.match_length>=3)if(n=X(t,t.strstart-t.match_start,t.match_length-3),t.lookahead-=t.match_length,t.match_length<=t.max_lazy_match&&t.lookahead>=3){t.match_length--;do{t.strstart++,t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart}while(0!=--t.match_length);t.strstart++}else t.strstart+=t.match_length,t.match_length=0,t.ins_h=t.window[t.strstart],t.ins_h=yt(t,t.ins_h,t.window[t.strstart+1]);else n=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++;if(n&&(zt(t,!1),0===t.strm.avail_out))return 1}return t.insert=t.strstart<2?t.strstart:2,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2},Tt=function(t,e){for(var a,n,i;;){if(t.lookahead=3&&(t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),t.prev_length=t.match_length,t.prev_match=t.match_start,t.match_length=2,0!==a&&t.prev_length4096)&&(t.match_length=2)),t.prev_length>=3&&t.match_length<=t.prev_length){i=t.strstart+t.lookahead-3,n=X(t,t.strstart-1-t.prev_match,t.prev_length-3),t.lookahead-=t.prev_length-1,t.prev_length-=2;do{++t.strstart<=i&&(t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart)}while(0!=--t.prev_length);if(t.match_available=0,t.match_length=2,t.strstart++,n&&(zt(t,!1),0===t.strm.avail_out))return 1}else if(t.match_available){if((n=X(t,0,t.window[t.strstart-1]))&&zt(t,!1),t.strstart++,t.lookahead--,0===t.strm.avail_out)return 1}else t.match_available=1,t.strstart++,t.lookahead--}return t.match_available&&(n=X(t,0,t.window[t.strstart-1]),t.match_available=0),t.insert=t.strstart<2?t.strstart:2,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2};function Ot(t,e,a,n,i){this.good_length=t,this.max_lazy=e,this.nice_length=a,this.max_chain=n,this.func=i}var It=[new Ot(0,0,0,0,Ut),new Ot(4,4,8,4,Dt),new Ot(4,5,16,8,Dt),new Ot(4,6,32,32,Dt),new Ot(4,4,16,16,Tt),new Ot(8,16,32,32,Tt),new Ot(8,16,128,128,Tt),new Ot(8,32,128,256,Tt),new Ot(32,128,258,1024,Tt),new Ot(32,258,258,4096,Tt)];function Ft(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=ft,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(1146),this.dyn_dtree=new Uint16Array(122),this.bl_tree=new Uint16Array(78),vt(this.dyn_ltree),vt(this.dyn_dtree),vt(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(16),this.heap=new Uint16Array(573),vt(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(573),vt(this.depth),this.sym_buf=0,this.lit_bufsize=0,this.sym_next=0,this.sym_end=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}var Lt=function(t){if(!t)return 1;var e=t.state;return!e||e.strm!==t||e.status!==wt&&57!==e.status&&69!==e.status&&73!==e.status&&91!==e.status&&103!==e.status&&e.status!==mt&&e.status!==bt?1:0},Nt=function(t){if(Lt(t))return gt(t,at);t.total_in=t.total_out=0,t.data_type=_t;var e=t.state;return e.pending=0,e.pending_out=0,e.wrap<0&&(e.wrap=-e.wrap),e.status=2===e.wrap?57:e.wrap?wt:mt,t.adler=2===e.wrap?0:1,e.last_flush=-2,P(e),tt},Bt=function(t){var e,a=Nt(t);return a===tt&&((e=t.state).window_size=2*e.w_size,vt(e.head),e.max_lazy_match=It[e.level].max_lazy,e.good_match=It[e.level].good_length,e.nice_match=It[e.level].nice_length,e.max_chain_length=It[e.level].max_chain,e.strstart=0,e.block_start=0,e.lookahead=0,e.insert=0,e.match_length=e.prev_length=2,e.match_available=0,e.ins_h=0),a},Ct=function(t,e,a,n,i,r){if(!t)return at;var s=1;if(e===rt&&(e=6),n<0?(s=0,n=-n):n>15&&(s=2,n-=16),i<1||i>9||a!==ft||n<8||n>15||e<0||e>9||r<0||r>ht||8===n&&1!==s)return gt(t,at);8===n&&(n=9);var o=new Ft;return t.state=o,o.strm=t,o.status=wt,o.wrap=s,o.gzhead=null,o.w_bits=n,o.w_size=1<$||e<0)return t?gt(t,at):at;var a=t.state;if(!t.output||0!==t.avail_in&&!t.input||a.status===bt&&e!==V)return gt(t,0===t.avail_out?it:at);var n=a.last_flush;if(a.last_flush=e,0!==a.pending){if(xt(t),0===t.avail_out)return a.last_flush=-1,tt}else if(0===t.avail_in&&pt(e)<=pt(n)&&e!==V)return gt(t,it);if(a.status===bt&&0!==t.avail_in)return gt(t,it);if(a.status===wt&&0===a.wrap&&(a.status=mt),a.status===wt){var i=ft+(a.w_bits-8<<4)<<8;if(i|=(a.strategy>=ot||a.level<2?0:a.level<6?1:6===a.level?2:3)<<6,0!==a.strstart&&(i|=32),Et(a,i+=31-i%31),0!==a.strstart&&(Et(a,t.adler>>>16),Et(a,65535&t.adler)),t.adler=1,a.status=mt,xt(t),0!==a.pending)return a.last_flush=-1,tt}if(57===a.status)if(t.adler=0,At(a,31),At(a,139),At(a,8),a.gzhead)At(a,(a.gzhead.text?1:0)+(a.gzhead.hcrc?2:0)+(a.gzhead.extra?4:0)+(a.gzhead.name?8:0)+(a.gzhead.comment?16:0)),At(a,255&a.gzhead.time),At(a,a.gzhead.time>>8&255),At(a,a.gzhead.time>>16&255),At(a,a.gzhead.time>>24&255),At(a,9===a.level?2:a.strategy>=ot||a.level<2?4:0),At(a,255&a.gzhead.os),a.gzhead.extra&&a.gzhead.extra.length&&(At(a,255&a.gzhead.extra.length),At(a,a.gzhead.extra.length>>8&255)),a.gzhead.hcrc&&(t.adler=H(t.adler,a.pending_buf,a.pending,0)),a.gzindex=0,a.status=69;else if(At(a,0),At(a,0),At(a,0),At(a,0),At(a,0),At(a,9===a.level?2:a.strategy>=ot||a.level<2?4:0),At(a,3),a.status=mt,xt(t),0!==a.pending)return a.last_flush=-1,tt;if(69===a.status){if(a.gzhead.extra){for(var r=a.pending,s=(65535&a.gzhead.extra.length)-a.gzindex;a.pending+s>a.pending_buf_size;){var o=a.pending_buf_size-a.pending;if(a.pending_buf.set(a.gzhead.extra.subarray(a.gzindex,a.gzindex+o),a.pending),a.pending=a.pending_buf_size,a.gzhead.hcrc&&a.pending>r&&(t.adler=H(t.adler,a.pending_buf,a.pending-r,r)),a.gzindex+=o,xt(t),0!==a.pending)return a.last_flush=-1,tt;r=0,s-=o}var l=new Uint8Array(a.gzhead.extra);a.pending_buf.set(l.subarray(a.gzindex,a.gzindex+s),a.pending),a.pending+=s,a.gzhead.hcrc&&a.pending>r&&(t.adler=H(t.adler,a.pending_buf,a.pending-r,r)),a.gzindex=0}a.status=73}if(73===a.status){if(a.gzhead.name){var h,d=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>d&&(t.adler=H(t.adler,a.pending_buf,a.pending-d,d)),xt(t),0!==a.pending)return a.last_flush=-1,tt;d=0}h=a.gzindexd&&(t.adler=H(t.adler,a.pending_buf,a.pending-d,d)),a.gzindex=0}a.status=91}if(91===a.status){if(a.gzhead.comment){var _,f=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>f&&(t.adler=H(t.adler,a.pending_buf,a.pending-f,f)),xt(t),0!==a.pending)return a.last_flush=-1,tt;f=0}_=a.gzindexf&&(t.adler=H(t.adler,a.pending_buf,a.pending-f,f))}a.status=103}if(103===a.status){if(a.gzhead.hcrc){if(a.pending+2>a.pending_buf_size&&(xt(t),0!==a.pending))return a.last_flush=-1,tt;At(a,255&t.adler),At(a,t.adler>>8&255),t.adler=0}if(a.status=mt,xt(t),0!==a.pending)return a.last_flush=-1,tt}if(0!==t.avail_in||0!==a.lookahead||e!==q&&a.status!==bt){var u=0===a.level?Ut(a,e):a.strategy===ot?function(t,e){for(var a;;){if(0===t.lookahead&&(St(t),0===t.lookahead)){if(e===q)return 1;break}if(t.match_length=0,a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++,a&&(zt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2}(a,e):a.strategy===lt?function(t,e){for(var a,n,i,r,s=t.window;;){if(t.lookahead<=ut){if(St(t),t.lookahead<=ut&&e===q)return 1;if(0===t.lookahead)break}if(t.match_length=0,t.lookahead>=3&&t.strstart>0&&(n=s[i=t.strstart-1])===s[++i]&&n===s[++i]&&n===s[++i]){r=t.strstart+ut;do{}while(n===s[++i]&&n===s[++i]&&n===s[++i]&&n===s[++i]&&n===s[++i]&&n===s[++i]&&n===s[++i]&&n===s[++i]&&it.lookahead&&(t.match_length=t.lookahead)}if(t.match_length>=3?(a=X(t,1,t.match_length-3),t.lookahead-=t.match_length,t.strstart+=t.match_length,t.match_length=0):(a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++),a&&(zt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2}(a,e):It[a.level].func(a,e);if(3!==u&&4!==u||(a.status=bt),1===u||3===u)return 0===t.avail_out&&(a.last_flush=-1),tt;if(2===u&&(e===J?W(a):e!==$&&(Y(a,0,0,!1),e===Q&&(vt(a.head),0===a.lookahead&&(a.strstart=0,a.block_start=0,a.insert=0))),xt(t),0===t.avail_out))return a.last_flush=-1,tt}return e!==V?tt:a.wrap<=0?et:(2===a.wrap?(At(a,255&t.adler),At(a,t.adler>>8&255),At(a,t.adler>>16&255),At(a,t.adler>>24&255),At(a,255&t.total_in),At(a,t.total_in>>8&255),At(a,t.total_in>>16&255),At(a,t.total_in>>24&255)):(Et(a,t.adler>>>16),Et(a,65535&t.adler)),xt(t),a.wrap>0&&(a.wrap=-a.wrap),0!==a.pending?tt:et)},deflateEnd:function(t){if(Lt(t))return at;var e=t.state.status;return t.state=null,e===mt?gt(t,nt):tt},deflateSetDictionary:function(t,e){var a=e.length;if(Lt(t))return at;var n=t.state,i=n.wrap;if(2===i||1===i&&n.status!==wt||n.lookahead)return at;if(1===i&&(t.adler=C(t.adler,e,a,0)),n.wrap=0,a>=n.w_size){0===i&&(vt(n.head),n.strstart=0,n.block_start=0,n.insert=0);var r=new Uint8Array(n.w_size);r.set(e.subarray(a-n.w_size,a),0),e=r,a=n.w_size}var s=t.avail_in,o=t.next_in,l=t.input;for(t.avail_in=a,t.next_in=0,t.input=e,St(n);n.lookahead>=3;){var h=n.strstart,d=n.lookahead-2;do{n.ins_h=yt(n,n.ins_h,n.window[h+3-1]),n.prev[h&n.w_mask]=n.head[n.ins_h],n.head[n.ins_h]=h,h++}while(--d);n.strstart=h,n.lookahead=2,St(n)}return n.strstart+=n.lookahead,n.block_start=n.strstart,n.insert=n.lookahead,n.lookahead=0,n.match_length=n.prev_length=2,n.match_available=0,t.next_in=o,t.input=l,t.avail_in=s,n.wrap=i,tt},deflateInfo:"pako deflate (from Nodeca project)"};function Ht(t){return Ht="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},Ht(t)}var jt=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},Kt=function(t){for(var e=Array.prototype.slice.call(arguments,1);e.length;){var a=e.shift();if(a){if("object"!==Ht(a))throw new TypeError(a+"must be non-object");for(var n in a)jt(a,n)&&(t[n]=a[n])}}return t},Pt=function(t){for(var e=0,a=0,n=t.length;a=252?6:Xt>=248?5:Xt>=240?4:Xt>=224?3:Xt>=192?2:1;Gt[254]=Gt[254]=1;var Wt=function(t){if("function"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(t);var e,a,n,i,r,s=t.length,o=0;for(i=0;i>>6,e[r++]=128|63&a):a<65536?(e[r++]=224|a>>>12,e[r++]=128|a>>>6&63,e[r++]=128|63&a):(e[r++]=240|a>>>18,e[r++]=128|a>>>12&63,e[r++]=128|a>>>6&63,e[r++]=128|63&a);return e},qt=function(t,e){var a,n,i=e||t.length;if("function"==typeof TextDecoder&&TextDecoder.prototype.decode)return(new TextDecoder).decode(t.subarray(0,e));var r=new Array(2*i);for(n=0,a=0;a4)r[n++]=65533,a+=o-1;else{for(s&=2===o?31:3===o?15:7;o>1&&a1?r[n++]=65533:s<65536?r[n++]=s:(s-=65536,r[n++]=55296|s>>10&1023,r[n++]=56320|1023&s)}}}return function(t,e){if(e<65534&&t.subarray&&Yt)return String.fromCharCode.apply(null,t.length===e?t:t.subarray(0,e));for(var a="",n=0;nt.length&&(e=t.length);for(var a=e-1;a>=0&&128==(192&t[a]);)a--;return a<0||0===a?e:a+Gt[t[a]]>e?a:e};var Qt=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0},Vt=Object.prototype.toString,$t=K.Z_NO_FLUSH,te=K.Z_SYNC_FLUSH,ee=K.Z_FULL_FLUSH,ae=K.Z_FINISH,ne=K.Z_OK,ie=K.Z_STREAM_END,re=K.Z_DEFAULT_COMPRESSION,se=K.Z_DEFAULT_STRATEGY,oe=K.Z_DEFLATED;function le(t){this.options=Kt({level:re,method:oe,chunkSize:16384,windowBits:15,memLevel:8,strategy:se},t||{});var e=this.options;e.raw&&e.windowBits>0?e.windowBits=-e.windowBits:e.gzip&&e.windowBits>0&&e.windowBits<16&&(e.windowBits+=16),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new Qt,this.strm.avail_out=0;var a=Mt.deflateInit2(this.strm,e.level,e.method,e.windowBits,e.memLevel,e.strategy);if(a!==ne)throw new Error(j[a]);if(e.header&&Mt.deflateSetHeader(this.strm,e.header),e.dictionary){var n;if(n="string"==typeof e.dictionary?Wt(e.dictionary):"[object ArrayBuffer]"===Vt.call(e.dictionary)?new Uint8Array(e.dictionary):e.dictionary,(a=Mt.deflateSetDictionary(this.strm,n))!==ne)throw new Error(j[a]);this._dict_set=!0}}function he(t,e){var a=new le(e);if(a.push(t,!0),a.err)throw a.msg||j[a.err];return a.result}le.prototype.push=function(t,e){var a,n,i=this.strm,r=this.options.chunkSize;if(this.ended)return!1;for(n=e===~~e?e:!0===e?ae:$t,"string"==typeof t?i.input=Wt(t):"[object ArrayBuffer]"===Vt.call(t)?i.input=new Uint8Array(t):i.input=t,i.next_in=0,i.avail_in=i.input.length;;)if(0===i.avail_out&&(i.output=new Uint8Array(r),i.next_out=0,i.avail_out=r),(n===te||n===ee)&&i.avail_out<=6)this.onData(i.output.subarray(0,i.next_out)),i.avail_out=0;else{if((a=Mt.deflate(i,n))===ie)return i.next_out>0&&this.onData(i.output.subarray(0,i.next_out)),a=Mt.deflateEnd(this.strm),this.onEnd(a),this.ended=!0,a===ne;if(0!==i.avail_out){if(n>0&&i.next_out>0)this.onData(i.output.subarray(0,i.next_out)),i.avail_out=0;else if(0===i.avail_in)break}else this.onData(i.output)}return!0},le.prototype.onData=function(t){this.chunks.push(t)},le.prototype.onEnd=function(t){t===ne&&(this.result=Pt(this.chunks)),this.chunks=[],this.err=t,this.msg=this.strm.msg};var de={Deflate:le,deflate:he,deflateRaw:function(t,e){return(e=e||{}).raw=!0,he(t,e)},gzip:function(t,e){return(e=e||{}).gzip=!0,he(t,e)},constants:K},_e=16209,fe=function(t,e){var a,n,i,r,s,o,l,h,d,_,f,u,c,w,m,b,g,p,v,k,y,x,z,A,E=t.state;a=t.next_in,z=t.input,n=a+(t.avail_in-5),i=t.next_out,A=t.output,r=i-(e-t.avail_out),s=i+(t.avail_out-257),o=E.dmax,l=E.wsize,h=E.whave,d=E.wnext,_=E.window,f=E.hold,u=E.bits,c=E.lencode,w=E.distcode,m=(1<>>=p=g>>>24,u-=p,0===(p=g>>>16&255))A[i++]=65535&g;else{if(!(16&p)){if(0==(64&p)){g=c[(65535&g)+(f&(1<>>=p,u-=p),u<15&&(f+=z[a++]<>>=p=g>>>24,u-=p,!(16&(p=g>>>16&255))){if(0==(64&p)){g=w[(65535&g)+(f&(1<o){t.msg="invalid distance too far back",E.mode=_e;break t}if(f>>>=p,u-=p,k>(p=i-r)){if((p=k-p)>h&&E.sane){t.msg="invalid distance too far back",E.mode=_e;break t}if(y=0,x=_,0===d){if(y+=l-p,p2;)A[i++]=x[y++],A[i++]=x[y++],A[i++]=x[y++],v-=3;v&&(A[i++]=x[y++],v>1&&(A[i++]=x[y++]))}else{y=i-k;do{A[i++]=A[y++],A[i++]=A[y++],A[i++]=A[y++],v-=3}while(v>2);v&&(A[i++]=A[y++],v>1&&(A[i++]=A[y++]))}break}}break}}while(a>3,f&=(1<<(u-=v<<3))-1,t.next_in=a,t.next_out=i,t.avail_in=a=1&&0===S[k];k--);if(y>k&&(y=k),0===k)return i[r++]=20971520,i[r++]=20971520,o.bits=1,0;for(v=1;v0&&(0===t||1!==k))return-1;for(U[1]=0,g=1;g852||2===t&&E>592)return 1;for(;;){c=g-z,s[p]+1=u?(w=D[s[p]-u],m=Z[s[p]-u]):(w=96,m=0),l=1<>z)+(h-=l)]=c<<24|w<<16|m|0}while(0!==h);for(l=1<>=1;if(0!==l?(R&=l-1,R+=l):R=0,p++,0==--S[g]){if(g===k)break;g=e[a+s[p]]}if(g>y&&(R&_)!==d){for(0===z&&(z=y),f+=v,A=1<<(x=g-z);x+z852||2===t&&E>592)return 1;i[d=R&_]=y<<24|x<<16|f-r|0}}return 0!==R&&(i[f+R]=g-z<<24|64<<16|0),o.bits=y,0},pe=K.Z_FINISH,ve=K.Z_BLOCK,ke=K.Z_TREES,ye=K.Z_OK,xe=K.Z_STREAM_END,ze=K.Z_NEED_DICT,Ae=K.Z_STREAM_ERROR,Ee=K.Z_DATA_ERROR,Re=K.Z_MEM_ERROR,Ze=K.Z_BUF_ERROR,Se=K.Z_DEFLATED,Ue=16180,De=16190,Te=16191,Oe=16192,Ie=16194,Fe=16199,Le=16200,Ne=16206,Be=16209,Ce=function(t){return(t>>>24&255)+(t>>>8&65280)+((65280&t)<<8)+((255&t)<<24)};function Me(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}var He,je,Ke=function(t){if(!t)return 1;var e=t.state;return!e||e.strm!==t||e.mode16211?1:0},Pe=function(t){if(Ke(t))return Ae;var e=t.state;return t.total_in=t.total_out=e.total=0,t.msg="",e.wrap&&(t.adler=1&e.wrap),e.mode=Ue,e.last=0,e.havedict=0,e.flags=-1,e.dmax=32768,e.head=null,e.hold=0,e.bits=0,e.lencode=e.lendyn=new Int32Array(852),e.distcode=e.distdyn=new Int32Array(592),e.sane=1,e.back=-1,ye},Ye=function(t){if(Ke(t))return Ae;var e=t.state;return e.wsize=0,e.whave=0,e.wnext=0,Pe(t)},Ge=function(t,e){var a;if(Ke(t))return Ae;var n=t.state;return e<0?(a=0,e=-e):(a=5+(e>>4),e<48&&(e&=15)),e&&(e<8||e>15)?Ae:(null!==n.window&&n.wbits!==e&&(n.window=null),n.wrap=a,n.wbits=e,Ye(t))},Xe=function(t,e){if(!t)return Ae;var a=new Me;t.state=a,a.strm=t,a.window=null,a.mode=Ue;var n=Ge(t,e);return n!==ye&&(t.state=null),n},We=!0,qe=function(t){if(We){He=new Int32Array(512),je=new Int32Array(32);for(var e=0;e<144;)t.lens[e++]=8;for(;e<256;)t.lens[e++]=9;for(;e<280;)t.lens[e++]=7;for(;e<288;)t.lens[e++]=8;for(ge(1,t.lens,0,288,He,0,t.work,{bits:9}),e=0;e<32;)t.lens[e++]=5;ge(2,t.lens,0,32,je,0,t.work,{bits:5}),We=!1}t.lencode=He,t.lenbits=9,t.distcode=je,t.distbits=5},Je=function(t,e,a,n){var i,r=t.state;return null===r.window&&(r.wsize=1<=r.wsize?(r.window.set(e.subarray(a-r.wsize,a),0),r.wnext=0,r.whave=r.wsize):((i=r.wsize-r.wnext)>n&&(i=n),r.window.set(e.subarray(a-n,a-n+i),r.wnext),(n-=i)?(r.window.set(e.subarray(a-n,a),0),r.wnext=n,r.whave=r.wsize):(r.wnext+=i,r.wnext===r.wsize&&(r.wnext=0),r.whave>>8&255,a.check=H(a.check,R,2,0),h=0,d=0,a.mode=16181;break}if(a.head&&(a.head.done=!1),!(1&a.wrap)||(((255&h)<<8)+(h>>8))%31){t.msg="incorrect header check",a.mode=Be;break}if((15&h)!==Se){t.msg="unknown compression method",a.mode=Be;break}if(d-=4,y=8+(15&(h>>>=4)),0===a.wbits&&(a.wbits=y),y>15||y>a.wbits){t.msg="invalid window size",a.mode=Be;break}a.dmax=1<>8&1),512&a.flags&&4&a.wrap&&(R[0]=255&h,R[1]=h>>>8&255,a.check=H(a.check,R,2,0)),h=0,d=0,a.mode=16182;case 16182:for(;d<32;){if(0===o)break t;o--,h+=n[r++]<>>8&255,R[2]=h>>>16&255,R[3]=h>>>24&255,a.check=H(a.check,R,4,0)),h=0,d=0,a.mode=16183;case 16183:for(;d<16;){if(0===o)break t;o--,h+=n[r++]<>8),512&a.flags&&4&a.wrap&&(R[0]=255&h,R[1]=h>>>8&255,a.check=H(a.check,R,2,0)),h=0,d=0,a.mode=16184;case 16184:if(1024&a.flags){for(;d<16;){if(0===o)break t;o--,h+=n[r++]<>>8&255,a.check=H(a.check,R,2,0)),h=0,d=0}else a.head&&(a.head.extra=null);a.mode=16185;case 16185:if(1024&a.flags&&((u=a.length)>o&&(u=o),u&&(a.head&&(y=a.head.extra_len-a.length,a.head.extra||(a.head.extra=new Uint8Array(a.head.extra_len)),a.head.extra.set(n.subarray(r,r+u),y)),512&a.flags&&4&a.wrap&&(a.check=H(a.check,n,u,r)),o-=u,r+=u,a.length-=u),a.length))break t;a.length=0,a.mode=16186;case 16186:if(2048&a.flags){if(0===o)break t;u=0;do{y=n[r+u++],a.head&&y&&a.length<65536&&(a.head.name+=String.fromCharCode(y))}while(y&&u>9&1,a.head.done=!0),t.adler=a.check=0,a.mode=Te;break;case 16189:for(;d<32;){if(0===o)break t;o--,h+=n[r++]<>>=7&d,d-=7&d,a.mode=Ne;break}for(;d<3;){if(0===o)break t;o--,h+=n[r++]<>>=1)){case 0:a.mode=16193;break;case 1:if(qe(a),a.mode=Fe,e===ke){h>>>=2,d-=2;break t}break;case 2:a.mode=16196;break;case 3:t.msg="invalid block type",a.mode=Be}h>>>=2,d-=2;break;case 16193:for(h>>>=7&d,d-=7&d;d<32;){if(0===o)break t;o--,h+=n[r++]<>>16^65535)){t.msg="invalid stored block lengths",a.mode=Be;break}if(a.length=65535&h,h=0,d=0,a.mode=Ie,e===ke)break t;case Ie:a.mode=16195;case 16195:if(u=a.length){if(u>o&&(u=o),u>l&&(u=l),0===u)break t;i.set(n.subarray(r,r+u),s),o-=u,r+=u,l-=u,s+=u,a.length-=u;break}a.mode=Te;break;case 16196:for(;d<14;){if(0===o)break t;o--,h+=n[r++]<>>=5,d-=5,a.ndist=1+(31&h),h>>>=5,d-=5,a.ncode=4+(15&h),h>>>=4,d-=4,a.nlen>286||a.ndist>30){t.msg="too many length or distance symbols",a.mode=Be;break}a.have=0,a.mode=16197;case 16197:for(;a.have>>=3,d-=3}for(;a.have<19;)a.lens[Z[a.have++]]=0;if(a.lencode=a.lendyn,a.lenbits=7,z={bits:a.lenbits},x=ge(0,a.lens,0,19,a.lencode,0,a.work,z),a.lenbits=z.bits,x){t.msg="invalid code lengths set",a.mode=Be;break}a.have=0,a.mode=16198;case 16198:for(;a.have>>16&255,g=65535&E,!((m=E>>>24)<=d);){if(0===o)break t;o--,h+=n[r++]<>>=m,d-=m,a.lens[a.have++]=g;else{if(16===g){for(A=m+2;d>>=m,d-=m,0===a.have){t.msg="invalid bit length repeat",a.mode=Be;break}y=a.lens[a.have-1],u=3+(3&h),h>>>=2,d-=2}else if(17===g){for(A=m+3;d>>=m)),h>>>=3,d-=3}else{for(A=m+7;d>>=m)),h>>>=7,d-=7}if(a.have+u>a.nlen+a.ndist){t.msg="invalid bit length repeat",a.mode=Be;break}for(;u--;)a.lens[a.have++]=y}}if(a.mode===Be)break;if(0===a.lens[256]){t.msg="invalid code -- missing end-of-block",a.mode=Be;break}if(a.lenbits=9,z={bits:a.lenbits},x=ge(1,a.lens,0,a.nlen,a.lencode,0,a.work,z),a.lenbits=z.bits,x){t.msg="invalid literal/lengths set",a.mode=Be;break}if(a.distbits=6,a.distcode=a.distdyn,z={bits:a.distbits},x=ge(2,a.lens,a.nlen,a.ndist,a.distcode,0,a.work,z),a.distbits=z.bits,x){t.msg="invalid distances set",a.mode=Be;break}if(a.mode=Fe,e===ke)break t;case Fe:a.mode=Le;case Le:if(o>=6&&l>=258){t.next_out=s,t.avail_out=l,t.next_in=r,t.avail_in=o,a.hold=h,a.bits=d,fe(t,f),s=t.next_out,i=t.output,l=t.avail_out,r=t.next_in,n=t.input,o=t.avail_in,h=a.hold,d=a.bits,a.mode===Te&&(a.back=-1);break}for(a.back=0;b=(E=a.lencode[h&(1<>>16&255,g=65535&E,!((m=E>>>24)<=d);){if(0===o)break t;o--,h+=n[r++]<>p)])>>>16&255,g=65535&E,!(p+(m=E>>>24)<=d);){if(0===o)break t;o--,h+=n[r++]<>>=p,d-=p,a.back+=p}if(h>>>=m,d-=m,a.back+=m,a.length=g,0===b){a.mode=16205;break}if(32&b){a.back=-1,a.mode=Te;break}if(64&b){t.msg="invalid literal/length code",a.mode=Be;break}a.extra=15&b,a.mode=16201;case 16201:if(a.extra){for(A=a.extra;d>>=a.extra,d-=a.extra,a.back+=a.extra}a.was=a.length,a.mode=16202;case 16202:for(;b=(E=a.distcode[h&(1<>>16&255,g=65535&E,!((m=E>>>24)<=d);){if(0===o)break t;o--,h+=n[r++]<>p)])>>>16&255,g=65535&E,!(p+(m=E>>>24)<=d);){if(0===o)break t;o--,h+=n[r++]<>>=p,d-=p,a.back+=p}if(h>>>=m,d-=m,a.back+=m,64&b){t.msg="invalid distance code",a.mode=Be;break}a.offset=g,a.extra=15&b,a.mode=16203;case 16203:if(a.extra){for(A=a.extra;d>>=a.extra,d-=a.extra,a.back+=a.extra}if(a.offset>a.dmax){t.msg="invalid distance too far back",a.mode=Be;break}a.mode=16204;case 16204:if(0===l)break t;if(u=f-l,a.offset>u){if((u=a.offset-u)>a.whave&&a.sane){t.msg="invalid distance too far back",a.mode=Be;break}u>a.wnext?(u-=a.wnext,c=a.wsize-u):c=a.wnext-u,u>a.length&&(u=a.length),w=a.window}else w=i,c=s-a.offset,u=a.length;u>l&&(u=l),l-=u,a.length-=u;do{i[s++]=w[c++]}while(--u);0===a.length&&(a.mode=Le);break;case 16205:if(0===l)break t;i[s++]=a.length,l--,a.mode=Le;break;case Ne:if(a.wrap){for(;d<32;){if(0===o)break t;o--,h|=n[r++]<=0&&e.windowBits<16&&(e.windowBits=-e.windowBits,0===e.windowBits&&(e.windowBits=-15)),!(e.windowBits>=0&&e.windowBits<16)||t&&t.windowBits||(e.windowBits+=32),e.windowBits>15&&e.windowBits<48&&0==(15&e.windowBits)&&(e.windowBits|=15),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new Qt,this.strm.avail_out=0;var a=Qe.inflateInit2(this.strm,e.windowBits);if(a!==aa)throw new Error(j[a]);if(this.header=new Ve,Qe.inflateGetHeader(this.strm,this.header),e.dictionary&&("string"==typeof e.dictionary?e.dictionary=Wt(e.dictionary):"[object ArrayBuffer]"===$e.call(e.dictionary)&&(e.dictionary=new Uint8Array(e.dictionary)),e.raw&&(a=Qe.inflateSetDictionary(this.strm,e.dictionary))!==aa))throw new Error(j[a])}function ha(t,e){var a=new la(e);if(a.push(t),a.err)throw a.msg||j[a.err];return a.result}la.prototype.push=function(t,e){var a,n,i,r=this.strm,s=this.options.chunkSize,o=this.options.dictionary;if(this.ended)return!1;for(n=e===~~e?e:!0===e?ea:ta,"[object ArrayBuffer]"===$e.call(t)?r.input=new Uint8Array(t):r.input=t,r.next_in=0,r.avail_in=r.input.length;;){for(0===r.avail_out&&(r.output=new Uint8Array(s),r.next_out=0,r.avail_out=s),(a=Qe.inflate(r,n))===ia&&o&&((a=Qe.inflateSetDictionary(r,o))===aa?a=Qe.inflate(r,n):a===sa&&(a=ia));r.avail_in>0&&a===na&&r.state.wrap>0&&0!==t[r.next_in];)Qe.inflateReset(r),a=Qe.inflate(r,n);switch(a){case ra:case sa:case ia:case oa:return this.onEnd(a),this.ended=!0,!1}if(i=r.avail_out,r.next_out&&(0===r.avail_out||a===na))if("string"===this.options.to){var l=Jt(r.output,r.next_out),h=r.next_out-l,d=qt(r.output,l);r.next_out=h,r.avail_out=s-h,h&&r.output.set(r.output.subarray(l,l+h),0),this.onData(d)}else this.onData(r.output.length===r.next_out?r.output:r.output.subarray(0,r.next_out));if(a!==aa||0!==i){if(a===na)return a=Qe.inflateEnd(this.strm),this.onEnd(a),this.ended=!0,!0;if(0===r.avail_in)break}}return!0},la.prototype.onData=function(t){this.chunks.push(t)},la.prototype.onEnd=function(t){t===aa&&("string"===this.options.to?this.result=this.chunks.join(""):this.result=Pt(this.chunks)),this.chunks=[],this.err=t,this.msg=this.strm.msg};var da={Inflate:la,inflate:ha,inflateRaw:function(t,e){return(e=e||{}).raw=!0,ha(t,e)},ungzip:ha,constants:K},_a=de.Deflate,fa=de.deflate,ua=de.deflateRaw,ca=de.gzip,wa=da.Inflate,ma=da.inflate,ba=da.inflateRaw,ga=da.ungzip,pa=K,va={Deflate:_a,deflate:fa,deflateRaw:ua,gzip:ca,Inflate:wa,inflate:ma,inflateRaw:ba,ungzip:ga,constants:pa};t.Deflate=_a,t.Inflate=wa,t.constants=pa,t.default=va,t.deflate=fa,t.deflateRaw=ua,t.gzip=ca,t.inflate=ma,t.inflateRaw=ba,t.ungzip=ga,Object.defineProperty(t,"__esModule",{value:!0})})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako.esm.mjs b/测试流式传输uniapp/node_modules/pako/dist/pako.esm.mjs new file mode 100644 index 0000000..d110ebd --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako.esm.mjs @@ -0,0 +1,6877 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +/* eslint-disable space-unary-ops */ + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + + +//const Z_FILTERED = 1; +//const Z_HUFFMAN_ONLY = 2; +//const Z_RLE = 3; +const Z_FIXED$1 = 4; +//const Z_DEFAULT_STRATEGY = 0; + +/* Possible values of the data_type field (though see inflate()) */ +const Z_BINARY = 0; +const Z_TEXT = 1; +//const Z_ASCII = 1; // = Z_TEXT +const Z_UNKNOWN$1 = 2; + +/*============================================================================*/ + + +function zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } } + +// From zutil.h + +const STORED_BLOCK = 0; +const STATIC_TREES = 1; +const DYN_TREES = 2; +/* The three kinds of block type */ + +const MIN_MATCH$1 = 3; +const MAX_MATCH$1 = 258; +/* The minimum and maximum match lengths */ + +// From deflate.h +/* =========================================================================== + * Internal compression state. + */ + +const LENGTH_CODES$1 = 29; +/* number of length codes, not counting the special END_BLOCK code */ + +const LITERALS$1 = 256; +/* number of literal bytes 0..255 */ + +const L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1; +/* number of Literal or Length codes, including the END_BLOCK code */ + +const D_CODES$1 = 30; +/* number of distance codes */ + +const BL_CODES$1 = 19; +/* number of codes used to transfer the bit lengths */ + +const HEAP_SIZE$1 = 2 * L_CODES$1 + 1; +/* maximum heap size */ + +const MAX_BITS$1 = 15; +/* All codes must not exceed MAX_BITS bits */ + +const Buf_size = 16; +/* size of bit buffer in bi_buf */ + + +/* =========================================================================== + * Constants + */ + +const MAX_BL_BITS = 7; +/* Bit length codes must not exceed MAX_BL_BITS bits */ + +const END_BLOCK = 256; +/* end of block literal code */ + +const REP_3_6 = 16; +/* repeat previous bit length 3-6 times (2 bits of repeat count) */ + +const REPZ_3_10 = 17; +/* repeat a zero length 3-10 times (3 bits of repeat count) */ + +const REPZ_11_138 = 18; +/* repeat a zero length 11-138 times (7 bits of repeat count) */ + +/* eslint-disable comma-spacing,array-bracket-spacing */ +const extra_lbits = /* extra bits for each length code */ + new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]); + +const extra_dbits = /* extra bits for each distance code */ + new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]); + +const extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]); + +const bl_order = + new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]); +/* eslint-enable comma-spacing,array-bracket-spacing */ + +/* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + +/* =========================================================================== + * Local data. These are initialized only once. + */ + +// We pre-fill arrays with 0 to avoid uninitialized gaps + +const DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + +// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 +const static_ltree = new Array((L_CODES$1 + 2) * 2); +zero$1(static_ltree); +/* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + +const static_dtree = new Array(D_CODES$1 * 2); +zero$1(static_dtree); +/* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + +const _dist_code = new Array(DIST_CODE_LEN); +zero$1(_dist_code); +/* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + +const _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1); +zero$1(_length_code); +/* length code for each normalized match length (0 == MIN_MATCH) */ + +const base_length = new Array(LENGTH_CODES$1); +zero$1(base_length); +/* First normalized length for each code (0 = MIN_MATCH) */ + +const base_dist = new Array(D_CODES$1); +zero$1(base_dist); +/* First normalized distance for each code (0 = distance of 1) */ + + +function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; +} + + +let static_l_desc; +let static_d_desc; +let static_bl_desc; + + +function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ +} + + + +const d_code = (dist) => { + + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; +}; + + +/* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ +const put_short = (s, w) => { +// put_byte(s, (uch)((w) & 0xff)); +// put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = (w) & 0xff; + s.pending_buf[s.pending++] = (w >>> 8) & 0xff; +}; + + +/* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ +const send_bits = (s, value, length) => { + + if (s.bi_valid > (Buf_size - length)) { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> (Buf_size - s.bi_valid); + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + s.bi_valid += length; + } +}; + + +const send_code = (s, c, tree) => { + + send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); +}; + + +/* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ +const bi_reverse = (code, len) => { + + let res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; +}; + + +/* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ +const bi_flush = (s) => { + + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } +}; + + +/* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ +const gen_bitlen = (s, desc) => { +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const max_code = desc.max_code; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const extra = desc.stat_desc.extra_bits; + const base = desc.stat_desc.extra_base; + const max_length = desc.stat_desc.max_length; + let h; /* heap index */ + let n, m; /* iterate over the tree elements */ + let bits; /* bit length */ + let xbits; /* extra bits */ + let f; /* frequency */ + let overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS$1; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1]/*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { continue; } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2]/*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); + } + } + if (overflow === 0) { return; } + + // Tracev((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { bits--; } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { continue; } + if (tree[m * 2 + 1]/*.Len*/ !== bits) { + // Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; + tree[m * 2 + 1]/*.Len*/ = bits; + } + n--; + } + } +}; + + +/* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ +const gen_codes = (tree, max_code, bl_count) => { +// ct_data *tree; /* the tree to decorate */ +// int max_code; /* largest code with non zero frequency */ +// ushf *bl_count; /* number of codes at each bit length */ + + const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */ + let code = 0; /* running code value */ + let bits; /* bit index */ + let n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS$1; bits++) { + code = (code + bl_count[bits - 1]) << 1; + next_code[bits] = code; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< { + + let n; /* iterates over tree elements */ + let bits; /* bit counter */ + let length; /* length value */ + let code; /* code value */ + let dist; /* distance index */ + const bl_count = new Array(MAX_BITS$1 + 1); + /* number of codes at each bit length for an optimal tree */ + + // do check in _tr_init() + //if (static_init_done) return; + + /* For some embedded targets, global variables are not initialized: */ +/*#ifdef NO_INIT_GLOBAL_POINTERS + static_l_desc.static_tree = static_ltree; + static_l_desc.extra_bits = extra_lbits; + static_d_desc.static_tree = static_dtree; + static_d_desc.extra_bits = extra_dbits; + static_bl_desc.extra_bits = extra_blbits; +#endif*/ + + /* Initialize the mapping length (0..255) -> length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES$1 - 1; code++) { + base_length[code] = length; + for (n = 0; n < (1 << extra_lbits[code]); n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1 << extra_dbits[code]); n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES$1; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS$1; bits++) { + bl_count[bits] = 0; + } + + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1]/*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1]/*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES$1 + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES$1; n++) { + static_dtree[n * 2 + 1]/*.Len*/ = 5; + static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS); + + //static_init_done = true; +}; + + +/* =========================================================================== + * Initialize a new block. + */ +const init_block = (s) => { + + let n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } + + s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.sym_next = s.matches = 0; +}; + + +/* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ +const bi_windup = (s) => +{ + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; +}; + +/* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ +const smaller = (tree, n, m, depth) => { + + const _n2 = n * 2; + const _m2 = m * 2; + return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || + (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); +}; + +/* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ +const pqdownheap = (s, tree, k) => { +// deflate_state *s; +// ct_data *tree; /* the tree to restore */ +// int k; /* node to move down */ + + const v = s.heap[k]; + let j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && + smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { break; } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; +}; + + +// inlined manually +// const SMALLEST = 1; + +/* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ +const compress_block = (s, ltree, dtree) => { +// deflate_state *s; +// const ct_data *ltree; /* literal tree */ +// const ct_data *dtree; /* distance tree */ + + let dist; /* distance of matched string */ + let lc; /* match length or unmatched char (if dist == 0) */ + let sx = 0; /* running index in sym_buf */ + let code; /* the code to send */ + let extra; /* number of extra bits to send */ + + if (s.sym_next !== 0) { + do { + dist = s.pending_buf[s.sym_buf + sx++] & 0xff; + dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8; + lc = s.pending_buf[s.sym_buf + sx++]; + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and sym_buf is ok: */ + //Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow"); + + } while (sx < s.sym_next); + } + + send_code(s, END_BLOCK, ltree); +}; + + +/* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ +const build_tree = (s, desc) => { +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const elems = desc.stat_desc.elems; + let n, m; /* iterate over heap elements */ + let max_code = -1; /* largest code with non zero frequency */ + let node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE$1; + + for (n = 0; n < elems; n++) { + if (tree[n * 2]/*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + + } else { + tree[n * 2 + 1]/*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); + tree[node * 2]/*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + + if (has_stree) { + s.static_len -= stree[node * 2 + 1]/*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1/*SMALLEST*/]; + s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1/*SMALLEST*/); + /***/ + + m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1/*SMALLEST*/] = node++; + pqdownheap(s, tree, 1/*SMALLEST*/); + + } while (s.heap_len >= 2); + + s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); +}; + + +/* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ +const scan_tree = (s, tree, max_code) => { +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + s.bl_tree[curlen * 2]/*.Freq*/ += count; + + } else if (curlen !== 0) { + + if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } + s.bl_tree[REP_3_6 * 2]/*.Freq*/++; + + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; + + } else { + s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; + } + + count = 0; + prevlen = curlen; + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +}; + + +/* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ +const send_tree = (s, tree, max_code) => { +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); + + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +}; + + +/* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ +const build_bl_tree = (s) => { + + let max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; +}; + + +/* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ +const send_all_trees = (s, lcodes, dcodes, blcodes) => { +// deflate_state *s; +// int lcodes, dcodes, blcodes; /* number of codes for each tree */ + + let rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); +}; + + +/* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "block list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ +const detect_data_type = (s) => { + /* block_mask is the bit mask of block-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + let block_mask = 0xf3ffc07f; + let n; + + /* Check for non-textual ("block-listed") bytes. */ + for (n = 0; n <= 31; n++, block_mask >>>= 1) { + if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { + return Z_BINARY; + } + } + + /* Check for textual ("allow-listed") bytes. */ + if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || + s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS$1; n++) { + if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "block-listed" or "allow-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; +}; + + +let static_init_done = false; + +/* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ +const _tr_init$1 = (s) => +{ + + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); +}; + + +/* =========================================================================== + * Send a stored block + */ +const _tr_stored_block$1 = (s, buf, stored_len, last) => { +//DeflateState *s; +//charf *buf; /* input block */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ + + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + bi_windup(s); /* align on byte boundary */ + put_short(s, stored_len); + put_short(s, ~stored_len); + if (stored_len) { + s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending); + } + s.pending += stored_len; +}; + + +/* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ +const _tr_align$1 = (s) => { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); +}; + + +/* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and write out the encoded block. + */ +const _tr_flush_block$1 = (s, buf, stored_len, last) => { +//DeflateState *s; +//charf *buf; /* input block, or NULL if too old */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ + + let opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + let max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN$1) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = (s.opt_len + 3 + 7) >>> 3; + static_lenb = (s.static_len + 3 + 7) >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->sym_next / 3)); + + if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } + + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block$1(s, buf, stored_len, last); + + } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) { + + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); +}; + +/* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ +const _tr_tally$1 = (s, dist, lc) => { +// deflate_state *s; +// unsigned dist; /* distance of matched string */ +// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ + + s.pending_buf[s.sym_buf + s.sym_next++] = dist; + s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8; + s.pending_buf[s.sym_buf + s.sym_next++] = lc; + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2]/*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; + } + + return (s.sym_next === s.sym_end); +}; + +var _tr_init_1 = _tr_init$1; +var _tr_stored_block_1 = _tr_stored_block$1; +var _tr_flush_block_1 = _tr_flush_block$1; +var _tr_tally_1 = _tr_tally$1; +var _tr_align_1 = _tr_align$1; + +var trees = { + _tr_init: _tr_init_1, + _tr_stored_block: _tr_stored_block_1, + _tr_flush_block: _tr_flush_block_1, + _tr_tally: _tr_tally_1, + _tr_align: _tr_align_1 +}; + +// Note: adler32 takes 12% for level 0 and 2% for level 6. +// It isn't worth it to make additional optimizations as in original. +// Small size is preferable. + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const adler32 = (adler, buf, len, pos) => { + let s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; +}; + + +var adler32_1 = adler32; + +// Note: we can't get significant speed boost here. +// So write code to minimize size - no pregenerated tables +// and array tools dependencies. + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +// Use ordinary array, since untyped makes no boost here +const makeTable = () => { + let c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +}; + +// Create table on load. Just 255 signed longs. Not a problem. +const crcTable = new Uint32Array(makeTable()); + + +const crc32 = (crc, buf, len, pos) => { + const t = crcTable; + const end = pos + len; + + crc ^= -1; + + for (let i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +}; + + +var crc32_1 = crc32; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +var messages = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +var constants$2 = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees; + + + + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1, + Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1, + Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1, + Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1, + Z_UNKNOWN, + Z_DEFLATED: Z_DEFLATED$2 +} = constants$2; + +/*============================================================================*/ + + +const MAX_MEM_LEVEL = 9; +/* Maximum value for memLevel in deflateInit2 */ +const MAX_WBITS$1 = 15; +/* 32K LZ77 window */ +const DEF_MEM_LEVEL = 8; + + +const LENGTH_CODES = 29; +/* number of length codes, not counting the special END_BLOCK code */ +const LITERALS = 256; +/* number of literal bytes 0..255 */ +const L_CODES = LITERALS + 1 + LENGTH_CODES; +/* number of Literal or Length codes, including the END_BLOCK code */ +const D_CODES = 30; +/* number of distance codes */ +const BL_CODES = 19; +/* number of codes used to transfer the bit lengths */ +const HEAP_SIZE = 2 * L_CODES + 1; +/* maximum heap size */ +const MAX_BITS = 15; +/* All codes must not exceed MAX_BITS bits */ + +const MIN_MATCH = 3; +const MAX_MATCH = 258; +const MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); + +const PRESET_DICT = 0x20; + +const INIT_STATE = 42; /* zlib header -> BUSY_STATE */ +//#ifdef GZIP +const GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */ +//#endif +const EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */ +const NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */ +const COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */ +const HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */ +const BUSY_STATE = 113; /* deflate -> FINISH_STATE */ +const FINISH_STATE = 666; /* stream complete */ + +const BS_NEED_MORE = 1; /* block not completed, need more input or more output */ +const BS_BLOCK_DONE = 2; /* block flush performed */ +const BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ +const BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + +const OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + +const err = (strm, errorCode) => { + strm.msg = messages[errorCode]; + return errorCode; +}; + +const rank = (f) => { + return ((f) * 2) - ((f) > 4 ? 9 : 0); +}; + +const zero = (buf) => { + let len = buf.length; while (--len >= 0) { buf[len] = 0; } +}; + +/* =========================================================================== + * Slide the hash table when sliding the window down (could be avoided with 32 + * bit values at the expense of memory usage). We slide even when level == 0 to + * keep the hash table consistent if we switch back to level > 0 later. + */ +const slide_hash = (s) => { + let n, m; + let p; + let wsize = s.w_size; + + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = (m >= wsize ? m - wsize : 0); + } while (--n); + n = wsize; +//#ifndef FASTEST + p = n; + do { + m = s.prev[--p]; + s.prev[p] = (m >= wsize ? m - wsize : 0); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); +//#endif +}; + +/* eslint-disable new-cap */ +let HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask; +// This hash causes less collisions, https://github.com/nodeca/pako/issues/135 +// But breaks binary compatibility +//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; +let HASH = HASH_ZLIB; + + +/* ========================================================================= + * Flush as much pending output as possible. All deflate() output, except for + * some deflate_stored() output, goes through this function so some + * applications may wish to modify it to avoid allocating a large + * strm->next_out buffer and copying into it. (See also read_buf()). + */ +const flush_pending = (strm) => { + const s = strm.state; + + //_tr_flush_bits(s); + let len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { return; } + + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } +}; + + +const flush_block_only = (s, last) => { + _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); +}; + + +const put_byte = (s, b) => { + s.pending_buf[s.pending++] = b; +}; + + +/* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ +const putShortMSB = (s, b) => { + + // put_byte(s, (Byte)(b >> 8)); +// put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = (b >>> 8) & 0xff; + s.pending_buf[s.pending++] = b & 0xff; +}; + + +/* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ +const read_buf = (strm, buf, start, size) => { + + let len = strm.avail_in; + + if (len > size) { len = size; } + if (len === 0) { return 0; } + + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32_1(strm.adler, buf, len, start); + } + + else if (strm.state.wrap === 2) { + strm.adler = crc32_1(strm.adler, buf, len, start); + } + + strm.next_in += len; + strm.total_in += len; + + return len; +}; + + +/* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ +const longest_match = (s, cur_match) => { + + let chain_length = s.max_chain_length; /* max hash chain length */ + let scan = s.strstart; /* current string */ + let match; /* matched string */ + let len; /* length of current match */ + let best_len = s.prev_length; /* best match length so far */ + let nice_match = s.nice_match; /* stop if match long enough */ + const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? + s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; + + const _win = s.window; // shortcut + + const wmask = s.w_mask; + const prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + const strend = s.strstart + MAX_MATCH; + let scan_end1 = _win[scan + best_len - 1]; + let scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { nice_match = s.lookahead; } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || + _win[match + best_len - 1] !== scan_end1 || + _win[match] !== _win[scan] || + _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; +}; + + +/* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ +const fill_window = (s) => { + + const _w_size = s.w_size; + let n, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + + s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + slide_hash(s); + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); +//#if MIN_MATCH != 3 +// Call update_hash() MIN_MATCH-3 more times +//#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ +// if (s.high_water < s.window_size) { +// const curr = s.strstart + s.lookahead; +// let init = 0; +// +// if (s.high_water < curr) { +// /* Previous high water mark below current data -- zero WIN_INIT +// * bytes or up to end of window, whichever is less. +// */ +// init = s.window_size - curr; +// if (init > WIN_INIT) +// init = WIN_INIT; +// zmemzero(s->window + curr, (unsigned)init); +// s->high_water = curr + init; +// } +// else if (s->high_water < (ulg)curr + WIN_INIT) { +// /* High water mark at or above current data, but below current data +// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up +// * to end of window, whichever is less. +// */ +// init = (ulg)curr + WIN_INIT - s->high_water; +// if (init > s->window_size - s->high_water) +// init = s->window_size - s->high_water; +// zmemzero(s->window + s->high_water, (unsigned)init); +// s->high_water += init; +// } +// } +// +// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, +// "not enough room for search"); +}; + +/* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * + * In case deflateParams() is used to later switch to a non-zero compression + * level, s->matches (otherwise unused when storing) keeps track of the number + * of hash table slides to perform. If s->matches is 1, then one hash table + * slide will be done when switching. If s->matches is 2, the maximum value + * allowed here, then the hash table will be cleared, since two or more slides + * is the same as a clear. + * + * deflate_stored() is written to minimize the number of times an input byte is + * copied. It is most efficient with large input and output buffers, which + * maximizes the opportunites to have a single copy from next_in to next_out. + */ +const deflate_stored = (s, flush) => { + + /* Smallest worthy block size when not flushing or finishing. By default + * this is 32K. This can be as small as 507 bytes for memLevel == 1. For + * large input and output buffers, the stored block size will be larger. + */ + let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5; + + /* Copy as many min_block or larger stored blocks directly to next_out as + * possible. If flushing, copy the remaining available input to next_out as + * stored blocks, if there is enough space. + */ + let len, left, have, last = 0; + let used = s.strm.avail_in; + do { + /* Set len to the maximum size block that we can copy directly with the + * available input data and output space. Set left to how much of that + * would be copied from what's left in the window. + */ + len = 65535/* MAX_STORED */; /* maximum deflate stored block length */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + if (s.strm.avail_out < have) { /* need room for header */ + break; + } + /* maximum stored block length that will fit in avail_out: */ + have = s.strm.avail_out - have; + left = s.strstart - s.block_start; /* bytes left in window */ + if (len > left + s.strm.avail_in) { + len = left + s.strm.avail_in; /* limit len to the input */ + } + if (len > have) { + len = have; /* limit len to the output */ + } + + /* If the stored block would be less than min_block in length, or if + * unable to copy all of the available input when flushing, then try + * copying to the window and the pending buffer instead. Also don't + * write an empty block when flushing -- deflate() does that. + */ + if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) || + flush === Z_NO_FLUSH$2 || + len !== left + s.strm.avail_in)) { + break; + } + + /* Make a dummy stored block in pending to get the header bytes, + * including any pending bits. This also updates the debugging counts. + */ + last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0; + _tr_stored_block(s, 0, 0, last); + + /* Replace the lengths in the dummy stored block with len. */ + s.pending_buf[s.pending - 4] = len; + s.pending_buf[s.pending - 3] = len >> 8; + s.pending_buf[s.pending - 2] = ~len; + s.pending_buf[s.pending - 1] = ~len >> 8; + + /* Write the stored block header bytes. */ + flush_pending(s.strm); + +//#ifdef ZLIB_DEBUG +// /* Update debugging counts for the data about to be copied. */ +// s->compressed_len += len << 3; +// s->bits_sent += len << 3; +//#endif + + /* Copy uncompressed bytes from the window to next_out. */ + if (left) { + if (left > len) { + left = len; + } + //zmemcpy(s->strm->next_out, s->window + s->block_start, left); + s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out); + s.strm.next_out += left; + s.strm.avail_out -= left; + s.strm.total_out += left; + s.block_start += left; + len -= left; + } + + /* Copy uncompressed bytes directly from next_in to next_out, updating + * the check value. + */ + if (len) { + read_buf(s.strm, s.strm.output, s.strm.next_out, len); + s.strm.next_out += len; + s.strm.avail_out -= len; + s.strm.total_out += len; + } + } while (last === 0); + + /* Update the sliding window with the last s->w_size bytes of the copied + * data, or append all of the copied data to the existing window if less + * than s->w_size bytes were copied. Also update the number of bytes to + * insert in the hash tables, in the event that deflateParams() switches to + * a non-zero compression level. + */ + used -= s.strm.avail_in; /* number of input bytes directly copied */ + if (used) { + /* If any input was used, then no unused input remains in the window, + * therefore s->block_start == s->strstart. + */ + if (used >= s.w_size) { /* supplant the previous history */ + s.matches = 2; /* clear hash */ + //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); + s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0); + s.strstart = s.w_size; + s.insert = s.strstart; + } + else { + if (s.window_size - s.strstart <= used) { + /* Slide the window down. */ + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); + s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart); + s.strstart += used; + s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used; + } + s.block_start = s.strstart; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* If the last block was written to next_out, then done. */ + if (last) { + return BS_FINISH_DONE; + } + + /* If flushing and all input has been consumed, then done. */ + if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 && + s.strm.avail_in === 0 && s.strstart === s.block_start) { + return BS_BLOCK_DONE; + } + + /* Fill the window with any remaining input. */ + have = s.window_size - s.strstart; + if (s.strm.avail_in > have && s.block_start >= s.w_size) { + /* Slide the window down. */ + s.block_start -= s.w_size; + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + have += s.w_size; /* more space now */ + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + if (have > s.strm.avail_in) { + have = s.strm.avail_in; + } + if (have) { + read_buf(s.strm, s.window, s.strstart, have); + s.strstart += have; + s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* There was not enough avail_out to write a complete worthy or flushed + * stored block to next_out. Write a stored block to pending instead, if we + * have enough input for a worthy block, or if flushing and there is enough + * room for the remaining input as a stored block in the pending buffer. + */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + /* maximum stored block length that will fit in pending: */ + have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have; + min_block = have > s.w_size ? s.w_size : have; + left = s.strstart - s.block_start; + if (left >= min_block || + ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 && + s.strm.avail_in === 0 && left <= have)) { + len = left > have ? have : left; + last = flush === Z_FINISH$3 && s.strm.avail_in === 0 && + len === left ? 1 : 0; + _tr_stored_block(s, s.block_start, len, last); + s.block_start += len; + flush_pending(s.strm); + } + + /* We've done all we can with the available input and output. */ + return last ? BS_FINISH_STARTED : BS_NEED_MORE; +}; + + +/* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ +const deflate_fast = (s, flush) => { + + let hash_head; /* head of the hash chain */ + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else + { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + +//#if MIN_MATCH != 3 +// Call UPDATE_HASH() MIN_MATCH-3 more times +//#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ +const deflate_slow = (s, flush) => { + + let hash_head; /* head of hash chain */ + let bflush; /* set if current block must be flushed */ + + let max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + + if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && + s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && + (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; +}; + + +/* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ +const deflate_rle = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + let prev; /* byte at distance one to match */ + let scan, strend; /* scan goes up to strend for length of run */ + + const _win = s.window; + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ +const deflate_huff = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ +function Config(good_length, max_lazy, nice_length, max_chain, func) { + + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; +} + +const configuration_table = [ + /* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ +]; + + +/* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ +const lm_init = (s) => { + + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; +}; + + +function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED$2; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.sym_buf = 0; /* buffer for distances and literals/lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.sym_next = 0; /* running index in sym_buf */ + this.sym_end = 0; /* symbol table full when sym_next reaches this */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ +} + + +/* ========================================================================= + * Check for a valid deflate stream state. Return 0 if ok, 1 if not. + */ +const deflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const s = strm.state; + if (!s || s.strm !== strm || (s.status !== INIT_STATE && +//#ifdef GZIP + s.status !== GZIP_STATE && +//#endif + s.status !== EXTRA_STATE && + s.status !== NAME_STATE && + s.status !== COMMENT_STATE && + s.status !== HCRC_STATE && + s.status !== BUSY_STATE && + s.status !== FINISH_STATE)) { + return 1; + } + return 0; +}; + + +const deflateResetKeep = (strm) => { + + if (deflateStateCheck(strm)) { + return err(strm, Z_STREAM_ERROR$2); + } + + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + + const s = strm.state; + s.pending = 0; + s.pending_out = 0; + + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + s.status = +//#ifdef GZIP + s.wrap === 2 ? GZIP_STATE : +//#endif + s.wrap ? INIT_STATE : BUSY_STATE; + strm.adler = (s.wrap === 2) ? + 0 // crc32(0, Z_NULL, 0) + : + 1; // adler32(0, Z_NULL, 0) + s.last_flush = -2; + _tr_init(s); + return Z_OK$3; +}; + + +const deflateReset = (strm) => { + + const ret = deflateResetKeep(strm); + if (ret === Z_OK$3) { + lm_init(strm.state); + } + return ret; +}; + + +const deflateSetHeader = (strm, head) => { + + if (deflateStateCheck(strm) || strm.state.wrap !== 2) { + return Z_STREAM_ERROR$2; + } + strm.state.gzhead = head; + return Z_OK$3; +}; + + +const deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => { + + if (!strm) { // === Z_NULL + return Z_STREAM_ERROR$2; + } + let wrap = 1; + + if (level === Z_DEFAULT_COMPRESSION$1) { + level = 6; + } + + if (windowBits < 0) { /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } + + else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + + + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 || + windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) { + return err(strm, Z_STREAM_ERROR$2); + } + + + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + const s = new DeflateState(); + + strm.state = s; + s.strm = strm; + s.status = INIT_STATE; /* to pass state test in deflateReset() */ + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + /* We overlay pending_buf and sym_buf. This works since the average size + * for length/distance pairs over any compressed block is assured to be 31 + * bits or less. + * + * Analysis: The longest fixed codes are a length code of 8 bits plus 5 + * extra bits, for lengths 131 to 257. The longest fixed distance codes are + * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest + * possible fixed-codes length/distance pair is then 31 bits total. + * + * sym_buf starts one-fourth of the way into pending_buf. So there are + * three bytes in sym_buf for every four bytes in pending_buf. Each symbol + * in sym_buf is three bytes -- two for the distance and one for the + * literal/length. As each symbol is consumed, the pointer to the next + * sym_buf value to read moves forward three bytes. From that symbol, up to + * 31 bits are written to pending_buf. The closest the written pending_buf + * bits gets to the next sym_buf symbol to read is just before the last + * code is written. At that time, 31*(n-2) bits have been written, just + * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at + * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1 + * symbols are written.) The closest the writing gets to what is unread is + * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and + * can range from 128 to 32768. + * + * Therefore, at a minimum, there are 142 bits of space between what is + * written and what is read in the overlain buffers, so the symbols cannot + * be overwritten by the compressed data. That space is actually 139 bits, + * due to the three-bit fixed-code block header. + * + * That covers the case where either Z_FIXED is specified, forcing fixed + * codes, or when the use of fixed codes is chosen, because that choice + * results in a smaller compressed block than dynamic codes. That latter + * condition then assures that the above analysis also covers all dynamic + * blocks. A dynamic-code block will only be chosen to be emitted if it has + * fewer bits than a fixed-code block would for the same set of symbols. + * Therefore its average symbol length is assured to be less than 31. So + * the compressed data for a dynamic block also cannot overwrite the + * symbols from which it is being constructed. + */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->sym_buf = s->pending_buf + s->lit_bufsize; + s.sym_buf = s.lit_bufsize; + + //s->sym_end = (s->lit_bufsize - 1) * 3; + s.sym_end = (s.lit_bufsize - 1) * 3; + /* We avoid equality with lit_bufsize*3 because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ + + s.level = level; + s.strategy = strategy; + s.method = method; + + return deflateReset(strm); +}; + +const deflateInit = (strm, level) => { + + return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1); +}; + + +/* ========================================================================= */ +const deflate$2 = (strm, flush) => { + + if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2; + } + + const s = strm.state; + + if (!strm.output || + (strm.avail_in !== 0 && !strm.input) || + (s.status === FINISH_STATE && flush !== Z_FINISH$3)) { + return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2); + } + + const old_flush = s.last_flush; + s.last_flush = flush; + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK$3; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && + flush !== Z_FINISH$3) { + return err(strm, Z_BUF_ERROR$1); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR$1); + } + + /* Write the header */ + if (s.status === INIT_STATE && s.wrap === 0) { + s.status = BUSY_STATE; + } + if (s.status === INIT_STATE) { + /* zlib header */ + let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8; + let level_flags = -1; + + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= (level_flags << 6); + if (s.strstart !== 0) { header |= PRESET_DICT; } + header += 31 - (header % 31); + + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } +//#ifdef GZIP + if (s.status === GZIP_STATE) { + /* gzip header */ + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + else { + put_byte(s, (s.gzhead.text ? 1 : 0) + + (s.gzhead.hcrc ? 2 : 0) + + (!s.gzhead.extra ? 0 : 4) + + (!s.gzhead.name ? 0 : 8) + + (!s.gzhead.comment ? 0 : 16) + ); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, (s.gzhead.time >> 8) & 0xff); + put_byte(s, (s.gzhead.time >> 16) & 0xff); + put_byte(s, (s.gzhead.time >> 24) & 0xff); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let left = (s.gzhead.extra.length & 0xffff) - s.gzindex; + while (s.pending + left > s.pending_buf_size) { + let copy = s.pending_buf_size - s.pending; + // zmemcpy(s.pending_buf + s.pending, + // s.gzhead.extra + s.gzindex, copy); + s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending); + s.pending = s.pending_buf_size; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex += copy; + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + left -= copy; + } + // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility + // TypedArray.slice and TypedArray.from don't exist in IE10-IE11 + let gzhead_extra = new Uint8Array(s.gzhead.extra); + // zmemcpy(s->pending_buf + s->pending, + // s->gzhead->extra + s->gzindex, left); + s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending); + s.pending += left; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = NAME_STATE; + } + if (s.status === NAME_STATE) { + if (s.gzhead.name/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = COMMENT_STATE; + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + } + s.status = HCRC_STATE; + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + } + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } +//#endif + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || + (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) { + let bstate = s.level === 0 ? deflate_stored(s, flush) : + s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : + s.strategy === Z_RLE ? deflate_rle(s, flush) : + configuration_table[s.level].func(s, flush); + + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + return Z_OK$3; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } + else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH$1) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK$3; + } + } + } + + if (flush !== Z_FINISH$3) { return Z_OK$3; } + if (s.wrap <= 0) { return Z_STREAM_END$3; } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + put_byte(s, (strm.adler >> 16) & 0xff); + put_byte(s, (strm.adler >> 24) & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, (strm.total_in >> 8) & 0xff); + put_byte(s, (strm.total_in >> 16) & 0xff); + put_byte(s, (strm.total_in >> 24) & 0xff); + } + else + { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { s.wrap = -s.wrap; } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3; +}; + + +const deflateEnd = (strm) => { + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR$2; + } + + const status = strm.state.status; + + strm.state = null; + + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3; +}; + + +/* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ +const deflateSetDictionary = (strm, dictionary) => { + + let dictLength = dictionary.length; + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR$2; + } + + const s = strm.state; + const wrap = s.wrap; + + if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) { + return Z_STREAM_ERROR$2; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0); + } + + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + let tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + const avail = strm.avail_in; + const next = strm.next_in; + const input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + let str = s.strstart; + let n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK$3; +}; + + +var deflateInit_1 = deflateInit; +var deflateInit2_1 = deflateInit2; +var deflateReset_1 = deflateReset; +var deflateResetKeep_1 = deflateResetKeep; +var deflateSetHeader_1 = deflateSetHeader; +var deflate_2$1 = deflate$2; +var deflateEnd_1 = deflateEnd; +var deflateSetDictionary_1 = deflateSetDictionary; +var deflateInfo = 'pako deflate (from Nodeca project)'; + +/* Not implemented +module.exports.deflateBound = deflateBound; +module.exports.deflateCopy = deflateCopy; +module.exports.deflateGetDictionary = deflateGetDictionary; +module.exports.deflateParams = deflateParams; +module.exports.deflatePending = deflatePending; +module.exports.deflatePrime = deflatePrime; +module.exports.deflateTune = deflateTune; +*/ + +var deflate_1$2 = { + deflateInit: deflateInit_1, + deflateInit2: deflateInit2_1, + deflateReset: deflateReset_1, + deflateResetKeep: deflateResetKeep_1, + deflateSetHeader: deflateSetHeader_1, + deflate: deflate_2$1, + deflateEnd: deflateEnd_1, + deflateSetDictionary: deflateSetDictionary_1, + deflateInfo: deflateInfo +}; + +const _has = (obj, key) => { + return Object.prototype.hasOwnProperty.call(obj, key); +}; + +var assign = function (obj /*from1, from2, from3, ...*/) { + const sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + const source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (const p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + + return obj; +}; + + +// Join array of chunks to single array. +var flattenChunks = (chunks) => { + // calculate data length + let len = 0; + + for (let i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + const result = new Uint8Array(len); + + for (let i = 0, pos = 0, l = chunks.length; i < l; i++) { + let chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; +}; + +var common = { + assign: assign, + flattenChunks: flattenChunks +}; + +// String encode/decode helpers + + +// Quick check if we can use fast array to bin string conversion +// +// - apply(Array) can fail on Android 2.2 +// - apply(Uint8Array) can fail on iOS 5.1 Safari +// +let STR_APPLY_UIA_OK = true; + +try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +const _utf8len = new Uint8Array(256); +for (let q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); +} +_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + +// convert string to array (typed, when possible) +var string2buf = (str) => { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + + let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Helper +const buf2binstring = (buf, len) => { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + + let result = ''; + for (let i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; +}; + + +// convert array to string +var buf2string = (buf, max) => { + const len = max || buf.length; + + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + + let i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + const utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + let c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + let c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); +}; + + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +var utf8border = (buf, max) => { + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + let pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; + +var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; +} + +var zstream = ZStream; + +const toString$1 = Object.prototype.toString; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2, + Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2, + Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY, + Z_DEFLATED: Z_DEFLATED$1 +} = constants$2; + +/* ===========================================================================*/ + + +/** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + +/* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + +/** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + +/** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + +/** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + +/** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ +function Deflate$1(options) { + this.options = common.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED$1, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + + let opt = this.options; + + if (opt.raw && (opt.windowBits > 0)) { + opt.windowBits = -opt.windowBits; + } + + else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) { + opt.windowBits += 16; + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = deflate_1$2.deflateInit2( + this.strm, + opt.level, + opt.method, + opt.windowBits, + opt.memLevel, + opt.strategy + ); + + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + + if (opt.header) { + deflate_1$2.deflateSetHeader(this.strm, opt.header); + } + + if (opt.dictionary) { + let dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + + status = deflate_1$2.deflateSetDictionary(this.strm, dict); + + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + + this._dict_set = true; + } +} + +/** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Deflate$1.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + let status, _flush_mode; + + if (this.ended) { return false; } + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString$1.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + status = deflate_1$2.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END$2) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = deflate_1$2.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK$2; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + if (strm.avail_in === 0) break; + } + + return true; +}; + + +/** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Deflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Deflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK$2) { + this.result = common.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ +function deflate$1(input, options) { + const deflator = new Deflate$1(options); + + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { throw deflator.msg || messages[deflator.err]; } + + return deflator.result; +} + + +/** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function deflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return deflate$1(input, options); +} + + +/** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ +function gzip$1(input, options) { + options = options || {}; + options.gzip = true; + return deflate$1(input, options); +} + + +var Deflate_1$1 = Deflate$1; +var deflate_2 = deflate$1; +var deflateRaw_1$1 = deflateRaw$1; +var gzip_1$1 = gzip$1; +var constants$1 = constants$2; + +var deflate_1$1 = { + Deflate: Deflate_1$1, + deflate: deflate_2, + deflateRaw: deflateRaw_1$1, + gzip: gzip_1$1, + constants: constants$1 +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +// See state defs from inflate.js +const BAD$1 = 16209; /* got a data error -- remain here until reset */ +const TYPE$1 = 16191; /* i: waiting for type bits, including last-flag bit */ + +/* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ +var inffast = function inflate_fast(strm, start) { + let _in; /* local strm.input */ + let last; /* have enough input while in < last */ + let _out; /* local strm.output */ + let beg; /* inflate()'s initial strm.output */ + let end; /* while out < end, enough space available */ +//#ifdef INFLATE_STRICT + let dmax; /* maximum distance from zlib header */ +//#endif + let wsize; /* window size or zero if not using window */ + let whave; /* valid bytes in the window */ + let wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + let s_window; /* allocated sliding window, if wsize != 0 */ + let hold; /* local strm.hold */ + let bits; /* local strm.bits */ + let lcode; /* local strm.lencode */ + let dcode; /* local strm.distcode */ + let lmask; /* mask for first level of length codes */ + let dmask; /* mask for first level of distance codes */ + let here; /* retrieved table entry */ + let op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + let len; /* match length, unused bytes */ + let dist; /* match distance */ + let from; /* where to copy match from */ + let from_source; + + + let input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + const state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); +//#ifdef INFLATE_STRICT + dmax = state.dmax; +//#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: + do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + + here = lcode[hold & lmask]; + + dolen: + for (;;) { // Goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + if (op === 0) { /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff/*here.val*/; + } + else if (op & 16) { /* length base */ + len = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & ((1 << op) - 1); + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + + dodist: + for (;;) { // goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + + if (op & 16) { /* distance base */ + dist = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & ((1 << op) - 1); +//#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } +//#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// if (len <= op - whave) { +// do { +// output[_out++] = 0; +// } while (--len); +// continue top; +// } +// len -= op - whave; +// do { +// output[_out++] = 0; +// } while (--op > whave); +// if (op === 0) { +// from = _out - dist; +// do { +// output[_out++] = output[from++]; +// } while (--len); +// continue top; +// } +//#endif + } + from = 0; // window index + from_source = s_window; + if (wnext === 0) { /* very common case */ + from += wsize - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + else if (wnext < op) { /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } + else { /* contiguous in window */ + from += wnext - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } + else { + from = _out - dist; /* copy direct from output */ + do { /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } + else if ((op & 64) === 0) { /* 2nd level distance code */ + here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dodist; + } + else { + strm.msg = 'invalid distance code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } + else if ((op & 64) === 0) { /* 2nd level length code */ + here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dolen; + } + else if (op & 32) { /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE$1; + break top; + } + else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); + strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); + state.hold = hold; + state.bits = bits; + return; +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const MAXBITS = 15; +const ENOUGH_LENS$1 = 852; +const ENOUGH_DISTS$1 = 592; +//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +const CODES$1 = 0; +const LENS$1 = 1; +const DISTS$1 = 2; + +const lbase = new Uint16Array([ /* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 +]); + +const lext = new Uint8Array([ /* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, + 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 +]); + +const dbase = new Uint16Array([ /* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577, 0, 0 +]); + +const dext = new Uint8Array([ /* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, + 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, + 28, 28, 29, 29, 64, 64 +]); + +const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) => +{ + const bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + let len = 0; /* a code's length in bits */ + let sym = 0; /* index of code symbols */ + let min = 0, max = 0; /* minimum and maximum code lengths */ + let root = 0; /* number of index bits for root table */ + let curr = 0; /* number of index bits for current table */ + let drop = 0; /* code bits to drop for sub-table */ + let left = 0; /* number of prefix codes available */ + let used = 0; /* code entries in table used */ + let huff = 0; /* Huffman code */ + let incr; /* for incrementing code, index */ + let fill; /* index for replicating entries */ + let low; /* low bits for current root entry */ + let mask; /* mask for low root bits */ + let next; /* next available space in table */ + let base = null; /* base value table to use */ +// let shoextra; /* extra bits table to use */ + let match; /* use base and extra for symbol >= match */ + const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + let extra = null; + + let here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { break; } + } + if (root > max) { + root = max; + } + if (max === 0) { /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + for (min = 1; min < max; min++) { + if (count[min] !== 0) { break; } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + if (left > 0 && (type === CODES$1 || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES$1) { + base = extra = work; /* dummy value--not used */ + match = 20; + + } else if (type === LENS$1) { + base = lbase; + extra = lext; + match = 257; + + } else { /* DISTS */ + base = dbase; + extra = dext; + match = 0; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] + 1 < match) { + here_op = 0; + here_val = work[sym]; + } + else if (work[sym] >= match) { + here_op = extra[work[sym] - match]; + here_val = base[work[sym] - match]; + } + else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << (len - drop); + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << (len - 1); + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { break; } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { break; } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; +}; + + +var inftrees = inflate_table; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + + + + + + +const CODES = 0; +const LENS = 1; +const DISTS = 2; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES, + Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR, + Z_DEFLATED +} = constants$2; + + +/* STATES ====================================================================*/ +/* ===========================================================================*/ + + +const HEAD = 16180; /* i: waiting for magic header */ +const FLAGS = 16181; /* i: waiting for method and flags (gzip) */ +const TIME = 16182; /* i: waiting for modification time (gzip) */ +const OS = 16183; /* i: waiting for extra flags and operating system (gzip) */ +const EXLEN = 16184; /* i: waiting for extra length (gzip) */ +const EXTRA = 16185; /* i: waiting for extra bytes (gzip) */ +const NAME = 16186; /* i: waiting for end of file name (gzip) */ +const COMMENT = 16187; /* i: waiting for end of comment (gzip) */ +const HCRC = 16188; /* i: waiting for header crc (gzip) */ +const DICTID = 16189; /* i: waiting for dictionary check value */ +const DICT = 16190; /* waiting for inflateSetDictionary() call */ +const TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ +const TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */ +const STORED = 16193; /* i: waiting for stored size (length and complement) */ +const COPY_ = 16194; /* i/o: same as COPY below, but only first time in */ +const COPY = 16195; /* i/o: waiting for input or output to copy stored block */ +const TABLE = 16196; /* i: waiting for dynamic block table lengths */ +const LENLENS = 16197; /* i: waiting for code length code lengths */ +const CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */ +const LEN_ = 16199; /* i: same as LEN below, but only first time in */ +const LEN = 16200; /* i: waiting for length/lit/eob code */ +const LENEXT = 16201; /* i: waiting for length extra bits */ +const DIST = 16202; /* i: waiting for distance code */ +const DISTEXT = 16203; /* i: waiting for distance extra bits */ +const MATCH = 16204; /* o: waiting for output space to copy string */ +const LIT = 16205; /* o: waiting for output space to write literal */ +const CHECK = 16206; /* i: waiting for 32-bit check value */ +const LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */ +const DONE = 16208; /* finished check, done -- remain here until reset */ +const BAD = 16209; /* got a data error -- remain here until reset */ +const MEM = 16210; /* got an inflate() memory error -- remain here until reset */ +const SYNC = 16211; /* looking for synchronization bytes to restart inflate() */ + +/* ===========================================================================*/ + + + +const ENOUGH_LENS = 852; +const ENOUGH_DISTS = 592; +//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +const MAX_WBITS = 15; +/* 32K LZ77 window */ +const DEF_WBITS = MAX_WBITS; + + +const zswap32 = (q) => { + + return (((q >>> 24) & 0xff) + + ((q >>> 8) & 0xff00) + + ((q & 0xff00) << 8) + + ((q & 0xff) << 24)); +}; + + +function InflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip, + bit 2 true to validate check value */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib), or + -1 if raw or no header yet */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ +} + + +const inflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const state = strm.state; + if (!state || state.strm !== strm || + state.mode < HEAD || state.mode > SYNC) { + return 1; + } + return 0; +}; + + +const inflateResetKeep = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.flags = -1; + state.dmax = 32768; + state.head = null/*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK$1; +}; + + +const inflateReset = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + +}; + + +const inflateReset2 = (strm, windowBits) => { + let wrap; + + /* get the state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } + else { + wrap = (windowBits >> 4) + 5; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR$1; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); +}; + + +const inflateInit2 = (strm, windowBits) => { + + if (!strm) { return Z_STREAM_ERROR$1; } + //strm.msg = Z_NULL; /* in case we return an error */ + + const state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.strm = strm; + state.window = null/*Z_NULL*/; + state.mode = HEAD; /* to pass state test in inflateReset2() */ + const ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK$1) { + strm.state = null/*Z_NULL*/; + } + return ret; +}; + + +const inflateInit = (strm) => { + + return inflateInit2(strm, DEF_WBITS); +}; + + +/* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ +let virgin = true; + +let lenfix, distfix; // We have no pointers in JS, so keep tables separate + + +const fixedtables = (state) => { + + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + let sym = 0; + while (sym < 144) { state.lens[sym++] = 8; } + while (sym < 256) { state.lens[sym++] = 9; } + while (sym < 280) { state.lens[sym++] = 7; } + while (sym < 288) { state.lens[sym++] = 8; } + + inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); + + /* distance table */ + sym = 0; + while (sym < 32) { state.lens[sym++] = 5; } + + inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); + + /* do this just once */ + virgin = false; + } + + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; +}; + + +/* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ +const updatewindow = (strm, src, end, copy) => { + + let dist; + const state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } + else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } + else { + state.wnext += dist; + if (state.wnext === state.wsize) { state.wnext = 0; } + if (state.whave < state.wsize) { state.whave += dist; } + } + } + return 0; +}; + + +const inflate$2 = (strm, flush) => { + + let state; + let input, output; // input/output buffers + let next; /* next input INDEX */ + let put; /* next output INDEX */ + let have, left; /* available input and output */ + let hold; /* bit buffer */ + let bits; /* bits in bit buffer */ + let _in, _out; /* save starting available input and output */ + let copy; /* number of stored or match bytes to copy */ + let from; /* where to copy match bytes from */ + let from_source; + let here = 0; /* current decoding table entry */ + let here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + let last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + let len; /* length to copy for repeats, bits to drop */ + let ret; /* return code */ + const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + let opts; + + let n; // temporary variable for NEED_BITS + + const order = /* permutation of code lengths */ + new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]); + + + if (inflateStateCheck(strm) || !strm.output || + (!strm.input && strm.avail_in !== 0)) { + return Z_STREAM_ERROR$1; + } + + state = strm.state; + if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ + + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK$1; + + inf_leave: // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ + if (state.wbits === 0) { + state.wbits = 15; + } + state.check = 0/*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f)/*BITS(4)*/ + 8; + if (state.wbits === 0) { + state.wbits = len; + } + if (len > 15 || len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + state.flags = 0; /* indicate zlib header */ + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = ((hold >> 8) & 1); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + hbuf[2] = (hold >>> 16) & 0xff; + hbuf[3] = (hold >>> 24) & 0xff; + state.check = crc32_1(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = (hold & 0xff); + state.head.os = (hold >> 8); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + else if (state.head) { + state.head.extra = null/*Z_NULL*/; + } + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { copy = have; } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set( + input.subarray( + next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy + ), + /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len + ); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { break inf_leave; } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.name_max*/)) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.comm_max*/)) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + if (state.head) { + state.head.hcrc = ((state.flags >> 9) & 1); + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT$1; + } + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = (hold & 0x01)/*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch ((hold & 0x03)/*BITS(2)*/) { + case 0: /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { copy = have; } + if (copy > left) { copy = left; } + if (copy === 0) { break inf_leave; } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// +//#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } +//#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + + opts = { bits: state.lenbits }; + ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } + else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03);//BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } + else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f);//BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { break; } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + + opts = { bits: state.lenbits }; + ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { bits: state.distbits }; + ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inffast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if (here_bits <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = (here_op) & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } +//#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +//#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { break inf_leave; } + copy = _out - left; + if (state.offset > copy) { /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// Trace((stderr, "inflate.c too far\n")); +// copy -= state.whave; +// if (copy > state.length) { copy = state.length; } +// if (copy > left) { copy = left; } +// left -= copy; +// state.length -= copy; +// do { +// output[put++] = 0; +// } while (--copy); +// if (state.length === 0) { state.mode = LEN; } +// break; +//#endif + } + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } + else { + from = state.wnext - copy; + } + if (copy > state.length) { copy = state.length; } + from_source = state.window; + } + else { /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { copy = left; } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { state.mode = LEN; } + break; + case LIT: + if (left === 0) { break inf_leave; } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = + /*UPDATE_CHECK(state.check, put - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out)); + + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END$1; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR$1; + break inf_leave; + case MEM: + return Z_MEM_ERROR$1; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR$1; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && + (state.mode < CHECK || flush !== Z_FINISH$1))) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ; + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out)); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + + (state.mode === TYPE ? 128 : 0) + + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) { + ret = Z_BUF_ERROR; + } + return ret; +}; + + +const inflateEnd = (strm) => { + + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + + let state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK$1; +}; + + +const inflateGetHeader = (strm, head) => { + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK$1; +}; + + +const inflateSetDictionary = (strm, dictionary) => { + const dictLength = dictionary.length; + + let state; + let dictid; + let ret; + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + state = strm.state; + + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR$1; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32_1(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR$1; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR$1; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK$1; +}; + + +var inflateReset_1 = inflateReset; +var inflateReset2_1 = inflateReset2; +var inflateResetKeep_1 = inflateResetKeep; +var inflateInit_1 = inflateInit; +var inflateInit2_1 = inflateInit2; +var inflate_2$1 = inflate$2; +var inflateEnd_1 = inflateEnd; +var inflateGetHeader_1 = inflateGetHeader; +var inflateSetDictionary_1 = inflateSetDictionary; +var inflateInfo = 'pako inflate (from Nodeca project)'; + +/* Not implemented +module.exports.inflateCodesUsed = inflateCodesUsed; +module.exports.inflateCopy = inflateCopy; +module.exports.inflateGetDictionary = inflateGetDictionary; +module.exports.inflateMark = inflateMark; +module.exports.inflatePrime = inflatePrime; +module.exports.inflateSync = inflateSync; +module.exports.inflateSyncPoint = inflateSyncPoint; +module.exports.inflateUndermine = inflateUndermine; +module.exports.inflateValidate = inflateValidate; +*/ + +var inflate_1$2 = { + inflateReset: inflateReset_1, + inflateReset2: inflateReset2_1, + inflateResetKeep: inflateResetKeep_1, + inflateInit: inflateInit_1, + inflateInit2: inflateInit2_1, + inflate: inflate_2$1, + inflateEnd: inflateEnd_1, + inflateGetHeader: inflateGetHeader_1, + inflateSetDictionary: inflateSetDictionary_1, + inflateInfo: inflateInfo +}; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; +} + +var gzheader = GZheader; + +const toString = Object.prototype.toString; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR +} = constants$2; + +/* ===========================================================================*/ + + +/** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + +/* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + +/** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + +/** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + +/** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + +/** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ +function Inflate$1(options) { + this.options = common.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + + const opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { opt.windowBits = -15; } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if ((opt.windowBits >= 0) && (opt.windowBits < 16) && + !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if ((opt.windowBits > 15) && (opt.windowBits < 48)) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = inflate_1$2.inflateInit2( + this.strm, + opt.windowBits + ); + + if (status !== Z_OK) { + throw new Error(messages[status]); + } + + this.header = new gzheader(); + + inflate_1$2.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { //In raw mode we need to set the dictionary early + status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + } + } +} + +/** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Inflate$1.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + const dictionary = this.options.dictionary; + let status, _flush_mode, last_avail_out; + + if (this.ended) return false; + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + status = inflate_1$2.inflate(strm, _flush_mode); + + if (status === Z_NEED_DICT && dictionary) { + status = inflate_1$2.inflateSetDictionary(strm, dictionary); + + if (status === Z_OK) { + status = inflate_1$2.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && + status === Z_STREAM_END && + strm.state.wrap > 0 && + data[strm.next_in] !== 0) + { + inflate_1$2.inflateReset(strm); + status = inflate_1$2.inflate(strm, _flush_mode); + } + + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + + if (this.options.to === 'string') { + + let next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + + let tail = strm.next_out - next_out_utf8; + let utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + + this.onData(utf8str); + + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = inflate_1$2.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + + if (strm.avail_in === 0) break; + } + + return true; +}; + + +/** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Inflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Inflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = common.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ +function inflate$1(input, options) { + const inflator = new Inflate$1(options); + + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || messages[inflator.err]; + + return inflator.result; +} + + +/** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function inflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return inflate$1(input, options); +} + + +/** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + +var Inflate_1$1 = Inflate$1; +var inflate_2 = inflate$1; +var inflateRaw_1$1 = inflateRaw$1; +var ungzip$1 = inflate$1; +var constants = constants$2; + +var inflate_1$1 = { + Inflate: Inflate_1$1, + inflate: inflate_2, + inflateRaw: inflateRaw_1$1, + ungzip: ungzip$1, + constants: constants +}; + +const { Deflate, deflate, deflateRaw, gzip } = deflate_1$1; + +const { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1; + + + +var Deflate_1 = Deflate; +var deflate_1 = deflate; +var deflateRaw_1 = deflateRaw; +var gzip_1 = gzip; +var Inflate_1 = Inflate; +var inflate_1 = inflate; +var inflateRaw_1 = inflateRaw; +var ungzip_1 = ungzip; +var constants_1 = constants$2; + +var pako = { + Deflate: Deflate_1, + deflate: deflate_1, + deflateRaw: deflateRaw_1, + gzip: gzip_1, + Inflate: Inflate_1, + inflate: inflate_1, + inflateRaw: inflateRaw_1, + ungzip: ungzip_1, + constants: constants_1 +}; + +export { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip }; diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako.js b/测试流式传输uniapp/node_modules/pako/dist/pako.js new file mode 100644 index 0000000..0c4968d --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako.js @@ -0,0 +1,6896 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +(function (global, factory) { + typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : + typeof define === 'function' && define.amd ? define(['exports'], factory) : + (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.pako = {})); +})(this, (function (exports) { 'use strict'; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + /* eslint-disable space-unary-ops */ + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + + //const Z_FILTERED = 1; + //const Z_HUFFMAN_ONLY = 2; + //const Z_RLE = 3; + const Z_FIXED$1 = 4; + //const Z_DEFAULT_STRATEGY = 0; + + /* Possible values of the data_type field (though see inflate()) */ + const Z_BINARY = 0; + const Z_TEXT = 1; + //const Z_ASCII = 1; // = Z_TEXT + const Z_UNKNOWN$1 = 2; + + /*============================================================================*/ + + + function zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } } + + // From zutil.h + + const STORED_BLOCK = 0; + const STATIC_TREES = 1; + const DYN_TREES = 2; + /* The three kinds of block type */ + + const MIN_MATCH$1 = 3; + const MAX_MATCH$1 = 258; + /* The minimum and maximum match lengths */ + + // From deflate.h + /* =========================================================================== + * Internal compression state. + */ + + const LENGTH_CODES$1 = 29; + /* number of length codes, not counting the special END_BLOCK code */ + + const LITERALS$1 = 256; + /* number of literal bytes 0..255 */ + + const L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1; + /* number of Literal or Length codes, including the END_BLOCK code */ + + const D_CODES$1 = 30; + /* number of distance codes */ + + const BL_CODES$1 = 19; + /* number of codes used to transfer the bit lengths */ + + const HEAP_SIZE$1 = 2 * L_CODES$1 + 1; + /* maximum heap size */ + + const MAX_BITS$1 = 15; + /* All codes must not exceed MAX_BITS bits */ + + const Buf_size = 16; + /* size of bit buffer in bi_buf */ + + + /* =========================================================================== + * Constants + */ + + const MAX_BL_BITS = 7; + /* Bit length codes must not exceed MAX_BL_BITS bits */ + + const END_BLOCK = 256; + /* end of block literal code */ + + const REP_3_6 = 16; + /* repeat previous bit length 3-6 times (2 bits of repeat count) */ + + const REPZ_3_10 = 17; + /* repeat a zero length 3-10 times (3 bits of repeat count) */ + + const REPZ_11_138 = 18; + /* repeat a zero length 11-138 times (7 bits of repeat count) */ + + /* eslint-disable comma-spacing,array-bracket-spacing */ + const extra_lbits = /* extra bits for each length code */ + new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]); + + const extra_dbits = /* extra bits for each distance code */ + new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]); + + const extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]); + + const bl_order = + new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]); + /* eslint-enable comma-spacing,array-bracket-spacing */ + + /* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + + /* =========================================================================== + * Local data. These are initialized only once. + */ + + // We pre-fill arrays with 0 to avoid uninitialized gaps + + const DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + + // !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 + const static_ltree = new Array((L_CODES$1 + 2) * 2); + zero$1(static_ltree); + /* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + + const static_dtree = new Array(D_CODES$1 * 2); + zero$1(static_dtree); + /* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + + const _dist_code = new Array(DIST_CODE_LEN); + zero$1(_dist_code); + /* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + + const _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1); + zero$1(_length_code); + /* length code for each normalized match length (0 == MIN_MATCH) */ + + const base_length = new Array(LENGTH_CODES$1); + zero$1(base_length); + /* First normalized length for each code (0 = MIN_MATCH) */ + + const base_dist = new Array(D_CODES$1); + zero$1(base_dist); + /* First normalized distance for each code (0 = distance of 1) */ + + + function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; + } + + + let static_l_desc; + let static_d_desc; + let static_bl_desc; + + + function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ + } + + + + const d_code = (dist) => { + + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; + }; + + + /* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ + const put_short = (s, w) => { + // put_byte(s, (uch)((w) & 0xff)); + // put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = (w) & 0xff; + s.pending_buf[s.pending++] = (w >>> 8) & 0xff; + }; + + + /* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ + const send_bits = (s, value, length) => { + + if (s.bi_valid > (Buf_size - length)) { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> (Buf_size - s.bi_valid); + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + s.bi_valid += length; + } + }; + + + const send_code = (s, c, tree) => { + + send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); + }; + + + /* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ + const bi_reverse = (code, len) => { + + let res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; + }; + + + /* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ + const bi_flush = (s) => { + + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } + }; + + + /* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ + const gen_bitlen = (s, desc) => { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const max_code = desc.max_code; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const extra = desc.stat_desc.extra_bits; + const base = desc.stat_desc.extra_base; + const max_length = desc.stat_desc.max_length; + let h; /* heap index */ + let n, m; /* iterate over the tree elements */ + let bits; /* bit length */ + let xbits; /* extra bits */ + let f; /* frequency */ + let overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS$1; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1]/*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { continue; } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2]/*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); + } + } + if (overflow === 0) { return; } + + // Tracev((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { bits--; } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { continue; } + if (tree[m * 2 + 1]/*.Len*/ !== bits) { + // Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; + tree[m * 2 + 1]/*.Len*/ = bits; + } + n--; + } + } + }; + + + /* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ + const gen_codes = (tree, max_code, bl_count) => { + // ct_data *tree; /* the tree to decorate */ + // int max_code; /* largest code with non zero frequency */ + // ushf *bl_count; /* number of codes at each bit length */ + + const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */ + let code = 0; /* running code value */ + let bits; /* bit index */ + let n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS$1; bits++) { + code = (code + bl_count[bits - 1]) << 1; + next_code[bits] = code; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< { + + let n; /* iterates over tree elements */ + let bits; /* bit counter */ + let length; /* length value */ + let code; /* code value */ + let dist; /* distance index */ + const bl_count = new Array(MAX_BITS$1 + 1); + /* number of codes at each bit length for an optimal tree */ + + // do check in _tr_init() + //if (static_init_done) return; + + /* For some embedded targets, global variables are not initialized: */ + /*#ifdef NO_INIT_GLOBAL_POINTERS + static_l_desc.static_tree = static_ltree; + static_l_desc.extra_bits = extra_lbits; + static_d_desc.static_tree = static_dtree; + static_d_desc.extra_bits = extra_dbits; + static_bl_desc.extra_bits = extra_blbits; + #endif*/ + + /* Initialize the mapping length (0..255) -> length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES$1 - 1; code++) { + base_length[code] = length; + for (n = 0; n < (1 << extra_lbits[code]); n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1 << extra_dbits[code]); n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES$1; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS$1; bits++) { + bl_count[bits] = 0; + } + + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1]/*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1]/*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES$1 + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES$1; n++) { + static_dtree[n * 2 + 1]/*.Len*/ = 5; + static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS); + + //static_init_done = true; + }; + + + /* =========================================================================== + * Initialize a new block. + */ + const init_block = (s) => { + + let n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } + + s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.sym_next = s.matches = 0; + }; + + + /* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ + const bi_windup = (s) => + { + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; + }; + + /* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ + const smaller = (tree, n, m, depth) => { + + const _n2 = n * 2; + const _m2 = m * 2; + return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || + (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); + }; + + /* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ + const pqdownheap = (s, tree, k) => { + // deflate_state *s; + // ct_data *tree; /* the tree to restore */ + // int k; /* node to move down */ + + const v = s.heap[k]; + let j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && + smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { break; } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; + }; + + + // inlined manually + // const SMALLEST = 1; + + /* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ + const compress_block = (s, ltree, dtree) => { + // deflate_state *s; + // const ct_data *ltree; /* literal tree */ + // const ct_data *dtree; /* distance tree */ + + let dist; /* distance of matched string */ + let lc; /* match length or unmatched char (if dist == 0) */ + let sx = 0; /* running index in sym_buf */ + let code; /* the code to send */ + let extra; /* number of extra bits to send */ + + if (s.sym_next !== 0) { + do { + dist = s.pending_buf[s.sym_buf + sx++] & 0xff; + dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8; + lc = s.pending_buf[s.sym_buf + sx++]; + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and sym_buf is ok: */ + //Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow"); + + } while (sx < s.sym_next); + } + + send_code(s, END_BLOCK, ltree); + }; + + + /* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ + const build_tree = (s, desc) => { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const elems = desc.stat_desc.elems; + let n, m; /* iterate over heap elements */ + let max_code = -1; /* largest code with non zero frequency */ + let node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE$1; + + for (n = 0; n < elems; n++) { + if (tree[n * 2]/*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + + } else { + tree[n * 2 + 1]/*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); + tree[node * 2]/*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + + if (has_stree) { + s.static_len -= stree[node * 2 + 1]/*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1/*SMALLEST*/]; + s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1/*SMALLEST*/); + /***/ + + m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1/*SMALLEST*/] = node++; + pqdownheap(s, tree, 1/*SMALLEST*/); + + } while (s.heap_len >= 2); + + s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); + }; + + + /* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ + const scan_tree = (s, tree, max_code) => { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + s.bl_tree[curlen * 2]/*.Freq*/ += count; + + } else if (curlen !== 0) { + + if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } + s.bl_tree[REP_3_6 * 2]/*.Freq*/++; + + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; + + } else { + s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; + } + + count = 0; + prevlen = curlen; + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } + }; + + + /* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ + const send_tree = (s, tree, max_code) => { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); + + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } + }; + + + /* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ + const build_bl_tree = (s) => { + + let max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; + }; + + + /* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ + const send_all_trees = (s, lcodes, dcodes, blcodes) => { + // deflate_state *s; + // int lcodes, dcodes, blcodes; /* number of codes for each tree */ + + let rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); + }; + + + /* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "block list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ + const detect_data_type = (s) => { + /* block_mask is the bit mask of block-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + let block_mask = 0xf3ffc07f; + let n; + + /* Check for non-textual ("block-listed") bytes. */ + for (n = 0; n <= 31; n++, block_mask >>>= 1) { + if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { + return Z_BINARY; + } + } + + /* Check for textual ("allow-listed") bytes. */ + if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || + s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS$1; n++) { + if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "block-listed" or "allow-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; + }; + + + let static_init_done = false; + + /* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ + const _tr_init$1 = (s) => + { + + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); + }; + + + /* =========================================================================== + * Send a stored block + */ + const _tr_stored_block$1 = (s, buf, stored_len, last) => { + //DeflateState *s; + //charf *buf; /* input block */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + bi_windup(s); /* align on byte boundary */ + put_short(s, stored_len); + put_short(s, ~stored_len); + if (stored_len) { + s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending); + } + s.pending += stored_len; + }; + + + /* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ + const _tr_align$1 = (s) => { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); + }; + + + /* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and write out the encoded block. + */ + const _tr_flush_block$1 = (s, buf, stored_len, last) => { + //DeflateState *s; + //charf *buf; /* input block, or NULL if too old */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + let opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + let max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN$1) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = (s.opt_len + 3 + 7) >>> 3; + static_lenb = (s.static_len + 3 + 7) >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->sym_next / 3)); + + if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } + + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block$1(s, buf, stored_len, last); + + } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) { + + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); + }; + + /* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ + const _tr_tally$1 = (s, dist, lc) => { + // deflate_state *s; + // unsigned dist; /* distance of matched string */ + // unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ + + s.pending_buf[s.sym_buf + s.sym_next++] = dist; + s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8; + s.pending_buf[s.sym_buf + s.sym_next++] = lc; + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2]/*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; + } + + return (s.sym_next === s.sym_end); + }; + + var _tr_init_1 = _tr_init$1; + var _tr_stored_block_1 = _tr_stored_block$1; + var _tr_flush_block_1 = _tr_flush_block$1; + var _tr_tally_1 = _tr_tally$1; + var _tr_align_1 = _tr_align$1; + + var trees = { + _tr_init: _tr_init_1, + _tr_stored_block: _tr_stored_block_1, + _tr_flush_block: _tr_flush_block_1, + _tr_tally: _tr_tally_1, + _tr_align: _tr_align_1 + }; + + // Note: adler32 takes 12% for level 0 and 2% for level 6. + // It isn't worth it to make additional optimizations as in original. + // Small size is preferable. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const adler32 = (adler, buf, len, pos) => { + let s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; + }; + + + var adler32_1 = adler32; + + // Note: we can't get significant speed boost here. + // So write code to minimize size - no pregenerated tables + // and array tools dependencies. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // Use ordinary array, since untyped makes no boost here + const makeTable = () => { + let c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; + }; + + // Create table on load. Just 255 signed longs. Not a problem. + const crcTable = new Uint32Array(makeTable()); + + + const crc32 = (crc, buf, len, pos) => { + const t = crcTable; + const end = pos + len; + + crc ^= -1; + + for (let i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; + }; + + + var crc32_1 = crc32; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var messages = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var constants$2 = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees; + + + + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1, + Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1, + Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1, + Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1, + Z_UNKNOWN, + Z_DEFLATED: Z_DEFLATED$2 + } = constants$2; + + /*============================================================================*/ + + + const MAX_MEM_LEVEL = 9; + /* Maximum value for memLevel in deflateInit2 */ + const MAX_WBITS$1 = 15; + /* 32K LZ77 window */ + const DEF_MEM_LEVEL = 8; + + + const LENGTH_CODES = 29; + /* number of length codes, not counting the special END_BLOCK code */ + const LITERALS = 256; + /* number of literal bytes 0..255 */ + const L_CODES = LITERALS + 1 + LENGTH_CODES; + /* number of Literal or Length codes, including the END_BLOCK code */ + const D_CODES = 30; + /* number of distance codes */ + const BL_CODES = 19; + /* number of codes used to transfer the bit lengths */ + const HEAP_SIZE = 2 * L_CODES + 1; + /* maximum heap size */ + const MAX_BITS = 15; + /* All codes must not exceed MAX_BITS bits */ + + const MIN_MATCH = 3; + const MAX_MATCH = 258; + const MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); + + const PRESET_DICT = 0x20; + + const INIT_STATE = 42; /* zlib header -> BUSY_STATE */ + //#ifdef GZIP + const GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */ + //#endif + const EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */ + const NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */ + const COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */ + const HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */ + const BUSY_STATE = 113; /* deflate -> FINISH_STATE */ + const FINISH_STATE = 666; /* stream complete */ + + const BS_NEED_MORE = 1; /* block not completed, need more input or more output */ + const BS_BLOCK_DONE = 2; /* block flush performed */ + const BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ + const BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + + const OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + + const err = (strm, errorCode) => { + strm.msg = messages[errorCode]; + return errorCode; + }; + + const rank = (f) => { + return ((f) * 2) - ((f) > 4 ? 9 : 0); + }; + + const zero = (buf) => { + let len = buf.length; while (--len >= 0) { buf[len] = 0; } + }; + + /* =========================================================================== + * Slide the hash table when sliding the window down (could be avoided with 32 + * bit values at the expense of memory usage). We slide even when level == 0 to + * keep the hash table consistent if we switch back to level > 0 later. + */ + const slide_hash = (s) => { + let n, m; + let p; + let wsize = s.w_size; + + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = (m >= wsize ? m - wsize : 0); + } while (--n); + n = wsize; + //#ifndef FASTEST + p = n; + do { + m = s.prev[--p]; + s.prev[p] = (m >= wsize ? m - wsize : 0); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); + //#endif + }; + + /* eslint-disable new-cap */ + let HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask; + // This hash causes less collisions, https://github.com/nodeca/pako/issues/135 + // But breaks binary compatibility + //let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; + let HASH = HASH_ZLIB; + + + /* ========================================================================= + * Flush as much pending output as possible. All deflate() output, except for + * some deflate_stored() output, goes through this function so some + * applications may wish to modify it to avoid allocating a large + * strm->next_out buffer and copying into it. (See also read_buf()). + */ + const flush_pending = (strm) => { + const s = strm.state; + + //_tr_flush_bits(s); + let len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { return; } + + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } + }; + + + const flush_block_only = (s, last) => { + _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); + }; + + + const put_byte = (s, b) => { + s.pending_buf[s.pending++] = b; + }; + + + /* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ + const putShortMSB = (s, b) => { + + // put_byte(s, (Byte)(b >> 8)); + // put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = (b >>> 8) & 0xff; + s.pending_buf[s.pending++] = b & 0xff; + }; + + + /* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ + const read_buf = (strm, buf, start, size) => { + + let len = strm.avail_in; + + if (len > size) { len = size; } + if (len === 0) { return 0; } + + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32_1(strm.adler, buf, len, start); + } + + else if (strm.state.wrap === 2) { + strm.adler = crc32_1(strm.adler, buf, len, start); + } + + strm.next_in += len; + strm.total_in += len; + + return len; + }; + + + /* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ + const longest_match = (s, cur_match) => { + + let chain_length = s.max_chain_length; /* max hash chain length */ + let scan = s.strstart; /* current string */ + let match; /* matched string */ + let len; /* length of current match */ + let best_len = s.prev_length; /* best match length so far */ + let nice_match = s.nice_match; /* stop if match long enough */ + const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? + s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; + + const _win = s.window; // shortcut + + const wmask = s.w_mask; + const prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + const strend = s.strstart + MAX_MATCH; + let scan_end1 = _win[scan + best_len - 1]; + let scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { nice_match = s.lookahead; } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || + _win[match + best_len - 1] !== scan_end1 || + _win[match] !== _win[scan] || + _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; + }; + + + /* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ + const fill_window = (s) => { + + const _w_size = s.w_size; + let n, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + + s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + slide_hash(s); + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); + //#if MIN_MATCH != 3 + // Call update_hash() MIN_MATCH-3 more times + //#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ + // if (s.high_water < s.window_size) { + // const curr = s.strstart + s.lookahead; + // let init = 0; + // + // if (s.high_water < curr) { + // /* Previous high water mark below current data -- zero WIN_INIT + // * bytes or up to end of window, whichever is less. + // */ + // init = s.window_size - curr; + // if (init > WIN_INIT) + // init = WIN_INIT; + // zmemzero(s->window + curr, (unsigned)init); + // s->high_water = curr + init; + // } + // else if (s->high_water < (ulg)curr + WIN_INIT) { + // /* High water mark at or above current data, but below current data + // * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up + // * to end of window, whichever is less. + // */ + // init = (ulg)curr + WIN_INIT - s->high_water; + // if (init > s->window_size - s->high_water) + // init = s->window_size - s->high_water; + // zmemzero(s->window + s->high_water, (unsigned)init); + // s->high_water += init; + // } + // } + // + // Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, + // "not enough room for search"); + }; + + /* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * + * In case deflateParams() is used to later switch to a non-zero compression + * level, s->matches (otherwise unused when storing) keeps track of the number + * of hash table slides to perform. If s->matches is 1, then one hash table + * slide will be done when switching. If s->matches is 2, the maximum value + * allowed here, then the hash table will be cleared, since two or more slides + * is the same as a clear. + * + * deflate_stored() is written to minimize the number of times an input byte is + * copied. It is most efficient with large input and output buffers, which + * maximizes the opportunites to have a single copy from next_in to next_out. + */ + const deflate_stored = (s, flush) => { + + /* Smallest worthy block size when not flushing or finishing. By default + * this is 32K. This can be as small as 507 bytes for memLevel == 1. For + * large input and output buffers, the stored block size will be larger. + */ + let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5; + + /* Copy as many min_block or larger stored blocks directly to next_out as + * possible. If flushing, copy the remaining available input to next_out as + * stored blocks, if there is enough space. + */ + let len, left, have, last = 0; + let used = s.strm.avail_in; + do { + /* Set len to the maximum size block that we can copy directly with the + * available input data and output space. Set left to how much of that + * would be copied from what's left in the window. + */ + len = 65535/* MAX_STORED */; /* maximum deflate stored block length */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + if (s.strm.avail_out < have) { /* need room for header */ + break; + } + /* maximum stored block length that will fit in avail_out: */ + have = s.strm.avail_out - have; + left = s.strstart - s.block_start; /* bytes left in window */ + if (len > left + s.strm.avail_in) { + len = left + s.strm.avail_in; /* limit len to the input */ + } + if (len > have) { + len = have; /* limit len to the output */ + } + + /* If the stored block would be less than min_block in length, or if + * unable to copy all of the available input when flushing, then try + * copying to the window and the pending buffer instead. Also don't + * write an empty block when flushing -- deflate() does that. + */ + if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) || + flush === Z_NO_FLUSH$2 || + len !== left + s.strm.avail_in)) { + break; + } + + /* Make a dummy stored block in pending to get the header bytes, + * including any pending bits. This also updates the debugging counts. + */ + last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0; + _tr_stored_block(s, 0, 0, last); + + /* Replace the lengths in the dummy stored block with len. */ + s.pending_buf[s.pending - 4] = len; + s.pending_buf[s.pending - 3] = len >> 8; + s.pending_buf[s.pending - 2] = ~len; + s.pending_buf[s.pending - 1] = ~len >> 8; + + /* Write the stored block header bytes. */ + flush_pending(s.strm); + + //#ifdef ZLIB_DEBUG + // /* Update debugging counts for the data about to be copied. */ + // s->compressed_len += len << 3; + // s->bits_sent += len << 3; + //#endif + + /* Copy uncompressed bytes from the window to next_out. */ + if (left) { + if (left > len) { + left = len; + } + //zmemcpy(s->strm->next_out, s->window + s->block_start, left); + s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out); + s.strm.next_out += left; + s.strm.avail_out -= left; + s.strm.total_out += left; + s.block_start += left; + len -= left; + } + + /* Copy uncompressed bytes directly from next_in to next_out, updating + * the check value. + */ + if (len) { + read_buf(s.strm, s.strm.output, s.strm.next_out, len); + s.strm.next_out += len; + s.strm.avail_out -= len; + s.strm.total_out += len; + } + } while (last === 0); + + /* Update the sliding window with the last s->w_size bytes of the copied + * data, or append all of the copied data to the existing window if less + * than s->w_size bytes were copied. Also update the number of bytes to + * insert in the hash tables, in the event that deflateParams() switches to + * a non-zero compression level. + */ + used -= s.strm.avail_in; /* number of input bytes directly copied */ + if (used) { + /* If any input was used, then no unused input remains in the window, + * therefore s->block_start == s->strstart. + */ + if (used >= s.w_size) { /* supplant the previous history */ + s.matches = 2; /* clear hash */ + //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); + s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0); + s.strstart = s.w_size; + s.insert = s.strstart; + } + else { + if (s.window_size - s.strstart <= used) { + /* Slide the window down. */ + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); + s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart); + s.strstart += used; + s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used; + } + s.block_start = s.strstart; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* If the last block was written to next_out, then done. */ + if (last) { + return BS_FINISH_DONE; + } + + /* If flushing and all input has been consumed, then done. */ + if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 && + s.strm.avail_in === 0 && s.strstart === s.block_start) { + return BS_BLOCK_DONE; + } + + /* Fill the window with any remaining input. */ + have = s.window_size - s.strstart; + if (s.strm.avail_in > have && s.block_start >= s.w_size) { + /* Slide the window down. */ + s.block_start -= s.w_size; + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + have += s.w_size; /* more space now */ + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + if (have > s.strm.avail_in) { + have = s.strm.avail_in; + } + if (have) { + read_buf(s.strm, s.window, s.strstart, have); + s.strstart += have; + s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* There was not enough avail_out to write a complete worthy or flushed + * stored block to next_out. Write a stored block to pending instead, if we + * have enough input for a worthy block, or if flushing and there is enough + * room for the remaining input as a stored block in the pending buffer. + */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + /* maximum stored block length that will fit in pending: */ + have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have; + min_block = have > s.w_size ? s.w_size : have; + left = s.strstart - s.block_start; + if (left >= min_block || + ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 && + s.strm.avail_in === 0 && left <= have)) { + len = left > have ? have : left; + last = flush === Z_FINISH$3 && s.strm.avail_in === 0 && + len === left ? 1 : 0; + _tr_stored_block(s, s.block_start, len, last); + s.block_start += len; + flush_pending(s.strm); + } + + /* We've done all we can with the available input and output. */ + return last ? BS_FINISH_STARTED : BS_NEED_MORE; + }; + + + /* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ + const deflate_fast = (s, flush) => { + + let hash_head; /* head of the hash chain */ + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else + { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + + //#if MIN_MATCH != 3 + // Call UPDATE_HASH() MIN_MATCH-3 more times + //#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ + const deflate_slow = (s, flush) => { + + let hash_head; /* head of hash chain */ + let bflush; /* set if current block must be flushed */ + + let max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + + if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && + s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && + (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + + /* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ + const deflate_rle = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + let prev; /* byte at distance one to match */ + let scan, strend; /* scan goes up to strend for length of run */ + + const _win = s.window; + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ + const deflate_huff = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH$2) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$3) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; + }; + + /* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ + function Config(good_length, max_lazy, nice_length, max_chain, func) { + + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; + } + + const configuration_table = [ + /* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ + ]; + + + /* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ + const lm_init = (s) => { + + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; + }; + + + function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED$2; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.sym_buf = 0; /* buffer for distances and literals/lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.sym_next = 0; /* running index in sym_buf */ + this.sym_end = 0; /* symbol table full when sym_next reaches this */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ + } + + + /* ========================================================================= + * Check for a valid deflate stream state. Return 0 if ok, 1 if not. + */ + const deflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const s = strm.state; + if (!s || s.strm !== strm || (s.status !== INIT_STATE && + //#ifdef GZIP + s.status !== GZIP_STATE && + //#endif + s.status !== EXTRA_STATE && + s.status !== NAME_STATE && + s.status !== COMMENT_STATE && + s.status !== HCRC_STATE && + s.status !== BUSY_STATE && + s.status !== FINISH_STATE)) { + return 1; + } + return 0; + }; + + + const deflateResetKeep = (strm) => { + + if (deflateStateCheck(strm)) { + return err(strm, Z_STREAM_ERROR$2); + } + + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + + const s = strm.state; + s.pending = 0; + s.pending_out = 0; + + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + s.status = + //#ifdef GZIP + s.wrap === 2 ? GZIP_STATE : + //#endif + s.wrap ? INIT_STATE : BUSY_STATE; + strm.adler = (s.wrap === 2) ? + 0 // crc32(0, Z_NULL, 0) + : + 1; // adler32(0, Z_NULL, 0) + s.last_flush = -2; + _tr_init(s); + return Z_OK$3; + }; + + + const deflateReset = (strm) => { + + const ret = deflateResetKeep(strm); + if (ret === Z_OK$3) { + lm_init(strm.state); + } + return ret; + }; + + + const deflateSetHeader = (strm, head) => { + + if (deflateStateCheck(strm) || strm.state.wrap !== 2) { + return Z_STREAM_ERROR$2; + } + strm.state.gzhead = head; + return Z_OK$3; + }; + + + const deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => { + + if (!strm) { // === Z_NULL + return Z_STREAM_ERROR$2; + } + let wrap = 1; + + if (level === Z_DEFAULT_COMPRESSION$1) { + level = 6; + } + + if (windowBits < 0) { /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } + + else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + + + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 || + windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) { + return err(strm, Z_STREAM_ERROR$2); + } + + + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + const s = new DeflateState(); + + strm.state = s; + s.strm = strm; + s.status = INIT_STATE; /* to pass state test in deflateReset() */ + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + /* We overlay pending_buf and sym_buf. This works since the average size + * for length/distance pairs over any compressed block is assured to be 31 + * bits or less. + * + * Analysis: The longest fixed codes are a length code of 8 bits plus 5 + * extra bits, for lengths 131 to 257. The longest fixed distance codes are + * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest + * possible fixed-codes length/distance pair is then 31 bits total. + * + * sym_buf starts one-fourth of the way into pending_buf. So there are + * three bytes in sym_buf for every four bytes in pending_buf. Each symbol + * in sym_buf is three bytes -- two for the distance and one for the + * literal/length. As each symbol is consumed, the pointer to the next + * sym_buf value to read moves forward three bytes. From that symbol, up to + * 31 bits are written to pending_buf. The closest the written pending_buf + * bits gets to the next sym_buf symbol to read is just before the last + * code is written. At that time, 31*(n-2) bits have been written, just + * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at + * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1 + * symbols are written.) The closest the writing gets to what is unread is + * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and + * can range from 128 to 32768. + * + * Therefore, at a minimum, there are 142 bits of space between what is + * written and what is read in the overlain buffers, so the symbols cannot + * be overwritten by the compressed data. That space is actually 139 bits, + * due to the three-bit fixed-code block header. + * + * That covers the case where either Z_FIXED is specified, forcing fixed + * codes, or when the use of fixed codes is chosen, because that choice + * results in a smaller compressed block than dynamic codes. That latter + * condition then assures that the above analysis also covers all dynamic + * blocks. A dynamic-code block will only be chosen to be emitted if it has + * fewer bits than a fixed-code block would for the same set of symbols. + * Therefore its average symbol length is assured to be less than 31. So + * the compressed data for a dynamic block also cannot overwrite the + * symbols from which it is being constructed. + */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->sym_buf = s->pending_buf + s->lit_bufsize; + s.sym_buf = s.lit_bufsize; + + //s->sym_end = (s->lit_bufsize - 1) * 3; + s.sym_end = (s.lit_bufsize - 1) * 3; + /* We avoid equality with lit_bufsize*3 because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ + + s.level = level; + s.strategy = strategy; + s.method = method; + + return deflateReset(strm); + }; + + const deflateInit = (strm, level) => { + + return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1); + }; + + + /* ========================================================================= */ + const deflate$2 = (strm, flush) => { + + if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2; + } + + const s = strm.state; + + if (!strm.output || + (strm.avail_in !== 0 && !strm.input) || + (s.status === FINISH_STATE && flush !== Z_FINISH$3)) { + return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2); + } + + const old_flush = s.last_flush; + s.last_flush = flush; + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK$3; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && + flush !== Z_FINISH$3) { + return err(strm, Z_BUF_ERROR$1); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR$1); + } + + /* Write the header */ + if (s.status === INIT_STATE && s.wrap === 0) { + s.status = BUSY_STATE; + } + if (s.status === INIT_STATE) { + /* zlib header */ + let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8; + let level_flags = -1; + + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= (level_flags << 6); + if (s.strstart !== 0) { header |= PRESET_DICT; } + header += 31 - (header % 31); + + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + //#ifdef GZIP + if (s.status === GZIP_STATE) { + /* gzip header */ + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + else { + put_byte(s, (s.gzhead.text ? 1 : 0) + + (s.gzhead.hcrc ? 2 : 0) + + (!s.gzhead.extra ? 0 : 4) + + (!s.gzhead.name ? 0 : 8) + + (!s.gzhead.comment ? 0 : 16) + ); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, (s.gzhead.time >> 8) & 0xff); + put_byte(s, (s.gzhead.time >> 16) & 0xff); + put_byte(s, (s.gzhead.time >> 24) & 0xff); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let left = (s.gzhead.extra.length & 0xffff) - s.gzindex; + while (s.pending + left > s.pending_buf_size) { + let copy = s.pending_buf_size - s.pending; + // zmemcpy(s.pending_buf + s.pending, + // s.gzhead.extra + s.gzindex, copy); + s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending); + s.pending = s.pending_buf_size; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex += copy; + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + left -= copy; + } + // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility + // TypedArray.slice and TypedArray.from don't exist in IE10-IE11 + let gzhead_extra = new Uint8Array(s.gzhead.extra); + // zmemcpy(s->pending_buf + s->pending, + // s->gzhead->extra + s->gzindex, left); + s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending); + s.pending += left; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = NAME_STATE; + } + if (s.status === NAME_STATE) { + if (s.gzhead.name/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = COMMENT_STATE; + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + } + s.status = HCRC_STATE; + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + } + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$3; + } + } + //#endif + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || + (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) { + let bstate = s.level === 0 ? deflate_stored(s, flush) : + s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : + s.strategy === Z_RLE ? deflate_rle(s, flush) : + configuration_table[s.level].func(s, flush); + + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + return Z_OK$3; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } + else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH$1) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK$3; + } + } + } + + if (flush !== Z_FINISH$3) { return Z_OK$3; } + if (s.wrap <= 0) { return Z_STREAM_END$3; } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + put_byte(s, (strm.adler >> 16) & 0xff); + put_byte(s, (strm.adler >> 24) & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, (strm.total_in >> 8) & 0xff); + put_byte(s, (strm.total_in >> 16) & 0xff); + put_byte(s, (strm.total_in >> 24) & 0xff); + } + else + { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { s.wrap = -s.wrap; } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3; + }; + + + const deflateEnd = (strm) => { + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR$2; + } + + const status = strm.state.status; + + strm.state = null; + + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3; + }; + + + /* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ + const deflateSetDictionary = (strm, dictionary) => { + + let dictLength = dictionary.length; + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR$2; + } + + const s = strm.state; + const wrap = s.wrap; + + if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) { + return Z_STREAM_ERROR$2; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0); + } + + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + let tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + const avail = strm.avail_in; + const next = strm.next_in; + const input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + let str = s.strstart; + let n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK$3; + }; + + + var deflateInit_1 = deflateInit; + var deflateInit2_1 = deflateInit2; + var deflateReset_1 = deflateReset; + var deflateResetKeep_1 = deflateResetKeep; + var deflateSetHeader_1 = deflateSetHeader; + var deflate_2$1 = deflate$2; + var deflateEnd_1 = deflateEnd; + var deflateSetDictionary_1 = deflateSetDictionary; + var deflateInfo = 'pako deflate (from Nodeca project)'; + + /* Not implemented + module.exports.deflateBound = deflateBound; + module.exports.deflateCopy = deflateCopy; + module.exports.deflateGetDictionary = deflateGetDictionary; + module.exports.deflateParams = deflateParams; + module.exports.deflatePending = deflatePending; + module.exports.deflatePrime = deflatePrime; + module.exports.deflateTune = deflateTune; + */ + + var deflate_1$2 = { + deflateInit: deflateInit_1, + deflateInit2: deflateInit2_1, + deflateReset: deflateReset_1, + deflateResetKeep: deflateResetKeep_1, + deflateSetHeader: deflateSetHeader_1, + deflate: deflate_2$1, + deflateEnd: deflateEnd_1, + deflateSetDictionary: deflateSetDictionary_1, + deflateInfo: deflateInfo + }; + + const _has = (obj, key) => { + return Object.prototype.hasOwnProperty.call(obj, key); + }; + + var assign = function (obj /*from1, from2, from3, ...*/) { + const sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + const source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (const p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + + return obj; + }; + + + // Join array of chunks to single array. + var flattenChunks = (chunks) => { + // calculate data length + let len = 0; + + for (let i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + const result = new Uint8Array(len); + + for (let i = 0, pos = 0, l = chunks.length; i < l; i++) { + let chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; + }; + + var common = { + assign: assign, + flattenChunks: flattenChunks + }; + + // String encode/decode helpers + + + // Quick check if we can use fast array to bin string conversion + // + // - apply(Array) can fail on Android 2.2 + // - apply(Uint8Array) can fail on iOS 5.1 Safari + // + let STR_APPLY_UIA_OK = true; + + try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + + // Table with utf8 lengths (calculated by first byte of sequence) + // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, + // because max possible codepoint is 0x10ffff + const _utf8len = new Uint8Array(256); + for (let q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); + } + _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + + // convert string to array (typed, when possible) + var string2buf = (str) => { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + + let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; + }; + + // Helper + const buf2binstring = (buf, len) => { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + + let result = ''; + for (let i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; + }; + + + // convert array to string + var buf2string = (buf, max) => { + const len = max || buf.length; + + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + + let i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + const utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + let c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + let c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); + }; + + + // Calculate max possible position in utf8 buffer, + // that will not break sequence. If that's not possible + // - (very small limits) return max size as is. + // + // buf[] - utf8 bytes array + // max - length limit (mandatory); + var utf8border = (buf, max) => { + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + let pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; + }; + + var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; + } + + var zstream = ZStream; + + const toString$1 = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2, + Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2, + Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY, + Z_DEFLATED: Z_DEFLATED$1 + } = constants$2; + + /* ===========================================================================*/ + + + /** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + + /* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + + /** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + + /** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + + /** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ + function Deflate$1(options) { + this.options = common.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED$1, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + + let opt = this.options; + + if (opt.raw && (opt.windowBits > 0)) { + opt.windowBits = -opt.windowBits; + } + + else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) { + opt.windowBits += 16; + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = deflate_1$2.deflateInit2( + this.strm, + opt.level, + opt.method, + opt.windowBits, + opt.memLevel, + opt.strategy + ); + + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + + if (opt.header) { + deflate_1$2.deflateSetHeader(this.strm, opt.header); + } + + if (opt.dictionary) { + let dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + + status = deflate_1$2.deflateSetDictionary(this.strm, dict); + + if (status !== Z_OK$2) { + throw new Error(messages[status]); + } + + this._dict_set = true; + } + } + + /** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Deflate$1.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + let status, _flush_mode; + + if (this.ended) { return false; } + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString$1.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + status = deflate_1$2.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END$2) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = deflate_1$2.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK$2; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + if (strm.avail_in === 0) break; + } + + return true; + }; + + + /** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Deflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + + /** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Deflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK$2) { + this.result = common.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + + /** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ + function deflate$1(input, options) { + const deflator = new Deflate$1(options); + + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { throw deflator.msg || messages[deflator.err]; } + + return deflator.result; + } + + + /** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function deflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return deflate$1(input, options); + } + + + /** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ + function gzip$1(input, options) { + options = options || {}; + options.gzip = true; + return deflate$1(input, options); + } + + + var Deflate_1$1 = Deflate$1; + var deflate_2 = deflate$1; + var deflateRaw_1$1 = deflateRaw$1; + var gzip_1$1 = gzip$1; + var constants$1 = constants$2; + + var deflate_1$1 = { + Deflate: Deflate_1$1, + deflate: deflate_2, + deflateRaw: deflateRaw_1$1, + gzip: gzip_1$1, + constants: constants$1 + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // See state defs from inflate.js + const BAD$1 = 16209; /* got a data error -- remain here until reset */ + const TYPE$1 = 16191; /* i: waiting for type bits, including last-flag bit */ + + /* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ + var inffast = function inflate_fast(strm, start) { + let _in; /* local strm.input */ + let last; /* have enough input while in < last */ + let _out; /* local strm.output */ + let beg; /* inflate()'s initial strm.output */ + let end; /* while out < end, enough space available */ + //#ifdef INFLATE_STRICT + let dmax; /* maximum distance from zlib header */ + //#endif + let wsize; /* window size or zero if not using window */ + let whave; /* valid bytes in the window */ + let wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + let s_window; /* allocated sliding window, if wsize != 0 */ + let hold; /* local strm.hold */ + let bits; /* local strm.bits */ + let lcode; /* local strm.lencode */ + let dcode; /* local strm.distcode */ + let lmask; /* mask for first level of length codes */ + let dmask; /* mask for first level of distance codes */ + let here; /* retrieved table entry */ + let op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + let len; /* match length, unused bytes */ + let dist; /* match distance */ + let from; /* where to copy match from */ + let from_source; + + + let input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + const state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); + //#ifdef INFLATE_STRICT + dmax = state.dmax; + //#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: + do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + + here = lcode[hold & lmask]; + + dolen: + for (;;) { // Goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + if (op === 0) { /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff/*here.val*/; + } + else if (op & 16) { /* length base */ + len = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & ((1 << op) - 1); + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + + dodist: + for (;;) { // goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + + if (op & 16) { /* distance base */ + dist = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & ((1 << op) - 1); + //#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + //#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // if (len <= op - whave) { + // do { + // output[_out++] = 0; + // } while (--len); + // continue top; + // } + // len -= op - whave; + // do { + // output[_out++] = 0; + // } while (--op > whave); + // if (op === 0) { + // from = _out - dist; + // do { + // output[_out++] = output[from++]; + // } while (--len); + // continue top; + // } + //#endif + } + from = 0; // window index + from_source = s_window; + if (wnext === 0) { /* very common case */ + from += wsize - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + else if (wnext < op) { /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } + else { /* contiguous in window */ + from += wnext - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } + else { + from = _out - dist; /* copy direct from output */ + do { /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } + else if ((op & 64) === 0) { /* 2nd level distance code */ + here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dodist; + } + else { + strm.msg = 'invalid distance code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } + else if ((op & 64) === 0) { /* 2nd level length code */ + here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dolen; + } + else if (op & 32) { /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE$1; + break top; + } + else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); + strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); + state.hold = hold; + state.bits = bits; + return; + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const MAXBITS = 15; + const ENOUGH_LENS$1 = 852; + const ENOUGH_DISTS$1 = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + const CODES$1 = 0; + const LENS$1 = 1; + const DISTS$1 = 2; + + const lbase = new Uint16Array([ /* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 + ]); + + const lext = new Uint8Array([ /* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, + 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 + ]); + + const dbase = new Uint16Array([ /* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577, 0, 0 + ]); + + const dext = new Uint8Array([ /* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, + 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, + 28, 28, 29, 29, 64, 64 + ]); + + const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) => + { + const bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + let len = 0; /* a code's length in bits */ + let sym = 0; /* index of code symbols */ + let min = 0, max = 0; /* minimum and maximum code lengths */ + let root = 0; /* number of index bits for root table */ + let curr = 0; /* number of index bits for current table */ + let drop = 0; /* code bits to drop for sub-table */ + let left = 0; /* number of prefix codes available */ + let used = 0; /* code entries in table used */ + let huff = 0; /* Huffman code */ + let incr; /* for incrementing code, index */ + let fill; /* index for replicating entries */ + let low; /* low bits for current root entry */ + let mask; /* mask for low root bits */ + let next; /* next available space in table */ + let base = null; /* base value table to use */ + // let shoextra; /* extra bits table to use */ + let match; /* use base and extra for symbol >= match */ + const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + let extra = null; + + let here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { break; } + } + if (root > max) { + root = max; + } + if (max === 0) { /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + for (min = 1; min < max; min++) { + if (count[min] !== 0) { break; } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + if (left > 0 && (type === CODES$1 || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES$1) { + base = extra = work; /* dummy value--not used */ + match = 20; + + } else if (type === LENS$1) { + base = lbase; + extra = lext; + match = 257; + + } else { /* DISTS */ + base = dbase; + extra = dext; + match = 0; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] + 1 < match) { + here_op = 0; + here_val = work[sym]; + } + else if (work[sym] >= match) { + here_op = extra[work[sym] - match]; + here_val = base[work[sym] - match]; + } + else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << (len - drop); + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << (len - 1); + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { break; } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { break; } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; + }; + + + var inftrees = inflate_table; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + + + + + + const CODES = 0; + const LENS = 1; + const DISTS = 2; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES, + Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR, + Z_DEFLATED + } = constants$2; + + + /* STATES ====================================================================*/ + /* ===========================================================================*/ + + + const HEAD = 16180; /* i: waiting for magic header */ + const FLAGS = 16181; /* i: waiting for method and flags (gzip) */ + const TIME = 16182; /* i: waiting for modification time (gzip) */ + const OS = 16183; /* i: waiting for extra flags and operating system (gzip) */ + const EXLEN = 16184; /* i: waiting for extra length (gzip) */ + const EXTRA = 16185; /* i: waiting for extra bytes (gzip) */ + const NAME = 16186; /* i: waiting for end of file name (gzip) */ + const COMMENT = 16187; /* i: waiting for end of comment (gzip) */ + const HCRC = 16188; /* i: waiting for header crc (gzip) */ + const DICTID = 16189; /* i: waiting for dictionary check value */ + const DICT = 16190; /* waiting for inflateSetDictionary() call */ + const TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ + const TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */ + const STORED = 16193; /* i: waiting for stored size (length and complement) */ + const COPY_ = 16194; /* i/o: same as COPY below, but only first time in */ + const COPY = 16195; /* i/o: waiting for input or output to copy stored block */ + const TABLE = 16196; /* i: waiting for dynamic block table lengths */ + const LENLENS = 16197; /* i: waiting for code length code lengths */ + const CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */ + const LEN_ = 16199; /* i: same as LEN below, but only first time in */ + const LEN = 16200; /* i: waiting for length/lit/eob code */ + const LENEXT = 16201; /* i: waiting for length extra bits */ + const DIST = 16202; /* i: waiting for distance code */ + const DISTEXT = 16203; /* i: waiting for distance extra bits */ + const MATCH = 16204; /* o: waiting for output space to copy string */ + const LIT = 16205; /* o: waiting for output space to write literal */ + const CHECK = 16206; /* i: waiting for 32-bit check value */ + const LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */ + const DONE = 16208; /* finished check, done -- remain here until reset */ + const BAD = 16209; /* got a data error -- remain here until reset */ + const MEM = 16210; /* got an inflate() memory error -- remain here until reset */ + const SYNC = 16211; /* looking for synchronization bytes to restart inflate() */ + + /* ===========================================================================*/ + + + + const ENOUGH_LENS = 852; + const ENOUGH_DISTS = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + const MAX_WBITS = 15; + /* 32K LZ77 window */ + const DEF_WBITS = MAX_WBITS; + + + const zswap32 = (q) => { + + return (((q >>> 24) & 0xff) + + ((q >>> 8) & 0xff00) + + ((q & 0xff00) << 8) + + ((q & 0xff) << 24)); + }; + + + function InflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip, + bit 2 true to validate check value */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib), or + -1 if raw or no header yet */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ + } + + + const inflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const state = strm.state; + if (!state || state.strm !== strm || + state.mode < HEAD || state.mode > SYNC) { + return 1; + } + return 0; + }; + + + const inflateResetKeep = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.flags = -1; + state.dmax = 32768; + state.head = null/*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK$1; + }; + + + const inflateReset = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + + }; + + + const inflateReset2 = (strm, windowBits) => { + let wrap; + + /* get the state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } + else { + wrap = (windowBits >> 4) + 5; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR$1; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); + }; + + + const inflateInit2 = (strm, windowBits) => { + + if (!strm) { return Z_STREAM_ERROR$1; } + //strm.msg = Z_NULL; /* in case we return an error */ + + const state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.strm = strm; + state.window = null/*Z_NULL*/; + state.mode = HEAD; /* to pass state test in inflateReset2() */ + const ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK$1) { + strm.state = null/*Z_NULL*/; + } + return ret; + }; + + + const inflateInit = (strm) => { + + return inflateInit2(strm, DEF_WBITS); + }; + + + /* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ + let virgin = true; + + let lenfix, distfix; // We have no pointers in JS, so keep tables separate + + + const fixedtables = (state) => { + + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + let sym = 0; + while (sym < 144) { state.lens[sym++] = 8; } + while (sym < 256) { state.lens[sym++] = 9; } + while (sym < 280) { state.lens[sym++] = 7; } + while (sym < 288) { state.lens[sym++] = 8; } + + inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); + + /* distance table */ + sym = 0; + while (sym < 32) { state.lens[sym++] = 5; } + + inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); + + /* do this just once */ + virgin = false; + } + + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; + }; + + + /* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ + const updatewindow = (strm, src, end, copy) => { + + let dist; + const state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } + else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } + else { + state.wnext += dist; + if (state.wnext === state.wsize) { state.wnext = 0; } + if (state.whave < state.wsize) { state.whave += dist; } + } + } + return 0; + }; + + + const inflate$2 = (strm, flush) => { + + let state; + let input, output; // input/output buffers + let next; /* next input INDEX */ + let put; /* next output INDEX */ + let have, left; /* available input and output */ + let hold; /* bit buffer */ + let bits; /* bits in bit buffer */ + let _in, _out; /* save starting available input and output */ + let copy; /* number of stored or match bytes to copy */ + let from; /* where to copy match bytes from */ + let from_source; + let here = 0; /* current decoding table entry */ + let here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + let last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + let len; /* length to copy for repeats, bits to drop */ + let ret; /* return code */ + const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + let opts; + + let n; // temporary variable for NEED_BITS + + const order = /* permutation of code lengths */ + new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]); + + + if (inflateStateCheck(strm) || !strm.output || + (!strm.input && strm.avail_in !== 0)) { + return Z_STREAM_ERROR$1; + } + + state = strm.state; + if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ + + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK$1; + + inf_leave: // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ + if (state.wbits === 0) { + state.wbits = 15; + } + state.check = 0/*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f)/*BITS(4)*/ + 8; + if (state.wbits === 0) { + state.wbits = len; + } + if (len > 15 || len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + state.flags = 0; /* indicate zlib header */ + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = ((hold >> 8) & 1); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + hbuf[2] = (hold >>> 16) & 0xff; + hbuf[3] = (hold >>> 24) & 0xff; + state.check = crc32_1(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = (hold & 0xff); + state.head.os = (hold >> 8); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + else if (state.head) { + state.head.extra = null/*Z_NULL*/; + } + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { copy = have; } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set( + input.subarray( + next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy + ), + /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len + ); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { break inf_leave; } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.name_max*/)) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.comm_max*/)) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + if (state.head) { + state.head.hcrc = ((state.flags >> 9) & 1); + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT$1; + } + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = (hold & 0x01)/*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch ((hold & 0x03)/*BITS(2)*/) { + case 0: /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { copy = have; } + if (copy > left) { copy = left; } + if (copy === 0) { break inf_leave; } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + //#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } + //#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + + opts = { bits: state.lenbits }; + ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } + else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03);//BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } + else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f);//BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { break; } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + + opts = { bits: state.lenbits }; + ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { bits: state.distbits }; + ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inffast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if (here_bits <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = (here_op) & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + //#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { break inf_leave; } + copy = _out - left; + if (state.offset > copy) { /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // Trace((stderr, "inflate.c too far\n")); + // copy -= state.whave; + // if (copy > state.length) { copy = state.length; } + // if (copy > left) { copy = left; } + // left -= copy; + // state.length -= copy; + // do { + // output[put++] = 0; + // } while (--copy); + // if (state.length === 0) { state.mode = LEN; } + // break; + //#endif + } + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } + else { + from = state.wnext - copy; + } + if (copy > state.length) { copy = state.length; } + from_source = state.window; + } + else { /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { copy = left; } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { state.mode = LEN; } + break; + case LIT: + if (left === 0) { break inf_leave; } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = + /*UPDATE_CHECK(state.check, put - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out)); + + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END$1; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR$1; + break inf_leave; + case MEM: + return Z_MEM_ERROR$1; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR$1; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && + (state.mode < CHECK || flush !== Z_FINISH$1))) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ; + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out)); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + + (state.mode === TYPE ? 128 : 0) + + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) { + ret = Z_BUF_ERROR; + } + return ret; + }; + + + const inflateEnd = (strm) => { + + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + + let state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK$1; + }; + + + const inflateGetHeader = (strm, head) => { + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK$1; + }; + + + const inflateSetDictionary = (strm, dictionary) => { + const dictLength = dictionary.length; + + let state; + let dictid; + let ret; + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + state = strm.state; + + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR$1; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32_1(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR$1; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR$1; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK$1; + }; + + + var inflateReset_1 = inflateReset; + var inflateReset2_1 = inflateReset2; + var inflateResetKeep_1 = inflateResetKeep; + var inflateInit_1 = inflateInit; + var inflateInit2_1 = inflateInit2; + var inflate_2$1 = inflate$2; + var inflateEnd_1 = inflateEnd; + var inflateGetHeader_1 = inflateGetHeader; + var inflateSetDictionary_1 = inflateSetDictionary; + var inflateInfo = 'pako inflate (from Nodeca project)'; + + /* Not implemented + module.exports.inflateCodesUsed = inflateCodesUsed; + module.exports.inflateCopy = inflateCopy; + module.exports.inflateGetDictionary = inflateGetDictionary; + module.exports.inflateMark = inflateMark; + module.exports.inflatePrime = inflatePrime; + module.exports.inflateSync = inflateSync; + module.exports.inflateSyncPoint = inflateSyncPoint; + module.exports.inflateUndermine = inflateUndermine; + module.exports.inflateValidate = inflateValidate; + */ + + var inflate_1$2 = { + inflateReset: inflateReset_1, + inflateReset2: inflateReset2_1, + inflateResetKeep: inflateResetKeep_1, + inflateInit: inflateInit_1, + inflateInit2: inflateInit2_1, + inflate: inflate_2$1, + inflateEnd: inflateEnd_1, + inflateGetHeader: inflateGetHeader_1, + inflateSetDictionary: inflateSetDictionary_1, + inflateInfo: inflateInfo + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; + } + + var gzheader = GZheader; + + const toString = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_NO_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR + } = constants$2; + + /* ===========================================================================*/ + + + /** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + + /* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + + /** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + + /** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + + /** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ + function Inflate$1(options) { + this.options = common.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + + const opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { opt.windowBits = -15; } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if ((opt.windowBits >= 0) && (opt.windowBits < 16) && + !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if ((opt.windowBits > 15) && (opt.windowBits < 48)) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = inflate_1$2.inflateInit2( + this.strm, + opt.windowBits + ); + + if (status !== Z_OK) { + throw new Error(messages[status]); + } + + this.header = new gzheader(); + + inflate_1$2.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { //In raw mode we need to set the dictionary early + status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + } + } + } + + /** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Inflate$1.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + const dictionary = this.options.dictionary; + let status, _flush_mode, last_avail_out; + + if (this.ended) return false; + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + status = inflate_1$2.inflate(strm, _flush_mode); + + if (status === Z_NEED_DICT && dictionary) { + status = inflate_1$2.inflateSetDictionary(strm, dictionary); + + if (status === Z_OK) { + status = inflate_1$2.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && + status === Z_STREAM_END && + strm.state.wrap > 0 && + data[strm.next_in] !== 0) + { + inflate_1$2.inflateReset(strm); + status = inflate_1$2.inflate(strm, _flush_mode); + } + + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + + if (this.options.to === 'string') { + + let next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + + let tail = strm.next_out - next_out_utf8; + let utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + + this.onData(utf8str); + + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = inflate_1$2.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + + if (strm.avail_in === 0) break; + } + + return true; + }; + + + /** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Inflate$1.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + + /** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Inflate$1.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = common.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + + /** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ + function inflate$1(input, options) { + const inflator = new Inflate$1(options); + + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || messages[inflator.err]; + + return inflator.result; + } + + + /** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function inflateRaw$1(input, options) { + options = options || {}; + options.raw = true; + return inflate$1(input, options); + } + + + /** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + + var Inflate_1$1 = Inflate$1; + var inflate_2 = inflate$1; + var inflateRaw_1$1 = inflateRaw$1; + var ungzip$1 = inflate$1; + var constants = constants$2; + + var inflate_1$1 = { + Inflate: Inflate_1$1, + inflate: inflate_2, + inflateRaw: inflateRaw_1$1, + ungzip: ungzip$1, + constants: constants + }; + + const { Deflate, deflate, deflateRaw, gzip } = deflate_1$1; + + const { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1; + + + + var Deflate_1 = Deflate; + var deflate_1 = deflate; + var deflateRaw_1 = deflateRaw; + var gzip_1 = gzip; + var Inflate_1 = Inflate; + var inflate_1 = inflate; + var inflateRaw_1 = inflateRaw; + var ungzip_1 = ungzip; + var constants_1 = constants$2; + + var pako = { + Deflate: Deflate_1, + deflate: deflate_1, + deflateRaw: deflateRaw_1, + gzip: gzip_1, + Inflate: Inflate_1, + inflate: inflate_1, + inflateRaw: inflateRaw_1, + ungzip: ungzip_1, + constants: constants_1 + }; + + exports.Deflate = Deflate_1; + exports.Inflate = Inflate_1; + exports.constants = constants_1; + exports["default"] = pako; + exports.deflate = deflate_1; + exports.deflateRaw = deflateRaw_1; + exports.gzip = gzip_1; + exports.inflate = inflate_1; + exports.inflateRaw = inflateRaw_1; + exports.ungzip = ungzip_1; + + Object.defineProperty(exports, '__esModule', { value: true }); + +})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako.min.js b/测试流式传输uniapp/node_modules/pako/dist/pako.min.js new file mode 100644 index 0000000..2535eaf --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako.min.js @@ -0,0 +1,2 @@ +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self).pako={})}(this,(function(t){"use strict";function e(t){let e=t.length;for(;--e>=0;)t[e]=0}const a=256,i=286,n=30,s=15,r=new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]),o=new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]),l=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),h=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),d=new Array(576);e(d);const _=new Array(60);e(_);const f=new Array(512);e(f);const c=new Array(256);e(c);const u=new Array(29);e(u);const w=new Array(n);function m(t,e,a,i,n){this.static_tree=t,this.extra_bits=e,this.extra_base=a,this.elems=i,this.max_length=n,this.has_stree=t&&t.length}let b,g,p;function k(t,e){this.dyn_tree=t,this.max_code=0,this.stat_desc=e}e(w);const v=t=>t<256?f[t]:f[256+(t>>>7)],y=(t,e)=>{t.pending_buf[t.pending++]=255&e,t.pending_buf[t.pending++]=e>>>8&255},x=(t,e,a)=>{t.bi_valid>16-a?(t.bi_buf|=e<>16-t.bi_valid,t.bi_valid+=a-16):(t.bi_buf|=e<{x(t,a[2*e],a[2*e+1])},A=(t,e)=>{let a=0;do{a|=1&t,t>>>=1,a<<=1}while(--e>0);return a>>>1},E=(t,e,a)=>{const i=new Array(16);let n,r,o=0;for(n=1;n<=s;n++)o=o+a[n-1]<<1,i[n]=o;for(r=0;r<=e;r++){let e=t[2*r+1];0!==e&&(t[2*r]=A(i[e]++,e))}},R=t=>{let e;for(e=0;e{t.bi_valid>8?y(t,t.bi_buf):t.bi_valid>0&&(t.pending_buf[t.pending++]=t.bi_buf),t.bi_buf=0,t.bi_valid=0},U=(t,e,a,i)=>{const n=2*e,s=2*a;return t[n]{const i=t.heap[a];let n=a<<1;for(;n<=t.heap_len&&(n{let n,s,l,h,d=0;if(0!==t.sym_next)do{n=255&t.pending_buf[t.sym_buf+d++],n+=(255&t.pending_buf[t.sym_buf+d++])<<8,s=t.pending_buf[t.sym_buf+d++],0===n?z(t,s,e):(l=c[s],z(t,l+a+1,e),h=r[l],0!==h&&(s-=u[l],x(t,s,h)),n--,l=v(n),z(t,l,i),h=o[l],0!==h&&(n-=w[l],x(t,n,h)))}while(d{const a=e.dyn_tree,i=e.stat_desc.static_tree,n=e.stat_desc.has_stree,r=e.stat_desc.elems;let o,l,h,d=-1;for(t.heap_len=0,t.heap_max=573,o=0;o>1;o>=1;o--)S(t,a,o);h=r;do{o=t.heap[1],t.heap[1]=t.heap[t.heap_len--],S(t,a,1),l=t.heap[1],t.heap[--t.heap_max]=o,t.heap[--t.heap_max]=l,a[2*h]=a[2*o]+a[2*l],t.depth[h]=(t.depth[o]>=t.depth[l]?t.depth[o]:t.depth[l])+1,a[2*o+1]=a[2*l+1]=h,t.heap[1]=h++,S(t,a,1)}while(t.heap_len>=2);t.heap[--t.heap_max]=t.heap[1],((t,e)=>{const a=e.dyn_tree,i=e.max_code,n=e.stat_desc.static_tree,r=e.stat_desc.has_stree,o=e.stat_desc.extra_bits,l=e.stat_desc.extra_base,h=e.stat_desc.max_length;let d,_,f,c,u,w,m=0;for(c=0;c<=s;c++)t.bl_count[c]=0;for(a[2*t.heap[t.heap_max]+1]=0,d=t.heap_max+1;d<573;d++)_=t.heap[d],c=a[2*a[2*_+1]+1]+1,c>h&&(c=h,m++),a[2*_+1]=c,_>i||(t.bl_count[c]++,u=0,_>=l&&(u=o[_-l]),w=a[2*_],t.opt_len+=w*(c+u),r&&(t.static_len+=w*(n[2*_+1]+u)));if(0!==m){do{for(c=h-1;0===t.bl_count[c];)c--;t.bl_count[c]--,t.bl_count[c+1]+=2,t.bl_count[h]--,m-=2}while(m>0);for(c=h;0!==c;c--)for(_=t.bl_count[c];0!==_;)f=t.heap[--d],f>i||(a[2*f+1]!==c&&(t.opt_len+=(c-a[2*f+1])*a[2*f],a[2*f+1]=c),_--)}})(t,e),E(a,d,t.bl_count)},O=(t,e,a)=>{let i,n,s=-1,r=e[1],o=0,l=7,h=4;for(0===r&&(l=138,h=3),e[2*(a+1)+1]=65535,i=0;i<=a;i++)n=r,r=e[2*(i+1)+1],++o{let i,n,s=-1,r=e[1],o=0,l=7,h=4;for(0===r&&(l=138,h=3),i=0;i<=a;i++)if(n=r,r=e[2*(i+1)+1],!(++o{x(t,0+(i?1:0),3),Z(t),y(t,a),y(t,~a),a&&t.pending_buf.set(t.window.subarray(e,e+a),t.pending),t.pending+=a};var N=(t,e,i,n)=>{let s,r,o=0;t.level>0?(2===t.strm.data_type&&(t.strm.data_type=(t=>{let e,i=4093624447;for(e=0;e<=31;e++,i>>>=1)if(1&i&&0!==t.dyn_ltree[2*e])return 0;if(0!==t.dyn_ltree[18]||0!==t.dyn_ltree[20]||0!==t.dyn_ltree[26])return 1;for(e=32;e{let e;for(O(t,t.dyn_ltree,t.l_desc.max_code),O(t,t.dyn_dtree,t.d_desc.max_code),T(t,t.bl_desc),e=18;e>=3&&0===t.bl_tree[2*h[e]+1];e--);return t.opt_len+=3*(e+1)+5+5+4,e})(t),s=t.opt_len+3+7>>>3,r=t.static_len+3+7>>>3,r<=s&&(s=r)):s=r=i+5,i+4<=s&&-1!==e?L(t,e,i,n):4===t.strategy||r===s?(x(t,2+(n?1:0),3),D(t,d,_)):(x(t,4+(n?1:0),3),((t,e,a,i)=>{let n;for(x(t,e-257,5),x(t,a-1,5),x(t,i-4,4),n=0;n{F||((()=>{let t,e,a,h,k;const v=new Array(16);for(a=0,h=0;h<28;h++)for(u[h]=a,t=0;t<1<>=7;h(t.pending_buf[t.sym_buf+t.sym_next++]=e,t.pending_buf[t.sym_buf+t.sym_next++]=e>>8,t.pending_buf[t.sym_buf+t.sym_next++]=i,0===e?t.dyn_ltree[2*i]++:(t.matches++,e--,t.dyn_ltree[2*(c[i]+a+1)]++,t.dyn_dtree[2*v(e)]++),t.sym_next===t.sym_end),_tr_align:t=>{x(t,2,3),z(t,256,d),(t=>{16===t.bi_valid?(y(t,t.bi_buf),t.bi_buf=0,t.bi_valid=0):t.bi_valid>=8&&(t.pending_buf[t.pending++]=255&t.bi_buf,t.bi_buf>>=8,t.bi_valid-=8)})(t)}};var C=(t,e,a,i)=>{let n=65535&t|0,s=t>>>16&65535|0,r=0;for(;0!==a;){r=a>2e3?2e3:a,a-=r;do{n=n+e[i++]|0,s=s+n|0}while(--r);n%=65521,s%=65521}return n|s<<16|0};const M=new Uint32Array((()=>{let t,e=[];for(var a=0;a<256;a++){t=a;for(var i=0;i<8;i++)t=1&t?3988292384^t>>>1:t>>>1;e[a]=t}return e})());var H=(t,e,a,i)=>{const n=M,s=i+a;t^=-1;for(let a=i;a>>8^n[255&(t^e[a])];return-1^t},j={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},K={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8};const{_tr_init:P,_tr_stored_block:Y,_tr_flush_block:G,_tr_tally:X,_tr_align:W}=B,{Z_NO_FLUSH:q,Z_PARTIAL_FLUSH:J,Z_FULL_FLUSH:Q,Z_FINISH:V,Z_BLOCK:$,Z_OK:tt,Z_STREAM_END:et,Z_STREAM_ERROR:at,Z_DATA_ERROR:it,Z_BUF_ERROR:nt,Z_DEFAULT_COMPRESSION:st,Z_FILTERED:rt,Z_HUFFMAN_ONLY:ot,Z_RLE:lt,Z_FIXED:ht,Z_DEFAULT_STRATEGY:dt,Z_UNKNOWN:_t,Z_DEFLATED:ft}=K,ct=258,ut=262,wt=42,mt=113,bt=666,gt=(t,e)=>(t.msg=j[e],e),pt=t=>2*t-(t>4?9:0),kt=t=>{let e=t.length;for(;--e>=0;)t[e]=0},vt=t=>{let e,a,i,n=t.w_size;e=t.hash_size,i=e;do{a=t.head[--i],t.head[i]=a>=n?a-n:0}while(--e);e=n,i=e;do{a=t.prev[--i],t.prev[i]=a>=n?a-n:0}while(--e)};let yt=(t,e,a)=>(e<{const e=t.state;let a=e.pending;a>t.avail_out&&(a=t.avail_out),0!==a&&(t.output.set(e.pending_buf.subarray(e.pending_out,e.pending_out+a),t.next_out),t.next_out+=a,e.pending_out+=a,t.total_out+=a,t.avail_out-=a,e.pending-=a,0===e.pending&&(e.pending_out=0))},zt=(t,e)=>{G(t,t.block_start>=0?t.block_start:-1,t.strstart-t.block_start,e),t.block_start=t.strstart,xt(t.strm)},At=(t,e)=>{t.pending_buf[t.pending++]=e},Et=(t,e)=>{t.pending_buf[t.pending++]=e>>>8&255,t.pending_buf[t.pending++]=255&e},Rt=(t,e,a,i)=>{let n=t.avail_in;return n>i&&(n=i),0===n?0:(t.avail_in-=n,e.set(t.input.subarray(t.next_in,t.next_in+n),a),1===t.state.wrap?t.adler=C(t.adler,e,n,a):2===t.state.wrap&&(t.adler=H(t.adler,e,n,a)),t.next_in+=n,t.total_in+=n,n)},Zt=(t,e)=>{let a,i,n=t.max_chain_length,s=t.strstart,r=t.prev_length,o=t.nice_match;const l=t.strstart>t.w_size-ut?t.strstart-(t.w_size-ut):0,h=t.window,d=t.w_mask,_=t.prev,f=t.strstart+ct;let c=h[s+r-1],u=h[s+r];t.prev_length>=t.good_match&&(n>>=2),o>t.lookahead&&(o=t.lookahead);do{if(a=e,h[a+r]===u&&h[a+r-1]===c&&h[a]===h[s]&&h[++a]===h[s+1]){s+=2,a++;do{}while(h[++s]===h[++a]&&h[++s]===h[++a]&&h[++s]===h[++a]&&h[++s]===h[++a]&&h[++s]===h[++a]&&h[++s]===h[++a]&&h[++s]===h[++a]&&h[++s]===h[++a]&&sr){if(t.match_start=e,r=i,i>=o)break;c=h[s+r-1],u=h[s+r]}}}while((e=_[e&d])>l&&0!=--n);return r<=t.lookahead?r:t.lookahead},Ut=t=>{const e=t.w_size;let a,i,n;do{if(i=t.window_size-t.lookahead-t.strstart,t.strstart>=e+(e-ut)&&(t.window.set(t.window.subarray(e,e+e-i),0),t.match_start-=e,t.strstart-=e,t.block_start-=e,t.insert>t.strstart&&(t.insert=t.strstart),vt(t),i+=e),0===t.strm.avail_in)break;if(a=Rt(t.strm,t.window,t.strstart+t.lookahead,i),t.lookahead+=a,t.lookahead+t.insert>=3)for(n=t.strstart-t.insert,t.ins_h=t.window[n],t.ins_h=yt(t,t.ins_h,t.window[n+1]);t.insert&&(t.ins_h=yt(t,t.ins_h,t.window[n+3-1]),t.prev[n&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=n,n++,t.insert--,!(t.lookahead+t.insert<3)););}while(t.lookahead{let a,i,n,s=t.pending_buf_size-5>t.w_size?t.w_size:t.pending_buf_size-5,r=0,o=t.strm.avail_in;do{if(a=65535,n=t.bi_valid+42>>3,t.strm.avail_outi+t.strm.avail_in&&(a=i+t.strm.avail_in),a>n&&(a=n),a>8,t.pending_buf[t.pending-2]=~a,t.pending_buf[t.pending-1]=~a>>8,xt(t.strm),i&&(i>a&&(i=a),t.strm.output.set(t.window.subarray(t.block_start,t.block_start+i),t.strm.next_out),t.strm.next_out+=i,t.strm.avail_out-=i,t.strm.total_out+=i,t.block_start+=i,a-=i),a&&(Rt(t.strm,t.strm.output,t.strm.next_out,a),t.strm.next_out+=a,t.strm.avail_out-=a,t.strm.total_out+=a)}while(0===r);return o-=t.strm.avail_in,o&&(o>=t.w_size?(t.matches=2,t.window.set(t.strm.input.subarray(t.strm.next_in-t.w_size,t.strm.next_in),0),t.strstart=t.w_size,t.insert=t.strstart):(t.window_size-t.strstart<=o&&(t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,t.insert>t.strstart&&(t.insert=t.strstart)),t.window.set(t.strm.input.subarray(t.strm.next_in-o,t.strm.next_in),t.strstart),t.strstart+=o,t.insert+=o>t.w_size-t.insert?t.w_size-t.insert:o),t.block_start=t.strstart),t.high_watern&&t.block_start>=t.w_size&&(t.block_start-=t.w_size,t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,n+=t.w_size,t.insert>t.strstart&&(t.insert=t.strstart)),n>t.strm.avail_in&&(n=t.strm.avail_in),n&&(Rt(t.strm,t.window,t.strstart,n),t.strstart+=n,t.insert+=n>t.w_size-t.insert?t.w_size-t.insert:n),t.high_water>3,n=t.pending_buf_size-n>65535?65535:t.pending_buf_size-n,s=n>t.w_size?t.w_size:n,i=t.strstart-t.block_start,(i>=s||(i||e===V)&&e!==q&&0===t.strm.avail_in&&i<=n)&&(a=i>n?n:i,r=e===V&&0===t.strm.avail_in&&a===i?1:0,Y(t,t.block_start,a,r),t.block_start+=a,xt(t.strm)),r?3:1)},Dt=(t,e)=>{let a,i;for(;;){if(t.lookahead=3&&(t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),0!==a&&t.strstart-a<=t.w_size-ut&&(t.match_length=Zt(t,a)),t.match_length>=3)if(i=X(t,t.strstart-t.match_start,t.match_length-3),t.lookahead-=t.match_length,t.match_length<=t.max_lazy_match&&t.lookahead>=3){t.match_length--;do{t.strstart++,t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart}while(0!=--t.match_length);t.strstart++}else t.strstart+=t.match_length,t.match_length=0,t.ins_h=t.window[t.strstart],t.ins_h=yt(t,t.ins_h,t.window[t.strstart+1]);else i=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++;if(i&&(zt(t,!1),0===t.strm.avail_out))return 1}return t.insert=t.strstart<2?t.strstart:2,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2},Tt=(t,e)=>{let a,i,n;for(;;){if(t.lookahead=3&&(t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),t.prev_length=t.match_length,t.prev_match=t.match_start,t.match_length=2,0!==a&&t.prev_length4096)&&(t.match_length=2)),t.prev_length>=3&&t.match_length<=t.prev_length){n=t.strstart+t.lookahead-3,i=X(t,t.strstart-1-t.prev_match,t.prev_length-3),t.lookahead-=t.prev_length-1,t.prev_length-=2;do{++t.strstart<=n&&(t.ins_h=yt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart)}while(0!=--t.prev_length);if(t.match_available=0,t.match_length=2,t.strstart++,i&&(zt(t,!1),0===t.strm.avail_out))return 1}else if(t.match_available){if(i=X(t,0,t.window[t.strstart-1]),i&&zt(t,!1),t.strstart++,t.lookahead--,0===t.strm.avail_out)return 1}else t.match_available=1,t.strstart++,t.lookahead--}return t.match_available&&(i=X(t,0,t.window[t.strstart-1]),t.match_available=0),t.insert=t.strstart<2?t.strstart:2,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2};function Ot(t,e,a,i,n){this.good_length=t,this.max_lazy=e,this.nice_length=a,this.max_chain=i,this.func=n}const It=[new Ot(0,0,0,0,St),new Ot(4,4,8,4,Dt),new Ot(4,5,16,8,Dt),new Ot(4,6,32,32,Dt),new Ot(4,4,16,16,Tt),new Ot(8,16,32,32,Tt),new Ot(8,16,128,128,Tt),new Ot(8,32,128,256,Tt),new Ot(32,128,258,1024,Tt),new Ot(32,258,258,4096,Tt)];function Ft(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=ft,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(1146),this.dyn_dtree=new Uint16Array(122),this.bl_tree=new Uint16Array(78),kt(this.dyn_ltree),kt(this.dyn_dtree),kt(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(16),this.heap=new Uint16Array(573),kt(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(573),kt(this.depth),this.sym_buf=0,this.lit_bufsize=0,this.sym_next=0,this.sym_end=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}const Lt=t=>{if(!t)return 1;const e=t.state;return!e||e.strm!==t||e.status!==wt&&57!==e.status&&69!==e.status&&73!==e.status&&91!==e.status&&103!==e.status&&e.status!==mt&&e.status!==bt?1:0},Nt=t=>{if(Lt(t))return gt(t,at);t.total_in=t.total_out=0,t.data_type=_t;const e=t.state;return e.pending=0,e.pending_out=0,e.wrap<0&&(e.wrap=-e.wrap),e.status=2===e.wrap?57:e.wrap?wt:mt,t.adler=2===e.wrap?0:1,e.last_flush=-2,P(e),tt},Bt=t=>{const e=Nt(t);var a;return e===tt&&((a=t.state).window_size=2*a.w_size,kt(a.head),a.max_lazy_match=It[a.level].max_lazy,a.good_match=It[a.level].good_length,a.nice_match=It[a.level].nice_length,a.max_chain_length=It[a.level].max_chain,a.strstart=0,a.block_start=0,a.lookahead=0,a.insert=0,a.match_length=a.prev_length=2,a.match_available=0,a.ins_h=0),e},Ct=(t,e,a,i,n,s)=>{if(!t)return at;let r=1;if(e===st&&(e=6),i<0?(r=0,i=-i):i>15&&(r=2,i-=16),n<1||n>9||a!==ft||i<8||i>15||e<0||e>9||s<0||s>ht||8===i&&1!==r)return gt(t,at);8===i&&(i=9);const o=new Ft;return t.state=o,o.strm=t,o.status=wt,o.wrap=r,o.gzhead=null,o.w_bits=i,o.w_size=1<Ct(t,e,ft,15,8,dt),deflateInit2:Ct,deflateReset:Bt,deflateResetKeep:Nt,deflateSetHeader:(t,e)=>Lt(t)||2!==t.state.wrap?at:(t.state.gzhead=e,tt),deflate:(t,e)=>{if(Lt(t)||e>$||e<0)return t?gt(t,at):at;const a=t.state;if(!t.output||0!==t.avail_in&&!t.input||a.status===bt&&e!==V)return gt(t,0===t.avail_out?nt:at);const i=a.last_flush;if(a.last_flush=e,0!==a.pending){if(xt(t),0===t.avail_out)return a.last_flush=-1,tt}else if(0===t.avail_in&&pt(e)<=pt(i)&&e!==V)return gt(t,nt);if(a.status===bt&&0!==t.avail_in)return gt(t,nt);if(a.status===wt&&0===a.wrap&&(a.status=mt),a.status===wt){let e=ft+(a.w_bits-8<<4)<<8,i=-1;if(i=a.strategy>=ot||a.level<2?0:a.level<6?1:6===a.level?2:3,e|=i<<6,0!==a.strstart&&(e|=32),e+=31-e%31,Et(a,e),0!==a.strstart&&(Et(a,t.adler>>>16),Et(a,65535&t.adler)),t.adler=1,a.status=mt,xt(t),0!==a.pending)return a.last_flush=-1,tt}if(57===a.status)if(t.adler=0,At(a,31),At(a,139),At(a,8),a.gzhead)At(a,(a.gzhead.text?1:0)+(a.gzhead.hcrc?2:0)+(a.gzhead.extra?4:0)+(a.gzhead.name?8:0)+(a.gzhead.comment?16:0)),At(a,255&a.gzhead.time),At(a,a.gzhead.time>>8&255),At(a,a.gzhead.time>>16&255),At(a,a.gzhead.time>>24&255),At(a,9===a.level?2:a.strategy>=ot||a.level<2?4:0),At(a,255&a.gzhead.os),a.gzhead.extra&&a.gzhead.extra.length&&(At(a,255&a.gzhead.extra.length),At(a,a.gzhead.extra.length>>8&255)),a.gzhead.hcrc&&(t.adler=H(t.adler,a.pending_buf,a.pending,0)),a.gzindex=0,a.status=69;else if(At(a,0),At(a,0),At(a,0),At(a,0),At(a,0),At(a,9===a.level?2:a.strategy>=ot||a.level<2?4:0),At(a,3),a.status=mt,xt(t),0!==a.pending)return a.last_flush=-1,tt;if(69===a.status){if(a.gzhead.extra){let e=a.pending,i=(65535&a.gzhead.extra.length)-a.gzindex;for(;a.pending+i>a.pending_buf_size;){let n=a.pending_buf_size-a.pending;if(a.pending_buf.set(a.gzhead.extra.subarray(a.gzindex,a.gzindex+n),a.pending),a.pending=a.pending_buf_size,a.gzhead.hcrc&&a.pending>e&&(t.adler=H(t.adler,a.pending_buf,a.pending-e,e)),a.gzindex+=n,xt(t),0!==a.pending)return a.last_flush=-1,tt;e=0,i-=n}let n=new Uint8Array(a.gzhead.extra);a.pending_buf.set(n.subarray(a.gzindex,a.gzindex+i),a.pending),a.pending+=i,a.gzhead.hcrc&&a.pending>e&&(t.adler=H(t.adler,a.pending_buf,a.pending-e,e)),a.gzindex=0}a.status=73}if(73===a.status){if(a.gzhead.name){let e,i=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>i&&(t.adler=H(t.adler,a.pending_buf,a.pending-i,i)),xt(t),0!==a.pending)return a.last_flush=-1,tt;i=0}e=a.gzindexi&&(t.adler=H(t.adler,a.pending_buf,a.pending-i,i)),a.gzindex=0}a.status=91}if(91===a.status){if(a.gzhead.comment){let e,i=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>i&&(t.adler=H(t.adler,a.pending_buf,a.pending-i,i)),xt(t),0!==a.pending)return a.last_flush=-1,tt;i=0}e=a.gzindexi&&(t.adler=H(t.adler,a.pending_buf,a.pending-i,i))}a.status=103}if(103===a.status){if(a.gzhead.hcrc){if(a.pending+2>a.pending_buf_size&&(xt(t),0!==a.pending))return a.last_flush=-1,tt;At(a,255&t.adler),At(a,t.adler>>8&255),t.adler=0}if(a.status=mt,xt(t),0!==a.pending)return a.last_flush=-1,tt}if(0!==t.avail_in||0!==a.lookahead||e!==q&&a.status!==bt){let i=0===a.level?St(a,e):a.strategy===ot?((t,e)=>{let a;for(;;){if(0===t.lookahead&&(Ut(t),0===t.lookahead)){if(e===q)return 1;break}if(t.match_length=0,a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++,a&&(zt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2})(a,e):a.strategy===lt?((t,e)=>{let a,i,n,s;const r=t.window;for(;;){if(t.lookahead<=ct){if(Ut(t),t.lookahead<=ct&&e===q)return 1;if(0===t.lookahead)break}if(t.match_length=0,t.lookahead>=3&&t.strstart>0&&(n=t.strstart-1,i=r[n],i===r[++n]&&i===r[++n]&&i===r[++n])){s=t.strstart+ct;do{}while(i===r[++n]&&i===r[++n]&&i===r[++n]&&i===r[++n]&&i===r[++n]&&i===r[++n]&&i===r[++n]&&i===r[++n]&&nt.lookahead&&(t.match_length=t.lookahead)}if(t.match_length>=3?(a=X(t,1,t.match_length-3),t.lookahead-=t.match_length,t.strstart+=t.match_length,t.match_length=0):(a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++),a&&(zt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(zt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(zt(t,!1),0===t.strm.avail_out)?1:2})(a,e):It[a.level].func(a,e);if(3!==i&&4!==i||(a.status=bt),1===i||3===i)return 0===t.avail_out&&(a.last_flush=-1),tt;if(2===i&&(e===J?W(a):e!==$&&(Y(a,0,0,!1),e===Q&&(kt(a.head),0===a.lookahead&&(a.strstart=0,a.block_start=0,a.insert=0))),xt(t),0===t.avail_out))return a.last_flush=-1,tt}return e!==V?tt:a.wrap<=0?et:(2===a.wrap?(At(a,255&t.adler),At(a,t.adler>>8&255),At(a,t.adler>>16&255),At(a,t.adler>>24&255),At(a,255&t.total_in),At(a,t.total_in>>8&255),At(a,t.total_in>>16&255),At(a,t.total_in>>24&255)):(Et(a,t.adler>>>16),Et(a,65535&t.adler)),xt(t),a.wrap>0&&(a.wrap=-a.wrap),0!==a.pending?tt:et)},deflateEnd:t=>{if(Lt(t))return at;const e=t.state.status;return t.state=null,e===mt?gt(t,it):tt},deflateSetDictionary:(t,e)=>{let a=e.length;if(Lt(t))return at;const i=t.state,n=i.wrap;if(2===n||1===n&&i.status!==wt||i.lookahead)return at;if(1===n&&(t.adler=C(t.adler,e,a,0)),i.wrap=0,a>=i.w_size){0===n&&(kt(i.head),i.strstart=0,i.block_start=0,i.insert=0);let t=new Uint8Array(i.w_size);t.set(e.subarray(a-i.w_size,a),0),e=t,a=i.w_size}const s=t.avail_in,r=t.next_in,o=t.input;for(t.avail_in=a,t.next_in=0,t.input=e,Ut(i);i.lookahead>=3;){let t=i.strstart,e=i.lookahead-2;do{i.ins_h=yt(i,i.ins_h,i.window[t+3-1]),i.prev[t&i.w_mask]=i.head[i.ins_h],i.head[i.ins_h]=t,t++}while(--e);i.strstart=t,i.lookahead=2,Ut(i)}return i.strstart+=i.lookahead,i.block_start=i.strstart,i.insert=i.lookahead,i.lookahead=0,i.match_length=i.prev_length=2,i.match_available=0,t.next_in=r,t.input=o,t.avail_in=s,i.wrap=n,tt},deflateInfo:"pako deflate (from Nodeca project)"};const Ht=(t,e)=>Object.prototype.hasOwnProperty.call(t,e);var jt=function(t){const e=Array.prototype.slice.call(arguments,1);for(;e.length;){const a=e.shift();if(a){if("object"!=typeof a)throw new TypeError(a+"must be non-object");for(const e in a)Ht(a,e)&&(t[e]=a[e])}}return t},Kt=t=>{let e=0;for(let a=0,i=t.length;a=252?6:t>=248?5:t>=240?4:t>=224?3:t>=192?2:1;Yt[254]=Yt[254]=1;var Gt=t=>{if("function"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(t);let e,a,i,n,s,r=t.length,o=0;for(n=0;n>>6,e[s++]=128|63&a):a<65536?(e[s++]=224|a>>>12,e[s++]=128|a>>>6&63,e[s++]=128|63&a):(e[s++]=240|a>>>18,e[s++]=128|a>>>12&63,e[s++]=128|a>>>6&63,e[s++]=128|63&a);return e},Xt=(t,e)=>{const a=e||t.length;if("function"==typeof TextDecoder&&TextDecoder.prototype.decode)return(new TextDecoder).decode(t.subarray(0,e));let i,n;const s=new Array(2*a);for(n=0,i=0;i4)s[n++]=65533,i+=r-1;else{for(e&=2===r?31:3===r?15:7;r>1&&i1?s[n++]=65533:e<65536?s[n++]=e:(e-=65536,s[n++]=55296|e>>10&1023,s[n++]=56320|1023&e)}}return((t,e)=>{if(e<65534&&t.subarray&&Pt)return String.fromCharCode.apply(null,t.length===e?t:t.subarray(0,e));let a="";for(let i=0;i{(e=e||t.length)>t.length&&(e=t.length);let a=e-1;for(;a>=0&&128==(192&t[a]);)a--;return a<0||0===a?e:a+Yt[t[a]]>e?a:e};var qt=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0};const Jt=Object.prototype.toString,{Z_NO_FLUSH:Qt,Z_SYNC_FLUSH:Vt,Z_FULL_FLUSH:$t,Z_FINISH:te,Z_OK:ee,Z_STREAM_END:ae,Z_DEFAULT_COMPRESSION:ie,Z_DEFAULT_STRATEGY:ne,Z_DEFLATED:se}=K;function re(t){this.options=jt({level:ie,method:se,chunkSize:16384,windowBits:15,memLevel:8,strategy:ne},t||{});let e=this.options;e.raw&&e.windowBits>0?e.windowBits=-e.windowBits:e.gzip&&e.windowBits>0&&e.windowBits<16&&(e.windowBits+=16),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new qt,this.strm.avail_out=0;let a=Mt.deflateInit2(this.strm,e.level,e.method,e.windowBits,e.memLevel,e.strategy);if(a!==ee)throw new Error(j[a]);if(e.header&&Mt.deflateSetHeader(this.strm,e.header),e.dictionary){let t;if(t="string"==typeof e.dictionary?Gt(e.dictionary):"[object ArrayBuffer]"===Jt.call(e.dictionary)?new Uint8Array(e.dictionary):e.dictionary,a=Mt.deflateSetDictionary(this.strm,t),a!==ee)throw new Error(j[a]);this._dict_set=!0}}function oe(t,e){const a=new re(e);if(a.push(t,!0),a.err)throw a.msg||j[a.err];return a.result}re.prototype.push=function(t,e){const a=this.strm,i=this.options.chunkSize;let n,s;if(this.ended)return!1;for(s=e===~~e?e:!0===e?te:Qt,"string"==typeof t?a.input=Gt(t):"[object ArrayBuffer]"===Jt.call(t)?a.input=new Uint8Array(t):a.input=t,a.next_in=0,a.avail_in=a.input.length;;)if(0===a.avail_out&&(a.output=new Uint8Array(i),a.next_out=0,a.avail_out=i),(s===Vt||s===$t)&&a.avail_out<=6)this.onData(a.output.subarray(0,a.next_out)),a.avail_out=0;else{if(n=Mt.deflate(a,s),n===ae)return a.next_out>0&&this.onData(a.output.subarray(0,a.next_out)),n=Mt.deflateEnd(this.strm),this.onEnd(n),this.ended=!0,n===ee;if(0!==a.avail_out){if(s>0&&a.next_out>0)this.onData(a.output.subarray(0,a.next_out)),a.avail_out=0;else if(0===a.avail_in)break}else this.onData(a.output)}return!0},re.prototype.onData=function(t){this.chunks.push(t)},re.prototype.onEnd=function(t){t===ee&&(this.result=Kt(this.chunks)),this.chunks=[],this.err=t,this.msg=this.strm.msg};var le={Deflate:re,deflate:oe,deflateRaw:function(t,e){return(e=e||{}).raw=!0,oe(t,e)},gzip:function(t,e){return(e=e||{}).gzip=!0,oe(t,e)},constants:K};const he=16209;var de=function(t,e){let a,i,n,s,r,o,l,h,d,_,f,c,u,w,m,b,g,p,k,v,y,x,z,A;const E=t.state;a=t.next_in,z=t.input,i=a+(t.avail_in-5),n=t.next_out,A=t.output,s=n-(e-t.avail_out),r=n+(t.avail_out-257),o=E.dmax,l=E.wsize,h=E.whave,d=E.wnext,_=E.window,f=E.hold,c=E.bits,u=E.lencode,w=E.distcode,m=(1<>>24,f>>>=p,c-=p,p=g>>>16&255,0===p)A[n++]=65535&g;else{if(!(16&p)){if(0==(64&p)){g=u[(65535&g)+(f&(1<>>=p,c-=p),c<15&&(f+=z[a++]<>>24,f>>>=p,c-=p,p=g>>>16&255,!(16&p)){if(0==(64&p)){g=w[(65535&g)+(f&(1<o){t.msg="invalid distance too far back",E.mode=he;break t}if(f>>>=p,c-=p,p=n-s,v>p){if(p=v-p,p>h&&E.sane){t.msg="invalid distance too far back",E.mode=he;break t}if(y=0,x=_,0===d){if(y+=l-p,p2;)A[n++]=x[y++],A[n++]=x[y++],A[n++]=x[y++],k-=3;k&&(A[n++]=x[y++],k>1&&(A[n++]=x[y++]))}else{y=n-v;do{A[n++]=A[y++],A[n++]=A[y++],A[n++]=A[y++],k-=3}while(k>2);k&&(A[n++]=A[y++],k>1&&(A[n++]=A[y++]))}break}}break}}while(a>3,a-=k,c-=k<<3,f&=(1<{const l=o.bits;let h,d,_,f,c,u,w=0,m=0,b=0,g=0,p=0,k=0,v=0,y=0,x=0,z=0,A=null;const E=new Uint16Array(16),R=new Uint16Array(16);let Z,U,S,D=null;for(w=0;w<=_e;w++)E[w]=0;for(m=0;m=1&&0===E[g];g--);if(p>g&&(p=g),0===g)return n[s++]=20971520,n[s++]=20971520,o.bits=1,0;for(b=1;b0&&(0===t||1!==g))return-1;for(R[1]=0,w=1;w<_e;w++)R[w+1]=R[w]+E[w];for(m=0;m852||2===t&&x>592)return 1;for(;;){Z=w-v,r[m]+1=u?(U=D[r[m]-u],S=A[r[m]-u]):(U=96,S=0),h=1<>v)+d]=Z<<24|U<<16|S|0}while(0!==d);for(h=1<>=1;if(0!==h?(z&=h-1,z+=h):z=0,m++,0==--E[w]){if(w===g)break;w=e[a+r[m]]}if(w>p&&(z&f)!==_){for(0===v&&(v=p),c+=b,k=w-v,y=1<852||2===t&&x>592)return 1;_=z&f,n[_]=p<<24|k<<16|c-s|0}}return 0!==z&&(n[c+z]=w-v<<24|64<<16|0),o.bits=p,0};const{Z_FINISH:be,Z_BLOCK:ge,Z_TREES:pe,Z_OK:ke,Z_STREAM_END:ve,Z_NEED_DICT:ye,Z_STREAM_ERROR:xe,Z_DATA_ERROR:ze,Z_MEM_ERROR:Ae,Z_BUF_ERROR:Ee,Z_DEFLATED:Re}=K,Ze=16180,Ue=16190,Se=16191,De=16192,Te=16194,Oe=16199,Ie=16200,Fe=16206,Le=16209,Ne=t=>(t>>>24&255)+(t>>>8&65280)+((65280&t)<<8)+((255&t)<<24);function Be(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}const Ce=t=>{if(!t)return 1;const e=t.state;return!e||e.strm!==t||e.mode16211?1:0},Me=t=>{if(Ce(t))return xe;const e=t.state;return t.total_in=t.total_out=e.total=0,t.msg="",e.wrap&&(t.adler=1&e.wrap),e.mode=Ze,e.last=0,e.havedict=0,e.flags=-1,e.dmax=32768,e.head=null,e.hold=0,e.bits=0,e.lencode=e.lendyn=new Int32Array(852),e.distcode=e.distdyn=new Int32Array(592),e.sane=1,e.back=-1,ke},He=t=>{if(Ce(t))return xe;const e=t.state;return e.wsize=0,e.whave=0,e.wnext=0,Me(t)},je=(t,e)=>{let a;if(Ce(t))return xe;const i=t.state;return e<0?(a=0,e=-e):(a=5+(e>>4),e<48&&(e&=15)),e&&(e<8||e>15)?xe:(null!==i.window&&i.wbits!==e&&(i.window=null),i.wrap=a,i.wbits=e,He(t))},Ke=(t,e)=>{if(!t)return xe;const a=new Be;t.state=a,a.strm=t,a.window=null,a.mode=Ze;const i=je(t,e);return i!==ke&&(t.state=null),i};let Pe,Ye,Ge=!0;const Xe=t=>{if(Ge){Pe=new Int32Array(512),Ye=new Int32Array(32);let e=0;for(;e<144;)t.lens[e++]=8;for(;e<256;)t.lens[e++]=9;for(;e<280;)t.lens[e++]=7;for(;e<288;)t.lens[e++]=8;for(me(1,t.lens,0,288,Pe,0,t.work,{bits:9}),e=0;e<32;)t.lens[e++]=5;me(2,t.lens,0,32,Ye,0,t.work,{bits:5}),Ge=!1}t.lencode=Pe,t.lenbits=9,t.distcode=Ye,t.distbits=5},We=(t,e,a,i)=>{let n;const s=t.state;return null===s.window&&(s.wsize=1<=s.wsize?(s.window.set(e.subarray(a-s.wsize,a),0),s.wnext=0,s.whave=s.wsize):(n=s.wsize-s.wnext,n>i&&(n=i),s.window.set(e.subarray(a-i,a-i+n),s.wnext),(i-=n)?(s.window.set(e.subarray(a-i,a),0),s.wnext=i,s.whave=s.wsize):(s.wnext+=n,s.wnext===s.wsize&&(s.wnext=0),s.whaveKe(t,15),inflateInit2:Ke,inflate:(t,e)=>{let a,i,n,s,r,o,l,h,d,_,f,c,u,w,m,b,g,p,k,v,y,x,z=0;const A=new Uint8Array(4);let E,R;const Z=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);if(Ce(t)||!t.output||!t.input&&0!==t.avail_in)return xe;a=t.state,a.mode===Se&&(a.mode=De),r=t.next_out,n=t.output,l=t.avail_out,s=t.next_in,i=t.input,o=t.avail_in,h=a.hold,d=a.bits,_=o,f=l,x=ke;t:for(;;)switch(a.mode){case Ze:if(0===a.wrap){a.mode=De;break}for(;d<16;){if(0===o)break t;o--,h+=i[s++]<>>8&255,a.check=H(a.check,A,2,0),h=0,d=0,a.mode=16181;break}if(a.head&&(a.head.done=!1),!(1&a.wrap)||(((255&h)<<8)+(h>>8))%31){t.msg="incorrect header check",a.mode=Le;break}if((15&h)!==Re){t.msg="unknown compression method",a.mode=Le;break}if(h>>>=4,d-=4,y=8+(15&h),0===a.wbits&&(a.wbits=y),y>15||y>a.wbits){t.msg="invalid window size",a.mode=Le;break}a.dmax=1<>8&1),512&a.flags&&4&a.wrap&&(A[0]=255&h,A[1]=h>>>8&255,a.check=H(a.check,A,2,0)),h=0,d=0,a.mode=16182;case 16182:for(;d<32;){if(0===o)break t;o--,h+=i[s++]<>>8&255,A[2]=h>>>16&255,A[3]=h>>>24&255,a.check=H(a.check,A,4,0)),h=0,d=0,a.mode=16183;case 16183:for(;d<16;){if(0===o)break t;o--,h+=i[s++]<>8),512&a.flags&&4&a.wrap&&(A[0]=255&h,A[1]=h>>>8&255,a.check=H(a.check,A,2,0)),h=0,d=0,a.mode=16184;case 16184:if(1024&a.flags){for(;d<16;){if(0===o)break t;o--,h+=i[s++]<>>8&255,a.check=H(a.check,A,2,0)),h=0,d=0}else a.head&&(a.head.extra=null);a.mode=16185;case 16185:if(1024&a.flags&&(c=a.length,c>o&&(c=o),c&&(a.head&&(y=a.head.extra_len-a.length,a.head.extra||(a.head.extra=new Uint8Array(a.head.extra_len)),a.head.extra.set(i.subarray(s,s+c),y)),512&a.flags&&4&a.wrap&&(a.check=H(a.check,i,c,s)),o-=c,s+=c,a.length-=c),a.length))break t;a.length=0,a.mode=16186;case 16186:if(2048&a.flags){if(0===o)break t;c=0;do{y=i[s+c++],a.head&&y&&a.length<65536&&(a.head.name+=String.fromCharCode(y))}while(y&&c>9&1,a.head.done=!0),t.adler=a.check=0,a.mode=Se;break;case 16189:for(;d<32;){if(0===o)break t;o--,h+=i[s++]<>>=7&d,d-=7&d,a.mode=Fe;break}for(;d<3;){if(0===o)break t;o--,h+=i[s++]<>>=1,d-=1,3&h){case 0:a.mode=16193;break;case 1:if(Xe(a),a.mode=Oe,e===pe){h>>>=2,d-=2;break t}break;case 2:a.mode=16196;break;case 3:t.msg="invalid block type",a.mode=Le}h>>>=2,d-=2;break;case 16193:for(h>>>=7&d,d-=7&d;d<32;){if(0===o)break t;o--,h+=i[s++]<>>16^65535)){t.msg="invalid stored block lengths",a.mode=Le;break}if(a.length=65535&h,h=0,d=0,a.mode=Te,e===pe)break t;case Te:a.mode=16195;case 16195:if(c=a.length,c){if(c>o&&(c=o),c>l&&(c=l),0===c)break t;n.set(i.subarray(s,s+c),r),o-=c,s+=c,l-=c,r+=c,a.length-=c;break}a.mode=Se;break;case 16196:for(;d<14;){if(0===o)break t;o--,h+=i[s++]<>>=5,d-=5,a.ndist=1+(31&h),h>>>=5,d-=5,a.ncode=4+(15&h),h>>>=4,d-=4,a.nlen>286||a.ndist>30){t.msg="too many length or distance symbols",a.mode=Le;break}a.have=0,a.mode=16197;case 16197:for(;a.have>>=3,d-=3}for(;a.have<19;)a.lens[Z[a.have++]]=0;if(a.lencode=a.lendyn,a.lenbits=7,E={bits:a.lenbits},x=me(0,a.lens,0,19,a.lencode,0,a.work,E),a.lenbits=E.bits,x){t.msg="invalid code lengths set",a.mode=Le;break}a.have=0,a.mode=16198;case 16198:for(;a.have>>24,b=z>>>16&255,g=65535&z,!(m<=d);){if(0===o)break t;o--,h+=i[s++]<>>=m,d-=m,a.lens[a.have++]=g;else{if(16===g){for(R=m+2;d>>=m,d-=m,0===a.have){t.msg="invalid bit length repeat",a.mode=Le;break}y=a.lens[a.have-1],c=3+(3&h),h>>>=2,d-=2}else if(17===g){for(R=m+3;d>>=m,d-=m,y=0,c=3+(7&h),h>>>=3,d-=3}else{for(R=m+7;d>>=m,d-=m,y=0,c=11+(127&h),h>>>=7,d-=7}if(a.have+c>a.nlen+a.ndist){t.msg="invalid bit length repeat",a.mode=Le;break}for(;c--;)a.lens[a.have++]=y}}if(a.mode===Le)break;if(0===a.lens[256]){t.msg="invalid code -- missing end-of-block",a.mode=Le;break}if(a.lenbits=9,E={bits:a.lenbits},x=me(1,a.lens,0,a.nlen,a.lencode,0,a.work,E),a.lenbits=E.bits,x){t.msg="invalid literal/lengths set",a.mode=Le;break}if(a.distbits=6,a.distcode=a.distdyn,E={bits:a.distbits},x=me(2,a.lens,a.nlen,a.ndist,a.distcode,0,a.work,E),a.distbits=E.bits,x){t.msg="invalid distances set",a.mode=Le;break}if(a.mode=Oe,e===pe)break t;case Oe:a.mode=Ie;case Ie:if(o>=6&&l>=258){t.next_out=r,t.avail_out=l,t.next_in=s,t.avail_in=o,a.hold=h,a.bits=d,de(t,f),r=t.next_out,n=t.output,l=t.avail_out,s=t.next_in,i=t.input,o=t.avail_in,h=a.hold,d=a.bits,a.mode===Se&&(a.back=-1);break}for(a.back=0;z=a.lencode[h&(1<>>24,b=z>>>16&255,g=65535&z,!(m<=d);){if(0===o)break t;o--,h+=i[s++]<>p)],m=z>>>24,b=z>>>16&255,g=65535&z,!(p+m<=d);){if(0===o)break t;o--,h+=i[s++]<>>=p,d-=p,a.back+=p}if(h>>>=m,d-=m,a.back+=m,a.length=g,0===b){a.mode=16205;break}if(32&b){a.back=-1,a.mode=Se;break}if(64&b){t.msg="invalid literal/length code",a.mode=Le;break}a.extra=15&b,a.mode=16201;case 16201:if(a.extra){for(R=a.extra;d>>=a.extra,d-=a.extra,a.back+=a.extra}a.was=a.length,a.mode=16202;case 16202:for(;z=a.distcode[h&(1<>>24,b=z>>>16&255,g=65535&z,!(m<=d);){if(0===o)break t;o--,h+=i[s++]<>p)],m=z>>>24,b=z>>>16&255,g=65535&z,!(p+m<=d);){if(0===o)break t;o--,h+=i[s++]<>>=p,d-=p,a.back+=p}if(h>>>=m,d-=m,a.back+=m,64&b){t.msg="invalid distance code",a.mode=Le;break}a.offset=g,a.extra=15&b,a.mode=16203;case 16203:if(a.extra){for(R=a.extra;d>>=a.extra,d-=a.extra,a.back+=a.extra}if(a.offset>a.dmax){t.msg="invalid distance too far back",a.mode=Le;break}a.mode=16204;case 16204:if(0===l)break t;if(c=f-l,a.offset>c){if(c=a.offset-c,c>a.whave&&a.sane){t.msg="invalid distance too far back",a.mode=Le;break}c>a.wnext?(c-=a.wnext,u=a.wsize-c):u=a.wnext-c,c>a.length&&(c=a.length),w=a.window}else w=n,u=r-a.offset,c=a.length;c>l&&(c=l),l-=c,a.length-=c;do{n[r++]=w[u++]}while(--c);0===a.length&&(a.mode=Ie);break;case 16205:if(0===l)break t;n[r++]=a.length,l--,a.mode=Ie;break;case Fe:if(a.wrap){for(;d<32;){if(0===o)break t;o--,h|=i[s++]<{if(Ce(t))return xe;let e=t.state;return e.window&&(e.window=null),t.state=null,ke},inflateGetHeader:(t,e)=>{if(Ce(t))return xe;const a=t.state;return 0==(2&a.wrap)?xe:(a.head=e,e.done=!1,ke)},inflateSetDictionary:(t,e)=>{const a=e.length;let i,n,s;return Ce(t)?xe:(i=t.state,0!==i.wrap&&i.mode!==Ue?xe:i.mode===Ue&&(n=1,n=C(n,e,a,0),n!==i.check)?ze:(s=We(t,e,a,a),s?(i.mode=16210,Ae):(i.havedict=1,ke)))},inflateInfo:"pako inflate (from Nodeca project)"};var Je=function(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name="",this.comment="",this.hcrc=0,this.done=!1};const Qe=Object.prototype.toString,{Z_NO_FLUSH:Ve,Z_FINISH:$e,Z_OK:ta,Z_STREAM_END:ea,Z_NEED_DICT:aa,Z_STREAM_ERROR:ia,Z_DATA_ERROR:na,Z_MEM_ERROR:sa}=K;function ra(t){this.options=jt({chunkSize:65536,windowBits:15,to:""},t||{});const e=this.options;e.raw&&e.windowBits>=0&&e.windowBits<16&&(e.windowBits=-e.windowBits,0===e.windowBits&&(e.windowBits=-15)),!(e.windowBits>=0&&e.windowBits<16)||t&&t.windowBits||(e.windowBits+=32),e.windowBits>15&&e.windowBits<48&&0==(15&e.windowBits)&&(e.windowBits|=15),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new qt,this.strm.avail_out=0;let a=qe.inflateInit2(this.strm,e.windowBits);if(a!==ta)throw new Error(j[a]);if(this.header=new Je,qe.inflateGetHeader(this.strm,this.header),e.dictionary&&("string"==typeof e.dictionary?e.dictionary=Gt(e.dictionary):"[object ArrayBuffer]"===Qe.call(e.dictionary)&&(e.dictionary=new Uint8Array(e.dictionary)),e.raw&&(a=qe.inflateSetDictionary(this.strm,e.dictionary),a!==ta)))throw new Error(j[a])}function oa(t,e){const a=new ra(e);if(a.push(t),a.err)throw a.msg||j[a.err];return a.result}ra.prototype.push=function(t,e){const a=this.strm,i=this.options.chunkSize,n=this.options.dictionary;let s,r,o;if(this.ended)return!1;for(r=e===~~e?e:!0===e?$e:Ve,"[object ArrayBuffer]"===Qe.call(t)?a.input=new Uint8Array(t):a.input=t,a.next_in=0,a.avail_in=a.input.length;;){for(0===a.avail_out&&(a.output=new Uint8Array(i),a.next_out=0,a.avail_out=i),s=qe.inflate(a,r),s===aa&&n&&(s=qe.inflateSetDictionary(a,n),s===ta?s=qe.inflate(a,r):s===na&&(s=aa));a.avail_in>0&&s===ea&&a.state.wrap>0&&0!==t[a.next_in];)qe.inflateReset(a),s=qe.inflate(a,r);switch(s){case ia:case na:case aa:case sa:return this.onEnd(s),this.ended=!0,!1}if(o=a.avail_out,a.next_out&&(0===a.avail_out||s===ea))if("string"===this.options.to){let t=Wt(a.output,a.next_out),e=a.next_out-t,n=Xt(a.output,t);a.next_out=e,a.avail_out=i-e,e&&a.output.set(a.output.subarray(t,t+e),0),this.onData(n)}else this.onData(a.output.length===a.next_out?a.output:a.output.subarray(0,a.next_out));if(s!==ta||0!==o){if(s===ea)return s=qe.inflateEnd(this.strm),this.onEnd(s),this.ended=!0,!0;if(0===a.avail_in)break}}return!0},ra.prototype.onData=function(t){this.chunks.push(t)},ra.prototype.onEnd=function(t){t===ta&&("string"===this.options.to?this.result=this.chunks.join(""):this.result=Kt(this.chunks)),this.chunks=[],this.err=t,this.msg=this.strm.msg};var la={Inflate:ra,inflate:oa,inflateRaw:function(t,e){return(e=e||{}).raw=!0,oa(t,e)},ungzip:oa,constants:K};const{Deflate:ha,deflate:da,deflateRaw:_a,gzip:fa}=le,{Inflate:ca,inflate:ua,inflateRaw:wa,ungzip:ma}=la;var ba=ha,ga=da,pa=_a,ka=fa,va=ca,ya=ua,xa=wa,za=ma,Aa=K,Ea={Deflate:ba,deflate:ga,deflateRaw:pa,gzip:ka,Inflate:va,inflate:ya,inflateRaw:xa,ungzip:za,constants:Aa};t.Deflate=ba,t.Inflate=va,t.constants=Aa,t.default=Ea,t.deflate=ga,t.deflateRaw=pa,t.gzip=ka,t.inflate=ya,t.inflateRaw=xa,t.ungzip=za,Object.defineProperty(t,"__esModule",{value:!0})})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.js b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.js new file mode 100644 index 0000000..fd129da --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.js @@ -0,0 +1,3924 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +(function (global, factory) { + typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : + typeof define === 'function' && define.amd ? define(['exports'], factory) : + (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.pako = {})); +})(this, (function (exports) { 'use strict'; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + /* eslint-disable space-unary-ops */ + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + //const Z_FILTERED = 1; + //const Z_HUFFMAN_ONLY = 2; + //const Z_RLE = 3; + var Z_FIXED$1 = 4; + //const Z_DEFAULT_STRATEGY = 0; + + /* Possible values of the data_type field (though see inflate()) */ + var Z_BINARY = 0; + var Z_TEXT = 1; + //const Z_ASCII = 1; // = Z_TEXT + var Z_UNKNOWN$1 = 2; + + /*============================================================================*/ + + function zero$1(buf) { + var len = buf.length; + while (--len >= 0) { + buf[len] = 0; + } + } + + // From zutil.h + + var STORED_BLOCK = 0; + var STATIC_TREES = 1; + var DYN_TREES = 2; + /* The three kinds of block type */ + + var MIN_MATCH$1 = 3; + var MAX_MATCH$1 = 258; + /* The minimum and maximum match lengths */ + + // From deflate.h + /* =========================================================================== + * Internal compression state. + */ + + var LENGTH_CODES$1 = 29; + /* number of length codes, not counting the special END_BLOCK code */ + + var LITERALS$1 = 256; + /* number of literal bytes 0..255 */ + + var L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1; + /* number of Literal or Length codes, including the END_BLOCK code */ + + var D_CODES$1 = 30; + /* number of distance codes */ + + var BL_CODES$1 = 19; + /* number of codes used to transfer the bit lengths */ + + var HEAP_SIZE$1 = 2 * L_CODES$1 + 1; + /* maximum heap size */ + + var MAX_BITS$1 = 15; + /* All codes must not exceed MAX_BITS bits */ + + var Buf_size = 16; + /* size of bit buffer in bi_buf */ + + /* =========================================================================== + * Constants + */ + + var MAX_BL_BITS = 7; + /* Bit length codes must not exceed MAX_BL_BITS bits */ + + var END_BLOCK = 256; + /* end of block literal code */ + + var REP_3_6 = 16; + /* repeat previous bit length 3-6 times (2 bits of repeat count) */ + + var REPZ_3_10 = 17; + /* repeat a zero length 3-10 times (3 bits of repeat count) */ + + var REPZ_11_138 = 18; + /* repeat a zero length 11-138 times (7 bits of repeat count) */ + + /* eslint-disable comma-spacing,array-bracket-spacing */ + var extra_lbits = /* extra bits for each length code */ + new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]); + var extra_dbits = /* extra bits for each distance code */ + new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]); + var extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]); + var bl_order = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]); + /* eslint-enable comma-spacing,array-bracket-spacing */ + + /* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + + /* =========================================================================== + * Local data. These are initialized only once. + */ + + // We pre-fill arrays with 0 to avoid uninitialized gaps + + var DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + + // !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 + var static_ltree = new Array((L_CODES$1 + 2) * 2); + zero$1(static_ltree); + /* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + + var static_dtree = new Array(D_CODES$1 * 2); + zero$1(static_dtree); + /* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + + var _dist_code = new Array(DIST_CODE_LEN); + zero$1(_dist_code); + /* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + + var _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1); + zero$1(_length_code); + /* length code for each normalized match length (0 == MIN_MATCH) */ + + var base_length = new Array(LENGTH_CODES$1); + zero$1(base_length); + /* First normalized length for each code (0 = MIN_MATCH) */ + + var base_dist = new Array(D_CODES$1); + zero$1(base_dist); + /* First normalized distance for each code (0 = distance of 1) */ + + function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; + } + var static_l_desc; + var static_d_desc; + var static_bl_desc; + function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ + } + + var d_code = function d_code(dist) { + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; + }; + + /* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ + var put_short = function put_short(s, w) { + // put_byte(s, (uch)((w) & 0xff)); + // put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = w & 0xff; + s.pending_buf[s.pending++] = w >>> 8 & 0xff; + }; + + /* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ + var send_bits = function send_bits(s, value, length) { + if (s.bi_valid > Buf_size - length) { + s.bi_buf |= value << s.bi_valid & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> Buf_size - s.bi_valid; + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= value << s.bi_valid & 0xffff; + s.bi_valid += length; + } + }; + var send_code = function send_code(s, c, tree) { + send_bits(s, tree[c * 2] /*.Code*/, tree[c * 2 + 1] /*.Len*/); + }; + + /* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ + var bi_reverse = function bi_reverse(code, len) { + var res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; + }; + + /* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ + var bi_flush = function bi_flush(s) { + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } + }; + + /* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ + var gen_bitlen = function gen_bitlen(s, desc) { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + var tree = desc.dyn_tree; + var max_code = desc.max_code; + var stree = desc.stat_desc.static_tree; + var has_stree = desc.stat_desc.has_stree; + var extra = desc.stat_desc.extra_bits; + var base = desc.stat_desc.extra_base; + var max_length = desc.stat_desc.max_length; + var h; /* heap index */ + var n, m; /* iterate over the tree elements */ + var bits; /* bit length */ + var xbits; /* extra bits */ + var f; /* frequency */ + var overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS$1; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1] /*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1] /*.Dad*/ * 2 + 1] /*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1] /*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { + continue; + } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2] /*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1] /*.Len*/ + xbits); + } + } + if (overflow === 0) { + return; + } + + // Tracev((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { + bits--; + } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { + continue; + } + if (tree[m * 2 + 1] /*.Len*/ !== bits) { + // Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1] /*.Len*/) * tree[m * 2] /*.Freq*/; + tree[m * 2 + 1] /*.Len*/ = bits; + } + n--; + } + } + }; + + /* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ + var gen_codes = function gen_codes(tree, max_code, bl_count) { + // ct_data *tree; /* the tree to decorate */ + // int max_code; /* largest code with non zero frequency */ + // ushf *bl_count; /* number of codes at each bit length */ + + var next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */ + var code = 0; /* running code value */ + var bits; /* bit index */ + var n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS$1; bits++) { + code = code + bl_count[bits - 1] << 1; + next_code[bits] = code; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES$1 - 1; code++) { + base_length[code] = length; + for (n = 0; n < 1 << extra_lbits[code]; n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < 1 << extra_dbits[code]; n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES$1; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < 1 << extra_dbits[code] - 7; n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS$1; bits++) { + bl_count[bits] = 0; + } + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1] /*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1] /*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1] /*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1] /*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES$1 + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES$1; n++) { + static_dtree[n * 2 + 1] /*.Len*/ = 5; + static_dtree[n * 2] /*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS); + + //static_init_done = true; + }; + + /* =========================================================================== + * Initialize a new block. + */ + var init_block = function init_block(s) { + var n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES$1; n++) { + s.dyn_ltree[n * 2] /*.Freq*/ = 0; + } + for (n = 0; n < D_CODES$1; n++) { + s.dyn_dtree[n * 2] /*.Freq*/ = 0; + } + for (n = 0; n < BL_CODES$1; n++) { + s.bl_tree[n * 2] /*.Freq*/ = 0; + } + s.dyn_ltree[END_BLOCK * 2] /*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.sym_next = s.matches = 0; + }; + + /* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ + var bi_windup = function bi_windup(s) { + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; + }; + + /* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ + var smaller = function smaller(tree, n, m, depth) { + var _n2 = n * 2; + var _m2 = m * 2; + return tree[_n2] /*.Freq*/ < tree[_m2] /*.Freq*/ || tree[_n2] /*.Freq*/ === tree[_m2] /*.Freq*/ && depth[n] <= depth[m]; + }; + + /* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ + var pqdownheap = function pqdownheap(s, tree, k) { + // deflate_state *s; + // ct_data *tree; /* the tree to restore */ + // int k; /* node to move down */ + + var v = s.heap[k]; + var j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { + break; + } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; + }; + + // inlined manually + // const SMALLEST = 1; + + /* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ + var compress_block = function compress_block(s, ltree, dtree) { + // deflate_state *s; + // const ct_data *ltree; /* literal tree */ + // const ct_data *dtree; /* distance tree */ + + var dist; /* distance of matched string */ + var lc; /* match length or unmatched char (if dist == 0) */ + var sx = 0; /* running index in sym_buf */ + var code; /* the code to send */ + var extra; /* number of extra bits to send */ + + if (s.sym_next !== 0) { + do { + dist = s.pending_buf[s.sym_buf + sx++] & 0xff; + dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8; + lc = s.pending_buf[s.sym_buf + sx++]; + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and sym_buf is ok: */ + //Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow"); + } while (sx < s.sym_next); + } + send_code(s, END_BLOCK, ltree); + }; + + /* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ + var build_tree = function build_tree(s, desc) { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + var tree = desc.dyn_tree; + var stree = desc.stat_desc.static_tree; + var has_stree = desc.stat_desc.has_stree; + var elems = desc.stat_desc.elems; + var n, m; /* iterate over heap elements */ + var max_code = -1; /* largest code with non zero frequency */ + var node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE$1; + for (n = 0; n < elems; n++) { + if (tree[n * 2] /*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + } else { + tree[n * 2 + 1] /*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = max_code < 2 ? ++max_code : 0; + tree[node * 2] /*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + if (has_stree) { + s.static_len -= stree[node * 2 + 1] /*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = s.heap_len >> 1 /*int /2*/; n >= 1; n--) { + pqdownheap(s, tree, n); + } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1 /*SMALLEST*/]; + s.heap[1 /*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1 /*SMALLEST*/); + /***/ + + m = s.heap[1 /*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2] /*.Freq*/ = tree[n * 2] /*.Freq*/ + tree[m * 2] /*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1] /*.Dad*/ = tree[m * 2 + 1] /*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1 /*SMALLEST*/] = node++; + pqdownheap(s, tree, 1 /*SMALLEST*/); + } while (s.heap_len >= 2); + s.heap[--s.heap_max] = s.heap[1 /*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); + }; + + /* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ + var scan_tree = function scan_tree(s, tree, max_code) { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + var n; /* iterates over all tree elements */ + var prevlen = -1; /* last emitted length */ + var curlen; /* length of current code */ + + var nextlen = tree[0 * 2 + 1] /*.Len*/; /* length of next code */ + + var count = 0; /* repeat count of the current code */ + var max_count = 7; /* max repeat count */ + var min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1] /*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1] /*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + } else if (count < min_count) { + s.bl_tree[curlen * 2] /*.Freq*/ += count; + } else if (curlen !== 0) { + if (curlen !== prevlen) { + s.bl_tree[curlen * 2] /*.Freq*/++; + } + s.bl_tree[REP_3_6 * 2] /*.Freq*/++; + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++; + } else { + s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++; + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + } else { + max_count = 7; + min_count = 4; + } + } + }; + + /* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ + var send_tree = function send_tree(s, tree, max_code) { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + var n; /* iterates over all tree elements */ + var prevlen = -1; /* last emitted length */ + var curlen; /* length of current code */ + + var nextlen = tree[0 * 2 + 1] /*.Len*/; /* length of next code */ + + var count = 0; /* repeat count of the current code */ + var max_count = 7; /* max repeat count */ + var min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1] /*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + } else if (count < min_count) { + do { + send_code(s, curlen, s.bl_tree); + } while (--count !== 0); + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + } else { + max_count = 7; + min_count = 4; + } + } + }; + + /* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ + var build_bl_tree = function build_bl_tree(s) { + var max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1] /*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; + }; + + /* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ + var send_all_trees = function send_all_trees(s, lcodes, dcodes, blcodes) { + // deflate_state *s; + // int lcodes, dcodes, blcodes; /* number of codes for each tree */ + + var rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1] /*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); + }; + + /* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "block list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ + var detect_data_type = function detect_data_type(s) { + /* block_mask is the bit mask of block-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + var block_mask = 0xf3ffc07f; + var n; + + /* Check for non-textual ("block-listed") bytes. */ + for (n = 0; n <= 31; n++, block_mask >>>= 1) { + if (block_mask & 1 && s.dyn_ltree[n * 2] /*.Freq*/ !== 0) { + return Z_BINARY; + } + } + + /* Check for textual ("allow-listed") bytes. */ + if (s.dyn_ltree[9 * 2] /*.Freq*/ !== 0 || s.dyn_ltree[10 * 2] /*.Freq*/ !== 0 || s.dyn_ltree[13 * 2] /*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS$1; n++) { + if (s.dyn_ltree[n * 2] /*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "block-listed" or "allow-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; + }; + var static_init_done = false; + + /* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ + var _tr_init$1 = function _tr_init(s) { + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); + }; + + /* =========================================================================== + * Send a stored block + */ + var _tr_stored_block$1 = function _tr_stored_block(s, buf, stored_len, last) { + //DeflateState *s; + //charf *buf; /* input block */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + bi_windup(s); /* align on byte boundary */ + put_short(s, stored_len); + put_short(s, ~stored_len); + if (stored_len) { + s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending); + } + s.pending += stored_len; + }; + + /* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ + var _tr_align$1 = function _tr_align(s) { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); + }; + + /* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and write out the encoded block. + */ + var _tr_flush_block$1 = function _tr_flush_block(s, buf, stored_len, last) { + //DeflateState *s; + //charf *buf; /* input block, or NULL if too old */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + var opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + var max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN$1) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = s.opt_len + 3 + 7 >>> 3; + static_lenb = s.static_len + 3 + 7 >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->sym_next / 3)); + + if (static_lenb <= opt_lenb) { + opt_lenb = static_lenb; + } + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if (stored_len + 4 <= opt_lenb && buf !== -1) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block$1(s, buf, stored_len, last); + } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) { + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); + }; + + /* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ + var _tr_tally$1 = function _tr_tally(s, dist, lc) { + // deflate_state *s; + // unsigned dist; /* distance of matched string */ + // unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ + + s.pending_buf[s.sym_buf + s.sym_next++] = dist; + s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8; + s.pending_buf[s.sym_buf + s.sym_next++] = lc; + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2] /*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2] /*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2] /*.Freq*/++; + } + + return s.sym_next === s.sym_end; + }; + var _tr_init_1 = _tr_init$1; + var _tr_stored_block_1 = _tr_stored_block$1; + var _tr_flush_block_1 = _tr_flush_block$1; + var _tr_tally_1 = _tr_tally$1; + var _tr_align_1 = _tr_align$1; + var trees = { + _tr_init: _tr_init_1, + _tr_stored_block: _tr_stored_block_1, + _tr_flush_block: _tr_flush_block_1, + _tr_tally: _tr_tally_1, + _tr_align: _tr_align_1 + }; + + // Note: adler32 takes 12% for level 0 and 2% for level 6. + // It isn't worth it to make additional optimizations as in original. + // Small size is preferable. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var adler32 = function adler32(adler, buf, len, pos) { + var s1 = adler & 0xffff | 0, + s2 = adler >>> 16 & 0xffff | 0, + n = 0; + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + do { + s1 = s1 + buf[pos++] | 0; + s2 = s2 + s1 | 0; + } while (--n); + s1 %= 65521; + s2 %= 65521; + } + return s1 | s2 << 16 | 0; + }; + var adler32_1 = adler32; + + // Note: we can't get significant speed boost here. + // So write code to minimize size - no pregenerated tables + // and array tools dependencies. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // Use ordinary array, since untyped makes no boost here + var makeTable = function makeTable() { + var c, + table = []; + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1; + } + table[n] = c; + } + return table; + }; + + // Create table on load. Just 255 signed longs. Not a problem. + var crcTable = new Uint32Array(makeTable()); + var crc32 = function crc32(crc, buf, len, pos) { + var t = crcTable; + var end = pos + len; + crc ^= -1; + for (var i = pos; i < end; i++) { + crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF]; + } + return crc ^ -1; // >>> 0; + }; + + var crc32_1 = crc32; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var messages = { + 2: 'need dictionary', + /* Z_NEED_DICT 2 */ + 1: 'stream end', + /* Z_STREAM_END 1 */ + 0: '', + /* Z_OK 0 */ + '-1': 'file error', + /* Z_ERRNO (-1) */ + '-2': 'stream error', + /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', + /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', + /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', + /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var constants$1 = { + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var _tr_init = trees._tr_init, + _tr_stored_block = trees._tr_stored_block, + _tr_flush_block = trees._tr_flush_block, + _tr_tally = trees._tr_tally, + _tr_align = trees._tr_align; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_NO_FLUSH$1 = constants$1.Z_NO_FLUSH, + Z_PARTIAL_FLUSH = constants$1.Z_PARTIAL_FLUSH, + Z_FULL_FLUSH$1 = constants$1.Z_FULL_FLUSH, + Z_FINISH$1 = constants$1.Z_FINISH, + Z_BLOCK = constants$1.Z_BLOCK, + Z_OK$1 = constants$1.Z_OK, + Z_STREAM_END$1 = constants$1.Z_STREAM_END, + Z_STREAM_ERROR = constants$1.Z_STREAM_ERROR, + Z_DATA_ERROR = constants$1.Z_DATA_ERROR, + Z_BUF_ERROR = constants$1.Z_BUF_ERROR, + Z_DEFAULT_COMPRESSION$1 = constants$1.Z_DEFAULT_COMPRESSION, + Z_FILTERED = constants$1.Z_FILTERED, + Z_HUFFMAN_ONLY = constants$1.Z_HUFFMAN_ONLY, + Z_RLE = constants$1.Z_RLE, + Z_FIXED = constants$1.Z_FIXED, + Z_DEFAULT_STRATEGY$1 = constants$1.Z_DEFAULT_STRATEGY, + Z_UNKNOWN = constants$1.Z_UNKNOWN, + Z_DEFLATED$1 = constants$1.Z_DEFLATED; + + /*============================================================================*/ + + var MAX_MEM_LEVEL = 9; + /* Maximum value for memLevel in deflateInit2 */ + var MAX_WBITS = 15; + /* 32K LZ77 window */ + var DEF_MEM_LEVEL = 8; + var LENGTH_CODES = 29; + /* number of length codes, not counting the special END_BLOCK code */ + var LITERALS = 256; + /* number of literal bytes 0..255 */ + var L_CODES = LITERALS + 1 + LENGTH_CODES; + /* number of Literal or Length codes, including the END_BLOCK code */ + var D_CODES = 30; + /* number of distance codes */ + var BL_CODES = 19; + /* number of codes used to transfer the bit lengths */ + var HEAP_SIZE = 2 * L_CODES + 1; + /* maximum heap size */ + var MAX_BITS = 15; + /* All codes must not exceed MAX_BITS bits */ + + var MIN_MATCH = 3; + var MAX_MATCH = 258; + var MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1; + var PRESET_DICT = 0x20; + var INIT_STATE = 42; /* zlib header -> BUSY_STATE */ + //#ifdef GZIP + var GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */ + //#endif + var EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */ + var NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */ + var COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */ + var HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */ + var BUSY_STATE = 113; /* deflate -> FINISH_STATE */ + var FINISH_STATE = 666; /* stream complete */ + + var BS_NEED_MORE = 1; /* block not completed, need more input or more output */ + var BS_BLOCK_DONE = 2; /* block flush performed */ + var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ + var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + + var OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + + var err = function err(strm, errorCode) { + strm.msg = messages[errorCode]; + return errorCode; + }; + var rank = function rank(f) { + return f * 2 - (f > 4 ? 9 : 0); + }; + var zero = function zero(buf) { + var len = buf.length; + while (--len >= 0) { + buf[len] = 0; + } + }; + + /* =========================================================================== + * Slide the hash table when sliding the window down (could be avoided with 32 + * bit values at the expense of memory usage). We slide even when level == 0 to + * keep the hash table consistent if we switch back to level > 0 later. + */ + var slide_hash = function slide_hash(s) { + var n, m; + var p; + var wsize = s.w_size; + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = m >= wsize ? m - wsize : 0; + } while (--n); + n = wsize; + //#ifndef FASTEST + p = n; + do { + m = s.prev[--p]; + s.prev[p] = m >= wsize ? m - wsize : 0; + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); + //#endif + }; + + /* eslint-disable new-cap */ + var HASH_ZLIB = function HASH_ZLIB(s, prev, data) { + return (prev << s.hash_shift ^ data) & s.hash_mask; + }; + // This hash causes less collisions, https://github.com/nodeca/pako/issues/135 + // But breaks binary compatibility + //let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; + var HASH = HASH_ZLIB; + + /* ========================================================================= + * Flush as much pending output as possible. All deflate() output, except for + * some deflate_stored() output, goes through this function so some + * applications may wish to modify it to avoid allocating a large + * strm->next_out buffer and copying into it. (See also read_buf()). + */ + var flush_pending = function flush_pending(strm) { + var s = strm.state; + + //_tr_flush_bits(s); + var len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { + return; + } + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } + }; + var flush_block_only = function flush_block_only(s, last) { + _tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); + }; + var put_byte = function put_byte(s, b) { + s.pending_buf[s.pending++] = b; + }; + + /* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ + var putShortMSB = function putShortMSB(s, b) { + // put_byte(s, (Byte)(b >> 8)); + // put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = b >>> 8 & 0xff; + s.pending_buf[s.pending++] = b & 0xff; + }; + + /* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ + var read_buf = function read_buf(strm, buf, start, size) { + var len = strm.avail_in; + if (len > size) { + len = size; + } + if (len === 0) { + return 0; + } + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32_1(strm.adler, buf, len, start); + } else if (strm.state.wrap === 2) { + strm.adler = crc32_1(strm.adler, buf, len, start); + } + strm.next_in += len; + strm.total_in += len; + return len; + }; + + /* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ + var longest_match = function longest_match(s, cur_match) { + var chain_length = s.max_chain_length; /* max hash chain length */ + var scan = s.strstart; /* current string */ + var match; /* matched string */ + var len; /* length of current match */ + var best_len = s.prev_length; /* best match length so far */ + var nice_match = s.nice_match; /* stop if match long enough */ + var limit = s.strstart > s.w_size - MIN_LOOKAHEAD ? s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0 /*NIL*/; + + var _win = s.window; // shortcut + + var wmask = s.w_mask; + var prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + var strend = s.strstart + MAX_MATCH; + var scan_end1 = _win[scan + best_len - 1]; + var scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { + nice_match = s.lookahead; + } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || _win[match + best_len - 1] !== scan_end1 || _win[match] !== _win[scan] || _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; + }; + + /* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ + var fill_window = function fill_window(s) { + var _w_size = s.w_size; + var n, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + slide_hash(s); + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); + //#if MIN_MATCH != 3 + // Call update_hash() MIN_MATCH-3 more times + //#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ + // if (s.high_water < s.window_size) { + // const curr = s.strstart + s.lookahead; + // let init = 0; + // + // if (s.high_water < curr) { + // /* Previous high water mark below current data -- zero WIN_INIT + // * bytes or up to end of window, whichever is less. + // */ + // init = s.window_size - curr; + // if (init > WIN_INIT) + // init = WIN_INIT; + // zmemzero(s->window + curr, (unsigned)init); + // s->high_water = curr + init; + // } + // else if (s->high_water < (ulg)curr + WIN_INIT) { + // /* High water mark at or above current data, but below current data + // * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up + // * to end of window, whichever is less. + // */ + // init = (ulg)curr + WIN_INIT - s->high_water; + // if (init > s->window_size - s->high_water) + // init = s->window_size - s->high_water; + // zmemzero(s->window + s->high_water, (unsigned)init); + // s->high_water += init; + // } + // } + // + // Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, + // "not enough room for search"); + }; + + /* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * + * In case deflateParams() is used to later switch to a non-zero compression + * level, s->matches (otherwise unused when storing) keeps track of the number + * of hash table slides to perform. If s->matches is 1, then one hash table + * slide will be done when switching. If s->matches is 2, the maximum value + * allowed here, then the hash table will be cleared, since two or more slides + * is the same as a clear. + * + * deflate_stored() is written to minimize the number of times an input byte is + * copied. It is most efficient with large input and output buffers, which + * maximizes the opportunites to have a single copy from next_in to next_out. + */ + var deflate_stored = function deflate_stored(s, flush) { + /* Smallest worthy block size when not flushing or finishing. By default + * this is 32K. This can be as small as 507 bytes for memLevel == 1. For + * large input and output buffers, the stored block size will be larger. + */ + var min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5; + + /* Copy as many min_block or larger stored blocks directly to next_out as + * possible. If flushing, copy the remaining available input to next_out as + * stored blocks, if there is enough space. + */ + var len, + left, + have, + last = 0; + var used = s.strm.avail_in; + do { + /* Set len to the maximum size block that we can copy directly with the + * available input data and output space. Set left to how much of that + * would be copied from what's left in the window. + */ + len = 65535 /* MAX_STORED */; /* maximum deflate stored block length */ + have = s.bi_valid + 42 >> 3; /* number of header bytes */ + if (s.strm.avail_out < have) { + /* need room for header */ + break; + } + /* maximum stored block length that will fit in avail_out: */ + have = s.strm.avail_out - have; + left = s.strstart - s.block_start; /* bytes left in window */ + if (len > left + s.strm.avail_in) { + len = left + s.strm.avail_in; /* limit len to the input */ + } + + if (len > have) { + len = have; /* limit len to the output */ + } + + /* If the stored block would be less than min_block in length, or if + * unable to copy all of the available input when flushing, then try + * copying to the window and the pending buffer instead. Also don't + * write an empty block when flushing -- deflate() does that. + */ + if (len < min_block && (len === 0 && flush !== Z_FINISH$1 || flush === Z_NO_FLUSH$1 || len !== left + s.strm.avail_in)) { + break; + } + + /* Make a dummy stored block in pending to get the header bytes, + * including any pending bits. This also updates the debugging counts. + */ + last = flush === Z_FINISH$1 && len === left + s.strm.avail_in ? 1 : 0; + _tr_stored_block(s, 0, 0, last); + + /* Replace the lengths in the dummy stored block with len. */ + s.pending_buf[s.pending - 4] = len; + s.pending_buf[s.pending - 3] = len >> 8; + s.pending_buf[s.pending - 2] = ~len; + s.pending_buf[s.pending - 1] = ~len >> 8; + + /* Write the stored block header bytes. */ + flush_pending(s.strm); + + //#ifdef ZLIB_DEBUG + // /* Update debugging counts for the data about to be copied. */ + // s->compressed_len += len << 3; + // s->bits_sent += len << 3; + //#endif + + /* Copy uncompressed bytes from the window to next_out. */ + if (left) { + if (left > len) { + left = len; + } + //zmemcpy(s->strm->next_out, s->window + s->block_start, left); + s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out); + s.strm.next_out += left; + s.strm.avail_out -= left; + s.strm.total_out += left; + s.block_start += left; + len -= left; + } + + /* Copy uncompressed bytes directly from next_in to next_out, updating + * the check value. + */ + if (len) { + read_buf(s.strm, s.strm.output, s.strm.next_out, len); + s.strm.next_out += len; + s.strm.avail_out -= len; + s.strm.total_out += len; + } + } while (last === 0); + + /* Update the sliding window with the last s->w_size bytes of the copied + * data, or append all of the copied data to the existing window if less + * than s->w_size bytes were copied. Also update the number of bytes to + * insert in the hash tables, in the event that deflateParams() switches to + * a non-zero compression level. + */ + used -= s.strm.avail_in; /* number of input bytes directly copied */ + if (used) { + /* If any input was used, then no unused input remains in the window, + * therefore s->block_start == s->strstart. + */ + if (used >= s.w_size) { + /* supplant the previous history */ + s.matches = 2; /* clear hash */ + //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); + s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0); + s.strstart = s.w_size; + s.insert = s.strstart; + } else { + if (s.window_size - s.strstart <= used) { + /* Slide the window down. */ + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); + s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart); + s.strstart += used; + s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used; + } + s.block_start = s.strstart; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* If the last block was written to next_out, then done. */ + if (last) { + return BS_FINISH_DONE; + } + + /* If flushing and all input has been consumed, then done. */ + if (flush !== Z_NO_FLUSH$1 && flush !== Z_FINISH$1 && s.strm.avail_in === 0 && s.strstart === s.block_start) { + return BS_BLOCK_DONE; + } + + /* Fill the window with any remaining input. */ + have = s.window_size - s.strstart; + if (s.strm.avail_in > have && s.block_start >= s.w_size) { + /* Slide the window down. */ + s.block_start -= s.w_size; + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + + have += s.w_size; /* more space now */ + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + if (have > s.strm.avail_in) { + have = s.strm.avail_in; + } + if (have) { + read_buf(s.strm, s.window, s.strstart, have); + s.strstart += have; + s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* There was not enough avail_out to write a complete worthy or flushed + * stored block to next_out. Write a stored block to pending instead, if we + * have enough input for a worthy block, or if flushing and there is enough + * room for the remaining input as a stored block in the pending buffer. + */ + have = s.bi_valid + 42 >> 3; /* number of header bytes */ + /* maximum stored block length that will fit in pending: */ + have = s.pending_buf_size - have > 65535 /* MAX_STORED */ ? 65535 /* MAX_STORED */ : s.pending_buf_size - have; + min_block = have > s.w_size ? s.w_size : have; + left = s.strstart - s.block_start; + if (left >= min_block || (left || flush === Z_FINISH$1) && flush !== Z_NO_FLUSH$1 && s.strm.avail_in === 0 && left <= have) { + len = left > have ? have : left; + last = flush === Z_FINISH$1 && s.strm.avail_in === 0 && len === left ? 1 : 0; + _tr_stored_block(s, s.block_start, len, last); + s.block_start += len; + flush_pending(s.strm); + } + + /* We've done all we can with the available input and output. */ + return last ? BS_FINISH_STARTED : BS_NEED_MORE; + }; + + /* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ + var deflate_fast = function deflate_fast(s, flush) { + var hash_head; /* head of the hash chain */ + var bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0 /*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + + //#if MIN_MATCH != 3 + // Call UPDATE_HASH() MIN_MATCH-3 more times + //#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ + var deflate_slow = function deflate_slow(s, flush) { + var hash_head; /* head of hash chain */ + var bflush; /* set if current block must be flushed */ + + var max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; + } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0 /*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) { + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ + var deflate_rle = function deflate_rle(s, flush) { + var bflush; /* set if current block must be flushed */ + var prev; /* byte at distance one to match */ + var scan, strend; /* scan goes up to strend for length of run */ + + var _win = s.window; + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; + } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = 0; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ + var deflate_huff = function deflate_huff(s, flush) { + var bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + + s.insert = 0; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + /* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ + function Config(good_length, max_lazy, nice_length, max_chain, func) { + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; + } + var configuration_table = [/* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */]; + + /* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ + var lm_init = function lm_init(s) { + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; + }; + function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED$1; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.sym_buf = 0; /* buffer for distances and literals/lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.sym_next = 0; /* running index in sym_buf */ + this.sym_end = 0; /* symbol table full when sym_next reaches this */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ + } + + /* ========================================================================= + * Check for a valid deflate stream state. Return 0 if ok, 1 if not. + */ + var deflateStateCheck = function deflateStateCheck(strm) { + if (!strm) { + return 1; + } + var s = strm.state; + if (!s || s.strm !== strm || s.status !== INIT_STATE && + //#ifdef GZIP + s.status !== GZIP_STATE && + //#endif + s.status !== EXTRA_STATE && s.status !== NAME_STATE && s.status !== COMMENT_STATE && s.status !== HCRC_STATE && s.status !== BUSY_STATE && s.status !== FINISH_STATE) { + return 1; + } + return 0; + }; + var deflateResetKeep = function deflateResetKeep(strm) { + if (deflateStateCheck(strm)) { + return err(strm, Z_STREAM_ERROR); + } + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + var s = strm.state; + s.pending = 0; + s.pending_out = 0; + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + + s.status = + //#ifdef GZIP + s.wrap === 2 ? GZIP_STATE : + //#endif + s.wrap ? INIT_STATE : BUSY_STATE; + strm.adler = s.wrap === 2 ? 0 // crc32(0, Z_NULL, 0) + : 1; // adler32(0, Z_NULL, 0) + s.last_flush = -2; + _tr_init(s); + return Z_OK$1; + }; + var deflateReset = function deflateReset(strm) { + var ret = deflateResetKeep(strm); + if (ret === Z_OK$1) { + lm_init(strm.state); + } + return ret; + }; + var deflateSetHeader = function deflateSetHeader(strm, head) { + if (deflateStateCheck(strm) || strm.state.wrap !== 2) { + return Z_STREAM_ERROR; + } + strm.state.gzhead = head; + return Z_OK$1; + }; + var deflateInit2 = function deflateInit2(strm, level, method, windowBits, memLevel, strategy) { + if (!strm) { + // === Z_NULL + return Z_STREAM_ERROR; + } + var wrap = 1; + if (level === Z_DEFAULT_COMPRESSION$1) { + level = 6; + } + if (windowBits < 0) { + /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$1 || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED || windowBits === 8 && wrap !== 1) { + return err(strm, Z_STREAM_ERROR); + } + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + var s = new DeflateState(); + strm.state = s; + s.strm = strm; + s.status = INIT_STATE; /* to pass state test in deflateReset() */ + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << memLevel + 6; /* 16K elements by default */ + + /* We overlay pending_buf and sym_buf. This works since the average size + * for length/distance pairs over any compressed block is assured to be 31 + * bits or less. + * + * Analysis: The longest fixed codes are a length code of 8 bits plus 5 + * extra bits, for lengths 131 to 257. The longest fixed distance codes are + * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest + * possible fixed-codes length/distance pair is then 31 bits total. + * + * sym_buf starts one-fourth of the way into pending_buf. So there are + * three bytes in sym_buf for every four bytes in pending_buf. Each symbol + * in sym_buf is three bytes -- two for the distance and one for the + * literal/length. As each symbol is consumed, the pointer to the next + * sym_buf value to read moves forward three bytes. From that symbol, up to + * 31 bits are written to pending_buf. The closest the written pending_buf + * bits gets to the next sym_buf symbol to read is just before the last + * code is written. At that time, 31*(n-2) bits have been written, just + * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at + * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1 + * symbols are written.) The closest the writing gets to what is unread is + * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and + * can range from 128 to 32768. + * + * Therefore, at a minimum, there are 142 bits of space between what is + * written and what is read in the overlain buffers, so the symbols cannot + * be overwritten by the compressed data. That space is actually 139 bits, + * due to the three-bit fixed-code block header. + * + * That covers the case where either Z_FIXED is specified, forcing fixed + * codes, or when the use of fixed codes is chosen, because that choice + * results in a smaller compressed block than dynamic codes. That latter + * condition then assures that the above analysis also covers all dynamic + * blocks. A dynamic-code block will only be chosen to be emitted if it has + * fewer bits than a fixed-code block would for the same set of symbols. + * Therefore its average symbol length is assured to be less than 31. So + * the compressed data for a dynamic block also cannot overwrite the + * symbols from which it is being constructed. + */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->sym_buf = s->pending_buf + s->lit_bufsize; + s.sym_buf = s.lit_bufsize; + + //s->sym_end = (s->lit_bufsize - 1) * 3; + s.sym_end = (s.lit_bufsize - 1) * 3; + /* We avoid equality with lit_bufsize*3 because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ + + s.level = level; + s.strategy = strategy; + s.method = method; + return deflateReset(strm); + }; + var deflateInit = function deflateInit(strm, level) { + return deflateInit2(strm, level, Z_DEFLATED$1, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1); + }; + + /* ========================================================================= */ + var deflate$1 = function deflate(strm, flush) { + if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR; + } + var s = strm.state; + if (!strm.output || strm.avail_in !== 0 && !strm.input || s.status === FINISH_STATE && flush !== Z_FINISH$1) { + return err(strm, strm.avail_out === 0 ? Z_BUF_ERROR : Z_STREAM_ERROR); + } + var old_flush = s.last_flush; + s.last_flush = flush; + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK$1; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && flush !== Z_FINISH$1) { + return err(strm, Z_BUF_ERROR); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR); + } + + /* Write the header */ + if (s.status === INIT_STATE && s.wrap === 0) { + s.status = BUSY_STATE; + } + if (s.status === INIT_STATE) { + /* zlib header */ + var header = Z_DEFLATED$1 + (s.w_bits - 8 << 4) << 8; + var level_flags = -1; + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= level_flags << 6; + if (s.strstart !== 0) { + header |= PRESET_DICT; + } + header += 31 - header % 31; + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + //#ifdef GZIP + if (s.status === GZIP_STATE) { + /* gzip header */ + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { + // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } else { + put_byte(s, (s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (!s.gzhead.extra ? 0 : 4) + (!s.gzhead.name ? 0 : 8) + (!s.gzhead.comment ? 0 : 16)); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, s.gzhead.time >> 8 & 0xff); + put_byte(s, s.gzhead.time >> 16 & 0xff); + put_byte(s, s.gzhead.time >> 24 & 0xff); + put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, s.gzhead.extra.length >> 8 & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra /* != Z_NULL*/) { + var beg = s.pending; /* start of bytes to update crc */ + var left = (s.gzhead.extra.length & 0xffff) - s.gzindex; + while (s.pending + left > s.pending_buf_size) { + var copy = s.pending_buf_size - s.pending; + // zmemcpy(s.pending_buf + s.pending, + // s.gzhead.extra + s.gzindex, copy); + s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending); + s.pending = s.pending_buf_size; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex += copy; + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + beg = 0; + left -= copy; + } + // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility + // TypedArray.slice and TypedArray.from don't exist in IE10-IE11 + var gzhead_extra = new Uint8Array(s.gzhead.extra); + // zmemcpy(s->pending_buf + s->pending, + // s->gzhead->extra + s->gzindex, left); + s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending); + s.pending += left; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = NAME_STATE; + } + if (s.status === NAME_STATE) { + if (s.gzhead.name /* != Z_NULL*/) { + var _beg = s.pending; /* start of bytes to update crc */ + var val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg, _beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + _beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg, _beg); + } + //---// + s.gzindex = 0; + } + s.status = COMMENT_STATE; + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment /* != Z_NULL*/) { + var _beg2 = s.pending; /* start of bytes to update crc */ + var _val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg2) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg2, _beg2); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + _beg2 = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + _val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + _val = 0; + } + put_byte(s, _val); + } while (_val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > _beg2) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - _beg2, _beg2); + } + //---// + } + + s.status = HCRC_STATE; + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + put_byte(s, strm.adler & 0xff); + put_byte(s, strm.adler >> 8 & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + } + + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + //#endif + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || flush !== Z_NO_FLUSH$1 && s.status !== FINISH_STATE) { + var bstate = s.level === 0 ? deflate_stored(s, flush) : s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s.strategy === Z_RLE ? deflate_rle(s, flush) : configuration_table[s.level].func(s, flush); + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + + return Z_OK$1; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } else if (flush !== Z_BLOCK) { + /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH$1) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK$1; + } + } + } + if (flush !== Z_FINISH$1) { + return Z_OK$1; + } + if (s.wrap <= 0) { + return Z_STREAM_END$1; + } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, strm.adler >> 8 & 0xff); + put_byte(s, strm.adler >> 16 & 0xff); + put_byte(s, strm.adler >> 24 & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, strm.total_in >> 8 & 0xff); + put_byte(s, strm.total_in >> 16 & 0xff); + put_byte(s, strm.total_in >> 24 & 0xff); + } else { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { + s.wrap = -s.wrap; + } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK$1 : Z_STREAM_END$1; + }; + var deflateEnd = function deflateEnd(strm) { + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + var status = strm.state.status; + strm.state = null; + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK$1; + }; + + /* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ + var deflateSetDictionary = function deflateSetDictionary(strm, dictionary) { + var dictLength = dictionary.length; + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + var s = strm.state; + var wrap = s.wrap; + if (wrap === 2 || wrap === 1 && s.status !== INIT_STATE || s.lookahead) { + return Z_STREAM_ERROR; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0); + } + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { + /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + var tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + var avail = strm.avail_in; + var next = strm.next_in; + var input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + var str = s.strstart; + var n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK$1; + }; + var deflateInit_1 = deflateInit; + var deflateInit2_1 = deflateInit2; + var deflateReset_1 = deflateReset; + var deflateResetKeep_1 = deflateResetKeep; + var deflateSetHeader_1 = deflateSetHeader; + var deflate_2$1 = deflate$1; + var deflateEnd_1 = deflateEnd; + var deflateSetDictionary_1 = deflateSetDictionary; + var deflateInfo = 'pako deflate (from Nodeca project)'; + + /* Not implemented + module.exports.deflateBound = deflateBound; + module.exports.deflateCopy = deflateCopy; + module.exports.deflateGetDictionary = deflateGetDictionary; + module.exports.deflateParams = deflateParams; + module.exports.deflatePending = deflatePending; + module.exports.deflatePrime = deflatePrime; + module.exports.deflateTune = deflateTune; + */ + + var deflate_1$1 = { + deflateInit: deflateInit_1, + deflateInit2: deflateInit2_1, + deflateReset: deflateReset_1, + deflateResetKeep: deflateResetKeep_1, + deflateSetHeader: deflateSetHeader_1, + deflate: deflate_2$1, + deflateEnd: deflateEnd_1, + deflateSetDictionary: deflateSetDictionary_1, + deflateInfo: deflateInfo + }; + + function _typeof(obj) { + "@babel/helpers - typeof"; + + return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { + return typeof obj; + } : function (obj) { + return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; + }, _typeof(obj); + } + + var _has = function _has(obj, key) { + return Object.prototype.hasOwnProperty.call(obj, key); + }; + var assign = function assign(obj /*from1, from2, from3, ...*/) { + var sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + var source = sources.shift(); + if (!source) { + continue; + } + if (_typeof(source) !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + for (var p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + return obj; + }; + + // Join array of chunks to single array. + var flattenChunks = function flattenChunks(chunks) { + // calculate data length + var len = 0; + for (var i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + var result = new Uint8Array(len); + for (var _i = 0, pos = 0, _l = chunks.length; _i < _l; _i++) { + var chunk = chunks[_i]; + result.set(chunk, pos); + pos += chunk.length; + } + return result; + }; + var common = { + assign: assign, + flattenChunks: flattenChunks + }; + + // String encode/decode helpers + + // Quick check if we can use fast array to bin string conversion + // + // - apply(Array) can fail on Android 2.2 + // - apply(Uint8Array) can fail on iOS 5.1 Safari + // + var STR_APPLY_UIA_OK = true; + try { + String.fromCharCode.apply(null, new Uint8Array(1)); + } catch (__) { + STR_APPLY_UIA_OK = false; + } + + // Table with utf8 lengths (calculated by first byte of sequence) + // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, + // because max possible codepoint is 0x10ffff + var _utf8len = new Uint8Array(256); + for (var q = 0; q < 256; q++) { + _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1; + } + _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + // convert string to array (typed, when possible) + var string2buf = function string2buf(str) { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + var buf, + c, + c2, + m_pos, + i, + str_len = str.length, + buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | c >>> 6; + buf[i++] = 0x80 | c & 0x3f; + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | c >>> 12; + buf[i++] = 0x80 | c >>> 6 & 0x3f; + buf[i++] = 0x80 | c & 0x3f; + } else { + /* four bytes */ + buf[i++] = 0xf0 | c >>> 18; + buf[i++] = 0x80 | c >>> 12 & 0x3f; + buf[i++] = 0x80 | c >>> 6 & 0x3f; + buf[i++] = 0x80 | c & 0x3f; + } + } + return buf; + }; + + // Helper + var buf2binstring = function buf2binstring(buf, len) { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + var result = ''; + for (var i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; + }; + + // convert array to string + var buf2string = function buf2string(buf, max) { + var len = max || buf.length; + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + var i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len * 2); + for (out = 0, i = 0; i < len;) { + var c = buf[i++]; + // quick process ascii + if (c < 0x80) { + utf16buf[out++] = c; + continue; + } + var c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { + utf16buf[out++] = 0xfffd; + i += c_len - 1; + continue; + } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = c << 6 | buf[i++] & 0x3f; + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { + utf16buf[out++] = 0xfffd; + continue; + } + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff; + utf16buf[out++] = 0xdc00 | c & 0x3ff; + } + } + return buf2binstring(utf16buf, out); + }; + + // Calculate max possible position in utf8 buffer, + // that will not break sequence. If that's not possible + // - (very small limits) return max size as is. + // + // buf[] - utf8 bytes array + // max - length limit (mandatory); + var utf8border = function utf8border(buf, max) { + max = max || buf.length; + if (max > buf.length) { + max = buf.length; + } + + // go back from last position, until start of sequence found + var pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { + pos--; + } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { + return max; + } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { + return max; + } + return pos + _utf8len[buf[pos]] > max ? pos : max; + }; + var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = '' /*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2 /*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; + } + var zstream = ZStream; + + var toString = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_NO_FLUSH = constants$1.Z_NO_FLUSH, + Z_SYNC_FLUSH = constants$1.Z_SYNC_FLUSH, + Z_FULL_FLUSH = constants$1.Z_FULL_FLUSH, + Z_FINISH = constants$1.Z_FINISH, + Z_OK = constants$1.Z_OK, + Z_STREAM_END = constants$1.Z_STREAM_END, + Z_DEFAULT_COMPRESSION = constants$1.Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY = constants$1.Z_DEFAULT_STRATEGY, + Z_DEFLATED = constants$1.Z_DEFLATED; + + /* ===========================================================================*/ + + /** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + + /* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + + /** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + + /** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + /** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ + function Deflate(options) { + this.options = common.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + var opt = this.options; + if (opt.raw && opt.windowBits > 0) { + opt.windowBits = -opt.windowBits; + } else if (opt.gzip && opt.windowBits > 0 && opt.windowBits < 16) { + opt.windowBits += 16; + } + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + var status = deflate_1$1.deflateInit2(this.strm, opt.level, opt.method, opt.windowBits, opt.memLevel, opt.strategy); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + if (opt.header) { + deflate_1$1.deflateSetHeader(this.strm, opt.header); + } + if (opt.dictionary) { + var dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + status = deflate_1$1.deflateSetDictionary(this.strm, dict); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + this._dict_set = true; + } + } + + /** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Deflate.prototype.push = function (data, flush_mode) { + var strm = this.strm; + var chunkSize = this.options.chunkSize; + var status, _flush_mode; + if (this.ended) { + return false; + } + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + strm.next_in = 0; + strm.avail_in = strm.input.length; + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + status = deflate_1$1.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = deflate_1$1.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + if (strm.avail_in === 0) break; + } + return true; + }; + + /** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Deflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + /** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Deflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + this.result = common.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + /** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ + function deflate(input, options) { + var deflator = new Deflate(options); + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { + throw deflator.msg || messages[deflator.err]; + } + return deflator.result; + } + + /** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function deflateRaw(input, options) { + options = options || {}; + options.raw = true; + return deflate(input, options); + } + + /** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ + function gzip(input, options) { + options = options || {}; + options.gzip = true; + return deflate(input, options); + } + var Deflate_1 = Deflate; + var deflate_2 = deflate; + var deflateRaw_1 = deflateRaw; + var gzip_1 = gzip; + var constants = constants$1; + var deflate_1 = { + Deflate: Deflate_1, + deflate: deflate_2, + deflateRaw: deflateRaw_1, + gzip: gzip_1, + constants: constants + }; + + exports.Deflate = Deflate_1; + exports.constants = constants; + exports["default"] = deflate_1; + exports.deflate = deflate_2; + exports.deflateRaw = deflateRaw_1; + exports.gzip = gzip_1; + + Object.defineProperty(exports, '__esModule', { value: true }); + +})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.min.js b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.min.js new file mode 100644 index 0000000..5ae38b6 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.es5.min.js @@ -0,0 +1,2 @@ +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self).pako={})}(this,(function(t){"use strict";function e(t){for(var e=t.length;--e>=0;)t[e]=0}var a=256,r=286,n=30,i=15,s=new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]),_=new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]),h=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),o=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),l=new Array(576);e(l);var d=new Array(60);e(d);var u=new Array(512);e(u);var f=new Array(256);e(f);var c=new Array(29);e(c);var p,g,w,m=new Array(n);function b(t,e,a,r,n){this.static_tree=t,this.extra_bits=e,this.extra_base=a,this.elems=r,this.max_length=n,this.has_stree=t&&t.length}function v(t,e){this.dyn_tree=t,this.max_code=0,this.stat_desc=e}e(m);var y=function(t){return t<256?u[t]:u[256+(t>>>7)]},z=function(t,e){t.pending_buf[t.pending++]=255&e,t.pending_buf[t.pending++]=e>>>8&255},k=function(t,e,a){t.bi_valid>16-a?(t.bi_buf|=e<>16-t.bi_valid,t.bi_valid+=a-16):(t.bi_buf|=e<>>=1,a<<=1}while(--e>0);return a>>>1},E=function(t,e,a){var r,n,s=new Array(16),_=0;for(r=1;r<=i;r++)_=_+a[r-1]<<1,s[r]=_;for(n=0;n<=e;n++){var h=t[2*n+1];0!==h&&(t[2*n]=A(s[h]++,h))}},Z=function(t){var e;for(e=0;e8?z(t,t.bi_buf):t.bi_valid>0&&(t.pending_buf[t.pending++]=t.bi_buf),t.bi_buf=0,t.bi_valid=0},U=function(t,e,a,r){var n=2*e,i=2*a;return t[n]>1;a>=1;a--)R(t,s,a);n=o;do{a=t.heap[1],t.heap[1]=t.heap[t.heap_len--],R(t,s,1),r=t.heap[1],t.heap[--t.heap_max]=a,t.heap[--t.heap_max]=r,s[2*n]=s[2*a]+s[2*r],t.depth[n]=(t.depth[a]>=t.depth[r]?t.depth[a]:t.depth[r])+1,s[2*a+1]=s[2*r+1]=n,t.heap[1]=n++,R(t,s,1)}while(t.heap_len>=2);t.heap[--t.heap_max]=t.heap[1],function(t,e){var a,r,n,s,_,h,o=e.dyn_tree,l=e.max_code,d=e.stat_desc.static_tree,u=e.stat_desc.has_stree,f=e.stat_desc.extra_bits,c=e.stat_desc.extra_base,p=e.stat_desc.max_length,g=0;for(s=0;s<=i;s++)t.bl_count[s]=0;for(o[2*t.heap[t.heap_max]+1]=0,a=t.heap_max+1;a<573;a++)(s=o[2*o[2*(r=t.heap[a])+1]+1]+1)>p&&(s=p,g++),o[2*r+1]=s,r>l||(t.bl_count[s]++,_=0,r>=c&&(_=f[r-c]),h=o[2*r],t.opt_len+=h*(s+_),u&&(t.static_len+=h*(d[2*r+1]+_)));if(0!==g){do{for(s=p-1;0===t.bl_count[s];)s--;t.bl_count[s]--,t.bl_count[s+1]+=2,t.bl_count[p]--,g-=2}while(g>0);for(s=p;0!==s;s--)for(r=t.bl_count[s];0!==r;)(n=t.heap[--a])>l||(o[2*n+1]!==s&&(t.opt_len+=(s-o[2*n+1])*o[2*n],o[2*n+1]=s),r--)}}(t,e),E(s,l,t.bl_count)},F=function(t,e,a){var r,n,i=-1,s=e[1],_=0,h=7,o=4;for(0===s&&(h=138,o=3),e[2*(a+1)+1]=65535,r=0;r<=a;r++)n=s,s=e[2*(r+1)+1],++_0?(2===t.strm.data_type&&(t.strm.data_type=function(t){var e,r=4093624447;for(e=0;e<=31;e++,r>>>=1)if(1&r&&0!==t.dyn_ltree[2*e])return 0;if(0!==t.dyn_ltree[18]||0!==t.dyn_ltree[20]||0!==t.dyn_ltree[26])return 1;for(e=32;e=3&&0===t.bl_tree[2*o[e]+1];e--);return t.opt_len+=3*(e+1)+5+5+4,e}(t),i=t.opt_len+3+7>>>3,(s=t.static_len+3+7>>>3)<=i&&(i=s)):i=s=r+5,r+4<=i&&-1!==e?N(t,e,r,n):4===t.strategy||s===i?(k(t,2+(n?1:0),3),T(t,l,d)):(k(t,4+(n?1:0),3),function(t,e,a,r){var n;for(k(t,e-257,5),k(t,a-1,5),k(t,r-4,4),n=0;n>=7;o>8,t.pending_buf[t.sym_buf+t.sym_next++]=r,0===e?t.dyn_ltree[2*r]++:(t.matches++,e--,t.dyn_ltree[2*(f[r]+a+1)]++,t.dyn_dtree[2*y(e)]++),t.sym_next===t.sym_end},_tr_align:function(t){k(t,2,3),x(t,256,l),function(t){16===t.bi_valid?(z(t,t.bi_buf),t.bi_buf=0,t.bi_valid=0):t.bi_valid>=8&&(t.pending_buf[t.pending++]=255&t.bi_buf,t.bi_buf>>=8,t.bi_valid-=8)}(t)}},B=function(t,e,a,r){for(var n=65535&t|0,i=t>>>16&65535|0,s=0;0!==a;){a-=s=a>2e3?2e3:a;do{i=i+(n=n+e[r++]|0)|0}while(--s);n%=65521,i%=65521}return n|i<<16|0},H=new Uint32Array(function(){for(var t,e=[],a=0;a<256;a++){t=a;for(var r=0;r<8;r++)t=1&t?3988292384^t>>>1:t>>>1;e[a]=t}return e}()),M=function(t,e,a,r){var n=H,i=r+a;t^=-1;for(var s=r;s>>8^n[255&(t^e[s])];return-1^t},P={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},j={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8},K=C._tr_init,Y=C._tr_stored_block,G=C._tr_flush_block,X=C._tr_tally,W=C._tr_align,q=j.Z_NO_FLUSH,J=j.Z_PARTIAL_FLUSH,Q=j.Z_FULL_FLUSH,V=j.Z_FINISH,$=j.Z_BLOCK,tt=j.Z_OK,et=j.Z_STREAM_END,at=j.Z_STREAM_ERROR,rt=j.Z_DATA_ERROR,nt=j.Z_BUF_ERROR,it=j.Z_DEFAULT_COMPRESSION,st=j.Z_FILTERED,_t=j.Z_HUFFMAN_ONLY,ht=j.Z_RLE,ot=j.Z_FIXED,lt=j.Z_DEFAULT_STRATEGY,dt=j.Z_UNKNOWN,ut=j.Z_DEFLATED,ft=258,ct=262,pt=42,gt=113,wt=666,mt=function(t,e){return t.msg=P[e],e},bt=function(t){return 2*t-(t>4?9:0)},vt=function(t){for(var e=t.length;--e>=0;)t[e]=0},yt=function(t){var e,a,r,n=t.w_size;r=e=t.hash_size;do{a=t.head[--r],t.head[r]=a>=n?a-n:0}while(--e);r=e=n;do{a=t.prev[--r],t.prev[r]=a>=n?a-n:0}while(--e)},zt=function(t,e,a){return(e<t.avail_out&&(a=t.avail_out),0!==a&&(t.output.set(e.pending_buf.subarray(e.pending_out,e.pending_out+a),t.next_out),t.next_out+=a,e.pending_out+=a,t.total_out+=a,t.avail_out-=a,e.pending-=a,0===e.pending&&(e.pending_out=0))},xt=function(t,e){G(t,t.block_start>=0?t.block_start:-1,t.strstart-t.block_start,e),t.block_start=t.strstart,kt(t.strm)},At=function(t,e){t.pending_buf[t.pending++]=e},Et=function(t,e){t.pending_buf[t.pending++]=e>>>8&255,t.pending_buf[t.pending++]=255&e},Zt=function(t,e,a,r){var n=t.avail_in;return n>r&&(n=r),0===n?0:(t.avail_in-=n,e.set(t.input.subarray(t.next_in,t.next_in+n),a),1===t.state.wrap?t.adler=B(t.adler,e,n,a):2===t.state.wrap&&(t.adler=M(t.adler,e,n,a)),t.next_in+=n,t.total_in+=n,n)},St=function(t,e){var a,r,n=t.max_chain_length,i=t.strstart,s=t.prev_length,_=t.nice_match,h=t.strstart>t.w_size-ct?t.strstart-(t.w_size-ct):0,o=t.window,l=t.w_mask,d=t.prev,u=t.strstart+ft,f=o[i+s-1],c=o[i+s];t.prev_length>=t.good_match&&(n>>=2),_>t.lookahead&&(_=t.lookahead);do{if(o[(a=e)+s]===c&&o[a+s-1]===f&&o[a]===o[i]&&o[++a]===o[i+1]){i+=2,a++;do{}while(o[++i]===o[++a]&&o[++i]===o[++a]&&o[++i]===o[++a]&&o[++i]===o[++a]&&o[++i]===o[++a]&&o[++i]===o[++a]&&o[++i]===o[++a]&&o[++i]===o[++a]&&is){if(t.match_start=e,s=r,r>=_)break;f=o[i+s-1],c=o[i+s]}}}while((e=d[e&l])>h&&0!=--n);return s<=t.lookahead?s:t.lookahead},Ut=function(t){var e,a,r,n=t.w_size;do{if(a=t.window_size-t.lookahead-t.strstart,t.strstart>=n+(n-ct)&&(t.window.set(t.window.subarray(n,n+n-a),0),t.match_start-=n,t.strstart-=n,t.block_start-=n,t.insert>t.strstart&&(t.insert=t.strstart),yt(t),a+=n),0===t.strm.avail_in)break;if(e=Zt(t.strm,t.window,t.strstart+t.lookahead,a),t.lookahead+=e,t.lookahead+t.insert>=3)for(r=t.strstart-t.insert,t.ins_h=t.window[r],t.ins_h=zt(t,t.ins_h,t.window[r+1]);t.insert&&(t.ins_h=zt(t,t.ins_h,t.window[r+3-1]),t.prev[r&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=r,r++,t.insert--,!(t.lookahead+t.insert<3)););}while(t.lookaheadt.w_size?t.w_size:t.pending_buf_size-5,s=0,_=t.strm.avail_in;do{if(a=65535,n=t.bi_valid+42>>3,t.strm.avail_out(r=t.strstart-t.block_start)+t.strm.avail_in&&(a=r+t.strm.avail_in),a>n&&(a=n),a>8,t.pending_buf[t.pending-2]=~a,t.pending_buf[t.pending-1]=~a>>8,kt(t.strm),r&&(r>a&&(r=a),t.strm.output.set(t.window.subarray(t.block_start,t.block_start+r),t.strm.next_out),t.strm.next_out+=r,t.strm.avail_out-=r,t.strm.total_out+=r,t.block_start+=r,a-=r),a&&(Zt(t.strm,t.strm.output,t.strm.next_out,a),t.strm.next_out+=a,t.strm.avail_out-=a,t.strm.total_out+=a)}while(0===s);return(_-=t.strm.avail_in)&&(_>=t.w_size?(t.matches=2,t.window.set(t.strm.input.subarray(t.strm.next_in-t.w_size,t.strm.next_in),0),t.strstart=t.w_size,t.insert=t.strstart):(t.window_size-t.strstart<=_&&(t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,t.insert>t.strstart&&(t.insert=t.strstart)),t.window.set(t.strm.input.subarray(t.strm.next_in-_,t.strm.next_in),t.strstart),t.strstart+=_,t.insert+=_>t.w_size-t.insert?t.w_size-t.insert:_),t.block_start=t.strstart),t.high_watern&&t.block_start>=t.w_size&&(t.block_start-=t.w_size,t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,n+=t.w_size,t.insert>t.strstart&&(t.insert=t.strstart)),n>t.strm.avail_in&&(n=t.strm.avail_in),n&&(Zt(t.strm,t.window,t.strstart,n),t.strstart+=n,t.insert+=n>t.w_size-t.insert?t.w_size-t.insert:n),t.high_water>3,i=(n=t.pending_buf_size-n>65535?65535:t.pending_buf_size-n)>t.w_size?t.w_size:n,((r=t.strstart-t.block_start)>=i||(r||e===V)&&e!==q&&0===t.strm.avail_in&&r<=n)&&(a=r>n?n:r,s=e===V&&0===t.strm.avail_in&&a===r?1:0,Y(t,t.block_start,a,s),t.block_start+=a,kt(t.strm)),s?3:1)},Tt=function(t,e){for(var a,r;;){if(t.lookahead=3&&(t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),0!==a&&t.strstart-a<=t.w_size-ct&&(t.match_length=St(t,a)),t.match_length>=3)if(r=X(t,t.strstart-t.match_start,t.match_length-3),t.lookahead-=t.match_length,t.match_length<=t.max_lazy_match&&t.lookahead>=3){t.match_length--;do{t.strstart++,t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart}while(0!=--t.match_length);t.strstart++}else t.strstart+=t.match_length,t.match_length=0,t.ins_h=t.window[t.strstart],t.ins_h=zt(t,t.ins_h,t.window[t.strstart+1]);else r=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++;if(r&&(xt(t,!1),0===t.strm.avail_out))return 1}return t.insert=t.strstart<2?t.strstart:2,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2},Lt=function(t,e){for(var a,r,n;;){if(t.lookahead=3&&(t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),t.prev_length=t.match_length,t.prev_match=t.match_start,t.match_length=2,0!==a&&t.prev_length4096)&&(t.match_length=2)),t.prev_length>=3&&t.match_length<=t.prev_length){n=t.strstart+t.lookahead-3,r=X(t,t.strstart-1-t.prev_match,t.prev_length-3),t.lookahead-=t.prev_length-1,t.prev_length-=2;do{++t.strstart<=n&&(t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart)}while(0!=--t.prev_length);if(t.match_available=0,t.match_length=2,t.strstart++,r&&(xt(t,!1),0===t.strm.avail_out))return 1}else if(t.match_available){if((r=X(t,0,t.window[t.strstart-1]))&&xt(t,!1),t.strstart++,t.lookahead--,0===t.strm.avail_out)return 1}else t.match_available=1,t.strstart++,t.lookahead--}return t.match_available&&(r=X(t,0,t.window[t.strstart-1]),t.match_available=0),t.insert=t.strstart<2?t.strstart:2,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2};function Ft(t,e,a,r,n){this.good_length=t,this.max_lazy=e,this.nice_length=a,this.max_chain=r,this.func=n}var Ot=[new Ft(0,0,0,0,Rt),new Ft(4,4,8,4,Tt),new Ft(4,5,16,8,Tt),new Ft(4,6,32,32,Tt),new Ft(4,4,16,16,Lt),new Ft(8,16,32,32,Lt),new Ft(8,16,128,128,Lt),new Ft(8,32,128,256,Lt),new Ft(32,128,258,1024,Lt),new Ft(32,258,258,4096,Lt)];function Dt(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=ut,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(1146),this.dyn_dtree=new Uint16Array(122),this.bl_tree=new Uint16Array(78),vt(this.dyn_ltree),vt(this.dyn_dtree),vt(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(16),this.heap=new Uint16Array(573),vt(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(573),vt(this.depth),this.sym_buf=0,this.lit_bufsize=0,this.sym_next=0,this.sym_end=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}var Nt=function(t){if(!t)return 1;var e=t.state;return!e||e.strm!==t||e.status!==pt&&57!==e.status&&69!==e.status&&73!==e.status&&91!==e.status&&103!==e.status&&e.status!==gt&&e.status!==wt?1:0},It=function(t){if(Nt(t))return mt(t,at);t.total_in=t.total_out=0,t.data_type=dt;var e=t.state;return e.pending=0,e.pending_out=0,e.wrap<0&&(e.wrap=-e.wrap),e.status=2===e.wrap?57:e.wrap?pt:gt,t.adler=2===e.wrap?0:1,e.last_flush=-2,K(e),tt},Ct=function(t){var e,a=It(t);return a===tt&&((e=t.state).window_size=2*e.w_size,vt(e.head),e.max_lazy_match=Ot[e.level].max_lazy,e.good_match=Ot[e.level].good_length,e.nice_match=Ot[e.level].nice_length,e.max_chain_length=Ot[e.level].max_chain,e.strstart=0,e.block_start=0,e.lookahead=0,e.insert=0,e.match_length=e.prev_length=2,e.match_available=0,e.ins_h=0),a},Bt=function(t,e,a,r,n,i){if(!t)return at;var s=1;if(e===it&&(e=6),r<0?(s=0,r=-r):r>15&&(s=2,r-=16),n<1||n>9||a!==ut||r<8||r>15||e<0||e>9||i<0||i>ot||8===r&&1!==s)return mt(t,at);8===r&&(r=9);var _=new Dt;return t.state=_,_.strm=t,_.status=pt,_.wrap=s,_.gzhead=null,_.w_bits=r,_.w_size=1<<_.w_bits,_.w_mask=_.w_size-1,_.hash_bits=n+7,_.hash_size=1<<_.hash_bits,_.hash_mask=_.hash_size-1,_.hash_shift=~~((_.hash_bits+3-1)/3),_.window=new Uint8Array(2*_.w_size),_.head=new Uint16Array(_.hash_size),_.prev=new Uint16Array(_.w_size),_.lit_bufsize=1<$||e<0)return t?mt(t,at):at;var a=t.state;if(!t.output||0!==t.avail_in&&!t.input||a.status===wt&&e!==V)return mt(t,0===t.avail_out?nt:at);var r=a.last_flush;if(a.last_flush=e,0!==a.pending){if(kt(t),0===t.avail_out)return a.last_flush=-1,tt}else if(0===t.avail_in&&bt(e)<=bt(r)&&e!==V)return mt(t,nt);if(a.status===wt&&0!==t.avail_in)return mt(t,nt);if(a.status===pt&&0===a.wrap&&(a.status=gt),a.status===pt){var n=ut+(a.w_bits-8<<4)<<8;if(n|=(a.strategy>=_t||a.level<2?0:a.level<6?1:6===a.level?2:3)<<6,0!==a.strstart&&(n|=32),Et(a,n+=31-n%31),0!==a.strstart&&(Et(a,t.adler>>>16),Et(a,65535&t.adler)),t.adler=1,a.status=gt,kt(t),0!==a.pending)return a.last_flush=-1,tt}if(57===a.status)if(t.adler=0,At(a,31),At(a,139),At(a,8),a.gzhead)At(a,(a.gzhead.text?1:0)+(a.gzhead.hcrc?2:0)+(a.gzhead.extra?4:0)+(a.gzhead.name?8:0)+(a.gzhead.comment?16:0)),At(a,255&a.gzhead.time),At(a,a.gzhead.time>>8&255),At(a,a.gzhead.time>>16&255),At(a,a.gzhead.time>>24&255),At(a,9===a.level?2:a.strategy>=_t||a.level<2?4:0),At(a,255&a.gzhead.os),a.gzhead.extra&&a.gzhead.extra.length&&(At(a,255&a.gzhead.extra.length),At(a,a.gzhead.extra.length>>8&255)),a.gzhead.hcrc&&(t.adler=M(t.adler,a.pending_buf,a.pending,0)),a.gzindex=0,a.status=69;else if(At(a,0),At(a,0),At(a,0),At(a,0),At(a,0),At(a,9===a.level?2:a.strategy>=_t||a.level<2?4:0),At(a,3),a.status=gt,kt(t),0!==a.pending)return a.last_flush=-1,tt;if(69===a.status){if(a.gzhead.extra){for(var i=a.pending,s=(65535&a.gzhead.extra.length)-a.gzindex;a.pending+s>a.pending_buf_size;){var _=a.pending_buf_size-a.pending;if(a.pending_buf.set(a.gzhead.extra.subarray(a.gzindex,a.gzindex+_),a.pending),a.pending=a.pending_buf_size,a.gzhead.hcrc&&a.pending>i&&(t.adler=M(t.adler,a.pending_buf,a.pending-i,i)),a.gzindex+=_,kt(t),0!==a.pending)return a.last_flush=-1,tt;i=0,s-=_}var h=new Uint8Array(a.gzhead.extra);a.pending_buf.set(h.subarray(a.gzindex,a.gzindex+s),a.pending),a.pending+=s,a.gzhead.hcrc&&a.pending>i&&(t.adler=M(t.adler,a.pending_buf,a.pending-i,i)),a.gzindex=0}a.status=73}if(73===a.status){if(a.gzhead.name){var o,l=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>l&&(t.adler=M(t.adler,a.pending_buf,a.pending-l,l)),kt(t),0!==a.pending)return a.last_flush=-1,tt;l=0}o=a.gzindexl&&(t.adler=M(t.adler,a.pending_buf,a.pending-l,l)),a.gzindex=0}a.status=91}if(91===a.status){if(a.gzhead.comment){var d,u=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>u&&(t.adler=M(t.adler,a.pending_buf,a.pending-u,u)),kt(t),0!==a.pending)return a.last_flush=-1,tt;u=0}d=a.gzindexu&&(t.adler=M(t.adler,a.pending_buf,a.pending-u,u))}a.status=103}if(103===a.status){if(a.gzhead.hcrc){if(a.pending+2>a.pending_buf_size&&(kt(t),0!==a.pending))return a.last_flush=-1,tt;At(a,255&t.adler),At(a,t.adler>>8&255),t.adler=0}if(a.status=gt,kt(t),0!==a.pending)return a.last_flush=-1,tt}if(0!==t.avail_in||0!==a.lookahead||e!==q&&a.status!==wt){var f=0===a.level?Rt(a,e):a.strategy===_t?function(t,e){for(var a;;){if(0===t.lookahead&&(Ut(t),0===t.lookahead)){if(e===q)return 1;break}if(t.match_length=0,a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++,a&&(xt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2}(a,e):a.strategy===ht?function(t,e){for(var a,r,n,i,s=t.window;;){if(t.lookahead<=ft){if(Ut(t),t.lookahead<=ft&&e===q)return 1;if(0===t.lookahead)break}if(t.match_length=0,t.lookahead>=3&&t.strstart>0&&(r=s[n=t.strstart-1])===s[++n]&&r===s[++n]&&r===s[++n]){i=t.strstart+ft;do{}while(r===s[++n]&&r===s[++n]&&r===s[++n]&&r===s[++n]&&r===s[++n]&&r===s[++n]&&r===s[++n]&&r===s[++n]&&nt.lookahead&&(t.match_length=t.lookahead)}if(t.match_length>=3?(a=X(t,1,t.match_length-3),t.lookahead-=t.match_length,t.strstart+=t.match_length,t.match_length=0):(a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++),a&&(xt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2}(a,e):Ot[a.level].func(a,e);if(3!==f&&4!==f||(a.status=wt),1===f||3===f)return 0===t.avail_out&&(a.last_flush=-1),tt;if(2===f&&(e===J?W(a):e!==$&&(Y(a,0,0,!1),e===Q&&(vt(a.head),0===a.lookahead&&(a.strstart=0,a.block_start=0,a.insert=0))),kt(t),0===t.avail_out))return a.last_flush=-1,tt}return e!==V?tt:a.wrap<=0?et:(2===a.wrap?(At(a,255&t.adler),At(a,t.adler>>8&255),At(a,t.adler>>16&255),At(a,t.adler>>24&255),At(a,255&t.total_in),At(a,t.total_in>>8&255),At(a,t.total_in>>16&255),At(a,t.total_in>>24&255)):(Et(a,t.adler>>>16),Et(a,65535&t.adler)),kt(t),a.wrap>0&&(a.wrap=-a.wrap),0!==a.pending?tt:et)},deflateEnd:function(t){if(Nt(t))return at;var e=t.state.status;return t.state=null,e===gt?mt(t,rt):tt},deflateSetDictionary:function(t,e){var a=e.length;if(Nt(t))return at;var r=t.state,n=r.wrap;if(2===n||1===n&&r.status!==pt||r.lookahead)return at;if(1===n&&(t.adler=B(t.adler,e,a,0)),r.wrap=0,a>=r.w_size){0===n&&(vt(r.head),r.strstart=0,r.block_start=0,r.insert=0);var i=new Uint8Array(r.w_size);i.set(e.subarray(a-r.w_size,a),0),e=i,a=r.w_size}var s=t.avail_in,_=t.next_in,h=t.input;for(t.avail_in=a,t.next_in=0,t.input=e,Ut(r);r.lookahead>=3;){var o=r.strstart,l=r.lookahead-2;do{r.ins_h=zt(r,r.ins_h,r.window[o+3-1]),r.prev[o&r.w_mask]=r.head[r.ins_h],r.head[r.ins_h]=o,o++}while(--l);r.strstart=o,r.lookahead=2,Ut(r)}return r.strstart+=r.lookahead,r.block_start=r.strstart,r.insert=r.lookahead,r.lookahead=0,r.match_length=r.prev_length=2,r.match_available=0,t.next_in=_,t.input=h,t.avail_in=s,r.wrap=n,tt},deflateInfo:"pako deflate (from Nodeca project)"};function Mt(t){return Mt="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},Mt(t)}var Pt=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},jt=function(t){for(var e=Array.prototype.slice.call(arguments,1);e.length;){var a=e.shift();if(a){if("object"!==Mt(a))throw new TypeError(a+"must be non-object");for(var r in a)Pt(a,r)&&(t[r]=a[r])}}return t},Kt=function(t){for(var e=0,a=0,r=t.length;a=252?6:Gt>=248?5:Gt>=240?4:Gt>=224?3:Gt>=192?2:1;Yt[254]=Yt[254]=1;var Xt=function(t){if("function"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(t);var e,a,r,n,i,s=t.length,_=0;for(n=0;n>>6,e[i++]=128|63&a):a<65536?(e[i++]=224|a>>>12,e[i++]=128|a>>>6&63,e[i++]=128|63&a):(e[i++]=240|a>>>18,e[i++]=128|a>>>12&63,e[i++]=128|a>>>6&63,e[i++]=128|63&a);return e};var Wt=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0},qt=Object.prototype.toString,Jt=j.Z_NO_FLUSH,Qt=j.Z_SYNC_FLUSH,Vt=j.Z_FULL_FLUSH,$t=j.Z_FINISH,te=j.Z_OK,ee=j.Z_STREAM_END,ae=j.Z_DEFAULT_COMPRESSION,re=j.Z_DEFAULT_STRATEGY,ne=j.Z_DEFLATED;function ie(t){this.options=jt({level:ae,method:ne,chunkSize:16384,windowBits:15,memLevel:8,strategy:re},t||{});var e=this.options;e.raw&&e.windowBits>0?e.windowBits=-e.windowBits:e.gzip&&e.windowBits>0&&e.windowBits<16&&(e.windowBits+=16),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new Wt,this.strm.avail_out=0;var a=Ht.deflateInit2(this.strm,e.level,e.method,e.windowBits,e.memLevel,e.strategy);if(a!==te)throw new Error(P[a]);if(e.header&&Ht.deflateSetHeader(this.strm,e.header),e.dictionary){var r;if(r="string"==typeof e.dictionary?Xt(e.dictionary):"[object ArrayBuffer]"===qt.call(e.dictionary)?new Uint8Array(e.dictionary):e.dictionary,(a=Ht.deflateSetDictionary(this.strm,r))!==te)throw new Error(P[a]);this._dict_set=!0}}function se(t,e){var a=new ie(e);if(a.push(t,!0),a.err)throw a.msg||P[a.err];return a.result}ie.prototype.push=function(t,e){var a,r,n=this.strm,i=this.options.chunkSize;if(this.ended)return!1;for(r=e===~~e?e:!0===e?$t:Jt,"string"==typeof t?n.input=Xt(t):"[object ArrayBuffer]"===qt.call(t)?n.input=new Uint8Array(t):n.input=t,n.next_in=0,n.avail_in=n.input.length;;)if(0===n.avail_out&&(n.output=new Uint8Array(i),n.next_out=0,n.avail_out=i),(r===Qt||r===Vt)&&n.avail_out<=6)this.onData(n.output.subarray(0,n.next_out)),n.avail_out=0;else{if((a=Ht.deflate(n,r))===ee)return n.next_out>0&&this.onData(n.output.subarray(0,n.next_out)),a=Ht.deflateEnd(this.strm),this.onEnd(a),this.ended=!0,a===te;if(0!==n.avail_out){if(r>0&&n.next_out>0)this.onData(n.output.subarray(0,n.next_out)),n.avail_out=0;else if(0===n.avail_in)break}else this.onData(n.output)}return!0},ie.prototype.onData=function(t){this.chunks.push(t)},ie.prototype.onEnd=function(t){t===te&&(this.result=Kt(this.chunks)),this.chunks=[],this.err=t,this.msg=this.strm.msg};var _e=ie,he=se,oe=function(t,e){return(e=e||{}).raw=!0,se(t,e)},le=function(t,e){return(e=e||{}).gzip=!0,se(t,e)},de=j,ue={Deflate:_e,deflate:he,deflateRaw:oe,gzip:le,constants:de};t.Deflate=_e,t.constants=de,t.default=ue,t.deflate=he,t.deflateRaw=oe,t.gzip=le,Object.defineProperty(t,"__esModule",{value:!0})})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.js b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.js new file mode 100644 index 0000000..19c3e15 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.js @@ -0,0 +1,4126 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +(function (global, factory) { + typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : + typeof define === 'function' && define.amd ? define(['exports'], factory) : + (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.pako = {})); +})(this, (function (exports) { 'use strict'; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + /* eslint-disable space-unary-ops */ + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + + //const Z_FILTERED = 1; + //const Z_HUFFMAN_ONLY = 2; + //const Z_RLE = 3; + const Z_FIXED$1 = 4; + //const Z_DEFAULT_STRATEGY = 0; + + /* Possible values of the data_type field (though see inflate()) */ + const Z_BINARY = 0; + const Z_TEXT = 1; + //const Z_ASCII = 1; // = Z_TEXT + const Z_UNKNOWN$1 = 2; + + /*============================================================================*/ + + + function zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } } + + // From zutil.h + + const STORED_BLOCK = 0; + const STATIC_TREES = 1; + const DYN_TREES = 2; + /* The three kinds of block type */ + + const MIN_MATCH$1 = 3; + const MAX_MATCH$1 = 258; + /* The minimum and maximum match lengths */ + + // From deflate.h + /* =========================================================================== + * Internal compression state. + */ + + const LENGTH_CODES$1 = 29; + /* number of length codes, not counting the special END_BLOCK code */ + + const LITERALS$1 = 256; + /* number of literal bytes 0..255 */ + + const L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1; + /* number of Literal or Length codes, including the END_BLOCK code */ + + const D_CODES$1 = 30; + /* number of distance codes */ + + const BL_CODES$1 = 19; + /* number of codes used to transfer the bit lengths */ + + const HEAP_SIZE$1 = 2 * L_CODES$1 + 1; + /* maximum heap size */ + + const MAX_BITS$1 = 15; + /* All codes must not exceed MAX_BITS bits */ + + const Buf_size = 16; + /* size of bit buffer in bi_buf */ + + + /* =========================================================================== + * Constants + */ + + const MAX_BL_BITS = 7; + /* Bit length codes must not exceed MAX_BL_BITS bits */ + + const END_BLOCK = 256; + /* end of block literal code */ + + const REP_3_6 = 16; + /* repeat previous bit length 3-6 times (2 bits of repeat count) */ + + const REPZ_3_10 = 17; + /* repeat a zero length 3-10 times (3 bits of repeat count) */ + + const REPZ_11_138 = 18; + /* repeat a zero length 11-138 times (7 bits of repeat count) */ + + /* eslint-disable comma-spacing,array-bracket-spacing */ + const extra_lbits = /* extra bits for each length code */ + new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]); + + const extra_dbits = /* extra bits for each distance code */ + new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]); + + const extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]); + + const bl_order = + new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]); + /* eslint-enable comma-spacing,array-bracket-spacing */ + + /* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + + /* =========================================================================== + * Local data. These are initialized only once. + */ + + // We pre-fill arrays with 0 to avoid uninitialized gaps + + const DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + + // !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 + const static_ltree = new Array((L_CODES$1 + 2) * 2); + zero$1(static_ltree); + /* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + + const static_dtree = new Array(D_CODES$1 * 2); + zero$1(static_dtree); + /* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + + const _dist_code = new Array(DIST_CODE_LEN); + zero$1(_dist_code); + /* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + + const _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1); + zero$1(_length_code); + /* length code for each normalized match length (0 == MIN_MATCH) */ + + const base_length = new Array(LENGTH_CODES$1); + zero$1(base_length); + /* First normalized length for each code (0 = MIN_MATCH) */ + + const base_dist = new Array(D_CODES$1); + zero$1(base_dist); + /* First normalized distance for each code (0 = distance of 1) */ + + + function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; + } + + + let static_l_desc; + let static_d_desc; + let static_bl_desc; + + + function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ + } + + + + const d_code = (dist) => { + + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; + }; + + + /* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ + const put_short = (s, w) => { + // put_byte(s, (uch)((w) & 0xff)); + // put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = (w) & 0xff; + s.pending_buf[s.pending++] = (w >>> 8) & 0xff; + }; + + + /* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ + const send_bits = (s, value, length) => { + + if (s.bi_valid > (Buf_size - length)) { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> (Buf_size - s.bi_valid); + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + s.bi_valid += length; + } + }; + + + const send_code = (s, c, tree) => { + + send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); + }; + + + /* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ + const bi_reverse = (code, len) => { + + let res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; + }; + + + /* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ + const bi_flush = (s) => { + + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } + }; + + + /* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ + const gen_bitlen = (s, desc) => { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const max_code = desc.max_code; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const extra = desc.stat_desc.extra_bits; + const base = desc.stat_desc.extra_base; + const max_length = desc.stat_desc.max_length; + let h; /* heap index */ + let n, m; /* iterate over the tree elements */ + let bits; /* bit length */ + let xbits; /* extra bits */ + let f; /* frequency */ + let overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS$1; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1]/*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { continue; } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2]/*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); + } + } + if (overflow === 0) { return; } + + // Tracev((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { bits--; } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { continue; } + if (tree[m * 2 + 1]/*.Len*/ !== bits) { + // Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; + tree[m * 2 + 1]/*.Len*/ = bits; + } + n--; + } + } + }; + + + /* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ + const gen_codes = (tree, max_code, bl_count) => { + // ct_data *tree; /* the tree to decorate */ + // int max_code; /* largest code with non zero frequency */ + // ushf *bl_count; /* number of codes at each bit length */ + + const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */ + let code = 0; /* running code value */ + let bits; /* bit index */ + let n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS$1; bits++) { + code = (code + bl_count[bits - 1]) << 1; + next_code[bits] = code; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< { + + let n; /* iterates over tree elements */ + let bits; /* bit counter */ + let length; /* length value */ + let code; /* code value */ + let dist; /* distance index */ + const bl_count = new Array(MAX_BITS$1 + 1); + /* number of codes at each bit length for an optimal tree */ + + // do check in _tr_init() + //if (static_init_done) return; + + /* For some embedded targets, global variables are not initialized: */ + /*#ifdef NO_INIT_GLOBAL_POINTERS + static_l_desc.static_tree = static_ltree; + static_l_desc.extra_bits = extra_lbits; + static_d_desc.static_tree = static_dtree; + static_d_desc.extra_bits = extra_dbits; + static_bl_desc.extra_bits = extra_blbits; + #endif*/ + + /* Initialize the mapping length (0..255) -> length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES$1 - 1; code++) { + base_length[code] = length; + for (n = 0; n < (1 << extra_lbits[code]); n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1 << extra_dbits[code]); n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES$1; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS$1; bits++) { + bl_count[bits] = 0; + } + + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1]/*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1]/*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES$1 + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES$1; n++) { + static_dtree[n * 2 + 1]/*.Len*/ = 5; + static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS); + + //static_init_done = true; + }; + + + /* =========================================================================== + * Initialize a new block. + */ + const init_block = (s) => { + + let n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } + + s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.sym_next = s.matches = 0; + }; + + + /* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ + const bi_windup = (s) => + { + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; + }; + + /* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ + const smaller = (tree, n, m, depth) => { + + const _n2 = n * 2; + const _m2 = m * 2; + return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || + (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); + }; + + /* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ + const pqdownheap = (s, tree, k) => { + // deflate_state *s; + // ct_data *tree; /* the tree to restore */ + // int k; /* node to move down */ + + const v = s.heap[k]; + let j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && + smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { break; } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; + }; + + + // inlined manually + // const SMALLEST = 1; + + /* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ + const compress_block = (s, ltree, dtree) => { + // deflate_state *s; + // const ct_data *ltree; /* literal tree */ + // const ct_data *dtree; /* distance tree */ + + let dist; /* distance of matched string */ + let lc; /* match length or unmatched char (if dist == 0) */ + let sx = 0; /* running index in sym_buf */ + let code; /* the code to send */ + let extra; /* number of extra bits to send */ + + if (s.sym_next !== 0) { + do { + dist = s.pending_buf[s.sym_buf + sx++] & 0xff; + dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8; + lc = s.pending_buf[s.sym_buf + sx++]; + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and sym_buf is ok: */ + //Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow"); + + } while (sx < s.sym_next); + } + + send_code(s, END_BLOCK, ltree); + }; + + + /* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ + const build_tree = (s, desc) => { + // deflate_state *s; + // tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const elems = desc.stat_desc.elems; + let n, m; /* iterate over heap elements */ + let max_code = -1; /* largest code with non zero frequency */ + let node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE$1; + + for (n = 0; n < elems; n++) { + if (tree[n * 2]/*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + + } else { + tree[n * 2 + 1]/*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); + tree[node * 2]/*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + + if (has_stree) { + s.static_len -= stree[node * 2 + 1]/*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1/*SMALLEST*/]; + s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1/*SMALLEST*/); + /***/ + + m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1/*SMALLEST*/] = node++; + pqdownheap(s, tree, 1/*SMALLEST*/); + + } while (s.heap_len >= 2); + + s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); + }; + + + /* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ + const scan_tree = (s, tree, max_code) => { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + s.bl_tree[curlen * 2]/*.Freq*/ += count; + + } else if (curlen !== 0) { + + if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } + s.bl_tree[REP_3_6 * 2]/*.Freq*/++; + + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; + + } else { + s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; + } + + count = 0; + prevlen = curlen; + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } + }; + + + /* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ + const send_tree = (s, tree, max_code) => { + // deflate_state *s; + // ct_data *tree; /* the tree to be scanned */ + // int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); + + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } + }; + + + /* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ + const build_bl_tree = (s) => { + + let max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; + }; + + + /* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ + const send_all_trees = (s, lcodes, dcodes, blcodes) => { + // deflate_state *s; + // int lcodes, dcodes, blcodes; /* number of codes for each tree */ + + let rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); + }; + + + /* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "block list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ + const detect_data_type = (s) => { + /* block_mask is the bit mask of block-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + let block_mask = 0xf3ffc07f; + let n; + + /* Check for non-textual ("block-listed") bytes. */ + for (n = 0; n <= 31; n++, block_mask >>>= 1) { + if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { + return Z_BINARY; + } + } + + /* Check for textual ("allow-listed") bytes. */ + if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || + s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS$1; n++) { + if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "block-listed" or "allow-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; + }; + + + let static_init_done = false; + + /* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ + const _tr_init$1 = (s) => + { + + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); + }; + + + /* =========================================================================== + * Send a stored block + */ + const _tr_stored_block$1 = (s, buf, stored_len, last) => { + //DeflateState *s; + //charf *buf; /* input block */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + bi_windup(s); /* align on byte boundary */ + put_short(s, stored_len); + put_short(s, ~stored_len); + if (stored_len) { + s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending); + } + s.pending += stored_len; + }; + + + /* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ + const _tr_align$1 = (s) => { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); + }; + + + /* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and write out the encoded block. + */ + const _tr_flush_block$1 = (s, buf, stored_len, last) => { + //DeflateState *s; + //charf *buf; /* input block, or NULL if too old */ + //ulg stored_len; /* length of input block */ + //int last; /* one if this is the last block for a file */ + + let opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + let max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN$1) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = (s.opt_len + 3 + 7) >>> 3; + static_lenb = (s.static_len + 3 + 7) >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->sym_next / 3)); + + if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } + + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block$1(s, buf, stored_len, last); + + } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) { + + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); + }; + + /* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ + const _tr_tally$1 = (s, dist, lc) => { + // deflate_state *s; + // unsigned dist; /* distance of matched string */ + // unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ + + s.pending_buf[s.sym_buf + s.sym_next++] = dist; + s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8; + s.pending_buf[s.sym_buf + s.sym_next++] = lc; + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2]/*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; + } + + return (s.sym_next === s.sym_end); + }; + + var _tr_init_1 = _tr_init$1; + var _tr_stored_block_1 = _tr_stored_block$1; + var _tr_flush_block_1 = _tr_flush_block$1; + var _tr_tally_1 = _tr_tally$1; + var _tr_align_1 = _tr_align$1; + + var trees = { + _tr_init: _tr_init_1, + _tr_stored_block: _tr_stored_block_1, + _tr_flush_block: _tr_flush_block_1, + _tr_tally: _tr_tally_1, + _tr_align: _tr_align_1 + }; + + // Note: adler32 takes 12% for level 0 and 2% for level 6. + // It isn't worth it to make additional optimizations as in original. + // Small size is preferable. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const adler32 = (adler, buf, len, pos) => { + let s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; + }; + + + var adler32_1 = adler32; + + // Note: we can't get significant speed boost here. + // So write code to minimize size - no pregenerated tables + // and array tools dependencies. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // Use ordinary array, since untyped makes no boost here + const makeTable = () => { + let c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; + }; + + // Create table on load. Just 255 signed longs. Not a problem. + const crcTable = new Uint32Array(makeTable()); + + + const crc32 = (crc, buf, len, pos) => { + const t = crcTable; + const end = pos + len; + + crc ^= -1; + + for (let i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; + }; + + + var crc32_1 = crc32; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var messages = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var constants$1 = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees; + + + + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_NO_FLUSH: Z_NO_FLUSH$1, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$1, Z_BLOCK, + Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_STREAM_ERROR, Z_DATA_ERROR, Z_BUF_ERROR, + Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1, + Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1, + Z_UNKNOWN, + Z_DEFLATED: Z_DEFLATED$1 + } = constants$1; + + /*============================================================================*/ + + + const MAX_MEM_LEVEL = 9; + /* Maximum value for memLevel in deflateInit2 */ + const MAX_WBITS = 15; + /* 32K LZ77 window */ + const DEF_MEM_LEVEL = 8; + + + const LENGTH_CODES = 29; + /* number of length codes, not counting the special END_BLOCK code */ + const LITERALS = 256; + /* number of literal bytes 0..255 */ + const L_CODES = LITERALS + 1 + LENGTH_CODES; + /* number of Literal or Length codes, including the END_BLOCK code */ + const D_CODES = 30; + /* number of distance codes */ + const BL_CODES = 19; + /* number of codes used to transfer the bit lengths */ + const HEAP_SIZE = 2 * L_CODES + 1; + /* maximum heap size */ + const MAX_BITS = 15; + /* All codes must not exceed MAX_BITS bits */ + + const MIN_MATCH = 3; + const MAX_MATCH = 258; + const MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); + + const PRESET_DICT = 0x20; + + const INIT_STATE = 42; /* zlib header -> BUSY_STATE */ + //#ifdef GZIP + const GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */ + //#endif + const EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */ + const NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */ + const COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */ + const HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */ + const BUSY_STATE = 113; /* deflate -> FINISH_STATE */ + const FINISH_STATE = 666; /* stream complete */ + + const BS_NEED_MORE = 1; /* block not completed, need more input or more output */ + const BS_BLOCK_DONE = 2; /* block flush performed */ + const BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ + const BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + + const OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + + const err = (strm, errorCode) => { + strm.msg = messages[errorCode]; + return errorCode; + }; + + const rank = (f) => { + return ((f) * 2) - ((f) > 4 ? 9 : 0); + }; + + const zero = (buf) => { + let len = buf.length; while (--len >= 0) { buf[len] = 0; } + }; + + /* =========================================================================== + * Slide the hash table when sliding the window down (could be avoided with 32 + * bit values at the expense of memory usage). We slide even when level == 0 to + * keep the hash table consistent if we switch back to level > 0 later. + */ + const slide_hash = (s) => { + let n, m; + let p; + let wsize = s.w_size; + + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = (m >= wsize ? m - wsize : 0); + } while (--n); + n = wsize; + //#ifndef FASTEST + p = n; + do { + m = s.prev[--p]; + s.prev[p] = (m >= wsize ? m - wsize : 0); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); + //#endif + }; + + /* eslint-disable new-cap */ + let HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask; + // This hash causes less collisions, https://github.com/nodeca/pako/issues/135 + // But breaks binary compatibility + //let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; + let HASH = HASH_ZLIB; + + + /* ========================================================================= + * Flush as much pending output as possible. All deflate() output, except for + * some deflate_stored() output, goes through this function so some + * applications may wish to modify it to avoid allocating a large + * strm->next_out buffer and copying into it. (See also read_buf()). + */ + const flush_pending = (strm) => { + const s = strm.state; + + //_tr_flush_bits(s); + let len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { return; } + + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } + }; + + + const flush_block_only = (s, last) => { + _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); + }; + + + const put_byte = (s, b) => { + s.pending_buf[s.pending++] = b; + }; + + + /* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ + const putShortMSB = (s, b) => { + + // put_byte(s, (Byte)(b >> 8)); + // put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = (b >>> 8) & 0xff; + s.pending_buf[s.pending++] = b & 0xff; + }; + + + /* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ + const read_buf = (strm, buf, start, size) => { + + let len = strm.avail_in; + + if (len > size) { len = size; } + if (len === 0) { return 0; } + + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32_1(strm.adler, buf, len, start); + } + + else if (strm.state.wrap === 2) { + strm.adler = crc32_1(strm.adler, buf, len, start); + } + + strm.next_in += len; + strm.total_in += len; + + return len; + }; + + + /* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ + const longest_match = (s, cur_match) => { + + let chain_length = s.max_chain_length; /* max hash chain length */ + let scan = s.strstart; /* current string */ + let match; /* matched string */ + let len; /* length of current match */ + let best_len = s.prev_length; /* best match length so far */ + let nice_match = s.nice_match; /* stop if match long enough */ + const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? + s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; + + const _win = s.window; // shortcut + + const wmask = s.w_mask; + const prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + const strend = s.strstart + MAX_MATCH; + let scan_end1 = _win[scan + best_len - 1]; + let scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { nice_match = s.lookahead; } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || + _win[match + best_len - 1] !== scan_end1 || + _win[match] !== _win[scan] || + _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; + }; + + + /* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ + const fill_window = (s) => { + + const _w_size = s.w_size; + let n, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + + s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + slide_hash(s); + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); + //#if MIN_MATCH != 3 + // Call update_hash() MIN_MATCH-3 more times + //#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ + // if (s.high_water < s.window_size) { + // const curr = s.strstart + s.lookahead; + // let init = 0; + // + // if (s.high_water < curr) { + // /* Previous high water mark below current data -- zero WIN_INIT + // * bytes or up to end of window, whichever is less. + // */ + // init = s.window_size - curr; + // if (init > WIN_INIT) + // init = WIN_INIT; + // zmemzero(s->window + curr, (unsigned)init); + // s->high_water = curr + init; + // } + // else if (s->high_water < (ulg)curr + WIN_INIT) { + // /* High water mark at or above current data, but below current data + // * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up + // * to end of window, whichever is less. + // */ + // init = (ulg)curr + WIN_INIT - s->high_water; + // if (init > s->window_size - s->high_water) + // init = s->window_size - s->high_water; + // zmemzero(s->window + s->high_water, (unsigned)init); + // s->high_water += init; + // } + // } + // + // Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, + // "not enough room for search"); + }; + + /* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * + * In case deflateParams() is used to later switch to a non-zero compression + * level, s->matches (otherwise unused when storing) keeps track of the number + * of hash table slides to perform. If s->matches is 1, then one hash table + * slide will be done when switching. If s->matches is 2, the maximum value + * allowed here, then the hash table will be cleared, since two or more slides + * is the same as a clear. + * + * deflate_stored() is written to minimize the number of times an input byte is + * copied. It is most efficient with large input and output buffers, which + * maximizes the opportunites to have a single copy from next_in to next_out. + */ + const deflate_stored = (s, flush) => { + + /* Smallest worthy block size when not flushing or finishing. By default + * this is 32K. This can be as small as 507 bytes for memLevel == 1. For + * large input and output buffers, the stored block size will be larger. + */ + let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5; + + /* Copy as many min_block or larger stored blocks directly to next_out as + * possible. If flushing, copy the remaining available input to next_out as + * stored blocks, if there is enough space. + */ + let len, left, have, last = 0; + let used = s.strm.avail_in; + do { + /* Set len to the maximum size block that we can copy directly with the + * available input data and output space. Set left to how much of that + * would be copied from what's left in the window. + */ + len = 65535/* MAX_STORED */; /* maximum deflate stored block length */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + if (s.strm.avail_out < have) { /* need room for header */ + break; + } + /* maximum stored block length that will fit in avail_out: */ + have = s.strm.avail_out - have; + left = s.strstart - s.block_start; /* bytes left in window */ + if (len > left + s.strm.avail_in) { + len = left + s.strm.avail_in; /* limit len to the input */ + } + if (len > have) { + len = have; /* limit len to the output */ + } + + /* If the stored block would be less than min_block in length, or if + * unable to copy all of the available input when flushing, then try + * copying to the window and the pending buffer instead. Also don't + * write an empty block when flushing -- deflate() does that. + */ + if (len < min_block && ((len === 0 && flush !== Z_FINISH$1) || + flush === Z_NO_FLUSH$1 || + len !== left + s.strm.avail_in)) { + break; + } + + /* Make a dummy stored block in pending to get the header bytes, + * including any pending bits. This also updates the debugging counts. + */ + last = flush === Z_FINISH$1 && len === left + s.strm.avail_in ? 1 : 0; + _tr_stored_block(s, 0, 0, last); + + /* Replace the lengths in the dummy stored block with len. */ + s.pending_buf[s.pending - 4] = len; + s.pending_buf[s.pending - 3] = len >> 8; + s.pending_buf[s.pending - 2] = ~len; + s.pending_buf[s.pending - 1] = ~len >> 8; + + /* Write the stored block header bytes. */ + flush_pending(s.strm); + + //#ifdef ZLIB_DEBUG + // /* Update debugging counts for the data about to be copied. */ + // s->compressed_len += len << 3; + // s->bits_sent += len << 3; + //#endif + + /* Copy uncompressed bytes from the window to next_out. */ + if (left) { + if (left > len) { + left = len; + } + //zmemcpy(s->strm->next_out, s->window + s->block_start, left); + s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out); + s.strm.next_out += left; + s.strm.avail_out -= left; + s.strm.total_out += left; + s.block_start += left; + len -= left; + } + + /* Copy uncompressed bytes directly from next_in to next_out, updating + * the check value. + */ + if (len) { + read_buf(s.strm, s.strm.output, s.strm.next_out, len); + s.strm.next_out += len; + s.strm.avail_out -= len; + s.strm.total_out += len; + } + } while (last === 0); + + /* Update the sliding window with the last s->w_size bytes of the copied + * data, or append all of the copied data to the existing window if less + * than s->w_size bytes were copied. Also update the number of bytes to + * insert in the hash tables, in the event that deflateParams() switches to + * a non-zero compression level. + */ + used -= s.strm.avail_in; /* number of input bytes directly copied */ + if (used) { + /* If any input was used, then no unused input remains in the window, + * therefore s->block_start == s->strstart. + */ + if (used >= s.w_size) { /* supplant the previous history */ + s.matches = 2; /* clear hash */ + //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); + s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0); + s.strstart = s.w_size; + s.insert = s.strstart; + } + else { + if (s.window_size - s.strstart <= used) { + /* Slide the window down. */ + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); + s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart); + s.strstart += used; + s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used; + } + s.block_start = s.strstart; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* If the last block was written to next_out, then done. */ + if (last) { + return BS_FINISH_DONE; + } + + /* If flushing and all input has been consumed, then done. */ + if (flush !== Z_NO_FLUSH$1 && flush !== Z_FINISH$1 && + s.strm.avail_in === 0 && s.strstart === s.block_start) { + return BS_BLOCK_DONE; + } + + /* Fill the window with any remaining input. */ + have = s.window_size - s.strstart; + if (s.strm.avail_in > have && s.block_start >= s.w_size) { + /* Slide the window down. */ + s.block_start -= s.w_size; + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + have += s.w_size; /* more space now */ + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + if (have > s.strm.avail_in) { + have = s.strm.avail_in; + } + if (have) { + read_buf(s.strm, s.window, s.strstart, have); + s.strstart += have; + s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* There was not enough avail_out to write a complete worthy or flushed + * stored block to next_out. Write a stored block to pending instead, if we + * have enough input for a worthy block, or if flushing and there is enough + * room for the remaining input as a stored block in the pending buffer. + */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + /* maximum stored block length that will fit in pending: */ + have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have; + min_block = have > s.w_size ? s.w_size : have; + left = s.strstart - s.block_start; + if (left >= min_block || + ((left || flush === Z_FINISH$1) && flush !== Z_NO_FLUSH$1 && + s.strm.avail_in === 0 && left <= have)) { + len = left > have ? have : left; + last = flush === Z_FINISH$1 && s.strm.avail_in === 0 && + len === left ? 1 : 0; + _tr_stored_block(s, s.block_start, len, last); + s.block_start += len; + flush_pending(s.strm); + } + + /* We've done all we can with the available input and output. */ + return last ? BS_FINISH_STARTED : BS_NEED_MORE; + }; + + + /* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ + const deflate_fast = (s, flush) => { + + let hash_head; /* head of the hash chain */ + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else + { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + + //#if MIN_MATCH != 3 + // Call UPDATE_HASH() MIN_MATCH-3 more times + //#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ + const deflate_slow = (s, flush) => { + + let hash_head; /* head of hash chain */ + let bflush; /* set if current block must be flushed */ + + let max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + + if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && + s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && + (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; + }; + + + /* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ + const deflate_rle = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + let prev; /* byte at distance one to match */ + let scan, strend; /* scan goes up to strend for length of run */ + + const _win = s.window; + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; + }; + + /* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ + const deflate_huff = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH$1) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH$1) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; + }; + + /* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ + function Config(good_length, max_lazy, nice_length, max_chain, func) { + + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; + } + + const configuration_table = [ + /* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ + ]; + + + /* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ + const lm_init = (s) => { + + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; + }; + + + function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED$1; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.sym_buf = 0; /* buffer for distances and literals/lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.sym_next = 0; /* running index in sym_buf */ + this.sym_end = 0; /* symbol table full when sym_next reaches this */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ + } + + + /* ========================================================================= + * Check for a valid deflate stream state. Return 0 if ok, 1 if not. + */ + const deflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const s = strm.state; + if (!s || s.strm !== strm || (s.status !== INIT_STATE && + //#ifdef GZIP + s.status !== GZIP_STATE && + //#endif + s.status !== EXTRA_STATE && + s.status !== NAME_STATE && + s.status !== COMMENT_STATE && + s.status !== HCRC_STATE && + s.status !== BUSY_STATE && + s.status !== FINISH_STATE)) { + return 1; + } + return 0; + }; + + + const deflateResetKeep = (strm) => { + + if (deflateStateCheck(strm)) { + return err(strm, Z_STREAM_ERROR); + } + + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + + const s = strm.state; + s.pending = 0; + s.pending_out = 0; + + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + s.status = + //#ifdef GZIP + s.wrap === 2 ? GZIP_STATE : + //#endif + s.wrap ? INIT_STATE : BUSY_STATE; + strm.adler = (s.wrap === 2) ? + 0 // crc32(0, Z_NULL, 0) + : + 1; // adler32(0, Z_NULL, 0) + s.last_flush = -2; + _tr_init(s); + return Z_OK$1; + }; + + + const deflateReset = (strm) => { + + const ret = deflateResetKeep(strm); + if (ret === Z_OK$1) { + lm_init(strm.state); + } + return ret; + }; + + + const deflateSetHeader = (strm, head) => { + + if (deflateStateCheck(strm) || strm.state.wrap !== 2) { + return Z_STREAM_ERROR; + } + strm.state.gzhead = head; + return Z_OK$1; + }; + + + const deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => { + + if (!strm) { // === Z_NULL + return Z_STREAM_ERROR; + } + let wrap = 1; + + if (level === Z_DEFAULT_COMPRESSION$1) { + level = 6; + } + + if (windowBits < 0) { /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } + + else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + + + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$1 || + windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) { + return err(strm, Z_STREAM_ERROR); + } + + + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + const s = new DeflateState(); + + strm.state = s; + s.strm = strm; + s.status = INIT_STATE; /* to pass state test in deflateReset() */ + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + /* We overlay pending_buf and sym_buf. This works since the average size + * for length/distance pairs over any compressed block is assured to be 31 + * bits or less. + * + * Analysis: The longest fixed codes are a length code of 8 bits plus 5 + * extra bits, for lengths 131 to 257. The longest fixed distance codes are + * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest + * possible fixed-codes length/distance pair is then 31 bits total. + * + * sym_buf starts one-fourth of the way into pending_buf. So there are + * three bytes in sym_buf for every four bytes in pending_buf. Each symbol + * in sym_buf is three bytes -- two for the distance and one for the + * literal/length. As each symbol is consumed, the pointer to the next + * sym_buf value to read moves forward three bytes. From that symbol, up to + * 31 bits are written to pending_buf. The closest the written pending_buf + * bits gets to the next sym_buf symbol to read is just before the last + * code is written. At that time, 31*(n-2) bits have been written, just + * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at + * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1 + * symbols are written.) The closest the writing gets to what is unread is + * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and + * can range from 128 to 32768. + * + * Therefore, at a minimum, there are 142 bits of space between what is + * written and what is read in the overlain buffers, so the symbols cannot + * be overwritten by the compressed data. That space is actually 139 bits, + * due to the three-bit fixed-code block header. + * + * That covers the case where either Z_FIXED is specified, forcing fixed + * codes, or when the use of fixed codes is chosen, because that choice + * results in a smaller compressed block than dynamic codes. That latter + * condition then assures that the above analysis also covers all dynamic + * blocks. A dynamic-code block will only be chosen to be emitted if it has + * fewer bits than a fixed-code block would for the same set of symbols. + * Therefore its average symbol length is assured to be less than 31. So + * the compressed data for a dynamic block also cannot overwrite the + * symbols from which it is being constructed. + */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->sym_buf = s->pending_buf + s->lit_bufsize; + s.sym_buf = s.lit_bufsize; + + //s->sym_end = (s->lit_bufsize - 1) * 3; + s.sym_end = (s.lit_bufsize - 1) * 3; + /* We avoid equality with lit_bufsize*3 because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ + + s.level = level; + s.strategy = strategy; + s.method = method; + + return deflateReset(strm); + }; + + const deflateInit = (strm, level) => { + + return deflateInit2(strm, level, Z_DEFLATED$1, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1); + }; + + + /* ========================================================================= */ + const deflate$1 = (strm, flush) => { + + if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR; + } + + const s = strm.state; + + if (!strm.output || + (strm.avail_in !== 0 && !strm.input) || + (s.status === FINISH_STATE && flush !== Z_FINISH$1)) { + return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR); + } + + const old_flush = s.last_flush; + s.last_flush = flush; + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK$1; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && + flush !== Z_FINISH$1) { + return err(strm, Z_BUF_ERROR); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR); + } + + /* Write the header */ + if (s.status === INIT_STATE && s.wrap === 0) { + s.status = BUSY_STATE; + } + if (s.status === INIT_STATE) { + /* zlib header */ + let header = (Z_DEFLATED$1 + ((s.w_bits - 8) << 4)) << 8; + let level_flags = -1; + + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= (level_flags << 6); + if (s.strstart !== 0) { header |= PRESET_DICT; } + header += 31 - (header % 31); + + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + //#ifdef GZIP + if (s.status === GZIP_STATE) { + /* gzip header */ + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + else { + put_byte(s, (s.gzhead.text ? 1 : 0) + + (s.gzhead.hcrc ? 2 : 0) + + (!s.gzhead.extra ? 0 : 4) + + (!s.gzhead.name ? 0 : 8) + + (!s.gzhead.comment ? 0 : 16) + ); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, (s.gzhead.time >> 8) & 0xff); + put_byte(s, (s.gzhead.time >> 16) & 0xff); + put_byte(s, (s.gzhead.time >> 24) & 0xff); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let left = (s.gzhead.extra.length & 0xffff) - s.gzindex; + while (s.pending + left > s.pending_buf_size) { + let copy = s.pending_buf_size - s.pending; + // zmemcpy(s.pending_buf + s.pending, + // s.gzhead.extra + s.gzindex, copy); + s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending); + s.pending = s.pending_buf_size; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex += copy; + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + beg = 0; + left -= copy; + } + // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility + // TypedArray.slice and TypedArray.from don't exist in IE10-IE11 + let gzhead_extra = new Uint8Array(s.gzhead.extra); + // zmemcpy(s->pending_buf + s->pending, + // s->gzhead->extra + s->gzindex, left); + s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending); + s.pending += left; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = NAME_STATE; + } + if (s.status === NAME_STATE) { + if (s.gzhead.name/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = COMMENT_STATE; + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + } + s.status = HCRC_STATE; + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + } + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK$1; + } + } + //#endif + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || + (flush !== Z_NO_FLUSH$1 && s.status !== FINISH_STATE)) { + let bstate = s.level === 0 ? deflate_stored(s, flush) : + s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : + s.strategy === Z_RLE ? deflate_rle(s, flush) : + configuration_table[s.level].func(s, flush); + + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + return Z_OK$1; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } + else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH$1) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK$1; + } + } + } + + if (flush !== Z_FINISH$1) { return Z_OK$1; } + if (s.wrap <= 0) { return Z_STREAM_END$1; } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + put_byte(s, (strm.adler >> 16) & 0xff); + put_byte(s, (strm.adler >> 24) & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, (strm.total_in >> 8) & 0xff); + put_byte(s, (strm.total_in >> 16) & 0xff); + put_byte(s, (strm.total_in >> 24) & 0xff); + } + else + { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { s.wrap = -s.wrap; } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK$1 : Z_STREAM_END$1; + }; + + + const deflateEnd = (strm) => { + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + + const status = strm.state.status; + + strm.state = null; + + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK$1; + }; + + + /* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ + const deflateSetDictionary = (strm, dictionary) => { + + let dictLength = dictionary.length; + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + + const s = strm.state; + const wrap = s.wrap; + + if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) { + return Z_STREAM_ERROR; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0); + } + + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + let tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + const avail = strm.avail_in; + const next = strm.next_in; + const input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + let str = s.strstart; + let n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK$1; + }; + + + var deflateInit_1 = deflateInit; + var deflateInit2_1 = deflateInit2; + var deflateReset_1 = deflateReset; + var deflateResetKeep_1 = deflateResetKeep; + var deflateSetHeader_1 = deflateSetHeader; + var deflate_2$1 = deflate$1; + var deflateEnd_1 = deflateEnd; + var deflateSetDictionary_1 = deflateSetDictionary; + var deflateInfo = 'pako deflate (from Nodeca project)'; + + /* Not implemented + module.exports.deflateBound = deflateBound; + module.exports.deflateCopy = deflateCopy; + module.exports.deflateGetDictionary = deflateGetDictionary; + module.exports.deflateParams = deflateParams; + module.exports.deflatePending = deflatePending; + module.exports.deflatePrime = deflatePrime; + module.exports.deflateTune = deflateTune; + */ + + var deflate_1$1 = { + deflateInit: deflateInit_1, + deflateInit2: deflateInit2_1, + deflateReset: deflateReset_1, + deflateResetKeep: deflateResetKeep_1, + deflateSetHeader: deflateSetHeader_1, + deflate: deflate_2$1, + deflateEnd: deflateEnd_1, + deflateSetDictionary: deflateSetDictionary_1, + deflateInfo: deflateInfo + }; + + const _has = (obj, key) => { + return Object.prototype.hasOwnProperty.call(obj, key); + }; + + var assign = function (obj /*from1, from2, from3, ...*/) { + const sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + const source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (const p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + + return obj; + }; + + + // Join array of chunks to single array. + var flattenChunks = (chunks) => { + // calculate data length + let len = 0; + + for (let i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + const result = new Uint8Array(len); + + for (let i = 0, pos = 0, l = chunks.length; i < l; i++) { + let chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; + }; + + var common = { + assign: assign, + flattenChunks: flattenChunks + }; + + // String encode/decode helpers + + + // Quick check if we can use fast array to bin string conversion + // + // - apply(Array) can fail on Android 2.2 + // - apply(Uint8Array) can fail on iOS 5.1 Safari + // + let STR_APPLY_UIA_OK = true; + + try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + + // Table with utf8 lengths (calculated by first byte of sequence) + // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, + // because max possible codepoint is 0x10ffff + const _utf8len = new Uint8Array(256); + for (let q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); + } + _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + + // convert string to array (typed, when possible) + var string2buf = (str) => { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + + let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; + }; + + // Helper + const buf2binstring = (buf, len) => { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + + let result = ''; + for (let i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; + }; + + + // convert array to string + var buf2string = (buf, max) => { + const len = max || buf.length; + + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + + let i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + const utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + let c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + let c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); + }; + + + // Calculate max possible position in utf8 buffer, + // that will not break sequence. If that's not possible + // - (very small limits) return max size as is. + // + // buf[] - utf8 bytes array + // max - length limit (mandatory); + var utf8border = (buf, max) => { + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + let pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; + }; + + var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; + } + + var zstream = ZStream; + + const toString = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, + Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY, + Z_DEFLATED + } = constants$1; + + /* ===========================================================================*/ + + + /** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + + /* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + + /** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + + /** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + + /** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ + function Deflate(options) { + this.options = common.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + + let opt = this.options; + + if (opt.raw && (opt.windowBits > 0)) { + opt.windowBits = -opt.windowBits; + } + + else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) { + opt.windowBits += 16; + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = deflate_1$1.deflateInit2( + this.strm, + opt.level, + opt.method, + opt.windowBits, + opt.memLevel, + opt.strategy + ); + + if (status !== Z_OK) { + throw new Error(messages[status]); + } + + if (opt.header) { + deflate_1$1.deflateSetHeader(this.strm, opt.header); + } + + if (opt.dictionary) { + let dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + + status = deflate_1$1.deflateSetDictionary(this.strm, dict); + + if (status !== Z_OK) { + throw new Error(messages[status]); + } + + this._dict_set = true; + } + } + + /** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Deflate.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + let status, _flush_mode; + + if (this.ended) { return false; } + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + status = deflate_1$1.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = deflate_1$1.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + if (strm.avail_in === 0) break; + } + + return true; + }; + + + /** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Deflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + + /** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Deflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + this.result = common.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + + /** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ + function deflate(input, options) { + const deflator = new Deflate(options); + + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { throw deflator.msg || messages[deflator.err]; } + + return deflator.result; + } + + + /** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function deflateRaw(input, options) { + options = options || {}; + options.raw = true; + return deflate(input, options); + } + + + /** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ + function gzip(input, options) { + options = options || {}; + options.gzip = true; + return deflate(input, options); + } + + + var Deflate_1 = Deflate; + var deflate_2 = deflate; + var deflateRaw_1 = deflateRaw; + var gzip_1 = gzip; + var constants = constants$1; + + var deflate_1 = { + Deflate: Deflate_1, + deflate: deflate_2, + deflateRaw: deflateRaw_1, + gzip: gzip_1, + constants: constants + }; + + exports.Deflate = Deflate_1; + exports.constants = constants; + exports["default"] = deflate_1; + exports.deflate = deflate_2; + exports.deflateRaw = deflateRaw_1; + exports.gzip = gzip_1; + + Object.defineProperty(exports, '__esModule', { value: true }); + +})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.min.js b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.min.js new file mode 100644 index 0000000..b560534 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_deflate.min.js @@ -0,0 +1,2 @@ +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports):"function"==typeof define&&define.amd?define(["exports"],e):e((t="undefined"!=typeof globalThis?globalThis:t||self).pako={})}(this,(function(t){"use strict";function e(t){let e=t.length;for(;--e>=0;)t[e]=0}const a=256,s=286,n=30,r=15,i=new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]),_=new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]),l=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),h=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),o=new Array(576);e(o);const d=new Array(60);e(d);const u=new Array(512);e(u);const f=new Array(256);e(f);const c=new Array(29);e(c);const p=new Array(n);function g(t,e,a,s,n){this.static_tree=t,this.extra_bits=e,this.extra_base=a,this.elems=s,this.max_length=n,this.has_stree=t&&t.length}let w,m,b;function y(t,e){this.dyn_tree=t,this.max_code=0,this.stat_desc=e}e(p);const v=t=>t<256?u[t]:u[256+(t>>>7)],z=(t,e)=>{t.pending_buf[t.pending++]=255&e,t.pending_buf[t.pending++]=e>>>8&255},k=(t,e,a)=>{t.bi_valid>16-a?(t.bi_buf|=e<>16-t.bi_valid,t.bi_valid+=a-16):(t.bi_buf|=e<{k(t,a[2*e],a[2*e+1])},A=(t,e)=>{let a=0;do{a|=1&t,t>>>=1,a<<=1}while(--e>0);return a>>>1},E=(t,e,a)=>{const s=new Array(16);let n,i,_=0;for(n=1;n<=r;n++)_=_+a[n-1]<<1,s[n]=_;for(i=0;i<=e;i++){let e=t[2*i+1];0!==e&&(t[2*i]=A(s[e]++,e))}},Z=t=>{let e;for(e=0;e{t.bi_valid>8?z(t,t.bi_buf):t.bi_valid>0&&(t.pending_buf[t.pending++]=t.bi_buf),t.bi_buf=0,t.bi_valid=0},R=(t,e,a,s)=>{const n=2*e,r=2*a;return t[n]{const s=t.heap[a];let n=a<<1;for(;n<=t.heap_len&&(n{let n,r,l,h,o=0;if(0!==t.sym_next)do{n=255&t.pending_buf[t.sym_buf+o++],n+=(255&t.pending_buf[t.sym_buf+o++])<<8,r=t.pending_buf[t.sym_buf+o++],0===n?x(t,r,e):(l=f[r],x(t,l+a+1,e),h=i[l],0!==h&&(r-=c[l],k(t,r,h)),n--,l=v(n),x(t,l,s),h=_[l],0!==h&&(n-=p[l],k(t,n,h)))}while(o{const a=e.dyn_tree,s=e.stat_desc.static_tree,n=e.stat_desc.has_stree,i=e.stat_desc.elems;let _,l,h,o=-1;for(t.heap_len=0,t.heap_max=573,_=0;_>1;_>=1;_--)S(t,a,_);h=i;do{_=t.heap[1],t.heap[1]=t.heap[t.heap_len--],S(t,a,1),l=t.heap[1],t.heap[--t.heap_max]=_,t.heap[--t.heap_max]=l,a[2*h]=a[2*_]+a[2*l],t.depth[h]=(t.depth[_]>=t.depth[l]?t.depth[_]:t.depth[l])+1,a[2*_+1]=a[2*l+1]=h,t.heap[1]=h++,S(t,a,1)}while(t.heap_len>=2);t.heap[--t.heap_max]=t.heap[1],((t,e)=>{const a=e.dyn_tree,s=e.max_code,n=e.stat_desc.static_tree,i=e.stat_desc.has_stree,_=e.stat_desc.extra_bits,l=e.stat_desc.extra_base,h=e.stat_desc.max_length;let o,d,u,f,c,p,g=0;for(f=0;f<=r;f++)t.bl_count[f]=0;for(a[2*t.heap[t.heap_max]+1]=0,o=t.heap_max+1;o<573;o++)d=t.heap[o],f=a[2*a[2*d+1]+1]+1,f>h&&(f=h,g++),a[2*d+1]=f,d>s||(t.bl_count[f]++,c=0,d>=l&&(c=_[d-l]),p=a[2*d],t.opt_len+=p*(f+c),i&&(t.static_len+=p*(n[2*d+1]+c)));if(0!==g){do{for(f=h-1;0===t.bl_count[f];)f--;t.bl_count[f]--,t.bl_count[f+1]+=2,t.bl_count[h]--,g-=2}while(g>0);for(f=h;0!==f;f--)for(d=t.bl_count[f];0!==d;)u=t.heap[--o],u>s||(a[2*u+1]!==f&&(t.opt_len+=(f-a[2*u+1])*a[2*u],a[2*u+1]=f),d--)}})(t,e),E(a,o,t.bl_count)},F=(t,e,a)=>{let s,n,r=-1,i=e[1],_=0,l=7,h=4;for(0===i&&(l=138,h=3),e[2*(a+1)+1]=65535,s=0;s<=a;s++)n=i,i=e[2*(s+1)+1],++_{let s,n,r=-1,i=e[1],_=0,l=7,h=4;for(0===i&&(l=138,h=3),s=0;s<=a;s++)if(n=i,i=e[2*(s+1)+1],!(++_{k(t,0+(s?1:0),3),U(t),z(t,a),z(t,~a),a&&t.pending_buf.set(t.window.subarray(e,e+a),t.pending),t.pending+=a};var I=(t,e,s,n)=>{let r,i,_=0;t.level>0?(2===t.strm.data_type&&(t.strm.data_type=(t=>{let e,s=4093624447;for(e=0;e<=31;e++,s>>>=1)if(1&s&&0!==t.dyn_ltree[2*e])return 0;if(0!==t.dyn_ltree[18]||0!==t.dyn_ltree[20]||0!==t.dyn_ltree[26])return 1;for(e=32;e{let e;for(F(t,t.dyn_ltree,t.l_desc.max_code),F(t,t.dyn_dtree,t.d_desc.max_code),L(t,t.bl_desc),e=18;e>=3&&0===t.bl_tree[2*h[e]+1];e--);return t.opt_len+=3*(e+1)+5+5+4,e})(t),r=t.opt_len+3+7>>>3,i=t.static_len+3+7>>>3,i<=r&&(r=i)):r=i=s+5,s+4<=r&&-1!==e?N(t,e,s,n):4===t.strategy||i===r?(k(t,2+(n?1:0),3),T(t,o,d)):(k(t,4+(n?1:0),3),((t,e,a,s)=>{let n;for(k(t,e-257,5),k(t,a-1,5),k(t,s-4,4),n=0;n{D||((()=>{let t,e,a,h,y;const v=new Array(16);for(a=0,h=0;h<28;h++)for(c[h]=a,t=0;t<1<>=7;h(t.pending_buf[t.sym_buf+t.sym_next++]=e,t.pending_buf[t.sym_buf+t.sym_next++]=e>>8,t.pending_buf[t.sym_buf+t.sym_next++]=s,0===e?t.dyn_ltree[2*s]++:(t.matches++,e--,t.dyn_ltree[2*(f[s]+a+1)]++,t.dyn_dtree[2*v(e)]++),t.sym_next===t.sym_end),_tr_align:t=>{k(t,2,3),x(t,256,o),(t=>{16===t.bi_valid?(z(t,t.bi_buf),t.bi_buf=0,t.bi_valid=0):t.bi_valid>=8&&(t.pending_buf[t.pending++]=255&t.bi_buf,t.bi_buf>>=8,t.bi_valid-=8)})(t)}};var B=(t,e,a,s)=>{let n=65535&t|0,r=t>>>16&65535|0,i=0;for(;0!==a;){i=a>2e3?2e3:a,a-=i;do{n=n+e[s++]|0,r=r+n|0}while(--i);n%=65521,r%=65521}return n|r<<16|0};const H=new Uint32Array((()=>{let t,e=[];for(var a=0;a<256;a++){t=a;for(var s=0;s<8;s++)t=1&t?3988292384^t>>>1:t>>>1;e[a]=t}return e})());var M=(t,e,a,s)=>{const n=H,r=s+a;t^=-1;for(let a=s;a>>8^n[255&(t^e[a])];return-1^t},P={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},j={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8};const{_tr_init:K,_tr_stored_block:Y,_tr_flush_block:G,_tr_tally:X,_tr_align:W}=C,{Z_NO_FLUSH:q,Z_PARTIAL_FLUSH:J,Z_FULL_FLUSH:Q,Z_FINISH:V,Z_BLOCK:$,Z_OK:tt,Z_STREAM_END:et,Z_STREAM_ERROR:at,Z_DATA_ERROR:st,Z_BUF_ERROR:nt,Z_DEFAULT_COMPRESSION:rt,Z_FILTERED:it,Z_HUFFMAN_ONLY:_t,Z_RLE:lt,Z_FIXED:ht,Z_DEFAULT_STRATEGY:ot,Z_UNKNOWN:dt,Z_DEFLATED:ut}=j,ft=258,ct=262,pt=42,gt=113,wt=666,mt=(t,e)=>(t.msg=P[e],e),bt=t=>2*t-(t>4?9:0),yt=t=>{let e=t.length;for(;--e>=0;)t[e]=0},vt=t=>{let e,a,s,n=t.w_size;e=t.hash_size,s=e;do{a=t.head[--s],t.head[s]=a>=n?a-n:0}while(--e);e=n,s=e;do{a=t.prev[--s],t.prev[s]=a>=n?a-n:0}while(--e)};let zt=(t,e,a)=>(e<{const e=t.state;let a=e.pending;a>t.avail_out&&(a=t.avail_out),0!==a&&(t.output.set(e.pending_buf.subarray(e.pending_out,e.pending_out+a),t.next_out),t.next_out+=a,e.pending_out+=a,t.total_out+=a,t.avail_out-=a,e.pending-=a,0===e.pending&&(e.pending_out=0))},xt=(t,e)=>{G(t,t.block_start>=0?t.block_start:-1,t.strstart-t.block_start,e),t.block_start=t.strstart,kt(t.strm)},At=(t,e)=>{t.pending_buf[t.pending++]=e},Et=(t,e)=>{t.pending_buf[t.pending++]=e>>>8&255,t.pending_buf[t.pending++]=255&e},Zt=(t,e,a,s)=>{let n=t.avail_in;return n>s&&(n=s),0===n?0:(t.avail_in-=n,e.set(t.input.subarray(t.next_in,t.next_in+n),a),1===t.state.wrap?t.adler=B(t.adler,e,n,a):2===t.state.wrap&&(t.adler=M(t.adler,e,n,a)),t.next_in+=n,t.total_in+=n,n)},Ut=(t,e)=>{let a,s,n=t.max_chain_length,r=t.strstart,i=t.prev_length,_=t.nice_match;const l=t.strstart>t.w_size-ct?t.strstart-(t.w_size-ct):0,h=t.window,o=t.w_mask,d=t.prev,u=t.strstart+ft;let f=h[r+i-1],c=h[r+i];t.prev_length>=t.good_match&&(n>>=2),_>t.lookahead&&(_=t.lookahead);do{if(a=e,h[a+i]===c&&h[a+i-1]===f&&h[a]===h[r]&&h[++a]===h[r+1]){r+=2,a++;do{}while(h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&h[++r]===h[++a]&&ri){if(t.match_start=e,i=s,s>=_)break;f=h[r+i-1],c=h[r+i]}}}while((e=d[e&o])>l&&0!=--n);return i<=t.lookahead?i:t.lookahead},Rt=t=>{const e=t.w_size;let a,s,n;do{if(s=t.window_size-t.lookahead-t.strstart,t.strstart>=e+(e-ct)&&(t.window.set(t.window.subarray(e,e+e-s),0),t.match_start-=e,t.strstart-=e,t.block_start-=e,t.insert>t.strstart&&(t.insert=t.strstart),vt(t),s+=e),0===t.strm.avail_in)break;if(a=Zt(t.strm,t.window,t.strstart+t.lookahead,s),t.lookahead+=a,t.lookahead+t.insert>=3)for(n=t.strstart-t.insert,t.ins_h=t.window[n],t.ins_h=zt(t,t.ins_h,t.window[n+1]);t.insert&&(t.ins_h=zt(t,t.ins_h,t.window[n+3-1]),t.prev[n&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=n,n++,t.insert--,!(t.lookahead+t.insert<3)););}while(t.lookahead{let a,s,n,r=t.pending_buf_size-5>t.w_size?t.w_size:t.pending_buf_size-5,i=0,_=t.strm.avail_in;do{if(a=65535,n=t.bi_valid+42>>3,t.strm.avail_outs+t.strm.avail_in&&(a=s+t.strm.avail_in),a>n&&(a=n),a>8,t.pending_buf[t.pending-2]=~a,t.pending_buf[t.pending-1]=~a>>8,kt(t.strm),s&&(s>a&&(s=a),t.strm.output.set(t.window.subarray(t.block_start,t.block_start+s),t.strm.next_out),t.strm.next_out+=s,t.strm.avail_out-=s,t.strm.total_out+=s,t.block_start+=s,a-=s),a&&(Zt(t.strm,t.strm.output,t.strm.next_out,a),t.strm.next_out+=a,t.strm.avail_out-=a,t.strm.total_out+=a)}while(0===i);return _-=t.strm.avail_in,_&&(_>=t.w_size?(t.matches=2,t.window.set(t.strm.input.subarray(t.strm.next_in-t.w_size,t.strm.next_in),0),t.strstart=t.w_size,t.insert=t.strstart):(t.window_size-t.strstart<=_&&(t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,t.insert>t.strstart&&(t.insert=t.strstart)),t.window.set(t.strm.input.subarray(t.strm.next_in-_,t.strm.next_in),t.strstart),t.strstart+=_,t.insert+=_>t.w_size-t.insert?t.w_size-t.insert:_),t.block_start=t.strstart),t.high_watern&&t.block_start>=t.w_size&&(t.block_start-=t.w_size,t.strstart-=t.w_size,t.window.set(t.window.subarray(t.w_size,t.w_size+t.strstart),0),t.matches<2&&t.matches++,n+=t.w_size,t.insert>t.strstart&&(t.insert=t.strstart)),n>t.strm.avail_in&&(n=t.strm.avail_in),n&&(Zt(t.strm,t.window,t.strstart,n),t.strstart+=n,t.insert+=n>t.w_size-t.insert?t.w_size-t.insert:n),t.high_water>3,n=t.pending_buf_size-n>65535?65535:t.pending_buf_size-n,r=n>t.w_size?t.w_size:n,s=t.strstart-t.block_start,(s>=r||(s||e===V)&&e!==q&&0===t.strm.avail_in&&s<=n)&&(a=s>n?n:s,i=e===V&&0===t.strm.avail_in&&a===s?1:0,Y(t,t.block_start,a,i),t.block_start+=a,kt(t.strm)),i?3:1)},Tt=(t,e)=>{let a,s;for(;;){if(t.lookahead=3&&(t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),0!==a&&t.strstart-a<=t.w_size-ct&&(t.match_length=Ut(t,a)),t.match_length>=3)if(s=X(t,t.strstart-t.match_start,t.match_length-3),t.lookahead-=t.match_length,t.match_length<=t.max_lazy_match&&t.lookahead>=3){t.match_length--;do{t.strstart++,t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart}while(0!=--t.match_length);t.strstart++}else t.strstart+=t.match_length,t.match_length=0,t.ins_h=t.window[t.strstart],t.ins_h=zt(t,t.ins_h,t.window[t.strstart+1]);else s=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++;if(s&&(xt(t,!1),0===t.strm.avail_out))return 1}return t.insert=t.strstart<2?t.strstart:2,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2},Lt=(t,e)=>{let a,s,n;for(;;){if(t.lookahead=3&&(t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart),t.prev_length=t.match_length,t.prev_match=t.match_start,t.match_length=2,0!==a&&t.prev_length4096)&&(t.match_length=2)),t.prev_length>=3&&t.match_length<=t.prev_length){n=t.strstart+t.lookahead-3,s=X(t,t.strstart-1-t.prev_match,t.prev_length-3),t.lookahead-=t.prev_length-1,t.prev_length-=2;do{++t.strstart<=n&&(t.ins_h=zt(t,t.ins_h,t.window[t.strstart+3-1]),a=t.prev[t.strstart&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=t.strstart)}while(0!=--t.prev_length);if(t.match_available=0,t.match_length=2,t.strstart++,s&&(xt(t,!1),0===t.strm.avail_out))return 1}else if(t.match_available){if(s=X(t,0,t.window[t.strstart-1]),s&&xt(t,!1),t.strstart++,t.lookahead--,0===t.strm.avail_out)return 1}else t.match_available=1,t.strstart++,t.lookahead--}return t.match_available&&(s=X(t,0,t.window[t.strstart-1]),t.match_available=0),t.insert=t.strstart<2?t.strstart:2,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2};function Ft(t,e,a,s,n){this.good_length=t,this.max_lazy=e,this.nice_length=a,this.max_chain=s,this.func=n}const Ot=[new Ft(0,0,0,0,St),new Ft(4,4,8,4,Tt),new Ft(4,5,16,8,Tt),new Ft(4,6,32,32,Tt),new Ft(4,4,16,16,Lt),new Ft(8,16,32,32,Lt),new Ft(8,16,128,128,Lt),new Ft(8,32,128,256,Lt),new Ft(32,128,258,1024,Lt),new Ft(32,258,258,4096,Lt)];function Dt(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=ut,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(1146),this.dyn_dtree=new Uint16Array(122),this.bl_tree=new Uint16Array(78),yt(this.dyn_ltree),yt(this.dyn_dtree),yt(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(16),this.heap=new Uint16Array(573),yt(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(573),yt(this.depth),this.sym_buf=0,this.lit_bufsize=0,this.sym_next=0,this.sym_end=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}const Nt=t=>{if(!t)return 1;const e=t.state;return!e||e.strm!==t||e.status!==pt&&57!==e.status&&69!==e.status&&73!==e.status&&91!==e.status&&103!==e.status&&e.status!==gt&&e.status!==wt?1:0},It=t=>{if(Nt(t))return mt(t,at);t.total_in=t.total_out=0,t.data_type=dt;const e=t.state;return e.pending=0,e.pending_out=0,e.wrap<0&&(e.wrap=-e.wrap),e.status=2===e.wrap?57:e.wrap?pt:gt,t.adler=2===e.wrap?0:1,e.last_flush=-2,K(e),tt},Ct=t=>{const e=It(t);var a;return e===tt&&((a=t.state).window_size=2*a.w_size,yt(a.head),a.max_lazy_match=Ot[a.level].max_lazy,a.good_match=Ot[a.level].good_length,a.nice_match=Ot[a.level].nice_length,a.max_chain_length=Ot[a.level].max_chain,a.strstart=0,a.block_start=0,a.lookahead=0,a.insert=0,a.match_length=a.prev_length=2,a.match_available=0,a.ins_h=0),e},Bt=(t,e,a,s,n,r)=>{if(!t)return at;let i=1;if(e===rt&&(e=6),s<0?(i=0,s=-s):s>15&&(i=2,s-=16),n<1||n>9||a!==ut||s<8||s>15||e<0||e>9||r<0||r>ht||8===s&&1!==i)return mt(t,at);8===s&&(s=9);const _=new Dt;return t.state=_,_.strm=t,_.status=pt,_.wrap=i,_.gzhead=null,_.w_bits=s,_.w_size=1<<_.w_bits,_.w_mask=_.w_size-1,_.hash_bits=n+7,_.hash_size=1<<_.hash_bits,_.hash_mask=_.hash_size-1,_.hash_shift=~~((_.hash_bits+3-1)/3),_.window=new Uint8Array(2*_.w_size),_.head=new Uint16Array(_.hash_size),_.prev=new Uint16Array(_.w_size),_.lit_bufsize=1<Bt(t,e,ut,15,8,ot),deflateInit2:Bt,deflateReset:Ct,deflateResetKeep:It,deflateSetHeader:(t,e)=>Nt(t)||2!==t.state.wrap?at:(t.state.gzhead=e,tt),deflate:(t,e)=>{if(Nt(t)||e>$||e<0)return t?mt(t,at):at;const a=t.state;if(!t.output||0!==t.avail_in&&!t.input||a.status===wt&&e!==V)return mt(t,0===t.avail_out?nt:at);const s=a.last_flush;if(a.last_flush=e,0!==a.pending){if(kt(t),0===t.avail_out)return a.last_flush=-1,tt}else if(0===t.avail_in&&bt(e)<=bt(s)&&e!==V)return mt(t,nt);if(a.status===wt&&0!==t.avail_in)return mt(t,nt);if(a.status===pt&&0===a.wrap&&(a.status=gt),a.status===pt){let e=ut+(a.w_bits-8<<4)<<8,s=-1;if(s=a.strategy>=_t||a.level<2?0:a.level<6?1:6===a.level?2:3,e|=s<<6,0!==a.strstart&&(e|=32),e+=31-e%31,Et(a,e),0!==a.strstart&&(Et(a,t.adler>>>16),Et(a,65535&t.adler)),t.adler=1,a.status=gt,kt(t),0!==a.pending)return a.last_flush=-1,tt}if(57===a.status)if(t.adler=0,At(a,31),At(a,139),At(a,8),a.gzhead)At(a,(a.gzhead.text?1:0)+(a.gzhead.hcrc?2:0)+(a.gzhead.extra?4:0)+(a.gzhead.name?8:0)+(a.gzhead.comment?16:0)),At(a,255&a.gzhead.time),At(a,a.gzhead.time>>8&255),At(a,a.gzhead.time>>16&255),At(a,a.gzhead.time>>24&255),At(a,9===a.level?2:a.strategy>=_t||a.level<2?4:0),At(a,255&a.gzhead.os),a.gzhead.extra&&a.gzhead.extra.length&&(At(a,255&a.gzhead.extra.length),At(a,a.gzhead.extra.length>>8&255)),a.gzhead.hcrc&&(t.adler=M(t.adler,a.pending_buf,a.pending,0)),a.gzindex=0,a.status=69;else if(At(a,0),At(a,0),At(a,0),At(a,0),At(a,0),At(a,9===a.level?2:a.strategy>=_t||a.level<2?4:0),At(a,3),a.status=gt,kt(t),0!==a.pending)return a.last_flush=-1,tt;if(69===a.status){if(a.gzhead.extra){let e=a.pending,s=(65535&a.gzhead.extra.length)-a.gzindex;for(;a.pending+s>a.pending_buf_size;){let n=a.pending_buf_size-a.pending;if(a.pending_buf.set(a.gzhead.extra.subarray(a.gzindex,a.gzindex+n),a.pending),a.pending=a.pending_buf_size,a.gzhead.hcrc&&a.pending>e&&(t.adler=M(t.adler,a.pending_buf,a.pending-e,e)),a.gzindex+=n,kt(t),0!==a.pending)return a.last_flush=-1,tt;e=0,s-=n}let n=new Uint8Array(a.gzhead.extra);a.pending_buf.set(n.subarray(a.gzindex,a.gzindex+s),a.pending),a.pending+=s,a.gzhead.hcrc&&a.pending>e&&(t.adler=M(t.adler,a.pending_buf,a.pending-e,e)),a.gzindex=0}a.status=73}if(73===a.status){if(a.gzhead.name){let e,s=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>s&&(t.adler=M(t.adler,a.pending_buf,a.pending-s,s)),kt(t),0!==a.pending)return a.last_flush=-1,tt;s=0}e=a.gzindexs&&(t.adler=M(t.adler,a.pending_buf,a.pending-s,s)),a.gzindex=0}a.status=91}if(91===a.status){if(a.gzhead.comment){let e,s=a.pending;do{if(a.pending===a.pending_buf_size){if(a.gzhead.hcrc&&a.pending>s&&(t.adler=M(t.adler,a.pending_buf,a.pending-s,s)),kt(t),0!==a.pending)return a.last_flush=-1,tt;s=0}e=a.gzindexs&&(t.adler=M(t.adler,a.pending_buf,a.pending-s,s))}a.status=103}if(103===a.status){if(a.gzhead.hcrc){if(a.pending+2>a.pending_buf_size&&(kt(t),0!==a.pending))return a.last_flush=-1,tt;At(a,255&t.adler),At(a,t.adler>>8&255),t.adler=0}if(a.status=gt,kt(t),0!==a.pending)return a.last_flush=-1,tt}if(0!==t.avail_in||0!==a.lookahead||e!==q&&a.status!==wt){let s=0===a.level?St(a,e):a.strategy===_t?((t,e)=>{let a;for(;;){if(0===t.lookahead&&(Rt(t),0===t.lookahead)){if(e===q)return 1;break}if(t.match_length=0,a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++,a&&(xt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2})(a,e):a.strategy===lt?((t,e)=>{let a,s,n,r;const i=t.window;for(;;){if(t.lookahead<=ft){if(Rt(t),t.lookahead<=ft&&e===q)return 1;if(0===t.lookahead)break}if(t.match_length=0,t.lookahead>=3&&t.strstart>0&&(n=t.strstart-1,s=i[n],s===i[++n]&&s===i[++n]&&s===i[++n])){r=t.strstart+ft;do{}while(s===i[++n]&&s===i[++n]&&s===i[++n]&&s===i[++n]&&s===i[++n]&&s===i[++n]&&s===i[++n]&&s===i[++n]&&nt.lookahead&&(t.match_length=t.lookahead)}if(t.match_length>=3?(a=X(t,1,t.match_length-3),t.lookahead-=t.match_length,t.strstart+=t.match_length,t.match_length=0):(a=X(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++),a&&(xt(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,e===V?(xt(t,!0),0===t.strm.avail_out?3:4):t.sym_next&&(xt(t,!1),0===t.strm.avail_out)?1:2})(a,e):Ot[a.level].func(a,e);if(3!==s&&4!==s||(a.status=wt),1===s||3===s)return 0===t.avail_out&&(a.last_flush=-1),tt;if(2===s&&(e===J?W(a):e!==$&&(Y(a,0,0,!1),e===Q&&(yt(a.head),0===a.lookahead&&(a.strstart=0,a.block_start=0,a.insert=0))),kt(t),0===t.avail_out))return a.last_flush=-1,tt}return e!==V?tt:a.wrap<=0?et:(2===a.wrap?(At(a,255&t.adler),At(a,t.adler>>8&255),At(a,t.adler>>16&255),At(a,t.adler>>24&255),At(a,255&t.total_in),At(a,t.total_in>>8&255),At(a,t.total_in>>16&255),At(a,t.total_in>>24&255)):(Et(a,t.adler>>>16),Et(a,65535&t.adler)),kt(t),a.wrap>0&&(a.wrap=-a.wrap),0!==a.pending?tt:et)},deflateEnd:t=>{if(Nt(t))return at;const e=t.state.status;return t.state=null,e===gt?mt(t,st):tt},deflateSetDictionary:(t,e)=>{let a=e.length;if(Nt(t))return at;const s=t.state,n=s.wrap;if(2===n||1===n&&s.status!==pt||s.lookahead)return at;if(1===n&&(t.adler=B(t.adler,e,a,0)),s.wrap=0,a>=s.w_size){0===n&&(yt(s.head),s.strstart=0,s.block_start=0,s.insert=0);let t=new Uint8Array(s.w_size);t.set(e.subarray(a-s.w_size,a),0),e=t,a=s.w_size}const r=t.avail_in,i=t.next_in,_=t.input;for(t.avail_in=a,t.next_in=0,t.input=e,Rt(s);s.lookahead>=3;){let t=s.strstart,e=s.lookahead-2;do{s.ins_h=zt(s,s.ins_h,s.window[t+3-1]),s.prev[t&s.w_mask]=s.head[s.ins_h],s.head[s.ins_h]=t,t++}while(--e);s.strstart=t,s.lookahead=2,Rt(s)}return s.strstart+=s.lookahead,s.block_start=s.strstart,s.insert=s.lookahead,s.lookahead=0,s.match_length=s.prev_length=2,s.match_available=0,t.next_in=i,t.input=_,t.avail_in=r,s.wrap=n,tt},deflateInfo:"pako deflate (from Nodeca project)"};const Mt=(t,e)=>Object.prototype.hasOwnProperty.call(t,e);var Pt=function(t){const e=Array.prototype.slice.call(arguments,1);for(;e.length;){const a=e.shift();if(a){if("object"!=typeof a)throw new TypeError(a+"must be non-object");for(const e in a)Mt(a,e)&&(t[e]=a[e])}}return t},jt=t=>{let e=0;for(let a=0,s=t.length;a=252?6:t>=248?5:t>=240?4:t>=224?3:t>=192?2:1;Yt[254]=Yt[254]=1;var Gt=t=>{if("function"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(t);let e,a,s,n,r,i=t.length,_=0;for(n=0;n>>6,e[r++]=128|63&a):a<65536?(e[r++]=224|a>>>12,e[r++]=128|a>>>6&63,e[r++]=128|63&a):(e[r++]=240|a>>>18,e[r++]=128|a>>>12&63,e[r++]=128|a>>>6&63,e[r++]=128|63&a);return e};var Xt=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0};const Wt=Object.prototype.toString,{Z_NO_FLUSH:qt,Z_SYNC_FLUSH:Jt,Z_FULL_FLUSH:Qt,Z_FINISH:Vt,Z_OK:$t,Z_STREAM_END:te,Z_DEFAULT_COMPRESSION:ee,Z_DEFAULT_STRATEGY:ae,Z_DEFLATED:se}=j;function ne(t){this.options=Pt({level:ee,method:se,chunkSize:16384,windowBits:15,memLevel:8,strategy:ae},t||{});let e=this.options;e.raw&&e.windowBits>0?e.windowBits=-e.windowBits:e.gzip&&e.windowBits>0&&e.windowBits<16&&(e.windowBits+=16),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new Xt,this.strm.avail_out=0;let a=Ht.deflateInit2(this.strm,e.level,e.method,e.windowBits,e.memLevel,e.strategy);if(a!==$t)throw new Error(P[a]);if(e.header&&Ht.deflateSetHeader(this.strm,e.header),e.dictionary){let t;if(t="string"==typeof e.dictionary?Gt(e.dictionary):"[object ArrayBuffer]"===Wt.call(e.dictionary)?new Uint8Array(e.dictionary):e.dictionary,a=Ht.deflateSetDictionary(this.strm,t),a!==$t)throw new Error(P[a]);this._dict_set=!0}}function re(t,e){const a=new ne(e);if(a.push(t,!0),a.err)throw a.msg||P[a.err];return a.result}ne.prototype.push=function(t,e){const a=this.strm,s=this.options.chunkSize;let n,r;if(this.ended)return!1;for(r=e===~~e?e:!0===e?Vt:qt,"string"==typeof t?a.input=Gt(t):"[object ArrayBuffer]"===Wt.call(t)?a.input=new Uint8Array(t):a.input=t,a.next_in=0,a.avail_in=a.input.length;;)if(0===a.avail_out&&(a.output=new Uint8Array(s),a.next_out=0,a.avail_out=s),(r===Jt||r===Qt)&&a.avail_out<=6)this.onData(a.output.subarray(0,a.next_out)),a.avail_out=0;else{if(n=Ht.deflate(a,r),n===te)return a.next_out>0&&this.onData(a.output.subarray(0,a.next_out)),n=Ht.deflateEnd(this.strm),this.onEnd(n),this.ended=!0,n===$t;if(0!==a.avail_out){if(r>0&&a.next_out>0)this.onData(a.output.subarray(0,a.next_out)),a.avail_out=0;else if(0===a.avail_in)break}else this.onData(a.output)}return!0},ne.prototype.onData=function(t){this.chunks.push(t)},ne.prototype.onEnd=function(t){t===$t&&(this.result=jt(this.chunks)),this.chunks=[],this.err=t,this.msg=this.strm.msg};var ie=ne,_e=re,le=function(t,e){return(e=e||{}).raw=!0,re(t,e)},he=function(t,e){return(e=e||{}).gzip=!0,re(t,e)},oe=j,de={Deflate:ie,deflate:_e,deflateRaw:le,gzip:he,constants:oe};t.Deflate=ie,t.constants=oe,t.default=de,t.deflate=_e,t.deflateRaw=le,t.gzip=he,Object.defineProperty(t,"__esModule",{value:!0})})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.js b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.js new file mode 100644 index 0000000..5b51c3b --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.js @@ -0,0 +1,3229 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +(function (global, factory) { + typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : + typeof define === 'function' && define.amd ? define(['exports'], factory) : + (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.pako = {})); +})(this, (function (exports) { 'use strict'; + + // Note: adler32 takes 12% for level 0 and 2% for level 6. + // It isn't worth it to make additional optimizations as in original. + // Small size is preferable. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var adler32 = function adler32(adler, buf, len, pos) { + var s1 = adler & 0xffff | 0, + s2 = adler >>> 16 & 0xffff | 0, + n = 0; + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + do { + s1 = s1 + buf[pos++] | 0; + s2 = s2 + s1 | 0; + } while (--n); + s1 %= 65521; + s2 %= 65521; + } + return s1 | s2 << 16 | 0; + }; + var adler32_1 = adler32; + + // Note: we can't get significant speed boost here. + // So write code to minimize size - no pregenerated tables + // and array tools dependencies. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // Use ordinary array, since untyped makes no boost here + var makeTable = function makeTable() { + var c, + table = []; + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1; + } + table[n] = c; + } + return table; + }; + + // Create table on load. Just 255 signed longs. Not a problem. + var crcTable = new Uint32Array(makeTable()); + var crc32 = function crc32(crc, buf, len, pos) { + var t = crcTable; + var end = pos + len; + crc ^= -1; + for (var i = pos; i < end; i++) { + crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF]; + } + return crc ^ -1; // >>> 0; + }; + + var crc32_1 = crc32; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // See state defs from inflate.js + var BAD$1 = 16209; /* got a data error -- remain here until reset */ + var TYPE$1 = 16191; /* i: waiting for type bits, including last-flag bit */ + + /* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ + var inffast = function inflate_fast(strm, start) { + var _in; /* local strm.input */ + var last; /* have enough input while in < last */ + var _out; /* local strm.output */ + var beg; /* inflate()'s initial strm.output */ + var end; /* while out < end, enough space available */ + //#ifdef INFLATE_STRICT + var dmax; /* maximum distance from zlib header */ + //#endif + var wsize; /* window size or zero if not using window */ + var whave; /* valid bytes in the window */ + var wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + var s_window; /* allocated sliding window, if wsize != 0 */ + var hold; /* local strm.hold */ + var bits; /* local strm.bits */ + var lcode; /* local strm.lencode */ + var dcode; /* local strm.distcode */ + var lmask; /* mask for first level of length codes */ + var dmask; /* mask for first level of distance codes */ + var here; /* retrieved table entry */ + var op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + var len; /* match length, unused bytes */ + var dist; /* match distance */ + var from; /* where to copy match from */ + var from_source; + var input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + var state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); + //#ifdef INFLATE_STRICT + dmax = state.dmax; + //#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = lcode[hold & lmask]; + dolen: for (;;) { + // Goto emulation + op = here >>> 24 /*here.bits*/; + hold >>>= op; + bits -= op; + op = here >>> 16 & 0xff /*here.op*/; + if (op === 0) { + /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff /*here.val*/; + } else if (op & 16) { + /* length base */ + len = here & 0xffff /*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & (1 << op) - 1; + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + dodist: for (;;) { + // goto emulation + op = here >>> 24 /*here.bits*/; + hold >>>= op; + bits -= op; + op = here >>> 16 & 0xff /*here.op*/; + + if (op & 16) { + /* distance base */ + dist = here & 0xffff /*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & (1 << op) - 1; + //#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + //#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { + /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // if (len <= op - whave) { + // do { + // output[_out++] = 0; + // } while (--len); + // continue top; + // } + // len -= op - whave; + // do { + // output[_out++] = 0; + // } while (--op > whave); + // if (op === 0) { + // from = _out - dist; + // do { + // output[_out++] = output[from++]; + // } while (--len); + // continue top; + // } + //#endif + } + + from = 0; // window index + from_source = s_window; + if (wnext === 0) { + /* very common case */ + from += wsize - op; + if (op < len) { + /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } else if (wnext < op) { + /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { + /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { + /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } else { + /* contiguous in window */ + from += wnext - op; + if (op < len) { + /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } else { + from = _out - dist; /* copy direct from output */ + do { + /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } else if ((op & 64) === 0) { + /* 2nd level distance code */ + here = dcode[(here & 0xffff /*here.val*/) + (hold & (1 << op) - 1)]; + continue dodist; + } else { + strm.msg = 'invalid distance code'; + state.mode = BAD$1; + break top; + } + break; // need to emulate goto via "continue" + } + } else if ((op & 64) === 0) { + /* 2nd level length code */ + here = lcode[(here & 0xffff /*here.val*/) + (hold & (1 << op) - 1)]; + continue dolen; + } else if (op & 32) { + /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE$1; + break top; + } else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD$1; + break top; + } + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last); + strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end); + state.hold = hold; + state.bits = bits; + return; + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var MAXBITS = 15; + var ENOUGH_LENS$1 = 852; + var ENOUGH_DISTS$1 = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + var CODES$1 = 0; + var LENS$1 = 1; + var DISTS$1 = 2; + var lbase = new Uint16Array([/* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0]); + var lext = new Uint8Array([/* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78]); + var dbase = new Uint16Array([/* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0]); + var dext = new Uint8Array([/* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64]); + var inflate_table = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) { + var bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + var len = 0; /* a code's length in bits */ + var sym = 0; /* index of code symbols */ + var min = 0, + max = 0; /* minimum and maximum code lengths */ + var root = 0; /* number of index bits for root table */ + var curr = 0; /* number of index bits for current table */ + var drop = 0; /* code bits to drop for sub-table */ + var left = 0; /* number of prefix codes available */ + var used = 0; /* code entries in table used */ + var huff = 0; /* Huffman code */ + var incr; /* for incrementing code, index */ + var fill; /* index for replicating entries */ + var low; /* low bits for current root entry */ + var mask; /* mask for low root bits */ + var next; /* next available space in table */ + var base = null; /* base value table to use */ + // let shoextra; /* extra bits table to use */ + var match; /* use base and extra for symbol >= match */ + var count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + var offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + var extra = null; + var here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { + break; + } + } + if (root > max) { + root = max; + } + if (max === 0) { + /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = 1 << 24 | 64 << 16 | 0; + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = 1 << 24 | 64 << 16 | 0; + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + + for (min = 1; min < max; min++) { + if (count[min] !== 0) { + break; + } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + + if (left > 0 && (type === CODES$1 || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES$1) { + base = extra = work; /* dummy value--not used */ + match = 20; + } else if (type === LENS$1) { + base = lbase; + extra = lext; + match = 257; + } else { + /* DISTS */ + base = dbase; + extra = dext; + match = 0; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if (type === LENS$1 && used > ENOUGH_LENS$1 || type === DISTS$1 && used > ENOUGH_DISTS$1) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] + 1 < match) { + here_op = 0; + here_val = work[sym]; + } else if (work[sym] >= match) { + here_op = extra[work[sym] - match]; + here_val = base[work[sym] - match]; + } else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << len - drop; + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << len - 1; + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { + break; + } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { + break; + } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if (type === LENS$1 && used > ENOUGH_LENS$1 || type === DISTS$1 && used > ENOUGH_DISTS$1) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = root << 24 | curr << 16 | next - table_index | 0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = len - drop << 24 | 64 << 16 | 0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; + }; + var inftrees = inflate_table; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var constants$1 = { + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var CODES = 0; + var LENS = 1; + var DISTS = 2; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_FINISH$1 = constants$1.Z_FINISH, + Z_BLOCK = constants$1.Z_BLOCK, + Z_TREES = constants$1.Z_TREES, + Z_OK$1 = constants$1.Z_OK, + Z_STREAM_END$1 = constants$1.Z_STREAM_END, + Z_NEED_DICT$1 = constants$1.Z_NEED_DICT, + Z_STREAM_ERROR$1 = constants$1.Z_STREAM_ERROR, + Z_DATA_ERROR$1 = constants$1.Z_DATA_ERROR, + Z_MEM_ERROR$1 = constants$1.Z_MEM_ERROR, + Z_BUF_ERROR = constants$1.Z_BUF_ERROR, + Z_DEFLATED = constants$1.Z_DEFLATED; + + /* STATES ====================================================================*/ + /* ===========================================================================*/ + + var HEAD = 16180; /* i: waiting for magic header */ + var FLAGS = 16181; /* i: waiting for method and flags (gzip) */ + var TIME = 16182; /* i: waiting for modification time (gzip) */ + var OS = 16183; /* i: waiting for extra flags and operating system (gzip) */ + var EXLEN = 16184; /* i: waiting for extra length (gzip) */ + var EXTRA = 16185; /* i: waiting for extra bytes (gzip) */ + var NAME = 16186; /* i: waiting for end of file name (gzip) */ + var COMMENT = 16187; /* i: waiting for end of comment (gzip) */ + var HCRC = 16188; /* i: waiting for header crc (gzip) */ + var DICTID = 16189; /* i: waiting for dictionary check value */ + var DICT = 16190; /* waiting for inflateSetDictionary() call */ + var TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ + var TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */ + var STORED = 16193; /* i: waiting for stored size (length and complement) */ + var COPY_ = 16194; /* i/o: same as COPY below, but only first time in */ + var COPY = 16195; /* i/o: waiting for input or output to copy stored block */ + var TABLE = 16196; /* i: waiting for dynamic block table lengths */ + var LENLENS = 16197; /* i: waiting for code length code lengths */ + var CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */ + var LEN_ = 16199; /* i: same as LEN below, but only first time in */ + var LEN = 16200; /* i: waiting for length/lit/eob code */ + var LENEXT = 16201; /* i: waiting for length extra bits */ + var DIST = 16202; /* i: waiting for distance code */ + var DISTEXT = 16203; /* i: waiting for distance extra bits */ + var MATCH = 16204; /* o: waiting for output space to copy string */ + var LIT = 16205; /* o: waiting for output space to write literal */ + var CHECK = 16206; /* i: waiting for 32-bit check value */ + var LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */ + var DONE = 16208; /* finished check, done -- remain here until reset */ + var BAD = 16209; /* got a data error -- remain here until reset */ + var MEM = 16210; /* got an inflate() memory error -- remain here until reset */ + var SYNC = 16211; /* looking for synchronization bytes to restart inflate() */ + + /* ===========================================================================*/ + + var ENOUGH_LENS = 852; + var ENOUGH_DISTS = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + var MAX_WBITS = 15; + /* 32K LZ77 window */ + var DEF_WBITS = MAX_WBITS; + var zswap32 = function zswap32(q) { + return (q >>> 24 & 0xff) + (q >>> 8 & 0xff00) + ((q & 0xff00) << 8) + ((q & 0xff) << 24); + }; + function InflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip, + bit 2 true to validate check value */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib), or + -1 if raw or no header yet */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ + } + + var inflateStateCheck = function inflateStateCheck(strm) { + if (!strm) { + return 1; + } + var state = strm.state; + if (!state || state.strm !== strm || state.mode < HEAD || state.mode > SYNC) { + return 1; + } + return 0; + }; + var inflateResetKeep = function inflateResetKeep(strm) { + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { + /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.flags = -1; + state.dmax = 32768; + state.head = null /*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK$1; + }; + var inflateReset = function inflateReset(strm) { + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + }; + var inflateReset2 = function inflateReset2(strm, windowBits) { + var wrap; + + /* get the state */ + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } else { + wrap = (windowBits >> 4) + 5; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR$1; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); + }; + var inflateInit2 = function inflateInit2(strm, windowBits) { + if (!strm) { + return Z_STREAM_ERROR$1; + } + //strm.msg = Z_NULL; /* in case we return an error */ + + var state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.strm = strm; + state.window = null /*Z_NULL*/; + state.mode = HEAD; /* to pass state test in inflateReset2() */ + var ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK$1) { + strm.state = null /*Z_NULL*/; + } + + return ret; + }; + var inflateInit = function inflateInit(strm) { + return inflateInit2(strm, DEF_WBITS); + }; + + /* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ + var virgin = true; + var lenfix, distfix; // We have no pointers in JS, so keep tables separate + + var fixedtables = function fixedtables(state) { + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + var sym = 0; + while (sym < 144) { + state.lens[sym++] = 8; + } + while (sym < 256) { + state.lens[sym++] = 9; + } + while (sym < 280) { + state.lens[sym++] = 7; + } + while (sym < 288) { + state.lens[sym++] = 8; + } + inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { + bits: 9 + }); + + /* distance table */ + sym = 0; + while (sym < 32) { + state.lens[sym++] = 5; + } + inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { + bits: 5 + }); + + /* do this just once */ + virgin = false; + } + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; + }; + + /* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ + var updatewindow = function updatewindow(strm, src, end, copy) { + var dist; + var state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } else { + state.wnext += dist; + if (state.wnext === state.wsize) { + state.wnext = 0; + } + if (state.whave < state.wsize) { + state.whave += dist; + } + } + } + return 0; + }; + var inflate$1 = function inflate(strm, flush) { + var state; + var input, output; // input/output buffers + var next; /* next input INDEX */ + var put; /* next output INDEX */ + var have, left; /* available input and output */ + var hold; /* bit buffer */ + var bits; /* bits in bit buffer */ + var _in, _out; /* save starting available input and output */ + var copy; /* number of stored or match bytes to copy */ + var from; /* where to copy match bytes from */ + var from_source; + var here = 0; /* current decoding table entry */ + var here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + var last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + var len; /* length to copy for repeats, bits to drop */ + var ret; /* return code */ + var hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + var opts; + var n; // temporary variable for NEED_BITS + + var order = /* permutation of code lengths */ + new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]); + if (inflateStateCheck(strm) || !strm.output || !strm.input && strm.avail_in !== 0) { + return Z_STREAM_ERROR$1; + } + state = strm.state; + if (state.mode === TYPE) { + state.mode = TYPEDO; + } /* skip check */ + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK$1; + inf_leave: + // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.wrap & 2 && hold === 0x8b1f) { + /* gzip header */ + if (state.wbits === 0) { + state.wbits = 15; + } + state.check = 0 /*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff /*BITS(8)*/) << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f /*BITS(4)*/) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f /*BITS(4)*/) + 8; + if (state.wbits === 0) { + state.wbits = len; + } + if (len > 15 || len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + state.flags = 0; /* indicate zlib header */ + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1 /*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = hold >> 8 & 1; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + hbuf[2] = hold >>> 16 & 0xff; + hbuf[3] = hold >>> 24 & 0xff; + state.check = crc32_1(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = hold & 0xff; + state.head.os = hold >> 8; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if (state.flags & 0x0200 && state.wrap & 4) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = hold >>> 8 & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } else if (state.head) { + state.head.extra = null /*Z_NULL*/; + } + + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { + copy = have; + } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set(input.subarray(next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy), /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + + if (state.flags & 0x0200 && state.wrap & 4) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { + break inf_leave; + } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { + break inf_leave; + } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && state.length < 65536 /*state.head.name_max*/) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + if (state.flags & 0x0200 && state.wrap & 4) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { + break inf_leave; + } + } else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { + break inf_leave; + } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && state.length < 65536 /*state.head.comm_max*/) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if (state.flags & 0x0200 && state.wrap & 4) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { + break inf_leave; + } + } else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.wrap & 4 && hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + + if (state.head) { + state.head.hcrc = state.flags >> 9 & 1; + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT$1; + } + strm.adler = state.check = 1 /*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { + break inf_leave; + } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = hold & 0x01 /*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch (hold & 0x03 /*BITS(2)*/) { + case 0: + /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: + /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: + /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== (hold >>> 16 ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { + break inf_leave; + } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { + copy = have; + } + if (copy > left) { + copy = left; + } + if (copy === 0) { + break inf_leave; + } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f /*BITS(5)*/) + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f /*BITS(5)*/) + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f /*BITS(4)*/) + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + //#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } + //#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = hold & 0x07; //BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + opts = { + bits: state.lenbits + }; + ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & (1 << state.lenbits) - 1]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03); //BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07); //BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f); //BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { + break; + } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + opts = { + bits: state.lenbits + }; + ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { + bits: state.distbits + }; + ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { + break inf_leave; + } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inffast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & (1 << state.lenbits) - 1]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + ((hold & (1 << last_bits + last_op) - 1 /*BITS(last.bits + last.op)*/) >> last_bits)]; + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (last_bits + here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & (1 << state.extra) - 1 /*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & (1 << state.distbits) - 1]; /*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + ((hold & (1 << last_bits + last_op) - 1 /*BITS(last.bits + last.op)*/) >> last_bits)]; + here_bits = here >>> 24; + here_op = here >>> 16 & 0xff; + here_val = here & 0xffff; + if (last_bits + here_bits <= bits) { + break; + } + //--- PULLBYTE() ---// + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = here_op & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & (1 << state.extra) - 1 /*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + //#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { + break inf_leave; + } + copy = _out - left; + if (state.offset > copy) { + /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // Trace((stderr, "inflate.c too far\n")); + // copy -= state.whave; + // if (copy > state.length) { copy = state.length; } + // if (copy > left) { copy = left; } + // left -= copy; + // state.length -= copy; + // do { + // output[put++] = 0; + // } while (--copy); + // if (state.length === 0) { state.mode = LEN; } + // break; + //#endif + } + + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } else { + from = state.wnext - copy; + } + if (copy > state.length) { + copy = state.length; + } + from_source = state.window; + } else { + /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { + copy = left; + } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { + state.mode = LEN; + } + break; + case LIT: + if (left === 0) { + break inf_leave; + } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if (state.wrap & 4 && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/ + state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out); + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if (state.wrap & 4 && (state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { + break inf_leave; + } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.wrap & 4 && hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END$1; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR$1; + break inf_leave; + case MEM: + return Z_MEM_ERROR$1; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR$1; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || _out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH$1)) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ; + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if (state.wrap & 4 && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/ + state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if ((_in === 0 && _out === 0 || flush === Z_FINISH$1) && ret === Z_OK$1) { + ret = Z_BUF_ERROR; + } + return ret; + }; + var inflateEnd = function inflateEnd(strm) { + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK$1; + }; + var inflateGetHeader = function inflateGetHeader(strm, head) { + /* check state */ + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + var state = strm.state; + if ((state.wrap & 2) === 0) { + return Z_STREAM_ERROR$1; + } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK$1; + }; + var inflateSetDictionary = function inflateSetDictionary(strm, dictionary) { + var dictLength = dictionary.length; + var state; + var dictid; + var ret; + + /* check state */ + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + state = strm.state; + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR$1; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32_1(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR$1; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR$1; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK$1; + }; + var inflateReset_1 = inflateReset; + var inflateReset2_1 = inflateReset2; + var inflateResetKeep_1 = inflateResetKeep; + var inflateInit_1 = inflateInit; + var inflateInit2_1 = inflateInit2; + var inflate_2$1 = inflate$1; + var inflateEnd_1 = inflateEnd; + var inflateGetHeader_1 = inflateGetHeader; + var inflateSetDictionary_1 = inflateSetDictionary; + var inflateInfo = 'pako inflate (from Nodeca project)'; + + /* Not implemented + module.exports.inflateCodesUsed = inflateCodesUsed; + module.exports.inflateCopy = inflateCopy; + module.exports.inflateGetDictionary = inflateGetDictionary; + module.exports.inflateMark = inflateMark; + module.exports.inflatePrime = inflatePrime; + module.exports.inflateSync = inflateSync; + module.exports.inflateSyncPoint = inflateSyncPoint; + module.exports.inflateUndermine = inflateUndermine; + module.exports.inflateValidate = inflateValidate; + */ + + var inflate_1$1 = { + inflateReset: inflateReset_1, + inflateReset2: inflateReset2_1, + inflateResetKeep: inflateResetKeep_1, + inflateInit: inflateInit_1, + inflateInit2: inflateInit2_1, + inflate: inflate_2$1, + inflateEnd: inflateEnd_1, + inflateGetHeader: inflateGetHeader_1, + inflateSetDictionary: inflateSetDictionary_1, + inflateInfo: inflateInfo + }; + + function _typeof(obj) { + "@babel/helpers - typeof"; + + return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { + return typeof obj; + } : function (obj) { + return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; + }, _typeof(obj); + } + + var _has = function _has(obj, key) { + return Object.prototype.hasOwnProperty.call(obj, key); + }; + var assign = function assign(obj /*from1, from2, from3, ...*/) { + var sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + var source = sources.shift(); + if (!source) { + continue; + } + if (_typeof(source) !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + for (var p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + return obj; + }; + + // Join array of chunks to single array. + var flattenChunks = function flattenChunks(chunks) { + // calculate data length + var len = 0; + for (var i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + var result = new Uint8Array(len); + for (var _i = 0, pos = 0, _l = chunks.length; _i < _l; _i++) { + var chunk = chunks[_i]; + result.set(chunk, pos); + pos += chunk.length; + } + return result; + }; + var common = { + assign: assign, + flattenChunks: flattenChunks + }; + + // String encode/decode helpers + + // Quick check if we can use fast array to bin string conversion + // + // - apply(Array) can fail on Android 2.2 + // - apply(Uint8Array) can fail on iOS 5.1 Safari + // + var STR_APPLY_UIA_OK = true; + try { + String.fromCharCode.apply(null, new Uint8Array(1)); + } catch (__) { + STR_APPLY_UIA_OK = false; + } + + // Table with utf8 lengths (calculated by first byte of sequence) + // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, + // because max possible codepoint is 0x10ffff + var _utf8len = new Uint8Array(256); + for (var q = 0; q < 256; q++) { + _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1; + } + _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + // convert string to array (typed, when possible) + var string2buf = function string2buf(str) { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + var buf, + c, + c2, + m_pos, + i, + str_len = str.length, + buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && m_pos + 1 < str_len) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + (c - 0xd800 << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | c >>> 6; + buf[i++] = 0x80 | c & 0x3f; + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | c >>> 12; + buf[i++] = 0x80 | c >>> 6 & 0x3f; + buf[i++] = 0x80 | c & 0x3f; + } else { + /* four bytes */ + buf[i++] = 0xf0 | c >>> 18; + buf[i++] = 0x80 | c >>> 12 & 0x3f; + buf[i++] = 0x80 | c >>> 6 & 0x3f; + buf[i++] = 0x80 | c & 0x3f; + } + } + return buf; + }; + + // Helper + var buf2binstring = function buf2binstring(buf, len) { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + var result = ''; + for (var i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; + }; + + // convert array to string + var buf2string = function buf2string(buf, max) { + var len = max || buf.length; + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + var i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len * 2); + for (out = 0, i = 0; i < len;) { + var c = buf[i++]; + // quick process ascii + if (c < 0x80) { + utf16buf[out++] = c; + continue; + } + var c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { + utf16buf[out++] = 0xfffd; + i += c_len - 1; + continue; + } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = c << 6 | buf[i++] & 0x3f; + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { + utf16buf[out++] = 0xfffd; + continue; + } + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | c >> 10 & 0x3ff; + utf16buf[out++] = 0xdc00 | c & 0x3ff; + } + } + return buf2binstring(utf16buf, out); + }; + + // Calculate max possible position in utf8 buffer, + // that will not break sequence. If that's not possible + // - (very small limits) return max size as is. + // + // buf[] - utf8 bytes array + // max - length limit (mandatory); + var utf8border = function utf8border(buf, max) { + max = max || buf.length; + if (max > buf.length) { + max = buf.length; + } + + // go back from last position, until start of sequence found + var pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { + pos--; + } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { + return max; + } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { + return max; + } + return pos + _utf8len[buf[pos]] > max ? pos : max; + }; + var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + var messages = { + 2: 'need dictionary', + /* Z_NEED_DICT 2 */ + 1: 'stream end', + /* Z_STREAM_END 1 */ + 0: '', + /* Z_OK 0 */ + '-1': 'file error', + /* Z_ERRNO (-1) */ + '-2': 'stream error', + /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', + /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', + /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', + /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = '' /*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2 /*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; + } + var zstream = ZStream; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; + } + var gzheader = GZheader; + + var toString = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + var Z_NO_FLUSH = constants$1.Z_NO_FLUSH, + Z_FINISH = constants$1.Z_FINISH, + Z_OK = constants$1.Z_OK, + Z_STREAM_END = constants$1.Z_STREAM_END, + Z_NEED_DICT = constants$1.Z_NEED_DICT, + Z_STREAM_ERROR = constants$1.Z_STREAM_ERROR, + Z_DATA_ERROR = constants$1.Z_DATA_ERROR, + Z_MEM_ERROR = constants$1.Z_MEM_ERROR; + + /* ===========================================================================*/ + + /** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + + /* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + + /** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + + /** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + /** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ + function Inflate(options) { + this.options = common.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + var opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && opt.windowBits >= 0 && opt.windowBits < 16) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { + opt.windowBits = -15; + } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if (opt.windowBits >= 0 && opt.windowBits < 16 && !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if (opt.windowBits > 15 && opt.windowBits < 48) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + var status = inflate_1$1.inflateInit2(this.strm, opt.windowBits); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + this.header = new gzheader(); + inflate_1$1.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { + //In raw mode we need to set the dictionary early + status = inflate_1$1.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + } + } + } + + /** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Inflate.prototype.push = function (data, flush_mode) { + var strm = this.strm; + var chunkSize = this.options.chunkSize; + var dictionary = this.options.dictionary; + var status, _flush_mode, last_avail_out; + if (this.ended) return false; + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + strm.next_in = 0; + strm.avail_in = strm.input.length; + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + status = inflate_1$1.inflate(strm, _flush_mode); + if (status === Z_NEED_DICT && dictionary) { + status = inflate_1$1.inflateSetDictionary(strm, dictionary); + if (status === Z_OK) { + status = inflate_1$1.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && status === Z_STREAM_END && strm.state.wrap > 0 && data[strm.next_in] !== 0) { + inflate_1$1.inflateReset(strm); + status = inflate_1$1.inflate(strm, _flush_mode); + } + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + if (this.options.to === 'string') { + var next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + var tail = strm.next_out - next_out_utf8; + var utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + this.onData(utf8str); + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = inflate_1$1.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + if (strm.avail_in === 0) break; + } + return true; + }; + + /** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Inflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + /** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Inflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = common.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + /** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ + function inflate(input, options) { + var inflator = new Inflate(options); + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || messages[inflator.err]; + return inflator.result; + } + + /** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function inflateRaw(input, options) { + options = options || {}; + options.raw = true; + return inflate(input, options); + } + + /** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + var Inflate_1 = Inflate; + var inflate_2 = inflate; + var inflateRaw_1 = inflateRaw; + var ungzip = inflate; + var constants = constants$1; + var inflate_1 = { + Inflate: Inflate_1, + inflate: inflate_2, + inflateRaw: inflateRaw_1, + ungzip: ungzip, + constants: constants + }; + + exports.Inflate = Inflate_1; + exports.constants = constants; + exports["default"] = inflate_1; + exports.inflate = inflate_2; + exports.inflateRaw = inflateRaw_1; + exports.ungzip = ungzip; + + Object.defineProperty(exports, '__esModule', { value: true }); + +})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.min.js b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.min.js new file mode 100644 index 0000000..5afd037 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.es5.min.js @@ -0,0 +1,2 @@ +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).pako={})}(this,(function(e){"use strict";var t=function(e,t,i,n){for(var a=65535&e|0,r=e>>>16&65535|0,o=0;0!==i;){i-=o=i>2e3?2e3:i;do{r=r+(a=a+t[n++]|0)|0}while(--o);a%=65521,r%=65521}return a|r<<16|0},i=new Uint32Array(function(){for(var e,t=[],i=0;i<256;i++){e=i;for(var n=0;n<8;n++)e=1&e?3988292384^e>>>1:e>>>1;t[i]=e}return t}()),n=function(e,t,n,a){var r=i,o=a+n;e^=-1;for(var s=a;s>>8^r[255&(e^t[s])];return-1^e},a=16209,r=function(e,t){var i,n,r,o,s,l,f,d,h,c,u,w,b,m,k,_,v,g,p,y,x,E,R,A,Z=e.state;i=e.next_in,R=e.input,n=i+(e.avail_in-5),r=e.next_out,A=e.output,o=r-(t-e.avail_out),s=r+(e.avail_out-257),l=Z.dmax,f=Z.wsize,d=Z.whave,h=Z.wnext,c=Z.window,u=Z.hold,w=Z.bits,b=Z.lencode,m=Z.distcode,k=(1<>>=g=v>>>24,w-=g,0===(g=v>>>16&255))A[r++]=65535&v;else{if(!(16&g)){if(0==(64&g)){v=b[(65535&v)+(u&(1<>>=g,w-=g),w<15&&(u+=R[i++]<>>=g=v>>>24,w-=g,!(16&(g=v>>>16&255))){if(0==(64&g)){v=m[(65535&v)+(u&(1<l){e.msg="invalid distance too far back",Z.mode=a;break e}if(u>>>=g,w-=g,y>(g=r-o)){if((g=y-g)>d&&Z.sane){e.msg="invalid distance too far back",Z.mode=a;break e}if(x=0,E=c,0===h){if(x+=f-g,g2;)A[r++]=E[x++],A[r++]=E[x++],A[r++]=E[x++],p-=3;p&&(A[r++]=E[x++],p>1&&(A[r++]=E[x++]))}else{x=r-y;do{A[r++]=A[x++],A[r++]=A[x++],A[r++]=A[x++],p-=3}while(p>2);p&&(A[r++]=A[x++],p>1&&(A[r++]=A[x++]))}break}}break}}while(i>3,u&=(1<<(w-=p<<3))-1,e.next_in=i,e.next_out=r,e.avail_in=i=1&&0===B[A];A--);if(Z>A&&(Z=A),0===A)return a[r++]=20971520,a[r++]=20971520,c.bits=1,0;for(R=1;R0&&(0===e||1!==A))return-1;for(N[1]=0,x=1;x852||2===e&&U>592)return 1;for(;;){v=x-T,h[E]+1<_?(g=0,p=h[E]):h[E]>=_?(g=C[h[E]-_],p=I[h[E]-_]):(g=96,p=0),u=1<>T)+(w-=u)]=v<<24|g<<16|p|0}while(0!==w);for(u=1<>=1;if(0!==u?(D&=u-1,D+=u):D=0,E++,0==--B[x]){if(x===A)break;x=t[i+h[E]]}if(x>Z&&(D&m)!==b){for(0===T&&(T=Z),k+=R,O=1<<(S=x-T);S+T852||2===e&&U>592)return 1;a[b=D&m]=Z<<24|S<<16|k-r|0}}return 0!==D&&(a[k+D]=x-T<<24|64<<16|0),c.bits=Z,0},c={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8},u=c.Z_FINISH,w=c.Z_BLOCK,b=c.Z_TREES,m=c.Z_OK,k=c.Z_STREAM_END,_=c.Z_NEED_DICT,v=c.Z_STREAM_ERROR,g=c.Z_DATA_ERROR,p=c.Z_MEM_ERROR,y=c.Z_BUF_ERROR,x=c.Z_DEFLATED,E=16180,R=16190,A=16191,Z=16192,S=16194,T=16199,O=16200,U=16206,D=16209,I=function(e){return(e>>>24&255)+(e>>>8&65280)+((65280&e)<<8)+((255&e)<<24)};function B(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}var N,C,z=function(e){if(!e)return 1;var t=e.state;return!t||t.strm!==e||t.mode16211?1:0},F=function(e){if(z(e))return v;var t=e.state;return e.total_in=e.total_out=t.total=0,e.msg="",t.wrap&&(e.adler=1&t.wrap),t.mode=E,t.last=0,t.havedict=0,t.flags=-1,t.dmax=32768,t.head=null,t.hold=0,t.bits=0,t.lencode=t.lendyn=new Int32Array(852),t.distcode=t.distdyn=new Int32Array(592),t.sane=1,t.back=-1,m},L=function(e){if(z(e))return v;var t=e.state;return t.wsize=0,t.whave=0,t.wnext=0,F(e)},M=function(e,t){var i;if(z(e))return v;var n=e.state;return t<0?(i=0,t=-t):(i=5+(t>>4),t<48&&(t&=15)),t&&(t<8||t>15)?v:(null!==n.window&&n.wbits!==t&&(n.window=null),n.wrap=i,n.wbits=t,L(e))},H=function(e,t){if(!e)return v;var i=new B;e.state=i,i.strm=e,i.window=null,i.mode=E;var n=M(e,t);return n!==m&&(e.state=null),n},j=!0,K=function(e){if(j){N=new Int32Array(512),C=new Int32Array(32);for(var t=0;t<144;)e.lens[t++]=8;for(;t<256;)e.lens[t++]=9;for(;t<280;)e.lens[t++]=7;for(;t<288;)e.lens[t++]=8;for(h(1,e.lens,0,288,N,0,e.work,{bits:9}),t=0;t<32;)e.lens[t++]=5;h(2,e.lens,0,32,C,0,e.work,{bits:5}),j=!1}e.lencode=N,e.lenbits=9,e.distcode=C,e.distbits=5},P=function(e,t,i,n){var a,r=e.state;return null===r.window&&(r.wsize=1<=r.wsize?(r.window.set(t.subarray(i-r.wsize,i),0),r.wnext=0,r.whave=r.wsize):((a=r.wsize-r.wnext)>n&&(a=n),r.window.set(t.subarray(i-n,i-n+a),r.wnext),(n-=a)?(r.window.set(t.subarray(i-n,i),0),r.wnext=n,r.whave=r.wsize):(r.wnext+=a,r.wnext===r.wsize&&(r.wnext=0),r.whave>>8&255,a.check=n(a.check,te,2,0),B=0,N=0,a.mode=16181;break}if(a.head&&(a.head.done=!1),!(1&a.wrap)||(((255&B)<<8)+(B>>8))%31){e.msg="incorrect header check",a.mode=D;break}if((15&B)!==x){e.msg="unknown compression method",a.mode=D;break}if(N-=4,J=8+(15&(B>>>=4)),0===a.wbits&&(a.wbits=J),J>15||J>a.wbits){e.msg="invalid window size",a.mode=D;break}a.dmax=1<>8&1),512&a.flags&&4&a.wrap&&(te[0]=255&B,te[1]=B>>>8&255,a.check=n(a.check,te,2,0)),B=0,N=0,a.mode=16182;case 16182:for(;N<32;){if(0===d)break e;d--,B+=o[l++]<>>8&255,te[2]=B>>>16&255,te[3]=B>>>24&255,a.check=n(a.check,te,4,0)),B=0,N=0,a.mode=16183;case 16183:for(;N<16;){if(0===d)break e;d--,B+=o[l++]<>8),512&a.flags&&4&a.wrap&&(te[0]=255&B,te[1]=B>>>8&255,a.check=n(a.check,te,2,0)),B=0,N=0,a.mode=16184;case 16184:if(1024&a.flags){for(;N<16;){if(0===d)break e;d--,B+=o[l++]<>>8&255,a.check=n(a.check,te,2,0)),B=0,N=0}else a.head&&(a.head.extra=null);a.mode=16185;case 16185:if(1024&a.flags&&((L=a.length)>d&&(L=d),L&&(a.head&&(J=a.head.extra_len-a.length,a.head.extra||(a.head.extra=new Uint8Array(a.head.extra_len)),a.head.extra.set(o.subarray(l,l+L),J)),512&a.flags&&4&a.wrap&&(a.check=n(a.check,o,L,l)),d-=L,l+=L,a.length-=L),a.length))break e;a.length=0,a.mode=16186;case 16186:if(2048&a.flags){if(0===d)break e;L=0;do{J=o[l+L++],a.head&&J&&a.length<65536&&(a.head.name+=String.fromCharCode(J))}while(J&&L>9&1,a.head.done=!0),e.adler=a.check=0,a.mode=A;break;case 16189:for(;N<32;){if(0===d)break e;d--,B+=o[l++]<>>=7&N,N-=7&N,a.mode=U;break}for(;N<3;){if(0===d)break e;d--,B+=o[l++]<>>=1)){case 0:a.mode=16193;break;case 1:if(K(a),a.mode=T,i===b){B>>>=2,N-=2;break e}break;case 2:a.mode=16196;break;case 3:e.msg="invalid block type",a.mode=D}B>>>=2,N-=2;break;case 16193:for(B>>>=7&N,N-=7&N;N<32;){if(0===d)break e;d--,B+=o[l++]<>>16^65535)){e.msg="invalid stored block lengths",a.mode=D;break}if(a.length=65535&B,B=0,N=0,a.mode=S,i===b)break e;case S:a.mode=16195;case 16195:if(L=a.length){if(L>d&&(L=d),L>c&&(L=c),0===L)break e;s.set(o.subarray(l,l+L),f),d-=L,l+=L,c-=L,f+=L,a.length-=L;break}a.mode=A;break;case 16196:for(;N<14;){if(0===d)break e;d--,B+=o[l++]<>>=5,N-=5,a.ndist=1+(31&B),B>>>=5,N-=5,a.ncode=4+(15&B),B>>>=4,N-=4,a.nlen>286||a.ndist>30){e.msg="too many length or distance symbols",a.mode=D;break}a.have=0,a.mode=16197;case 16197:for(;a.have>>=3,N-=3}for(;a.have<19;)a.lens[ie[a.have++]]=0;if(a.lencode=a.lendyn,a.lenbits=7,V={bits:a.lenbits},Q=h(0,a.lens,0,19,a.lencode,0,a.work,V),a.lenbits=V.bits,Q){e.msg="invalid code lengths set",a.mode=D;break}a.have=0,a.mode=16198;case 16198:for(;a.have>>16&255,G=65535&ee,!((j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<>>=j,N-=j,a.lens[a.have++]=G;else{if(16===G){for($=j+2;N<$;){if(0===d)break e;d--,B+=o[l++]<>>=j,N-=j,0===a.have){e.msg="invalid bit length repeat",a.mode=D;break}J=a.lens[a.have-1],L=3+(3&B),B>>>=2,N-=2}else if(17===G){for($=j+3;N<$;){if(0===d)break e;d--,B+=o[l++]<>>=j)),B>>>=3,N-=3}else{for($=j+7;N<$;){if(0===d)break e;d--,B+=o[l++]<>>=j)),B>>>=7,N-=7}if(a.have+L>a.nlen+a.ndist){e.msg="invalid bit length repeat",a.mode=D;break}for(;L--;)a.lens[a.have++]=J}}if(a.mode===D)break;if(0===a.lens[256]){e.msg="invalid code -- missing end-of-block",a.mode=D;break}if(a.lenbits=9,V={bits:a.lenbits},Q=h(1,a.lens,0,a.nlen,a.lencode,0,a.work,V),a.lenbits=V.bits,Q){e.msg="invalid literal/lengths set",a.mode=D;break}if(a.distbits=6,a.distcode=a.distdyn,V={bits:a.distbits},Q=h(2,a.lens,a.nlen,a.ndist,a.distcode,0,a.work,V),a.distbits=V.bits,Q){e.msg="invalid distances set",a.mode=D;break}if(a.mode=T,i===b)break e;case T:a.mode=O;case O:if(d>=6&&c>=258){e.next_out=f,e.avail_out=c,e.next_in=l,e.avail_in=d,a.hold=B,a.bits=N,r(e,F),f=e.next_out,s=e.output,c=e.avail_out,l=e.next_in,o=e.input,d=e.avail_in,B=a.hold,N=a.bits,a.mode===A&&(a.back=-1);break}for(a.back=0;Y=(ee=a.lencode[B&(1<>>16&255,G=65535&ee,!((j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<>X)])>>>16&255,G=65535&ee,!(X+(j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<>>=X,N-=X,a.back+=X}if(B>>>=j,N-=j,a.back+=j,a.length=G,0===Y){a.mode=16205;break}if(32&Y){a.back=-1,a.mode=A;break}if(64&Y){e.msg="invalid literal/length code",a.mode=D;break}a.extra=15&Y,a.mode=16201;case 16201:if(a.extra){for($=a.extra;N<$;){if(0===d)break e;d--,B+=o[l++]<>>=a.extra,N-=a.extra,a.back+=a.extra}a.was=a.length,a.mode=16202;case 16202:for(;Y=(ee=a.distcode[B&(1<>>16&255,G=65535&ee,!((j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<>X)])>>>16&255,G=65535&ee,!(X+(j=ee>>>24)<=N);){if(0===d)break e;d--,B+=o[l++]<>>=X,N-=X,a.back+=X}if(B>>>=j,N-=j,a.back+=j,64&Y){e.msg="invalid distance code",a.mode=D;break}a.offset=G,a.extra=15&Y,a.mode=16203;case 16203:if(a.extra){for($=a.extra;N<$;){if(0===d)break e;d--,B+=o[l++]<>>=a.extra,N-=a.extra,a.back+=a.extra}if(a.offset>a.dmax){e.msg="invalid distance too far back",a.mode=D;break}a.mode=16204;case 16204:if(0===c)break e;if(L=F-c,a.offset>L){if((L=a.offset-L)>a.whave&&a.sane){e.msg="invalid distance too far back",a.mode=D;break}L>a.wnext?(L-=a.wnext,M=a.wsize-L):M=a.wnext-L,L>a.length&&(L=a.length),H=a.window}else H=s,M=f-a.offset,L=a.length;L>c&&(L=c),c-=L,a.length-=L;do{s[f++]=H[M++]}while(--L);0===a.length&&(a.mode=O);break;case 16205:if(0===c)break e;s[f++]=a.length,c--,a.mode=O;break;case U:if(a.wrap){for(;N<32;){if(0===d)break e;d--,B|=o[l++]<=252?6:V>=248?5:V>=240?4:V>=224?3:V>=192?2:1;Q[254]=Q[254]=1;var $=function(e){if("function"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(e);var t,i,n,a,r,o=e.length,s=0;for(a=0;a>>6,t[r++]=128|63&i):i<65536?(t[r++]=224|i>>>12,t[r++]=128|i>>>6&63,t[r++]=128|63&i):(t[r++]=240|i>>>18,t[r++]=128|i>>>12&63,t[r++]=128|i>>>6&63,t[r++]=128|63&i);return t},ee=function(e,t){var i,n,a=t||e.length;if("function"==typeof TextDecoder&&TextDecoder.prototype.decode)return(new TextDecoder).decode(e.subarray(0,t));var r=new Array(2*a);for(n=0,i=0;i4)r[n++]=65533,i+=s-1;else{for(o&=2===s?31:3===s?15:7;s>1&&i1?r[n++]=65533:o<65536?r[n++]=o:(o-=65536,r[n++]=55296|o>>10&1023,r[n++]=56320|1023&o)}}}return function(e,t){if(t<65534&&e.subarray&&J)return String.fromCharCode.apply(null,e.length===t?e:e.subarray(0,t));for(var i="",n=0;ne.length&&(t=e.length);for(var i=t-1;i>=0&&128==(192&e[i]);)i--;return i<0||0===i?t:i+Q[e[i]]>t?i:t},ie={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"};var ne=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0};var ae=function(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name="",this.comment="",this.hcrc=0,this.done=!1},re=Object.prototype.toString,oe=c.Z_NO_FLUSH,se=c.Z_FINISH,le=c.Z_OK,fe=c.Z_STREAM_END,de=c.Z_NEED_DICT,he=c.Z_STREAM_ERROR,ce=c.Z_DATA_ERROR,ue=c.Z_MEM_ERROR;function we(e){this.options=W({chunkSize:65536,windowBits:15,to:""},e||{});var t=this.options;t.raw&&t.windowBits>=0&&t.windowBits<16&&(t.windowBits=-t.windowBits,0===t.windowBits&&(t.windowBits=-15)),!(t.windowBits>=0&&t.windowBits<16)||e&&e.windowBits||(t.windowBits+=32),t.windowBits>15&&t.windowBits<48&&0==(15&t.windowBits)&&(t.windowBits|=15),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new ne,this.strm.avail_out=0;var i=Y.inflateInit2(this.strm,t.windowBits);if(i!==le)throw new Error(ie[i]);if(this.header=new ae,Y.inflateGetHeader(this.strm,this.header),t.dictionary&&("string"==typeof t.dictionary?t.dictionary=$(t.dictionary):"[object ArrayBuffer]"===re.call(t.dictionary)&&(t.dictionary=new Uint8Array(t.dictionary)),t.raw&&(i=Y.inflateSetDictionary(this.strm,t.dictionary))!==le))throw new Error(ie[i])}function be(e,t){var i=new we(t);if(i.push(e),i.err)throw i.msg||ie[i.err];return i.result}we.prototype.push=function(e,t){var i,n,a,r=this.strm,o=this.options.chunkSize,s=this.options.dictionary;if(this.ended)return!1;for(n=t===~~t?t:!0===t?se:oe,"[object ArrayBuffer]"===re.call(e)?r.input=new Uint8Array(e):r.input=e,r.next_in=0,r.avail_in=r.input.length;;){for(0===r.avail_out&&(r.output=new Uint8Array(o),r.next_out=0,r.avail_out=o),(i=Y.inflate(r,n))===de&&s&&((i=Y.inflateSetDictionary(r,s))===le?i=Y.inflate(r,n):i===ce&&(i=de));r.avail_in>0&&i===fe&&r.state.wrap>0&&0!==e[r.next_in];)Y.inflateReset(r),i=Y.inflate(r,n);switch(i){case he:case ce:case de:case ue:return this.onEnd(i),this.ended=!0,!1}if(a=r.avail_out,r.next_out&&(0===r.avail_out||i===fe))if("string"===this.options.to){var l=te(r.output,r.next_out),f=r.next_out-l,d=ee(r.output,l);r.next_out=f,r.avail_out=o-f,f&&r.output.set(r.output.subarray(l,l+f),0),this.onData(d)}else this.onData(r.output.length===r.next_out?r.output:r.output.subarray(0,r.next_out));if(i!==le||0!==a){if(i===fe)return i=Y.inflateEnd(this.strm),this.onEnd(i),this.ended=!0,!0;if(0===r.avail_in)break}}return!0},we.prototype.onData=function(e){this.chunks.push(e)},we.prototype.onEnd=function(e){e===le&&("string"===this.options.to?this.result=this.chunks.join(""):this.result=q(this.chunks)),this.chunks=[],this.err=e,this.msg=this.strm.msg};var me=we,ke=be,_e=function(e,t){return(t=t||{}).raw=!0,be(e,t)},ve=be,ge=c,pe={Inflate:me,inflate:ke,inflateRaw:_e,ungzip:ve,constants:ge};e.Inflate=me,e.constants=ge,e.default=pe,e.inflate=ke,e.inflateRaw=_e,e.ungzip=ve,Object.defineProperty(e,"__esModule",{value:!0})})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.js b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.js new file mode 100644 index 0000000..1a98d50 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.js @@ -0,0 +1,3239 @@ + +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +(function (global, factory) { + typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : + typeof define === 'function' && define.amd ? define(['exports'], factory) : + (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.pako = {})); +})(this, (function (exports) { 'use strict'; + + // Note: adler32 takes 12% for level 0 and 2% for level 6. + // It isn't worth it to make additional optimizations as in original. + // Small size is preferable. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const adler32 = (adler, buf, len, pos) => { + let s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; + }; + + + var adler32_1 = adler32; + + // Note: we can't get significant speed boost here. + // So write code to minimize size - no pregenerated tables + // and array tools dependencies. + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // Use ordinary array, since untyped makes no boost here + const makeTable = () => { + let c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; + }; + + // Create table on load. Just 255 signed longs. Not a problem. + const crcTable = new Uint32Array(makeTable()); + + + const crc32 = (crc, buf, len, pos) => { + const t = crcTable; + const end = pos + len; + + crc ^= -1; + + for (let i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; + }; + + + var crc32_1 = crc32; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + // See state defs from inflate.js + const BAD$1 = 16209; /* got a data error -- remain here until reset */ + const TYPE$1 = 16191; /* i: waiting for type bits, including last-flag bit */ + + /* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ + var inffast = function inflate_fast(strm, start) { + let _in; /* local strm.input */ + let last; /* have enough input while in < last */ + let _out; /* local strm.output */ + let beg; /* inflate()'s initial strm.output */ + let end; /* while out < end, enough space available */ + //#ifdef INFLATE_STRICT + let dmax; /* maximum distance from zlib header */ + //#endif + let wsize; /* window size or zero if not using window */ + let whave; /* valid bytes in the window */ + let wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + let s_window; /* allocated sliding window, if wsize != 0 */ + let hold; /* local strm.hold */ + let bits; /* local strm.bits */ + let lcode; /* local strm.lencode */ + let dcode; /* local strm.distcode */ + let lmask; /* mask for first level of length codes */ + let dmask; /* mask for first level of distance codes */ + let here; /* retrieved table entry */ + let op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + let len; /* match length, unused bytes */ + let dist; /* match distance */ + let from; /* where to copy match from */ + let from_source; + + + let input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + const state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); + //#ifdef INFLATE_STRICT + dmax = state.dmax; + //#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: + do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + + here = lcode[hold & lmask]; + + dolen: + for (;;) { // Goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + if (op === 0) { /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff/*here.val*/; + } + else if (op & 16) { /* length base */ + len = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & ((1 << op) - 1); + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + + dodist: + for (;;) { // goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + + if (op & 16) { /* distance base */ + dist = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & ((1 << op) - 1); + //#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + //#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD$1; + break top; + } + + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // if (len <= op - whave) { + // do { + // output[_out++] = 0; + // } while (--len); + // continue top; + // } + // len -= op - whave; + // do { + // output[_out++] = 0; + // } while (--op > whave); + // if (op === 0) { + // from = _out - dist; + // do { + // output[_out++] = output[from++]; + // } while (--len); + // continue top; + // } + //#endif + } + from = 0; // window index + from_source = s_window; + if (wnext === 0) { /* very common case */ + from += wsize - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + else if (wnext < op) { /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } + else { /* contiguous in window */ + from += wnext - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } + else { + from = _out - dist; /* copy direct from output */ + do { /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } + else if ((op & 64) === 0) { /* 2nd level distance code */ + here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dodist; + } + else { + strm.msg = 'invalid distance code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } + else if ((op & 64) === 0) { /* 2nd level length code */ + here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dolen; + } + else if (op & 32) { /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE$1; + break top; + } + else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD$1; + break top; + } + + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); + strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); + state.hold = hold; + state.bits = bits; + return; + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + const MAXBITS = 15; + const ENOUGH_LENS$1 = 852; + const ENOUGH_DISTS$1 = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + const CODES$1 = 0; + const LENS$1 = 1; + const DISTS$1 = 2; + + const lbase = new Uint16Array([ /* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 + ]); + + const lext = new Uint8Array([ /* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, + 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 + ]); + + const dbase = new Uint16Array([ /* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577, 0, 0 + ]); + + const dext = new Uint8Array([ /* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, + 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, + 28, 28, 29, 29, 64, 64 + ]); + + const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) => + { + const bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + let len = 0; /* a code's length in bits */ + let sym = 0; /* index of code symbols */ + let min = 0, max = 0; /* minimum and maximum code lengths */ + let root = 0; /* number of index bits for root table */ + let curr = 0; /* number of index bits for current table */ + let drop = 0; /* code bits to drop for sub-table */ + let left = 0; /* number of prefix codes available */ + let used = 0; /* code entries in table used */ + let huff = 0; /* Huffman code */ + let incr; /* for incrementing code, index */ + let fill; /* index for replicating entries */ + let low; /* low bits for current root entry */ + let mask; /* mask for low root bits */ + let next; /* next available space in table */ + let base = null; /* base value table to use */ + // let shoextra; /* extra bits table to use */ + let match; /* use base and extra for symbol >= match */ + const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + let extra = null; + + let here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { break; } + } + if (root > max) { + root = max; + } + if (max === 0) { /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + for (min = 1; min < max; min++) { + if (count[min] !== 0) { break; } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + if (left > 0 && (type === CODES$1 || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES$1) { + base = extra = work; /* dummy value--not used */ + match = 20; + + } else if (type === LENS$1) { + base = lbase; + extra = lext; + match = 257; + + } else { /* DISTS */ + base = dbase; + extra = dext; + match = 0; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] + 1 < match) { + here_op = 0; + here_val = work[sym]; + } + else if (work[sym] >= match) { + here_op = extra[work[sym] - match]; + here_val = base[work[sym] - match]; + } + else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << (len - drop); + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << (len - 1); + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { break; } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { break; } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if ((type === LENS$1 && used > ENOUGH_LENS$1) || + (type === DISTS$1 && used > ENOUGH_DISTS$1)) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; + }; + + + var inftrees = inflate_table; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var constants$1 = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + + + + + + const CODES = 0; + const LENS = 1; + const DISTS = 2; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES, + Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR, + Z_DEFLATED + } = constants$1; + + + /* STATES ====================================================================*/ + /* ===========================================================================*/ + + + const HEAD = 16180; /* i: waiting for magic header */ + const FLAGS = 16181; /* i: waiting for method and flags (gzip) */ + const TIME = 16182; /* i: waiting for modification time (gzip) */ + const OS = 16183; /* i: waiting for extra flags and operating system (gzip) */ + const EXLEN = 16184; /* i: waiting for extra length (gzip) */ + const EXTRA = 16185; /* i: waiting for extra bytes (gzip) */ + const NAME = 16186; /* i: waiting for end of file name (gzip) */ + const COMMENT = 16187; /* i: waiting for end of comment (gzip) */ + const HCRC = 16188; /* i: waiting for header crc (gzip) */ + const DICTID = 16189; /* i: waiting for dictionary check value */ + const DICT = 16190; /* waiting for inflateSetDictionary() call */ + const TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ + const TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */ + const STORED = 16193; /* i: waiting for stored size (length and complement) */ + const COPY_ = 16194; /* i/o: same as COPY below, but only first time in */ + const COPY = 16195; /* i/o: waiting for input or output to copy stored block */ + const TABLE = 16196; /* i: waiting for dynamic block table lengths */ + const LENLENS = 16197; /* i: waiting for code length code lengths */ + const CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */ + const LEN_ = 16199; /* i: same as LEN below, but only first time in */ + const LEN = 16200; /* i: waiting for length/lit/eob code */ + const LENEXT = 16201; /* i: waiting for length extra bits */ + const DIST = 16202; /* i: waiting for distance code */ + const DISTEXT = 16203; /* i: waiting for distance extra bits */ + const MATCH = 16204; /* o: waiting for output space to copy string */ + const LIT = 16205; /* o: waiting for output space to write literal */ + const CHECK = 16206; /* i: waiting for 32-bit check value */ + const LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */ + const DONE = 16208; /* finished check, done -- remain here until reset */ + const BAD = 16209; /* got a data error -- remain here until reset */ + const MEM = 16210; /* got an inflate() memory error -- remain here until reset */ + const SYNC = 16211; /* looking for synchronization bytes to restart inflate() */ + + /* ===========================================================================*/ + + + + const ENOUGH_LENS = 852; + const ENOUGH_DISTS = 592; + //const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + + const MAX_WBITS = 15; + /* 32K LZ77 window */ + const DEF_WBITS = MAX_WBITS; + + + const zswap32 = (q) => { + + return (((q >>> 24) & 0xff) + + ((q >>> 8) & 0xff00) + + ((q & 0xff00) << 8) + + ((q & 0xff) << 24)); + }; + + + function InflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip, + bit 2 true to validate check value */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib), or + -1 if raw or no header yet */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ + } + + + const inflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const state = strm.state; + if (!state || state.strm !== strm || + state.mode < HEAD || state.mode > SYNC) { + return 1; + } + return 0; + }; + + + const inflateResetKeep = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.flags = -1; + state.dmax = 32768; + state.head = null/*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK$1; + }; + + + const inflateReset = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + + }; + + + const inflateReset2 = (strm, windowBits) => { + let wrap; + + /* get the state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } + else { + wrap = (windowBits >> 4) + 5; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR$1; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); + }; + + + const inflateInit2 = (strm, windowBits) => { + + if (!strm) { return Z_STREAM_ERROR$1; } + //strm.msg = Z_NULL; /* in case we return an error */ + + const state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.strm = strm; + state.window = null/*Z_NULL*/; + state.mode = HEAD; /* to pass state test in inflateReset2() */ + const ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK$1) { + strm.state = null/*Z_NULL*/; + } + return ret; + }; + + + const inflateInit = (strm) => { + + return inflateInit2(strm, DEF_WBITS); + }; + + + /* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ + let virgin = true; + + let lenfix, distfix; // We have no pointers in JS, so keep tables separate + + + const fixedtables = (state) => { + + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + let sym = 0; + while (sym < 144) { state.lens[sym++] = 8; } + while (sym < 256) { state.lens[sym++] = 9; } + while (sym < 280) { state.lens[sym++] = 7; } + while (sym < 288) { state.lens[sym++] = 8; } + + inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); + + /* distance table */ + sym = 0; + while (sym < 32) { state.lens[sym++] = 5; } + + inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); + + /* do this just once */ + virgin = false; + } + + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; + }; + + + /* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ + const updatewindow = (strm, src, end, copy) => { + + let dist; + const state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } + else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } + else { + state.wnext += dist; + if (state.wnext === state.wsize) { state.wnext = 0; } + if (state.whave < state.wsize) { state.whave += dist; } + } + } + return 0; + }; + + + const inflate$1 = (strm, flush) => { + + let state; + let input, output; // input/output buffers + let next; /* next input INDEX */ + let put; /* next output INDEX */ + let have, left; /* available input and output */ + let hold; /* bit buffer */ + let bits; /* bits in bit buffer */ + let _in, _out; /* save starting available input and output */ + let copy; /* number of stored or match bytes to copy */ + let from; /* where to copy match bytes from */ + let from_source; + let here = 0; /* current decoding table entry */ + let here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + let last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + let len; /* length to copy for repeats, bits to drop */ + let ret; /* return code */ + const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + let opts; + + let n; // temporary variable for NEED_BITS + + const order = /* permutation of code lengths */ + new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]); + + + if (inflateStateCheck(strm) || !strm.output || + (!strm.input && strm.avail_in !== 0)) { + return Z_STREAM_ERROR$1; + } + + state = strm.state; + if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ + + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK$1; + + inf_leave: // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ + if (state.wbits === 0) { + state.wbits = 15; + } + state.check = 0/*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f)/*BITS(4)*/ + 8; + if (state.wbits === 0) { + state.wbits = len; + } + if (len > 15 || len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + state.flags = 0; /* indicate zlib header */ + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = ((hold >> 8) & 1); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + hbuf[2] = (hold >>> 16) & 0xff; + hbuf[3] = (hold >>> 24) & 0xff; + state.check = crc32_1(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = (hold & 0xff); + state.head.os = (hold >> 8); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32_1(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + else if (state.head) { + state.head.extra = null/*Z_NULL*/; + } + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { copy = have; } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set( + input.subarray( + next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy + ), + /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len + ); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { break inf_leave; } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.name_max*/)) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.comm_max*/)) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32_1(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + if (state.head) { + state.head.hcrc = ((state.flags >> 9) & 1); + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT$1; + } + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = (hold & 0x01)/*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch ((hold & 0x03)/*BITS(2)*/) { + case 0: /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { copy = have; } + if (copy > left) { copy = left; } + if (copy === 0) { break inf_leave; } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + //#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } + //#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + + opts = { bits: state.lenbits }; + ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } + else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03);//BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } + else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f);//BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { break; } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + + opts = { bits: state.lenbits }; + ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { bits: state.distbits }; + ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inffast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if (here_bits <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = (here_op) & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + //#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { break inf_leave; } + copy = _out - left; + if (state.offset > copy) { /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } + // (!) This block is disabled in zlib defaults, + // don't enable it for binary compatibility + //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR + // Trace((stderr, "inflate.c too far\n")); + // copy -= state.whave; + // if (copy > state.length) { copy = state.length; } + // if (copy > left) { copy = left; } + // left -= copy; + // state.length -= copy; + // do { + // output[put++] = 0; + // } while (--copy); + // if (state.length === 0) { state.mode = LEN; } + // break; + //#endif + } + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } + else { + from = state.wnext - copy; + } + if (copy > state.length) { copy = state.length; } + from_source = state.window; + } + else { /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { copy = left; } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { state.mode = LEN; } + break; + case LIT: + if (left === 0) { break inf_leave; } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = + /*UPDATE_CHECK(state.check, put - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out)); + + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END$1; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR$1; + break inf_leave; + case MEM: + return Z_MEM_ERROR$1; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR$1; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && + (state.mode < CHECK || flush !== Z_FINISH$1))) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ; + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/ + (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out)); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + + (state.mode === TYPE ? 128 : 0) + + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) { + ret = Z_BUF_ERROR; + } + return ret; + }; + + + const inflateEnd = (strm) => { + + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR$1; + } + + let state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK$1; + }; + + + const inflateGetHeader = (strm, head) => { + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + const state = strm.state; + if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK$1; + }; + + + const inflateSetDictionary = (strm, dictionary) => { + const dictLength = dictionary.length; + + let state; + let dictid; + let ret; + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; } + state = strm.state; + + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR$1; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32_1(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR$1; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR$1; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK$1; + }; + + + var inflateReset_1 = inflateReset; + var inflateReset2_1 = inflateReset2; + var inflateResetKeep_1 = inflateResetKeep; + var inflateInit_1 = inflateInit; + var inflateInit2_1 = inflateInit2; + var inflate_2$1 = inflate$1; + var inflateEnd_1 = inflateEnd; + var inflateGetHeader_1 = inflateGetHeader; + var inflateSetDictionary_1 = inflateSetDictionary; + var inflateInfo = 'pako inflate (from Nodeca project)'; + + /* Not implemented + module.exports.inflateCodesUsed = inflateCodesUsed; + module.exports.inflateCopy = inflateCopy; + module.exports.inflateGetDictionary = inflateGetDictionary; + module.exports.inflateMark = inflateMark; + module.exports.inflatePrime = inflatePrime; + module.exports.inflateSync = inflateSync; + module.exports.inflateSyncPoint = inflateSyncPoint; + module.exports.inflateUndermine = inflateUndermine; + module.exports.inflateValidate = inflateValidate; + */ + + var inflate_1$1 = { + inflateReset: inflateReset_1, + inflateReset2: inflateReset2_1, + inflateResetKeep: inflateResetKeep_1, + inflateInit: inflateInit_1, + inflateInit2: inflateInit2_1, + inflate: inflate_2$1, + inflateEnd: inflateEnd_1, + inflateGetHeader: inflateGetHeader_1, + inflateSetDictionary: inflateSetDictionary_1, + inflateInfo: inflateInfo + }; + + const _has = (obj, key) => { + return Object.prototype.hasOwnProperty.call(obj, key); + }; + + var assign = function (obj /*from1, from2, from3, ...*/) { + const sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + const source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (const p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + + return obj; + }; + + + // Join array of chunks to single array. + var flattenChunks = (chunks) => { + // calculate data length + let len = 0; + + for (let i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + const result = new Uint8Array(len); + + for (let i = 0, pos = 0, l = chunks.length; i < l; i++) { + let chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; + }; + + var common = { + assign: assign, + flattenChunks: flattenChunks + }; + + // String encode/decode helpers + + + // Quick check if we can use fast array to bin string conversion + // + // - apply(Array) can fail on Android 2.2 + // - apply(Uint8Array) can fail on iOS 5.1 Safari + // + let STR_APPLY_UIA_OK = true; + + try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + + // Table with utf8 lengths (calculated by first byte of sequence) + // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, + // because max possible codepoint is 0x10ffff + const _utf8len = new Uint8Array(256); + for (let q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); + } + _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + + // convert string to array (typed, when possible) + var string2buf = (str) => { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + + let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; + }; + + // Helper + const buf2binstring = (buf, len) => { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + + let result = ''; + for (let i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; + }; + + + // convert array to string + var buf2string = (buf, max) => { + const len = max || buf.length; + + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + + let i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + const utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + let c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + let c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); + }; + + + // Calculate max possible position in utf8 buffer, + // that will not break sequence. If that's not possible + // - (very small limits) return max size as is. + // + // buf[] - utf8 bytes array + // max - length limit (mandatory); + var utf8border = (buf, max) => { + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + let pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; + }; + + var strings = { + string2buf: string2buf, + buf2string: buf2string, + utf8border: utf8border + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + var messages = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ + }; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; + } + + var zstream = ZStream; + + // (C) 1995-2013 Jean-loup Gailly and Mark Adler + // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + // + // This software is provided 'as-is', without any express or implied + // warranty. In no event will the authors be held liable for any damages + // arising from the use of this software. + // + // Permission is granted to anyone to use this software for any purpose, + // including commercial applications, and to alter it and redistribute it + // freely, subject to the following restrictions: + // + // 1. The origin of this software must not be misrepresented; you must not + // claim that you wrote the original software. If you use this software + // in a product, an acknowledgment in the product documentation would be + // appreciated but is not required. + // 2. Altered source versions must be plainly marked as such, and must not be + // misrepresented as being the original software. + // 3. This notice may not be removed or altered from any source distribution. + + function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; + } + + var gzheader = GZheader; + + const toString = Object.prototype.toString; + + /* Public constants ==========================================================*/ + /* ===========================================================================*/ + + const { + Z_NO_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR + } = constants$1; + + /* ===========================================================================*/ + + + /** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + + /* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + + /** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + + /** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + + /** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + + /** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ + function Inflate(options) { + this.options = common.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + + const opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { opt.windowBits = -15; } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if ((opt.windowBits >= 0) && (opt.windowBits < 16) && + !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if ((opt.windowBits > 15) && (opt.windowBits < 48)) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new zstream(); + this.strm.avail_out = 0; + + let status = inflate_1$1.inflateInit2( + this.strm, + opt.windowBits + ); + + if (status !== Z_OK) { + throw new Error(messages[status]); + } + + this.header = new gzheader(); + + inflate_1$1.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { //In raw mode we need to set the dictionary early + status = inflate_1$1.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(messages[status]); + } + } + } + } + + /** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ + Inflate.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + const dictionary = this.options.dictionary; + let status, _flush_mode, last_avail_out; + + if (this.ended) return false; + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + status = inflate_1$1.inflate(strm, _flush_mode); + + if (status === Z_NEED_DICT && dictionary) { + status = inflate_1$1.inflateSetDictionary(strm, dictionary); + + if (status === Z_OK) { + status = inflate_1$1.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && + status === Z_STREAM_END && + strm.state.wrap > 0 && + data[strm.next_in] !== 0) + { + inflate_1$1.inflateReset(strm); + status = inflate_1$1.inflate(strm, _flush_mode); + } + + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + + if (this.options.to === 'string') { + + let next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + + let tail = strm.next_out - next_out_utf8; + let utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + + this.onData(utf8str); + + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = inflate_1$1.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + + if (strm.avail_in === 0) break; + } + + return true; + }; + + + /** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ + Inflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); + }; + + + /** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ + Inflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = common.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; + }; + + + /** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ + function inflate(input, options) { + const inflator = new Inflate(options); + + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || messages[inflator.err]; + + return inflator.result; + } + + + /** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ + function inflateRaw(input, options) { + options = options || {}; + options.raw = true; + return inflate(input, options); + } + + + /** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + + var Inflate_1 = Inflate; + var inflate_2 = inflate; + var inflateRaw_1 = inflateRaw; + var ungzip = inflate; + var constants = constants$1; + + var inflate_1 = { + Inflate: Inflate_1, + inflate: inflate_2, + inflateRaw: inflateRaw_1, + ungzip: ungzip, + constants: constants + }; + + exports.Inflate = Inflate_1; + exports.constants = constants; + exports["default"] = inflate_1; + exports.inflate = inflate_2; + exports.inflateRaw = inflateRaw_1; + exports.ungzip = ungzip; + + Object.defineProperty(exports, '__esModule', { value: true }); + +})); diff --git a/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.min.js b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.min.js new file mode 100644 index 0000000..587fbdd --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/dist/pako_inflate.min.js @@ -0,0 +1,2 @@ +/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */ +!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).pako={})}(this,(function(e){"use strict";var t=(e,t,i,n)=>{let a=65535&e|0,r=e>>>16&65535|0,o=0;for(;0!==i;){o=i>2e3?2e3:i,i-=o;do{a=a+t[n++]|0,r=r+a|0}while(--o);a%=65521,r%=65521}return a|r<<16|0};const i=new Uint32Array((()=>{let e,t=[];for(var i=0;i<256;i++){e=i;for(var n=0;n<8;n++)e=1&e?3988292384^e>>>1:e>>>1;t[i]=e}return t})());var n=(e,t,n,a)=>{const r=i,o=a+n;e^=-1;for(let i=a;i>>8^r[255&(e^t[i])];return-1^e};const a=16209;var r=function(e,t){let i,n,r,o,s,l,d,f,c,h,u,w,b,m,k,_,g,p,v,x,y,E,R,A;const Z=e.state;i=e.next_in,R=e.input,n=i+(e.avail_in-5),r=e.next_out,A=e.output,o=r-(t-e.avail_out),s=r+(e.avail_out-257),l=Z.dmax,d=Z.wsize,f=Z.whave,c=Z.wnext,h=Z.window,u=Z.hold,w=Z.bits,b=Z.lencode,m=Z.distcode,k=(1<>>24,u>>>=p,w-=p,p=g>>>16&255,0===p)A[r++]=65535&g;else{if(!(16&p)){if(0==(64&p)){g=b[(65535&g)+(u&(1<>>=p,w-=p),w<15&&(u+=R[i++]<>>24,u>>>=p,w-=p,p=g>>>16&255,!(16&p)){if(0==(64&p)){g=m[(65535&g)+(u&(1<l){e.msg="invalid distance too far back",Z.mode=a;break e}if(u>>>=p,w-=p,p=r-o,x>p){if(p=x-p,p>f&&Z.sane){e.msg="invalid distance too far back",Z.mode=a;break e}if(y=0,E=h,0===c){if(y+=d-p,p2;)A[r++]=E[y++],A[r++]=E[y++],A[r++]=E[y++],v-=3;v&&(A[r++]=E[y++],v>1&&(A[r++]=E[y++]))}else{y=r-x;do{A[r++]=A[y++],A[r++]=A[y++],A[r++]=A[y++],v-=3}while(v>2);v&&(A[r++]=A[y++],v>1&&(A[r++]=A[y++]))}break}}break}}while(i>3,i-=v,w-=v<<3,u&=(1<{const u=h.bits;let w,b,m,k,_,g,p=0,v=0,x=0,y=0,E=0,R=0,A=0,Z=0,S=0,T=0,O=null;const U=new Uint16Array(16),D=new Uint16Array(16);let I,B,N,C=null;for(p=0;p<=o;p++)U[p]=0;for(v=0;v=1&&0===U[y];y--);if(E>y&&(E=y),0===y)return a[r++]=20971520,a[r++]=20971520,h.bits=1,0;for(x=1;x0&&(0===e||1!==y))return-1;for(D[1]=0,p=1;p852||2===e&&S>592)return 1;for(;;){I=p-A,c[v]+1=g?(B=C[c[v]-g],N=O[c[v]-g]):(B=96,N=0),w=1<>A)+b]=I<<24|B<<16|N|0}while(0!==b);for(w=1<>=1;if(0!==w?(T&=w-1,T+=w):T=0,v++,0==--U[p]){if(p===y)break;p=t[i+c[v]]}if(p>E&&(T&k)!==m){for(0===A&&(A=E),_+=x,R=p-A,Z=1<852||2===e&&S>592)return 1;m=T&k,a[m]=E<<24|R<<16|_-r|0}}return 0!==T&&(a[_+T]=p-A<<24|64<<16|0),h.bits=E,0},h={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8};const{Z_FINISH:u,Z_BLOCK:w,Z_TREES:b,Z_OK:m,Z_STREAM_END:k,Z_NEED_DICT:_,Z_STREAM_ERROR:g,Z_DATA_ERROR:p,Z_MEM_ERROR:v,Z_BUF_ERROR:x,Z_DEFLATED:y}=h,E=16180,R=16190,A=16191,Z=16192,S=16194,T=16199,O=16200,U=16206,D=16209,I=e=>(e>>>24&255)+(e>>>8&65280)+((65280&e)<<8)+((255&e)<<24);function B(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}const N=e=>{if(!e)return 1;const t=e.state;return!t||t.strm!==e||t.mode16211?1:0},C=e=>{if(N(e))return g;const t=e.state;return e.total_in=e.total_out=t.total=0,e.msg="",t.wrap&&(e.adler=1&t.wrap),t.mode=E,t.last=0,t.havedict=0,t.flags=-1,t.dmax=32768,t.head=null,t.hold=0,t.bits=0,t.lencode=t.lendyn=new Int32Array(852),t.distcode=t.distdyn=new Int32Array(592),t.sane=1,t.back=-1,m},z=e=>{if(N(e))return g;const t=e.state;return t.wsize=0,t.whave=0,t.wnext=0,C(e)},F=(e,t)=>{let i;if(N(e))return g;const n=e.state;return t<0?(i=0,t=-t):(i=5+(t>>4),t<48&&(t&=15)),t&&(t<8||t>15)?g:(null!==n.window&&n.wbits!==t&&(n.window=null),n.wrap=i,n.wbits=t,z(e))},L=(e,t)=>{if(!e)return g;const i=new B;e.state=i,i.strm=e,i.window=null,i.mode=E;const n=F(e,t);return n!==m&&(e.state=null),n};let M,H,j=!0;const K=e=>{if(j){M=new Int32Array(512),H=new Int32Array(32);let t=0;for(;t<144;)e.lens[t++]=8;for(;t<256;)e.lens[t++]=9;for(;t<280;)e.lens[t++]=7;for(;t<288;)e.lens[t++]=8;for(c(1,e.lens,0,288,M,0,e.work,{bits:9}),t=0;t<32;)e.lens[t++]=5;c(2,e.lens,0,32,H,0,e.work,{bits:5}),j=!1}e.lencode=M,e.lenbits=9,e.distcode=H,e.distbits=5},P=(e,t,i,n)=>{let a;const r=e.state;return null===r.window&&(r.wsize=1<=r.wsize?(r.window.set(t.subarray(i-r.wsize,i),0),r.wnext=0,r.whave=r.wsize):(a=r.wsize-r.wnext,a>n&&(a=n),r.window.set(t.subarray(i-n,i-n+a),r.wnext),(n-=a)?(r.window.set(t.subarray(i-n,i),0),r.wnext=n,r.whave=r.wsize):(r.wnext+=a,r.wnext===r.wsize&&(r.wnext=0),r.whaveL(e,15),inflateInit2:L,inflate:(e,i)=>{let a,o,s,l,d,f,h,B,C,z,F,L,M,H,j,Y,G,X,W,q,J,Q,V=0;const $=new Uint8Array(4);let ee,te;const ie=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);if(N(e)||!e.output||!e.input&&0!==e.avail_in)return g;a=e.state,a.mode===A&&(a.mode=Z),d=e.next_out,s=e.output,h=e.avail_out,l=e.next_in,o=e.input,f=e.avail_in,B=a.hold,C=a.bits,z=f,F=h,Q=m;e:for(;;)switch(a.mode){case E:if(0===a.wrap){a.mode=Z;break}for(;C<16;){if(0===f)break e;f--,B+=o[l++]<>>8&255,a.check=n(a.check,$,2,0),B=0,C=0,a.mode=16181;break}if(a.head&&(a.head.done=!1),!(1&a.wrap)||(((255&B)<<8)+(B>>8))%31){e.msg="incorrect header check",a.mode=D;break}if((15&B)!==y){e.msg="unknown compression method",a.mode=D;break}if(B>>>=4,C-=4,J=8+(15&B),0===a.wbits&&(a.wbits=J),J>15||J>a.wbits){e.msg="invalid window size",a.mode=D;break}a.dmax=1<>8&1),512&a.flags&&4&a.wrap&&($[0]=255&B,$[1]=B>>>8&255,a.check=n(a.check,$,2,0)),B=0,C=0,a.mode=16182;case 16182:for(;C<32;){if(0===f)break e;f--,B+=o[l++]<>>8&255,$[2]=B>>>16&255,$[3]=B>>>24&255,a.check=n(a.check,$,4,0)),B=0,C=0,a.mode=16183;case 16183:for(;C<16;){if(0===f)break e;f--,B+=o[l++]<>8),512&a.flags&&4&a.wrap&&($[0]=255&B,$[1]=B>>>8&255,a.check=n(a.check,$,2,0)),B=0,C=0,a.mode=16184;case 16184:if(1024&a.flags){for(;C<16;){if(0===f)break e;f--,B+=o[l++]<>>8&255,a.check=n(a.check,$,2,0)),B=0,C=0}else a.head&&(a.head.extra=null);a.mode=16185;case 16185:if(1024&a.flags&&(L=a.length,L>f&&(L=f),L&&(a.head&&(J=a.head.extra_len-a.length,a.head.extra||(a.head.extra=new Uint8Array(a.head.extra_len)),a.head.extra.set(o.subarray(l,l+L),J)),512&a.flags&&4&a.wrap&&(a.check=n(a.check,o,L,l)),f-=L,l+=L,a.length-=L),a.length))break e;a.length=0,a.mode=16186;case 16186:if(2048&a.flags){if(0===f)break e;L=0;do{J=o[l+L++],a.head&&J&&a.length<65536&&(a.head.name+=String.fromCharCode(J))}while(J&&L>9&1,a.head.done=!0),e.adler=a.check=0,a.mode=A;break;case 16189:for(;C<32;){if(0===f)break e;f--,B+=o[l++]<>>=7&C,C-=7&C,a.mode=U;break}for(;C<3;){if(0===f)break e;f--,B+=o[l++]<>>=1,C-=1,3&B){case 0:a.mode=16193;break;case 1:if(K(a),a.mode=T,i===b){B>>>=2,C-=2;break e}break;case 2:a.mode=16196;break;case 3:e.msg="invalid block type",a.mode=D}B>>>=2,C-=2;break;case 16193:for(B>>>=7&C,C-=7&C;C<32;){if(0===f)break e;f--,B+=o[l++]<>>16^65535)){e.msg="invalid stored block lengths",a.mode=D;break}if(a.length=65535&B,B=0,C=0,a.mode=S,i===b)break e;case S:a.mode=16195;case 16195:if(L=a.length,L){if(L>f&&(L=f),L>h&&(L=h),0===L)break e;s.set(o.subarray(l,l+L),d),f-=L,l+=L,h-=L,d+=L,a.length-=L;break}a.mode=A;break;case 16196:for(;C<14;){if(0===f)break e;f--,B+=o[l++]<>>=5,C-=5,a.ndist=1+(31&B),B>>>=5,C-=5,a.ncode=4+(15&B),B>>>=4,C-=4,a.nlen>286||a.ndist>30){e.msg="too many length or distance symbols",a.mode=D;break}a.have=0,a.mode=16197;case 16197:for(;a.have>>=3,C-=3}for(;a.have<19;)a.lens[ie[a.have++]]=0;if(a.lencode=a.lendyn,a.lenbits=7,ee={bits:a.lenbits},Q=c(0,a.lens,0,19,a.lencode,0,a.work,ee),a.lenbits=ee.bits,Q){e.msg="invalid code lengths set",a.mode=D;break}a.have=0,a.mode=16198;case 16198:for(;a.have>>24,Y=V>>>16&255,G=65535&V,!(j<=C);){if(0===f)break e;f--,B+=o[l++]<>>=j,C-=j,a.lens[a.have++]=G;else{if(16===G){for(te=j+2;C>>=j,C-=j,0===a.have){e.msg="invalid bit length repeat",a.mode=D;break}J=a.lens[a.have-1],L=3+(3&B),B>>>=2,C-=2}else if(17===G){for(te=j+3;C>>=j,C-=j,J=0,L=3+(7&B),B>>>=3,C-=3}else{for(te=j+7;C>>=j,C-=j,J=0,L=11+(127&B),B>>>=7,C-=7}if(a.have+L>a.nlen+a.ndist){e.msg="invalid bit length repeat",a.mode=D;break}for(;L--;)a.lens[a.have++]=J}}if(a.mode===D)break;if(0===a.lens[256]){e.msg="invalid code -- missing end-of-block",a.mode=D;break}if(a.lenbits=9,ee={bits:a.lenbits},Q=c(1,a.lens,0,a.nlen,a.lencode,0,a.work,ee),a.lenbits=ee.bits,Q){e.msg="invalid literal/lengths set",a.mode=D;break}if(a.distbits=6,a.distcode=a.distdyn,ee={bits:a.distbits},Q=c(2,a.lens,a.nlen,a.ndist,a.distcode,0,a.work,ee),a.distbits=ee.bits,Q){e.msg="invalid distances set",a.mode=D;break}if(a.mode=T,i===b)break e;case T:a.mode=O;case O:if(f>=6&&h>=258){e.next_out=d,e.avail_out=h,e.next_in=l,e.avail_in=f,a.hold=B,a.bits=C,r(e,F),d=e.next_out,s=e.output,h=e.avail_out,l=e.next_in,o=e.input,f=e.avail_in,B=a.hold,C=a.bits,a.mode===A&&(a.back=-1);break}for(a.back=0;V=a.lencode[B&(1<>>24,Y=V>>>16&255,G=65535&V,!(j<=C);){if(0===f)break e;f--,B+=o[l++]<>X)],j=V>>>24,Y=V>>>16&255,G=65535&V,!(X+j<=C);){if(0===f)break e;f--,B+=o[l++]<>>=X,C-=X,a.back+=X}if(B>>>=j,C-=j,a.back+=j,a.length=G,0===Y){a.mode=16205;break}if(32&Y){a.back=-1,a.mode=A;break}if(64&Y){e.msg="invalid literal/length code",a.mode=D;break}a.extra=15&Y,a.mode=16201;case 16201:if(a.extra){for(te=a.extra;C>>=a.extra,C-=a.extra,a.back+=a.extra}a.was=a.length,a.mode=16202;case 16202:for(;V=a.distcode[B&(1<>>24,Y=V>>>16&255,G=65535&V,!(j<=C);){if(0===f)break e;f--,B+=o[l++]<>X)],j=V>>>24,Y=V>>>16&255,G=65535&V,!(X+j<=C);){if(0===f)break e;f--,B+=o[l++]<>>=X,C-=X,a.back+=X}if(B>>>=j,C-=j,a.back+=j,64&Y){e.msg="invalid distance code",a.mode=D;break}a.offset=G,a.extra=15&Y,a.mode=16203;case 16203:if(a.extra){for(te=a.extra;C>>=a.extra,C-=a.extra,a.back+=a.extra}if(a.offset>a.dmax){e.msg="invalid distance too far back",a.mode=D;break}a.mode=16204;case 16204:if(0===h)break e;if(L=F-h,a.offset>L){if(L=a.offset-L,L>a.whave&&a.sane){e.msg="invalid distance too far back",a.mode=D;break}L>a.wnext?(L-=a.wnext,M=a.wsize-L):M=a.wnext-L,L>a.length&&(L=a.length),H=a.window}else H=s,M=d-a.offset,L=a.length;L>h&&(L=h),h-=L,a.length-=L;do{s[d++]=H[M++]}while(--L);0===a.length&&(a.mode=O);break;case 16205:if(0===h)break e;s[d++]=a.length,h--,a.mode=O;break;case U:if(a.wrap){for(;C<32;){if(0===f)break e;f--,B|=o[l++]<{if(N(e))return g;let t=e.state;return t.window&&(t.window=null),e.state=null,m},inflateGetHeader:(e,t)=>{if(N(e))return g;const i=e.state;return 0==(2&i.wrap)?g:(i.head=t,t.done=!1,m)},inflateSetDictionary:(e,i)=>{const n=i.length;let a,r,o;return N(e)?g:(a=e.state,0!==a.wrap&&a.mode!==R?g:a.mode===R&&(r=1,r=t(r,i,n,0),r!==a.check)?p:(o=P(e,i,n,n),o?(a.mode=16210,v):(a.havedict=1,m)))},inflateInfo:"pako inflate (from Nodeca project)"};const G=(e,t)=>Object.prototype.hasOwnProperty.call(e,t);var X=function(e){const t=Array.prototype.slice.call(arguments,1);for(;t.length;){const i=t.shift();if(i){if("object"!=typeof i)throw new TypeError(i+"must be non-object");for(const t in i)G(i,t)&&(e[t]=i[t])}}return e},W=e=>{let t=0;for(let i=0,n=e.length;i=252?6:e>=248?5:e>=240?4:e>=224?3:e>=192?2:1;J[254]=J[254]=1;var Q=e=>{if("function"==typeof TextEncoder&&TextEncoder.prototype.encode)return(new TextEncoder).encode(e);let t,i,n,a,r,o=e.length,s=0;for(a=0;a>>6,t[r++]=128|63&i):i<65536?(t[r++]=224|i>>>12,t[r++]=128|i>>>6&63,t[r++]=128|63&i):(t[r++]=240|i>>>18,t[r++]=128|i>>>12&63,t[r++]=128|i>>>6&63,t[r++]=128|63&i);return t},V=(e,t)=>{const i=t||e.length;if("function"==typeof TextDecoder&&TextDecoder.prototype.decode)return(new TextDecoder).decode(e.subarray(0,t));let n,a;const r=new Array(2*i);for(a=0,n=0;n4)r[a++]=65533,n+=o-1;else{for(t&=2===o?31:3===o?15:7;o>1&&n1?r[a++]=65533:t<65536?r[a++]=t:(t-=65536,r[a++]=55296|t>>10&1023,r[a++]=56320|1023&t)}}return((e,t)=>{if(t<65534&&e.subarray&&q)return String.fromCharCode.apply(null,e.length===t?e:e.subarray(0,t));let i="";for(let n=0;n{(t=t||e.length)>e.length&&(t=e.length);let i=t-1;for(;i>=0&&128==(192&e[i]);)i--;return i<0||0===i?t:i+J[e[i]]>t?i:t},ee={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"};var te=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0};var ie=function(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name="",this.comment="",this.hcrc=0,this.done=!1};const ne=Object.prototype.toString,{Z_NO_FLUSH:ae,Z_FINISH:re,Z_OK:oe,Z_STREAM_END:se,Z_NEED_DICT:le,Z_STREAM_ERROR:de,Z_DATA_ERROR:fe,Z_MEM_ERROR:ce}=h;function he(e){this.options=X({chunkSize:65536,windowBits:15,to:""},e||{});const t=this.options;t.raw&&t.windowBits>=0&&t.windowBits<16&&(t.windowBits=-t.windowBits,0===t.windowBits&&(t.windowBits=-15)),!(t.windowBits>=0&&t.windowBits<16)||e&&e.windowBits||(t.windowBits+=32),t.windowBits>15&&t.windowBits<48&&0==(15&t.windowBits)&&(t.windowBits|=15),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new te,this.strm.avail_out=0;let i=Y.inflateInit2(this.strm,t.windowBits);if(i!==oe)throw new Error(ee[i]);if(this.header=new ie,Y.inflateGetHeader(this.strm,this.header),t.dictionary&&("string"==typeof t.dictionary?t.dictionary=Q(t.dictionary):"[object ArrayBuffer]"===ne.call(t.dictionary)&&(t.dictionary=new Uint8Array(t.dictionary)),t.raw&&(i=Y.inflateSetDictionary(this.strm,t.dictionary),i!==oe)))throw new Error(ee[i])}function ue(e,t){const i=new he(t);if(i.push(e),i.err)throw i.msg||ee[i.err];return i.result}he.prototype.push=function(e,t){const i=this.strm,n=this.options.chunkSize,a=this.options.dictionary;let r,o,s;if(this.ended)return!1;for(o=t===~~t?t:!0===t?re:ae,"[object ArrayBuffer]"===ne.call(e)?i.input=new Uint8Array(e):i.input=e,i.next_in=0,i.avail_in=i.input.length;;){for(0===i.avail_out&&(i.output=new Uint8Array(n),i.next_out=0,i.avail_out=n),r=Y.inflate(i,o),r===le&&a&&(r=Y.inflateSetDictionary(i,a),r===oe?r=Y.inflate(i,o):r===fe&&(r=le));i.avail_in>0&&r===se&&i.state.wrap>0&&0!==e[i.next_in];)Y.inflateReset(i),r=Y.inflate(i,o);switch(r){case de:case fe:case le:case ce:return this.onEnd(r),this.ended=!0,!1}if(s=i.avail_out,i.next_out&&(0===i.avail_out||r===se))if("string"===this.options.to){let e=$(i.output,i.next_out),t=i.next_out-e,a=V(i.output,e);i.next_out=t,i.avail_out=n-t,t&&i.output.set(i.output.subarray(e,e+t),0),this.onData(a)}else this.onData(i.output.length===i.next_out?i.output:i.output.subarray(0,i.next_out));if(r!==oe||0!==s){if(r===se)return r=Y.inflateEnd(this.strm),this.onEnd(r),this.ended=!0,!0;if(0===i.avail_in)break}}return!0},he.prototype.onData=function(e){this.chunks.push(e)},he.prototype.onEnd=function(e){e===oe&&("string"===this.options.to?this.result=this.chunks.join(""):this.result=W(this.chunks)),this.chunks=[],this.err=e,this.msg=this.strm.msg};var we=he,be=ue,me=function(e,t){return(t=t||{}).raw=!0,ue(e,t)},ke=ue,_e=h,ge={Inflate:we,inflate:be,inflateRaw:me,ungzip:ke,constants:_e};e.Inflate=we,e.constants=_e,e.default=ge,e.inflate=be,e.inflateRaw=me,e.ungzip=ke,Object.defineProperty(e,"__esModule",{value:!0})})); diff --git a/测试流式传输uniapp/node_modules/pako/index.js b/测试流式传输uniapp/node_modules/pako/index.js new file mode 100644 index 0000000..4fd9231 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/index.js @@ -0,0 +1,18 @@ +// Top level file is just a mixin of submodules & constants +'use strict'; + +const { Deflate, deflate, deflateRaw, gzip } = require('./lib/deflate'); + +const { Inflate, inflate, inflateRaw, ungzip } = require('./lib/inflate'); + +const constants = require('./lib/zlib/constants'); + +module.exports.Deflate = Deflate; +module.exports.deflate = deflate; +module.exports.deflateRaw = deflateRaw; +module.exports.gzip = gzip; +module.exports.Inflate = Inflate; +module.exports.inflate = inflate; +module.exports.inflateRaw = inflateRaw; +module.exports.ungzip = ungzip; +module.exports.constants = constants; diff --git a/测试流式传输uniapp/node_modules/pako/lib/deflate.js b/测试流式传输uniapp/node_modules/pako/lib/deflate.js new file mode 100644 index 0000000..9c6b88a --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/deflate.js @@ -0,0 +1,380 @@ +'use strict'; + + +const zlib_deflate = require('./zlib/deflate'); +const utils = require('./utils/common'); +const strings = require('./utils/strings'); +const msg = require('./zlib/messages'); +const ZStream = require('./zlib/zstream'); + +const toString = Object.prototype.toString; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, + Z_DEFAULT_COMPRESSION, + Z_DEFAULT_STRATEGY, + Z_DEFLATED +} = require('./zlib/constants'); + +/* ===========================================================================*/ + + +/** + * class Deflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[deflate]], + * [[deflateRaw]] and [[gzip]]. + **/ + +/* internal + * Deflate.chunks -> Array + * + * Chunks of output data, if [[Deflate#onData]] not overridden. + **/ + +/** + * Deflate.result -> Uint8Array + * + * Compressed result, generated by default [[Deflate#onData]] + * and [[Deflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Deflate#push]] with `Z_FINISH` / `true` param). + **/ + +/** + * Deflate.err -> Number + * + * Error code after deflate finished. 0 (Z_OK) on success. + * You will not need it in real life, because deflate errors + * are possible only on wrong options or bad `onData` / `onEnd` + * custom handlers. + **/ + +/** + * Deflate.msg -> String + * + * Error message, if [[Deflate.err]] != 0 + **/ + + +/** + * new Deflate(options) + * - options (Object): zlib deflate options. + * + * Creates new deflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `level` + * - `windowBits` + * - `memLevel` + * - `strategy` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw deflate + * - `gzip` (Boolean) - create gzip wrapper + * - `header` (Object) - custom header for gzip + * - `text` (Boolean) - true if compressed data believed to be text + * - `time` (Number) - modification time, unix timestamp + * - `os` (Number) - operation system code + * - `extra` (Array) - array of bytes with extra data (max 65536) + * - `name` (String) - file name (binary string) + * - `comment` (String) - comment (binary string) + * - `hcrc` (Boolean) - true if header crc should be added + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const deflate = new pako.Deflate({ level: 3}); + * + * deflate.push(chunk1, false); + * deflate.push(chunk2, true); // true -> last chunk + * + * if (deflate.err) { throw new Error(deflate.err); } + * + * console.log(deflate.result); + * ``` + **/ +function Deflate(options) { + this.options = utils.assign({ + level: Z_DEFAULT_COMPRESSION, + method: Z_DEFLATED, + chunkSize: 16384, + windowBits: 15, + memLevel: 8, + strategy: Z_DEFAULT_STRATEGY + }, options || {}); + + let opt = this.options; + + if (opt.raw && (opt.windowBits > 0)) { + opt.windowBits = -opt.windowBits; + } + + else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) { + opt.windowBits += 16; + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new ZStream(); + this.strm.avail_out = 0; + + let status = zlib_deflate.deflateInit2( + this.strm, + opt.level, + opt.method, + opt.windowBits, + opt.memLevel, + opt.strategy + ); + + if (status !== Z_OK) { + throw new Error(msg[status]); + } + + if (opt.header) { + zlib_deflate.deflateSetHeader(this.strm, opt.header); + } + + if (opt.dictionary) { + let dict; + // Convert data if needed + if (typeof opt.dictionary === 'string') { + // If we need to compress text, change encoding to utf8. + dict = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + dict = new Uint8Array(opt.dictionary); + } else { + dict = opt.dictionary; + } + + status = zlib_deflate.deflateSetDictionary(this.strm, dict); + + if (status !== Z_OK) { + throw new Error(msg[status]); + } + + this._dict_set = true; + } +} + +/** + * Deflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be + * converted to utf8 byte sequence. + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes. + * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH. + * + * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with + * new compressed chunks. Returns `true` on success. The last data block must + * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending + * buffers and call [[Deflate#onEnd]]. + * + * On fail call [[Deflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Deflate.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + let status, _flush_mode; + + if (this.ended) { return false; } + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (typeof data === 'string') { + // If we need to compress text, change encoding to utf8. + strm.input = strings.string2buf(data); + } else if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + // Make sure avail_out > 6 to avoid repeating markers + if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + status = zlib_deflate.deflate(strm, _flush_mode); + + // Ended => flush and finish + if (status === Z_STREAM_END) { + if (strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + } + status = zlib_deflate.deflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return status === Z_OK; + } + + // Flush if out buffer full + if (strm.avail_out === 0) { + this.onData(strm.output); + continue; + } + + // Flush if requested and has data + if (_flush_mode > 0 && strm.next_out > 0) { + this.onData(strm.output.subarray(0, strm.next_out)); + strm.avail_out = 0; + continue; + } + + if (strm.avail_in === 0) break; + } + + return true; +}; + + +/** + * Deflate#onData(chunk) -> Void + * - chunk (Uint8Array): output data. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Deflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Deflate#onEnd(status) -> Void + * - status (Number): deflate status. 0 (Z_OK) on success, + * other if not. + * + * Called once after you tell deflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Deflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + this.result = utils.flattenChunks(this.chunks); + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * deflate(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * Compress `data` with deflate algorithm and `options`. + * + * Supported options are: + * + * - level + * - windowBits + * - memLevel + * - strategy + * - dictionary + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]); + * + * console.log(pako.deflate(data)); + * ``` + **/ +function deflate(input, options) { + const deflator = new Deflate(options); + + deflator.push(input, true); + + // That will never happens, if you don't cheat with options :) + if (deflator.err) { throw deflator.msg || msg[deflator.err]; } + + return deflator.result; +} + + +/** + * deflateRaw(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function deflateRaw(input, options) { + options = options || {}; + options.raw = true; + return deflate(input, options); +} + + +/** + * gzip(data[, options]) -> Uint8Array + * - data (Uint8Array|ArrayBuffer|String): input data to compress. + * - options (Object): zlib deflate options. + * + * The same as [[deflate]], but create gzip wrapper instead of + * deflate one. + **/ +function gzip(input, options) { + options = options || {}; + options.gzip = true; + return deflate(input, options); +} + + +module.exports.Deflate = Deflate; +module.exports.deflate = deflate; +module.exports.deflateRaw = deflateRaw; +module.exports.gzip = gzip; +module.exports.constants = require('./zlib/constants'); diff --git a/测试流式传输uniapp/node_modules/pako/lib/inflate.js b/测试流式传输uniapp/node_modules/pako/lib/inflate.js new file mode 100644 index 0000000..96c9fb5 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/inflate.js @@ -0,0 +1,419 @@ +'use strict'; + + +const zlib_inflate = require('./zlib/inflate'); +const utils = require('./utils/common'); +const strings = require('./utils/strings'); +const msg = require('./zlib/messages'); +const ZStream = require('./zlib/zstream'); +const GZheader = require('./zlib/gzheader'); + +const toString = Object.prototype.toString; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH, Z_FINISH, + Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR +} = require('./zlib/constants'); + +/* ===========================================================================*/ + + +/** + * class Inflate + * + * Generic JS-style wrapper for zlib calls. If you don't need + * streaming behaviour - use more simple functions: [[inflate]] + * and [[inflateRaw]]. + **/ + +/* internal + * inflate.chunks -> Array + * + * Chunks of output data, if [[Inflate#onData]] not overridden. + **/ + +/** + * Inflate.result -> Uint8Array|String + * + * Uncompressed result, generated by default [[Inflate#onData]] + * and [[Inflate#onEnd]] handlers. Filled after you push last chunk + * (call [[Inflate#push]] with `Z_FINISH` / `true` param). + **/ + +/** + * Inflate.err -> Number + * + * Error code after inflate finished. 0 (Z_OK) on success. + * Should be checked if broken data possible. + **/ + +/** + * Inflate.msg -> String + * + * Error message, if [[Inflate.err]] != 0 + **/ + + +/** + * new Inflate(options) + * - options (Object): zlib inflate options. + * + * Creates new inflator instance with specified params. Throws exception + * on bad params. Supported options: + * + * - `windowBits` + * - `dictionary` + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information on these. + * + * Additional options, for internal needs: + * + * - `chunkSize` - size of generated data chunks (16K by default) + * - `raw` (Boolean) - do raw inflate + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * By default, when no options set, autodetect deflate/gzip data format via + * wrapper header. + * + * ##### Example: + * + * ```javascript + * const pako = require('pako') + * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9]) + * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]); + * + * const inflate = new pako.Inflate({ level: 3}); + * + * inflate.push(chunk1, false); + * inflate.push(chunk2, true); // true -> last chunk + * + * if (inflate.err) { throw new Error(inflate.err); } + * + * console.log(inflate.result); + * ``` + **/ +function Inflate(options) { + this.options = utils.assign({ + chunkSize: 1024 * 64, + windowBits: 15, + to: '' + }, options || {}); + + const opt = this.options; + + // Force window size for `raw` data, if not set directly, + // because we have no header for autodetect. + if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) { + opt.windowBits = -opt.windowBits; + if (opt.windowBits === 0) { opt.windowBits = -15; } + } + + // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate + if ((opt.windowBits >= 0) && (opt.windowBits < 16) && + !(options && options.windowBits)) { + opt.windowBits += 32; + } + + // Gzip header has no info about windows size, we can do autodetect only + // for deflate. So, if window size not set, force it to max when gzip possible + if ((opt.windowBits > 15) && (opt.windowBits < 48)) { + // bit 3 (16) -> gzipped data + // bit 4 (32) -> autodetect gzip/deflate + if ((opt.windowBits & 15) === 0) { + opt.windowBits |= 15; + } + } + + this.err = 0; // error code, if happens (0 = Z_OK) + this.msg = ''; // error message + this.ended = false; // used to avoid multiple onEnd() calls + this.chunks = []; // chunks of compressed data + + this.strm = new ZStream(); + this.strm.avail_out = 0; + + let status = zlib_inflate.inflateInit2( + this.strm, + opt.windowBits + ); + + if (status !== Z_OK) { + throw new Error(msg[status]); + } + + this.header = new GZheader(); + + zlib_inflate.inflateGetHeader(this.strm, this.header); + + // Setup dictionary + if (opt.dictionary) { + // Convert data if needed + if (typeof opt.dictionary === 'string') { + opt.dictionary = strings.string2buf(opt.dictionary); + } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') { + opt.dictionary = new Uint8Array(opt.dictionary); + } + if (opt.raw) { //In raw mode we need to set the dictionary early + status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary); + if (status !== Z_OK) { + throw new Error(msg[status]); + } + } + } +} + +/** + * Inflate#push(data[, flush_mode]) -> Boolean + * - data (Uint8Array|ArrayBuffer): input data + * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE + * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH, + * `true` means Z_FINISH. + * + * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with + * new output chunks. Returns `true` on success. If end of stream detected, + * [[Inflate#onEnd]] will be called. + * + * `flush_mode` is not needed for normal operation, because end of stream + * detected automatically. You may try to use it for advanced things, but + * this functionality was not tested. + * + * On fail call [[Inflate#onEnd]] with error code and return false. + * + * ##### Example + * + * ```javascript + * push(chunk, false); // push one of data chunks + * ... + * push(chunk, true); // push last chunk + * ``` + **/ +Inflate.prototype.push = function (data, flush_mode) { + const strm = this.strm; + const chunkSize = this.options.chunkSize; + const dictionary = this.options.dictionary; + let status, _flush_mode, last_avail_out; + + if (this.ended) return false; + + if (flush_mode === ~~flush_mode) _flush_mode = flush_mode; + else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH; + + // Convert data if needed + if (toString.call(data) === '[object ArrayBuffer]') { + strm.input = new Uint8Array(data); + } else { + strm.input = data; + } + + strm.next_in = 0; + strm.avail_in = strm.input.length; + + for (;;) { + if (strm.avail_out === 0) { + strm.output = new Uint8Array(chunkSize); + strm.next_out = 0; + strm.avail_out = chunkSize; + } + + status = zlib_inflate.inflate(strm, _flush_mode); + + if (status === Z_NEED_DICT && dictionary) { + status = zlib_inflate.inflateSetDictionary(strm, dictionary); + + if (status === Z_OK) { + status = zlib_inflate.inflate(strm, _flush_mode); + } else if (status === Z_DATA_ERROR) { + // Replace code with more verbose + status = Z_NEED_DICT; + } + } + + // Skip snyc markers if more data follows and not raw mode + while (strm.avail_in > 0 && + status === Z_STREAM_END && + strm.state.wrap > 0 && + data[strm.next_in] !== 0) + { + zlib_inflate.inflateReset(strm); + status = zlib_inflate.inflate(strm, _flush_mode); + } + + switch (status) { + case Z_STREAM_ERROR: + case Z_DATA_ERROR: + case Z_NEED_DICT: + case Z_MEM_ERROR: + this.onEnd(status); + this.ended = true; + return false; + } + + // Remember real `avail_out` value, because we may patch out buffer content + // to align utf8 strings boundaries. + last_avail_out = strm.avail_out; + + if (strm.next_out) { + if (strm.avail_out === 0 || status === Z_STREAM_END) { + + if (this.options.to === 'string') { + + let next_out_utf8 = strings.utf8border(strm.output, strm.next_out); + + let tail = strm.next_out - next_out_utf8; + let utf8str = strings.buf2string(strm.output, next_out_utf8); + + // move tail & realign counters + strm.next_out = tail; + strm.avail_out = chunkSize - tail; + if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0); + + this.onData(utf8str); + + } else { + this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out)); + } + } + } + + // Must repeat iteration if out buffer is full + if (status === Z_OK && last_avail_out === 0) continue; + + // Finalize if end of stream reached. + if (status === Z_STREAM_END) { + status = zlib_inflate.inflateEnd(this.strm); + this.onEnd(status); + this.ended = true; + return true; + } + + if (strm.avail_in === 0) break; + } + + return true; +}; + + +/** + * Inflate#onData(chunk) -> Void + * - chunk (Uint8Array|String): output data. When string output requested, + * each chunk will be string. + * + * By default, stores data blocks in `chunks[]` property and glue + * those in `onEnd`. Override this handler, if you need another behaviour. + **/ +Inflate.prototype.onData = function (chunk) { + this.chunks.push(chunk); +}; + + +/** + * Inflate#onEnd(status) -> Void + * - status (Number): inflate status. 0 (Z_OK) on success, + * other if not. + * + * Called either after you tell inflate that the input stream is + * complete (Z_FINISH). By default - join collected chunks, + * free memory and fill `results` / `err` properties. + **/ +Inflate.prototype.onEnd = function (status) { + // On success - join + if (status === Z_OK) { + if (this.options.to === 'string') { + this.result = this.chunks.join(''); + } else { + this.result = utils.flattenChunks(this.chunks); + } + } + this.chunks = []; + this.err = status; + this.msg = this.strm.msg; +}; + + +/** + * inflate(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Decompress `data` with inflate/ungzip and `options`. Autodetect + * format via wrapper header by default. That's why we don't provide + * separate `ungzip` method. + * + * Supported options are: + * + * - windowBits + * + * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced) + * for more information. + * + * Sugar (options): + * + * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify + * negative windowBits implicitly. + * - `to` (String) - if equal to 'string', then result will be converted + * from utf8 to utf16 (javascript) string. When string output requested, + * chunk length can differ from `chunkSize`, depending on content. + * + * + * ##### Example: + * + * ```javascript + * const pako = require('pako'); + * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9])); + * let output; + * + * try { + * output = pako.inflate(input); + * } catch (err) { + * console.log(err); + * } + * ``` + **/ +function inflate(input, options) { + const inflator = new Inflate(options); + + inflator.push(input); + + // That will never happens, if you don't cheat with options :) + if (inflator.err) throw inflator.msg || msg[inflator.err]; + + return inflator.result; +} + + +/** + * inflateRaw(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * The same as [[inflate]], but creates raw data, without wrapper + * (header and adler32 crc). + **/ +function inflateRaw(input, options) { + options = options || {}; + options.raw = true; + return inflate(input, options); +} + + +/** + * ungzip(data[, options]) -> Uint8Array|String + * - data (Uint8Array|ArrayBuffer): input data to decompress. + * - options (Object): zlib inflate options. + * + * Just shortcut to [[inflate]], because it autodetects format + * by header.content. Done for convenience. + **/ + + +module.exports.Inflate = Inflate; +module.exports.inflate = inflate; +module.exports.inflateRaw = inflateRaw; +module.exports.ungzip = inflate; +module.exports.constants = require('./zlib/constants'); diff --git a/测试流式传输uniapp/node_modules/pako/lib/utils/common.js b/测试流式传输uniapp/node_modules/pako/lib/utils/common.js new file mode 100644 index 0000000..9a6447a --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/utils/common.js @@ -0,0 +1,48 @@ +'use strict'; + + +const _has = (obj, key) => { + return Object.prototype.hasOwnProperty.call(obj, key); +}; + +module.exports.assign = function (obj /*from1, from2, from3, ...*/) { + const sources = Array.prototype.slice.call(arguments, 1); + while (sources.length) { + const source = sources.shift(); + if (!source) { continue; } + + if (typeof source !== 'object') { + throw new TypeError(source + 'must be non-object'); + } + + for (const p in source) { + if (_has(source, p)) { + obj[p] = source[p]; + } + } + } + + return obj; +}; + + +// Join array of chunks to single array. +module.exports.flattenChunks = (chunks) => { + // calculate data length + let len = 0; + + for (let i = 0, l = chunks.length; i < l; i++) { + len += chunks[i].length; + } + + // join chunks + const result = new Uint8Array(len); + + for (let i = 0, pos = 0, l = chunks.length; i < l; i++) { + let chunk = chunks[i]; + result.set(chunk, pos); + pos += chunk.length; + } + + return result; +}; diff --git a/测试流式传输uniapp/node_modules/pako/lib/utils/strings.js b/测试流式传输uniapp/node_modules/pako/lib/utils/strings.js new file mode 100644 index 0000000..c8f097c --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/utils/strings.js @@ -0,0 +1,174 @@ +// String encode/decode helpers +'use strict'; + + +// Quick check if we can use fast array to bin string conversion +// +// - apply(Array) can fail on Android 2.2 +// - apply(Uint8Array) can fail on iOS 5.1 Safari +// +let STR_APPLY_UIA_OK = true; + +try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; } + + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +const _utf8len = new Uint8Array(256); +for (let q = 0; q < 256; q++) { + _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1); +} +_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start + + +// convert string to array (typed, when possible) +module.exports.string2buf = (str) => { + if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) { + return new TextEncoder().encode(str); + } + + let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + buf = new Uint8Array(buf_len); + + // convert + for (i = 0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) { + c2 = str.charCodeAt(m_pos + 1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Helper +const buf2binstring = (buf, len) => { + // On Chrome, the arguments in a function call that are allowed is `65534`. + // If the length of the buffer is smaller than that, we can use this optimization, + // otherwise we will take a slower path. + if (len < 65534) { + if (buf.subarray && STR_APPLY_UIA_OK) { + return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len)); + } + } + + let result = ''; + for (let i = 0; i < len; i++) { + result += String.fromCharCode(buf[i]); + } + return result; +}; + + +// convert array to string +module.exports.buf2string = (buf, max) => { + const len = max || buf.length; + + if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) { + return new TextDecoder().decode(buf.subarray(0, max)); + } + + let i, out; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + const utf16buf = new Array(len * 2); + + for (out = 0, i = 0; i < len;) { + let c = buf[i++]; + // quick process ascii + if (c < 0x80) { utf16buf[out++] = c; continue; } + + let c_len = _utf8len[c]; + // skip 5 & 6 byte codes + if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + return buf2binstring(utf16buf, out); +}; + + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +module.exports.utf8border = (buf, max) => { + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + let pos = max - 1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means buffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/README b/测试流式传输uniapp/node_modules/pako/lib/zlib/README new file mode 100644 index 0000000..88a8752 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/README @@ -0,0 +1,59 @@ +Content of this folder follows zlib C sources as close as possible. +That's intended to simplify maintainability and guarantee equal API +and result. + +Key differences: + +- Everything is in JavaScript. +- No platform-dependent blocks. +- Some things like crc32 rewritten to keep size small and make JIT + work better. +- Some code is different due missed features in JS (macros, pointers, + structures, header files) +- Specific API methods are not implemented (see notes in root readme) + +This port is based on zlib 1.2.8. + +This port is under zlib license (see below) with contribution and addition of javascript +port under expat license (see LICENSE at root of project) + +Copyright: +(C) 1995-2013 Jean-loup Gailly and Mark Adler +(C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin + + +From zlib's README +============================================================================= + +Acknowledgments: + + The deflate format used by zlib was defined by Phil Katz. The deflate and + zlib specifications were written by L. Peter Deutsch. Thanks to all the + people who reported problems and suggested various improvements in zlib; they + are too numerous to cite here. + +Copyright notice: + + (C) 1995-2013 Jean-loup Gailly and Mark Adler + +Copyright (c) <''year''> <''copyright holders''> + +This software is provided 'as-is', without any express or implied +warranty. In no event will the authors be held liable for any damages +arising from the use of this software. + +Permission is granted to anyone to use this software for any purpose, +including commercial applications, and to alter it and redistribute it +freely, subject to the following restrictions: + +1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. +2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. +3. This notice may not be removed or altered from any source distribution. + + + Jean-loup Gailly Mark Adler + jloup@gzip.org madler@alumni.caltech.edu diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/adler32.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/adler32.js new file mode 100644 index 0000000..d65072a --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/adler32.js @@ -0,0 +1,51 @@ +'use strict'; + +// Note: adler32 takes 12% for level 0 and 2% for level 6. +// It isn't worth it to make additional optimizations as in original. +// Small size is preferable. + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const adler32 = (adler, buf, len, pos) => { + let s1 = (adler & 0xffff) |0, + s2 = ((adler >>> 16) & 0xffff) |0, + n = 0; + + while (len !== 0) { + // Set limit ~ twice less than 5552, to keep + // s2 in 31-bits, because we force signed ints. + // in other case %= will fail. + n = len > 2000 ? 2000 : len; + len -= n; + + do { + s1 = (s1 + buf[pos++]) |0; + s2 = (s2 + s1) |0; + } while (--n); + + s1 %= 65521; + s2 %= 65521; + } + + return (s1 | (s2 << 16)) |0; +}; + + +module.exports = adler32; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/constants.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/constants.js new file mode 100644 index 0000000..b85cc01 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/constants.js @@ -0,0 +1,68 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +module.exports = { + + /* Allowed flush values; see deflate() and inflate() below for details */ + Z_NO_FLUSH: 0, + Z_PARTIAL_FLUSH: 1, + Z_SYNC_FLUSH: 2, + Z_FULL_FLUSH: 3, + Z_FINISH: 4, + Z_BLOCK: 5, + Z_TREES: 6, + + /* Return codes for the compression/decompression functions. Negative values + * are errors, positive values are used for special but normal events. + */ + Z_OK: 0, + Z_STREAM_END: 1, + Z_NEED_DICT: 2, + Z_ERRNO: -1, + Z_STREAM_ERROR: -2, + Z_DATA_ERROR: -3, + Z_MEM_ERROR: -4, + Z_BUF_ERROR: -5, + //Z_VERSION_ERROR: -6, + + /* compression levels */ + Z_NO_COMPRESSION: 0, + Z_BEST_SPEED: 1, + Z_BEST_COMPRESSION: 9, + Z_DEFAULT_COMPRESSION: -1, + + + Z_FILTERED: 1, + Z_HUFFMAN_ONLY: 2, + Z_RLE: 3, + Z_FIXED: 4, + Z_DEFAULT_STRATEGY: 0, + + /* Possible values of the data_type field (though see inflate()) */ + Z_BINARY: 0, + Z_TEXT: 1, + //Z_ASCII: 1, // = Z_TEXT (deprecated) + Z_UNKNOWN: 2, + + /* The deflate compression method */ + Z_DEFLATED: 8 + //Z_NULL: null // Use -1 or null inline, depending on var type +}; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/crc32.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/crc32.js new file mode 100644 index 0000000..60cbd51 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/crc32.js @@ -0,0 +1,59 @@ +'use strict'; + +// Note: we can't get significant speed boost here. +// So write code to minimize size - no pregenerated tables +// and array tools dependencies. + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +// Use ordinary array, since untyped makes no boost here +const makeTable = () => { + let c, table = []; + + for (var n = 0; n < 256; n++) { + c = n; + for (var k = 0; k < 8; k++) { + c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +}; + +// Create table on load. Just 255 signed longs. Not a problem. +const crcTable = new Uint32Array(makeTable()); + + +const crc32 = (crc, buf, len, pos) => { + const t = crcTable; + const end = pos + len; + + crc ^= -1; + + for (let i = pos; i < end; i++) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +}; + + +module.exports = crc32; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/deflate.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/deflate.js new file mode 100644 index 0000000..00e056e --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/deflate.js @@ -0,0 +1,2048 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = require('./trees'); +const adler32 = require('./adler32'); +const crc32 = require('./crc32'); +const msg = require('./messages'); + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_NO_FLUSH, Z_PARTIAL_FLUSH, Z_FULL_FLUSH, Z_FINISH, Z_BLOCK, + Z_OK, Z_STREAM_END, Z_STREAM_ERROR, Z_DATA_ERROR, Z_BUF_ERROR, + Z_DEFAULT_COMPRESSION, + Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY, + Z_UNKNOWN, + Z_DEFLATED +} = require('./constants'); + +/*============================================================================*/ + + +const MAX_MEM_LEVEL = 9; +/* Maximum value for memLevel in deflateInit2 */ +const MAX_WBITS = 15; +/* 32K LZ77 window */ +const DEF_MEM_LEVEL = 8; + + +const LENGTH_CODES = 29; +/* number of length codes, not counting the special END_BLOCK code */ +const LITERALS = 256; +/* number of literal bytes 0..255 */ +const L_CODES = LITERALS + 1 + LENGTH_CODES; +/* number of Literal or Length codes, including the END_BLOCK code */ +const D_CODES = 30; +/* number of distance codes */ +const BL_CODES = 19; +/* number of codes used to transfer the bit lengths */ +const HEAP_SIZE = 2 * L_CODES + 1; +/* maximum heap size */ +const MAX_BITS = 15; +/* All codes must not exceed MAX_BITS bits */ + +const MIN_MATCH = 3; +const MAX_MATCH = 258; +const MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); + +const PRESET_DICT = 0x20; + +const INIT_STATE = 42; /* zlib header -> BUSY_STATE */ +//#ifdef GZIP +const GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */ +//#endif +const EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */ +const NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */ +const COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */ +const HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */ +const BUSY_STATE = 113; /* deflate -> FINISH_STATE */ +const FINISH_STATE = 666; /* stream complete */ + +const BS_NEED_MORE = 1; /* block not completed, need more input or more output */ +const BS_BLOCK_DONE = 2; /* block flush performed */ +const BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ +const BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ + +const OS_CODE = 0x03; // Unix :) . Don't detect, use this default. + +const err = (strm, errorCode) => { + strm.msg = msg[errorCode]; + return errorCode; +}; + +const rank = (f) => { + return ((f) * 2) - ((f) > 4 ? 9 : 0); +}; + +const zero = (buf) => { + let len = buf.length; while (--len >= 0) { buf[len] = 0; } +}; + +/* =========================================================================== + * Slide the hash table when sliding the window down (could be avoided with 32 + * bit values at the expense of memory usage). We slide even when level == 0 to + * keep the hash table consistent if we switch back to level > 0 later. + */ +const slide_hash = (s) => { + let n, m; + let p; + let wsize = s.w_size; + + n = s.hash_size; + p = n; + do { + m = s.head[--p]; + s.head[p] = (m >= wsize ? m - wsize : 0); + } while (--n); + n = wsize; +//#ifndef FASTEST + p = n; + do { + m = s.prev[--p]; + s.prev[p] = (m >= wsize ? m - wsize : 0); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); +//#endif +}; + +/* eslint-disable new-cap */ +let HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask; +// This hash causes less collisions, https://github.com/nodeca/pako/issues/135 +// But breaks binary compatibility +//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask; +let HASH = HASH_ZLIB; + + +/* ========================================================================= + * Flush as much pending output as possible. All deflate() output, except for + * some deflate_stored() output, goes through this function so some + * applications may wish to modify it to avoid allocating a large + * strm->next_out buffer and copying into it. (See also read_buf()). + */ +const flush_pending = (strm) => { + const s = strm.state; + + //_tr_flush_bits(s); + let len = s.pending; + if (len > strm.avail_out) { + len = strm.avail_out; + } + if (len === 0) { return; } + + strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out); + strm.next_out += len; + s.pending_out += len; + strm.total_out += len; + strm.avail_out -= len; + s.pending -= len; + if (s.pending === 0) { + s.pending_out = 0; + } +}; + + +const flush_block_only = (s, last) => { + _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); + s.block_start = s.strstart; + flush_pending(s.strm); +}; + + +const put_byte = (s, b) => { + s.pending_buf[s.pending++] = b; +}; + + +/* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ +const putShortMSB = (s, b) => { + + // put_byte(s, (Byte)(b >> 8)); +// put_byte(s, (Byte)(b & 0xff)); + s.pending_buf[s.pending++] = (b >>> 8) & 0xff; + s.pending_buf[s.pending++] = b & 0xff; +}; + + +/* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->input buffer and copying from it. + * (See also flush_pending()). + */ +const read_buf = (strm, buf, start, size) => { + + let len = strm.avail_in; + + if (len > size) { len = size; } + if (len === 0) { return 0; } + + strm.avail_in -= len; + + // zmemcpy(buf, strm->next_in, len); + buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start); + if (strm.state.wrap === 1) { + strm.adler = adler32(strm.adler, buf, len, start); + } + + else if (strm.state.wrap === 2) { + strm.adler = crc32(strm.adler, buf, len, start); + } + + strm.next_in += len; + strm.total_in += len; + + return len; +}; + + +/* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ +const longest_match = (s, cur_match) => { + + let chain_length = s.max_chain_length; /* max hash chain length */ + let scan = s.strstart; /* current string */ + let match; /* matched string */ + let len; /* length of current match */ + let best_len = s.prev_length; /* best match length so far */ + let nice_match = s.nice_match; /* stop if match long enough */ + const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? + s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; + + const _win = s.window; // shortcut + + const wmask = s.w_mask; + const prev = s.prev; + + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + + const strend = s.strstart + MAX_MATCH; + let scan_end1 = _win[scan + best_len - 1]; + let scan_end = _win[scan + best_len]; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s.prev_length >= s.good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if (nice_match > s.lookahead) { nice_match = s.lookahead; } + + // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + // Assert(cur_match < s->strstart, "no future"); + match = cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2. Note that the checks below + * for insufficient lookahead only occur occasionally for performance + * reasons. Therefore uninitialized memory will be accessed, and + * conditional jumps will be made that depend on those values. + * However the length of the match is limited to the lookahead, so + * the output of deflate is not affected by the uninitialized values. + */ + + if (_win[match + best_len] !== scan_end || + _win[match + best_len - 1] !== scan_end1 || + _win[match] !== _win[scan] || + _win[++match] !== _win[scan + 1]) { + continue; + } + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2; + match++; + // Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + /*jshint noempty:false*/ + } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && + scan < strend); + + // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (strend - scan); + scan = strend - MAX_MATCH; + + if (len > best_len) { + s.match_start = cur_match; + best_len = len; + if (len >= nice_match) { + break; + } + scan_end1 = _win[scan + best_len - 1]; + scan_end = _win[scan + best_len]; + } + } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); + + if (best_len <= s.lookahead) { + return best_len; + } + return s.lookahead; +}; + + +/* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ +const fill_window = (s) => { + + const _w_size = s.w_size; + let n, more, str; + + //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); + + do { + more = s.window_size - s.lookahead - s.strstart; + + // JS ints have 32 bit, block below not needed + /* Deal with !@#$% 64K limit: */ + //if (sizeof(int) <= 2) { + // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + // more = wsize; + // + // } else if (more == (unsigned)(-1)) { + // /* Very unlikely, but possible on 16 bit machine if + // * strstart == 0 && lookahead == 1 (input done a byte at time) + // */ + // more--; + // } + //} + + + /* If the window is almost full and there is insufficient lookahead, + * move the upper half to the lower one to make room in the upper half. + */ + if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { + + s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0); + s.match_start -= _w_size; + s.strstart -= _w_size; + /* we now have strstart >= MAX_DIST */ + s.block_start -= _w_size; + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + slide_hash(s); + more += _w_size; + } + if (s.strm.avail_in === 0) { + break; + } + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + //Assert(more >= 2, "more < 2"); + n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); + s.lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s.lookahead + s.insert >= MIN_MATCH) { + str = s.strstart - s.insert; + s.ins_h = s.window[str]; + + /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + 1]); +//#if MIN_MATCH != 3 +// Call update_hash() MIN_MATCH-3 more times +//#endif + while (s.insert) { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = str; + str++; + s.insert--; + if (s.lookahead + s.insert < MIN_MATCH) { + break; + } + } + } + /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, + * but this is not important since only literal bytes will be emitted. + */ + + } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); + + /* If the WIN_INIT bytes after the end of the current data have never been + * written, then zero those bytes in order to avoid memory check reports of + * the use of uninitialized (or uninitialised as Julian writes) bytes by + * the longest match routines. Update the high water mark for the next + * time through here. WIN_INIT is set to MAX_MATCH since the longest match + * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. + */ +// if (s.high_water < s.window_size) { +// const curr = s.strstart + s.lookahead; +// let init = 0; +// +// if (s.high_water < curr) { +// /* Previous high water mark below current data -- zero WIN_INIT +// * bytes or up to end of window, whichever is less. +// */ +// init = s.window_size - curr; +// if (init > WIN_INIT) +// init = WIN_INIT; +// zmemzero(s->window + curr, (unsigned)init); +// s->high_water = curr + init; +// } +// else if (s->high_water < (ulg)curr + WIN_INIT) { +// /* High water mark at or above current data, but below current data +// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up +// * to end of window, whichever is less. +// */ +// init = (ulg)curr + WIN_INIT - s->high_water; +// if (init > s->window_size - s->high_water) +// init = s->window_size - s->high_water; +// zmemzero(s->window + s->high_water, (unsigned)init); +// s->high_water += init; +// } +// } +// +// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, +// "not enough room for search"); +}; + +/* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * + * In case deflateParams() is used to later switch to a non-zero compression + * level, s->matches (otherwise unused when storing) keeps track of the number + * of hash table slides to perform. If s->matches is 1, then one hash table + * slide will be done when switching. If s->matches is 2, the maximum value + * allowed here, then the hash table will be cleared, since two or more slides + * is the same as a clear. + * + * deflate_stored() is written to minimize the number of times an input byte is + * copied. It is most efficient with large input and output buffers, which + * maximizes the opportunites to have a single copy from next_in to next_out. + */ +const deflate_stored = (s, flush) => { + + /* Smallest worthy block size when not flushing or finishing. By default + * this is 32K. This can be as small as 507 bytes for memLevel == 1. For + * large input and output buffers, the stored block size will be larger. + */ + let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5; + + /* Copy as many min_block or larger stored blocks directly to next_out as + * possible. If flushing, copy the remaining available input to next_out as + * stored blocks, if there is enough space. + */ + let len, left, have, last = 0; + let used = s.strm.avail_in; + do { + /* Set len to the maximum size block that we can copy directly with the + * available input data and output space. Set left to how much of that + * would be copied from what's left in the window. + */ + len = 65535/* MAX_STORED */; /* maximum deflate stored block length */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + if (s.strm.avail_out < have) { /* need room for header */ + break; + } + /* maximum stored block length that will fit in avail_out: */ + have = s.strm.avail_out - have; + left = s.strstart - s.block_start; /* bytes left in window */ + if (len > left + s.strm.avail_in) { + len = left + s.strm.avail_in; /* limit len to the input */ + } + if (len > have) { + len = have; /* limit len to the output */ + } + + /* If the stored block would be less than min_block in length, or if + * unable to copy all of the available input when flushing, then try + * copying to the window and the pending buffer instead. Also don't + * write an empty block when flushing -- deflate() does that. + */ + if (len < min_block && ((len === 0 && flush !== Z_FINISH) || + flush === Z_NO_FLUSH || + len !== left + s.strm.avail_in)) { + break; + } + + /* Make a dummy stored block in pending to get the header bytes, + * including any pending bits. This also updates the debugging counts. + */ + last = flush === Z_FINISH && len === left + s.strm.avail_in ? 1 : 0; + _tr_stored_block(s, 0, 0, last); + + /* Replace the lengths in the dummy stored block with len. */ + s.pending_buf[s.pending - 4] = len; + s.pending_buf[s.pending - 3] = len >> 8; + s.pending_buf[s.pending - 2] = ~len; + s.pending_buf[s.pending - 1] = ~len >> 8; + + /* Write the stored block header bytes. */ + flush_pending(s.strm); + +//#ifdef ZLIB_DEBUG +// /* Update debugging counts for the data about to be copied. */ +// s->compressed_len += len << 3; +// s->bits_sent += len << 3; +//#endif + + /* Copy uncompressed bytes from the window to next_out. */ + if (left) { + if (left > len) { + left = len; + } + //zmemcpy(s->strm->next_out, s->window + s->block_start, left); + s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out); + s.strm.next_out += left; + s.strm.avail_out -= left; + s.strm.total_out += left; + s.block_start += left; + len -= left; + } + + /* Copy uncompressed bytes directly from next_in to next_out, updating + * the check value. + */ + if (len) { + read_buf(s.strm, s.strm.output, s.strm.next_out, len); + s.strm.next_out += len; + s.strm.avail_out -= len; + s.strm.total_out += len; + } + } while (last === 0); + + /* Update the sliding window with the last s->w_size bytes of the copied + * data, or append all of the copied data to the existing window if less + * than s->w_size bytes were copied. Also update the number of bytes to + * insert in the hash tables, in the event that deflateParams() switches to + * a non-zero compression level. + */ + used -= s.strm.avail_in; /* number of input bytes directly copied */ + if (used) { + /* If any input was used, then no unused input remains in the window, + * therefore s->block_start == s->strstart. + */ + if (used >= s.w_size) { /* supplant the previous history */ + s.matches = 2; /* clear hash */ + //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); + s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0); + s.strstart = s.w_size; + s.insert = s.strstart; + } + else { + if (s.window_size - s.strstart <= used) { + /* Slide the window down. */ + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); + s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart); + s.strstart += used; + s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used; + } + s.block_start = s.strstart; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* If the last block was written to next_out, then done. */ + if (last) { + return BS_FINISH_DONE; + } + + /* If flushing and all input has been consumed, then done. */ + if (flush !== Z_NO_FLUSH && flush !== Z_FINISH && + s.strm.avail_in === 0 && s.strstart === s.block_start) { + return BS_BLOCK_DONE; + } + + /* Fill the window with any remaining input. */ + have = s.window_size - s.strstart; + if (s.strm.avail_in > have && s.block_start >= s.w_size) { + /* Slide the window down. */ + s.block_start -= s.w_size; + s.strstart -= s.w_size; + //zmemcpy(s->window, s->window + s->w_size, s->strstart); + s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0); + if (s.matches < 2) { + s.matches++; /* add a pending slide_hash() */ + } + have += s.w_size; /* more space now */ + if (s.insert > s.strstart) { + s.insert = s.strstart; + } + } + if (have > s.strm.avail_in) { + have = s.strm.avail_in; + } + if (have) { + read_buf(s.strm, s.window, s.strstart, have); + s.strstart += have; + s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have; + } + if (s.high_water < s.strstart) { + s.high_water = s.strstart; + } + + /* There was not enough avail_out to write a complete worthy or flushed + * stored block to next_out. Write a stored block to pending instead, if we + * have enough input for a worthy block, or if flushing and there is enough + * room for the remaining input as a stored block in the pending buffer. + */ + have = (s.bi_valid + 42) >> 3; /* number of header bytes */ + /* maximum stored block length that will fit in pending: */ + have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have; + min_block = have > s.w_size ? s.w_size : have; + left = s.strstart - s.block_start; + if (left >= min_block || + ((left || flush === Z_FINISH) && flush !== Z_NO_FLUSH && + s.strm.avail_in === 0 && left <= have)) { + len = left > have ? have : left; + last = flush === Z_FINISH && s.strm.avail_in === 0 && + len === left ? 1 : 0; + _tr_stored_block(s, s.block_start, len, last); + s.block_start += len; + flush_pending(s.strm); + } + + /* We've done all we can with the available input and output. */ + return last ? BS_FINISH_STARTED : BS_NEED_MORE; +}; + + +/* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ +const deflate_fast = (s, flush) => { + + let hash_head; /* head of the hash chain */ + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { + break; /* flush the current block */ + } + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + } + if (s.match_length >= MIN_MATCH) { + // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only + + /*** _tr_tally_dist(s, s.strstart - s.match_start, + s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ + if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { + s.match_length--; /* string at strstart already in table */ + do { + s.strstart++; + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s.match_length !== 0); + s.strstart++; + } else + { + s.strstart += s.match_length; + s.match_length = 0; + s.ins_h = s.window[s.strstart]; + /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]); + +//#if MIN_MATCH != 3 +// Call UPDATE_HASH() MIN_MATCH-3 more times +//#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s.window[s.strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ +const deflate_slow = (s, flush) => { + + let hash_head; /* head of hash chain */ + let bflush; /* set if current block must be flushed */ + + let max_insert; + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s.lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + hash_head = 0/*NIL*/; + if (s.lookahead >= MIN_MATCH) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + + /* Find the longest match, discarding those <= prev_length. + */ + s.prev_length = s.match_length; + s.prev_match = s.match_start; + s.match_length = MIN_MATCH - 1; + + if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && + s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + s.match_length = longest_match(s, hash_head); + /* longest_match() sets match_start */ + + if (s.match_length <= 5 && + (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s.match_length = MIN_MATCH - 1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { + max_insert = s.strstart + s.lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + //check_match(s, s.strstart-1, s.prev_match, s.prev_length); + + /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, + s.prev_length - MIN_MATCH, bflush);***/ + bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s.lookahead -= s.prev_length - 1; + s.prev_length -= 2; + do { + if (++s.strstart <= max_insert) { + /*** INSERT_STRING(s, s.strstart, hash_head); ***/ + s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]); + hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; + s.head[s.ins_h] = s.strstart; + /***/ + } + } while (--s.prev_length !== 0); + s.match_available = 0; + s.match_length = MIN_MATCH - 1; + s.strstart++; + + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + } else if (s.match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + if (bflush) { + /*** FLUSH_BLOCK_ONLY(s, 0) ***/ + flush_block_only(s, false); + /***/ + } + s.strstart++; + s.lookahead--; + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s.match_available = 1; + s.strstart++; + s.lookahead--; + } + } + //Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s.match_available) { + //Tracevv((stderr,"%c", s->window[s->strstart-1])); + /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart - 1]); + + s.match_available = 0; + } + s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + + return BS_BLOCK_DONE; +}; + + +/* =========================================================================== + * For Z_RLE, simply look for runs of bytes, generate matches only of distance + * one. Do not maintain a hash table. (It will be regenerated if this run of + * deflate switches away from Z_RLE.) + */ +const deflate_rle = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + let prev; /* byte at distance one to match */ + let scan, strend; /* scan goes up to strend for length of run */ + + const _win = s.window; + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the longest run, plus one for the unrolled loop. + */ + if (s.lookahead <= MAX_MATCH) { + fill_window(s); + if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + if (s.lookahead === 0) { break; } /* flush the current block */ + } + + /* See how many times the previous byte repeats */ + s.match_length = 0; + if (s.lookahead >= MIN_MATCH && s.strstart > 0) { + scan = s.strstart - 1; + prev = _win[scan]; + if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { + strend = s.strstart + MAX_MATCH; + do { + /*jshint noempty:false*/ + } while (prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + prev === _win[++scan] && prev === _win[++scan] && + scan < strend); + s.match_length = MAX_MATCH - (strend - scan); + if (s.match_length > s.lookahead) { + s.match_length = s.lookahead; + } + } + //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); + } + + /* Emit match if have run of MIN_MATCH or longer, else emit literal */ + if (s.match_length >= MIN_MATCH) { + //check_match(s, s.strstart, s.strstart - 1, s.match_length); + + /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ + bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH); + + s.lookahead -= s.match_length; + s.strstart += s.match_length; + s.match_length = 0; + } else { + /* No match, output a literal byte */ + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + + s.lookahead--; + s.strstart++; + } + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* =========================================================================== + * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. + * (It will be regenerated if this run of deflate switches away from Huffman.) + */ +const deflate_huff = (s, flush) => { + + let bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we have a literal to write. */ + if (s.lookahead === 0) { + fill_window(s); + if (s.lookahead === 0) { + if (flush === Z_NO_FLUSH) { + return BS_NEED_MORE; + } + break; /* flush the current block */ + } + } + + /* Output a literal byte */ + s.match_length = 0; + //Tracevv((stderr,"%c", s->window[s->strstart])); + /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ + bflush = _tr_tally(s, 0, s.window[s.strstart]); + s.lookahead--; + s.strstart++; + if (bflush) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + } + s.insert = 0; + if (flush === Z_FINISH) { + /*** FLUSH_BLOCK(s, 1); ***/ + flush_block_only(s, true); + if (s.strm.avail_out === 0) { + return BS_FINISH_STARTED; + } + /***/ + return BS_FINISH_DONE; + } + if (s.sym_next) { + /*** FLUSH_BLOCK(s, 0); ***/ + flush_block_only(s, false); + if (s.strm.avail_out === 0) { + return BS_NEED_MORE; + } + /***/ + } + return BS_BLOCK_DONE; +}; + +/* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ +function Config(good_length, max_lazy, nice_length, max_chain, func) { + + this.good_length = good_length; + this.max_lazy = max_lazy; + this.nice_length = nice_length; + this.max_chain = max_chain; + this.func = func; +} + +const configuration_table = [ + /* good lazy nice chain */ + new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ + new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ + new Config(4, 5, 16, 8, deflate_fast), /* 2 */ + new Config(4, 6, 32, 32, deflate_fast), /* 3 */ + + new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ + new Config(8, 16, 32, 32, deflate_slow), /* 5 */ + new Config(8, 16, 128, 128, deflate_slow), /* 6 */ + new Config(8, 32, 128, 256, deflate_slow), /* 7 */ + new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ + new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ +]; + + +/* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ +const lm_init = (s) => { + + s.window_size = 2 * s.w_size; + + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + + /* Set the default configuration parameters: + */ + s.max_lazy_match = configuration_table[s.level].max_lazy; + s.good_match = configuration_table[s.level].good_length; + s.nice_match = configuration_table[s.level].nice_length; + s.max_chain_length = configuration_table[s.level].max_chain; + + s.strstart = 0; + s.block_start = 0; + s.lookahead = 0; + s.insert = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + s.ins_h = 0; +}; + + +function DeflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.status = 0; /* as the name implies */ + this.pending_buf = null; /* output still pending */ + this.pending_buf_size = 0; /* size of pending_buf */ + this.pending_out = 0; /* next pending byte to output to the stream */ + this.pending = 0; /* nb of bytes in the pending buffer */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ + this.gzhead = null; /* gzip header information to write */ + this.gzindex = 0; /* where in extra, name, or comment */ + this.method = Z_DEFLATED; /* can only be DEFLATED */ + this.last_flush = -1; /* value of flush param for previous deflate call */ + + this.w_size = 0; /* LZ77 window size (32K by default) */ + this.w_bits = 0; /* log2(w_size) (8..16) */ + this.w_mask = 0; /* w_size - 1 */ + + this.window = null; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. + */ + + this.window_size = 0; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + this.prev = null; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + this.head = null; /* Heads of the hash chains or NIL. */ + + this.ins_h = 0; /* hash index of string to be inserted */ + this.hash_size = 0; /* number of elements in hash table */ + this.hash_bits = 0; /* log2(hash_size) */ + this.hash_mask = 0; /* hash_size-1 */ + + this.hash_shift = 0; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + this.block_start = 0; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + this.match_length = 0; /* length of best match */ + this.prev_match = 0; /* previous match */ + this.match_available = 0; /* set if previous match exists */ + this.strstart = 0; /* start of string to insert */ + this.match_start = 0; /* start of matching string */ + this.lookahead = 0; /* number of valid bytes ahead in window */ + + this.prev_length = 0; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + this.max_chain_length = 0; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + this.max_lazy_match = 0; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ + // That's alias to max_lazy_match, don't use directly + //this.max_insert_length = 0; + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + this.level = 0; /* compression level (1..9) */ + this.strategy = 0; /* favor or force Huffman coding*/ + + this.good_match = 0; + /* Use a faster search when the previous match is longer than this */ + + this.nice_match = 0; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + + /* Didn't use ct_data typedef below to suppress compiler warning */ + + // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + // Use flat array of DOUBLE size, with interleaved fata, + // because JS does not support effective + this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2); + this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2); + this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2); + zero(this.dyn_ltree); + zero(this.dyn_dtree); + zero(this.bl_tree); + + this.l_desc = null; /* desc. for literal tree */ + this.d_desc = null; /* desc. for distance tree */ + this.bl_desc = null; /* desc. for bit length tree */ + + //ush bl_count[MAX_BITS+1]; + this.bl_count = new Uint16Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */ + zero(this.heap); + + this.heap_len = 0; /* number of elements in the heap */ + this.heap_max = 0; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; + zero(this.depth); + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + this.sym_buf = 0; /* buffer for distances and literals/lengths */ + + this.lit_bufsize = 0; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + this.sym_next = 0; /* running index in sym_buf */ + this.sym_end = 0; /* symbol table full when sym_next reaches this */ + + this.opt_len = 0; /* bit length of current block with optimal trees */ + this.static_len = 0; /* bit length of current block with static trees */ + this.matches = 0; /* number of string matches in current block */ + this.insert = 0; /* bytes at end of window left to insert */ + + + this.bi_buf = 0; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + this.bi_valid = 0; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + + // Used for window memory init. We safely ignore it for JS. That makes + // sense only for pointers and memory check tools. + //this.high_water = 0; + /* High water mark offset in window for initialized bytes -- bytes above + * this are set to zero in order to avoid memory check warnings when + * longest match routines access bytes past the input. This is then + * updated to the new high water mark. + */ +} + + +/* ========================================================================= + * Check for a valid deflate stream state. Return 0 if ok, 1 if not. + */ +const deflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const s = strm.state; + if (!s || s.strm !== strm || (s.status !== INIT_STATE && +//#ifdef GZIP + s.status !== GZIP_STATE && +//#endif + s.status !== EXTRA_STATE && + s.status !== NAME_STATE && + s.status !== COMMENT_STATE && + s.status !== HCRC_STATE && + s.status !== BUSY_STATE && + s.status !== FINISH_STATE)) { + return 1; + } + return 0; +}; + + +const deflateResetKeep = (strm) => { + + if (deflateStateCheck(strm)) { + return err(strm, Z_STREAM_ERROR); + } + + strm.total_in = strm.total_out = 0; + strm.data_type = Z_UNKNOWN; + + const s = strm.state; + s.pending = 0; + s.pending_out = 0; + + if (s.wrap < 0) { + s.wrap = -s.wrap; + /* was made negative by deflate(..., Z_FINISH); */ + } + s.status = +//#ifdef GZIP + s.wrap === 2 ? GZIP_STATE : +//#endif + s.wrap ? INIT_STATE : BUSY_STATE; + strm.adler = (s.wrap === 2) ? + 0 // crc32(0, Z_NULL, 0) + : + 1; // adler32(0, Z_NULL, 0) + s.last_flush = -2; + _tr_init(s); + return Z_OK; +}; + + +const deflateReset = (strm) => { + + const ret = deflateResetKeep(strm); + if (ret === Z_OK) { + lm_init(strm.state); + } + return ret; +}; + + +const deflateSetHeader = (strm, head) => { + + if (deflateStateCheck(strm) || strm.state.wrap !== 2) { + return Z_STREAM_ERROR; + } + strm.state.gzhead = head; + return Z_OK; +}; + + +const deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => { + + if (!strm) { // === Z_NULL + return Z_STREAM_ERROR; + } + let wrap = 1; + + if (level === Z_DEFAULT_COMPRESSION) { + level = 6; + } + + if (windowBits < 0) { /* suppress zlib wrapper */ + wrap = 0; + windowBits = -windowBits; + } + + else if (windowBits > 15) { + wrap = 2; /* write gzip wrapper instead */ + windowBits -= 16; + } + + + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || + windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) { + return err(strm, Z_STREAM_ERROR); + } + + + if (windowBits === 8) { + windowBits = 9; + } + /* until 256-byte window bug fixed */ + + const s = new DeflateState(); + + strm.state = s; + s.strm = strm; + s.status = INIT_STATE; /* to pass state test in deflateReset() */ + + s.wrap = wrap; + s.gzhead = null; + s.w_bits = windowBits; + s.w_size = 1 << s.w_bits; + s.w_mask = s.w_size - 1; + + s.hash_bits = memLevel + 7; + s.hash_size = 1 << s.hash_bits; + s.hash_mask = s.hash_size - 1; + s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); + + s.window = new Uint8Array(s.w_size * 2); + s.head = new Uint16Array(s.hash_size); + s.prev = new Uint16Array(s.w_size); + + // Don't need mem init magic for JS. + //s.high_water = 0; /* nothing written to s->window yet */ + + s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + /* We overlay pending_buf and sym_buf. This works since the average size + * for length/distance pairs over any compressed block is assured to be 31 + * bits or less. + * + * Analysis: The longest fixed codes are a length code of 8 bits plus 5 + * extra bits, for lengths 131 to 257. The longest fixed distance codes are + * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest + * possible fixed-codes length/distance pair is then 31 bits total. + * + * sym_buf starts one-fourth of the way into pending_buf. So there are + * three bytes in sym_buf for every four bytes in pending_buf. Each symbol + * in sym_buf is three bytes -- two for the distance and one for the + * literal/length. As each symbol is consumed, the pointer to the next + * sym_buf value to read moves forward three bytes. From that symbol, up to + * 31 bits are written to pending_buf. The closest the written pending_buf + * bits gets to the next sym_buf symbol to read is just before the last + * code is written. At that time, 31*(n-2) bits have been written, just + * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at + * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1 + * symbols are written.) The closest the writing gets to what is unread is + * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and + * can range from 128 to 32768. + * + * Therefore, at a minimum, there are 142 bits of space between what is + * written and what is read in the overlain buffers, so the symbols cannot + * be overwritten by the compressed data. That space is actually 139 bits, + * due to the three-bit fixed-code block header. + * + * That covers the case where either Z_FIXED is specified, forcing fixed + * codes, or when the use of fixed codes is chosen, because that choice + * results in a smaller compressed block than dynamic codes. That latter + * condition then assures that the above analysis also covers all dynamic + * blocks. A dynamic-code block will only be chosen to be emitted if it has + * fewer bits than a fixed-code block would for the same set of symbols. + * Therefore its average symbol length is assured to be less than 31. So + * the compressed data for a dynamic block also cannot overwrite the + * symbols from which it is being constructed. + */ + + s.pending_buf_size = s.lit_bufsize * 4; + s.pending_buf = new Uint8Array(s.pending_buf_size); + + // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) + //s->sym_buf = s->pending_buf + s->lit_bufsize; + s.sym_buf = s.lit_bufsize; + + //s->sym_end = (s->lit_bufsize - 1) * 3; + s.sym_end = (s.lit_bufsize - 1) * 3; + /* We avoid equality with lit_bufsize*3 because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ + + s.level = level; + s.strategy = strategy; + s.method = method; + + return deflateReset(strm); +}; + +const deflateInit = (strm, level) => { + + return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY); +}; + + +/* ========================================================================= */ +const deflate = (strm, flush) => { + + if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) { + return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR; + } + + const s = strm.state; + + if (!strm.output || + (strm.avail_in !== 0 && !strm.input) || + (s.status === FINISH_STATE && flush !== Z_FINISH)) { + return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR); + } + + const old_flush = s.last_flush; + s.last_flush = flush; + + /* Flush as much pending output as possible */ + if (s.pending !== 0) { + flush_pending(strm); + if (strm.avail_out === 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s.last_flush = -1; + return Z_OK; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUF_ERROR. + */ + } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && + flush !== Z_FINISH) { + return err(strm, Z_BUF_ERROR); + } + + /* User must not provide more input after the first FINISH: */ + if (s.status === FINISH_STATE && strm.avail_in !== 0) { + return err(strm, Z_BUF_ERROR); + } + + /* Write the header */ + if (s.status === INIT_STATE && s.wrap === 0) { + s.status = BUSY_STATE; + } + if (s.status === INIT_STATE) { + /* zlib header */ + let header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8; + let level_flags = -1; + + if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { + level_flags = 0; + } else if (s.level < 6) { + level_flags = 1; + } else if (s.level === 6) { + level_flags = 2; + } else { + level_flags = 3; + } + header |= (level_flags << 6); + if (s.strstart !== 0) { header |= PRESET_DICT; } + header += 31 - (header % 31); + + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s.strstart !== 0) { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + strm.adler = 1; // adler32(0L, Z_NULL, 0); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + } +//#ifdef GZIP + if (s.status === GZIP_STATE) { + /* gzip header */ + strm.adler = 0; //crc32(0L, Z_NULL, 0); + put_byte(s, 31); + put_byte(s, 139); + put_byte(s, 8); + if (!s.gzhead) { // s->gzhead == Z_NULL + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, 0); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, OS_CODE); + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + } + else { + put_byte(s, (s.gzhead.text ? 1 : 0) + + (s.gzhead.hcrc ? 2 : 0) + + (!s.gzhead.extra ? 0 : 4) + + (!s.gzhead.name ? 0 : 8) + + (!s.gzhead.comment ? 0 : 16) + ); + put_byte(s, s.gzhead.time & 0xff); + put_byte(s, (s.gzhead.time >> 8) & 0xff); + put_byte(s, (s.gzhead.time >> 16) & 0xff); + put_byte(s, (s.gzhead.time >> 24) & 0xff); + put_byte(s, s.level === 9 ? 2 : + (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? + 4 : 0)); + put_byte(s, s.gzhead.os & 0xff); + if (s.gzhead.extra && s.gzhead.extra.length) { + put_byte(s, s.gzhead.extra.length & 0xff); + put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); + } + if (s.gzhead.hcrc) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0); + } + s.gzindex = 0; + s.status = EXTRA_STATE; + } + } + if (s.status === EXTRA_STATE) { + if (s.gzhead.extra/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let left = (s.gzhead.extra.length & 0xffff) - s.gzindex; + while (s.pending + left > s.pending_buf_size) { + let copy = s.pending_buf_size - s.pending; + // zmemcpy(s.pending_buf + s.pending, + // s.gzhead.extra + s.gzindex, copy); + s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending); + s.pending = s.pending_buf_size; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex += copy; + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + beg = 0; + left -= copy; + } + // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility + // TypedArray.slice and TypedArray.from don't exist in IE10-IE11 + let gzhead_extra = new Uint8Array(s.gzhead.extra); + // zmemcpy(s->pending_buf + s->pending, + // s->gzhead->extra + s->gzindex, left); + s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending); + s.pending += left; + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = NAME_STATE; + } + if (s.status === NAME_STATE) { + if (s.gzhead.name/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.name.length) { + val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + s.gzindex = 0; + } + s.status = COMMENT_STATE; + } + if (s.status === COMMENT_STATE) { + if (s.gzhead.comment/* != Z_NULL*/) { + let beg = s.pending; /* start of bytes to update crc */ + let val; + do { + if (s.pending === s.pending_buf_size) { + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + beg = 0; + } + // JS specific: little magic to add zero terminator to end of string + if (s.gzindex < s.gzhead.comment.length) { + val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; + } else { + val = 0; + } + put_byte(s, val); + } while (val !== 0); + //--- HCRC_UPDATE(beg) ---// + if (s.gzhead.hcrc && s.pending > beg) { + strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); + } + //---// + } + s.status = HCRC_STATE; + } + if (s.status === HCRC_STATE) { + if (s.gzhead.hcrc) { + if (s.pending + 2 > s.pending_buf_size) { + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + } + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + strm.adler = 0; //crc32(0L, Z_NULL, 0); + } + s.status = BUSY_STATE; + + /* Compression must start with an empty pending buffer */ + flush_pending(strm); + if (s.pending !== 0) { + s.last_flush = -1; + return Z_OK; + } + } +//#endif + + /* Start a new block or continue the current one. + */ + if (strm.avail_in !== 0 || s.lookahead !== 0 || + (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) { + let bstate = s.level === 0 ? deflate_stored(s, flush) : + s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : + s.strategy === Z_RLE ? deflate_rle(s, flush) : + configuration_table[s.level].func(s, flush); + + if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { + s.status = FINISH_STATE; + } + if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { + if (strm.avail_out === 0) { + s.last_flush = -1; + /* avoid BUF_ERROR next call, see above */ + } + return Z_OK; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate === BS_BLOCK_DONE) { + if (flush === Z_PARTIAL_FLUSH) { + _tr_align(s); + } + else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ + + _tr_stored_block(s, 0, 0, false); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush === Z_FULL_FLUSH) { + /*** CLEAR_HASH(s); ***/ /* forget history */ + zero(s.head); // Fill with NIL (= 0); + + if (s.lookahead === 0) { + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + } + } + flush_pending(strm); + if (strm.avail_out === 0) { + s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK; + } + } + } + + if (flush !== Z_FINISH) { return Z_OK; } + if (s.wrap <= 0) { return Z_STREAM_END; } + + /* Write the trailer */ + if (s.wrap === 2) { + put_byte(s, strm.adler & 0xff); + put_byte(s, (strm.adler >> 8) & 0xff); + put_byte(s, (strm.adler >> 16) & 0xff); + put_byte(s, (strm.adler >> 24) & 0xff); + put_byte(s, strm.total_in & 0xff); + put_byte(s, (strm.total_in >> 8) & 0xff); + put_byte(s, (strm.total_in >> 16) & 0xff); + put_byte(s, (strm.total_in >> 24) & 0xff); + } + else + { + putShortMSB(s, strm.adler >>> 16); + putShortMSB(s, strm.adler & 0xffff); + } + + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + if (s.wrap > 0) { s.wrap = -s.wrap; } + /* write the trailer only once! */ + return s.pending !== 0 ? Z_OK : Z_STREAM_END; +}; + + +const deflateEnd = (strm) => { + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + + const status = strm.state.status; + + strm.state = null; + + return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK; +}; + + +/* ========================================================================= + * Initializes the compression dictionary from the given byte + * sequence without producing any compressed output. + */ +const deflateSetDictionary = (strm, dictionary) => { + + let dictLength = dictionary.length; + + if (deflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + + const s = strm.state; + const wrap = s.wrap; + + if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) { + return Z_STREAM_ERROR; + } + + /* when using zlib wrappers, compute Adler-32 for provided dictionary */ + if (wrap === 1) { + /* adler32(strm->adler, dictionary, dictLength); */ + strm.adler = adler32(strm.adler, dictionary, dictLength, 0); + } + + s.wrap = 0; /* avoid computing Adler-32 in read_buf */ + + /* if dictionary would fill window, just replace the history */ + if (dictLength >= s.w_size) { + if (wrap === 0) { /* already empty otherwise */ + /*** CLEAR_HASH(s); ***/ + zero(s.head); // Fill with NIL (= 0); + s.strstart = 0; + s.block_start = 0; + s.insert = 0; + } + /* use the tail */ + // dictionary = dictionary.slice(dictLength - s.w_size); + let tmpDict = new Uint8Array(s.w_size); + tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0); + dictionary = tmpDict; + dictLength = s.w_size; + } + /* insert dictionary into window and hash */ + const avail = strm.avail_in; + const next = strm.next_in; + const input = strm.input; + strm.avail_in = dictLength; + strm.next_in = 0; + strm.input = dictionary; + fill_window(s); + while (s.lookahead >= MIN_MATCH) { + let str = s.strstart; + let n = s.lookahead - (MIN_MATCH - 1); + do { + /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ + s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]); + + s.prev[str & s.w_mask] = s.head[s.ins_h]; + + s.head[s.ins_h] = str; + str++; + } while (--n); + s.strstart = str; + s.lookahead = MIN_MATCH - 1; + fill_window(s); + } + s.strstart += s.lookahead; + s.block_start = s.strstart; + s.insert = s.lookahead; + s.lookahead = 0; + s.match_length = s.prev_length = MIN_MATCH - 1; + s.match_available = 0; + strm.next_in = next; + strm.input = input; + strm.avail_in = avail; + s.wrap = wrap; + return Z_OK; +}; + + +module.exports.deflateInit = deflateInit; +module.exports.deflateInit2 = deflateInit2; +module.exports.deflateReset = deflateReset; +module.exports.deflateResetKeep = deflateResetKeep; +module.exports.deflateSetHeader = deflateSetHeader; +module.exports.deflate = deflate; +module.exports.deflateEnd = deflateEnd; +module.exports.deflateSetDictionary = deflateSetDictionary; +module.exports.deflateInfo = 'pako deflate (from Nodeca project)'; + +/* Not implemented +module.exports.deflateBound = deflateBound; +module.exports.deflateCopy = deflateCopy; +module.exports.deflateGetDictionary = deflateGetDictionary; +module.exports.deflateParams = deflateParams; +module.exports.deflatePending = deflatePending; +module.exports.deflatePrime = deflatePrime; +module.exports.deflateTune = deflateTune; +*/ diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/gzheader.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/gzheader.js new file mode 100644 index 0000000..9582cba --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/gzheader.js @@ -0,0 +1,58 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +function GZheader() { + /* true if compressed data believed to be text */ + this.text = 0; + /* modification time */ + this.time = 0; + /* extra flags (not used when writing a gzip file) */ + this.xflags = 0; + /* operating system */ + this.os = 0; + /* pointer to extra field or Z_NULL if none */ + this.extra = null; + /* extra field length (valid if extra != Z_NULL) */ + this.extra_len = 0; // Actually, we don't need it in JS, + // but leave for few code modifications + + // + // Setup limits is not necessary because in js we should not preallocate memory + // for inflate use constant limit in 65536 bytes + // + + /* space at extra (only when reading header) */ + // this.extra_max = 0; + /* pointer to zero-terminated file name or Z_NULL */ + this.name = ''; + /* space at name (only when reading header) */ + // this.name_max = 0; + /* pointer to zero-terminated comment or Z_NULL */ + this.comment = ''; + /* space at comment (only when reading header) */ + // this.comm_max = 0; + /* true if there was or will be a header crc */ + this.hcrc = 0; + /* true when done reading gzip header (not used when writing a gzip file) */ + this.done = false; +} + +module.exports = GZheader; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/inffast.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/inffast.js new file mode 100644 index 0000000..f4d6e7e --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/inffast.js @@ -0,0 +1,344 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +// See state defs from inflate.js +const BAD = 16209; /* got a data error -- remain here until reset */ +const TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ + +/* + Decode literal, length, and distance codes and write out the resulting + literal and match bytes until either not enough input or output is + available, an end-of-block is encountered, or a data error is encountered. + When large enough input and output buffers are supplied to inflate(), for + example, a 16K input buffer and a 64K output buffer, more than 95% of the + inflate execution time is spent in this routine. + + Entry assumptions: + + state.mode === LEN + strm.avail_in >= 6 + strm.avail_out >= 258 + start >= strm.avail_out + state.bits < 8 + + On return, state.mode is one of: + + LEN -- ran out of enough output space or enough available input + TYPE -- reached end of block code, inflate() to interpret next block + BAD -- error in block data + + Notes: + + - The maximum input bits used by a length/distance pair is 15 bits for the + length code, 5 bits for the length extra, 15 bits for the distance code, + and 13 bits for the distance extra. This totals 48 bits, or six bytes. + Therefore if strm.avail_in >= 6, then there is enough input to avoid + checking for available input while decoding. + + - The maximum bytes that a single length/distance pair can output is 258 + bytes, which is the maximum length that can be coded. inflate_fast() + requires strm.avail_out >= 258 for each loop to avoid checking for + output space. + */ +module.exports = function inflate_fast(strm, start) { + let _in; /* local strm.input */ + let last; /* have enough input while in < last */ + let _out; /* local strm.output */ + let beg; /* inflate()'s initial strm.output */ + let end; /* while out < end, enough space available */ +//#ifdef INFLATE_STRICT + let dmax; /* maximum distance from zlib header */ +//#endif + let wsize; /* window size or zero if not using window */ + let whave; /* valid bytes in the window */ + let wnext; /* window write index */ + // Use `s_window` instead `window`, avoid conflict with instrumentation tools + let s_window; /* allocated sliding window, if wsize != 0 */ + let hold; /* local strm.hold */ + let bits; /* local strm.bits */ + let lcode; /* local strm.lencode */ + let dcode; /* local strm.distcode */ + let lmask; /* mask for first level of length codes */ + let dmask; /* mask for first level of distance codes */ + let here; /* retrieved table entry */ + let op; /* code bits, operation, extra bits, or */ + /* window position, window bytes to copy */ + let len; /* match length, unused bytes */ + let dist; /* match distance */ + let from; /* where to copy match from */ + let from_source; + + + let input, output; // JS specific, because we have no pointers + + /* copy state to local variables */ + const state = strm.state; + //here = state.here; + _in = strm.next_in; + input = strm.input; + last = _in + (strm.avail_in - 5); + _out = strm.next_out; + output = strm.output; + beg = _out - (start - strm.avail_out); + end = _out + (strm.avail_out - 257); +//#ifdef INFLATE_STRICT + dmax = state.dmax; +//#endif + wsize = state.wsize; + whave = state.whave; + wnext = state.wnext; + s_window = state.window; + hold = state.hold; + bits = state.bits; + lcode = state.lencode; + dcode = state.distcode; + lmask = (1 << state.lenbits) - 1; + dmask = (1 << state.distbits) - 1; + + + /* decode literals and length/distances until end-of-block or not enough + input data or output space */ + + top: + do { + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + + here = lcode[hold & lmask]; + + dolen: + for (;;) { // Goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + if (op === 0) { /* literal */ + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + output[_out++] = here & 0xffff/*here.val*/; + } + else if (op & 16) { /* length base */ + len = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (op) { + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + len += hold & ((1 << op) - 1); + hold >>>= op; + bits -= op; + } + //Tracevv((stderr, "inflate: length %u\n", len)); + if (bits < 15) { + hold += input[_in++] << bits; + bits += 8; + hold += input[_in++] << bits; + bits += 8; + } + here = dcode[hold & dmask]; + + dodist: + for (;;) { // goto emulation + op = here >>> 24/*here.bits*/; + hold >>>= op; + bits -= op; + op = (here >>> 16) & 0xff/*here.op*/; + + if (op & 16) { /* distance base */ + dist = here & 0xffff/*here.val*/; + op &= 15; /* number of extra bits */ + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + if (bits < op) { + hold += input[_in++] << bits; + bits += 8; + } + } + dist += hold & ((1 << op) - 1); +//#ifdef INFLATE_STRICT + if (dist > dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break top; + } +//#endif + hold >>>= op; + bits -= op; + //Tracevv((stderr, "inflate: distance %u\n", dist)); + op = _out - beg; /* max distance in output */ + if (dist > op) { /* see if copy from window */ + op = dist - op; /* distance back in window */ + if (op > whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break top; + } + +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// if (len <= op - whave) { +// do { +// output[_out++] = 0; +// } while (--len); +// continue top; +// } +// len -= op - whave; +// do { +// output[_out++] = 0; +// } while (--op > whave); +// if (op === 0) { +// from = _out - dist; +// do { +// output[_out++] = output[from++]; +// } while (--len); +// continue top; +// } +//#endif + } + from = 0; // window index + from_source = s_window; + if (wnext === 0) { /* very common case */ + from += wsize - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + else if (wnext < op) { /* wrap around window */ + from += wsize + wnext - op; + op -= wnext; + if (op < len) { /* some from end of window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = 0; + if (wnext < len) { /* some from start of window */ + op = wnext; + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + } + else { /* contiguous in window */ + from += wnext - op; + if (op < len) { /* some from window */ + len -= op; + do { + output[_out++] = s_window[from++]; + } while (--op); + from = _out - dist; /* rest from output */ + from_source = output; + } + } + while (len > 2) { + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + output[_out++] = from_source[from++]; + len -= 3; + } + if (len) { + output[_out++] = from_source[from++]; + if (len > 1) { + output[_out++] = from_source[from++]; + } + } + } + else { + from = _out - dist; /* copy direct from output */ + do { /* minimum length is three */ + output[_out++] = output[from++]; + output[_out++] = output[from++]; + output[_out++] = output[from++]; + len -= 3; + } while (len > 2); + if (len) { + output[_out++] = output[from++]; + if (len > 1) { + output[_out++] = output[from++]; + } + } + } + } + else if ((op & 64) === 0) { /* 2nd level distance code */ + here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dodist; + } + else { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break top; + } + + break; // need to emulate goto via "continue" + } + } + else if ((op & 64) === 0) { /* 2nd level length code */ + here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; + continue dolen; + } + else if (op & 32) { /* end-of-block */ + //Tracevv((stderr, "inflate: end of block\n")); + state.mode = TYPE; + break top; + } + else { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break top; + } + + break; // need to emulate goto via "continue" + } + } while (_in < last && _out < end); + + /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ + len = bits >> 3; + _in -= len; + bits -= len << 3; + hold &= (1 << bits) - 1; + + /* update state and return */ + strm.next_in = _in; + strm.next_out = _out; + strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); + strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); + state.hold = hold; + state.bits = bits; + return; +}; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/inflate.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/inflate.js new file mode 100644 index 0000000..f5db4be --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/inflate.js @@ -0,0 +1,1572 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const adler32 = require('./adler32'); +const crc32 = require('./crc32'); +const inflate_fast = require('./inffast'); +const inflate_table = require('./inftrees'); + +const CODES = 0; +const LENS = 1; +const DISTS = 2; + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + +const { + Z_FINISH, Z_BLOCK, Z_TREES, + Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR, Z_BUF_ERROR, + Z_DEFLATED +} = require('./constants'); + + +/* STATES ====================================================================*/ +/* ===========================================================================*/ + + +const HEAD = 16180; /* i: waiting for magic header */ +const FLAGS = 16181; /* i: waiting for method and flags (gzip) */ +const TIME = 16182; /* i: waiting for modification time (gzip) */ +const OS = 16183; /* i: waiting for extra flags and operating system (gzip) */ +const EXLEN = 16184; /* i: waiting for extra length (gzip) */ +const EXTRA = 16185; /* i: waiting for extra bytes (gzip) */ +const NAME = 16186; /* i: waiting for end of file name (gzip) */ +const COMMENT = 16187; /* i: waiting for end of comment (gzip) */ +const HCRC = 16188; /* i: waiting for header crc (gzip) */ +const DICTID = 16189; /* i: waiting for dictionary check value */ +const DICT = 16190; /* waiting for inflateSetDictionary() call */ +const TYPE = 16191; /* i: waiting for type bits, including last-flag bit */ +const TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */ +const STORED = 16193; /* i: waiting for stored size (length and complement) */ +const COPY_ = 16194; /* i/o: same as COPY below, but only first time in */ +const COPY = 16195; /* i/o: waiting for input or output to copy stored block */ +const TABLE = 16196; /* i: waiting for dynamic block table lengths */ +const LENLENS = 16197; /* i: waiting for code length code lengths */ +const CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */ +const LEN_ = 16199; /* i: same as LEN below, but only first time in */ +const LEN = 16200; /* i: waiting for length/lit/eob code */ +const LENEXT = 16201; /* i: waiting for length extra bits */ +const DIST = 16202; /* i: waiting for distance code */ +const DISTEXT = 16203; /* i: waiting for distance extra bits */ +const MATCH = 16204; /* o: waiting for output space to copy string */ +const LIT = 16205; /* o: waiting for output space to write literal */ +const CHECK = 16206; /* i: waiting for 32-bit check value */ +const LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */ +const DONE = 16208; /* finished check, done -- remain here until reset */ +const BAD = 16209; /* got a data error -- remain here until reset */ +const MEM = 16210; /* got an inflate() memory error -- remain here until reset */ +const SYNC = 16211; /* looking for synchronization bytes to restart inflate() */ + +/* ===========================================================================*/ + + + +const ENOUGH_LENS = 852; +const ENOUGH_DISTS = 592; +//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +const MAX_WBITS = 15; +/* 32K LZ77 window */ +const DEF_WBITS = MAX_WBITS; + + +const zswap32 = (q) => { + + return (((q >>> 24) & 0xff) + + ((q >>> 8) & 0xff00) + + ((q & 0xff00) << 8) + + ((q & 0xff) << 24)); +}; + + +function InflateState() { + this.strm = null; /* pointer back to this zlib stream */ + this.mode = 0; /* current inflate mode */ + this.last = false; /* true if processing last block */ + this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip, + bit 2 true to validate check value */ + this.havedict = false; /* true if dictionary provided */ + this.flags = 0; /* gzip header method and flags (0 if zlib), or + -1 if raw or no header yet */ + this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ + this.check = 0; /* protected copy of check value */ + this.total = 0; /* protected copy of output count */ + // TODO: may be {} + this.head = null; /* where to save gzip header information */ + + /* sliding window */ + this.wbits = 0; /* log base 2 of requested window size */ + this.wsize = 0; /* window size or zero if not using window */ + this.whave = 0; /* valid bytes in the window */ + this.wnext = 0; /* window write index */ + this.window = null; /* allocated sliding window, if needed */ + + /* bit accumulator */ + this.hold = 0; /* input bit accumulator */ + this.bits = 0; /* number of bits in "in" */ + + /* for string and stored block copying */ + this.length = 0; /* literal or length of data to copy */ + this.offset = 0; /* distance back to copy string from */ + + /* for table and code decoding */ + this.extra = 0; /* extra bits needed */ + + /* fixed and dynamic code tables */ + this.lencode = null; /* starting table for length/literal codes */ + this.distcode = null; /* starting table for distance codes */ + this.lenbits = 0; /* index bits for lencode */ + this.distbits = 0; /* index bits for distcode */ + + /* dynamic table building */ + this.ncode = 0; /* number of code length code lengths */ + this.nlen = 0; /* number of length code lengths */ + this.ndist = 0; /* number of distance code lengths */ + this.have = 0; /* number of code lengths in lens[] */ + this.next = null; /* next available space in codes[] */ + + this.lens = new Uint16Array(320); /* temporary storage for code lengths */ + this.work = new Uint16Array(288); /* work area for code table building */ + + /* + because we don't have pointers in js, we use lencode and distcode directly + as buffers so we don't need codes + */ + //this.codes = new Int32Array(ENOUGH); /* space for code tables */ + this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ + this.distdyn = null; /* dynamic table for distance codes (JS specific) */ + this.sane = 0; /* if false, allow invalid distance too far */ + this.back = 0; /* bits back of last unprocessed length/lit */ + this.was = 0; /* initial length of match */ +} + + +const inflateStateCheck = (strm) => { + + if (!strm) { + return 1; + } + const state = strm.state; + if (!state || state.strm !== strm || + state.mode < HEAD || state.mode > SYNC) { + return 1; + } + return 0; +}; + + +const inflateResetKeep = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; } + const state = strm.state; + strm.total_in = strm.total_out = state.total = 0; + strm.msg = ''; /*Z_NULL*/ + if (state.wrap) { /* to support ill-conceived Java test suite */ + strm.adler = state.wrap & 1; + } + state.mode = HEAD; + state.last = 0; + state.havedict = 0; + state.flags = -1; + state.dmax = 32768; + state.head = null/*Z_NULL*/; + state.hold = 0; + state.bits = 0; + //state.lencode = state.distcode = state.next = state.codes; + state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS); + state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS); + + state.sane = 1; + state.back = -1; + //Tracev((stderr, "inflate: reset\n")); + return Z_OK; +}; + + +const inflateReset = (strm) => { + + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; } + const state = strm.state; + state.wsize = 0; + state.whave = 0; + state.wnext = 0; + return inflateResetKeep(strm); + +}; + + +const inflateReset2 = (strm, windowBits) => { + let wrap; + + /* get the state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; } + const state = strm.state; + + /* extract wrap request from windowBits parameter */ + if (windowBits < 0) { + wrap = 0; + windowBits = -windowBits; + } + else { + wrap = (windowBits >> 4) + 5; + if (windowBits < 48) { + windowBits &= 15; + } + } + + /* set number of window bits, free window if different */ + if (windowBits && (windowBits < 8 || windowBits > 15)) { + return Z_STREAM_ERROR; + } + if (state.window !== null && state.wbits !== windowBits) { + state.window = null; + } + + /* update state and reset the rest of it */ + state.wrap = wrap; + state.wbits = windowBits; + return inflateReset(strm); +}; + + +const inflateInit2 = (strm, windowBits) => { + + if (!strm) { return Z_STREAM_ERROR; } + //strm.msg = Z_NULL; /* in case we return an error */ + + const state = new InflateState(); + + //if (state === Z_NULL) return Z_MEM_ERROR; + //Tracev((stderr, "inflate: allocated\n")); + strm.state = state; + state.strm = strm; + state.window = null/*Z_NULL*/; + state.mode = HEAD; /* to pass state test in inflateReset2() */ + const ret = inflateReset2(strm, windowBits); + if (ret !== Z_OK) { + strm.state = null/*Z_NULL*/; + } + return ret; +}; + + +const inflateInit = (strm) => { + + return inflateInit2(strm, DEF_WBITS); +}; + + +/* + Return state with length and distance decoding tables and index sizes set to + fixed code decoding. Normally this returns fixed tables from inffixed.h. + If BUILDFIXED is defined, then instead this routine builds the tables the + first time it's called, and returns those tables the first time and + thereafter. This reduces the size of the code by about 2K bytes, in + exchange for a little execution time. However, BUILDFIXED should not be + used for threaded applications, since the rewriting of the tables and virgin + may not be thread-safe. + */ +let virgin = true; + +let lenfix, distfix; // We have no pointers in JS, so keep tables separate + + +const fixedtables = (state) => { + + /* build fixed huffman tables if first call (may not be thread safe) */ + if (virgin) { + lenfix = new Int32Array(512); + distfix = new Int32Array(32); + + /* literal/length table */ + let sym = 0; + while (sym < 144) { state.lens[sym++] = 8; } + while (sym < 256) { state.lens[sym++] = 9; } + while (sym < 280) { state.lens[sym++] = 7; } + while (sym < 288) { state.lens[sym++] = 8; } + + inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); + + /* distance table */ + sym = 0; + while (sym < 32) { state.lens[sym++] = 5; } + + inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); + + /* do this just once */ + virgin = false; + } + + state.lencode = lenfix; + state.lenbits = 9; + state.distcode = distfix; + state.distbits = 5; +}; + + +/* + Update the window with the last wsize (normally 32K) bytes written before + returning. If window does not exist yet, create it. This is only called + when a window is already in use, or when output has been written during this + inflate call, but the end of the deflate stream has not been reached yet. + It is also called to create a window for dictionary data when a dictionary + is loaded. + + Providing output buffers larger than 32K to inflate() should provide a speed + advantage, since only the last 32K of output is copied to the sliding window + upon return from inflate(), and since all distances after the first 32K of + output will fall in the output data, making match copies simpler and faster. + The advantage may be dependent on the size of the processor's data caches. + */ +const updatewindow = (strm, src, end, copy) => { + + let dist; + const state = strm.state; + + /* if it hasn't been done already, allocate space for the window */ + if (state.window === null) { + state.wsize = 1 << state.wbits; + state.wnext = 0; + state.whave = 0; + + state.window = new Uint8Array(state.wsize); + } + + /* copy state->wsize or less output bytes into the circular window */ + if (copy >= state.wsize) { + state.window.set(src.subarray(end - state.wsize, end), 0); + state.wnext = 0; + state.whave = state.wsize; + } + else { + dist = state.wsize - state.wnext; + if (dist > copy) { + dist = copy; + } + //zmemcpy(state->window + state->wnext, end - copy, dist); + state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); + copy -= dist; + if (copy) { + //zmemcpy(state->window, end - copy, copy); + state.window.set(src.subarray(end - copy, end), 0); + state.wnext = copy; + state.whave = state.wsize; + } + else { + state.wnext += dist; + if (state.wnext === state.wsize) { state.wnext = 0; } + if (state.whave < state.wsize) { state.whave += dist; } + } + } + return 0; +}; + + +const inflate = (strm, flush) => { + + let state; + let input, output; // input/output buffers + let next; /* next input INDEX */ + let put; /* next output INDEX */ + let have, left; /* available input and output */ + let hold; /* bit buffer */ + let bits; /* bits in bit buffer */ + let _in, _out; /* save starting available input and output */ + let copy; /* number of stored or match bytes to copy */ + let from; /* where to copy match bytes from */ + let from_source; + let here = 0; /* current decoding table entry */ + let here_bits, here_op, here_val; // paked "here" denormalized (JS specific) + //let last; /* parent table entry */ + let last_bits, last_op, last_val; // paked "last" denormalized (JS specific) + let len; /* length to copy for repeats, bits to drop */ + let ret; /* return code */ + const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ + let opts; + + let n; // temporary variable for NEED_BITS + + const order = /* permutation of code lengths */ + new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]); + + + if (inflateStateCheck(strm) || !strm.output || + (!strm.input && strm.avail_in !== 0)) { + return Z_STREAM_ERROR; + } + + state = strm.state; + if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ + + + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + _in = have; + _out = left; + ret = Z_OK; + + inf_leave: // goto emulation + for (;;) { + switch (state.mode) { + case HEAD: + if (state.wrap === 0) { + state.mode = TYPEDO; + break; + } + //=== NEEDBITS(16); + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ + if (state.wbits === 0) { + state.wbits = 15; + } + state.check = 0/*crc32(0L, Z_NULL, 0)*/; + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = FLAGS; + break; + } + if (state.head) { + state.head.done = false; + } + if (!(state.wrap & 1) || /* check if zlib header allowed */ + (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { + strm.msg = 'incorrect header check'; + state.mode = BAD; + break; + } + if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// + len = (hold & 0x0f)/*BITS(4)*/ + 8; + if (state.wbits === 0) { + state.wbits = len; + } + if (len > 15 || len > state.wbits) { + strm.msg = 'invalid window size'; + state.mode = BAD; + break; + } + + // !!! pako patch. Force use `options.windowBits` if passed. + // Required to always use max window size by default. + state.dmax = 1 << state.wbits; + //state.dmax = 1 << len; + + state.flags = 0; /* indicate zlib header */ + //Tracev((stderr, "inflate: zlib header ok\n")); + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = hold & 0x200 ? DICTID : TYPE; + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + break; + case FLAGS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.flags = hold; + if ((state.flags & 0xff) !== Z_DEFLATED) { + strm.msg = 'unknown compression method'; + state.mode = BAD; + break; + } + if (state.flags & 0xe000) { + strm.msg = 'unknown header flags set'; + state.mode = BAD; + break; + } + if (state.head) { + state.head.text = ((hold >> 8) & 1); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = TIME; + /* falls through */ + case TIME: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.time = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC4(state.check, hold) + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + hbuf[2] = (hold >>> 16) & 0xff; + hbuf[3] = (hold >>> 24) & 0xff; + state.check = crc32(state.check, hbuf, 4, 0); + //=== + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = OS; + /* falls through */ + case OS: + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if (state.head) { + state.head.xflags = (hold & 0xff); + state.head.os = (hold >> 8); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = EXLEN; + /* falls through */ + case EXLEN: + if (state.flags & 0x0400) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length = hold; + if (state.head) { + state.head.extra_len = hold; + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + //=== CRC2(state.check, hold); + hbuf[0] = hold & 0xff; + hbuf[1] = (hold >>> 8) & 0xff; + state.check = crc32(state.check, hbuf, 2, 0); + //===// + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + else if (state.head) { + state.head.extra = null/*Z_NULL*/; + } + state.mode = EXTRA; + /* falls through */ + case EXTRA: + if (state.flags & 0x0400) { + copy = state.length; + if (copy > have) { copy = have; } + if (copy) { + if (state.head) { + len = state.head.extra_len - state.length; + if (!state.head.extra) { + // Use untyped array for more convenient processing later + state.head.extra = new Uint8Array(state.head.extra_len); + } + state.head.extra.set( + input.subarray( + next, + // extra field is limited to 65536 bytes + // - no need for additional size check + next + copy + ), + /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ + len + ); + //zmemcpy(state.head.extra + len, next, + // len + copy > state.head.extra_max ? + // state.head.extra_max - len : copy); + } + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32(state.check, input, copy, next); + } + have -= copy; + next += copy; + state.length -= copy; + } + if (state.length) { break inf_leave; } + } + state.length = 0; + state.mode = NAME; + /* falls through */ + case NAME: + if (state.flags & 0x0800) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + // TODO: 2 or 1 bytes? + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.name_max*/)) { + state.head.name += String.fromCharCode(len); + } + } while (len && copy < have); + + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.name = null; + } + state.length = 0; + state.mode = COMMENT; + /* falls through */ + case COMMENT: + if (state.flags & 0x1000) { + if (have === 0) { break inf_leave; } + copy = 0; + do { + len = input[next + copy++]; + /* use constant limit because in js we should not preallocate memory */ + if (state.head && len && + (state.length < 65536 /*state.head.comm_max*/)) { + state.head.comment += String.fromCharCode(len); + } + } while (len && copy < have); + if ((state.flags & 0x0200) && (state.wrap & 4)) { + state.check = crc32(state.check, input, copy, next); + } + have -= copy; + next += copy; + if (len) { break inf_leave; } + } + else if (state.head) { + state.head.comment = null; + } + state.mode = HCRC; + /* falls through */ + case HCRC: + if (state.flags & 0x0200) { + //=== NEEDBITS(16); */ + while (bits < 16) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.check & 0xffff)) { + strm.msg = 'header crc mismatch'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + } + if (state.head) { + state.head.hcrc = ((state.flags >> 9) & 1); + state.head.done = true; + } + strm.adler = state.check = 0; + state.mode = TYPE; + break; + case DICTID: + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + strm.adler = state.check = zswap32(hold); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = DICT; + /* falls through */ + case DICT: + if (state.havedict === 0) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + return Z_NEED_DICT; + } + strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; + state.mode = TYPE; + /* falls through */ + case TYPE: + if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } + /* falls through */ + case TYPEDO: + if (state.last) { + //--- BYTEBITS() ---// + hold >>>= bits & 7; + bits -= bits & 7; + //---// + state.mode = CHECK; + break; + } + //=== NEEDBITS(3); */ + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.last = (hold & 0x01)/*BITS(1)*/; + //--- DROPBITS(1) ---// + hold >>>= 1; + bits -= 1; + //---// + + switch ((hold & 0x03)/*BITS(2)*/) { + case 0: /* stored block */ + //Tracev((stderr, "inflate: stored block%s\n", + // state.last ? " (last)" : "")); + state.mode = STORED; + break; + case 1: /* fixed block */ + fixedtables(state); + //Tracev((stderr, "inflate: fixed codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = LEN_; /* decode codes */ + if (flush === Z_TREES) { + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break inf_leave; + } + break; + case 2: /* dynamic block */ + //Tracev((stderr, "inflate: dynamic codes block%s\n", + // state.last ? " (last)" : "")); + state.mode = TABLE; + break; + case 3: + strm.msg = 'invalid block type'; + state.mode = BAD; + } + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + break; + case STORED: + //--- BYTEBITS() ---// /* go to byte boundary */ + hold >>>= bits & 7; + bits -= bits & 7; + //---// + //=== NEEDBITS(32); */ + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { + strm.msg = 'invalid stored block lengths'; + state.mode = BAD; + break; + } + state.length = hold & 0xffff; + //Tracev((stderr, "inflate: stored length %u\n", + // state.length)); + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + state.mode = COPY_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case COPY_: + state.mode = COPY; + /* falls through */ + case COPY: + copy = state.length; + if (copy) { + if (copy > have) { copy = have; } + if (copy > left) { copy = left; } + if (copy === 0) { break inf_leave; } + //--- zmemcpy(put, next, copy); --- + output.set(input.subarray(next, next + copy), put); + //---// + have -= copy; + next += copy; + left -= copy; + put += copy; + state.length -= copy; + break; + } + //Tracev((stderr, "inflate: stored end\n")); + state.mode = TYPE; + break; + case TABLE: + //=== NEEDBITS(14); */ + while (bits < 14) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; + //--- DROPBITS(5) ---// + hold >>>= 5; + bits -= 5; + //---// + state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; + //--- DROPBITS(4) ---// + hold >>>= 4; + bits -= 4; + //---// +//#ifndef PKZIP_BUG_WORKAROUND + if (state.nlen > 286 || state.ndist > 30) { + strm.msg = 'too many length or distance symbols'; + state.mode = BAD; + break; + } +//#endif + //Tracev((stderr, "inflate: table sizes ok\n")); + state.have = 0; + state.mode = LENLENS; + /* falls through */ + case LENLENS: + while (state.have < state.ncode) { + //=== NEEDBITS(3); + while (bits < 3) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + while (state.have < 19) { + state.lens[order[state.have++]] = 0; + } + // We have separate tables & no pointers. 2 commented lines below not needed. + //state.next = state.codes; + //state.lencode = state.next; + // Switch to use dynamic table + state.lencode = state.lendyn; + state.lenbits = 7; + + opts = { bits: state.lenbits }; + ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); + state.lenbits = opts.bits; + + if (ret) { + strm.msg = 'invalid code lengths set'; + state.mode = BAD; + break; + } + //Tracev((stderr, "inflate: code lengths ok\n")); + state.have = 0; + state.mode = CODELENS; + /* falls through */ + case CODELENS: + while (state.have < state.nlen + state.ndist) { + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_val < 16) { + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.lens[state.have++] = here_val; + } + else { + if (here_val === 16) { + //=== NEEDBITS(here.bits + 2); + n = here_bits + 2; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + if (state.have === 0) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + len = state.lens[state.have - 1]; + copy = 3 + (hold & 0x03);//BITS(2); + //--- DROPBITS(2) ---// + hold >>>= 2; + bits -= 2; + //---// + } + else if (here_val === 17) { + //=== NEEDBITS(here.bits + 3); + n = here_bits + 3; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 3 + (hold & 0x07);//BITS(3); + //--- DROPBITS(3) ---// + hold >>>= 3; + bits -= 3; + //---// + } + else { + //=== NEEDBITS(here.bits + 7); + n = here_bits + 7; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + len = 0; + copy = 11 + (hold & 0x7f);//BITS(7); + //--- DROPBITS(7) ---// + hold >>>= 7; + bits -= 7; + //---// + } + if (state.have + copy > state.nlen + state.ndist) { + strm.msg = 'invalid bit length repeat'; + state.mode = BAD; + break; + } + while (copy--) { + state.lens[state.have++] = len; + } + } + } + + /* handle error breaks in while */ + if (state.mode === BAD) { break; } + + /* check for end-of-block code (better have one) */ + if (state.lens[256] === 0) { + strm.msg = 'invalid code -- missing end-of-block'; + state.mode = BAD; + break; + } + + /* build code tables -- note: do not change the lenbits or distbits + values here (9 and 6) without reading the comments in inftrees.h + concerning the ENOUGH constants, which depend on those values */ + state.lenbits = 9; + + opts = { bits: state.lenbits }; + ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.lenbits = opts.bits; + // state.lencode = state.next; + + if (ret) { + strm.msg = 'invalid literal/lengths set'; + state.mode = BAD; + break; + } + + state.distbits = 6; + //state.distcode.copy(state.codes); + // Switch to use dynamic table + state.distcode = state.distdyn; + opts = { bits: state.distbits }; + ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts); + // We have separate tables & no pointers. 2 commented lines below not needed. + // state.next_index = opts.table_index; + state.distbits = opts.bits; + // state.distcode = state.next; + + if (ret) { + strm.msg = 'invalid distances set'; + state.mode = BAD; + break; + } + //Tracev((stderr, 'inflate: codes ok\n')); + state.mode = LEN_; + if (flush === Z_TREES) { break inf_leave; } + /* falls through */ + case LEN_: + state.mode = LEN; + /* falls through */ + case LEN: + if (have >= 6 && left >= 258) { + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + inflate_fast(strm, _out); + //--- LOAD() --- + put = strm.next_out; + output = strm.output; + left = strm.avail_out; + next = strm.next_in; + input = strm.input; + have = strm.avail_in; + hold = state.hold; + bits = state.bits; + //--- + + if (state.mode === TYPE) { + state.back = -1; + } + break; + } + state.back = 0; + for (;;) { + here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if (here_bits <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if (here_op && (here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.lencode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + state.length = here_val; + if (here_op === 0) { + //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? + // "inflate: literal '%c'\n" : + // "inflate: literal 0x%02x\n", here.val)); + state.mode = LIT; + break; + } + if (here_op & 32) { + //Tracevv((stderr, "inflate: end of block\n")); + state.back = -1; + state.mode = TYPE; + break; + } + if (here_op & 64) { + strm.msg = 'invalid literal/length code'; + state.mode = BAD; + break; + } + state.extra = here_op & 15; + state.mode = LENEXT; + /* falls through */ + case LENEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } + //Tracevv((stderr, "inflate: length %u\n", state.length)); + state.was = state.length; + state.mode = DIST; + /* falls through */ + case DIST: + for (;;) { + here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + if ((here_op & 0xf0) === 0) { + last_bits = here_bits; + last_op = here_op; + last_val = here_val; + for (;;) { + here = state.distcode[last_val + + ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; + here_bits = here >>> 24; + here_op = (here >>> 16) & 0xff; + here_val = here & 0xffff; + + if ((last_bits + here_bits) <= bits) { break; } + //--- PULLBYTE() ---// + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + //---// + } + //--- DROPBITS(last.bits) ---// + hold >>>= last_bits; + bits -= last_bits; + //---// + state.back += last_bits; + } + //--- DROPBITS(here.bits) ---// + hold >>>= here_bits; + bits -= here_bits; + //---// + state.back += here_bits; + if (here_op & 64) { + strm.msg = 'invalid distance code'; + state.mode = BAD; + break; + } + state.offset = here_val; + state.extra = (here_op) & 15; + state.mode = DISTEXT; + /* falls through */ + case DISTEXT: + if (state.extra) { + //=== NEEDBITS(state.extra); + n = state.extra; + while (bits < n) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; + //--- DROPBITS(state.extra) ---// + hold >>>= state.extra; + bits -= state.extra; + //---// + state.back += state.extra; + } +//#ifdef INFLATE_STRICT + if (state.offset > state.dmax) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +//#endif + //Tracevv((stderr, "inflate: distance %u\n", state.offset)); + state.mode = MATCH; + /* falls through */ + case MATCH: + if (left === 0) { break inf_leave; } + copy = _out - left; + if (state.offset > copy) { /* copy from window */ + copy = state.offset - copy; + if (copy > state.whave) { + if (state.sane) { + strm.msg = 'invalid distance too far back'; + state.mode = BAD; + break; + } +// (!) This block is disabled in zlib defaults, +// don't enable it for binary compatibility +//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR +// Trace((stderr, "inflate.c too far\n")); +// copy -= state.whave; +// if (copy > state.length) { copy = state.length; } +// if (copy > left) { copy = left; } +// left -= copy; +// state.length -= copy; +// do { +// output[put++] = 0; +// } while (--copy); +// if (state.length === 0) { state.mode = LEN; } +// break; +//#endif + } + if (copy > state.wnext) { + copy -= state.wnext; + from = state.wsize - copy; + } + else { + from = state.wnext - copy; + } + if (copy > state.length) { copy = state.length; } + from_source = state.window; + } + else { /* copy from output */ + from_source = output; + from = put - state.offset; + copy = state.length; + } + if (copy > left) { copy = left; } + left -= copy; + state.length -= copy; + do { + output[put++] = from_source[from++]; + } while (--copy); + if (state.length === 0) { state.mode = LEN; } + break; + case LIT: + if (left === 0) { break inf_leave; } + output[put++] = state.length; + left--; + state.mode = LEN; + break; + case CHECK: + if (state.wrap) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + // Use '|' instead of '+' to make sure that result is signed + hold |= input[next++] << bits; + bits += 8; + } + //===// + _out -= left; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = + /*UPDATE_CHECK(state.check, put - _out, _out);*/ + (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out)); + + } + _out = left; + // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too + if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) { + strm.msg = 'incorrect data check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: check matches trailer\n")); + } + state.mode = LENGTH; + /* falls through */ + case LENGTH: + if (state.wrap && state.flags) { + //=== NEEDBITS(32); + while (bits < 32) { + if (have === 0) { break inf_leave; } + have--; + hold += input[next++] << bits; + bits += 8; + } + //===// + if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) { + strm.msg = 'incorrect length check'; + state.mode = BAD; + break; + } + //=== INITBITS(); + hold = 0; + bits = 0; + //===// + //Tracev((stderr, "inflate: length matches trailer\n")); + } + state.mode = DONE; + /* falls through */ + case DONE: + ret = Z_STREAM_END; + break inf_leave; + case BAD: + ret = Z_DATA_ERROR; + break inf_leave; + case MEM: + return Z_MEM_ERROR; + case SYNC: + /* falls through */ + default: + return Z_STREAM_ERROR; + } + } + + // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" + + /* + Return from inflate(), updating the total counts and the check value. + If there was no progress during the inflate() call, return a buffer + error. Call updatewindow() to create and/or update the window state. + Note: a memory error from inflate() is non-recoverable. + */ + + //--- RESTORE() --- + strm.next_out = put; + strm.avail_out = left; + strm.next_in = next; + strm.avail_in = have; + state.hold = hold; + state.bits = bits; + //--- + + if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && + (state.mode < CHECK || flush !== Z_FINISH))) { + if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) { + state.mode = MEM; + return Z_MEM_ERROR; + } + } + _in -= strm.avail_in; + _out -= strm.avail_out; + strm.total_in += _in; + strm.total_out += _out; + state.total += _out; + if ((state.wrap & 4) && _out) { + strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/ + (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out)); + } + strm.data_type = state.bits + (state.last ? 64 : 0) + + (state.mode === TYPE ? 128 : 0) + + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); + if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) { + ret = Z_BUF_ERROR; + } + return ret; +}; + + +const inflateEnd = (strm) => { + + if (inflateStateCheck(strm)) { + return Z_STREAM_ERROR; + } + + let state = strm.state; + if (state.window) { + state.window = null; + } + strm.state = null; + return Z_OK; +}; + + +const inflateGetHeader = (strm, head) => { + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; } + const state = strm.state; + if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; } + + /* save header structure */ + state.head = head; + head.done = false; + return Z_OK; +}; + + +const inflateSetDictionary = (strm, dictionary) => { + const dictLength = dictionary.length; + + let state; + let dictid; + let ret; + + /* check state */ + if (inflateStateCheck(strm)) { return Z_STREAM_ERROR; } + state = strm.state; + + if (state.wrap !== 0 && state.mode !== DICT) { + return Z_STREAM_ERROR; + } + + /* check for correct dictionary identifier */ + if (state.mode === DICT) { + dictid = 1; /* adler32(0, null, 0)*/ + /* dictid = adler32(dictid, dictionary, dictLength); */ + dictid = adler32(dictid, dictionary, dictLength, 0); + if (dictid !== state.check) { + return Z_DATA_ERROR; + } + } + /* copy dictionary to window using updatewindow(), which will amend the + existing dictionary if appropriate */ + ret = updatewindow(strm, dictionary, dictLength, dictLength); + if (ret) { + state.mode = MEM; + return Z_MEM_ERROR; + } + state.havedict = 1; + // Tracev((stderr, "inflate: dictionary set\n")); + return Z_OK; +}; + + +module.exports.inflateReset = inflateReset; +module.exports.inflateReset2 = inflateReset2; +module.exports.inflateResetKeep = inflateResetKeep; +module.exports.inflateInit = inflateInit; +module.exports.inflateInit2 = inflateInit2; +module.exports.inflate = inflate; +module.exports.inflateEnd = inflateEnd; +module.exports.inflateGetHeader = inflateGetHeader; +module.exports.inflateSetDictionary = inflateSetDictionary; +module.exports.inflateInfo = 'pako inflate (from Nodeca project)'; + +/* Not implemented +module.exports.inflateCodesUsed = inflateCodesUsed; +module.exports.inflateCopy = inflateCopy; +module.exports.inflateGetDictionary = inflateGetDictionary; +module.exports.inflateMark = inflateMark; +module.exports.inflatePrime = inflatePrime; +module.exports.inflateSync = inflateSync; +module.exports.inflateSyncPoint = inflateSyncPoint; +module.exports.inflateUndermine = inflateUndermine; +module.exports.inflateValidate = inflateValidate; +*/ diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/inftrees.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/inftrees.js new file mode 100644 index 0000000..eee389e --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/inftrees.js @@ -0,0 +1,340 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +const MAXBITS = 15; +const ENOUGH_LENS = 852; +const ENOUGH_DISTS = 592; +//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); + +const CODES = 0; +const LENS = 1; +const DISTS = 2; + +const lbase = new Uint16Array([ /* Length codes 257..285 base */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 +]); + +const lext = new Uint8Array([ /* Length codes 257..285 extra */ + 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, + 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78 +]); + +const dbase = new Uint16Array([ /* Distance codes 0..29 base */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577, 0, 0 +]); + +const dext = new Uint8Array([ /* Distance codes 0..29 extra */ + 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, + 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, + 28, 28, 29, 29, 64, 64 +]); + +const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) => +{ + const bits = opts.bits; + //here = opts.here; /* table entry for duplication */ + + let len = 0; /* a code's length in bits */ + let sym = 0; /* index of code symbols */ + let min = 0, max = 0; /* minimum and maximum code lengths */ + let root = 0; /* number of index bits for root table */ + let curr = 0; /* number of index bits for current table */ + let drop = 0; /* code bits to drop for sub-table */ + let left = 0; /* number of prefix codes available */ + let used = 0; /* code entries in table used */ + let huff = 0; /* Huffman code */ + let incr; /* for incrementing code, index */ + let fill; /* index for replicating entries */ + let low; /* low bits for current root entry */ + let mask; /* mask for low root bits */ + let next; /* next available space in table */ + let base = null; /* base value table to use */ +// let shoextra; /* extra bits table to use */ + let match; /* use base and extra for symbol >= match */ + const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ + const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ + let extra = null; + + let here_bits, here_op, here_val; + + /* + Process a set of code lengths to create a canonical Huffman code. The + code lengths are lens[0..codes-1]. Each length corresponds to the + symbols 0..codes-1. The Huffman code is generated by first sorting the + symbols by length from short to long, and retaining the symbol order + for codes with equal lengths. Then the code starts with all zero bits + for the first code of the shortest length, and the codes are integer + increments for the same length, and zeros are appended as the length + increases. For the deflate format, these bits are stored backwards + from their more natural integer increment ordering, and so when the + decoding tables are built in the large loop below, the integer codes + are incremented backwards. + + This routine assumes, but does not check, that all of the entries in + lens[] are in the range 0..MAXBITS. The caller must assure this. + 1..MAXBITS is interpreted as that code length. zero means that that + symbol does not occur in this code. + + The codes are sorted by computing a count of codes for each length, + creating from that a table of starting indices for each length in the + sorted table, and then entering the symbols in order in the sorted + table. The sorted table is work[], with that space being provided by + the caller. + + The length counts are used for other purposes as well, i.e. finding + the minimum and maximum length codes, determining if there are any + codes at all, checking for a valid set of lengths, and looking ahead + at length counts to determine sub-table sizes when building the + decoding tables. + */ + + /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ + for (len = 0; len <= MAXBITS; len++) { + count[len] = 0; + } + for (sym = 0; sym < codes; sym++) { + count[lens[lens_index + sym]]++; + } + + /* bound code lengths, force root to be within code lengths */ + root = bits; + for (max = MAXBITS; max >= 1; max--) { + if (count[max] !== 0) { break; } + } + if (root > max) { + root = max; + } + if (max === 0) { /* no symbols to code at all */ + //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ + //table.bits[opts.table_index] = 1; //here.bits = (var char)1; + //table.val[opts.table_index++] = 0; //here.val = (var short)0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + + //table.op[opts.table_index] = 64; + //table.bits[opts.table_index] = 1; + //table.val[opts.table_index++] = 0; + table[table_index++] = (1 << 24) | (64 << 16) | 0; + + opts.bits = 1; + return 0; /* no symbols, but wait for decoding to report error */ + } + for (min = 1; min < max; min++) { + if (count[min] !== 0) { break; } + } + if (root < min) { + root = min; + } + + /* check for an over-subscribed or incomplete set of lengths */ + left = 1; + for (len = 1; len <= MAXBITS; len++) { + left <<= 1; + left -= count[len]; + if (left < 0) { + return -1; + } /* over-subscribed */ + } + if (left > 0 && (type === CODES || max !== 1)) { + return -1; /* incomplete set */ + } + + /* generate offsets into symbol table for each length for sorting */ + offs[1] = 0; + for (len = 1; len < MAXBITS; len++) { + offs[len + 1] = offs[len] + count[len]; + } + + /* sort symbols by length, by symbol order within each length */ + for (sym = 0; sym < codes; sym++) { + if (lens[lens_index + sym] !== 0) { + work[offs[lens[lens_index + sym]]++] = sym; + } + } + + /* + Create and fill in decoding tables. In this loop, the table being + filled is at next and has curr index bits. The code being used is huff + with length len. That code is converted to an index by dropping drop + bits off of the bottom. For codes where len is less than drop + curr, + those top drop + curr - len bits are incremented through all values to + fill the table with replicated entries. + + root is the number of index bits for the root table. When len exceeds + root, sub-tables are created pointed to by the root entry with an index + of the low root bits of huff. This is saved in low to check for when a + new sub-table should be started. drop is zero when the root table is + being filled, and drop is root when sub-tables are being filled. + + When a new sub-table is needed, it is necessary to look ahead in the + code lengths to determine what size sub-table is needed. The length + counts are used for this, and so count[] is decremented as codes are + entered in the tables. + + used keeps track of how many table entries have been allocated from the + provided *table space. It is checked for LENS and DIST tables against + the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in + the initial root table size constants. See the comments in inftrees.h + for more information. + + sym increments through all symbols, and the loop terminates when + all codes of length max, i.e. all codes, have been processed. This + routine permits incomplete codes, so another loop after this one fills + in the rest of the decoding tables with invalid code markers. + */ + + /* set up for code type */ + // poor man optimization - use if-else instead of switch, + // to avoid deopts in old v8 + if (type === CODES) { + base = extra = work; /* dummy value--not used */ + match = 20; + + } else if (type === LENS) { + base = lbase; + extra = lext; + match = 257; + + } else { /* DISTS */ + base = dbase; + extra = dext; + match = 0; + } + + /* initialize opts for loop */ + huff = 0; /* starting code */ + sym = 0; /* starting code symbol */ + len = min; /* starting code length */ + next = table_index; /* current table to fill in */ + curr = root; /* current table index bits */ + drop = 0; /* current bits to drop from code for index */ + low = -1; /* trigger new sub-table when len > root */ + used = 1 << root; /* use root table entries */ + mask = used - 1; /* mask for comparing low */ + + /* check available table space */ + if ((type === LENS && used > ENOUGH_LENS) || + (type === DISTS && used > ENOUGH_DISTS)) { + return 1; + } + + /* process all codes and make table entries */ + for (;;) { + /* create table entry */ + here_bits = len - drop; + if (work[sym] + 1 < match) { + here_op = 0; + here_val = work[sym]; + } + else if (work[sym] >= match) { + here_op = extra[work[sym] - match]; + here_val = base[work[sym] - match]; + } + else { + here_op = 32 + 64; /* end of block */ + here_val = 0; + } + + /* replicate for those indices with low len bits equal to huff */ + incr = 1 << (len - drop); + fill = 1 << curr; + min = fill; /* save offset to next table */ + do { + fill -= incr; + table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; + } while (fill !== 0); + + /* backwards increment the len-bit code huff */ + incr = 1 << (len - 1); + while (huff & incr) { + incr >>= 1; + } + if (incr !== 0) { + huff &= incr - 1; + huff += incr; + } else { + huff = 0; + } + + /* go to next symbol, update count, len */ + sym++; + if (--count[len] === 0) { + if (len === max) { break; } + len = lens[lens_index + work[sym]]; + } + + /* create new sub-table if needed */ + if (len > root && (huff & mask) !== low) { + /* if first time, transition to sub-tables */ + if (drop === 0) { + drop = root; + } + + /* increment past last table */ + next += min; /* here min is 1 << curr */ + + /* determine length of next table */ + curr = len - drop; + left = 1 << curr; + while (curr + drop < max) { + left -= count[curr + drop]; + if (left <= 0) { break; } + curr++; + left <<= 1; + } + + /* check for enough space */ + used += 1 << curr; + if ((type === LENS && used > ENOUGH_LENS) || + (type === DISTS && used > ENOUGH_DISTS)) { + return 1; + } + + /* point entry in root table to sub-table */ + low = huff & mask; + /*table.op[low] = curr; + table.bits[low] = root; + table.val[low] = next - opts.table_index;*/ + table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; + } + } + + /* fill in remaining table entry if code is incomplete (guaranteed to have + at most one remaining entry, since if the code is incomplete, the + maximum code length that was allowed to get this far is one bit) */ + if (huff !== 0) { + //table.op[next + huff] = 64; /* invalid code marker */ + //table.bits[next + huff] = len - drop; + //table.val[next + huff] = 0; + table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; + } + + /* set return parameters */ + //opts.table_index += used; + opts.bits = root; + return 0; +}; + + +module.exports = inflate_table; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/messages.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/messages.js new file mode 100644 index 0000000..426daec --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/messages.js @@ -0,0 +1,32 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +module.exports = { + 2: 'need dictionary', /* Z_NEED_DICT 2 */ + 1: 'stream end', /* Z_STREAM_END 1 */ + 0: '', /* Z_OK 0 */ + '-1': 'file error', /* Z_ERRNO (-1) */ + '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ + '-3': 'data error', /* Z_DATA_ERROR (-3) */ + '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ + '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ + '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ +}; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/trees.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/trees.js new file mode 100644 index 0000000..300f1d8 --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/trees.js @@ -0,0 +1,1179 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +/* eslint-disable space-unary-ops */ + +/* Public constants ==========================================================*/ +/* ===========================================================================*/ + + +//const Z_FILTERED = 1; +//const Z_HUFFMAN_ONLY = 2; +//const Z_RLE = 3; +const Z_FIXED = 4; +//const Z_DEFAULT_STRATEGY = 0; + +/* Possible values of the data_type field (though see inflate()) */ +const Z_BINARY = 0; +const Z_TEXT = 1; +//const Z_ASCII = 1; // = Z_TEXT +const Z_UNKNOWN = 2; + +/*============================================================================*/ + + +function zero(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } } + +// From zutil.h + +const STORED_BLOCK = 0; +const STATIC_TREES = 1; +const DYN_TREES = 2; +/* The three kinds of block type */ + +const MIN_MATCH = 3; +const MAX_MATCH = 258; +/* The minimum and maximum match lengths */ + +// From deflate.h +/* =========================================================================== + * Internal compression state. + */ + +const LENGTH_CODES = 29; +/* number of length codes, not counting the special END_BLOCK code */ + +const LITERALS = 256; +/* number of literal bytes 0..255 */ + +const L_CODES = LITERALS + 1 + LENGTH_CODES; +/* number of Literal or Length codes, including the END_BLOCK code */ + +const D_CODES = 30; +/* number of distance codes */ + +const BL_CODES = 19; +/* number of codes used to transfer the bit lengths */ + +const HEAP_SIZE = 2 * L_CODES + 1; +/* maximum heap size */ + +const MAX_BITS = 15; +/* All codes must not exceed MAX_BITS bits */ + +const Buf_size = 16; +/* size of bit buffer in bi_buf */ + + +/* =========================================================================== + * Constants + */ + +const MAX_BL_BITS = 7; +/* Bit length codes must not exceed MAX_BL_BITS bits */ + +const END_BLOCK = 256; +/* end of block literal code */ + +const REP_3_6 = 16; +/* repeat previous bit length 3-6 times (2 bits of repeat count) */ + +const REPZ_3_10 = 17; +/* repeat a zero length 3-10 times (3 bits of repeat count) */ + +const REPZ_11_138 = 18; +/* repeat a zero length 11-138 times (7 bits of repeat count) */ + +/* eslint-disable comma-spacing,array-bracket-spacing */ +const extra_lbits = /* extra bits for each length code */ + new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]); + +const extra_dbits = /* extra bits for each distance code */ + new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]); + +const extra_blbits = /* extra bits for each bit length code */ + new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]); + +const bl_order = + new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]); +/* eslint-enable comma-spacing,array-bracket-spacing */ + +/* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + +/* =========================================================================== + * Local data. These are initialized only once. + */ + +// We pre-fill arrays with 0 to avoid uninitialized gaps + +const DIST_CODE_LEN = 512; /* see definition of array dist_code below */ + +// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 +const static_ltree = new Array((L_CODES + 2) * 2); +zero(static_ltree); +/* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + +const static_dtree = new Array(D_CODES * 2); +zero(static_dtree); +/* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + +const _dist_code = new Array(DIST_CODE_LEN); +zero(_dist_code); +/* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + +const _length_code = new Array(MAX_MATCH - MIN_MATCH + 1); +zero(_length_code); +/* length code for each normalized match length (0 == MIN_MATCH) */ + +const base_length = new Array(LENGTH_CODES); +zero(base_length); +/* First normalized length for each code (0 = MIN_MATCH) */ + +const base_dist = new Array(D_CODES); +zero(base_dist); +/* First normalized distance for each code (0 = distance of 1) */ + + +function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { + + this.static_tree = static_tree; /* static tree or NULL */ + this.extra_bits = extra_bits; /* extra bits for each code or NULL */ + this.extra_base = extra_base; /* base index for extra_bits */ + this.elems = elems; /* max number of elements in the tree */ + this.max_length = max_length; /* max bit length for the codes */ + + // show if `static_tree` has data or dummy - needed for monomorphic objects + this.has_stree = static_tree && static_tree.length; +} + + +let static_l_desc; +let static_d_desc; +let static_bl_desc; + + +function TreeDesc(dyn_tree, stat_desc) { + this.dyn_tree = dyn_tree; /* the dynamic tree */ + this.max_code = 0; /* largest code with non zero frequency */ + this.stat_desc = stat_desc; /* the corresponding static tree */ +} + + + +const d_code = (dist) => { + + return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; +}; + + +/* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ +const put_short = (s, w) => { +// put_byte(s, (uch)((w) & 0xff)); +// put_byte(s, (uch)((ush)(w) >> 8)); + s.pending_buf[s.pending++] = (w) & 0xff; + s.pending_buf[s.pending++] = (w >>> 8) & 0xff; +}; + + +/* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ +const send_bits = (s, value, length) => { + + if (s.bi_valid > (Buf_size - length)) { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + put_short(s, s.bi_buf); + s.bi_buf = value >> (Buf_size - s.bi_valid); + s.bi_valid += length - Buf_size; + } else { + s.bi_buf |= (value << s.bi_valid) & 0xffff; + s.bi_valid += length; + } +}; + + +const send_code = (s, c, tree) => { + + send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); +}; + + +/* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ +const bi_reverse = (code, len) => { + + let res = 0; + do { + res |= code & 1; + code >>>= 1; + res <<= 1; + } while (--len > 0); + return res >>> 1; +}; + + +/* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ +const bi_flush = (s) => { + + if (s.bi_valid === 16) { + put_short(s, s.bi_buf); + s.bi_buf = 0; + s.bi_valid = 0; + + } else if (s.bi_valid >= 8) { + s.pending_buf[s.pending++] = s.bi_buf & 0xff; + s.bi_buf >>= 8; + s.bi_valid -= 8; + } +}; + + +/* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ +const gen_bitlen = (s, desc) => { +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const max_code = desc.max_code; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const extra = desc.stat_desc.extra_bits; + const base = desc.stat_desc.extra_base; + const max_length = desc.stat_desc.max_length; + let h; /* heap index */ + let n, m; /* iterate over the tree elements */ + let bits; /* bit length */ + let xbits; /* extra bits */ + let f; /* frequency */ + let overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS; bits++) { + s.bl_count[bits] = 0; + } + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ + + for (h = s.heap_max + 1; h < HEAP_SIZE; h++) { + n = s.heap[h]; + bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; + if (bits > max_length) { + bits = max_length; + overflow++; + } + tree[n * 2 + 1]/*.Len*/ = bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) { continue; } /* not a leaf node */ + + s.bl_count[bits]++; + xbits = 0; + if (n >= base) { + xbits = extra[n - base]; + } + f = tree[n * 2]/*.Freq*/; + s.opt_len += f * (bits + xbits); + if (has_stree) { + s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); + } + } + if (overflow === 0) { return; } + + // Tracev((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length - 1; + while (s.bl_count[bits] === 0) { bits--; } + s.bl_count[bits]--; /* move one leaf down the tree */ + s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ + s.bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits !== 0; bits--) { + n = s.bl_count[bits]; + while (n !== 0) { + m = s.heap[--h]; + if (m > max_code) { continue; } + if (tree[m * 2 + 1]/*.Len*/ !== bits) { + // Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; + tree[m * 2 + 1]/*.Len*/ = bits; + } + n--; + } + } +}; + + +/* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ +const gen_codes = (tree, max_code, bl_count) => { +// ct_data *tree; /* the tree to decorate */ +// int max_code; /* largest code with non zero frequency */ +// ushf *bl_count; /* number of codes at each bit length */ + + const next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */ + let code = 0; /* running code value */ + let bits; /* bit index */ + let n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS; bits++) { + code = (code + bl_count[bits - 1]) << 1; + next_code[bits] = code; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + //Assert (code + bl_count[MAX_BITS]-1 == (1< { + + let n; /* iterates over tree elements */ + let bits; /* bit counter */ + let length; /* length value */ + let code; /* code value */ + let dist; /* distance index */ + const bl_count = new Array(MAX_BITS + 1); + /* number of codes at each bit length for an optimal tree */ + + // do check in _tr_init() + //if (static_init_done) return; + + /* For some embedded targets, global variables are not initialized: */ +/*#ifdef NO_INIT_GLOBAL_POINTERS + static_l_desc.static_tree = static_ltree; + static_l_desc.extra_bits = extra_lbits; + static_d_desc.static_tree = static_dtree; + static_d_desc.extra_bits = extra_dbits; + static_bl_desc.extra_bits = extra_blbits; +#endif*/ + + /* Initialize the mapping length (0..255) -> length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES - 1; code++) { + base_length[code] = length; + for (n = 0; n < (1 << extra_lbits[code]); n++) { + _length_code[length++] = code; + } + } + //Assert (length == 256, "tr_static_init: length != 256"); + /* Note that the length 255 (match length 258) can be represented + * in two different ways: code 284 + 5 bits or code 285, so we + * overwrite length_code[255] to use the best encoding: + */ + _length_code[length - 1] = code; + + /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ + dist = 0; + for (code = 0; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1 << extra_dbits[code]); n++) { + _dist_code[dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: dist != 256"); + dist >>= 7; /* from now on, all distances are divided by 128 */ + for (; code < D_CODES; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { + _dist_code[256 + dist++] = code; + } + } + //Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS; bits++) { + bl_count[bits] = 0; + } + + n = 0; + while (n <= 143) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + while (n <= 255) { + static_ltree[n * 2 + 1]/*.Len*/ = 9; + n++; + bl_count[9]++; + } + while (n <= 279) { + static_ltree[n * 2 + 1]/*.Len*/ = 7; + n++; + bl_count[7]++; + } + while (n <= 287) { + static_ltree[n * 2 + 1]/*.Len*/ = 8; + n++; + bl_count[8]++; + } + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes(static_ltree, L_CODES + 1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES; n++) { + static_dtree[n * 2 + 1]/*.Len*/ = 5; + static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); + } + + // Now data ready and we can init static trees + static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS); + static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS); + static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS); + + //static_init_done = true; +}; + + +/* =========================================================================== + * Initialize a new block. + */ +const init_block = (s) => { + + let n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } + for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } + + s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; + s.opt_len = s.static_len = 0; + s.sym_next = s.matches = 0; +}; + + +/* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ +const bi_windup = (s) => +{ + if (s.bi_valid > 8) { + put_short(s, s.bi_buf); + } else if (s.bi_valid > 0) { + //put_byte(s, (Byte)s->bi_buf); + s.pending_buf[s.pending++] = s.bi_buf; + } + s.bi_buf = 0; + s.bi_valid = 0; +}; + +/* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ +const smaller = (tree, n, m, depth) => { + + const _n2 = n * 2; + const _m2 = m * 2; + return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || + (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); +}; + +/* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ +const pqdownheap = (s, tree, k) => { +// deflate_state *s; +// ct_data *tree; /* the tree to restore */ +// int k; /* node to move down */ + + const v = s.heap[k]; + let j = k << 1; /* left son of k */ + while (j <= s.heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s.heap_len && + smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s.heap[j], s.depth)) { break; } + + /* Exchange v with the smallest son */ + s.heap[k] = s.heap[j]; + k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s.heap[k] = v; +}; + + +// inlined manually +// const SMALLEST = 1; + +/* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ +const compress_block = (s, ltree, dtree) => { +// deflate_state *s; +// const ct_data *ltree; /* literal tree */ +// const ct_data *dtree; /* distance tree */ + + let dist; /* distance of matched string */ + let lc; /* match length or unmatched char (if dist == 0) */ + let sx = 0; /* running index in sym_buf */ + let code; /* the code to send */ + let extra; /* number of extra bits to send */ + + if (s.sym_next !== 0) { + do { + dist = s.pending_buf[s.sym_buf + sx++] & 0xff; + dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8; + lc = s.pending_buf[s.sym_buf + sx++]; + if (dist === 0) { + send_code(s, lc, ltree); /* send a literal byte */ + //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code + LITERALS + 1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra !== 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + //Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra !== 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and sym_buf is ok: */ + //Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow"); + + } while (sx < s.sym_next); + } + + send_code(s, END_BLOCK, ltree); +}; + + +/* =========================================================================== + * Construct one Huffman tree and assigns the code bit strings and lengths. + * Update the total bit length for the current block. + * IN assertion: the field freq is set for all tree elements. + * OUT assertions: the fields len and code are set to the optimal bit length + * and corresponding code. The length opt_len is updated; static_len is + * also updated if stree is not null. The field max_code is set. + */ +const build_tree = (s, desc) => { +// deflate_state *s; +// tree_desc *desc; /* the tree descriptor */ + + const tree = desc.dyn_tree; + const stree = desc.stat_desc.static_tree; + const has_stree = desc.stat_desc.has_stree; + const elems = desc.stat_desc.elems; + let n, m; /* iterate over heap elements */ + let max_code = -1; /* largest code with non zero frequency */ + let node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s.heap_len = 0; + s.heap_max = HEAP_SIZE; + + for (n = 0; n < elems; n++) { + if (tree[n * 2]/*.Freq*/ !== 0) { + s.heap[++s.heap_len] = max_code = n; + s.depth[n] = 0; + + } else { + tree[n * 2 + 1]/*.Len*/ = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s.heap_len < 2) { + node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); + tree[node * 2]/*.Freq*/ = 1; + s.depth[node] = 0; + s.opt_len--; + + if (has_stree) { + s.static_len -= stree[node * 2 + 1]/*.Len*/; + } + /* node is 0 or 1 so it does not have extra bits */ + } + desc.max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + //pqremove(s, tree, n); /* n = node of least frequency */ + /*** pqremove ***/ + n = s.heap[1/*SMALLEST*/]; + s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; + pqdownheap(s, tree, 1/*SMALLEST*/); + /***/ + + m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ + + s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ + s.heap[--s.heap_max] = m; + + /* Create a new node father of n and m */ + tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; + s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; + tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; + + /* and insert the new node in the heap */ + s.heap[1/*SMALLEST*/] = node++; + pqdownheap(s, tree, 1/*SMALLEST*/); + + } while (s.heap_len >= 2); + + s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes(tree, max_code, s.bl_count); +}; + + +/* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ +const scan_tree = (s, tree, max_code) => { +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + s.bl_tree[curlen * 2]/*.Freq*/ += count; + + } else if (curlen !== 0) { + + if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } + s.bl_tree[REP_3_6 * 2]/*.Freq*/++; + + } else if (count <= 10) { + s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; + + } else { + s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; + } + + count = 0; + prevlen = curlen; + + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +}; + + +/* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ +const send_tree = (s, tree, max_code) => { +// deflate_state *s; +// ct_data *tree; /* the tree to be scanned */ +// int max_code; /* and its largest code of non zero frequency */ + + let n; /* iterates over all tree elements */ + let prevlen = -1; /* last emitted length */ + let curlen; /* length of current code */ + + let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ + + let count = 0; /* repeat count of the current code */ + let max_count = 7; /* max repeat count */ + let min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen === 0) { + max_count = 138; + min_count = 3; + } + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; + nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; + + if (++count < max_count && curlen === nextlen) { + continue; + + } else if (count < min_count) { + do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); + + } else if (curlen !== 0) { + if (curlen !== prevlen) { + send_code(s, curlen, s.bl_tree); + count--; + } + //Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s.bl_tree); + send_bits(s, count - 3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s.bl_tree); + send_bits(s, count - 3, 3); + + } else { + send_code(s, REPZ_11_138, s.bl_tree); + send_bits(s, count - 11, 7); + } + + count = 0; + prevlen = curlen; + if (nextlen === 0) { + max_count = 138; + min_count = 3; + + } else if (curlen === nextlen) { + max_count = 6; + min_count = 3; + + } else { + max_count = 7; + min_count = 4; + } + } +}; + + +/* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ +const build_bl_tree = (s) => { + + let max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, s.dyn_ltree, s.l_desc.max_code); + scan_tree(s, s.dyn_dtree, s.d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, s.bl_desc); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) { + if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { + break; + } + } + /* Update opt_len to include the bit length tree and counts */ + s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; + //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + // s->opt_len, s->static_len)); + + return max_blindex; +}; + + +/* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ +const send_all_trees = (s, lcodes, dcodes, blcodes) => { +// deflate_state *s; +// int lcodes, dcodes, blcodes; /* number of codes for each tree */ + + let rank; /* index in bl_order */ + + //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + // "too many codes"); + //Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes - 1, 5); + send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); + } + //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ + //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ + //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); +}; + + +/* =========================================================================== + * Check if the data type is TEXT or BINARY, using the following algorithm: + * - TEXT if the two conditions below are satisfied: + * a) There are no non-portable control characters belonging to the + * "block list" (0..6, 14..25, 28..31). + * b) There is at least one printable character belonging to the + * "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). + * - BINARY otherwise. + * - The following partially-portable control characters form a + * "gray list" that is ignored in this detection algorithm: + * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). + * IN assertion: the fields Freq of dyn_ltree are set. + */ +const detect_data_type = (s) => { + /* block_mask is the bit mask of block-listed bytes + * set bits 0..6, 14..25, and 28..31 + * 0xf3ffc07f = binary 11110011111111111100000001111111 + */ + let block_mask = 0xf3ffc07f; + let n; + + /* Check for non-textual ("block-listed") bytes. */ + for (n = 0; n <= 31; n++, block_mask >>>= 1) { + if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { + return Z_BINARY; + } + } + + /* Check for textual ("allow-listed") bytes. */ + if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || + s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + for (n = 32; n < LITERALS; n++) { + if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { + return Z_TEXT; + } + } + + /* There are no "block-listed" or "allow-listed" bytes: + * this stream either is empty or has tolerated ("gray-listed") bytes only. + */ + return Z_BINARY; +}; + + +let static_init_done = false; + +/* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ +const _tr_init = (s) => +{ + + if (!static_init_done) { + tr_static_init(); + static_init_done = true; + } + + s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); + s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); + s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); + + s.bi_buf = 0; + s.bi_valid = 0; + + /* Initialize the first block of the first file: */ + init_block(s); +}; + + +/* =========================================================================== + * Send a stored block + */ +const _tr_stored_block = (s, buf, stored_len, last) => { +//DeflateState *s; +//charf *buf; /* input block */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ + + send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ + bi_windup(s); /* align on byte boundary */ + put_short(s, stored_len); + put_short(s, ~stored_len); + if (stored_len) { + s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending); + } + s.pending += stored_len; +}; + + +/* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + */ +const _tr_align = (s) => { + send_bits(s, STATIC_TREES << 1, 3); + send_code(s, END_BLOCK, static_ltree); + bi_flush(s); +}; + + +/* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and write out the encoded block. + */ +const _tr_flush_block = (s, buf, stored_len, last) => { +//DeflateState *s; +//charf *buf; /* input block, or NULL if too old */ +//ulg stored_len; /* length of input block */ +//int last; /* one if this is the last block for a file */ + + let opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + let max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s.level > 0) { + + /* Check if the file is binary or text */ + if (s.strm.data_type === Z_UNKNOWN) { + s.strm.data_type = detect_data_type(s); + } + + /* Construct the literal and distance trees */ + build_tree(s, s.l_desc); + // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + + build_tree(s, s.d_desc); + // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + // s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute the block lengths in bytes. */ + opt_lenb = (s.opt_len + 3 + 7) >>> 3; + static_lenb = (s.static_len + 3 + 7) >>> 3; + + // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + // s->sym_next / 3)); + + if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } + + } else { + // Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + + if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { + /* 4: two words for the lengths */ + + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block(s, buf, stored_len, last); + + } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) { + + send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); + compress_block(s, static_ltree, static_dtree); + + } else { + send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); + send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); + compress_block(s, s.dyn_ltree, s.dyn_dtree); + } + // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (last) { + bi_windup(s); + } + // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + // s->compressed_len-7*last)); +}; + +/* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ +const _tr_tally = (s, dist, lc) => { +// deflate_state *s; +// unsigned dist; /* distance of matched string */ +// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ + + s.pending_buf[s.sym_buf + s.sym_next++] = dist; + s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8; + s.pending_buf[s.sym_buf + s.sym_next++] = lc; + if (dist === 0) { + /* lc is the unmatched char */ + s.dyn_ltree[lc * 2]/*.Freq*/++; + } else { + s.matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + //Assert((ush)dist < (ush)MAX_DIST(s) && + // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++; + s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; + } + + return (s.sym_next === s.sym_end); +}; + +module.exports._tr_init = _tr_init; +module.exports._tr_stored_block = _tr_stored_block; +module.exports._tr_flush_block = _tr_flush_block; +module.exports._tr_tally = _tr_tally; +module.exports._tr_align = _tr_align; diff --git a/测试流式传输uniapp/node_modules/pako/lib/zlib/zstream.js b/测试流式传输uniapp/node_modules/pako/lib/zlib/zstream.js new file mode 100644 index 0000000..122acfe --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/lib/zlib/zstream.js @@ -0,0 +1,47 @@ +'use strict'; + +// (C) 1995-2013 Jean-loup Gailly and Mark Adler +// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin +// +// This software is provided 'as-is', without any express or implied +// warranty. In no event will the authors be held liable for any damages +// arising from the use of this software. +// +// Permission is granted to anyone to use this software for any purpose, +// including commercial applications, and to alter it and redistribute it +// freely, subject to the following restrictions: +// +// 1. The origin of this software must not be misrepresented; you must not +// claim that you wrote the original software. If you use this software +// in a product, an acknowledgment in the product documentation would be +// appreciated but is not required. +// 2. Altered source versions must be plainly marked as such, and must not be +// misrepresented as being the original software. +// 3. This notice may not be removed or altered from any source distribution. + +function ZStream() { + /* next input byte */ + this.input = null; // JS specific, because we have no pointers + this.next_in = 0; + /* number of bytes available at input */ + this.avail_in = 0; + /* total number of input bytes read so far */ + this.total_in = 0; + /* next output byte should be put there */ + this.output = null; // JS specific, because we have no pointers + this.next_out = 0; + /* remaining free space at output */ + this.avail_out = 0; + /* total number of bytes output so far */ + this.total_out = 0; + /* last error message, NULL if no error */ + this.msg = ''/*Z_NULL*/; + /* not visible by applications */ + this.state = null; + /* best guess about the data type: binary or text */ + this.data_type = 2/*Z_UNKNOWN*/; + /* adler32 value of the uncompressed data */ + this.adler = 0; +} + +module.exports = ZStream; diff --git a/测试流式传输uniapp/node_modules/pako/package.json b/测试流式传输uniapp/node_modules/pako/package.json new file mode 100644 index 0000000..f23b8ef --- /dev/null +++ b/测试流式传输uniapp/node_modules/pako/package.json @@ -0,0 +1,64 @@ +{ + "name": "pako", + "description": "zlib port to javascript - fast, modularized, with browser support", + "version": "2.1.0", + "keywords": [ + "zlib", + "deflate", + "inflate", + "gzip" + ], + "contributors": [ + "Andrei Tuputcyn (https://github.com/andr83)", + "Vitaly Puzrin (https://github.com/puzrin)", + "Friedel Ziegelmayer (https://github.com/dignifiedquire)", + "Kirill Efimov (https://github.com/Kirill89)", + "Jean-loup Gailly", + "Mark Adler" + ], + "files": [ + "index.js", + "dist/", + "lib/" + ], + "license": "(MIT AND Zlib)", + "repository": "nodeca/pako", + "module": "./dist/pako.esm.mjs", + "exports": { + ".": { + "import": "./dist/pako.esm.mjs", + "require": "./index.js" + }, + "./package.json": "./package.json", + "./dist/*": "./dist/*", + "./lib/*": "./lib/*", + "./lib/zlib/*": "./lib/zlib/*", + "./lib/utils/*": "./lib/utils/*" + }, + "scripts": { + "lint": "eslint .", + "test": "npm run lint && mocha", + "coverage": "npm run lint && nyc mocha && nyc report --reporter html", + "build": "rollup -c", + "build_fixtures": "node support/build_fixtures.js", + "doc": "node support/build_doc.js", + "gh-doc": "npm run doc && gh-pages -d doc -f", + "prepublishOnly": "npm run gh-doc" + }, + "devDependencies": { + "@babel/preset-env": "^7.12.1", + "@rollup/plugin-babel": "^5.2.1", + "@rollup/plugin-commonjs": "^16.0.0", + "@rollup/plugin-node-resolve": "^10.0.0", + "eslint": "^7.13.0", + "gh-pages": "^3.1.0", + "mocha": "^8.2.1", + "multiparty": "^4.1.3", + "ndoc": "^6.0.0", + "nyc": "^15.1.0", + "rollup": "^2.33.1", + "rollup-plugin-terser": "^7.0.2", + "shelljs": "^0.8.4" + }, + "dependencies": {} +} diff --git a/测试流式传输uniapp/package-lock.json b/测试流式传输uniapp/package-lock.json new file mode 100644 index 0000000..0c1203b --- /dev/null +++ b/测试流式传输uniapp/package-lock.json @@ -0,0 +1,28 @@ +{ + "name": "测试流式传输uniapp", + "lockfileVersion": 3, + "requires": true, + "packages": { + "": { + "dependencies": { + "pako": "^2.1.0" + }, + "devDependencies": { + "@types/pako": "^2.0.4" + } + }, + "node_modules/@types/pako": { + "version": "2.0.4", + "resolved": "https://registry.npmmirror.com/@types/pako/-/pako-2.0.4.tgz", + "integrity": "sha512-VWDCbrLeVXJM9fihYodcLiIv0ku+AlOa/TQ1SvYOaBuyrSKgEcro95LJyIsJ4vSo6BXIxOKxiJAat04CmST9Fw==", + "dev": true, + "license": "MIT" + }, + "node_modules/pako": { + "version": "2.1.0", + "resolved": "https://registry.npmmirror.com/pako/-/pako-2.1.0.tgz", + "integrity": "sha512-w+eufiZ1WuJYgPXbV/PO3NCMEc3xqylkKHzp8bxp1uW4qaSNQUkwmLLEc3kKsfz8lpV1F8Ht3U1Cm+9Srog2ug==", + "license": "(MIT AND Zlib)" + } + } +} diff --git a/测试流式传输uniapp/package.json b/测试流式传输uniapp/package.json new file mode 100644 index 0000000..1f21d70 --- /dev/null +++ b/测试流式传输uniapp/package.json @@ -0,0 +1,8 @@ +{ + "dependencies": { + "pako": "^2.1.0" + }, + "devDependencies": { + "@types/pako": "^2.0.4" + } +} diff --git a/测试流式传输uniapp/pages/index/ProtocolCodec.ts b/测试流式传输uniapp/pages/index/ProtocolCodec.ts new file mode 100644 index 0000000..b9e4f2b --- /dev/null +++ b/测试流式传输uniapp/pages/index/ProtocolCodec.ts @@ -0,0 +1,338 @@ +// 导入 GZIP 处理库（浏览器/Node.js 通用，需提前安装：npm install pako @types/pako） +// import * as pako from "pako"; + +/** + * 协议常量类：存储协议核心配置（不可修改，确保前后端一致） + */ +export class ProtocolConst { + /** 协议版本：v1（4位，对应字节3~4的低4位，剩余位保留用于后续升级） */ + static readonly PROTOCOL_VERSION = 0b0001; + + /** 头部固定长度：8字节（字节1~8，结构严格定义，不可修改） */ + static readonly HEADER_SIZE = 8; + + /** 最大包体大小：10MB（防止内存溢出，与 Python 端 MAX_BODY_SIZE 一致） */ + static readonly MAX_BODY_SIZE = 1024 * 1024 * 10; + + /** 字符串编码格式：UTF-8（统一前后端字符串编解码，避免乱码） */ + static readonly STRING_ENCODING = "utf-8" as const; // as const 固定字符串类型，避免类型拓宽 +} + +/** + * 消息类型枚举（4位，存储在字节1高4位） + * 与 Python 端 MessageType 枚举值完全对齐，支持16种类型（当前用5种，剩余预留扩展） + */ +export enum MessageType { + PING = 0b0000, // 心跳消息（用于检测连接存活） + AUDIO_DATA = 0b0001, // 纯音频数据（PCM 二进制流，对应 RAW 序列化） + TEXT_MESSAGE = 0b0010, // 纯文本消息（对应 STRING 序列化，无 JSON 包装） + AUDIO_TEXT_MIX = 0b0011, // 音频+文本混合数据（复杂结构，对应 JSON 序列化） + CONTROL_CMD = 0b0100, // 控制指令（暂停/继续/停止等，对应 JSON 序列化） +} + +/** + * 序列化方式枚举（4位，存储在字节2高4位） + * 按数据类型选择最优序列化方式，减少开销 + */ +export enum SerializationType { + RAW = 0b0000, // 原始二进制（无需编解码，直接透传，适合音频等二进制数据） + JSON = 0b0001, // JSON 格式（适合字典、列表等复杂结构，如控制指令、混合数据） + STRING = 0b0010, // 直接字符串（UTF-8 编码，无 JSON 包装，适合纯文本消息） +} + +/** + * 压缩方式枚举（4位，存储在字节2低4位） + * 按需选择压缩策略，平衡性能和传输体积 + */ +export enum CompressionType { + NONE = 0b0000, // 无压缩（小数据包如控制指令、短文本，避免压缩开销） + GZIP = 0b0001, // GZIP 压缩（大数据包如长文本、混合数据，减少网络传输量） +} + +/** + * 控制指令枚举（配合 MessageType.CONTROL_CMD 使用） + * 定义业务层面的控制指令，与 Python 端控制指令值一致 + */ +export enum ControlCommand { + HEARTBEAT = 0b0001, // 心跳响应（回复 PING 消息） + PAUSE = 0b0010, // 暂停指令（如暂停音频播放） + RESUME = 0b0011, // 继续指令（如恢复音频播放） + STOP = 0b0100, // 停止指令（如停止音频传输） +} + +/** + * 解包返回结果接口（强类型约束，明确返回数据结构） + * 让 IDE 提供自动提示，避免类型错误 + */ +export interface UnpackedResult { + msgType: MessageType; // 消息类型（枚举值，便于逻辑判断） + msgTypeName: keyof typeof MessageType; // 消息类型名称（字符串，如 "TEXT_MESSAGE"，便于日志打印） + serialization: SerializationType; // 序列化方式（枚举值） + serializationName: keyof typeof SerializationType; // 序列化方式名称（字符串） + compression: CompressionType; // 压缩方式（枚举值） + compressionName: keyof typeof CompressionType; // 压缩方式名称（字符串） + body: Uint8Array | string | object | unknown[]; // 解包后的原始包体（根据序列化方式动态变化） +} + +/** + * 打包入参类型别名（简化方法入参类型定义，提高可读性） + */ +// 包体支持的类型：二进制、字符串、对象、数组 +type PackBody = Uint8Array | string | object | unknown[]; +// 序列化方式可选值：枚举值、null、undefined（null/undefined 时自动推导） +type OptionalSerialization = SerializationType | null | undefined; + +/** + * 协议编解码工具类（静态类，无需实例化，提供 pack/unpack 静态方法） + * 核心功能：将业务数据打包为符合协议的二进制包，或解析二进制包为业务数据 + * 特点：与 Python/JS 端完全兼容，性能高效，类型安全 + */ +export class ProtocolCodec { + /** + * 打包协议包：将业务数据按协议格式封装为二进制包 + * @param msgType 消息类型（必须指定，枚举值） + * @param body 业务数据（根据消息类型对应不同类型，如字符串、对象、Uint8Array） + * @param serialization 序列化方式（可选，默认自动推导：纯文本→STRING，音频→RAW，复杂结构→JSON） + * @param compression 压缩方式（可选，默认无压缩） + * @returns 完整协议包（Uint8Array 类型，便于网络传输） + * @throws 类型错误、不支持的枚举值、包体过大等异常 + */ + static pack( + msgType: MessageType, + body: PackBody, + serialization: OptionalSerialization = null, + compression: CompressionType = CompressionType.NONE + ): Uint8Array { + // 1. 自动推导序列化方式（减少调用方心智负担，按消息类型默认最优解） + if (serialization === null || serialization === undefined) { + if (msgType === MessageType.AUDIO_DATA) { + // 音频数据→RAW 序列化（无需编解码，性能最优） + serialization = SerializationType.RAW; + } else if (msgType === MessageType.TEXT_MESSAGE) { + // 纯文本消息→STRING 序列化（直接 UTF-8 编码，无冗余） + serialization = SerializationType.STRING; + } else if (msgType === MessageType.CONTROL_CMD || msgType === MessageType.AUDIO_TEXT_MIX) { + // 控制指令/混合数据→JSON 序列化（支持复杂结构） + serialization = SerializationType.JSON; + } else { + // 非法消息类型：抛出异常，提前阻断错误 + throw new Error(`不支持的消息类型：${MessageType[msgType]}（值：${msgType}）`); + } + } + + // 2. 序列化包体：将业务数据转为二进制（按序列化方式处理） + let serializedBody: Uint8Array; // 序列化后的二进制数据 + const textEncoder = new TextEncoder(ProtocolConst.STRING_ENCODING); // UTF-8 编码器 + + switch (serialization) { + case SerializationType.RAW: + // RAW 序列化：必须传入 Uint8Array（二进制数据直接透传） + if (!(body instanceof Uint8Array)) { + throw new TypeError(`RAW 序列化要求 body 必须是 Uint8Array 类型，当前传入：${typeof body}`); + } + serializedBody = body; + break; + + case SerializationType.STRING: + // STRING 序列化：必须传入字符串，直接 UTF-8 编码（无 JSON 包装） + if (typeof body !== "string") { + throw new TypeError(`STRING 序列化要求 body 必须是 string 类型，当前传入：${typeof body}`); + } + serializedBody = textEncoder.encode(body); + break; + + case SerializationType.JSON: + // JSON 序列化：支持字符串、对象、数组，转为 JSON 字符串后 UTF-8 编码 + if (typeof body === "string") { + // 已为字符串，直接编码 + serializedBody = textEncoder.encode(body); + } else if (typeof body === "object" && body !== null) { + // 对象/数组→JSON 字符串→编码（用 JSON.stringify 序列化） + const jsonStr = JSON.stringify(body); + serializedBody = textEncoder.encode(jsonStr); + } else { + throw new TypeError(`JSON 序列化要求 body 必须是 string/object/array 类型，当前传入：${typeof body}`); + } + break; + + default: + // 非法序列化方式：抛出异常 + throw new Error(`不支持的序列化方式：${SerializationType[serialization]}（值：${serialization}）`); + } + + // 3. 压缩包体：按指定压缩方式处理（GZIP 或无压缩） + let compressedBody: Uint8Array; // 压缩后的二进制数据 + if (compression === CompressionType.NONE) { + // 无压缩：直接透传序列化后的二进制数据 + compressedBody = serializedBody; + } else { + // 非法压缩方式：抛出异常 + throw new Error(`不支持的压缩方式：${CompressionType[compression]}（值：${compression}）`); + } + + // 4. 校验包体大小：防止超过最大限制（避免内存溢出） + const bodyLen = compressedBody.length; // 压缩后的包体长度 + if (bodyLen > ProtocolConst.MAX_BODY_SIZE) { + throw new Error( + `包体过大（${bodyLen}字节），最大支持${ProtocolConst.MAX_BODY_SIZE}字节（10MB）` + ); + } + + // 5. 构造头部：8字节固定结构（严格按协议定义，大端序，与 Python 端一致） + const header = new Uint8Array(ProtocolConst.HEADER_SIZE); // 头部缓冲区（8字节） + + // 字节1：消息类型(4位) + 保留位(4位) + // 消息类型左移4位（占高4位），保留位填0（后续扩展用） + header[0] = (msgType << 4) | 0x00; + + // 字节2：序列化方式(4位) + 压缩方式(4位) + // 序列化方式左移4位（占高4位），压缩方式占低4位（&0x0F 确保仅4位） + header[1] = (serialization << 4) | (compression & 0x0F); + + // 字节3~4：协议版本（16位大端序） + // 大端序：高位字节在前，低位字节在后（网络传输标准字节序） + header[2] = (ProtocolConst.PROTOCOL_VERSION >> 8) & 0xFF; // 版本高8位（当前版本为1，高8位为0） + header[3] = ProtocolConst.PROTOCOL_VERSION & 0xFF; // 版本低8位（当前版本为1） + + // 字节5~8：包体长度（32位大端序） + // 32位整数：最高位字节（第5字节）→ 最低位字节（第8字节） + header[4] = (bodyLen >> 24) & 0xFF; // 包体长度第24~31位 + header[5] = (bodyLen >> 16) & 0xFF; // 包体长度第16~23位 + header[6] = (bodyLen >> 8) & 0xFF; // 包体长度第8~15位 + header[7] = bodyLen & 0xFF; // 包体长度第0~7位 + + // 6. 拼接头部和包体：生成完整协议包 + const totalLen = ProtocolConst.HEADER_SIZE + bodyLen; // 总长度 = 头部8字节 + 包体长度 + const packet = new Uint8Array(totalLen); // 完整包缓冲区 + + packet.set(header, 0); // 从索引0开始写入头部（占前8字节） + packet.set(compressedBody, ProtocolConst.HEADER_SIZE); // 从索引8开始写入包体 + + return packet; // 返回完整协议包（Uint8Array，网络传输高效） + } + + /** + * 解包协议包：将二进制协议包解析为业务数据 + * @param packet 完整协议包（网络接收的二进制数据，支持 Uint8Array 或 ArrayBuffer） + * @returns 结构化解包结果（UnpackedResult 接口，包含消息类型、包体等信息） + * @throws 包长度过短、版本不匹配、解压缩失败、反序列化失败等异常 + */ + static unpack(packet: Uint8Array | ArrayBuffer): UnpackedResult { + // 统一数据类型：将 ArrayBuffer 转为 Uint8Array（便于按字节操作） + const uint8Packet = packet instanceof ArrayBuffer + ? new Uint8Array(packet) + : packet; + + // 1. 校验包长度：至少包含8字节头部 + if (uint8Packet.length < ProtocolConst.HEADER_SIZE) { + throw new Error( + `包长度过短（${uint8Packet.length}字节），至少需要${ProtocolConst.HEADER_SIZE}字节头部` + ); + } + + // 2. 拆分头部和包体：前8字节为头部，剩余为包体 + const header = uint8Packet.subarray(0, ProtocolConst.HEADER_SIZE); // 头部（0~7索引） + const bodyBuffer = uint8Packet.subarray(ProtocolConst.HEADER_SIZE); // 包体（8索引开始） + + // 3. 解析头部字段（按协议结构逐字节解析，大端序） + // 字节1：消息类型(4位) + 保留位(4位) + const byte1 = header[0]; + const msgType = (byte1 >> 4) & 0x0F; // 右移4位取高4位（消息类型），&0x0F 确保仅4位 + // 校验消息类型合法性（防止非法包注入） + if (!Object.values(MessageType).includes(msgType as MessageType)) { + throw new Error(`非法消息类型：${msgType}（无对应枚举值）`); + } + + // 字节2：序列化方式(4位) + 压缩方式(4位) + const byte2 = header[1]; + const serialization = (byte2 >> 4) & 0x0F; // 右移4位取高4位（序列化方式） + const compression = byte2 & 0x0F; // 取低4位（压缩方式） + // 校验序列化方式合法性 + if (!Object.values(SerializationType).includes(serialization as SerializationType)) { + throw new Error(`非法序列化方式：${serialization}（无对应枚举值）`); + } + // 校验压缩方式合法性 + if (!Object.values(CompressionType).includes(compression as CompressionType)) { + throw new Error(`非法压缩方式：${compression}（无对应枚举值）`); + } + + // 字节3~4：协议版本（16位大端序） + const version = (header[2] << 8) | header[3]; // 大端序解析：高位字节<<8 + 低位字节 + // 校验版本兼容性（仅支持当前协议版本） + if (version !== ProtocolConst.PROTOCOL_VERSION) { + throw new Error( + `协议版本不匹配：收到v${version}，当前支持v${ProtocolConst.PROTOCOL_VERSION}` + ); + } + + // 字节5~8：包体长度（32位大端序） + const bodyLen = (header[4] << 24) | (header[5] << 16) | (header[6] << 8) | header[7]; + // 校验包体长度一致性（头部声明长度 vs 实际包体长度） + if (bodyBuffer.length !== bodyLen) { + throw new Error( + `包体长度不匹配：头部声明${bodyLen}字节，实际接收${bodyBuffer.length}字节（可能包丢失或非法包）` + ); + } + + // 4. 解压包体：按头部指定的压缩方式解压 + let decompressedBody: Uint8Array; // 解压后的二进制数据 + if (compression === CompressionType.NONE) { + // 无压缩：直接透传包体数据 + decompressedBody = bodyBuffer; + } else { + // 此处理论上不会触发（已提前校验压缩方式合法性） + throw new Error(`不支持的压缩方式：${CompressionType[compression]}（值：${compression}）`); + } + + // 5. 反序列化包体：将二进制数据转为业务数据（按序列化方式处理） + let body: UnpackedResult["body"]; // 反序列化后的原始业务数据 + const textDecoder = new TextDecoder(ProtocolConst.STRING_ENCODING); // UTF-8 解码器 + + switch (serialization) { + case SerializationType.RAW: + // RAW 反序列化：直接返回 Uint8Array（二进制数据，如音频 PCM） + body = decompressedBody; + break; + + case SerializationType.STRING: + // STRING 反序列化：UTF-8 解码为字符串（无 JSON 解析步骤） + try { + body = textDecoder.decode(decompressedBody); + } catch (e) { + throw new Error(`STRING 反序列化失败：${(e as Error).message}（UTF-8 解码错误，可能是非法字符串数据）`); + } + break; + + case SerializationType.JSON: + // JSON 反序列化：先 UTF-8 解码为字符串，再 JSON.parse 转为对象/数组 + try { + const jsonStr = textDecoder.decode(decompressedBody); // 二进制→JSON 字符串 + body = JSON.parse(jsonStr); // JSON 字符串→对象/数组 + } catch (e) { + if (e instanceof TypeError) { + throw new Error(`JSON 反序列化失败：${ProtocolConst.STRING_ENCODING} 解码错误（非法 UTF-8 数据）`); + } else if (e instanceof SyntaxError) { + throw new Error(`JSON 反序列化失败：格式错误（${(e as Error).message}），请检查 JSON 语法`); + } else { + throw new Error(`JSON 反序列化失败：${(e as Error).message}`); + } + } + break; + + default: + // 此处理论上不会触发（已提前校验序列化方式合法性） + throw new Error(`不支持的序列化方式：${SerializationType[serialization]}（值：${serialization}）`); + } + + // 6. 构造并返回解包结果（利用枚举反向映射获取名称，便于日志和展示） + return { + msgType: msgType as MessageType, // 消息类型枚举值 + msgTypeName: MessageType[msgType] as keyof typeof MessageType, // 消息类型名称（如 "TEXT_MESSAGE"） + serialization: serialization as SerializationType, // 序列化方式枚举值 + serializationName: SerializationType[serialization] as keyof typeof SerializationType, // 序列化方式名称 + compression: compression as CompressionType, // 压缩方式枚举值 + compressionName: CompressionType[compression] as keyof typeof CompressionType, // 压缩方式名称 + body: body, // 反序列化后的原始业务数据 + }; + } +} \ No newline at end of file diff --git a/测试流式传输uniapp/pages/index/index - 副本.vue b/测试流式传输uniapp/pages/index/index - 副本.vue new file mode 100644 index 0000000..da453ab --- /dev/null +++ b/测试流式传输uniapp/pages/index/index - 副本.vue @@ -0,0 +1,237 @@ + + + + + \ No newline at end of file diff --git a/测试流式传输uniapp/pages/index/index.vue b/测试流式传输uniapp/pages/index/index.vue index 7dee640..b7e6976 100644 --- a/测试流式传输uniapp/pages/index/index.vue +++ b/测试流式传输uniapp/pages/index/index.vue @@ -7,7 +7,7 @@ - xx + xx @@ -23,7 +23,7 @@ scriptProcessor: null, // 音频处理节点 audioBufferSource: null, // 音频源节点 frameBufferList: [], // 缓存音频帧 - wsUrl: "ws://10.10.10.201:8000/ws/audio", // 替换为实际后端地址 + wsUrl: "ws://172.16.89.58:8000/ws/audio", // 替换为实际后端地址 }; }, onUnload() { @@ -80,6 +80,8 @@ console.log('web'); this.ws.onOpen((res) => { console.log('WebSocket连接已打开', res); + + this.ws.onMessage((res) => { let messageData = res.data; // 处理不同类型的数据 @@ -94,7 +96,7 @@ } else if (messageData instanceof ArrayBuffer) { // 二进制数据 try { - + this.$refs.aaa.appendBuffer(messageData) // const str = this.arrayBufferToStringCompat(messageData); // console.log('转换后的字符串:', str); @@ -142,7 +144,7 @@ this.isRecording = false; } }, - + // 停止录音 onStopRecord() { this.stopRecordAndClean(); diff --git a/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue b/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue index 2007128..b42e3f1 100644 --- a/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue +++ b/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue @@ -21,22 +21,8 @@ }, methods: { connect() { - // 这里链接socket或者sse,并把接受到的二进制数据不断调用即可, 具体的ws请自行封装 - // ws = uni.connectSocket({ - // url: 'ws://10.10.10.201:8000/ws/audio', - // method: 'GET', - // success() {}, - // fail(e) { - // console.log(e); - // } - // }); - // ws.onMessage(arrayBuffer => { - // console.log('arrayBuffer', arrayBuffer); - // this.isStreamPlaying = true - // this.currBuffer= uni.arrayBufferToBase64(arrayBuffer) - // }) this.ws = uni.connectSocket({ - url: 'ws://10.10.10.201:8000/ws/audio', + url: 'ws://172.16.89.58:8000/ws/audio', complete: () => { console.log('complete'); }, @@ -60,10 +46,8 @@ this.isStreamPlaying = true this.currBuffer= uni.arrayBufferToBase64(messageData) try { - // const str = this.arrayBufferToStringCompat(messageData); // console.log('转换后的字符串:', str); - } catch (e) { console.log('二进制数据解析失败:', e); } @@ -77,6 +61,10 @@ }, changeStreamPlaying(e) { this.isStreamPlaying = e.type + }, + appendBuffer(messageData) { + this.isStreamPlaying = true + this.currBuffer= uni.arrayBufferToBase64(messageData) } } } @@ -99,6 +87,7 @@ }, methods: { playTTS (base64) { + console.log('base64', base64); if(!base64)return const binaryStr = atob(base64) const bytes = new Uint8Array(binaryStr.length) diff --git a/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/plugins/StreamPlayer.js b/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/plugins/StreamPlayer.js index 2254a14..7e8fcb4 100644 --- a/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/plugins/StreamPlayer.js +++ b/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/plugins/StreamPlayer.js @@ -30,6 +30,7 @@ export class StreamPlayer { } appendChunk(audioData) { + console.log('this.audioQueue', this.audioQueue.length); this.audioQueue.push(audioData); this._processQueue(); } diff --git a/测试流式传输uniapp/uni_modules/yao-RecordFrame/components/yao-RecordFrame/yao-RecordFrame.vue b/测试流式传输uniapp/uni_modules/yao-RecordFrame/components/yao-RecordFrame/yao-RecordFrame.vue index c553f1f..735be30 100644 --- a/测试流式传输uniapp/uni_modules/yao-RecordFrame/components/yao-RecordFrame/yao-RecordFrame.vue +++ b/测试流式传输uniapp/uni_modules/yao-RecordFrame/components/yao-RecordFrame/yao-RecordFrame.vue @@ -1,6 +1,5 @@

Gk%auQizELC%dp-v=F6EmE7B*Wwn!@Xb>ZhBA45Mh`Ec+f{oM9P)t}#fUCi0# za=R~ikNWTUcPl0J>EJte=el#1*q&x_x>>C%AM%J-Zq>0^^iCN=+F^~=o9{l2{aQuAy1Z#9zMq+S1A&Naqc zL5_q0tOtFqFUJn<8Ro8|%sg|T0a}A%c)xi*!SFfX^QU*AZ;pSi9H(R{r?q~@b9f4~ z$uRWqgd%0&vNXi#I&UB5@HnnI1~|UjMZ3+u#UAa*aZCuT9Xt*r>Sox%@G0R7B4$Uf zj_`)ZhNp!pA?0E7zR1?pcDRdXa~Y#jy~)Ls)gQNh6i#ZFR3v#`3Qc{KUMuTVP9@h& zx5x9*S4m!|ShdM|ePg{j&y2&Vzzx*VyP~dcVFI{ourqz+i-><((yfPW0ggN1R!$CG z6LvcMT|{W)%!nxwlOk?Me2aV+*)sBbWc{f2QGDdW(8D4AkUfqA;wv)3_(N{(J(S%i zL ||?_^6jK1$+uHV;MuE}-ul<&Oixw`BxL&KM!0sn3V8nYos-8aYZZsO0ojaQ zT0ZzYi&K*xfWhR18OBcH9Q+!1Y&&8esuD0f@MVx5(myOb{B}g2Jk?@`#Ws!o8gnRy zL{Ey^6XlMY5LqbdOI+jlol)&0dWKH1G-Iin==z>rIeU7>=alA2KfbxYM0~FGDf8>L zy&3o1u(0=t8vOe zd4qCSyI_pub_s@Mh<&U>3TPPcE1-VxywK+1Ln3eHxgS$4c2tZKT`FcxOk~WD=;<*= zO!t_&u`T1h@e$G2BR&Sd6}syQzOPvg(>A8O|K9J5`RUAuzz^#`bo^B8Yhd!}v<+Fg zxh38GJc+&s{&0DXnhd{BXLc)WZC9AJ*pY8koc{U#zWz@BasD^{75)nT*Z!u;KsAVV zW$t1$#aaKh?RFds=pMK@uwhU^P${S#SKy<0ph-M8GGJ)ON@y&HV1Dbjw=_vJeNJsy$j@1 zdajv|v=kdlp;B9k7mvf@IfLJhlkv;&@qHtKFm~Od`^Ox?{GrCgeLjg#AinAcFYp0Ygck&(riBxKTrO&^po_ljQi&)nd)@`sUA7{uQdUWoUFy(Ea0j1t;Se}9kaeC{0LYVNw@ z9N;?THa%5+jQma&jfU(?5+K;I^BQDngZ|(JmOrfvt?w;2q~l_MctR)&zWZvSk9b-t zgM>$ufNsGw^n66~JZ#L>*j{lV@m1ra^6f6zvtYj1USX3RZJ4pHxxcn2zx{glOT8}- zKFoa|^MBFjIuluv9CZGTzrNB7f3DKEg=JGh{m>kHjA~tWt?@eMdmBAf9t{WGj~kx*58A(0)NZd!*eF)tjT@i zn(w*hE1(WC40fIHNV;H|4)^IL%Ur2|*j0E$ez6x#s&7{_lv~KZ?bbQ-3cH3}75YoP ztmPa-gKCC4!>UG-$2KDf&`#3>Pa<7=ktNH`wG&Ek!L2qzbT3 z=3_4C4V3Qw1O9397#LYc(aq*gwg<^0?2}s9!-DFE{u}O(yc1P0s(xfz#Egh#5qBf% zMz)O{8Yx5$h`19rIy5J^T}b!f=hjM0DYcF#Bh#DOH)V11;AC5Bo7DTsg;EmIK4i4Y zipyQ-ovE&)ZOnblGWIVnmJbsi@UQsF!Y{HO-@ga`q0Qa`o)&J4ySaOh`?Y(DJIYhS zw@hB3X6psO%Y4MO;Q!*^@}dIQ}B+hZR zvkm!5Qgd5SK&zngA#KA#BGMufB0EI(jVv75GGa*hfv`SdJ;Gju*}}(!lkh8H5n)e5 zFNSP#jN!M^mhxKXsmwg-BYwU~`JNJ;ayV&d(xsH6X(fK8XUVx+yfI2qt-mfAhs{*> zA(_u_=rH{<41zO}#~NjJVHv)?xKAo*&9)5xHtS{#Ly$ioQ{D!Nu21f=R*26-ynx2$*649*|6K4L`F$*B901tPCTOpRC{;f-j9d(tZMXT;C& z)?q(F-UUwx`53rTyi6C%tDHkKB2$Z|G)n%MJTCQ3N@B7vrDXbsUju&MclPq1(;6Cg zkn(uQa%3$Gz9)HJunT^!wfRwtRety^-Y4$-?r8Tw_igtj_bm4zkLjzb)CckZyg7{> zN@nvj`RYiAY?cNi&v;k}2jg;_nT`tTH2JJQ*}v2uEh|a~RO<6FQ@IL4LrYD2T0nYG zMu-O-Q6-{kWT(jfk;xH4L{xZUSj({aVM$>X!uy7Q4cip|nd?8JnRM^9{=> z`)hLA%hXdT?^9ML_e)AndXhRl-Ii(3-r`F3QDuqtTi*z#osI0q-YoQoE++f>t~} z>s8J~kcW#SiT6%B#%{yRv){(<;)gtBi~jC7AuNG94DB38kvU*SrPO^w9f zlX{JXsL;9LY59iKewOh7ojn%qj8a$r$2ZU0!CS}M&BJ-J-IF{8y<2>WKT7p$p~g&5 zPxi9Wq%q$VS&8N7!Cc3$fI}>dZHwL&1jcZhN7%eL1*(Yr*9^-NTUSSX;IyC{!5>3< zhgA)K5grk7A;J}r8)1v68QwK4CaiU+Go(>SR`467_8J8}3GCoFEv7Kp+GBrFSHA4J znTIltrrr1%oq8bobMn{J%IVd9jm#RAqq=^2H~4eqQrcngDfXg|Ya3UI3?NnEE>5NE z^zpFZoRwSn%lM{y?|T-zSGfY+Pd#&ddC?6&RO3Kx*@n-%1KA_gLI-$dDM2*&D3H+t z;IOHSv&VIy1N_HRZm9d|ZSR|pS`m>=;iqC`ah@Lpjw)C^e{+%4#5z$(Whq(!rB!z>TktMr1} zLyq%Ya#qRxJNsN#vtK9DI;K8LZI$*YJv*a#W^7jc??c(^bB5;TaR>VkDihT@$VK1K zk5JHr%maprG4#T?q94_g)${62rI@n7f5o@ccgSb+IehPYQ6K_8R6FaXjc;Z;*fZHM z)t0H$$%ARU(<9O+~3*$q(pejM#g4PBN4)zDH z33(NgKXh1V{m|keX3)T(azUK}>jaJpNOGJ)hy5k%QYnqg$38dKY3aTscdoO0PN&~} zGfVzTPXC{9xDt1L7vvDNiq=yvLl05Lh%?&J zE_$$DT2E6$6pNhYf9+GeJG||D_k272?O+;8RPFj{nrIGZe}nBL;$6Q&N|LTw4&%uv zk0jCntHqjW(JTe6RggqHZ{=*CtbS`x+XnkgN9TY;0cJo#;9=x*HwC2yEeie-%!PCf zz7|w4=zU;JVBvsaj#c*gwzpWx^_Q}RD{Kg|dR3GN-(2?*XHt$WyFu3KUxU-x^mFN# zGKT&dnb|R``|sn~<8oqiYq;imlQ4D)sDAYds%!y9U-XBpHVT^?j7&X2AEi~%nyUMh zAi0&lvcI-}hi|K|xql*dxQaSnuVZ9_Fxu$<<@bjLMXL>Mt=n;um5ZMIa5+GB`550h zZ=x@+pO>G=m*GiXq?bh>DFv;qn2;{|rB;^HmVd0AJ`5?w-&K>v78W> z^0m>^euSN4T+;fgKjbLiXZJ;C`P>ybi8xRxd`|luZ%$d~ zBiCimVT_|D@**W!U5zBkNj->;qv@dPtu`7O�l7)cs(x{M29TdBJJSpm}j-9BX!G z(%HJi#t%mp_o8q{+=?Xb3Cnq;UG`emTCyxN!5S!Nv)SC%NBHp#Ns^P+GJ!?I7?;c-(yg>HK3s659 z5997S^`PcKwKoDMcjw`}T#GJ(JjMca!~FmwYdyLQHKQwPB2&5 z4ci0cMs`XMrP5Nm7%hFbPIHv8)wKjm)x|NEM)nr=z0xwc;XL9g@tV|A3KH&-S?CDb z!oB1#2zB@}oExVZd)fXZ2&aT4*gwr)G!A{NhvE9`Zse#HmC^VPJJDP^PMZo|(J1gL zCMiGgZhs0^bslAczl^`XUz0g)JDsH0lLvXr`R6Jp)R9^WW%M8Z4RUvF5*=@xGIC+v zYX}QdbJ)uRXk&D0CFmD2^Ml{=YFY$7b`li2dyJF&C$R=mv_oRwb;>SSf4`{#n^ zvr+m2_QF=%8;gf8AyVm3X*HcN!qpL~ET=L2KM`Z$UvXzkTE@LSz?uXV+_hqxCzKje(a-uJsfc0-K5OQ?BW z%RQc3!8y>SxgU5(`;+{O->I8rg+BM zMO2KcY-gdbwSeUb2&PN<-bBHU>Xc=oS(t{wnKe$VPo6P2QA!m4Mf7UxgUWt=sBU@Fo!T7tStt*1{iB5~%I z7sP^TMtOB4DC%G7G_xn(%R`^Ox{*VLOKgEU=0hdwNp zqu2w&AoL->BYC*S;OaCpwYJ7X_7Ka%N4dqL`!6x?*zWvYvI2&w zc&#}1Co&TI(NVZsk3)Y~EZdfL)q0svnd6*bWK$oTm;SA8LB6P$*@IcdL>L>ex_wNx z@n_UR$V$COf8>(?y65#5#(l6RIOASp?SVY^K zv&n6;h&@l|fm^+bAINoO>JaR&nbSC#{!PEIgM>?bbvRxI!a41NJMIhEv>CKD_X=Hw z^~`HxSGI-zMqkDhGcK6b#h2*IET%4_Hf9sooVj3(*Jtwg=vw8eamH*)7;ddpKyK!a zM*nw9euMOm{o!BWAH+NOd&XwtG|ra$pm+KkU*Fi^UuhITJ?*hEO6x3qVwNhS%p@*{ z4FS7yGEBIe&}X?z2x3@uHO?%ZMg{XCdXg@Hvpt>-B8vP|KP496@|)d6!I-Y>W6HDH z(onXq%#(gnJ>!Qu7(K1BT9SLnHw7s@3Ax))oU2FkTeLz<0a@1WTVnYRYKT6AJEzY! zYm$maLAkO~L_9$Eurrkue6we2?rjQ8+qMOXpCM#iL z327pI&GeFk$VRb^k&k;PztuNLmn~O}HS$+;zuHmwVOfIC{R6bP+JL_0C9+G%r1zEP z+Hx?G z3qcF*!E_`CwX4P}(#SZ;js$}~z!##mx4gudpM@OCK=Xsr)O<(=>*GL-d##Pq5@n7Z zCA7jzejw=#)PWSW zKPd${z5+e39uuFDZsu@s)pI$kaX?Ao_K8){w|2sCqw05DpU(f{O?)Ob4L?O+5^LDY z^SSPubUn8V2EZ68KV1YXaVNd5_@`OGsDO9aGjdOfSFZ{ejILZKb_QcpVwiUPU368K z;G8Q9y0~G^TY%TZa0@?&DGDCkC|C&dyvs)@iWPI zoC=Cq;p}I7oAre=G)+(BLeSUI-{_C5p^M&8Q>bnWHLCi<*q3|-vw`-LS;&`0#%noo zF=O;w^pZfq>h3|}%|_Z5b0R-d=w#N?U}q86(-E{95L^$n1H>xq!I-WDg0o<3w>D}sbiJ{d zUf`ecck~qhHe+1iCB3URhO2JrYSx!^=B_1=_FNw+=*9zd!Cd2?vv&1{;Sipeb-qx6;y?eL`*RFEw76W+uR^ zS(Vn48zCpfGgHL{NLXx<3hRB<+m`RdP!f!J+$g3sIn6ZV%8}V}LA|Mz&KBk>i4V0+ z{^|TA%Q4SOls1pk&19^Wq2#sZ=QGqq{y3QU3esL1=p11``gzixHr#Vvh*F zbz&xK=gAr2jGUu~k-y9V=(~C*9MdCY8(oVIB{#Y&yV2G-y>2RPwK>%W-i_vZvVdz! zJnT~~lFL^6v(2Ow$|4zbne65!`CQC%a?EJWUBl|nqRt>Ym{g-AKO8*U4A!D=Qu|5E zg)1(-IUAuJI`DjoSy?WKRQRDdtfj^YA*f9Ny0`9cvRnYEK_|4wqkXsC4{ zjl}-KE43(0Y!}q~^qf>wEX$NoziS_np4n=YOA;>w5d7^rmG_2d+wHg2o9o^=3r#q zLir43Dc6b}4^DD|`Ii{Zy#&*&uMq4g=^LdqLdQ%c?TbN&lDg7<-Br3zKZRp(9l`V$P#(^Jgp$w zg+lUeHAy;8%c^6LKI#$hlda%gz^wy|>mgGX>>zh;74Hwdw*5S*rjF%0$i>yN0tt9w zMtBbR^BR8zU6)+iHhBve*@M(YHfz8yd7E=AH{MZ?K31pLY(^U2q)>FZpFTP^lm<+$#H<#|WZ!q3#D~wEj7c)vNE@bIb(e1l~ z4Y#sNS7iq86q@{J4>fhJ2%HG9@DXIQH5r?EjOC1ddP6aSKL)n+40e|JjoT-Dqc%C1 zD{1x@W{I7&KTwO_NrS{s;&oa{9tVfqBvvyE3In(e+JB$(Wpc{2iLKZ}s#U2Z3SzWx zKU11tMMlyr;|AA9f2RMie8DH9p>g9mi05-?1KL3vt4%eII!22fvsd^#qlYk^eQL}j z3-ub_LTrvblibFAAHgNaHl-7P!Fp6E>~d3GjF8vT%3@xjh+T9)P!@rFn-|W~XuU zkw#V7|Mt_xr8RsIR+MYa4CX$$Bj#aF_<+DQmPzr_Lu$$uefhW``x!n~zvgRiq=R6- zUEgEt&1Cy_n4zo{DgKUn{6ttOMCmAF z0Uf-DI9I)B#yd(1)7{6MI;e65EPL3WN*^TAXUnTdQ-@d2WL9f}uP%36n84-mN0|vq zGfQhV*I!oL8kh(Z_7sw636!7GSB_+sdb`lh;wd-|rZP(cV$4kMG`+bvh~elkVWHTE z_LtN2LE>?fqkE*!LXt1hGl}kSe6go#Hg%77Uv6O*5OVDimP+mszLUl~u_F7x@H$qg zq26`WXRhRzlUVMxSXkTX&erdfywV$^F1LlY(~{JEmNe~`wiND{2Burtq=O}IPawTj zKla@Dj9W}={*kF@x5Vd0DfGM#;DhX!Il+@g_VCNy2lVZZ&yEF3uislKn%@n#aU^>T7kjQIl7hhWc))3*DlGa9-{^6RjOH zF7V~ybc$Cktcz`8o(H`kp8FT`Zy^|8jx&FoR7hs4Xq)}8LD=i?JN3Maqvz4RX zcz%bqK05~NrRS7-*O;w??pn6{m#Zq>%sb63pi+#$DGusT?0&hsq4HCO`!YdhBGhwz)j`jj`W%le@$IRy%NK>0P!GA4z{3b(v3GUA>Y~k=;gyn!EgEq?>Fx z?*r0T8cW9+vE+?+1J-dN`VDcYd|qqK?Pp#IL+M5}4|Zy6jWATT*XyOkE5=B*I-?+k z_ktbPTHA#o0<)7j6@>B(2RgT3h=`^KWer3+oQoLTHCX zK`-?16xKU%#nB5mgse9@t22zPgs{=N#D)kq4bZv6!xy;X$F#b=gjx!RnUPV_qFP@eaLY08ELOKM=r6T(wENRd+^7& z&RPvBaSF+6exTb>96&c&Y4rRJzP)n8ks7j=DB-nkOtnHb(Qg54VJ0d z)w+sjnQ(tu+5_1ID`|uDZbNiL+nD)mLGl()dq?9NeQQo+r=U)Eiw$Jj!rG@JTQ?TD z%>?r*dzb9shv>CDA6csu&km+4SwP>(GnsVZqqJOW>I-H6MMZ8cUrRf$;C0O>*=-!g5LZ56pjGvylWVCF2R z@QN{Ao2$KH|BymiFFoX2&A4qP=?ukztl&PQ2Ymn|@JH3kPj;-(hPvFwM(OeY?f0On z7U1v*fu26v0O^D|TieC8f$uIrk7DzZ!#GcRCnQ@rJXg2;6`4P61%=bhpWc011c_sB zl1E6~UsnFn3o|{?{qU6;#7(7vw1@tPugdW38KxfFjovZc+&Z>8ZJ^y{Vo9jDlr5p` z^j~9AU_rfZHsr3T#nelTfsUbD^q%5@E2;|8RynAMX0qq>UV4mW64%$il%D3o$ba^w zLEH=dqukb50KfDAdcr4xO6Fr9iP^Z{rSwEtl=7iRs=wCPJc!-IGqyP!gS6dIHj=-> zn0h2EXa(6^V++$2Sxop!%=~-_hUo85qaIJrFtcD*DQDQY%FJ`D26lsn@c|=$mpOvF zXg1Lr3Nd^ky`njmU1x5^{-+98k2}vg**iLKoHYM3jtB~KUVq6=HyO1rdxJ|yjp`?6 zxg%;YI_@5lzvwtr5|<&t{tp`m3u!76%60j!$~iq1NfnEEgAK;1@p}EU*_+fxV(O4t z6Wu-^wG1RrjOtC4~f=-kFj7sneO~fhb zWn(kTA;s8&TMM7me8XT?kZ`ilznom*wZ$R zJ*Ga8J8RL_7otE$$j#u9Y{w>Xc2N5^Xs6UecmnPbjwy^>;da_wI}8uzJ@h}k0Q+J( zEkZ6Jd0ktbXS&$;!dA>o4SkR3IliZ`!)(tj#%dSdA|z^J85_=AcX2G+nyX_k)Mb+YlRuL4pKg6k|uhE*a`U0fm{^s3u zw*DtEVOaZzt4c5Eotd|!HTRhY(**VpF2Rgqcu=D*F!PKkQk#3NyR`vKHkrY`H(MBu zXi;Ri7n_%meH%&=+57aRu?F*WQ*9jkMqEbs(1xJp}D@|mDFdR;q*H%TZ6f$kELlyb$?^<#F&+|WWz&}#BS)V$**mctwJWh zh;-Fd{XWcM1DUUSTm6j7FwLD5M}B~4q8E3=aq!dzyU*4yCNq2@PZ z1Gf%jfToOqYJY;Tl5cO!pi`0edky<=O|~aZ)ExXoVL$z(2eY%N!0v}5_FrzEu?>_Z zE8}1SNHfj?7M4q2$j;<1G3|^Nx~BI4XX8&i10U1_-qq|QVKXn9IhfrpXx+@U=!%P^ z6SS9X9B$ykr;vW^RIsd?7{AOB$mx|g`XW;c zstQiwc5(-iAcj$#dug23Ly>UL2MhEx{sg0HMd?DCW8V~;WG%+cmXB>CU!z0C<=9h^u1702E*hZx7X zaI%vA*4vwTxHxVNyw{o@p?_pHk_p^hkQ=(w!L$&!oBz!2)e|&7tjG7^J<2v;fMw=m zRf_g-~hmcAfG7tJB*e{kb83QXh|uwpWaGWHIX*bQ}y%4TaYh)fhB)O z{SFV`J9wJ$iBfkstXbdi)k@4gRGGTbCEbLU(B5) zF+vt;2{OLHpAk>-{qR|j6C|rg+Q2IqEycNtq=#s?=JH86Pd<&4@s8qaai=hVoxJI+`UsYcN-zDEn-&^k|PeD(tr@J>4Xa5KNE?5w#D8ZO0( zi^YbPf>Jd4avn*iEr)G~t4S#4hr9dOyo);EE6q_t(npVp|sFKJR@n~evh_vlWIsy(J|S}KGh0KT8l>{PLT@7jT>X@Z=!?d@`2!!{pyLlRYTn*?H zeYfsFr%g#C0|epKu&D2&#m$vWH}D7=vOBSBDhgloU?GD&ae7$`iy{4y#C)0h>v%xnAqwY`tTi;E8Ii;C)SFfeN zL_b}CQ5mN_KAhitHk-lL_})Bi)<>>hXAk0zmB;)X#Z}?fGOY{_jLLl68J>mNv;z8| z+i@2J!5W7;?K7^XILK1QD%fU=ZeEub+Fw|v;yQX+zepJ!!_1r zxCUa><+}5D`}*$tJ^nokuf5i`!H6*mb^IQnZXU&Yu>@u%j=jO|1(mLr`PjH%R7AhT zEj&Z@=o%^-n~bk;xW0x%;|I>fr!XpdUWSqCT$b65-6Qn3d=NdPJt@Yg3h$+x)=0|( z5OE(OUmj#BZ7B)5b}unX_$ri>j(~`K!EzK=)m=JciL!UHQ@hJP!g?DFUk*voA5xO= z8Y`l@V2iz@m*`G4pFhEC@w|3FLcZa<^Lx%3*m1IRa&tR4-y>;$*md5``0R2tIz5lT zVwgys#%QKA)|LzK9@!0&?L@8{x0qdmIbtFRnrK1<1#%DFt4sPn`ZtinQ|M&66jxZp zJY@Q@bN7Pnc#jDJ11u4lx2u>R0)_PgFH8{j3pv7i>4$UdWQ?w5HG zdHyD#ll2CrHr4clikCr?=r8(|9;6lNc73QmLjM={HP}xn#`VnfzIj!p#MRf2vSJc+TgN5_~GZLl`F9;*B01657rsuRuZiL4!@zv@oa5dtf>&1TP~3Yw~txKSKfGFcYk} zi*yiuppU}6Td%hU1I2}R!ZdV%Er2QPBhoL)nB`N^GvQ@hlh=F^p&)N1`N$%EiqH~? zpi-C@5Aef;9l|gE20sRFnlOoqkHpzhd&^8qnq`D_8ra9BK`PIS6n`kV-?QxHV7BaR z?`>TmJr)&#;iF*Ioo(c3tTsq3BERz<^=xx*gZVMUIXt&o?uVRBIhAtd+#=3Gt|{(< zo{C7e>i!_5ky=43uji-FP!G&w4mF#DHn<(X7BEYKru591Y+R@9@Pr+r=h0DF5hROi zF!9VXP8vDJATt^(ty1g^Hks`OlJr|Jq~CBQ36fW!NRNOI^c=U5Ysh)Pog~CTYJ!$C zoPS3)k)bffSfzi^CqDx{zp0iB)`IqIdr$izo8LCZUc-JHwEW_B!CnZA|2wu-wjP!e zVsqgU$lyBG95;=21dt|kosWwtAFAtM9%C~*XJZs!_-9ug1oIjm&T>D&{%kDbmigK@a7xHfMJ@w7? zpO(8SL9k(_>GkMpkRVO0H-;FCV6ClYbff~UM3=)`y8^RkWqqM;fc<+H-P%tn0h_ZJ zQXS=)ZyciCoSIcxb3Ex`d;Bk15uXW28cunSrlZ0)A z<#eW`DN;=f(XPw;d|$kh_m2CFE6Lf%ByDu?ziyA{g5?+jMva0m6&cXb9 zgtkR?>WkJ~{|tZ2KX_-p1mTAom*Cy7uvgjtn88=LJERIct&RC0z6^hXcL>K&VSdPE zb1eU!AIHxkB}hl4{!Ssiokh~|&TPu>;A;xcg~PCd)e=i#` z!oANO<4$%>b@%ePJ>|Wxy`Oyl`e(>(l*Vd|wp;6ttZi>Pldh+`G5?&STQENzMjzj6 zIGj(>z4(&}n15r9D&X6#!Mn61RybeSyIc-eiF31Sxj(_oYCyukBzlE(KS!35D0rN& z;0@XvbJ8K+#c#u>k%t%g&-^)IsSqaAfxTv=&=t0q+d@TgllW3REKU&n;JFZYJRdz|TR{>Bctt{MZ5N*RB;w~P0I z=Yu=Ko$0FU-s;}uUWlL9-F@KytPQS7guGn#%X!ro+8li}b`2)1xBdPP)4@-y6*uZz z@H<`TEE*18U?)98pF=g;8Kmqs##7@6*5}ul+3*pRKtE#w`9^B-t@*sXL0a**kVb97 z*CMZBE*XyObpqd&R6)(OJAan1!+#(Q?9@H^NBnf*4c38=g~j4TtN|NaBH<@m2qR88 zYiAf!n^;>}s!E?gPq-&tl3I!Rg!@7-akC(!?yw(p`7+FJ@Y+6T!M9Tg=6WskcKI2VhmR3oy2@n zamg#}<&W_1grVYop$)v(kzlMHgYzY?5XOHcJ^4a>Jc;MVfeapQ&c&J5Q&o{C$p897 z{2P2p-c*mrz1dAXPEWiSdq&StPhsz6UqyMITvQh1)pAjFgSJrfskOAT=!7q#@4{R6 zgdV2f&>HD}J%W}-vZN4Qi1lB(F&2zj5tXYMOdIwANMmieUZ|gaM9*3xc}(_`1+c=o z$!{X?j|d#S7|XZ$5imzi;Lq_D;4P{s?BZAOPkEXD$?wPSx90oc2_L}c$EQ)4f6kYN z`70EjxjE!1>CIonO7a6%%zL;9atJGF1}yh-?4N8M7&Okp1kfKwgAd^F^+#It6zFIU zvl4x)HdpE^nQ(beQEJF@e2cx*Tf@)E8UB|3^}aPoKLsg)Y7Og~;)6QwN zwPxC0%>_fUTmPlcz>iv#Lq)tCR!*pdnd8hKW&*PSLc*ElL{opct^ibM_j-omA7&?7-m<&^Z>B@WoOMN0b zh2Ek@bs6i$J=_;m{!OkFOpU4Vd8{XEiHmIJ-|>s^G*`yGO+zidpOA*@KY-m%F4oIS z_-=eVzBfOVug4SKL)!8RAC42pr`Tt&0flr4>~G`w8KAVC=h~CKaD%lMCMgtg`03&}1NOR?|``K!IH_DqE!K&O)uN4gBbJ@O3S4lafHRdyFb_SDd`IG~c32E<22r3;kXC0nELn*4xk6_3Y){kvg5%390VTrUb2px#x27$I}KM8z)vE5 zFw=Ju=D-~v$Jgbvct7fvW$?Ur;;X`jc@girI5M3ik&#Fg+tBA9fSOtk*98?>lbw&Q zreV1Lw%A`*z?t)DwjDbfq}tRY>UC|nK39*`>uJ-~wdy3TsXh@k%{1KYMLO3WF?If42TGbVnC6kFb<$2h$7E`iUC1z9Fl=i1QC%WC}9MYj0%#P zpfi#c5EPr7`riAy@B69G-JD;yyjgF(KijyknqnTfTwvw)A-O?A3Whq@%H{t&d4+>wGcfj(pqV9r;eqiM=28uFdy^=Fe9o zRvub$=+;;#FW9>@I*QdNrpLnPq_GcX=hEv#)lbbiE&E8lWAyX!IM{o1*657%{{GSX zMmNqkf!;Fq+tC9@UmeScWk#1DeP6uncNpDl^oY^hN7u~Ty=U^3x_vUoofsRiwfmpx z&mX^?J+f25PWk4?^7$^vZQ1YsyS)=K=UtR9g3QV6w_`Zcb;F++c|2bv+BANm?};=w zbILikZL;Z##C( z=vj0AdCp3si-*&%HMZ;M`E!nlc7AHUd^DOl@FSyNiEr%9@iN~m-zzz+|GkWZbMv13 z>%DjN9+>#ge92u`ew9NGseyz-7Ral z-_5ys4m{!Iql=DyD*XSa(I+1?eq~#aej+pAW&K(Gd_N@Xw6{$>FmZTqMt0eJRebH< z)q7p+rmu>f@w546%&&Ww<;}yJG7kP>SUOV*q zq5U!zL&Ic z@2K9ry_A ze;|Gc8wCn;^6j8Cle0wc+U%=$SO25^HTz4Y_pj(*mUoH^WGC}?jUO4g_5ATqkH0lv zB-tnLuC__P-<*BtW<~$C`q;{2+m9U;xo7J5m1CbD``*}dV|zu8vV$b!+%QtyN72C|9p7eksIF<`jFZVy(pWgpnv`n+}e)6XAYjbUv@i}8R z614%h#9bicQcACh(L7or=q;ST~h8NDdZ1!`^-q(^9|)IefdVxtX{vj zO1>s^Vei}d{=`2=Ydtd*e`LZB^X;xHBcb;*LtmJk0*}wvY<8S@WA>U{BRbLL^F6Pl z!V9(v1WxK7k~!l2*=zWM{wjHU{)UOa=1XTki!c2(;c%A*27Bd;XPfpn&aqRzSM~Ok zJimWMN?g?cc}o3z|983XL*Y9IMk2m=VpcfL)7e*LfxJ;4itXdg6IV=(<_jFV#{=l! z@>YJYNDilFhWd5Tej@W@wMVWm>+B_TAp6qp7|p zUnE^Sd~TaayqhF!nlG08F|~X+-=%tO`n+a#e131#D`n_0q=J@#A`&Z>FZ(B#ExGl5aw*!N_@&@#b{*Ixbh4TL6*#6UbGj&70QFea+ z{=CuNZzA8Dh=g!Kz6$$rX6RVQ_NETyOI@)e-L?0F-fFQ-IyB$qIz60i+su)B#GiVp z`1c+VyR`QQ4hIgclQ;NlWLB9K?s;5x5;`a}v-R-OnGLVZSK)RZ8W}nv?`jVTk9n%c z7qRXNG;hx{RvfxN)~d($K9yNvhkQHe?0og)xU}Y?ybGP39j||%FS~s&-xd4Ee2;63 ziS^?rwNmtrw`M$S82)}-EKLr`|33XAg4s6(KC9*Z;#K)V*#-R@``4#;hh-f6L&Aoc z33dxjytjW$q{7QW3BPD`b4lKBZ5b%rliFnd!G5da`$J@92EJ z>Kl2}G9wy|wX*g_;(K|*v$?iU-tjJ)dGEGJBoF6#JLL;_`(-Ek!?M5ka#^FaGbm&`7EIBbd zmTedIug)6iiAX;?NB$X)-1BH?{yPch=gVy8N7ue@tcPEfuw!ET$4hLRSPO0+Snr>C z^3?E#-)45&JhJjV~ zBV*NdjYU(Qly`qGVcF1Bj=>h`Bf9YN&Q#k2`A;thgVHp7anvO)#mIo6ao0u;aWfWK3`UK59J-`qbV^v$Bh%e z%P#IKMy`Bi@Un4Yi-psV;Y--*`shDp{?)BVTv?K=8YLz9zC&;Id_J)x5==n0PKUI+VS_rlyA11frjb zM0H^3bC=N3_IdVdx%QXrOm=f1eA&c(q2VnvmOq+u2Zb+xEEs%EYWaQW;LNn@pvXsG z4OAYTn3{QLgS2AJ^lw^k_QXx`M!qQR|Ng|+GA=L5YUB~Zq-w6l(PB61qzBaR7 zIL)fzP5-}OJR{#LTrYI6d0@13!eYV1I3x+lcg}y5POXSXn(~=Vdr_V*!Jv1%5G}Lxk z_{yxn{=#tGUnKtfP~C4LmHr?-_*Jad|D5A@;SB$gc03tsjOr|{el+2!z@HZO^CbAx zeCgHd!S>8RWZ6*M^sKBG4z2bwKE^_=FNwY{ABy5led@a=Pdq*R^oODJ8v>t&(!%B1 zozp{iFUbrzE92?pV3+-FZi>$6)!{4O$k;rucYZV|7iWwgoW6~RXI+;$`|^aV)5@np zUmJ&aeIRu8?(}}?K=Oe=`PPil>(j$?bKIO3%uWv;$(VT{$9<7J{v+WJ>Fq=5{|$k_ zO*!9`_+2?3O#9~xeJ>Xbt`vwbl(pl7DgV1%yFcUnv5e87jIU*Kb!PfKHPRF?dMHxikroq%)0=04fx7~sTZ8{UCjLZP@nqV6cc6Pq+IdgfduOiR6xiL768EPE z_a*o4oF57V9?bt8Df@@O_33bo(RMtMdge5WnMnHC;O4npnUnaOq@D{-7tHe)3SXMY zwfh3mYr|cC5@=l5DDjE#utn1MCDZ05)Bgo}kEaDcONleWE3V9wmy87S$?)nk!?AxF zJ<3lq6YL#`%}!gdX*6+p{_o9`W`=9+96O#p!;{v|Q=d#OeY-id|FewOtCD&s6!Bh|>XFFAf2D!V>UzdkkJ6K0 znw10brGusUGZNs__okkU!t0SWZw$=t%d`J8XQ<-twCLJK&ljY`kHZPC51eNQV)N%& zD}_6+7cR19Ml}3mTEkyI)VX-W{2HN}6*7{bikF2`Ko!$Mk*kD`;%$(yeoCyEde&%E zF<+?Sne+pif}bp&*g|RPBI(Uba(^!n2Nn;6#`_t=Q-Y}{)3-k~KJh?e59KPf{Kxd_ zfxzV9r2ddz+?^84n^y;Jx2N3GZJy|b)*i_njJR8K{rcdUk@36S!$@SdSum|&)_!TD z%-OkeTi|s|pbB2@%kgk(gA--n_mo{CVbR2vOpn$IuiH30bemWP@0~g3qnT;moSv_f zYf#W|q?|_^W){d@Kw-U<-#B9hsIHOGvRL}a4^GQ@{_wEH(w^l5*X05iAObx89NHd@ zK66UiIW5pzIWU$V19@P-VCa=SG#3f(m&>zO3tg_5nwCv`m7M7xqvFYMc4+Rd;Q7JC z*}H6kJay6ZZK>9`mj)X{f&6m`%<+E?Jv!Q;WgQ!PA^R?!Q>)1i}*^qsJ9pqCGUrqxg6E=JKk2@mD|=hFJ2KxffBY1uq+ znZ#bwxB%MeyF){>TaAyU#;5Y+Y%-kd3#UJe=XhC4FB@pC8@z2Az0tOjO#Uen>psyU zZ4peqvW)?x=9p(ST4ByyC8Oq5;fx#Q3?x=f-og#b*~X{AcQ|ckywIW*a&^Ick9c-4 z1D(^aDd`XVXoUv7>1jJO72EPa3T!VJoKDSs%Lke-ZzI$=w6{PYG1lPpSReuY|1tme z4KBD?APzT|9}YFB0qwsA+mD7y;&7LCt&+a2pFlshOxQGdT{X|+&P5xxr{~%5hz(j; zE7Sq5S55%i(;KE&3xz<9YbLxh|0|^@i>B?&(DUcKP|i~(DekGz<1^{~GogZhI0cwk zC}kH*pO(sf9Lpw5&%vl&vSEmREI5fV;k9}wkLLjwXl=Qa%>GDu(gG=e%)Po{ca2FYW66|%Ny;$JZ21C-QzOSn!f3=W(^QE_7$G~`6Jn@ACfrZmUaKA`e!2$dTBaPs) zdhkf7b#|zV9wL=IkvvAgBaMn4YP|ZPT>EP%>am0;6P{=z_^JFqnHYHHcy1CF^QSEf zCoGb-Pixqo7F@~OVtCftCH|(RZOFe%HV85QfL-7N7viqPb2hLRp@-l{D9dx8%wD=eY|8 z7t?b8^c)MPZm8NYlIJl0EuA~o47F{Tk;ZJhddARp$&d zJVGPoL@+_&F99FB(ZN2w$zoXdx0rSE!Z6)5N=_AlAS%Ohv3HxnHU?eA_ zNAv<2?7_tTnta;I3Y6NFRlpJyK+WVn+gj~Yx|+bRSVE#f3KLJ@fIiUE4og7zi3Szn z1eWBOw6UP9T}pGT8aOBtvH+5p~;8?Yq(iKV{;Gw_QJPxP2}+E$@0gn@|kBD@Pb zMT^K>)Q8***8yhm9@5MMg>^|N$KzeIgAucO_Y~gP&-e8YgBuztwxAr9J-PJDH%XU zjkUFz#dyJ(Y~as-q_{EltyA1CXS>v|9W@$M%n0 zF-Uv-0dIRyT->(9!)ZHoQN7^~D2VY+2nlPD?%X2CN5j-N@Sx4)9M2B`rlPr5H^mrjaWq?<|& z);4c^Zn~TMDo@}5MqRu{n`J3MTk1}q3~z(8vEpZSfb>ovHh+^ql+)*nbi`T&DN*?r z`NVRRK+fxWp_aiXQNJ9NbQ;lGP_VKUmgIg8+et|wS9evur8!%deX!lMLfL9=8LO*f za2(fY1a8uS+(6D={IW_ZpE(l?Yj9$#=5CYi@|ohJyZ*wlzwKKGP3{m*bLYKqO)t_3 zbYGMsj9!RNpcg0@dWP~jL(k;SmoxLesanBwR7|bb35`Ngjz4nc9X!7vRXJsWX zD2_mmd2$IkhGkg~Psvqv2%L$dRpKsm0tB>b)Par${ffEhV<_>`$$Vau1?8TqK!dg z1Fi_!Jx90X%^(u;TiE(S|*=Q(zO_ z2s#6D(KS_hukvhsqrM~cJyEyaCPb2m@&I(i%8XmGr%{wsw}$2@cu#L)eyx1cVb z>lOcL-C!NoU(Zl;#F_f}w>Gps)Q-LfjR^Xv(kxM%+O?{8?j96{7gT^HS}j7+e5FVa z2Gin$5g}F>eWmY{PQZ6jF?0&GNXg{FBT30oq)s{7;CXJIRVjEI+>&(7k<6;fF!EH= z9LnR&(Ix+}{#ABYj#u|VUMI&hi`T5qyzWXG?UXAM>Okh_p1BWXcjkH8;(SlLN<+cF zZH7nNQ#my}R&Fd@gq1qcf+S;$k;I7MADBCC7$M*SK2=<<=*3Y0y-GdMNYMt=L7LHH zJ~_qxpdl%xsDrwtkfM%3%JBK{L}-CS>Zo?s=!YlRC(r2I;88^#%$mfdj^bQEO9*)e z`~Ki*-4A#&f0E~1?#v2KYQ}{!SZUR24eAi%wccfoMR27Lu32r>I?J^<`VS6P25JU4 zqcP!~sVh#k84o92x|D~r+9arnP#Z-W4F|f3hnj8zea?f4bvg>(FW=v;{V^Jg`=U8T zFINFQD(TXx@*bKp_a@xa^sJOX!_WENR?Zl2pa_(^C-2T0b?hg%Na6;t!pa+Mm(_f!)&Zp$p_7k3b44Q0Kr|-Ct<} z)kbheXC}RnD!nN6)N{~HpbfJf&<^@!DF&)hXQ|GQzR)jvL_g`fJq7>j*oBzT628R2 zF_<8y!!|i!;m(}FA2IRR;Y<8gzIZn!h6nLpWxe~3x#})#(~iP6cop0AFW%?HHs!?i zyx0Z?LV)-5Y7Nm|qjg8`UXTRyz!XTA4oJv@bzpBO{1)cWw5fOTeea+)3qIleQrdA= zfX+qmqMDmJZdIHMuBE=d^Z(j?H7AMV~fH!1m-diQCtIX#J-5KmvGdly_~wXT$c^jnu2!!F%jiH+b^ymv`UT z1g_iO;0y0p2IgzEz}xJ#gAx9*WAsXgnRRnFZ^o&m-jIu#4buXjPitt8n4!%CdqI!H z40xgEuM0G`3}m(nWC~tjX6pveZ5nPm%zy*K4!ySp3vZtcJH}q^9qo8`EEwJu+ZDq5 zVw=5lJ9f_h`x16Z*sX;@lUaV*(YJ| zgnbh}6wB`q#fpybksSLs3z?6$|BuBI^W!-Gqc+mf!Nut#92vEk~48rT&Eqhg4WVfdqhu93>;1jJWgux06stp z7y`?02a?}x@CC}pHrRuOqk@m4CNTxZ#2q+1vIVefI4t(#hquG?VT}%;hl+hU@k0~7 z+`^%aUcTJu<_nFAzT9$%TY_umc@H#33`+ZQVwN)w&G{Uu4~qM0qdn>Fg{e;Jlj@FX zbaz~+?3e*aKz~pkRQIhw3rKyZLF?Zd#X)u7X%GdPLbap1@6APZ9o<271SpKNSgJD= z2=+RvJ9U!oz%3MbMy{Wk1ByE}2efxa!fBHSbO5bMcV{NIqpd+2gMzqEijeym z;i5kOr8m#rJ>9jlQ(oGHE~%Yop3~0cNW;XsI*PKT@-tGFR&%z!#vM*5sX0gkL!fzD;0n}%WI>yMMm$&G5GN;ATmqf}K7W{h_{K@?A6ybU zWs=u0;uv%M!+(gMkn{K2zZ3%<5xzV5&v;~1LRrM*bL7JJI2^0c<2Q4_C-H}XPDvBT zI|8cxMjOeFYtxoC&OMa%j;f>XmGb2Z)N9OV(+0xvlkKZ?ab@~4cfZIfehdVFfe?`& z6K7NaJpvrMMhN2p9LRaWkK9&z2Z!QZJkL!5&W<g(H^X|XoI5NlAGcS`O&K%A8Um6c})`puNp5rSy z;InXhI4wJ*!PDX9aAf|K1ilyvp^h&^LLhuLGQ%NFen5gC_W9%;+;R?%f6k{Pd3-uP zImjKKYElU2Pc)eX3B}lfNh7TsG%2|t!+bol%>g;~Z=wE4ePl8y1ARED54W&SlaDy> z+oUF?r@bRh?Hx(#gE^3>kgJrl_H6&e_iEA?G8h4gY>!Dft>m@$#dnRcOFNL~knNE2 zh?6qDQ+yV7YBC_PcjkCk&O7G+9Zf>qu}O??o0J>h7AX>Wa)%a>@0Bi*_P0+SSE|h0 zTMCJjI;d^ORyT4dGN+O!&wh6cJEa}8>bSGDOs@_$Xh?Fc+TtQpIrV4cnG+bWVKJ+eAk|9 zXSKObTZOXr#J=1WXlVwj6lGkWl0(@FuWb3OUeznOmbEn3i2ZF~l}mk90-IM#y`ova z`XurQKCko?^o3TsmR@_Zzoh815CA&FOPe8lfF*grp7k>^gZSXgHB-b{&0CgSG$K`o z`@tV|SQGg5x;1dsn)t6e#W?r)q@n?yhQ{DU{I4-d1z0bmuTpEJ-b(r)51-FhD%w%clkc z*Uja=DoyRCt2WEqI$Ob0=m~kY>gCZvu9_6}p^+pP-6Z}L=qIg_f3B{atLE`s(yOE{ z?xn2d(QR5!T`OHD|K4v2pW>5=*L}9Z7TX&2q@1~Cu$T0u?yPI{kZ0Sgf~@ya-W(ul z3Y?V|7EdN&B+V2~Uc|rnmM(x1*q_-b0=OGTvt3&5q89$Sx>EZm#$6no@e#vo%)FIS zYGw}3E4MpL;ah6im2w9MshQ80!;b)6JGuBFc7ZFT(8{ZiFRugqUGPn-Kx)|><}Tm# z`FO73w}mef8h-uQ)bpF`89ycT|M=11mq#vd2gu>=z+m8=fgVo$`woG(3HXihP62-> z%9G-q1Kuxuk(DpNOfsbq_K+7%7M4hST|tXQ2D&4Hu!!6s|f8oc$dw4 zZ2Sa$r_D9(K6t}zIqgNtYJ{sC*pN^wZ&4_z-2}Dq6za28-IF^D5ZkIJ53RLVzIVY3 z$R2kw;Q<`=+7Wh~g&`0W%Hjn0;;AMkNSWqe?2!h?;*s|{&;xj#KA8{pjYA#83j5q; zP0QpiO4SnvF)zNwtW>}m+=_MZPMgW2AN1D#hmT$D_7hQzrAhs^x<=U)}Pl%sC}Gq?Y^-5B8}AuZwa*? z>8!i7;Ny%q z4`NH)dDd=D%ek_U;;ya^>*S3uxmr_OuXS>^4dy}xTJ3eMrUj;?33^(#edHI$ETcVE z!NcpEyC2v53A4E|2^8o3Rrz`G*wr-e9aVqTHSe8Wc}o-)yZrwuHg9`k0@Q5CxTlNF zTSM2{L8`C1<}F?6uD-u5NsZuQB!vrZ-BYRt{s(h;y1|$@0&l>AdJL2yR-;@>fj3l6 z)j~a8p7vHy2*JC&3SS}yRYGrFtfT6(?~|S>Dfg-pSgvU;>J`dSLOW7oj)(cfH?b@& zi&;1&{FQ*Un`dop%k~YftfiUOXxhS+Wf~k^9?ySSu#uxBqdCRn{l_1$z&aQ+r zM`w?!4TiQDoM{hv^>1A@cW`B}{lw`Py{Xy4|LV7W*X~c-%5Dx3ia@M`r54pfUTlKf zzh_)yAp@R~?m7xE2YcVndWKjhPa+2*-Dy3m1fo=d6r#-}GKx})|4KE=fyj5Jm4!-1 zR(4VXBoB!TSs6J_X%G1uX%2}T84pQbE1l&cr6IGqGX-)Ts{&U7tP@-XAOR9sQ`8D% zr5>vf))XAgE@W6V`;tyo=wvhsG-O1`mLqmpt}ss@6UDLLvvUXj?K77h)Z z`yZfrK^Mn)ogC=((95wyhx$3LqD?Ft7EZ!Bjj3yF& zW>*7slPcXHEm^Czj&oTym0pFlH+mBK#wuNZdbJ3yErC_(6#RE>IkUl+)u1a#){d?u z%>zG%729fXg~@YaZDy{L=X%jxR*v8kj1uo+m7+AB>e9%I^zgUz08MPr=mO0*+Fs~` zGum$S!02|nGbPafN@J$f0CUf)a@9HpHR;^l(WEu2Vdv?T=jcL}@X6fGwQ8U7dS>0( z{bO_I9sHN>zH+P$I5-v<4~`hek6L`Gu=;y*%W@t9LwxW+JEL_=V#99 zPil5nlcx4eJq=d2YRj1G2}lEKfl33Uend?O`XV$QltB8x!-upog)#Cvy$GH^lr$i5 zbQ&w95~LN*NHEGYl-KWwYsfUnGip-Qff@ITC5Ts0BJvJOR&7d8>e9GNJq)ce;gQ*#J&f-{w~k!NzcT;F6lOR)1&_wL8pQQ6davfgBN z?>H$_GwkYZ_H~wZHs*>k&IILg@9=$mN#312z#NYJU=FhSdWj<;l+@s?RM(Z+OVVb> zFL~Z_rb<2_&vk&ZIJJ}{K?{}3sl)fON(r`~Idibb_6bSCwFq-;tx%LHoOM~pFo(OI zsX3eZ8_57%fH7A{&Kyb%R(bD&Cdg5~KnmdroJ+pwXam`y zlO*arDHP$G*TQ@CS7=B9K$A4Ega>wMKG)Cisy8#1D5B1xN!O1&AReNbg%K6hNGH znWc~otGx6=j`jH@uui&YfYS9uN^p(#)OA`dC6I6H#I?QT4)R}^0+1o07gni2#{+sP ziAzb+wCmY==M2=5IC+a)QXJS(o|GzTygG6Vo8Xo(bMn7imvt*L*6_>=NE`AKW)Ro% z%r5W~cnxoLe0SpvBd3CU>B&>POPxX|ZIq^gnZawkgJW*=ti)jod4Vg=8FJZ@Eaa)? zQI0S;uTajJo0-8G1x^o#=ij-7xdQE4<&aC9>vH*St|#sF($AzS&fI1DXV9;evO~)Xp5tCC)G1+~REG zJ3VC&unP8+0XUmt9#Jx>H2+Eu;G9&|?!P%=S&7GXRZEqG#Jw0-Mv?~TBmMOZ6@cvy z|4@bds3LP2gc)EFNa3*X-${8=2NX0f1&DvJC}k8r)$2h4%9_@t zu9j;&v8bcU^4zKksimV#uAsN&-!jIeQ|=)~?e>8^af`mY@{WZ%*Vv$BCy!UIp8Uu( z(4U8NNlLg2Z!l0X{-s6FU|fm>t56~-@}vc61j>YVxDIDA1&5K#Kwt8ol44y6$)D6e zscX_gLAwUHTsLDm!QK_CnS>Pc zkopX?8|Ws~Xq0wEJxKYup}pz!DXfms?{KImR+7I+`y~=R}s@C=bEbAzd!tI zmsz%zWgE#J$n2(Dp}a3QYMzf+-{O^uy)NfXbLa!9hw5hWgT$+|^Hs$P7;i`qJXi4* zeM54v9@c_*tN2B7aMsV1Gd_}fpW-LEP3)BQVfDOivtq|@@@>tQ{q4=-9UFEn*s)&U zsaddNzy6-Y^_|qVUfXpn?RUwsYpmCIjm0`P_`AhIUpsv))(LyYHk|_-f2{q>MjiWf ztkm(I+^2a4=sk%=I#%fHF>b)}9RJA!6UsN?lkr;kU(I(C9|i*clb>mx51(!4&&4O= zkV)UkFDHi2Q!g+3MdRp>K`$HkF3@La=F5}yowCGp(ASIvO`jy@lH`RFZKem}>h z@=v%Z>##qUEO4}I$N*~8C{wtg|*8ed2_qN6|m#Xfid`}i*6arv+9EcWood?D=Pp`}lj z9%OhN=~srYl^$q%S8>LB39lwRoH*-IrAHi|cX-X=!-p^5kK?;{c8;I4z?T=!%~v@H z=eKY{zQn-svlcGQ`J(5;&+~9T#|43aK5y6d5$Y`z9Qkue9h>}ge&rY zbvu5U^RE*BRSUn)cM7k`m$0sV{`gJ4U3h)c{Cg(NaYGKnjrqUv`EWz7kebzUZ^>7t zymnKI%}PGu#(a&BoLM=D&C0ihOwSrf8^5KMvLt11Zs}WdzBzZ@{CuEZ>!JjAam{nZ zZb|FN;X3WSxuva}R?!z)a$REdmo+S0k$>Ws=D4Kc2aJiWOB()uku%|vg!(5&`sb}ASoR7r@-NRJwyl}E zFUj-ByR1F&@`ibyZkw)XZMA}^l7xd)U!SglgCp{d*{&kZu=&%o*fR`{6 z`@jkuh<)e*7#8+B8W5Y76oVb6!33D&Ztg8?-jtffVTXOMd9O5L`NBVS-uB6}&pGp)5u>cqK=CceEwtTpY?F#{VyJT$mUfXkNO6aD!z$7FdP&QRXD0Xq4)#i848!xOSpC&IC0YV zQy)-#Kk)^{@3VYA^#v~9U%i0K=TqNX{Bxb(_4hnBDdu?&<^^_6;5uHR`1x`s=n;H; z{_!d1tXJvrxmNopFmuoXd{5mUfLVmy6ZqG!o&5vwW-f1bd+Oc^?xWxt7~!+a{G!jT zUe~}9Z(Qb>^4n#`(F@&O4bEvZkN)95p2VBDJ1;44c}~NvxCZM`gcRVsBnA95c{OXD z*C=8T|IBOWM7 zE3nH5a^k0Ru3bk;mPT$w!Xn_|NkD$Y`%@p#K_B1p4&5)(+J~F3XnFbKU%GGdkmf2V zYvP02N&U#1B?TfEx<1%5dB~qgpB$c%Mp;h~Tv_az7^@8A&02M^1|hC|O5CINcwz0b zb5=0=0Ka#@D;G~-e1Y-Q)jRl|lRmt90_)L>r|*s}lz%Wjz8tl`jJwR};Y&^LY4yFk zNyJ*F+G-*ukDfjRCY#w_F&%`CG+x-{$O&1A^&<%3sK~HBzxem|1UAu zS77I#8;+2)!4_d~Wq{u{zQO!|qti$ya#%EZ6;q98wF#Amzy4|OUxl7bG`Nwyd-H(WOyGP+aY$>$?#K|#* zu7HD5cpksL#n@+x*c+NofjHU(g5~))#!ghk)jqsFlv}bXJot((WW0~}3 zImjhW9vTg6Fh|d3^Sn-Z^c$AlB2S(Bd0aJ@yEbdJc|UFC`RtTM?dH;px=vlB>pD+y z?=5nGk#(C#e}Pr~14+_Av;4Qg3^3-OJ-#@*Q7Nz#Zqp`sRBCM8KV>W}nFN2g@JI(kvl1SEi%IwxsmZhVMG z%l$pz9|&;(6QM=SQ6^=mk9$M#D!hSlY3TeXUo3zh_c-fDJQxMP?k6DL*;#;G@@l66 zOL0Yh!WDRn8b8kPA@-r;fFtoQKiW22OTM*j<7HgkuJN)R+W*^A?ybpVKQ;HeK=)cN1zltbuh!Se+IKIDdt*c zZUZIMSiUR&mZVf&ud?p_;XI9YlNnmMz+F1X;VR__K8GB2pk8%Xk9x9KNs-S}X$zrZ z^p#fItAc@h)B#0cNNR@$anqcEe?i&ZNXT)XVFwDaS9?*gD+M@ocM7rTHSkKHJaO)X zGQ6KTili#6Ngft}L374lHANs0gXhveH=9Aytrqa@{`$%7K2M ziIOsnLp#Jgb4|K24~p476a&o+?ub})f~+D%NC~8rOXM0*0Q|uKPjTL<*~c_|sb(H` zHG!AG>)>bvc_BF^FEINu(>f!Qa&ME`)6zE{>}JWE5mK*dZ%Ei7lJ_O<<;mVA>>pV> zTW*rHJDKoyrS`gH{|fiLaQ6)M#BeVQcEP~bnf*$%(=H2T-_rRuuHFr5CuB-1V%{Ta zukRa0tv`4VN5Be(H+H^Z)aJzZdBm}2^59&1obX)U|7l^1?Gx7Bw9q$;yiauR4)*eJ zKMwZ%V8>H-)!Z<>=HRVTx4$MkzyKTfKlKfhPzA#5AnLv{N@ZX|S?P`WcP0aq&i=|Z z%vs7Y&_LlIDsVOfV#mbjZPelC&2mKSvZ&Gi^p}8*&r26r+^gEFFT$1t|Cwy;(7<=Zk zOFr@1HQ)Tf?_t$${_eRyCuP~Q-EXh?4Ka4)XD9b=FMrcxZMS~D3dj||1>o-QJlCC> zc{;!96U}EA`N3Y}SqWq~12Meo@Q5t<0ad*m^~=ML5r~(+UZu*TPd`9>8acpRc{u9Z z==ClS3l{wd`PQmfF26$VC6{!EfBY$5#J~6-ZF_U`1qZ(E0L8Gw|6r`H`7HqU{3plV z|M_NJ_x;KG4ullNuHW7ZHB!4@jo^zB(xY@ouHTT5M)~p|?I`+(8oAyzCaeqbaQ21~wDXkaPL-Fi1pog#g1FDzO zi|XYy&^@uDNNBhGVztbJdudCBMHbwS|FWZk6PC@oR#8|-bvEAcR4ntfaMB8%GgeJy z7Y7%{ny&W8z#c~HCeB*hVe6#D9lV?p=4)wL_iH7kU7mT^(3H2PJ6~vH#q*7o%^enk z2Kc`A`85M*sou>4T32e@PVccE0}kW}jhYqs_W*XJW>9@RowX%Y`SJ>&G2(qasmqxP#; zqT{MIM5K}Elv9YY7aKB+axAt)-QIk)YajBTk`FSFJNwmcf1BnCJFg=XB0Cc+DG8Zb ziP~66S4xcT%T69U3MzdmiIqHtJjr!;9V|IrDO34Pizas@?UfZPA z+QZO#X$LYZ*L`xermoYrs*(24e)~er)asL{hZu0M1ZV0*YNnL%aKA*MwMl!fa3jZ< z5OV#2LWYj~SQYxGQIyD!5AU7b7 zZ)T9{Xj<;Vm7;A|m{K`hrD&VDdrj89l5jA2R#`u~VkIRl)!BU{rG6+-T9ndAQ{HtO zcTh{M<2pL6wek9`v?Hua%S-EN+~X6yZk$$CJ~3Ol;pCIJr^bQ(>-ypjnVbtA<_H_| z;NV^pzO2#Z7C^gJ?ZO>6iy!VVPwv8b!{Ez1EX6ax7T3fnXX>VA?j}ZhuwF54c}ti> zng0_F*oSJjZMI(f$(i>3J<>o&Sw#z#Q&dF06a$oiVo?NXQoxN;LJ>HcM=sZetoyeD zXEi{KFDa8d9Vzu3Q{L$_q<3oLK5Dcr#!1z9tsGlfx!5xEY!B|GM$=FZqr~S)1&$(n zQvKn&?YA}dn>I80*yR8|;25p_2prptZ00P>skt%T&6UiIN?bMDktU922aOIE{c85` z7Su2zrH;N1(c)?yMF``BT3I zG)YLOrC*{RbW7-&x;o9NlI$4b(~)Xvfi3E!*NW+jiSNMNeg^KvAe@w5l|j&vDJy`d zqAz&Bi})Ak!W|5HWh>jJO)W()h8StFLYH^{?6^%C$BcCD-As#ob>J z%@q15R^@1=&{?@(T*31~Cavek}Vq||Mwg+<3v`;if=V7`86X!1B}XEApf hvxNDcOAlCDKJku*ulA6ny~ba}|9>Z4{ZD`P{|0!p6mtLo literal 0 HcmV?d00001 diff --git a/python/tts_output_46c5a16f.pcm b/python/tts_output_46c5a16f.pcm new file mode 100644 index 0000000000000000000000000000000000000000..1e42a4c8db13bf81d49c36861b81dbf35df96c39 GIT binary patch literal 148154 zcmZU51)LN|6YuD{%iW&48+W+7y99R&kf4DCO9(E9gy8NHAh^53!3pQ??y^2R^164q z@B7|+{C`zlT`f1$U0rRn^g#w7gOI_B}mFl8h%%C3WD zVOJsg9Kv*QP#`vG8_osR|K zct9{G)Q$&$()jPOv36-ZG69*0OaeL>P5{yrfQf)6+W})!k!g1QG`ln%#HIs4KEp0e zM`j~4fjkpnmL0PJpN-4~d=4@XNRZD3G#_9d@*}_kfQ5D}0(=qj6Y?{lpO7Vh76U8= zv;<%&vK(L;01THSE9_W>wBlFfHw4me$m;L-4Os)Q){ZsEI%GYdb;$1ke;^y|v;o%; zkvjnQK>V&v$}K=TB73g`)to+8iwLr`+W zVfYkzZjU_!`Cb6|nVm!F1@h`YX)o;BmmvNeaqt%)=S!e{26DkNP--pz%wF1&v$Z~0 z|4aMddkJzvJhhj3@}Iu}pAx>sQ~TRM=^2PW1mz$-wR5P2Zv@};0igS!JstysZE+tE zY#~Q0Iob|#*m8FO-LiAot~c!xY;D;34({j$*e_7J0q8maj9&w|Ztp+Xhp=y9e_jFo z+!}*DeHq{iauL8`0~hS_#qTz9-fkt(a-iKn4lU~Jck4O@EbKIpPXoJyRtIem+Ttl- ziO?dUbsn?J&`KS)dIZ=nwB3WidLa(laRAshwC+QILz~|VEc}3dBhX;hx zLO_e`J`r*V=qVvz066rW3++DiN4rN|VE3;-0{;qW4!~Rh=y_obdg4}JJnOrMhPs*G zJ-EZCLthR(KJ@euQ|;0e;Ps~h?L_-bFv-s09N_?*PvGn^0n8m^0pJ`o{(CqU=*HN! zkdL#^TBGc1U_@Al4tqFy=sS%Ia};nG=Qx-SWB>cFHO_&54!t9Uarh6Gb8r?4_Bab_ za>!5z2|*Z+0i3lHOoRVepldAw2euswxI=cdCgiYXVQ-N3(9ugUFAt=Uc7ik!(l1?GmfA^9G6SP}=O)!Ps!JOOQL;(Hg=S99J%O{=YIDdv12X(dd9H z7?p60x`D9@HE_&AxC8P;yzMd!;V6cq+A*^K8#>0lw|(S8j{qg;AspTTdI;z%AfTUs zDXo$}@GPzH2PuJePXql;uw8~}&>KPT6Z9W{1Z4=A0(}%rad&Am{~QZs;8&?OGT@eFX5E(1S(-8J39zJlxKs>^>Ie zgTA(nJ)a}*f4M_~snPaYVBC?rwFC?uavQs^cKi*P|9^8h%0+`5F+ks1e`^k?hg$fQ zQ0FKMpC9Vs6SqDcd{$Vx6)?XewY64Q_PBwjc~0?F@6kesIi6j`nx7F6<4M52iW#2KKb0N1?{i$FQGaS=h%=hUw52 z95HAM4$0B$&^{o7>>Q>A0&>_6jJ4X7Lw3x9Fb}jght)v~bXX;{K8HOzY!_NA)ciMu zse!=a1MDLp09bje)d$%n7>DBn&ato*Ood~mHH2dZ0?xLM&=-tBIJ#im2aGm2=eEwm zFb5oW|2ro;^7?^%aAZ0F>u8mIfF6!?nC=ZiIPM*B$9Qj*;d~Bfbf|6R4o?BS2b||& zs@wN;m;=TfUc=!_p!b1#hmV0At_mDp#}R{N{tL&GIBJ499qS248JOlsZ{?1%j#Y-k zPdWZJd|t=1KpzHmj`wrCgCo_E?x@p|yVd`}T+r7+?s!K>3CFWIG_C2d1z@Yfc7!eI z@QIK++7|XzYYrGX{2=TtAA8=`zJd1O=xZ3le68LSS_srZJApRR>RBBYvs+NMJfeXqa06trWQ-%$gs3)TeT_=}F5Fy_#; z{)JYJBfrCULt7691jE++aBT_ecI1GP;|W^F0(^7$R~_>SOoec~rK2t2TRN;Awj^wG z*h{c4V7ohJEQg&#*|9Qp%!AM_pmjO}g6mPoJPGGdIFIVS&#r1P(>hk5a5d_X{&z*{ zn9U(~%A4ml!#ZF(%;BibkxLJ9wb*k&4rQom4V&$0Eu154tq(qj0|rnt z{5uc^po34T|4%B+)A~0l@K*4>Xz-RaSh+&bpbcp7#y0z#+w8j5^(<^P$2uIgv11Jh z*Y>dO;X2T<{)DaSXjj_G+W z$_3ab9A}PM2kx}IfuD2+b|wKeI-bE%vk=5Euwth`3)FK}Tsc?5<#Tyl0awVCadli1 zXal&WZ?zKwSQuP)DnLzq#0qj0atYi^?iP1}JH?#@{5toXO9OS0;IH-sd+U|pjN>3U zg@I=|XTYh;K5$yG9PH_*f}L<*u(u2Z&&zSu+!yX2ZWp(Z8_0!mI!?%;9L~u&Z>}9T zfE&+E=jL!TK{$--#)WVij^y-g1)IyJvT^K3z*E_H_6wWLX0QdUfz@%HLH=XlU1Gr5 zOD)nLJ&&T;N-P^2fPcV;5%&l=xtM%JekQ+?rDPphK<1G(WFy%^I`f9`M)CUa0(tqQ zmJA?d_%SqtQ?MQBuGA3Ac9YonMt`$K-yGXKu6cEHRrCCohL+pnH3h`B^4cSQYMyeo{jC96!$x=0in>wetL$z_)|RWV!?fvvL+ZqBZ*Eb-6pk$o()T~=bw@&ZdqeAU=Si{ZU> zCVLfI$kT|vNyjLgHP2l_yt?>*3;rwOT=d3vb?qm0C~0>r=6KYy@PObS{4e-SbJNSG z5HoCKLsMQ;V&#W~XW9qo1M-Q}ivu6EX|f_+^<#Y=vx#Wo2Z&>2qZD0KWtxt z+xsl>o#uVt%};BQ+(z#h9#(BGn3;Yiapu=SUymo;OL>=lrKnxyzJ{g7UQ{Rc5mv+t z5@U)r+Uu^)-q!+*p)VtUj`nLiw(Y=}p0cY>xgh`ed8XC`H8G@aN%!!yCgQBF0DT3LhKxTi7tafy&pQ);C4F;s!lQ zzq|fsx0}Zv@!o~R&(GRl<=nhOZ#H(Ks%%+I3nJ#rn;)v@QI#YDaB!gUooGev9uCRV$~tYW-G(#E1PGdLY2;8LjInr_loA z&4!<9PL)k8Y{>mF=W*7pj1Fm;$z785sq=Hfifb!(H#e}T=&|BQ?Qqwn9=APTcz*Fn z@EGhJ=3gFE5SkW#HS%rrr?%4Q-4XfWdm`x2E+HYI5h4Dr5^|W~comv0EuZ>~LY<{Jyz6Gkc}}l2ji5Az@8gP5#J=PK|LkO7KeIt1j03?yT2MbGhew)luT-BEw zt~bss_sIK@HaJ1?X~6sKAJ{K08RN@lG`U-3+-=?%@nKPm;GFo9@~G~L*V>@C@I6s; zqmRWTL>>!F@fqU(N66vuby3SY9O#zZ^G5d}U4M`GS9zqlrsz@H=yxX`G(7J8X7`63 zU)!hNOm6aFl2e~F2A83{?2OUa``JopwyLkPH(sL zXlgFmoc=JL{S^C&ic3i_C!fpuwYW?5vD&O!=cawudemL;K)%~G#@`UKI=mw6Lhy~i z!eEauL&)CHy6DYa1A6Z5)}eDn$0zNN#Ymzy1XpWLGnsX}%Va4xUOsu0{ao_u*6U@T z{{6B!F8b@5)U2#Qc^}L4h7r6)MQ%>Sj>v$R*0)$k{gDj(o9!hOGQaNw}OBL5wJVgAQL zVxzBhP;@-fu}{~T-Hvx8qUT0QqF2Re+7(9QzKikUHQfsyq`i8pexiEu>!{_Df>q>kA&CF7bekbgM$^gQEs+r`s$l54i>2#-k5m7Y4Eliq`zl5v|}UNfq! zOTqQb4QVsd+hi7{MkJj7*x|#tFDueT#R;|3%nEXpyipabx~$4{O7y4?m>e;@-G(j! zJw1C-T~Bp*+BT?zrsLdBojW^s*L72La*w{{na;Wtb;wwdmX?t5{`!ZwxGP_jpNV%* zo(dlsUatNYRPt9th1nl-mu^r#l^v8EQ%rQp@F@G<2`;+)&r> zSIws4eVM^Y$3Moun(`v^^~EobvR+oSX|y(%7&=pKXb``hT;zHy;Lj+Z_6s{kbPVq} zyi;5!ZI|D=o#?%{kAH8x$Ez$f6V%{dSRbz3 z^lxQucE{v}@k`@wd`V3TN$Z<2B=b#ndfw_1|Jqv9KKzvIjq@3g7e1%_76!Hrzu2y0 z_om*BeS7!w=-;Qmd*4aDKlj?vyHn4iF8R?(?lZZ{^1z~>iZ&Mnrd>$*{HgD|Ezbtu zAAaZhgJrMr#3wl;i}n|$7PYV5YRupYg?rVH+&lRW@t^Gz@4nCFo{OK`7Pnt@LseTv zq38tTn3^BU_$3_*K4$ew+nFLv*_pC9bznwO?u=63x_QQz%o}``0Fe)IHhIksIvDw` z{fVx|o~3_@qfmTkNYidQS#n`kh&668WV>uA@1>O#JP&8PWxPEdd&AY`+(6z4*>i27YlTOy*CXE> zf!5G@krSiiqrXIp+q8+=5O&yKrHd19=cV&d(F(yvyqG%DoKvl<;8hH&GE_NLCYGKr z@+r8Pw>2-l@JLz5nx6HS8`A4-_4AvC7|&9_vVFK5wuQOG)+0lSuDl|$1KEuC!pC6* zIDD>QDQ*H<3s%U>IhJk9@sOElAvOU&hOI*1A{z8G+6#M((O3(n!+*xrL@9BO^y3}p zIrDo04CX)Jw-c-o>=P^$Lqf(@nEoO@73R^wpM(wh?SyL>R zEL$zdEa?^x>rm?t)&Og+<)mf5<&CA@I}p{%i=zg z9LZ)WUp7lNL6#+rk)Dx+NN$Ux#ScWmq7dP2em( ztGm@;$+v8`#0U(Ua`T)A7IYe-RW3yoIBL`-Ba` z38M3&LQyyIb@4Ot6mfxQoam!4TKHV>v%p92p5L2)gQw*!Ba?`sL^eJV&&JkbB=!?} z7Wu-7xRLB;<~FUOFW4e%C#Y(x(%RMXw>jM0WJ)yMG95N;HBB-pOmW70Mxkl9i7|CD z&olpHcC*A;?pZHT>ujCrP^K&E#}#vDkag&MY#{DN+$B87U%@JV70Q>_f7I(wrv75j?-e8|GJ=PYViO<8M@CJrt(KUeG#9XcqXJwbL7nm=!hCXc@X{(}^P%YNO)(O_p)>YPP)>JD&4Wh17 zZnjt(O8-p{W!%^rc01T3Vc=wQBT|8kMz5lcXaF_|TLmx+>xB7XZde%B5$lPy!NgcO znv7PVT5LSF9lMOZz*4YG>?yVbD7F~u21@&40xSugiDrR2 zz7t?OxrGg3lbAJ3JEoStM6aS3(JSa(^gFtm7BfFEub61|3hU490Xw$|;BI*@xHW%_ z)Pd0wjkZNa=zDO-+ZJiz?sHqXDV!fy#$INBVmq)-Yydl&-OS!*D_K6L0Q)aK*qN>7 zK5z=K$GeCWBYd<2x&%FfK0#B^GL*oCm<|1c?nC>c&ERW;-@wUhF843Dotwl(f?Zul zZX)+9*zcX--hy59AaJiwpmWfh;O)}@%25-_fObkoFQd!Ra5Nd*Ylk2y+$t`Vt6Wb!rU11cG0G_~^`^xTQ=drWd#q2KdcGYYcx0HJXP7Zp2uM#?;k5OOjH|!MX zi{qfhcY!_R6f6`gMR$Q(_JaNNHEurF7I>mqwhK$JdCV>55Ob8d!;~_C?C(AnT=K7l*;0Hlt)2l7q> zd**IjG#9{WL5(^toEyab4Ep>&*w=HM6r3DL5gLr}Qtm5v6Ik|fuxo$CrGw`q!Fd(D zacOVA*^U6dwTb)89p;vR{u%@J=7YGQ+z;TLH*klzOWXr41)LlNgFEjT;Om1+$a~}~ z_$ugu&w3bP1}OAic;`Q2f3}lT9$J2Ks|l9_FNROEm!bl!CYT%1lN!2!u0|+ zF%+Z@1bcU1t~@@!?!_cp|wuFzZ+7N|q#H{AER+_obcAyu7HScNB5TY+zz}@Aa z;k@xXw%GO!`+;($QZWz7W#nh0 z6;oh3R7R-z8Avjk&AD582qOh|xclT9%9s7d59U9z&0~`#GP=f6hO7ho@2A8;<2)u? zFqs@g_Yx%V@9QVpKJcxAa^!Jiv^f{^=UdUvbR#wy?M0Ld0t|6=7Tz{n&*nJmIZ3GK z7B$xJLa;+xLs@wOd3#j0!wai1SC7sDN4LtaiWCeG_vd;8e*o(o;yU;4K3F~W{Yw#BF zc@ehLJdrJhI8G*Gqj^_ZKE^}dqASHFo0XakzDYv3cGh&_D(_m$Hf8`@ZR>@1BrNnE zYaYFcJ;Aqd+p*_(Zp$3gGR;};C-Vk8g+JML!P3Vj6Y|I|$g8Gf>{dZ%J!n;8zF=!z zv(;A?!WHRN>^A--?2vw&72{Ro?aVik`NB=+)tCqyL7qe>nyUn3C7;acWB?k%3m{+U zkBi>QchC~+G`5}iAT@`b!b_tUVFUDeB2>Dx;Tzf&|I6l2enOqN8sxT#k7(6xEi0`3 z*dUv)xFnD16+YGYHMUAf33oq?}7&e-iX=T*kE* zL~wiX2J36~BEK7ciS3NNKzHz$SqEFs3yP(creO1rqVY(I`6!-BY_X>C8d!DneHp>M zX!uGh6@Tk*n0-_kbW!bI;*j(yG1hauwZdcQAJ{oVn(dLa2)%$^;DolRTnH}& zs}oKXG@4ROL(uk;DQFkci~Eb>(Z^T={}-YMdePbmi9-gn=g`YUIC`Z;#_SU^Rvmi= z`xUIxmSH+p+59&e%&RdqQf1a5v=n_upEUPj-yxK>-0}&j#WpdQQCCYby-)g@%%fJ} z`|!PFAy)@OH7jwP?kD$EI5BI`2vLf7zR;cj01M`kJc8GmtQYx_HfxX8V>QJ{QK9h8}6d7)ld>**y9=NWJhP%@z~rf5S+X6YX#Uy342TuMilo2%>V1P%EOvm5m-X~uQdGV~_?o>kK(^a}1H zd7{!0&k0V^T~#7orLs7u>GrFhXc)IJ@9BP5-SaiHS4r@Dk4zWBNu|!$=(LH-sgfol zkoZEZ<6M)W zp;^cGG(ylzDKiLwn9+KO?7KWFVso0Zl( z)0h*O_ghX_R!sKNe6Mm{-H-KwbpsmG3>edhJ;4*PRBQ+NO1MXQS$R^KBJ~lgWp^|t zm!-P9niX1`GwV9ae|cbzr`7$qPsiXjVN?A3YL>|Jbz&c9*GBPCTmxph&)jiavGGWK zL3wrQ^@`6WvfPE4H_|qyWTbS-9GQJEjZVVS?-u5kIhB7aT>9Z+# z>B9E%Ulbzg8tG?wx%{nii29x8j5b5_mp0b*jVI-m?s?a9hfi4Gk)W%g*};Fgol@O! zN%o!Kaa8e{zm4pU@8j;-%B?%~XDZtjZYUa1x}z{F^Ja2TqAk&qd_7&5Nv7^gHm2(e z=2kqdaj&)2{nmWKieg>)(*&z|p#rnylya{6p|X#%RH0IQP&BEpIrVXh*SI-P^Z3)} zhVMnMrQSaTED9YQ9Un@$R4TmP?)xA1>Zj2O+oIRli|8}n(Twh zPzBeXnqXK`f290qQIEnO3TNf+OG`-NCsrk0PNtF@zMV40oE+Hv5$o=1(uoD}J8uo-sW6K;rZSZDQYKW9qF` z*VM|iJvmE?(W*K1(ajz8gyj#UD?eSdMQoE^P?RgKCI9CCTo7H7I)w{;OG;~|k>xd8D zb(*spv%AvU!?jteMb=p~R3UxV`m}jSWqE#=oW{H%1%liM=}(ikCWyb0>E?_b8Lu;b z&yFkDUfQ*)z7E&7vz)R8a_fk;q7kxH$}h@PWs53Non<$wG1-9wqB#t(bxP< zl5Gl|N}(F4TB<>u^L5u;1kOj*6Sc2hrCywu+~=nEd7pU!7sJQ3eH>cp^t-gL^B|uD zPam~~7-pSsE}-0P!R9Rup~Vxk4&@vx+*4rAR;9H`?3d6bNSgRi`SS|z;B?dJx${fcpFCE1$N1j&o9y2^a7NhC&_s`3N?etqd+K^hQzi6e{48^* zO4|*~FD<`TbuPM5(7&W@>G;BK+3nJbQ!i%i&AXjTsuzD5R`+#r-m6;nvI%8C=er0)4^eLRHbm zqLU?gl|{9GH|%cNZJKBy>6d6RxlRxzIw+CLb}Dk@bL1+8Qc)s5rR=IISB+A~YI)AP zT~gisz2RzjZ&e810S4;dz2#!btIDaR=cL*%$E` ziH|f{_)aF1|0^9Ji__4`o$BFEe`!ZLUveJgy2bUJ+DSB2=p`rAALYKncw#cLh}(k2 zVoTWP7I4SbxT2|ZldiF(?tGP`+_mgc`GU&rmBkf{E7w(f*W&dZ8yD(L#v-$;tq0SW zDdGI_8)%&{9na(!3R8$*d9y@2q$HWg-!0P%6L=4$fyxQ8Wa&-$5qX{Bka~kUTYX8{ zLE1s^K`>taN^X!m6AmW2gWY&AaU4Iv&7oopH(T=bPYq3mPtApOe^&3Q{#^UAVRlpZ zhFi7b`hObNx40M)^M2~6MQNBpsgP&vV&orU7?|BY67~E(*m$BB?>3Rm)S$uQgXAK9 zA}<4p;&o6w6&)g-#oxqn;x%HkJX6*p4V7l_=Ls}IPB=i^R;cBB;qKUOT!wx?O4w&M zIYpZ^X3`pMSzx@`?AF{%uQGhpFVq)-^>MoviP2&iVP0TfYVK;;LQSI1TZI&ZY1nsk z3Vnc4qdrJKZZ&T{dWD+6+~Thh{eyPkNPK~CKc>g|{Q0We1kE%GlI71OeFbIW{rq9% zcwwffmt?kJHZqMEA_(JYh&r+>`IxP-wdML_pO7Jplzu^ZSjAS8Z3Uff-D8e4^|N@J zXPA0XJFGH`ueH$p(DXoJRWK6ZjiNZLwqA zbN+JSINlXv7P(HeS2_imh0jp$0w<2!gj&HGG8BKt8;5&wFTq*kC3Gh*miYqIqry@g7$a!fn)j`6Z# zIx>(9<0_dSkY(&ChR+QVq~OnS6T1&xD#}9o5Jv>+{7d3V%`~H8MB3cifef8%qZlAXqwR1Jk+)W%i)b@ADj82DE=;Edu}}O zm>X+(#O@{Qj9=JsTvsg9a*UmcU9n8&CezCi1Ky4`wG1O81&f$FhJ)w=fr#6~JSOAO zH`HxpB2k2FX9KWjym+>R@nk$D)#z{ZabgKIjo-$W%UmYb3Jf-}(MLEK-Oh%g6VZBb zYjqbdwsGJWSv+bVGJqS*ZN!#x18qtZpWj{l&GK3QlI(Pe~z`VV-Xu zAeh3>)k`pw!Ujo_ndwxzr2GTu{>#kLsp@V>(KHg9UC zU^!nw2N-AL+59GCf%%G%$BnS)IF^`=U*vjP_M_f(A=e2XWR50w6E&uJW<=z|%%c`@ zGtif|9kyrWc&wWZtWXgfbCq`z`)HN$lCj0+Fl3UT2yH_yv&Jz}sS|yfn=WuB53?52 z5w=946W(a?FhnR4$h9rm6ssP|Olb1Jy7Ca@7~K)IkoTL{F$1MM+irR>=fz-HxOEcy zi@<b6>kD<|6en*x~eqJPMbCX(wSU@R`2n=lz2XZ%Da@y{@!%x(N6 z-WRc=w+w~SH2z+rh_#Xf`B_b4(cc9j#06Vh$^>@*J{DK&b>|ZL;Wa}Svma3+m9p2ZGbDO)R%2hwSLIX5ZR=U1iCl~wGI}~FZy%4{$ zw55j;k(4`f!e&LwY|erXmYRmKGM?n0`UU1KqPKXorN~f%=SX6$hQ_&wi>l7{r{2Wh zMGUgWv$ec3gthfVIni9(C-V|;HqpgehyH|jMDAe6+3{Qyb{qf3Fx-zsF;dRlV_0$y zH=e3QGq6{-jl8QIX^A}LKpNH+ktlwMd+^#jn89xVDpF(Y+tqzjD|7z zL?nl)pj7A~{4ra>e6|e&=eO}}v9*NsV3*j6iE8u%yU6BYU4vK3JdFFTz4?)X_j-3r zTWKXehRUaJ5GebVd&-Q$M+9nNJu+>3EIEzm|B_-}+N*U;bhyL6l9^qup5#w5RP0=OkRuwNMEZix`;WydZvm zgBLxL*h&?#)uJy}F?|pGM(iYWiZ=+kjOi>F3=^eq@PF_Yuoi8DToekhcJzE+jPWQx z5xWe+M`aE4?*sYL?uTqgU$B88HhB|&B_nOGGj5J0` zq!>+$cnj#h=0b80T}jTgdy1MQDq%-+8_X{Fc~z82 z(ll9BNZ!(iGm*kfO9(HD^rPQ13v5N`X?lV9IXI)2S>-k#evIH>w%j%v{ns*u$rq0% zMzgubMQBIlHuIN|&o5|J+hmHBmd)fEWC^Zfc-&I-60u!$-_pN%8|I=)Hu@U|k;S5Q z{N(E8yoa)V&2RN)d5A*WvX@zmw6(P*7h%JZe*CYtF-C^H%0DL%QLAmK94)@CpKg4h zo`^P@adRdyN_L#N+hSyUDwnnh=qa)}g32a7*G012bcW6(?@KIt@0M!(rhFmyyoDv+ zh}W3%O$07Mw%Zc$_UK2;MDjJYk^RRMBV2$jN7LC8$X+2F@5Ey zVddsjr4Q#+ahZ!I?}_xbVvD=*0c9~9!U+-;g;+vt9&88Z88{uC!RyOOjTZF0>{bhb zjRfnc(Rhz4f9$^4jApmo5yZ+487DUnLz_h}xL|8r@gr-vb-JiO3w#ok|5-%J^M{OIUw8fr{YIuucG{SqbK+L}%`pwSwy-ILQSe^Q=nd7xgS|j$yHN znP>$&-a1ed$*eQ_;1_MvnR&8xqIaeNrbvN+=}vhI&r1D_lzxO@4Lyfhh~)8;7#H(5 zp&l`rK66&=9p`O{M2dNO{7}mcO0GoM%lf@sZ?=W-!IxSVV#)XcrWZX8MMa(Q`<7C6 z5xB!y$czvjrIjXzrG*T7!zM+R*jCy6(Qf!mCSJCj%4~dv`=g668Gk76imeN?l>P@9 z&%c5mbw5&!Kc@GwK#>Gc23Z02XSqBM!vi*d7M!yo}EN+@a++>1ylZggKh;f|EI)^`7 z5kO}%88(~cHu^6yO0WuVpi|9NOf=D!2m^Oio!B2ZrFod;fOt0PZ5(IX3+^DEp_@?| zx5v7})CN7nA4RW4v(PzgklBm6#ox;N74ZW%bp~cWKA1O{$+i7V-x3@pos4${w+WlM z!ZL;YMi`hD+=cMA^|d8oS;BFa1=M(K1n&rW(ket!h~dmfs~e&d{K4;H*wUiszXLwF zCwi3FMVU>nurRb4n~UkV<8+CUXNkxBglBnPOgY8s2kT!F^8}a3)!anu5L3J*lKfYE z8wsKo+oBmho6ZH{y-9J7(bz)fJ4&5701KX6}ovv@yi7c1ySQsNH0v!ZD%TZ z?%W;vH9nZM;B}Z2X&?__@6i+7edL_*Utt;Q!Ya53?gO}cPb7-4u~bKT3d*p}>{W0t zY+}|kdEj^U6Om9fmF>ZdwhiP;5S9u7ciqjF%O)Mz`&9%u-QlaRgPSJ^7P^SQA%IUrH93AJ9>H5HPockngi^5&rRW??6Kz5&OgGOS9 zEG115)(*6$Wk3a1*1P;c`M%Oa#nFY4IlqEasC&6<@;4WqD9Xs2RWP*TOhZw_iH5t) z3(ObkBkXphJt-H?7sd%K;=OXcB3FJy+F!O=u|m~LIZ*yuF;11GYOk8D`lRXVGTWt5 z7wUe%ljjxgGt7te%J6C9`Be2xK2htgP8E9KADLZNn<=EFd;PYW(G`OVWjT|xKWBHz z-kiBL>&)DKxX*{`!_=XWZ(SJAV&PkoGG3$-77olRl5uvRifCYSA!Whyw8T6ITp zNp6<4l{rgNL|etpVn5M-!35zm$#{9K?2~+o`kV7C*8}bb&uc#M0qWp+!C(BQxy^Cj z?W%G!s7FZFkVDxn<|q0;n$zpz%02TVGE8Z~8GF+6lS|_Lz6cVQrlh7X&-BijTzI*3 zQ{}h@-1Gw6@cN?+xlhulXi$Dt4p+shdun>C`zT%I52dffCk5WTt>o{-NX!lV&l0=w zIPyBL6Mwa^Nj62}t*dpr=N;t#IB-)aIEIO?3;E`;!Y$9&=)2f?hU5+L6B}!_=~L_O zRhAcz&+L=5A?alDj-;t^$b0|yIbUz3JWfqYU7j_fsI*dFpP~OoZ9y*M!Td^TckMUl zHQIjadQEqopN>(>{4ORbYWtC!pOuIUmkso zeJg)k`gz2+4k<@d@ocJSakX>vQ`31G!2^Yv(mCo=x^u3tT^_jjy6$zoNcS+eSGv)feeziGC4rT=ihQ(nHCy$K z%?F#TjmI0iHvZb=W_V(`L^mNJ{9&@onnkXsy(a~|iqOaSc0AQ(b{BD*4M9W0e~exk z7~;HJ{=49J)Q?Wn8!FR_X5~yto)Q0he8rcf4};&ty?*~8G5(*VL*G89)#r1SNsYzE zPqwaD7vUHA46V0oH}`37tKHH(W_pFYk8$d*JRmiTGWk=nmGm~t0mJ#Gvkj*jHq`%J z+o#s8fizsS@|i2#CUS-Bq;rCMw$I_VzYfx9wZR);c?9S&^NJfN;zJTu*Ke$cO4bp6uXNlbeoA6nzuT5uO)-t1UZo{O89rf0_hYcrNJk57( zW01vUhU9~0w(Cz`hJf|qZqYZ|59uUqrwKbAb~*Y(#3C=s>5a0dxSSZr^7Ut{lS^mi zYcsr4dL)H@UH-BB-N*NtanT8j5}cA|WS9!aRnDl3Yc91+LPiT7$|UNkPKCODt~w8Y z?{KdJt|?ASHG5QRtvODqPg6XpRsuuM`r%NucUAO3pwT$MX zX1l75)WEMIpA$n7Puo$8i)EVWhJKsg1^nD8)fz<4LX5nxk_>s1I@dMdyI;VL;9g-T z18HA<;Jxt40gv56b*0*)ikXsKWP976#(^zA)jlu1S~w|pQTmPKY2O|vJxN-XBumWr z=95*M|Dqtj_>ZcoP4`S+ZT+}!_#I)bl&{#P-sE&f`$WA_W6`*1{!)yP_zU%dm%J8q z9_z$J*-)#qH4S{_C$yo=1!O&0Dq1GJrx0m(xV!o2{oDc-evzK6Z>KQQzmv-!&dJWN zRQWPYxRRSlb+s&Qo>o1(+_{*}k!5a8UzfTkg-U+$Eh`z#`ZI4VxWTwtF{*w*^DFRm zDfohhd@N`dEs)<=g{g)rFN2%Tj_N&%XHu+cG&vBvi$rnzm_^J+<}nk*&f-Sn zAp$q?C`qGyrq;u?-hH0;QQx+%i*$Q@-vs%(sx^)NZBLdhZ%dv&?{>-RYWMnCjoS>X!5P9m^eOnA%4W$7sX|&P zqZDb1A@Z-%DU!S5o1#4a0mM$rb%~;HxRwqxvYq)YJOTDT)VAYSoFCtv|vz9WG0ir%XZ6s zkhdduQh}(ffAz$gsSWK65#~hdFj!OlL)Hu8gq_7Vq?NLB(kaqa(zTN7;;Evif=XUj z-bQj7F`lpyF2p!+W|uCSBeqIzD_u3t&ds_p9`ikyXqTz4cs=lKt6C*Hqe)i{m&A$E ziC@@fY&QME(5LZG{if<&rK?M#OOS%PYL8MdIKgoKc)>;CN8v~T$6qR1AbTdiBVVuFs?Bz8=d#6Zi+7xEhGLKl-|w9BTJbgo zu98U`g>%3cU4JtHtla9YzuPpserx5dipiC~mezou;PnGHA-9V@6%8&*Dgk%tHT>GJ z#xu=}^^AEhJ(e-EDJYo4$cuttK@9(Qfvf0^aIkQpaIxSsuUfEK^t*7SAYZstvQ2(U z@j{uW?%{k*x5>56%joW+{8@X{hjzawk;yYv(efigq3}7jfX!rV)Hb8FS=#7a-Laxa zl}p9(!s@)p!dXS{iyjsAD0)|Xx%}rUOLb&JM3bp0)aYZ|MbBq$a+k17g5cNjbNGV= zeT7xR>7vo1+k$U=SK(~2Ui4hpNwi-2Mxj(XsV{3L=z6>S;?}`C#yv|p$?1--((MoF zC)pykRJKTTTwp*CFuBY!N^RWLe71gdm0RVkDrwpDf?4@T3X2QHMO};BinbMBDIZ%^ zSe;*Ypz%oadgCf<8@dnU2Tlxp$-Vq&zK}msa0L9iu8k-{^po(o&`tbALW-Y@!lgRJ zT;(sSo!TPp4&5r3Ag_s@j3!sP(DSa>0Y#C7Qgu{>iAsep$Sv%0wmtLFEY!Dc?pt@G z@>~^B^{luyeB8| zT=|uP7U50Ndhi^Zgt?->rMo2=Vn%ve;jiqePIGDmx6ON9O1!jQDcW=u>9yADlk#`z z9d)AOtLUMyC+{?OgPp**S)BE$O=We?)$gjbl{bp%0&q80JhYH5{7}?f{IukB#eiyU z?V-9y4LL0drt=n?btipyX7RF$!B^8zxuhS1zhLQ<{|Dl6SfAYT@tsKKauM`xPxHi7$7m zdRkpx^SD7~SY_^O_Oc3D3px(Jf_EZc@rwlkqHUsF(Nob8ah4=pW|1~XD-}c3UDQuC z#k$q5B`$574pSNh)a7%vn4ACArfyou~<<0EnRv}x*2DPAb~8wNhTQw03~;Tm9C?7}p&q*PTNM z5f`e&AFu?R2;O#q65R2#gltif_-|>0L?eAGcPnS9=4!tAhw4`9`ssUz9|`)SjL;T^ zZwq=ONtVsjV2WJf6=7da3(%)7fI<@HXl-@Xv+D-c-Kmz8&MwxJ^)4G&Tw1iDcx8#G z>|m9ps&mZ^!_WGc)>C%W!H0Cl7J3$1k0xO^SQK}NAX2~+tPxP6^-_^^fy6Dlp_;8q zQbqau>63M>19Tx|#Jhm`s$Tl}k%(@SBtcoEStCmn4ivOzzd+wI&&mFt^LBwHzW!KU zHSC)XFPUGmsQgvw@}jB5ze+ZhjwuhQ+EYE)@UeD_>6P`CeWv4_>$LAX%|eXGM7#@U z9`_p0#Gfn379@-INIFO!N}kCVsh+5|tJ%87fX;fpeq#8vh&caP_13WLNULh7WP)F{ z_PhA4aG9`x6^(k37vvIGZ(Fb>zwTaL-`bJoF~#nZq2)u1rxo5P`cd+{q<#6=N_n-r zW>;++lf#;Ae`cTW%<#QnEQ|;=&Nplme1c>AGX8j>8fvfv$w}EVWwbg&#rMbb5A^@( zUk7iG5`~3on(HEC#)Qt44OjYfx0Fr9{*s~m4`?_x1u=Qg+nYBwnuZu}8DCdTDUlUj zEiEar7tASmRXn5QQ*mjTuxdaJQ?tal9P*i!_5kN9Pciw88HSF*PT@_t4Lm7-5#K2g zio1zhi=(8ea;@^aQlM_{-#_4u{$oJ<(9e;V^;ybCA&+Ag`y-M>zqkHz@@C?J;y_MM z{35oFZt0OZ-dmd0tLpzYCYSdqVwGf;RTfF}2NcGY)EA*81Ij;F^{(kt1ERQfwf%_g zhGQym4LtT=kw^Fo&LG}ISPh;F0!25)wL`50dW97rHRJ&IO4|q1?7HOogNDe`n}v-foytZQPRajV z)U~)-(el#OmG`RORjsLUnzVMWEzb7ZwT|ipd5<}02>SuIBQJ^nLg*465xy2bkm_X{ zWi^U6YJs{;dn^E4d;yaK$3>=x8&yf#ipZ?6J<`MSK>zltK+#Vz#mh&#qI-}+-#G`r z@svqh7gzVa`cMhKD5CUkX-z>?0bO*rxV*SsSxsfjnr$@)YQHs1v2U|e_LH6}YCLe~ zx?(=qg}u-F#D6J>7Y-FBi}y*Ll4(+_B1U~!^-7zl|4UyGusrB#bV^7!73RM+c3x<* z1W^P9Oj6Gi9S}F+i|`BRUBu!$>?pKuHO1DgGzM2oOPUtmD`85M1)K6m6>TeCTJ)+c zsd9LAWA%Mwb;B;(75i|m1SznS2qaFFPZn3lAcQj(U6t7?mS zw)U8g8@NRu9y}vb68S)_)v}^`MPFB>N`Lvi_mfITLL%!1YbMqdSwwVl&2MaCDz1$; z7F6FU=~9qblw49)&^a$ZKd|^!@zj!(@|M-5H63exCd_ux@xt-TokLDVzMzw_`>eU# zL;NiMb^cXhFVTCEL3~$oTXJ5Ot30pHR;}_64wxR8s6Q2^j{d2ir}!^8FOJg95x-N9 z2zaG9FS#P3*k|y1tdY9rvDptbK6xm3?37mq-!ppq>qd>>n4i#D7>0VMQh0s!FGHQUIF`}XI+){p_UP~QHBqO zo0X>um*u}KaukOYNb*k?s7uj+YeEn~X5=i4?~9@fdL-d09d zWtY-9ZF5Y8&5K{;@6O#gc> zEjQ>)KdmPnE>AP!E9HmIWgX;9;l=X_eu`j>aH^=c$SUZ=?=NT}93{9dXb!c{72y_H zYgLkBnevGLj)3^UwZRKx#s@u6yz)O3w!QV?Bf^FJ+nf~kZO%gO zE{;DavMO#n;T%~D*#T*gGB4nG(8b`j5sRZU0_56{5ot|Af;T9pD95VKs`c{wu&@8Z z`^IWrmh4O~)`3lNfi3Y+#y z@aeEK5r>=9MVs`Bz@AM8H9>>^Q{^g(6&cD4Vm=z__B#4Gw3fK)cf}V9#^hYhjL&G9 zzBy%hN@7Yt8j*E6zgyA5l4%u3jpOZko@ifhio@zCSS2Zw-k08ycT(+FT~SEo&!k52 zT;W^Z0*(bAgsnqrscF;%S`W#jp6EVoGkdu3pnRUntUev^F?3_}r6z$bHpDFtHHSWp z8yxpD_>}gf{Ec*#q@2HlinrfsXlLG8iHp_R=8e>!$;{7@KX3kCpVp8j%es-* zx71x(Sv$9(pUXlnL@%)6mMs~jh*!^2-%xE(pHl~_oU-)yiHoIFMiJ`+U$1ab366Vp3RTYZg z^G@S?eP0?^*3YiJT^UmFHseC-vefA07r)d$u72K4h~XV%ufY~DJz@Vl&6Vr$*^PG0ao>^XI_+6ToTjH>O*wY{ zaLEAW8|{Aq&w{^%&yQ*vv!coVrk$I#jbw*%gB1R|luIQPe+9cK#-~d?3vG$!amMOu zWyOM$;YFhgXBMUxCKPQh$|`88|Z$aSXq5Z`O>OK*vHfUn4xO~|R!bQdHQ?S-eYMsQYfkMMr; zJAo3RmJE?@gVe=od5nTo5SdH1UGArtr|6=%A`g}CkzJH-l|+kg3;PM;`A+UX924s* zB-Snq08lgmJeL_lqfjE^ihc-(32OwC1-tqCc;~rq zVKw~0x`A)PwxExY_so8J1l5ZiN(}P#0{__=H|g5tigS6K1Gjla^yb~d|BBvo5Km>wB)qq^x;h9jOVn2dpw_0 z$G*e1U2YL~FC5y1Tm>G-5C*vFN)A$?wJ$${vKY{D+f4@G)PvM8*brAm-KG|0M1pWXo z#3ihDtO=~OaIAk=q3p@*f8j{?z-tCOhHYdWVFk0U+wc_oAWq0Q`|l^(TW&BtS8PBkBE;% z0l_8X$+6^S@-yjAEdXBv2Qs-1dM^`>d_?A;agcpJhPPmqvyQNXIcGRR?riQgZZ?<0 z^WzD4M(#WAT5e~q8}j{4IZxTm*e6&OcnAC`))Ko43F6mC56F&AW6Y3`?gUBQ0xE?{ zr*hy`K$TMtilW#wkM>dqDg%_>gVZdlErnAhton?XLCi&cRGwAAZtf~Gt|eV zL;7|Nq;`8lYOk0^nR5CE{S}-{7I^U>>pKFHwzru=h7WYD?m(_y0$J4mvAUN-ih9-m zv$OjEp)vx9V=2sYpmuFz)S{|8i%%r zmp@7(cBB@LVmpwqTSH#hz`SM-!+Z3F#Ic+~m^`|Y{y@K_UqE{KH~kqB&=oXADuJD$yM;P zLg4&$f$j=BAhrGh&Py$Px;)69XCOb|`{DnmVz&pH*(dm$H<*c#Ebh+uLz-9wX>}Lm zr~`l#5zKUfd~i!<7JQDw%mrYb{f`JI0ggg1c<<4W%-#cO;L~uvcLQsD2{IMVVN;-< z)xjq@13BmzNG|&^tLW2ADC(wLknX)G0p#SK)lDVU_}O?GSR8IlxQ+*I7362GZ0QkQL}=Lyh~r4UoSS3J)>cf3~!3%QHhNKb2`vUT!9Da2x*uHtUxy&e ze+shm8(`GcGT$Mi{}je*ALJQam(I9>wF%3i5vmWhgT9O8Vreked!iA@Q$`0F@DAuP zc=x7g2P74^0nMmlP^|Y+zbQXR+WRr*=s7St=Fwm1G4y-7mhQ-Gqz}UEGg1w78D!84 zmAQ#@|NZ2{gc` ztA;b#2^a?VnO#5{=m6s<0sQa#VMNz3o#EV#V7Ae_=z(-1)q^Ub_AxhL&W=aybZhz? zxH0B20Wc4DL4ti1G8c`7EN?e76F3P|VaA?;Inx1o$V`B&dIB&Iy3miQRB|if_TKi$ zyc>NwDgrr&HD}$16yGS!3;csEpjxy*WoRmziN%7$t`Jt-C-9WN1&9w7=xexly<lW_ERU=11uq=N4-Pgeq!pbztmX4Co9S85xzm>LAfyp7yI z#*%-NcgS627qXtXL_8-Zku~IV%1d>ir_xL5+q4>H>?@=ldJUdRq_`Jrg;(RpS+m(q zIOjMb?mq4X?osY{Za3Z@-ecZ39?g^R=kwR{|KcyUmvxVcc+zhP?;ZV)v2j z^knj+FU%Y1{>Q0vbhkgYt+DO4ZLs}iyJsu3iS0-1!yH+T*3NwARu|j-%6-eT#(UhC zK{S#GumS%AO2G%jjQl|g5izQSt1=ttFg~mWUWE^4WwM5_bJ^9LfxHd;Q-Y1cnIgBS zOngz&ReD_d5A0ne%Gb$-ifs8H`8-*))GHb(U~^~TRreT&s_|AsOLG^~hk952 zThlyqT!Wt_$HK8rvwpRn=nG$Upz@1Aqp3aC!d~NKm^6aXH-QQQjF0itf9anwM}zK+#KI1N`?+#%lO+xdD7DgvvP$>pyDYKq@}_N zE`|L?2l}SCF5BK)oMxM8sp+ukmRVq_uu`_g&Ij&jUottFd4sNC?ciP&Sj02r&sF)_ zeBJ86ufY#PW#O`jvNc*M?#ArYD|ThQHrZ`zLXF@i{ZBN1b_)VHk8FBw>nlRG)* ze0E*V()@`p!MelSFA~WHDQ~I| zXaY3HR1f55#BX?u@h8+!&sF#uasU>gSpFS{^nowfAxMaJTRhz6fd~ zGab9Zp2d$4E9E9tp`X7#HRx`LChT!oMcB}=d7dIydR=&iM=YNT`c z^U*@zY1{C+3E%*U$h-Y#(4WqKK4vH6d5coY$f^moqfJdLYZ_~9Nsd;oQg=IFGpaRm zAD_s(C+Z@bsNAgiqdldSXuc?SN>>T;Sao!!XNjF>*-~$@bkaQmQN`o{sy0zT;G=}fv20muC3YtohfNf+|gBHg^7twzI$MG+tSWn7XQfN;+2I{RRFO(XgFR!<;O`PY zk{?qy_m}891|1LH6f!g9OYqsCb%8v+MVIQo(|@M_7ypg^e{|aea{P7L6)L4{H7^eJ z^KP|nHOwrpE2z)znI-x2^-oq#aRE^}tLjwkRFj{jN8=vbGP~D)+_A%1=l<-gp|sdh z?qtyhS%S)^N!50Sy_Hw;S0XJp7%lc~aonv(>#~F zgMB~Ye(@QcpqKCpP7}ckaXa~T)hg{~{}lm;^_;->`sI4F?xz12zhdn~%?L?yEF$$SZ?xAPtIjPAD7=uLoF7y$s7P5hzbe--zW!80gSEA- ziM`Q2&T++Ib80+me66WI=mxf(S0{8!>SV*@C9=)ZaiVD61$-CX-s^U>Z9LuZ+|=K+ z(Dc@P*@&v)6=^~XdlV@fp zWBVb6A@n|Qop!9UBX+5MgPr5da;^7V^{yeNkmIQ;YAaOw0q~@E9nHo1u`hBt{E@;F zus1YFc0+bic1bFcE|HXrvqTR>?ZtP*J;ep$6_Q<&eLNx9v+7? z2p_{dBKms9J2%*NTCZBRTXtKLEJ2M!ZF#okc0b1^$2rGS$7aV8$4bX<$4=)6SCzZF zuQ@59Cm?dH2CK$;V2S8a<}8taL-Vnwp;oW9&nJUdUw%i>1yVtK82V}QW+lot-qQaXMQ-T__)ua+0gFXHXx zz2mjzZ|7a%w%|7B9Ay`*??50jkq$&pXd_Po4Xn zJI=kuHQV*fwbs4KGthg=%Y#Z@OB^D`liSH210Yq zcLbu<2dG;OOaV}$Qjr$uP87!(Y!WsOZH4c_gYjedeU=(jhBU|^4uYrWJMeufyOdqP z3FCZcKjx&eH*nT+4sv>OA~*@4qfBPO-^O>~W1zwxhwsO_V7<_BPxkI%Y+uK|MYJxLI;+JgY4hgWRLL(OP;rLLq5P8r0Z) zs7_;PE2RLfVKWfKN(3;7#Ohl<4y)TgfKe(W>05YDL@YXez=RAvK$q9s@p)XZ?vLb^HK1?s>~paFCR z;@LI28Lgu;p!PFCwQ`@fL4Dr~QkQL*cg#HG19cAmd<0Zu3+ZdjFC+;6h@OOFdPTPc zO~U|VqBrBDEzBIKdUgR_9HnQ|{{r`XCD6(bL1kYBDvk%v{zuRl&O%SGpRgL9U=Dyj zF&`NPdD(Kb1Li}{Q|*A;b_iEslYm3Fg9$>E=qIR?5`dn^2mV?v9R+jkP$urEABXYDex7?GfNmZaujtjI~YBToO8hcO9MUWDH90X zopaDfEeB>u0J4Dj5A-P$XetVzmFf^2-2^&NAUJZe;T`wGPi+FmUMh19w4%<40#^3d z$Y#(z%9v%yNccY^kQ>Ytc-LW2=~qMbehf)LN1(%z^>98vqKiSJ>Wui%cx*JHr|*K= zV`a{wxj^$e&9nveOv;P_BI6*~cbJ2$V0KYvItzINidakN5_u7u4D+D}tT!`Y-N}ZP zVgz#;S&uG5`a%kbi}nKT>ko{+(dc}5$JMa&u@~m=OvH*d!7hQ0wgyIj7bE@9$3PYw z3tU1U{P|j7R%XGN^1*S?bPY3?ZUVGHifMsJ(XPx|&_Eu7?v?}NH4#>YWV8$DHgiyd zK16*+GNIvv1v$Vh1)YzJ=D?ARfw6QR`2wpt7kR;;@OiRmf_w&ldWkwqC(!@G>hb~! z!1(AR7+KeuT3|T#2QA|(^mS;4_~=ofyWIw*R0l^efhnf$QUkChcs2Tj`3EVX>lh6) z7xc2$*k7!CP`Z9I^^_lTomoWt=n0_7V(59g2N2WLpeglda+RxPRC;3FT>>Pxv*dDElfE#MkWb`1n7g_3J!&U&47taoBjI=xY&Ug)u7)u<72CtUjr~I{ zp}WG>KgC@0wV{6jtu!9Xgc)n2cT=nB21JWh!By@GX~%`wO|(C(0fUfWSg%~5IRC=p zV8lMhhG3AyWj0WC+|WSO|CN=|HR41Z(nf;D1`t9heULgZ70v zy$CsrJ;7q(zPAU7VOG%faIM5}PyWdChPiVAnE}bmELdTFGd8pW>k3->8ss)wjU0yi z)p<}Ulc0a;A7FJxK=#>>-cP=xW+PTmYG*Tv$V`bTj%6ZHK1A zJIzN&Azfgdw}Dfz7ItaY!+bvheBflbTL)hav4r=G*%5a?KBPr{3tr^k+Cp)2(Hu?}biVJfJ;DM; zo3gh#y|dSXDk3j9oPVmozvyXEX;Ep}+-i^cnd3d|u4Z~~kW;8}a4sbnj_<+d&>MZ5 zJrVBtE|+7OeZ6f~quydOx3D(1A+BD&pX4><1ou2>Nhbfq5LQ&%rp2wEwRxOS+K9U@+#$Kj8Ad&DAjXwtA$ey~2Y)+|bmUv??^h`;QjVoh{u7huU)-yD zuX(QL6Vd^@gD>Poh)2j06eks%80uSC!9j zuD+{vk!vlv7QZMOsp%W^F6wAALz|r)*LFS9P12Ly?{WY5zQ=kl?yx(ugKC^GjxF`R zG)GnJ&gqeSFR8=3i?5Y$6F=5}N&n{f*)0RfeOmO@5bJnN#d3-T{lsyKM(qXNbbSZ? zJ6(ciqVxu50+K;=a4oiK>g%f{B~$Vuv$tlq$-7rHvoyM5tf8fOg(HTxb6Y4z>f1%8 z#a(QZ(rJ2+#6ENTCJ!hboH(>u{|UWbwMz)?D8DZf<2`M24Vr?H$$p=YyuJToz>71l z-oGpQeE3W9&x2X-3lb`;Z71pFtl7f-vRdU&efMxfI5+%Y=mUMSHdH3!O+!x-gYBK` zhgJP4-jN%W*(>c~`u;3u_Q1TIMcm2`bzYl@KF$kMdDOsQBIWE09s(N=xkNo04-n1X7-t_dW zJRqf=Em0UATfM%v>^jLSKO&qH-!5T%x5fPe2hSRuI^@%cFJpF%)(`2}OB=t|ueNcWtPG$ATtPbBBKmGgO z__D{-rjKi%1iTc#-Tv*L%-Gx+r3vPqo>Gi2y{fYKdBb92cgI%7*2m0?ZisN{aYY9q zg$B#-5c=+?WTX|G_vz<)Hs$fO3M=y%%6?-P>Hw-=rse%R{at;fBdOWuF_ zo}8SOSyUQlKJVFuPZds+J=U#=SR4}`+bz}>b1`On_y=8UNUzP}rjuFrE2hEKD~pqJ z)@AZD7N(C)Uz^U&&MTN+-pm+i?@9^yuT)XNuVTg~^ywz*CmI+(e8t$1zdlcBI`++g zv^HU}ePcqxehMBqvnn^|&&W*rg}iTka^m5khrb_ueNg|@@~&&rfFGALxn-H=>0S|% z$o`?29I`(uJL+4sq=_Wn(d3`-j)7180msDqz?8Z(tiz4!vJrWka@ObE|Kpc2KVx3b z+v3&Lx6PsMmDpr)bHALhGtK988rAbqzn4R)F-!lN^Vf#4xjojksc2Q1uqkwrpx8aH z9<8`nn3Vkb-KFQ$({qph-1FR<{3P=Q{<`4P*pvhLM3u+f(eZ?7lsf#?K|eyqMb$OY zLMN70QBA_T2Fv^o%GUCBAa}eStb1xW<*B9H3y9G{+j|nec`t zG5lkE>vrO6rh4Jk)^{f)l8oSdtrl9i2&5y6&_J8@~ z(e4Mr$7`OPdNTagm@j=(mAM;A^fhB_hwv?;L9%9=-ND_We#e%_bdTN=eLqSYIw)X} z@{#BfXBE@N_0Y1fuB^JMG^=Q2anF*rWdo|O)fYDQA-J5|l770_$o9>?wmseTecy|N zmJUDMr=)|lV`;Aw?FU8;R-Y6lvD(sxhQ#6tStnAB-vi%2d3p8a{Flb3RnJ)O3cpyA zgEBkh94j5y7)E|#Dp`J#P(Mp>L+J3(=^>shA}9ev83))?IIs9~Vxh~=DRr2T<63Vq1kAYQ6W z42+M|$0xMPZNH^c%eI}G1hqWbA*xOHu$x+|EK;1w|4LnM=ve)#oGJL0(JHy!uSef1 zJ|=y(}+K177H6`uEokR%VC? z0l!zBH)CA{T_i1}8x`}lxBPGTZ__@~FsdWUI!TZ)n;*q#jkF>s5aGlW;*M{=Z!>ud z+rsZ7CZt1EEd86%VKKJ2D=nACIYKssosIt(_b7O)dbVfy1vBf^eyu>iNtYeY1z(4mu zdSdds-|JFJ(gU)}GiGGG$ZaUyS3SXKF;`lTyW288RyFrKB<#CNO!FdSGH91$!AI!VQ8!Zf!*_FdIFZ{Iut3wWk_lcbnT^OX(Eebgjwpq{9 z&X%s?C2$0+2r}Ba(aNpsReq>=cM-23_|M6-J}G4>7c$mmoz3W#>B${Y@~vD`6K)!1 z-QfJ_yT}Y+jS|KHN%oW^Q881cQO{OxlKmxJD#N6AMW+Sh1nYRmc%%7A0!)NUen8ei}k#@cAWx(>_82wE373CqnLcbNN zE3!|*O+1>@mZfKOWNUACduvmFW3Sp9)iLG$iVx;j=l#sj&mWz?zFHjs zy*{`u+_0dEUD3Q;Snea5EHhJmBeOqzHx-S zH(V{R4_C=u#68Cru$OSYv8S;9;=adoIS;rB?pl5V@4bi;v==8z21zus3-bH2W#F6~ zEK!5jua_(kg^OPB<-BmtGkgRVh)ksV6ZP)hj{c4{jc2SwEvklhrd_5C*wf`S1X~tZ zGp)&u#r6_=u?zQPdHVRidJ~B{@)q@iIt;2}5LDGxdN??2CWD`)4d@UG=$_693OuRwQ?LeP8;gIf)P(V)IYQiI68 zWE?RQcyL2}1o#;ny-MFTuf|7vM-vEAS=tp#a_*5e1 zFkGq8^bvX=bA?`koTFEQd+R9^3SCS(gJyRO=?r~XIOthWVC&!*KZC+1MEikC6#H@kFbmt{G=o2y< zanh~mC5Vqo0-bsh^kjKV??n64%`s48(e|(paTXOKGcYHOV@b$tG=)h)pHOl5S9%>N z{0gQmdIO3|LiAII^25dQKe|OQjGzohm+v##vF_D1n zL*`Tep?5&D-HUK&H{G4?2mOQwA)D!C*jDNTI8rp!Lv%W5rn_Kl?<5wZ8)!K)8%d+r zVtZ*F+JiQt=NSpsh)kg$VMAy+W}#Ej7SQXe0VutTFdX(6-XPN%50*u@#1L@34bz`R5&_` z_>Qs3!=TTuM;ggWtb{rRof$@9Z>SEeOez6=f~+L-Ku_ET8u@3`jBTO)Sfyk%`W8mQ zFRY4&ybLC!H&dJNdT7Ht1@05$&}ix!mO=D`b?&$KChHmW77Akepb;d2c}WxYA7t`H z^kcM~P9sxUHwY4yBkjn;uroRvJ3`p7jX=Xpr+3mFpnFadrNeWPX%vk~s1W)yewUiU z8il^3@{x83Mb=>r$bPt1X66(0_FtO6W-%I)f+gSM}Q<8N#)V^fb?>ms%C9*kHR`3U&*cbcQO#W zL0w{6LPm6fGYS0YcRj6nk+7Pdhkq*;QE|4y4punR2Wv&OgPE%!c4Iw|MA(^q!`cpR zu&ekDiiIP@4(uG+onRxGR1Mai*o{siCwsV91o98T=eEGsk-gzwVW-caDr`Dynr|O_ zENw&n36g1xpCkW4gRn(tBi)*3O zL~}4RxfD7dDL`4j!tlsAyfvK$eT@@f?dr_v&|^#v-GI-bPgA|vTJ$5YOi4{aVbXM*PdxwjuN!VSus?Xut z^QbgfIa@OwnM>$<=)lsNT7#YfFEo$MX1SQ-m6}=m(4!?w~8F z6xjRr5vvG);-1&xPIj+x`+20^MZkkKdG)?TPg|$LJ&gEGjwZL#lW2rKPX9xDi7!kB zONv!#I&)5OcX0mZpXc4+PZ9PIycS*-?iTbE_m}Jwz7o6P8TglE9XyMEmfV-T zmT1MD#Jz=Uxi8oacn^3&c~A8rD9<+6SXV#WWNWPDs;Rk2VH#YYS=XWNdR=8*n5oos z$2=N5X6@`voWtCQJpJI)JtvCDIC>LpfTs!rDETSqQn+GkkxFpV{y^K|3$bfJVf&3o zuqLp3a4vJV0r4iAFA?<<-;gerJye`h=BQ??Bh(`_(ORFjLAy6#UBGMOyMR;r;re9(4Zx^crkNyL zEbc5YU<&G!@2fk)G0bMQxa%W~+S;J%Ugd8~JC-Gt{Vuy%-m)skaN5|nep$oO#x0Iz zZo6*_^&9cvrR?*Zr;xF{%G2PR}9NZ0C5#I{Q@H9GlH{ zz@BWkJHEP7Ji~}%)Out${*@EO7mFrKzRHFwNmaV0MBCf{fUZeEVnBetT0bsuO<-7{ zQ}5K{`tpF(0Hxn;#ZyV4z>IIDet6ru{;~yFYs?vScWb4F$5q|RgG&#W>?&DPGO%=V zg|Yfl?e+S9Er{LfBs?CX3GAQHtc~2cd{U4m`YdWG(g}0`=MZly~r_SCqI-_3v99zad_j?7_3V*Odc++%!=kSAUwVM)1? z4v_tt0KAcSd=6r!S`gnne7D}&%D%Ocu?%gfGkrF_F;$xU8dg~M*bwJ4_usx5l$n`= zm9XY;zwjrD)=ENTAE9Dfr828Z)gLux%`Hs}?Rss2hNbDK8KOC_UaCH?9;HcEUsDTV zTz62Gh*t`>agQVWyfLnU_HNcf^9|Fm`pb3Eb>)Ud)t@TsE1cyI$~#vyR)rc5m{iuk z9Ce<%K(2ElZ?GuV01g+t;>`qKgeOEAkzF7b%;8OChhV>$T=KZ@ohRSr?=(5uI%e7q zH~zE+TT#oihT4W)%U92}X?NS|At$@xfh0x>Ru&R}Mm*&25C{*)n1m*a3YQMM8waQj( z8Q1XA^t`@%eYJ6dL0luM9#@4{%7I6rsr^*9-yC3bJNtTDk?-NjVJOy=)tilSCUJZ6 zy?m*F;17qaU@X_es>OhA3Utjs-cg=oZi~z2OmH@HzH>C#SJ-pG;~s1;u>a?voIBkC zzGFloyqgp02M+d`tk#@E+|#`K{C$FBz@}Ou>LFSw`Y5UuX~k2-GbJmf2I&G>A9;cN zv;2g-Ts}y#6!MCQ>a%K@dWhPfX{|BK{Uk$0+qfyrE+Wa3fN%D&C@)T^enj2w-|zpf zFK-qnjI|!P{OzgUgxM?c`rNNwLtRQ&o_CO+dXD4O7KZB^mP0e z?l!-{ku(-(SkF1pJRk3G{xyCDe-~c>?lmPpkbj>)Rj^gKMf6w zj>!L2Y*N03)NhU^R{H}+V!EcaVxD-E;5!FHLWpLbVa~R;3D&mF8 z1|0&4gfghI1Bj=-Dc<3p)9z+&KNruL;_x^oLJBg#E%dzfwj#pGy<}U8ri4(DN$D#3 z76YyU)QzoSy=Bkf^y56`T;XizNFXKHgpp>`=#CGUlN{x4P;r6>A%t~pX0M_aEoAf}%6@kXWL zX%(v~wX#WNdF7MplG=xLU(8nPBYQ8G)pLz#2TxO9v3IOfoWFP~!6Hx-&Oo+1h3jMQ zXVt)N_EUJG7g09}hwq(too9->#5LLV#M#RE*?HU5+5N{|?WysmLU*&T#4E`6OrkUC z8rZRqfa(ofO? z>26sM`4#yY`BS+|-bXP@(OZ$JkSf0^_R1H?_sKOFv z>+1f?+1`-}UedRg0S!$}wRO5WN!=17`~Nt)3g{-XHaZqh+9Y)sXiEiWaar8m-Q5lYAfL(~@?~%j zF!Q_FU~V0^$M@A|7W|+d?ICHQ2aE?&FcMs^3-oMgKxNuWPhy_n9(GrRDc2|ql^M$W z_{vd^Rz<0Ht8S@hY36Cx!u#u`CQs88sNOy8ew|yFts9^x^&fN(b^mDB=%(vTIwkxA z6xt0M3slz|nT7N&tbtF8vxM$Gfqmkg;O^}D;#h7^#<*>^CR*EChg$brC)ys`4%(v~ zEu7z7Z9JT}7BbpKLUZ>g7^V#PV+X*2xen&VFtFQ(fzi_m+@~-w{DvXTQ!mzla`R8V znAZwjg!AGMF%78EI_!SdOJk8b+MYN^swfW>QJ<+qT0uMLuk=m&GLxoQrf@S~6nZ7C zybRXqT4gV#O*KtbUEN--gVS7?Dq7uG(^u_MXQ}6?3cl^9_AN|--TTwD|QFt z$AF$ZRQ@U5CH6~7q5#N1Ie8KO4A01asa?!lGJ}$td32yEpIM|l$!wvMl%sIQ>wxbb zR8(iIj1jB)tBQfjQ2L4T9phmpDE2XGhEse{;N6NW#cTQoeVSQEmnv>3W+=O2&9y-J zfO<$jQDl&ln6FeEoj~7&4)z{Ai-YibhBVeI;uFz|T1Y6eQaW<&eSMKAl>(&iAEan+ z=EnMdBMbm3DZuxFFUE9{6MOS_#1Ud`iq(ltSN~&Lgq=sfJ$lT4PsYnpu~|Y zrB~E14!x5!nfiic-5%to|NORz$>JROjL?u;BzBN~fQjlQ@&%FT zge2q>1OpE3Zh0WsrVjBTxZv02#zF=0fZsv=ln+ZID1|gc4kK4cv#2Gcff@=9R~Wel zxXvy42X#VP#a!SgQZJ=j;$E_uR1=KllM+kq5{8gn;jA(W+_PZPE!3fVN}N292mpg| z5oR5|{EQqd?*Q7io&F}xRBXn6Hvrt~h15}jqpAt%L~GFvt$>xgM9h|Mg7el2Ot9zV zWO)YJ4X&DN(32A6{^S{OE;j)iz9|1r7-a%yssOk7D&_U%GN0JyRH1kkJH2;8sGKPl zfW@{%>`84D#!y;uDX^1bDTHbyZKG1fV)CfenrMdetOl$gmU;|j*f-)fnFLg=w=@8} ztP9XYUqXLcjo<5l+npxXicd%*aNChYP00qe>t2k;^XZFX8KuPxTMI136l5O5w_f^< zj3n+!NM)uxqLI2OZ$O&^!SpPFYUC3bUx$DyIphd(53tr+X}$5!zdG6*d*c~FrpK{zbg|jNnrR%>-ob(iC8S% z1Aq53G`C%;J<=nxBe>+Rr5pJ9xcrbffHdoDux1OTCe#gZpO=GKTpzq(J9$uONInOa zdP6=%OqXJ*&0w3a1{1d`ITjdlALLLMVE-LS7Kj{B+-LG`X$IJV8MyLaflkB&f3$-= z_gRjR_0(12J)I@l(D#N>*`%A2h)&cR@guO56lw{OtYqnxJdJ!P6wxL8ahqx*oK&v0}Kmmn#Vm6LF2WMR$SN{$CvU9+uTuoLN_XB|q#NB!f z1iXX%LJlP7$^O(~X)3i@wiBa)p?#sQiWf+W=p{qI3#O~%&7nH31s3LD@LdZ~iSd%* z)Gp~Hy-KXC*h3tW`jB^s#`1f)CD55!@-1-=wE(PTAMWZ3TrUT($=``cuzw}Ib3ai7 z6^^RpLh=>)r!bvtEc{Kz@Nb}qog(~3P2`K@bHaSE8=p$=h=aV= zsA&8|g{uTyzEUs*BjgX#XS5~@HIH13Da++DB0)S!&lRc=8PJH7qUU^)p3vdoV>Tnd zLD_tp3V32)^(WjEB3xIqZhi(DS4}oN51o4xueE zK)y^Y6C-h6Ecr+(!?Su^x&;2~2_lxX$#=vwV6Zlz!`r2HV1ci}xT7OFksqX+L=QMg zwS^j>ft-O}nvc=p1i1zMYX+2ozk=y{7`*W&S}#mTKkh;H2J^;NvA3 z$;+q#U68$)ClX00j1S0p&t`-q&PAI{A-_l1f!}SW}Fvb+}eb> zc=rczJOhZosdV92s#sWqF>)?eJX@#;=^rvpI4adZVo?fO{uC9SwbB#mr*wgQAg}i}%_6Qr zKiGs=i>gU~q7?kY(dw3`8AOyKN zIICIE3p~Z~R-t0?OsJZ z#M2iAw9qZBkqa?)anfYWY7fA-$Pi7?z>x4Rp~1%vgX6$Rsx7sYx{R6hERjvL1#`Ot z@fD-ne0dNU=o!%L7^Gzw*#qQ`s6?GcFRO{R1&|)px`sh#@hARr1Q|so0kiK%mXder z?bLGm8~q9OO${AO?}5h1jWt{!*>A&0IwRbA=j% z8q-htoM;llkO%Y8^DEGvg^u@*%1*|0(xq^ZbX{;Ya%Z{M!VCN=JAe!IUG;tUh4DRv zeZmj;5Ns5?K{FR29haUVqg*7f(isY^>VbNPwwZo`VYq+1X_D!LxhK*jdYM_%OmkqM zD(FP;tY9f9ComN#P}jgL|1wPwb6lF|NwCv4mF05rfWjID-SR8t2NbR;)m9YQ(jD)e z58P#}ip%je6c+JQ`14$ER>{`#Zubm#IUJ82gKax2E>^U(4YUt)Tz1B~)&WE4 zfH+IMGu{~2Ij&))qcN7C)`ltcA#ia$CDjUig&*=7{m9NL$bOMKrudzuwPPL|2o=@{ zajv|997~~8Ee#d?xo#exV~~BfeS*#3x}&@jaHj<}yEEUD#>M&s`1joRS$ImEh-$x1 zN)aac1nv^o*eClI_?r5RzLvhKLYZWyW-^t43AWX3^}B4^88AKMeV9I?DB@}OrSPQ@ zuBe8w@8U-%Tuhi#`C26=At-KffJwcHsN)GKRpvQ=w9D3HE%?r5-pu(?biq2;^@~_a zA7M%r)s>Hwi?OS0Lyi>YvBl2A6+12ZvfnHtEn7>+!F~LxW2E;1w_j`t#l~~g`eRTJ zZ7yFF+Y66;*S)`Z>br}a?Oper(_Qzy|8Q;j;bOM*6w2=>icIxueNX?1rm6vaV298@ zLhFYf2=5TFI$~gCe9Vma+)6}ZV$#4W>4}AjS@C-V49Y~lL&fvFtyyQjM}Is1waWJ? zS&Q;JlrM8H6y{ND)ydjeO*PGAIGv|ZmH zchHBK$5b@=h|psm`9svOzd1wf2HQ{TKs({|xth9Py8C)fz9C{w)IcB6Jr!=w@wh>+JEy&+KFL%T*Eq$}y#*Wd8|632k1w83 zrYk#aS!bW=-5{-C-m6sV)rt>P8Tkt85J9}f>D`I;zE%mo3uZ?%S0y)6620$Pg)mND z3p6H4(OW?%cd5+Uo_ePt#MsER4H>6nf>wv#2s;x#GHP*~w?p}k zf~*`WcSD{huUcWfvYd(+4i9&joS=NB8LU~N`mChsp)xD#`3N@9S!k(U+O(vF#b;mS zuJAtLp7_QK4W;Wu9qKWiMeQd?lby-E^bzHI)d<}O{b;|prfq>|!$w48N34uY2zNxj zja^cCeR6#2s?^4*ozrHf#a1zxr+8nL*8OqxeaO2X@AE!Y`|SQaDziaJPri$`mg!^Q z@Sx-7k$$IjqqR+$%|3g@k^GlGjM=k)WaK>0FDc{NvfQ@Eag-xSJhN)LzQ>IMy`Ir@~q-dp>ONFefX~P z2kz6y%*n;=eP?ua1Fr?G32GX+)3{yl)HJ5gvR^D^x%SMT-!0j>IS=z9i_PVqY+t>V zsW}?8;l07AU9N1v5Wqy=@J~G^M@)HoS*fK*#eDm3u4$g1?0w!LNYW1S9#sl|m@-uB z8$m@wGq)8lRY_V}Kgi!_ZWnYvBrp6_L{5}{+@$y(iSa2TQ!b?FQirAemDVHq_s|)h z{G8>P<3GN9o%k;4uCIPCDe?ymt`$aB_xE&o^NtI|x zYLqlHsX_A2v^uGaD#!ZWvPI^#&0PL**hl{lbKiO2&HYr6^`Uebe_b1F8i91-QvnSE zO3ZQoub2dGkF~7mRPOqmZMmtr<8p@NFDSNIn!9tQc1$moNs|S~m_eG2YQ3TlvB9^{ zb=Wr5w$9emmS(fsEVi4DF5dUPjY5(<87~icnf?p-PJv>DGEwc(?9%u1UvJ(YCVhCed3ZNZ_^_~*-uPrW{@e`|Qx`eX3-w?z}Y z7UqcVhv9*7aX_n}Aovk1QbmXxT<!`#cczZJ|Z@mjBV4-5T>o=m8+ zvC62at@*6t8LQ0sZhNbGdG`pQ{MGF}t)aHla02<}?FRpswSrgfOMPa#s=le$X`35< z^`Bk%^}V`Ij}VH$k1)Ea_R5;wr96(V?u=(=x7*{Mqu`$n?kW z*>{~jq-Gq;DXwTFRAcU|n(Nm3j|qqkniBYz-x|dtu_@cvIk94PS$R>%{KUMt{8t6r zNl?Cg?_}Cqj;#7PBhuVEnqu=Mt(WPEF{SV5@vTA-3}On1CQoYE?m$ z4$Q5Y`QXd-k7GXk`q7mUpEI@Wgm)wA&dn8l^qldwIWge8-vrfuDp;!Fv%4eUJ3OJ- zSm-Gvi?$ZuEt^_?xniQTs#o$gmv@st$OtNs{)K5zM^FrzE}iE$_&BzkcY(KoH^f7D zhI+<&Cv)3{%W`LmRwQWJ88S@WgS8QV$5gFcIVm{#bjsGW+EsG^4?uYyD`h2LJk(j-zSmPi)4LP6eR9W>Cki#t+#%fM0+cLY!SZS?~ zbl(RP@MGELk}t*WOLiCQOD0=(S>qk;JjXdRKUz#ChtO-8Z00&s71}oq#sYmh;_ zinGC$a1gS_DvP6}_rwo+wz{^Vjrl}qNmReMA&Ke9GpgRLvAIUa>QU9JRPT{?JLPCh zrgnk2+xuI2cK)QSu=M_KH^0`sz3}nHx76Hs1&vD<*}C~Ek?)X=@k0NreuMs_VTYlP zK0#B6U2+N6*Ii=!U};mbv2b% zM#isHzgB-iGn&~WR$;q4^;SR2rji>4%kz)s9?9)k@VPjrG^Mxx5T{QCe_8Dlsb* z7gVC=y7r6qg65PeM-fW9Wrw&8?hn^p@9ej&&hkSRQ(5iOsIqOA)fG4Gz1+3gLf?BS zm)fX2s9j{3@4wj;6rjWWaXKU?v}4#U_)X_Um?QT_q({_=tP^R7ToD-%UK$YU|GRFY zx`;VXbQLI8>0D?vl{dF=rG1NA6lCPh%>TEbdeMsFNhPgI6D>8Yyu<8W>>DKP5VwIF zcZME~EQ)uE0EK}Gq%){y)N+E6X7Y!)8{Q3`q3&9)OU?@CVbn>MvAcaOgnm*o$AdW`3;RqHUz!rTnD0$TX+N zK}W8ZUx*KcEPfAor>&6dos6TL@?7>b^W1VTac^`x+-08KUM1U%{gdqluIVUWGkyZ^ z;=2g*h3kR|89U36THQso3+cj7xIpT~G9d@f3@Jd61Hr>o!_DucOk?-;g-C!Bd<&cw zgQ-sNuUk$nqqb6Kz%Th5>-|hB2W}cBx;MRten@|z-E&Itz?&jUUN}@cF(AzR|vL-y3cNHt)SLWzf)tW=9G@gfdAeAXg_Vh)0z|M@>C#T z7U_~S6m`T)Vn5L=-WTQyX+ktiKS11^?2 zIN{M$4s@G4;c7PmOxvOV>Fu#wP>^{*gFXP`+l`&{a3Egoz{spc#A01g2EF~Q|2sbR zk`uvNl%xt^m|x&nc^mEeAjxRkYWW`2!0<03o)8pSjch}E9Z9?VotZ zVfY8^f;MzLUK^kgJp!fsRXDUd;kMWqM_mPUwNbm6ah_C+~Iwf#6hvT!}!&$Q- z5Wh=kmj}#O26sUP%&rV=z6X?dJ#gw-_}YMfZ2{BwJg|xT(0pIV_p7*5OM&dy!Btg* z>-r9@JBaJB60fyj4X=iVcO$OI37{i?%1?nmd4P*lg(i9!IE+)_TQV8wS92gCGS2Q8 zu^TC}nUt+<0YY6x3E%;j+PAUt~Hyl79Y5~h>0_|=Pu!vW} z11C}uSH2Q{>WHQeRpXj4bj&DsHL>L-uG+HE0Np-8RsfZq8K@X7nQq6gtp zFcs&LNKkmPPQt-tD2~%oZi{wyfo6IPdf7P~=Lhg}1>8wfa7L|&j`(Vbo)ZOUMIC$_ z^5IW#6?b+6+PMgyu@YVwN95b`6ZFfUU~(IXWL(Q(=q(%3JCES{ox}HyU|RP89vX=@ zX5smGiub=j@A!tktVb26KG30|_^ZKiVQq*bhY@c4_9}42#c-$WjqBI}y7CTkS1`b* zp`H8Tr*I3`G#efeB&u$4XkiWX@P_!LdU(~vvzP{dQ#0;a9^Um5uMhad_c$t;GpL~& z@t(nG)e_vh4H#|C;65H8mSH>_fM+EUXY0h@{f#TKAFdZ`aK0PCquz)!-iT`PLU@=C z17Eu(?sHvuBgDy-;gVVnjw^l8?|Y(+Q-Ri9z!UTe*QEkz8HszWCSv~o^hM+IBhjl< zajg=GP_&-{Hdh7**QfvQB%Lr;az^m!_R_K{KWAPpi7jRAAB^}1QWn%IdiViHQvP6~Rwc72 zC*23iidOV^rdS!I(kkaE-AX@|O?@6-o{!+;-A1!WGgjL~+g@`}a~j|KY4X4o=&X!} zYj$UP7FLc5xvErETP?yZ-t-5@2+t>SWV{w(u2G~)q?v6T@NV9{DR@?}KUbA=JZE4* zo1y{5J&<)~vCOs)bdGYfoqNa7yU3@Pomv{S^jI-&eO?*^j6WPSj|2qkVK) zc@|7{q47{-;;9Od7pD%qK7dvmCH0|_3!=r2W$_173vBf8Z)GFa;2+L z?;@AQM#roRUmQ^CKTCgHvy8~$b9DNaFUc8GGU&{u zIfeQE7QZYnaa8qg=2yslnLDZ!?ccgY!#2ZMziWm>9ieFfkJgFQU-AdR#l><**&I03 zZ$!4oYcfpnLcP%NEnr88Gh$dwRKkWTm8-5yQ&t(0&^u{-;=$PmfBe&nj76Dye||2UTb|&m@4F!D7+!V6aKdyb;6uRe z0JXWUX_oO1{TZaRE|o=JdruwbL0eeGjIs%3XUbdHj=TK1uF{`Oxz1sF6goWiKtkoz zSJlNjzIsxl?G5YKoRG3B^-$vB@X3A;R3XwT*P+s`xuM_3d>-=d;q$FeyFE9)-0))P zt8?$ie)0U+Q5aorcC_R>(JFOy{d$vskRtegaOdDEK{0_hknuT3DN+rkW8T&Fv*mZo z0*W6NG|4}lf2{CMiKcwKBajz57y@DY8o$U`nZ{^v8LIPx)I5J zqnkto`cEOAI4_kI=EP@&yqo+Y_i5?VEl(X!ox;5AMUV2y`~`X6@&L$D=$9|wPWbdAqvGq#?CioH6(NoYPh;r|eM)s&GeRqC-y>V?7wsnHGR0$Rh}eP) za9?rUvf0aX%i5McFa5PlU#7G;Di+ztIkVj(*cbdP=})Ss;(f-ew1}0RuF{1?-E%Kwg?w%PWlg&A>)Na*d1)o5tP@;Ay^QasXdu&R ze`T?9gMy=1kq)Vnc#+@7?P8~RUIDXyR}o@eVY_FGaEx`$a%;W$9+S5RJI5CYzqc5v zJ7&wqSl#rYdNG}pZPb73w)s6aFACWhaW*(%1@SOl(Q8JZSx&I*Gaa*Hw?S96WC3Vq6?XiBc*sa_Z&cOB^+^3 zbr2mX+kVa|DYRGkHbFN#*-z~sXxOXSs;a8Yrhb#}3oW=6u1!{VDODU< z)T5|%NxbD-#YB5G*E`Qz&dT?eqKKW?t9Xbzayx0Eu+KMyYt4ND$LO4|kRLDA!wxuG zN$c&#he3TK7su62NUqW$Wqevn+M=``Y5l7vr$(lJO*|5MMb%93l>eQrPXGB~#mDq7 zo4!rRF3eq4G_zcC?&P*m3-rTGZZl<`V=$`zAdYfGe z_dM-{n}nCyql{7>p$AA=+y(DQPmpK2cQ~8RJ@c?pW7I=RVgK&n`9wN#MJMm%@HHO*(~o@+a~k z6RYm0d*-J${bpVnSR4`)u{wHs{MLl}RobWYNh4E*#8C;RgxIJIza`WGuez)x^X-Sg zcm5x)rYB^NEYw?@bMSwoS-PI`G}2uCRDUW=SRve!-g6(FffbF)ZWf;{tW-SOBG~4+ zWX}-aYq1pWfUl(6@5?CkGUxdP!pev7s6jQFcaio=90f?8}Q z?vtaK>8b$T4Zn2b$bhcFe}#I($3-8DFHQWK>`Hx5b#~RA$(@s=gj$i=e&LD?&ROy< zQ~Wgl{e^eGeH{P&L&0Aajo4R21Lmn>ySlr&NU?@dF&WgK#6fW$KZc#?Tw>)dy-OdL z9^m_rrLZ2Jc!S8h@LuaDjS%|@ZvLvz#s;z-!L+R9s_9Pgu4l`TpZYuY z;Mw4G9hZKSGU0|_Oix#(>Sq~Gn~w*L2>U%UF1lXy=U7eUSqaS&Gm?fRg(Max^pEQl z8tb>7?&E1$Qa!6q`lwHDKZbo7_~UHx40{#d0=Yf)C-ak;OaDQ(#s01y@j&`VoGw=7 z|L|I!Lv7&|7R$eu1{INZm3t+3TPT!{5R<@Cjgc+lC{Y$Nh0nrm;iT|_r+ja`i`<3I zFy~%JnzN6aV5|7@`Q_plsS#0|)KfE{sLL0-_X%-C2P&2R3mV14 zQYWbmoaeg2HSHDftmXU#mUN%7TdZP58|zm4MOTjZsjr;~u9RF|`XX%SYx^QO9hi)D zeO>q!yo9Wlcy5K)>lR%}?k1kEs6sXn?nwUvf8V##x6Q};F7PAx`o3|{8-#ljpsjiAT<%KsoMtcZt+3jEPUch1>DzQZGe!BY z`X61A|4H+bpur)&(4S!k!ZwEg8U6za^`D{*u{p6#l|qEDlKMP{-aQ?nDzLbv;`tXx{qq!m8ChkaAnRB5_a7VMJ zeD%aL;1o3?7r~S6J2`>!A@!2h+6|0(XJA(F<4|8{ztG6gqL6l>F=3$*zeg3sXyYHn zuZ}+(yDsWuh{`xk)kTtA)h+D`PXC;d9h}|zXOH~u#ewAy>^+QMcYU*n1@?k!!#Z}`s36I78(jXw69%+kgBn7&*YO(f);ivI&KtW)e zpsqoUgE9k~2Q>}O4Dkzp6ImrDJ@#o_hxp{!mQj@>+Jy-I{WW{&a{j5aLAj?$&igl~ zTF&s?m-!uvSxX~Zs8jGHg9x!=4#*I;L=vl6lu z>N)qgnz?tlCwTHa^}VgxYur3vE8Z-6QIjYJgR+?4@4Lpzp4&)#`q$07cX|Hsw&Rq( zSU43|7Fr?$!Xr1N4l&uPN!r1vj%1iRm}>_32mTpY7}zstcCaOc311aaGipK1gP0nz zonuGDT#d|(SP_0Wc&~As?hMmXSm)ekSyI#}Z+K3(+qWAfO+HKwU@S~;rV`xSykaMQBG=D5)O{IF%MDyv&iBqG&VL>Gj{43}XRg!ena4)@ zKJta47FzWHjETpDe*6OX0>9;!aVNR=oP{;8KfDvYb38>Jhj#(i7}upy&xW)QO$mD$wkIqztVOs!ygYn=WUHt{k)I=5M_vzq7kUL= zK_$wLq{yDO&nO>PYAW^?9x6OuIJ=lB9ay@l^txr5)ngBFJ@mBq%@EhawKg3p{4>B> zs!K{FLG2J$@y&g0xE1Uvui6vgYUmv9G+25gKs?z!I2-coM`SK@mHG&&3F85Q{L zZg??27i{o8{=&8324gj3@NMw@%?E*#q=zHHGO|5gMUkTn)f_}}{9gYL#(4AT0AtYI zpi9AnLmgq2BaTJ1i!6<-9px8wH1bH~wa5n%RKzdgqk=n{BJ^h!A>v`rJo{G5`I7wN z!Np<43yK>TH!uEFN=`9<6WPfZ(NVD8sE!(2Jbrzt_RbBov6tma8<+LjW7+2{%4|1 z;Ca@^L%A^07s1<5*|*4bsc^=wNKkjyuF$_mu5oz46l5?i4VxDJHKIjSm#D<3u~8GE zrbO})+asEU4-NGTc^CxwpC8nrilszPpVITgQP-+2KT&oRPVBdeHWy_U&M5j;yr%Rr z9Ebk2{p#M@hAMTzleLpP$>-Osew=A z7-o|4w5m)!5B!fYNGWb<_5=(Fjti|D)+W4lL`FnqB=rVHK8hF@aWZv ziGM58S95Ssi{ODFvqGnb`NCF*e-HmF{C@cO@T{-}p+iHc;6njkzi-+bsvP>YoGLtG z-PpOsS_#Ydk}4$+i<66fFEkdG6b>png&g=gW!myEYp6ZXvEBX7o9Nrap9BZ<9ULo9 zA(8Y4+$EQjQ;B`jA@QTo4D0Y8NQaB_{`55TBzSsxW_gUB6P}~qIQ9g41%BWJd^~0% zJ!vP{%P+{`)HF(gl(fl=mpQGtuBfFHls8mC>euRfnvUAGNbv1xIN_II3^v7@YX#H| zGz47<+7jFo zmX?e!K2x-#=v9$_@tdNi#kEVjSPIJfTKB*+Ce|Z(PjV4_GjS@;rxy5;-^uCJbm|Vd ziEx3Zx?El^^%IlCHNs!~VqYT8tqs0!#3-i0SXLEDaSeTkuy+fFR-~_3Uz!GAi%eoE znNBTa?m*?CR2kJxHM6yobPe?`WGr9u+vh*b*xpphe9;^ma5q2^7!bHRFeC6mU><&| z77$~OGPd^nLm#c%53TD)8g8{>3I7-7F^#Lb^MY-B#nbYWmbaz#OOKZn7I!Q8T#{Wf zxirc$q5N1yYa46Nb*^yV@hm~D@jKrIUM^K+CGj`VPz~wDd>xBgl8FS72}tu}_{RSs zu7|Q^itrpMaSFaMAIjIp_szVM{|YroAQ10G#ARrmrZX26m*MjnsJ^br(;m_d)w}gG z4R`&LjN6T^jI8k!&PQjSWnOI_Wfn}=OoS=VIK-G`xT$NR9j{H+coqLr6>xlbFYXa~ zb9wIDu1T)Sj$m7y^=)};%j2^2vcY8|%e-anEW0ct%LiD0w>7g@b38@zK#9l2{>dfy zrty=-MnFwJ!IA$8X4Xuw5MnegX3y9;M2o^MI0A7_~cszhY*KK=M~W| zW?-dtjpz+#l9kdhA?RiQDp#vkA*cGBcCxOvzOtdvaNlp1|2F>`#wErV#yHb#(=nts zRx?@PmsHDtlwl82ls{^sRdtjK<_tL)UKoA(t-ux=cw$^7jvg2bI#oO=4=e9!*;VE! z3$nbhtSK)oUt3Y%cHW-tNOGNU-||GUZ@}zI=hFpF{99@SmyeN{i+Ypy$y4z9-HxZ| zSLAtpMHM9j=Xp||g&CBG67D?|e<$Hs^9=sHabyL&t_ML$l??4rJup%K0FSM;+M-^d z8Lw@I9LKqO+Az*Q`0eqV?swC#3epw+F?_<9kmlD!e@E9+H%}|6mnlOOFX(9M6~@9(fn(`K~*aw68K9>4IeWa>@wXm2vM!iH;a~atSRm^;(#%bZI@fk{aGgKJI zprZ*PXTxRpHu50W(Q(XWrkI%pbziBfo%$bWQCDj>>l)}M>es}zi#4~vSMtqcJ9u8X4m#U8cG(Bmj#bpCV62bJ z7ni@Tm|k(aqQZK^7H3yDr@ETE2YSYVO~d&P30Hu)?1l44M^pl6xF!sschLViD~zV! z&g( zzG@2+$o+M8?MW!9TkHSPU(>VtrTX7=y!M24qc%^Is$K|mdm(e5UI1sA4^nlgBcJ-J zaSqQn_iwI9=WfRf`*7PeYo>Lp^`v!~^{%zAZLMvueT8F-Gsrd5J=60W_Lf;(9sV)D zUvP>W<-2gl--U|uWGbGXfs{#x0jLlD@>V2Lu7N{@7Cuq$spr&LDh>LqmsATH>KT}% z-K6uWE%X^?A9IJ9t{9{|qYP0g(4!QZj+zeIecBINmrmAQf*w3YZ_%89Znm@blzORZ zjH17yg`x``LY7N?kUh6Uc*VW-9`f{bXS%ApVjU}NlWj+B^KIv>L##8b!)&$f-|Pm* zC&wdKiMy(&u{VJ`@0-f^6PAdRQFr-*IbV%u`Ulp`W;zc&sTVyLxO*%;7G6^$=x^xt z{iqI98|obOi8_F)O9>pPX2F4K5wn}IF?E%{D|;%ts!po+p%1w<5n2~=wqNO#`nm=) zQnq+~6F5|~(tEV?)tu@&6oZo)o>CBXrFvok|G@XdYxZ<^-*Rqq{B0j;i?I%~_ORZo z*jyo39JIEyJ+QU2Yn*YB zU+M3G6|&Ng@_z`;ZoXlmewDsNzfV`F`A1bv@s@5453($2pm5$-nQO@2_B3;Sv(L2& z*2C6!<>i*n<(R82b<4X~jH`HRHQ86$S32@t;odRqUG^3Cf*&l7lv7ZZ4I_?0Q{J8S z!xipAzd&}W3_gdRI)preJ^1|>+>2VM5vQO&dX`uPzcd=`4=ALVbBg)ONvb{SGn(7l zuKJdSL_g6l-M`d$-*nvk(L5z!XTWuH2h-oiZT?ODUh9*zd8#vtx^xXVzdz)Eu-Tpt zF0Z|#ty)Dv*~!xOCDFy{MSF{u77@iSi_eq{EUQ`mz2cVbmBZ~~JwA5f|MwBApvikj z<@9(fVD-E)4)dGphplbE-nU}j;Hl5Q5(`r7fr zJ%ydbo8&0!Jab9$tLlaNt>(LCjD}N}s~W4SDi%YLIY=HX4&jT~*Pgd-*7YyE1a3LQ zU9H`1J$t=A)}KEMFQJEIDife8(lplx`UM*In@a<41$#rH!#0FpiKrgACh}HfOjPrz z(#Vu3V`OH?mVi5^3d3=YM^Qw1gzcQwJqO8WS>Wyk7Y!)boEMRomAfHVm-kD4--5S= zB_&78{wY`4x48~^_xa{yPq2$zNB4oNOD)wh)h5+;Jio{224M6h%PqtwzE7;td&OPf zHQD*M<0jM#4;{O(+j--$uvxxmLT`B_xt89pIIH@oiPZPxb$@=wUk z&_BcGg|7^!BF04QiM$s%JnBi*k%&IQlLFMnFWNxWVJ1U9%r{`$Ionq>E)$C^1v~Qd zav$Xk$UT#z%^jb&Ge4#9Y{^)QwW5z>A3P`y3bmo>ETD~wo66zp6!l-K2vxRXKmDHq z@`PB--{jtSUG50i8^=k=+26MDqhWK+vvvX zZyB!nb@%uB|AD9Mjk$Ng+kgjwfx!f_$d@8N>q*40sDsgMqen%QBByMZs+rYH{4AIY`y5#c*LKeV1XuC30=j&Mf<$8Dr7YLI5-aeekYVTbWAfYZGs_EQ$x zUtxr1y}zo9`ViLdF`6BkZQ5SCmHHEgPyUG}$s8PbBB*P~TfU zk}l?Tc+Vi6ze7EiS}n9c%m-d5pwd0lJ zigT{(FLw{GiEHi)5TcRf^B7tHJLWxjk5L8Cxfg?_a}5bPE5RZ73;zAxM6SDUYRjvFmVPWEz#PvxH6JrzjN|`Zh<(t-xR00 zJg&HB{@C14IW==D=grEWRp2UAms~0*l@7m-Y=%d6gNOvg%_a}r%mv|&t4dEO5 z;((fT^gegrb!9rII^Nh%+f|Os$hbW0dBYa?R*13CnbrrZYA9G=Bji2s=Ex9xiPNE} zZ_TIi*L*vD_4sLU3;^;#9;emH3F>3oY<(;LGE<+xS;5~!FGK`H$Hv}|Q&&1sDX8+s zN*VEw;||1{VwOa{3<)$x!4Y{c-^)ptw=e3D*CXd#PSw2l!rCR}Wuu`A`evW#2tZ0) z7x!FGDC^`{zP^|!)t4rTk-}TwId-ULFVr?_=MKkVJbT}q6Ob0Ba}RYl@+2b{{tXw4 znY}5o2+0qR!7VhB{V^Y8@vD6^xjgngI|6&Zg}w>=Dq$|%Du03#eU>&TN2%Xxml#?a zKbW(CTzv>h49f^>A8w9dBlPfaqN935>7yKx{*f2M$AqavdYT6twyFD2llZ0Xv$kax zq9m{*(_yc?FUyxdU%l9k1Nn?el!Y%O{)TD2u!%{P;SUAWZ1IFuOzp{3GvcV`0>@GIi{QPjB1ePyEZ|;+K}x3&{*I6HXt%c3&)|*(A?0Kz~7wVrpVZ+ zf1_$d-;Dkol^r=S!WcR#V2odT_3z{cpTBE=g{5R(p))_az+6ZdSCnoo|6x<}lQxQ*gz7?LAyjDiAD2};B>k7%7DqLq7c*BB zPvK*Rn%6EP@mA`qRN+{&oKn} zS2Z>i*~yZ9#Vw216z7#(E4zyv(8G4w5s6&imTr^#maD4kIM8VVIH=7z$fb7cJ?}hq zy(_&GD|>%$&pjU-riYy)aO`3rx`=wFJlVj+}#i`D5_=^1-Y$g43!1SFtTn zN(21owu9@t8ug(zGzp!kQAw)qsFtgL(WGnoYSlWY?u~w-p*fth4aQH#U8W}HCFWD+ zJhMLFt~u6x#H2M1GVb&@__y>MXt)9Qq*qM%j#5H?+rE$Kkl{7~|;SsOR|Co@w9d2z73D9(A2}clH!}_5pS4z>Z?yvJLR8 zWpf8mKlAW^3-`pCc%DY04}L;6(`j&rJHy{H8Vo-Z5{a6EO*#QA$Vup(+reF|3Z85N zxr=Op6qF-$Fmsftueh)HMfp~_Uo}u&Ta&D9tg8hKg+rQitp7y+U;RV;b^agy#`{rz zy9{j%9Sw5~6AS|l^9{2Ml?@jC7X3ZA)J)S3(cDmdQmmnK2%}V&Z@~_7Z*}yr1zBfT zC@Pv&q*=$0acXdKmBnlcTqQEF4QW8gc~TRTg;R=Y-fMO#%j zQ@2I88oT3%y05x-x<$GQZ6EDE%?Wjus=aEzQl&hq@CPg97FCa2jFhC){3|ZY>+gB% zGP_nfqn(1|7w2@;1gj#ia-d7+dg)y2tc!ZeZpSHPZ{Bv!##0&L`H8hlI6Da(zSnF5 zHx8-QpSb$I2fjAAn`?zo@hRMi9a1mwl1qTG{6sCFDp=Snz=HlpxCkw{l5xnrO8_Um z0UQvD$u__My3^6jCuWL82h)~mNN1Bhh)dEFr1jin z?Vbhhx~^VMk0Zo6+9^4|x{kOzd033^o4sSaZM{+6-JWQV)t%wK=DzQa^Gxtu2gdZ- z+X{GbIa`J6&MoCGayPhipnxZQ(flF4slW>>#Spj|7}0MJgV9?Pm{}9>ntugHd@5ML zPGSgIfNaR_bTvk)cnj?EjB27Ps+y{M%D(VnTBh_UJ}Me0J1MU!1}N^}-~AN=^M&ca)PjG_0c6D80CJ-h zG<+uagf+7#pfdA#s(Ckg&wBs$MzIUniEI_t$QFA?c)xm%dRBNEd))34x7BTN+x~yH z8$3@v?Yw#3M(jBDGy5B6<-xumzBPP^Z~zIJmEd#z4Ws6DaHK1Mp8Wz=^9b`X~k|E-3t!4VC?scY)PTR;^XNRh6l3tM;l^tEQ`(snS#-DiO|7 zdGK3WsT{BDqin3KqYP7iRBTerSBzHFQG_cZ6dGiIUI(Hwgc0dK=;=TRmI3{mjWuT$ z(z0myv3=k8 zcc=G(H=f@`w20i_yo4uLDY6@V&yU%?pS|G7K}%;Fut~c4xlUfg&awJrJDVZ zt*?NO>UbW1c6YhlU0g_lBsc^T+zY|o9f~`pEn2Ktp+(wKpg;?h;-x?-Qi^+l1cHVL z#NFM_p8RKSc)#%deEzqe+qb)Kci+nF?98kTe~d5Yy#)`!SEwbp3QdG@!gs z+?Vx2ql5mP2cxaCwwE?ko25CXnFnW&{t%W43x#$@ZJX`7t=iVf{+0cqy^c6r zJP9|o50bXPoL?$6g`FO2V6S+w900r5Z@}JbxTgWm2H2o?x3bSz4c86M;p_m7YRQ}o zlHDl zJ7!kEt;(CE{nACyJbFl4Cyj#p-EYE;^Q?H@J_kr}z1t6Olt z?G|nzR}Cu$OW-c2=77^X!AYJ`aHq!s&~|qaa$E;}%CWcMrj4d>=g&Df74Q|D4;TPv z8pgqY8kl~d^G=c9%V*`aaOZRj*#lZ4Q+g#`hMnk#q}|X0i=a)`LmwWJ?!nxd1vj5* zWfSmkesW#7uip#WE(|39v*kl@TUfsA4Y_}=tb&>KIGm078P3UUgp(TIz?aX!83+Ne z@@}{#B7_|es~k}vM-(^{=gT?4eM0x)q|DpmcNG5T*?-uJ@a7k& z)330;*cV{c3+@Se4mb2a0(s=00K?~CZ~wQug6PUG7-qE0&u&&|++6dF&&Ly}BT)qtF8h(P2xk+9L zdL@^Fj)I-Avi=nAZ;=6h+ri0*ad19jG~9dN0Zv3Tgz@4J)KX7??2XDX(8!kn`%Y@Z zEQF^#et?rj;UGm#2Q8^KIG0cjEszEpRj)IDz!{#MaQbLJ-06Q2&NjUPSjcAz0pk_J z39-k(FaHKJ_j)*^v=JcXcc|x0&^q}BD3u4WhIJIqU@d~vRV^7K=vjTPT!k+mfb%}T z!wS&_SOItp^^F9oE)LGT{0BGuUx0Vt!i=SJK*frVdfCj_b2GBwa_|&eHqm z>zEw|=PIJ~-`k1ZwyPn6nV$H1z2?hoN@4 z0r2w(=HsUTXK$eHaZuY7_*x#AVxUK=;C?5pmjP<;1?38azQY!14W=cWscH=Mt?TI1 zmQd^da1v|=)C}$cf>F91?9G4`7sGkM$xzFI(8nDiU2}kj29U}hBuyT`Ss5Isn6%L6 z3h@3_(CY=z;@MD&Y;YCB9iipGi;<}SXvhJ)`wsf$8I=41Q2KY_RO5Ysg>VRY11peN zgA@mZ#6pk0gm!xZ@2H0F0Co!CM41FSG>o9l$qU-q3rYdY*-%3hltusH?*^ehP-CoJ zbLi7{a1QJfIEB^|`W89D0Z^YIFiMAm83i=y7%*eu^wAhNzcdU^o(+H#d40hi4DZLl zJ&seMuV=!DnF8Zx1f=f}K9emLUyD?;4YkMdh{hL;mjhlr09sr>z%G_r11C8- z2Ohw>K?NOk{(oy3)prx{)&$7U%J)ZNS zHhIt<1rE%J&jLpc5gu^VV4c&!q&a#YF(r-$gn%>%%>uYV7$}2&Hal7$uBwNx+MzwL zAFwAR=zaXDMFdg;43-XijZ#^_Ejr>6?h_onXMny#V{nWm>PrLoFa&L9fB+g{bXFM8 z3sXuRK!)yvfva8M(-M3Ow4^{usn?32zG%>gy@_v1KfJ^Glta5A^dbz?6E5EZgCSH` z^jV?Q2>Vn&>JP2s+n^>4%7&0rMX*mJP)`-3eydJOA}eI+_y&dKB zb+iGt0*;0{jyl!@yRM_gSW6ly_}1SsN(iUAK|ZdKC-pb>v|1yEL3om(l!)=Mya-u@ zfzZbO!rsMkTH&ApivO>ti(pjb11`t`lMSPT#s}g<#E3LL5K2nHR5<$G3OU>1Yxu*~ z(!h8{NOStX+Il$pTCH&{s6%Zq^`K9Kpl=&FFalz{Mj!BAW9aYt@DA}q0Q9LZzzN>d zi#>{xLWFX}30PkoJ2bATRw~3|8L=L@Fd}i3r#t?sFnZG*V--g*;%^$oi1W#0I%abgubG$Ry)RAxno4ab_y^!mm%K88mc{mZVW~00`Yl1*fj?Ig^tj| z51~ble9$g&^na;i^kdJ`=r4DS`D&;?wgJKomInJ9;R*X3>#vR?98)Sj<{dRc8~=i% zuV@V7s2~H^hdJPc!qNA!3sdnQ`WRcLrhTxj>6?rrlyiK6MlZ!8tb=jTkE0pem_|7H zu&2-ZFiA8n%} zS5SKS!O+Zxb-?neI0wfPjbMZV#4v<&u)Q&y-XV-&NDby8e1>x*jYWhcg3ua2wu{;} z6d&6JX9=}M5H7JVw2o4#ZHKLm=_qe32Vq0RiiGn;fDELxkj}xm0O1C)->7Ve1*;t2ruUc&!aV&kCFWG~r@S!~M<%_+(LuNs%TnzaCq#eI7*@wJ z`Y?tXigPAm7oyiNEvCabWD`w5^}<%5Kfc9WXjD=wV9Owe!qG`kLsSJ~EDEE!fW|M{ zWIm=*h*D9p9MLXhV?V3CkC62-Y!Q?p{wLT%8=`H(xT!JQbF=tWA4wWIlyLTg$C(_#rQ9@Udd ziMSifi1Ddcv0wQQZnd|uoz;FM9EdeVgLNjjp&0}@44TgfhE+Hwp9*2>OoXusyHh&) z2IY#h3(bneyP%D^APmz_r8?0^aE_Rs=s6sRM28}^Ey38P@r~FJ={v##h!Jpf6P6%s zfnh5CKrDhr#VbVXpbxPd`49&aok;i@F*spNdSWc}Q)~*u_>@Ye#gL*X|A6OF;)H&p zG7$G;o*0wDh!;T{{U3iF`AW4cR0j0de4WZrgW(A;BhIGT2wR2lE@4=e*TOcy)wE@ufr!&i!^?b zQ*sB&7inL7dN|x};70xl{b(b7j64NW$!L83&mgs3%fS~R@8Iv?mXKen<8UMIL>vZj z8OULwL5_o5$eAJEPBz{}MLayZh+o4e^7M`1iL^XDk(yUcV+UQ|7LY=VOSlgO<62F3+DN0UAIiE@9d?p~A4ETz1o$U9Y?OK>I%It)4U30AK2h$4ZZae@j02fiEXW8^ zx*Z2{LbPK(m}v0FI3$fIXZ$#n{3v_Gv=pZ%Hib}H%#q%c{5<;qB$oJH{5r|%-aA}q zW9cwdEhkFx(3jwl-BDezc34|9DGq}&tW<{~KgzSvU<)GuOws_9f1xyhWCSD;z?LUd z!*h}}NtGy-Iq*Kt3@V;ROij2MVS=b)nz;z;BIYIT2W4g?H$$5s4WC5eA#4(Lf-^dC z)JUJG^b*RO$f#ogpExcEui}Uy*#ydCa9p9m@#hc5&w&eZjFMyq$1CAO#DgTiAUsF7 z4KYUzmP0H=IHv_*s}|sH1y7XZq69a@Abx6eD-um&wGM??7kpF@9i*sK^ET6AuC6Dc|V8g4`BmA zhEC6cAVWvrU@(ImGIw+h1sBTS@lR6t5g=(F2GV!D*9+Yv!AAcG_>Xd!kszl>_ZWw~ z9;NnZP;yTpV;#P6AjcmEuCb2iSa?US@eqn{#ybqk`p1J@e*)O!95(qT!HUiVkny7# z5C6#y*8~Wi?C?)=_{ql96chcEAr6{}A8a)x#=)G_@QIL0O-G^VpYq{L6fzOYgz+%f zn%L;VQsNtYQm$AJ3c<7!ASKojT@(v#)lf|_2Gt*9{_lHis|k)4qqd@W82Z1aCJ&5< zJwPE83-hNHl~In;sOu}#Q)<8AbCe@r499-ORP+{epgbravZ*&I9>%1V8+;;MP)c+Y z%wV4ABluCDqa1HBE{0GU&^5y0#<=808`Bfa5d>md453`_DvZ*e7qrS&5^o@0tQEmJG zjY&O$y+Un|Z?R9XE^1$4jcGhmPS^$%N9}P;Lw%{HCkUanHtJ7=AL@B}N9Dn~m@Rra46e8Ka?Bh!d!UbIlpc=NSaOGf8)qG~yE^6`oRe@zK{v+?h4**T9iE+F z*21~0y~DJHIjt?2cCccJvs_zv))-vD#5GJ@*+g0%ZKVCtGBauV^>26gPOELjfa)&fHhLAydAErQQAco)*(-E(W6g$cbQL=#Pkdh~v zKd!Z49HR2+%QfFeNi|BOX=Q-op~R4+)oQ7cOQ7;&ZE=kX>xEJ}w5j&^2I)Kcsq#P! zA%pw}wH*41(5E4gvf!T3k}NF&?ebF$&AoV(kZk_l16KX*wZ9YGXWGJ zS5CB}EAZY38MM0rsYx&R<60NGiMAx}yoN8wl}Um*vxSH4f4kL22<0T9@)r8<8B6`i_xaMXe47Aa$#DPpQb!&a=}vJ zJ1jN2)$icCFqVPdsXly*;XzO%tdnXmR}8@?y~P|UhKe&N1-2!&A+{$;L)0}`YHi}y zvAxkCuRz=a`BCD6eTh48RE~mnHxSmrP=o{I+i}MO$!kc0qrwW}pBjTOhLDBw9>PYr zp9cRQ8-h-RRTXCONgO_M`}jvGD@vSD60Ay4X(XVH`XjeTE(c<8U>$NH{vhl}YhdbH z6yYU$M-o!PRfL%c5c81~nEbRxf~}>>nrV%M+88A?gv*e}B{?F7A-9W9>{XH|s?tU5 zZtp(9ROmEj?0-2x2K4n#c=ErE1I zD+e`!95(HmB3c7&+&_i;>)JS6t>D?lL6Z<|f_tkl1Zfov!FTwtpU&8XKySrLDd{}05(UVG#as#zyxX%-*D2hRCL3C88 zqitG1yHQKwenK)RS;a7tdJ=6#@>ptnRSJqe>;vp4#Ig7!LlhUyAu4ta`q0aWUx^CC zKL3~=BN+Kv!ecR2fzB$RL|?gPPjv1W%4!r#YoQG!UCPgOX@CrL>^ zmWv}KtFTPr6kiRaoK+0{aVUPH2KF%?&f)4oV*394uWsZd9|QE|M40)*B;J;FFbFv56;4|G4?;*atxx?ER<%|$g@bMg%T~~S&%y+L);8lBzcHNCUw~oD)jDFa&ulw9z2ng+7#rq5NwoaAB$}45eS_M`;+j@QEB9g`f*L zH;ke3cEr=6e;Dw8s$2l&1SCr%{;-BuL>KXqs-%JVO61-#g!p>oK#@m9*$i=^#B-|Q z|I49L4iu)w$FE>G*~lehe&|zq-x@cDeH==BF@=&OfOvik$5fb?nm3k_+*o@x6l+N3 z!5W|oW2tX3Pqln1M~$&C4TTdoUDIl+qz2z&sA{m4NfLu0svCK3>>unk>L<0oR7t1W z!)iZMpJJaQbPR!X*w5r5cp2h=9&-cr)Z;m7Gshd zZQ|b1MuYEFH%fSWIpn-JHqhWWK^|V^=kYy`ps@e3aeVcF5d8OaxN$^MD9V(3d>EM+ ziiY@pRqBi!Kb z(J_mv@&v*&_#SZ%&9ABp{WbG4%F+=#wRg;`G?SxSox90J?^`+2As)l@_{3QF@9^P? zb2)wu!|*GV8mR&d!EpSeAxeSXQ)%$4?Hu({bEk6S*$i}HsG2*Lhwv%MQ0NVXVH>FL z+B;ekQ(+#|TGVRPdW40kEeRW=tzu?$V=DCxx)EDrNc;cmD-1)U=14i94|^G7ARS=rZkjJl_*i&u)nDs?I2H#kG+8Ju*K9k1SJ@gT-5H= zYt$DQqP91Mpr87X=s%U-3xS?gDMX~l)VZ)V%#cWH(JGEQTVfcxX@#e`FRgtygE#1>)n{67R%Ki$>B3cLmHxsxUUd_djIOf(5`v`Bvub&s?QQZGc=sQj(E0*&D+RfHTa?bao!nh)?1 z!l{d#Q z+AE6bYrcVH!Z;*fM0pd*8mSJnU(@5 z&xdc--6bmLN9&?Kj$TrwqPS-tL-rsT)|C7A}wGw3~1*Cg*kn;=7#fnZ#O8>Gew zdeBBlBiRYM5dMgE#xR0L+Pk8@qkR%8_es(jIuAfFP4JHAj4)0OUrI4m8JQ|CqxWc| zp-|#naRed#{l7Bi8mSS|>*~H4l*y4?j%+L=g{d(xXG~EO8t90FC-`u*V(EyNrkar- z-83fAPaG4;v$4%c0)_sXH~%{_kz2ubB#s4p23ud1I1#6>%A=_NR4BnwszL}t8o?Jn zRcKO29l<5qAHy~6S;Ub;@^S;nFlc=q<*p=$RVC*nwN+(KC{rQ{6z!*@oq4Kc1mz~G ztO;dIsvM<8s;C}N%_=xv(S>kJa}vTgjUAE};CzOoxnhzk;p!Gr7DQ7JRjAS) zL|YO~Nt7PNLJCHuN{F(l@ljf$1Cg3S>V{|_vXQbPdWa|?q!2NNN;%>;@sF`EjNVfW z%A3AOZ>Zd8W66*rLO0e4ZKQ(8kcImNw-Gr15N~f?zQC^2< z8R@CEIZ36|U4ZCo;-HOacOLeZx=*jBCsD>hG!e?CXr(}1Nl@1?NK!&ryGHg%v=Q1W zom7ME5xZk}5c~=Ml7t3rgiOM|>a2uV7hxGOFG_Z5WIi;rsdJe+&ykb~#{!NEdJ@)E z=Si9^ReFgis2WM^|L*a`JTM*6QZyqIHHBd+ZAEiB#-n%Y%&o@6xu0fu8nr0x!q{lA zjQA&mE>+S+b2`bpFqCLRYJr+roJKU-*g`}@(%CPXp>UL=!ImW&R9$hw*^%aAwU26g ztG=U$Xbp$xV05eUFocDVX=PO!RwENrcYUH9nPkbTMC@Z(sfrm0UR8X6qrZmg$1#rv zrLpKnc&CwrW1=JcRgQzkA>jrbhd8!A#tt|x2`Au4B)$gm0=kLg!4XVubm6#144`sD z#1RtLMBEvUYnAUJj)>9_r-i9i-ii1q{F2H!5jMcQu{Kl+!~}$E5Tg)2!5k1zU_Ei~ z8rFzf09X8J^dlCa)}fZdmQ>r2q}3?B4u(*~2E-vz+Y?q$chJ#JVdR#OOQI+3D8~L) zF#zq-#nnArC!}>vl9i%cHMCQJXg8v@hz=vVk7zZTlT<1TsV1UFY3`yqjMnsMRH$PH zM~ynBYxZo{tgWaN6^5vE6waqOtEw~<&AZ4$(AtfXw*&>#g>vwNKOJR&WH zt97^%gll|w0zy6CpzcXfSNM<~P5Iv|RR)|-%m_}@Lim^)Dxlmg@9{syGP zkPe|UJ!(2kjdYoM(uXLLkNrsL;h(;vmWOCQDiQ9Xz*8GoS}Z%-ltx{Tq_SczMAzUG zPo_{V>Uuw&1|d2V+mhM|W1)-ILx~nuX;XZvE2ipt8nrr|Nl~dLwWnxDHKrhbkf#z8(%{RWjlK*KFBFINqM%K05nc#FupYEWMSW7) zX$_d(VEf=(gdJ)JTv7a(F2~lzzNmo^bYpK)2(~vt3q1+Kuy^oe5wmYT>M!Hy~#c2l&QQtN6@yB#D(b*VJrOT22#&ulU(}Fu$aIZ0)*rwBObP|tF z-&Mm7WjuF?PxUN3?mDOa=6Fs8L-A}dg`ppPbl$emk*d%U3s1UWEVOBVdV%AtF72PD z6VA34V7DDkJ2HfF}>B&WB zn{f|#9Nb!gx|_p6^YVSTjpR1`@kWmu@V^cQZ*92>w`g91du}ekJuMgE2E0>X&cO2w z+~#r?G&)~|_je%0Ye@4Ra*2Tz>j$72*dm`&4zQmvccnveo{}!FllAgnQZ(El`VHK1 z1iHuMAZae#>GZ2K3+@mcDb)jwT90Lh`9Ya1w^4?(`{0hAVO(P_PT@dHa%Z^h=u@T) zG>PAb+nv@a%bBxm7Tnmg26WBeWp!}xSPXZUZ>Wiad&i!`ZEL-R#+nOo&svD)Zw;qO z=OcxDei^q4?&taiG??cxmlRjHYiNobD({B-c#cSI;a;MX@*&X8o}&x^ZIxE$8?Kem zo?FJYf;;>>!kuC6!bLtv<1YLzbkKCuToG)1Jwecn*Yp?K^L~68SC0?lUa=9}V77>v z&sM-DI& zDd3e~N58q=+gw|~UF9L#v;0V=(l)gEeEE+>ZL+>kOH65-G&8|DKKk9=cYWSZeZTD8 zt@u63y)(YZzM0>l%)h#|EmvwHJl51VOfyBeR=AGxO!9UD4KTfHtqYi6C#G&v;N+mI z4O=$0Hk%#%x>1{Y-2*oJg}CoBWjhr)l?#{nYm(V~sk}vTMvi~lAIT?@@)O+>+9ce1 zmk>87?sD9~*l}^G360Y3W(5>XFZ-(cwrz(}%^lP<)|*@!fNqo7Za3WKx(qSo!QJTJ z>vrp7j89$Hdp4{UQO8m*zd`M02~8)}4-RY;R2cB9cc`b$ZL6uhAyYS;>1lU2&n0SC3`#ukZd2@)x2xY=fAjRsh*w!JCP(dz`!w;Nv@i40${t(Cvop1)oO4`zdKdV- z@JaEF_U-A@&1;Xl#>E8MVodIHJ?8i-0Rcg5!yzraTHI)?4a}%F!M~A5ZnpeKjE4-Hbe)}7^7o}Z=9QIM`Tl856OO#!`)*#G9Q!nO=({fQKfE6o^C)`W zyFN+LDJL`E7TGNiS!dn1h8M0=J!g6K_o(kW-DSP&CYNT;TBnD4H&bglEwi%yiUdZ9gjJBT@o%V>Sj@Lski)S;pzl{Is zQ?#SFZ8_#>umH6@@j2Lclt~7HM>cE zY28uPyKrV^VZxJld!pLBDtM9b=2djYyS0hkQ|qR`$?yejOnq{u7c8u}ZY@;i>-M|O z@!IGU=N0RoY|`mx@i*kfqCwumMQQ&swejf?IIL0M(8le5?cm+2Q>cIQ8$p|VkGY>W zJ$4G!{lqup7Kl}rZKa>)1}9avQecLjm zy{<=W-*vr~cU&79+&s+pso^icu&MUxauMiSTwN)ZTC+RGPkP-jvNHVKe@7mty?7AU zJvkKOxXlY!XS6RR8?-I96uXo#DRy^DN zc*BFnk7~bc@UCBK``m^lA(g|cKdata9#iU8xxls!E|y9$F7Q1Za22$q)%W?+WuwMf zoL#k~vbS}Ga!LQWZ=Gf_?X_X~gDrz=_ws5V5xOt{bh=9?Y;wh)pr!rqs{NH2Wm5{> zQrx2FM23Vfx$kl>_wg@L4HC9yCKv6f^0Djy?J@m9d)>wAK)Wo*=$d$}^1odB*V@7U z6`lv3zg4E1w^nqj>S7BKdV07wh;HlB92YPxabnXU<9oesQqTE%c}QmScS+G>-YrY?&HkoXE?u8LKRxaJvNxk1 zrQdve=Rw5aH?NcbEUm{x>i>0%a@9CT3VoOZ)-6?YEg8y8-A2<7p37@ld|P_dbN-LJ zZ9i+?YaPyXb2%J%v2A+)F_Z62X*urU;IQtVbzZOw3;C26Zwyguqn{>bWakt|7mv$d zp8iw(*;n5@jJb9EVfnN6(dNur=2=3KX^K}@x695=G{MT4>dK0F<}XW4Fzw-Ax?_tY@grU(+o4U-%I{gb~0(V`TZ8pVD?ze!|su8R~PwYp&ZSLn+_bI=Aw9 z)d0|PeurOgtZ)x^PXJ9`;o7g+drDpYp!1np)~0S(OBHrC^~D`#4-Kg>4;y;7HT(H_$q{L*gPpcCWPP1rkX$DL*~SoSYSPA^h3noln1hUOR3_?siM5u+8mL z?>NsK*R}d2WtVv-+`zukvQEt5mxHbwy-S&KzjJ_gE#F!gukYr$y#Bh@L;Lp{dwtx$ zBkB)x>o%;8Ao!F&PHFL`+l#I*%VVu6TeD4h6Z3jy`J_&bIUXTBc8^^8!aHVf_Pc6< zzwWZh`ybCaZY>Nmxd=;f<(}%fRu^#{x7^Uu)!QY(Slf7Aca5(W8aaROaX4^5>-avi zMwO0nA6a`yi*99guW9}+PfPQR+V9JvkvzzWTw_E7wTwrb~wY&fjV~@H4bp zlh(I+!&mM54X8VO`>?n{P5ZJT+r8YFzsvqfvBh+WzV)sm*_^dBuWsHC*;CSw##g-< z{^V&y;ER{9p2XKLyk&jKML4IL!i-n+hlCx{1#2U*k1`r4nL^_N_iWd2;}^~;IzOR1 z|4f(V+Nk!H=EYs_4H`Oh;XqxV4W0k4$LmFNaDh|urudBb!D*9n4;LLSypdOxS)JT7 z`h7(4Bk^hAtNqcl)4wU-A?+2soww@SYrFAd%P zy50N&K3PB8t7Xvq(3!o`2HhA?*lR=g!_75rKT3x3Z!+G-|C1P>=9)XA_+^>7Sd)J> zy=Q#si?GLMA2)h#dz~6Tt{}%!#T085r$EhJR+9d;^s4S+-^F_B_M1j~dDQCS`=!Su z<8)mJ|1Yyg(3!OUCz@n;I?#Xez@5E??oHc0@!QV7tJV}9NL`(pofTiup{zx9bVYd) zo82eL{^qaneg9QN)PMaZ)|mOI{IUJ963Z=T;_UY<$yLoNLoMr=e|3#rTl#qV@Ado1 zJH^Gz=@-5;>&*{0RQvFay0;zN=cj=O`aJA(z$wmkv9~cG zK46aTJ-5NmHa-Eg9EWK;xs36D)JPZ7s^iR0R(5o4algS#|396YOP^WynGaTp*0rGJ zZHRos-lF_q-Z$y96E;O_qc*=Ses?a}DPwBR+Jg2)jS7SE1M;f!bBZrk%&}GQvrH{K z4L;p`Z+lO1cQJmZ`%*Zf3Da*h&GpO=u+_iR$fxO);0aBp)?HbvrMJa!Qn6x?DxXg8#M}k*@_XV#>cI8Si; zRDVu)U$anqOtXt02(;%V*~Pxo(zYrJw8XpT&&XYqb2+CfJ1XakyleUC`Ns<YU#Y*`Me?C z7;o%oc;wu}d4b;Ov;cI|FLLVZRM#m*GnF5~3>L4NcUO9re_HyuZ>0*k$Y%xDk4`d{^`mYm3RCAz_acA!o=tl!0(RFWm3W zCURSZRBb=~Waq1fEykyYcFwExH=Tabb=5u7tpJTq<@yFtic+0kJBL5Pc*q9vh%E{9 zvLCQMvo^LhwLP=ewQjX!nCqF(gD#Cpa0C2P%VDdh?W(PjJ;+{e)7h`s_S%lxqHV>t zc>6tZku(s#?g#fBo7fp_EPIaoiXSDM)_CeBIUUhQJAY^R6Es@>XOKasLXQ4ZeVo%= zr(|6nT}LganaST}HBg34;xzjJ+X>Jv-NBk?F+d3pSh`x;Tke~em{*%OnZGg@nh#n` z)76Dy^>hkwx~cQh^@N-9ztUKRbHW?psc;pZGlk9kQf>{~nE73v0h+EK+6Oys3x5qa zq$^f`YfsA^^A~2VnKkb>Z?;UZcDH?MpDmV%qd`;MWhqj!OTnP|#Uh^vtu~9{4(P#f zNA{O+_q8)-qRnQNpqG|g??W3*vpoeZ5?e@A&-U?`xDI9Y)`mpd>LpcTq5KN?wSUg0h*JVr=SrlSCg(u1PueDG?Btu z(3Z88Z@|~%E!=)?7u?XF!!}@-GV7K7vRPU##fV$QHDZ`pVh^_;gB#RyY&YSS_)E6S zw%Ydl_D{t;al6z?{!4aJwt;-^Do9A%!75l7+~0kVc?tJ={|Pd*vjCCVj6cA|19k+L z3OD2b&bJko3iE{aLL1=;d_4o&Xb`98lGwwbH}wdt!CX{ic{ymJsU_C|dkx6UuEYJ^ zi{!4LPd!DtCjBA3gu3!F54V};z|H16q|uVE)L&X4t&|>1=~72X69XEg7lM59JCL!3 z!p-E5SRc4Weg$aE+|Nl|0PhA`1QgK4b(dSiwdZo-7W;odQ$cU`C$=rz#omjJf;-B$ z!#>nfxJ|i*vQ-`lx2s#>CiMl3L6IZyq8D^;ja5_Qn1uh>>y5uBSJa$ z8Dcx}G2CbWv(#D&2VE(WI9PfFB}!0Qb4{3=+6!*1+owiv{crNr%1=wniY;YtY-T21 z2+@Z)WrGgcOL7a50Zqeh+*WNbrwRIUr(ZR*xFlw@GDT^_CU8N*H$nwFLzyhyw|`+@ z40R5cZJ>SlkW^2aYj0)MS%+EsT4&koNYmtYu!i;(+)my?s@ zjhFMJ2V$C-0y@D1Ch5Adu?5kOJin&@%O9U%4T`-dm8~_m(fho&NX4 zEz&`G3o`(8c@}Z^SzqRXyk0sWrGS>TIm{lmoYV0a`HP^Dp`B)srjh14znPuN=5l|7 z_SnXtQ|=BwpFhZb&c0y_m{-aOrZsz;&4bmy(aJ4xy6t;wqSe_p$JW_4)!Nj`S{j+> zgP!b1)#of1Z3a=0nn**$o}i66#_leCCJ$q_aY_82AT4gK@dk|+>$LlHetN->WNhl% z1~e_Fx&^s+^4Q?n#>>a6i^m&R-er)!mgWc>DQ~mSvR<{c2AXAB*}kGq`73i5=3L4N z&GRfMEZkVUujH4KRiz1KKU5S~g++F{(`Xd_8ZyFwSz^{wn0x!{dsP>BR1YuhN*X0Eb>Q9lFdqI{|g(m!%K zshg+?DdQ8JZkU2R-TW8VztY^+Dy-x5?pYmggxZ6rH|pS9 z$D_zJ)M>8}BJVC+o>x1~790LD{kcB!%a^-e=e_cMUG#QPbYP4*etLRvk=8s!KFi&3 znh08aG7K7*8Sb&3X0M?h$KBc)CTl{KOxtL4Bu%EeSnKo0;hUeF3Qv2sC-T*^)EAqg z*cdiJ%;;LY!Fq^$p!?5w!tH@uwc9246c5hphUW{{+Qtm+E#<7GRz;_h^Mxl0e=7fMx#F4fjoD}7ZoPUF zG3B0cd-UDS_lG{QM~1#ketS6~I<;#~L}@o$JB^d+JCBRrT&;h64tjZb?sxm%<$Mr&}ez`)tPtZMonHn zpuBUV7K6Q>$+yaNxiga8qH_P^ub=(L{e1Yj(U+FpjC8JOV|GL zz0moR_3EmJP2Vg?U03u+U0f?Xn>MhCAxj@(p$^)t*ywtcLQDMF;Z( zvJ#VjkFWdg^m{q+O3KEJ%si%ug;v2A*MV@>Ynmz=CZtXMMum0statA zR4ym5PENO6)_I2qaP{{#m)q{@IyLNh-#!Bu4;nkL?SLr*Mszt`ztqiJs9Ri_(D%)P z=fj`JJ^dH1w|D+edAu~z^=(kHTv%isEPuu<6*8P+o#z^Nx*m1U^*H5rNT0|ov~8$N zD!ow{nztq0YeJLH67bstH1DxKN{_@!1YpV0M;gpuH z?dx5ROuq;H+xGvp|CR1bnh&aV)$pb|HS=tIVf5LTi=IV3in?EVzwUnzo(_B4 zFR3_pU&TY~9cei`UQ^<{)FlyGVwz`y+hF78JS+WcT~|53%%{kl^JV7OX)jZ5q(-K% z&lyv+spMs8dij8AAKOFe6uU|L-ua#JFV|X)39-?<{zDvKV<7@^2{ zu^aD`>|58{&)v;%jXy45u}`$_th`pVDEmOFf1+1HPNFF-Bl~UsO3>SWw`g_Qi|R{a zOMZ>hCx+X`XwyYkZLQ*jsN`&KtI{DHT2Qx2N__jEp_< ziix-s@lWKSDF4{`iJlo1dH%&)%DPlOuytkb@FChUIy2~NEf9F&D8GjtBL8ZCQXN%x zsVF%AVy;(CdDe-nRaq0V3v)Xb#1-Ewe^G6>4VO*a2~C#MJmZ(HuRMHeHL3ekgKJIv zTfA<)r@g*odb`T@xt*qWP3bza$IiB+8=UtoG)wrLjz3+@x@8 zUbCFC>o2)$p+0i3*{vuV-2g$C|_H;q{OdyPT_!p zBl(f}eBsWbyCvlnC(T3b%R!-QW2e_9y{E+|KcFD++lD8a_w@eR*haUMd1pCMHoRa{T8pGTNxCGD_)YI~VU6 zGQP;#mGf^wK}owxCrhe*o_vBSV`Xl-a7z=fDHD3}iA-}@D=x8VKrZlkdF#?X#r2E$ zVsnXD_I*WI)id)h@oRRu=B{4jYV-KoC)3Yf`$fG*4cJCw8b4_AuE~#0+BD5=GQUYx z(>je;*DbH*>$BFqi80t|CjVC6Vq03ZsPsi~kD^uigLC#~pUnIvV?xHbjF#!2XFSS? z$-JKJm6xBtvN*eRaD{L6Sh$4pJ8>h-+Rs53{Z8%`_bI=cpTwW#E`b)NNlG7it7Hc4 zNx{-~X^^~FIl?sOJcaX`4BZ_4R=rJcFitb9FnnWVjaLm8W1#UrV=Y)+HX1j|JrI{B8Nr z@{01~6)_drl}z=->ip{OL1*9u(BPV94;J5xjir7-gV&Y+lTL#!%SYl=(EPMm94?lN zkHkOV?O8EgGRR|Oo4gG4#@thy0k5`$DPf9PKdwLMq>lqV^s7PhmJjeI7liSkCC;d= zr`2e0Xl82)fO47wn$+g;SGibLhFx5nl`{Fb93=lC)s~E~-kvV{OMX(J_*{$w9atwZQs`ZJF&~+ai0KeGEu}u1byMtFkZb zr1+ib$R1}0g08f)ptJTi_XxOye9jf9(2JlqOX7?8LcXE!73dS|B6Jc8`ICGzK9n!v zR)X%SNn8V!Zf9yeaPtIOWeezp9|5IRq!`ep znkV&>7t4L+A0cF~++P+z_fsq2jr7bBr6=s~nZy{_4ZvemF}chnb`k83aAT)3!R!P$ z?KlVayP=+)EZ9ZzFF?RL#g&Or0+>S3uhSLu;(ZT#d(4axc&~rh4XhjY5O!spVD!0kGp`J?OJ4kvY)fnGAa54uf{5i*OfYzOoW@ zE`_jvGa^v%GdVkG7dr`@>lto3Xj%ILct(NU#(m3VvW1XOEhYoBp+ze#;lEk_M7ay4 z`B|w4`%ad_u9j|4+x7B#W|JJH_%I!nFPN2}U+4()5VW{G2CY-A;nd_U(4RA!*{gU1 zrx^jdqq;HC@@ZzI?9b>yuapt`VgP7g;^dXgM0o_$S(yR+&lo0EvA`ZDEh~byuAkXZ z;F^D8vZ3GSvwG$bdr)}=I*<-A*Ok@G-%3;1!*fYKql7?t_ABe8Tk<7&nzB!sAopfo zC=;P)z63p6t=L~-onpe+-xUqNNjb$GR;F<4LAPsD_Fp-U`&2%{ zUI49DyO`tbNM;86Iqdpe!#V>V)-loS9c8vM4C*wQdCl%uhO$P+p9__n@agh<2)`kn z=i06U?=jK&OFZy=Q^`}`2}(j`${pg9T*FHM*4=GD;v4#(qrg}y0Xk>NUs?W z_6O;2*kf8PzhZpYRZNL;4Wwo~Tg^U_XR&?Q0Qoi>B{yOB$a&lWdv7)aT0GXif=ji& zM z>`zjpvY%Zk4}-SpD=%jTu_NW>Y@}2ztdcu&9i^_^7vdRB3mY%Q%WJtUfMwFyhfHVj zw$|VBHFrbyfKlQj4PlzL!U ze_6sc9MDlG*;M&^kW&3CEdm){w)m8dwEQN6+r46>P*;Teq zLcWCuoLbvHl>37Vu@2NMm!{dr@VlhZToBVt&SN9&I-!R=n9FB7$es8F(j3h-*b^2b z@6$~*Z_(XgCfgE(JSD(ZuAQPhmagzyrAV%sxnKRJO=h*{)(8E=*@DKgYL{moPeMFKCgUW~;{+N+zinE6XqB0Oo|8%PIDU zd?1`mFR&lcZ5ExRcx65tBMs)O6+dycuwFhThk-<3CKJHHtir6bxtVI2+X&Z0M$?@u zQQC29#Q8#3DM~yh&(+jtyPLadXW3#vW)fphl-`Ij`~@)^WD;)rU#nNcUbsN^s^&{e z9{XH#s(QcfH(P=-fq!nv77p1#7Oly%T#{F6i)`Jv*UBH_S^hIyOF_2hFeju>cz3a- z#*^tLeIvvuVIWWUQXbo^PI>kY!Z)B5Psd$>y?HM7ZbB3j4zplyrYYxQi_m&i+}0P^ zIOFvhn?iK$HsEcq)fiGvXxuOE|B+&O*LcWZtOeh1m9N_#3oK&<_mlu z`yF#=^S@gn_yShMXbyW`7p` zHODKZ+SzuA4UonFR3unWX+}ssQXlRYsZx9)*5cl4BCO-25xQ*g2RVh$7L$ZlfaRYs zjg;fUE_tjZ+Z!70%ZhD@N~l+ny?cntsX{+kCc!-N}~8|H`%5-uf<#fx9C9D(%%bx1F^OV?dKE)4}piKE_?Q zUDy2}Rsb!sPUmaYD9^Zo_KCWEmP~e~Vz&>}cC|L+j>Fvt`AV`F&0S#@zzXF}+YcJO zP%bk3NOp!jA7-D);xYa<^P@chwBASZI>t@h%#9UX?auNOt*7~+wgKnL{H45-`*At^ zP331fTIg&^V!H|pY}44TY)@$j=rnW}`dYGqlesATW&Ty_rJXGv=I1k+vX2BbA3xo8 zK|ZHRliyYBDE~C7o#~cGum}lvyKy_UI+g(5_PqTyN_Qp;Gr2q^Hl>sj%ba zq}{~a;eOHmtkka>1zKvKD)*}w+q-Eh>^YWvalCcA&X4h|o@Z^Q-^_MU+DaqEZqARS z!wRokZ!gr0V%OLj3wF&g`wrW7WuW$%a=qHlS9OTH3W-g{6nmMwrb# zS6po~lu+#v?o+F53l<*mgKVdi2%(4x5^pL?g^Sv5N{W3ptdzVJ;3SA;1V2r%*g1Y0 z=to__-!jLF+jNV#XUb-4sNkzP%@~wut1BC=S;Sni4U_k2PK#ZnHvDXbAH&Y(E=%7sU6iSsInrUlongfQW(K#|-kX`Fxyinfezi1VmIA$SRD5l3&W&I% zvzz5gQRa5DC+%Me^JI5P&v$}*O$KwDl^(noP?wdOU*u?c9s5Mi;r45d_D$j#%@%EU z%}zGc8q61IzhVb*jb(S`Dc_B4Eq3Eu@S`~|=B)G=H$-!ay)53*(Yo>q1N@ACdN=U9r7+|kTP8Im#y{%z`f|j zwvtX6B8{}q6$9iPd#pWQ?j^;E9p%}|b)fQYC|@&;xZ0e;6>xtud-)~oHTHM@1$&tL zkNutX<-QUg@*B9bY!c_EX(&{1Q~5#Mk3us|6aJ`X9=Abw2WzN5@&-*;(9--;IL8ZI z0l!|8%XMdO0Cs=I%>`<92h)rFmK~yulqM*vm{;;Nsi_ns4wHI_1MFJcLEAw41Iu)a zucfEu3-g((8RpyO@zuKOQB^0a_gTWs-9ZPnzonC{nLS!;BmE$5mYM(!xPkqd?<9Q9 zZ{eG1H2OLEblqs(M5jE1+2Ch*X>d2hn@UXI8*aIrcg;7RcaAlrx%}n2(z)EJlhJ5; zZ}2k6POqHS8k-regP!ddx(nJWO&wtaw-Z_~OH8v~w|rZ@rs8Jl(b8che-(7eFUb$j z|30^W&cd9TIs0;|b4zpg=65W3UbwY*TIro~*UDK{qIsjemy|8-ls(vQ`By?0Sl@`& z4s#l=|6V^*UmyNI>A%)b(X-AI^jha3`rB|kWTYX&@UJo7D4TYfzJ%SxKf3B&8@kSM z8|wC(o5{7MTd}*{?H9Kn+%~u;z`?*hE}5oou1j59^-Z*y!X@rB(?TpZ`&6Y>R+sfG zzMH=xZ&L2AoUF`I8GF+gq)$yBkv=(nL&loSq^t)y%km6`JBr$sPAX5Y{Mr16HOTHQ zO;#?lx4G^-D-6{<(w@_H)IQU!)?Nb5+DgNlbQ4UXhfOv_3gFbx+!+ zjGLKBIg<;X6lqH9RgA7)YE7|k1&VPmTgi9O#0$GMZFT-mpX<(Rcf%UDxAr&9PT>r1 z1&P6YfYlLfZB_#sm#1@2xWNC%(pP{-b$oAMzw4V#Hts@#Qz!%q#i2Msi@UqKyL*x1 z?(Xgsmtb*s-^l8<@8$RZo_!MNl4kGBoH;XdUKv^orNUb-j}K9I*Zih^sS7vc8|;QP zZYNA0?&IC7d3^CW=F!RXr>EAd)N`wMxYq)&5T7L9AznK3Lyv#mN1I+6o~w*ZI#r7> z3xsuId9SkZ#f1g;a>i$RWT-NwwAhr5$#+xO)X22=Y3I|cWwy;3kbkG}eQ}t@Tv={C z?HnlHl{zXoLoq$rGi*3FgbM;5zkwHlM;o{yK;r8$=Yjry0b)I$tWEIbI`T1DLM8wy z?M18DJ?vf9z%Nm)Q-9N3ME&TUF2)dLJYiIf{-y(_jqZ~@o_Y9~Uzyu^{o|#0#d*C3~NW=VQZ+S0VHDVLI; zC3~ixOl_a$m$5O^n(dL_uc%r{T3Kf0B>PUMM(iLDBzjOE=mSh5LvlIXA}|YbIhh;G zjpS+}hx)N3Ta!6Wp944j5>=b>q;>QI-1$8pXZ6FhnyI22GHuv;+#9YhAIG0meMb!a zp-s_#(7o1s80eVcy_ia(cG4C)lOD$mVjr*@xMh5Z>XFK*sjlU9Z*}+e-3`AP+qr2>ZB1)T2i&`R zgqgdTPkEm74Dn`sVtiwKo_Q;tL(N5|TE=wEY%Y+}$hBR)Z9^;0mj)MKEXdD$lv6Xi zYvy9Kq<(tOw3=zP(}L2~8P_x0WzWkED)?SBv^1u?UzKEQ@0=#YN=Jd|yT}*RX4*J*ncmvZMmAe7VGNv1IhDl(m@b9-+iu2`W zaXdecH>);7w76A0L(@!~pzW!1>E7!Z!%IUeW0>0(w^-Ay@ zY1ViwFx@tE(FXB5X}!XVoMS~*w&hK!TX9I?&%9N+h8!k4E7O&s$@nilEW;-wA>&)- zs%$oQU;e$qppqqJt1A4gGwoTHd$Wf-GlIx+o#!%t!kF~016_7mFi7q^e&_{sb=z6#l?Ky^TE(j3(UY2&qj z>pb=A^gr}V4Eqe-jT?+>-QKvxn(Dc4@~Cdk^BnFK;8kXJdE7MBc6+Uxt8T_lAfHNK zT)uYyDzbc0>8#>zg)8&#%%C+D+;BU>i-#G&p!)@U{aSiyzdn4LH)4`h%{9}ut#Y?zROzVV`h}hI zKj+@ap|icR>SsRBXrFO5;~4m4saZ#J!t>e|EH4T#-ET2f4zez=pLO0521+;OiNt(z zB^3${)?mbbB3sPX;%0KU@%qHQ;8Hn~uiyr93g%M>L{urejGcsWVK@t$%hFtbZaJ6D z1@JBSHGCOgO|?mtqUx$Xqtux?4aDkd3y_f6or(2viMYT*4Fmp&N)IPxEM`|DTud;bS3?i>4Mz4hkeAh z;O210xKrF!E{*HN_vh7oEGOc1fZM>$=az9#xc|79Ts*gq&*Jr9FEv+9SA9}BRFwL? z%0sPH*HUxp)#?T6a{U61 zxh?Zc3SJe(m86!LDt@aPY@6U1>*_8F(l_N#as{=59>WB(U)cWKd1SU|ei*--zryEX zX1wL^@rU_=ygz@J8^`^@)#R$!kKjTXxkiY+PhjhH=O6G+h?HlmKB`JpWhzOfR}WL$ z)J9DQ&039zcAK_bTU*y3+KEv5=>FBV)MTi-a6EI1 z9HPXDqg_Ak>#Z{@H5yHL`%IH7Q8LD&39;BjqoPGm36{xf@5wr5U7PPM#8`JD=V ziUUfcEL=rEm9NdyvD-OXxGY8jr&vr(Bx8^ra_I4lg;~O$#rip&JHlmQ^{LHw;rsD1 zd>iciCh$A?GkgxOQ`J<}S1nXMS5>I$s~cfocuQ?nH_&)#YH5aR=4<}Z9Ml}q+}6C( zBx}m?rO}pXoSM&?cbeUr`#GH)9YWENGnU1ISlJ3M;d5#n$9(MUSKiXH@##{SW zg;!>l=UC2`-7Y;-a=!R_k+x`jVOZhag6jpz1>FmO7Tzj4U3{;^TH4WazC5p@Wz{Wf zxP5}-uCvNjU!04|_I^|vw~|+>1sFAVWP;sXGd`YQruwPstv;YmQ>!%fG(j3(!)VkR zr@Ba;r@p3sk3Shr1-O~{YEO+x6RdHmQ`BG8Pq1%Zs_v$CsJ^Q1qy24FzN(k}dbCC6 zwsO(nGHzhq*>q+tQ=Lht576%PU8)~-j5LsAh{MV(d4+ULoGsLIwRGworM4WamsP0r zuWVk?t9+xSyzGy%-KE7P$4e%Z)GjfXv@Y3RVkx;@y0~nBrGEK>iYt{B7`Nkgt+Tgl zk5D8MvY!%7M3Q;rV`>ZCoyliTARZ5KzL;kc-(7V?WyienQ~M(yWT@_`cBtlKM#ZRD zl}cq&g@S?E4X+-mA*vOsL#k=`*9EHaU}i>OtTXvj{8YX%pUdsRe)cIli#4(5m|*5T zJ(A6*;91&U#nazqr#}9M>CBbOkw(R<%%F#%R`5`>KP~ZPbU?-`G{d4TH^9?g}TPN7Q42&mb*5%9zyloQK%0F>1Dwo3=_|aZGeqVlr1t1Ea$26%kLzH zcuq7V_mJsWv6oSwsBZLda5K-*-VDj;8HVYAol_k~4W4E^Ezln!sXs#Rr+3g<^aZ*n zeH@72M7)COTfqPRq{dQf!Qzahs-XhC2dCX8maLP1fX(+%#Hj%+3MJ@+=_=ea4lvgIw2?1X}i3dRA!pL{P zEOSUL*^@j#@}z;9NnRqSlX0lMhLJVU;>P55q8%v#L+l2eZw*m{)G6M?9w_9WDBBb_ zAaZ+wftEp~oi6jr4Ec((S!$~kN&$!fgS=IlD!l~8I!hiX7svyE(l(d9Q2DJdS64ih zW^x-KVChOLWdnQxb`hoWKC+GcAK64%OP)|p5+US#@)$9ev=b}I7vTQ}kdw)^WT`?@ z3l%TgOW8#&S6)(jg+Qe`njEbxCmSgHi9JM+5=!n+TA^1Cz)9*X2NEIaK}Uz%lh9(&d|^MXn-FD0h?~ zaEa#usjWj)NO^dw#fm5Sr&NPfD^Jj~k-%^|5Nnkza<7z3{iQS}8MxFslmkQsQA&iP zrgjfV#teA6yhl6!gPUyy*^=yw4AK!;nVx(Bc{s<|(b=b5N5o;}e@ob*YbXBPEC|7Yw8*^(GSKEMm0u2+=eIwSIrOzOqWXC;cZ+ z22#n(%akk90cASTRq3rvm$tx{VL2*$cBO_?3^e$6;u#q)&L)QgE9?hcPeXl>^T{0P zAh^EMh%L%M`8sJ6UsHneMQ%s7CPvF6fLO_39H@bwHUlo{BBm%^$tK`weWVT^Bt_7JoqJgnpi)98G$8(mM{ zD0XC~i4io9O!XVlPU%2g$5XVSUpYo2m)rukXu6_REW%8(im=Gz=|2fYXhRu<7wkwP z$yH2-DeJ@v)g>`edP&79x8w>6J|FToI!or{*4$LN4wX+#cEvEm*}1|P_O7%?Zq3HX zS<+W3T-ZmwppT2KnIFVMSw~zZn@c3wLoN_6Dy3vEW-gHg6fTdkk+;ad$y1Izs(@U{ zJ$3dI8UPJ$OLeESQGKs2&!Am!qR5hK5TBg;l!f#`!X{DD1L9xB#>^nSWS8`(+)TAc zG%@vw?ZPv80$t2%Tz@Myl{fM^vXHt+EXFF;isY&KsC0K%dOLGv7g-N1`}uNL(Ij*H zNVS%xaA2jlgv;zOt}!XPM9H7bqvvy-r2?U&EXX-rcXFfr!;wH$ zSE`sx#7-q!YA&3nVwmwnp1fX+7jMV|*vC{2@uaj;`2lQtEO$=Wu9V0p$SwR&VV>9l zmG@4{V7k5>B`reh+R#Vj7vvM+thgE#oP$8XHo9)n%c(}LnVMM=Z6Az1L7`N_ybx1~ z%hDius^$|Jqp0M@bh5ISmdU^AQDSX6RC**-f!W_ln&UVp^1yz7C(>N6<#+N4`%d{V z*d!;#mUf-9RApg$C^E6#SxhxjHc+;(VMI+ORl3Ezlm8(Ou`h@n;!~;?`3GG+kTj9o-+b$oC|v$YvF}Q7Kx4FvWx1!~MseRcyj?@do{jCds#AzN{i!;P2<5wuuF!U#(oDeiAdO zYDyzHN@+zcp*B)0rCZ1di{wt!Mk0WEL=Td$JKIT+C9*ZR8j_#$FyT!ur9Uw?`9DWF z(Fd#FJl3DSE=>}Th>eIcx-;FAI_aouUqfD}}2K-#9Pz*-h2T_Rn?Dk%=DWl!QEctcomlqO13vb}N{?^dT| za8DLc7Nx$FMDUcBJVU;tS~2aBMQ17>@i~cD1)qt16^i}`&O?Z9r2|?zS~(-NBPJ7} z@)0pno=feJqZL~6Qg+K6*f6ie6~K6#V^=hk%q0aSg>WhZmG6W<=GfmrhI&!o=qt!m ze@R->hnYfNQT9lBnFMR1BUBx$@DpR8d1*_&0mk@JSs-U9Ytge8Qo#;)$&s|!B)pRqdWu_2%xdD+&jbb9Hsn{X+B{u;5EK{b+ zN0nMiODS9Gt}K%O1B$*({Dj?tNPJb=O9tY1s*?DK_5LVXfF1Ts@+|V7iUu1Fs#g`V z>~`#7{*gD!-H@l_lo`ZyXlyQnZxw_(=QPp`u9pXyMRjMI&~M;oBvM}F0p$tlLq8&( z%NxL=J1Aeq4(@^oZisYDN)=~_i{%^GvuovG=#iQO{rw7eBCsIkhYAVaohMw2rYJil ztghlIQ5J(GqZlM~7c4?okrC!Q#|s}sQLqZXOH-uH!Xt5j(ox9<&#k>Oh4`J0rz@zV zbRX0Ny_q%OB;IGwv7eZu++Tbg*N`vc8lh%6Sha&6jdN6U)m-&{^-WbWPP*T@8+=oo zLUyT6vBfx94`40K1F#m45$B*}%9E~&mxUx(o+HIR*Vf$j)Y`n#y?m#oL%E@RaQQpS zXG>Q3WlMh9>~g8HWz}-9EF0Sdo7LXTX>iSO-4cG2(xLnDlKaX_qz-Z{_({P^w33Fs ztPggQl>|rDCj%)PkS_y$iunUdlly$6YKxlJHqmv_Uoz<2#<mp(}LSGEWj9aF4*scqVup zHC|EIWuurON_%Hz)zQj67Hvth!nEwm*@v<}=6pik=V|Vff_X&?3hNhZEZr*W+Gjh@ zI;VBD~z`DbF!*;{|hoggYt{_Qw z6p0u|TB%s<8Wyoub{yE?)47@Ka#W40u>m-FrZQ96;hYb@lHadtq&cJ=sn0NcGWwZ5 zxF0vq@@n7{?wjqm)4#2Mq2EV8gWnt<#k-gHThj&28n!8U+~KTHN|TDa6r9N0krS8s zDXl|#QF^0{wOOb0&KG?s9b=haF}*6=R^aF%9+caY2N*xDIxEnlsTkt1yijT*HWR*~ z_R!GQuWDHZQBkd;UZqsE+TIO5RNh#j8%ZkV3Sp(pY#Zn!kMeW4Jf;`@jPxUCf%i9F zd54q28>zMY>+Bjt+UY;IwyG1FK>aFXHB*uMpPmc6^L;+~9SLY0XbI>T7!Y_rV3PlN zzovc$pPOdE_?$ikPo>YU&g~}yWi)>dN zUt9yk335HM8@-5*g|g8`C)4ZbrIeM7ChHJ-WrGwih^}(iQkTUwUED68C1R=fOf`Ox z`igds{x`Q+cZcUH@0-4>{LcCv@W18n;ji_d8xS9GH(<5@BEN~gv0mHEQ{4a24yGH) z$LuppU*^Bf9+@Gh6{IgoADM9`^G8;boXfdX!Cxi&$~##nItSw%v6y;?y4nopFGgmP z83(PRd8(Bn3R4`u)_E0|EnCWLWn(SN%4=0Nt@=_`-==X~cGeM}$g{`+OeA-ZkLCOD zf!qydEmcK4R!+#xr8nXp!P^xEE&Cq30kfxuD@+s?H5X}?`tb}i34>v;OswBhMJ z(%)rdX1&Rga<}B03pJemRERV44Dny_oQ&ag$i0j=sDdOnpze1mzE$FQz%e?NwF5mF1SZrN)x}#gB`lN{cLp zstxvY!U$zAc%j3g+lxU4zs~S%JNy~Jq)-O1Czpw9o#nQ)Dz3^@wX4c(GdqJtQ9eMv zV4_s_G?DruqnAgdR~O%}{;vbs;6A}?gJ%ZK2srBJ>$lP8vUh~HzxO_`pPqd@ewy|h ze0W~oZ(m)uBzHi1a`KkM_DO3}=M*;3ieK3C|hw4}n=SpJ!+ zw(1%Gfb+zzat&30YD-Jyu9Po~aSd=Nws@H zPq_S(kKdKpGIeLxqJotr0p$-XeQd)V4O|z6P4YVG6kEE#H%d7Y=ouMaX5{DKcycH;))VRr`F9L zS@5RBRsPvp&ACNr4-7P$y3aB}|WIf6PU7Tdxq?w0N^9#-U8RJ-_6 ziMFhb<#_qW3h%17*30&8t{c)pQeh%h7c_%(lXTHqt-1{tMNb1mFF`o$n&1j>sa$Pc zTmPr@_7nu+u9TvbQHQw_&28f_b330w{`#N`!SzF;Lly;Z4!RK-9auX+@jvU|*#CiV zrgxR+Rrh|{-IVCcFZamnlR7=#`K|ibG2b$NtV+yI_sPpGnr!J>_08Vi^+qU`JjiKG zH~y05xqh(Q7*n9hW|*bD&SestU8Ad}m064C7O3-QJCP&e`0;{OqD$WhX1vTesUsI88zu@sX6P=&4RjeZE*-rERVM zsqd;kqRmkCgTslZ{KD13!P)oPCfEb8Ql6H^5j5S4oy&h!SJ(Y(2r!w~w-dOO}f zZCFlpv8AGgqk(9VhmeoqH#v}-t{S8@>N5?K!M!Opw9wt=r;+&>hvucl`3rM|to7NA za=i;2#i8YEtG3$-*HQ4lJW*lE6uvw&0e&QPGSZ9~* zZJh&!S#lbg&%EOAXd38i8(Wy}di3(r`d;?`C#Y*^tMES}@_ceB6VAU>|E0TXu(Y}(y-%iE;8N2e^ z^SFyiy7Zwr!wY>%=a;8eeXysxK1wd)22-F~uPZU0bGLgu_3(G!Wmv7wp!1|#c6~)s zNmk)+1z+<&6bvrvQ?jybZuvK`t;SgY0h)HiIb6J;G@$?EZfgvNXt#EzPNq<|RK15b zm(OLIQgcx^{e&9tMyiPUjbE&`YSo5E#u3={bu#O{61`{nZuH+5Xb7Gg92)X6cz8fP z?+d2$ni?eIxLbBMZ*jVBa-)RhasA_ilTN2>NuQbRp8v6M3)Zz-6|1Y}+WWaKOFziQ zoR?<2zMb1!(^FHF+a&!2bt2P{SR>T2r&eAm*I0U%O)L}3UP7Dxz2ZXU&8i&iVLLi{ zyIzZ9(eE7lk+-ThYmeyib&GWuw97UA>KA-I*OrsmhTLcFEPq8+qz=}O*1gr&HBNT> zXsY8e*L>46)9bQ#un+HB%Qwb*runQXO8<>pL(Fq+svJ^MnqQjzID^SJlcC9+o2AbE zJKt1D79TBnR9eFlTfV>Yk~Pz@Qv@nNFX3lHlbNI&qPwSQt!l|`CJl11@X}$m*{v6> zjBTGS)c(~z(ec0`IR?O&#ON9>REnGAJmMIgz~=Ezbsuesc95=>u7UP<%}n(;Rd+s$ zAH+}LwJI=ii)t20MGs0WrMYFnxa|sqy(3+M(hEn*|u^usJ8R7r%>J%`Rb@F*O-8_%c!K4YoU{aD#z}ujl9REFaG?{0DA7=fw}@>+=ks!rf<= z!HaeVSyO2xH4#{6TYHerRTWb;p=xc_{;Ei8oVA*5oUO=K-9E~mY+vdyJAZRc6^@Ik zQU|3gL6W=47vvx^6}QOsL&YEqo*mVs+R_Z^KR62|$_>H5FHjgLnw+S0k0)+G#q$Am zFEf1u%%rx=Ixu1CF=_N{IC#8Lkg)KgWxhrMw2tQViwW5a~B5O*|m3g_A}&&g4156XBw82hJ+8 z&|5q%7K`nqi&7bsg?)fgodch}T;>!nr6G{J7^ROgLg}V7Rl2~TW4f{hXvTLqFE=BG z6Qh9uT_x_q3ndK>DA~}<)gi0lR4@j}*kW=oc?~MFYvg^fWw)cou^Eic(PV$JJsAOH z&;WhV7b2N>MeHRG!$V~$F%DldfTE2eMnYBh>n>{-G;IGuF;Y*l0Z%$3PrclOTv1ro=#T_>lu7D?U385hyk{!tAWK(#hG(!y~oHUZq*oG>5)Taw)ofs=p^jwQ#Dy~qX_zg!>}D-Z{PL@9du zfU-y#s=YP5H zlc+t?xa%VnmGkcSoL~Mqr!iJZL=nNlAEy>HuGJBV)k$PEG6j9P2JQO#ej(NhMujC(pDJ+rRYpV<}QrXY2^%BwGXdVP+?9)-1optZimG1e|IAM@}k$^ zzv|#8`e4q^!V?}w8?GQ9yu;j1z}F*St@|(s<{<{6fyg_d{Jf7R+YY>Q4Enu0GE5g_ zn7{FC6H!&2fO^Ox^yFkz7NmF$p2b*6!p!+$_0$f zEsWl$|L@$M4#lD!?&-h0@PFNe^y?M^2D8?Qx}^aqeKX{PmbkZ~9uUiNwD$`<+22De z+5$N1Q}VmyCT$n(!gVnby!kqe#P#69=qjKfZo)Iy7U7<_TnVO|F^OOa3?bEWg0K)y zUFAX|P}$$<9Mm)~LHk-EMS$fHiv4pMJSi_Cn`np&G9}-Io7Q7FUfE0ZAXlLVG#2{Y zfyya4US6X#APx}&$S>qExCdP%jKmzwvmk|sWBYfdN~ueQn=<3@G+Sus`0Q&2LdH z|5LOIQGx^)-bVyQ>Y=_JiH!9TH=Y(l6(2!Xp!)fnTvN;zkD(U+O<93#1myy7?s#dJ zbXEF8KBm+sXH!?;u0>P6g8N&O6J?ANG__a@%R&lNlJM-EYkYz)0*Dd+kDP|)|gYd3`bpTmdUaRZ_-u@5aPCdgKo+8hcW=hk@H0mt<7d;+X zt0_JsgzQJnrq)sQ=`yHw52AwCUAikVSU<*4ZAeezDC%OJL}VO*U0>WS`XGMvM3%e=ZdFfR{|Ig6f055$gDEu(s_iB4 zgjz)OVp3=ql|)C8t)YKmsqa`X*(9dQd;ya{=pX#2msy#cwu2C`8Xa7>01tKq8F4=U^v$R~RFg1i|FjP23| zaj_U89aa_sL3u?^1;Y0goVBK;5qa2Cag)0vYt~g-kVVvSvM$j>VdW60Y|1e&+d*%% z9qRU9Hym9g74j8X8*HY=a-^c8t`TpQbTD9MLKXf5*>)WnK4{KM>JXfhZ+b1i{wWzm}%C-nhrN0t0UI4*T3O>_x0g3OT>I5S+b9&J2RQ|8&sJVYamq5fHgw>3sV+)y$pdSqACS^^^b|#rOc?w5@;vxR z3_*7K8(hIaAZ7$%mD8j;&{gfFn=_ZlvslT8VFj8*J;Z3LiKB9kcwS5aKD9_0F4vcQ zq$Nr!ek(&Zqz54WyCIWTCnKpCsx$WQc4Y@K0e2TohjQj4ok?{j_Q|i6dSrVlk+i@) zZZ&aEEOh~cBR*rD-V67#(@HI{haQq!u>(D&6o~Jn?MgDyhfX8+$_qukI7kSGChe56 z44k1Daj{D!e3o8-A9WNFG#bu+^Prx8My>)fJrS*%E#cNIct?c82QU;afCnfa#>Fk= zIsiM^1P`=G_6?(9%8}9YaDteCz4RSAk35b1mq`s}-_oavRC$!xMwE~*f-z5L30p$T4A6-42ckL#}3+E4Kh9lO=Iv?40*sr?+rAYZ-!Ro3G_qLf5ZZ=Z9t8>F9Nh%j8$1#5R`#;Y}|4yxJe zDf-je$^1h`#Pd#LS5w83&eg|$pt7K1T*W@i;WlwI^t=WT%GvF+~JmRbyW{krQE-&o9c_&2>mWYBfVPx zOy3uNZOu$AJqCNV_v&Fj;dQ}#kJn=#(RY|ffby=UlcJYyVfdhGttKfo`Eo zf}i`g_L}0=+oO)@s9`#HLP{3fJ9d<>w{T_e@}@#Faw&aO=D*o%vw|~Uq_@h*%&uF| zuc&QtYDxEE@3O^}jIF@7$Z%{p-lYXTEtoJ^**BT$TF4154VVhd! zDwEyCRxZ_0I+u7?nDxFh= z2>Ax`754IQgP1`y$10IU(@Zb+uIf3^hrR}r+hq6<*FO%~_REkvcJbdg{95zf#+!txeNsaoMi) zxmnQ#i%M@a z7{Dv+i?wiCeTu#NWAY3*4|SLTZoKM;_Ov0!ZI$Vv`HfF>;F#b^!GDMPM?_R#Q*&DF z71dKhCkEXP`5M^5^LJfeHbt2xwzHou^~qhC-72$o%3q20_{5(_;@E`Pcw2&hiXnYN zM(1o}fwg#2+3HG%-QDFWUIH7g3q`U{ATrUY7`&lpGu`Mp)K@Z^s!hY&kjkY=ZVvxe zQ=)emyiKdkWxm#c!@>JQ=7g=Rwy>sez29oQ52_dVEmR8X?R7f->b<6pVVOzxD)y}r5D_#j>__CznhA9V zM#Thg4PH|%DrCQBrLMJl3wx3n>@=5mFIt?xID30abmG#)F>#;2<$sUIeJBg!-zRiP zI+Q*muXe%D!kU(N+fUbh`7Y6pnajOUpU}|S``QUmS$wZ_Cs?K486r-cS z(zfJP;kWD_sgsiyB~Fd2`(wzD_dh&-w2Nz-uqkPB`rB-;yhlZ!%MaQd)jQ82W1+B|QRxq}@f~Z)jo18^8LAy@h$ym!s8oxoKQ%4`AQ`Ff! z%iUxrF(AD15Q`*Lwc)g~n;jQU6^9Qe%em4V)LWf3lj2ITs#@{Q14?W?t&Qx8$ zS2slSfX)-1S^HFWwwx`Tl|3(GX{vA1;`r@xHRJr^n#4{2**l?mYCN*3IoDD2u3Uhd zSUYI}aff}Q_R)6KA2e(*t~To2l8jZ*(NNm{>O%j7iL=LZ_z^^~4b|=j z!L5fWz)bl}4g4#_E24kses9??B}@t3=H+P;_2b;S>hH6U#3qh+_Rp0ci)-gC$hn@e zKKX89=cL&9ytss)+kS>5u1#y0z9#K$*0-X8mJb!PZ3CSD!C_+xzY!})zHWvw*w`N` z*B5%LZiMcprn9PuyU6@TPoR1L-8=@yaURuxsbplnnzoH$m0LRxUvGzZoPTog&xmS% zSIs;9^CI&7X1LAP&oz#4(`lX(&0GdohNFK)&7%A~OYXIdN6Dtt`6(fZkK=pAA52)7 zwm+k8+K+TLe{I?EvcD^KTH{?K;givXdCpB&57VyK9nqgOgzFn?ziCUgshS*q47&%n zP#wXF6F_9hA!G>^fLo{*FmJiR+F@?A>63e1^E{uee%?Wy!WxGx_9!!73ylvsWbUrr zp*J^twc#{|A<>fR@KbQI_ZDz`W1V=(>k}V}Bqab}{`oNq?#o1*B z%eIP9_9x;T`0gC0ves^4#F?Pk^pWHV`? z7$wxQ_9;D$RW~H3cKXlsW@)jBK8cA*sY$(38l^o+TbR)*?@ZCG;1mt;5`c@7diiQ6EJH&B+4!Hhp! zL>I9qwfo(EH|b5M%#l9F0y+l;gf9$eWZvOdzuM5C{igNCx26R5K%K%c$nDL9c&lHj zq0lowB&%!cx0FVyO%fbG&%_5L-b&n+vNrW)+NkWOh4qS$miDe(;1C715=Kp8)jX$Z zrcc+e)^9h=Fb**;Gwj!&(9+tk>fL;GHiYR(i5SQ6@F;76D(6VCzZfBTD*^nokf-fM4~vQ0lU`-!|?`g3RJ%2`Fe z`ChpvGW}D2rrb)o8{aZ6FYy*`Zfcx5H$5%0US4$3(2{4C-qxi~32uOws8y_sk5$js zwbOUjC+cq+|27QJtFVi!rSVh0ffx5+W*RjWeBGtsi9Zz&!B<=o?BX)%A?lbaVleXx z`nejaBf1!OPmi(Yd*1E==77(E*CO^s9Q1ta(J{;;qQLw~JzAfMs|y{>9&wz#zT=v0 zuVq_)bk3UW!RZlc8`Ga9HH|AzY@3>y@;>EKx@TtJoCk#~ONN$NEAp*TLX{j#o~IkK z7QU12mi`sSc8_7V(FZutE8PZdw5AulkYm{=V1Y(~@A^oZB6=XHnGbyjF2 z91s`C73G=mIYP5 zt_kuS;+Jd47jBj|+%QakQb!sJ-8LIj4OxafU1!aH%}NcU8o+Fz4pXRMf|(d720Jd> z?>H~JavVDQGW#dz9O;YHMp`P@phCDPHLEddw;HnCZ+IQ_j`9ui9~mSD3PIZ=YX!V8 z{_b@#{G-nj%@o#CKU}M)r%EGigmqul-SWhO=h=<2k7P|w8Ju<^Juq=>LbufLj2h`R zGD5Pa=hi9IS&}TLDlS<|Tr-u=;7UGW2lMXQU4}mpo#lpXw^?rUjIE8m4J~yyH1E}c z>ZbfBS|C`|?#3ubg~j&44hzl-|JV|(#kRfho?qm==Cla=E70}vzOV|;&&$Cx&P*XBVnyWJ>AO(cx;?7uV%46?l_j5Z zr)BTXzMXy~H7H|P+SSAXN&1ZTS?{t2X7|ilR507Zf#ox#YPPc>`Hq=`OF0?UDD5oc zGLyU8ABJ*cxv8gns9UhXrmcXB0jcrjs!=WFOVaPk0kN*5qH=2GJlhuA?8?#Qsg{V! zW7bbLv%RkEn0=biUQtnvsS{K%S3`Tv*vd4|bjkgY*R+6~Ah)1Hfi*(ThOH0x3_l-{ z?dLST@me0V)k~+ENcCo+H7DxX(@NoZT)Mb;Y4-ONYjVq!nMvmoUnB-4bWZ4!bRsPv zvtQ1TT%UqhC3C9ujudAvp&KEy_td??RJf;q1!70Hr!)AtuMzCR#;S<7^`^I=Y!ilKLtsA!w{#}=e zqe9oplSKy$h{9F*OEPLF_eu&#{*joPFg0OmV*TVcDFf1GXI9I5URbB(cG>dEj?R