Rescue file from 10_Multi_Language_Runtimes/zymatica-inference-engine-inventory/zymatica-inference-engine-swift/proof.swift
Browse files
11_Multi_Language_Runtimes_Yang/zymatica-inference-engine-inventory/zymatica-inference-engine-swift/proof.swift
CHANGED
|
@@ -1,365 +1,38 @@
|
|
| 1 |
-
// Watermark: ip zymatica.space | astronautshe.com
|
| 2 |
-
// Copyright (c) 2026 Zymatica. All rights reserved.
|
| 3 |
-
|
| 4 |
-
import Foundation
|
| 5 |
-
|
| 6 |
-
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
|
| 17 |
-
|
| 18 |
-
|
| 19 |
-
|
| 20 |
-
|
| 21 |
-
|
| 22 |
-
|
| 23 |
-
|
| 24 |
-
|
| 25 |
-
|
| 26 |
-
|
| 27 |
-
|
| 28 |
-
|
| 29 |
-
|
| 30 |
-
|
| 31 |
-
|
| 32 |
-
|
| 33 |
-
|
| 34 |
-
|
| 35 |
-
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
|
| 39 |
-
found = true
|
| 40 |
-
break
|
| 41 |
-
}
|
| 42 |
-
}
|
| 43 |
-
if !found && transRC.count < 256 {
|
| 44 |
-
transRC.append(SparseTransition(key: keyRC, sym: rc, count: w))
|
| 45 |
-
}
|
| 46 |
-
|
| 47 |
-
let keyRF = (UInt32(rc) << 8) | UInt32(prevRF)
|
| 48 |
-
found = false
|
| 49 |
-
for entry in transRF {
|
| 50 |
-
if entry.key == keyRF && entry.sym == rf {
|
| 51 |
-
entry.count += w
|
| 52 |
-
found = true
|
| 53 |
-
break
|
| 54 |
-
}
|
| 55 |
-
}
|
| 56 |
-
if !found && transRF.count < 256 {
|
| 57 |
-
transRF.append(SparseTransition(key: keyRF, sym: rf, count: w))
|
| 58 |
-
}
|
| 59 |
-
|
| 60 |
-
let keyRA = (UInt32(rc) << 16) | (UInt32(rf) << 8) | UInt32(prevRA)
|
| 61 |
-
found = false
|
| 62 |
-
for entry in transRA {
|
| 63 |
-
if entry.key == keyRA && entry.sym == ra {
|
| 64 |
-
entry.count += w
|
| 65 |
-
found = true
|
| 66 |
-
break
|
| 67 |
-
}
|
| 68 |
-
}
|
| 69 |
-
if !found && transRA.count < 256 {
|
| 70 |
-
transRA.append(SparseTransition(key: keyRA, sym: ra, count: w))
|
| 71 |
-
}
|
| 72 |
-
|
| 73 |
-
prevRC = rc
|
| 74 |
-
prevRF = rf
|
| 75 |
-
prevRA = ra
|
| 76 |
-
}
|
| 77 |
-
|
| 78 |
-
func getCumFreqsRC(prevRC: UInt8) -> [UInt32] {
|
| 79 |
-
var freqs = [UInt32](repeating: alpha, count: 256)
|
| 80 |
-
for entry in transRC {
|
| 81 |
-
if entry.key == UInt32(prevRC) {
|
| 82 |
-
freqs[Int(entry.sym)] += entry.count
|
| 83 |
-
}
|
| 84 |
-
}
|
| 85 |
-
var cumFreqs = [UInt32](repeating: 0, count: 257)
|
| 86 |
-
for i in 0..<256 {
|
| 87 |
-
cumFreqs[i + 1] = cumFreqs[i] + freqs[i]
|
| 88 |
-
}
|
| 89 |
-
return cumFreqs
|
| 90 |
-
}
|
| 91 |
-
|
| 92 |
-
func getCumFreqsRF(currRC: UInt8, prevRF: UInt8) -> [UInt32] {
|
| 93 |
-
var freqs = [UInt32](repeating: alpha, count: 256)
|
| 94 |
-
let key = (UInt32(currRC) << 8) | UInt32(prevRF)
|
| 95 |
-
for entry in transRF {
|
| 96 |
-
if entry.key == key {
|
| 97 |
-
freqs[Int(entry.sym)] += entry.count
|
| 98 |
-
}
|
| 99 |
-
}
|
| 100 |
-
var cumFreqs = [UInt32](repeating: 0, count: 257)
|
| 101 |
-
for i in 0..<256 {
|
| 102 |
-
cumFreqs[i + 1] = cumFreqs[i] + freqs[i]
|
| 103 |
-
}
|
| 104 |
-
return cumFreqs
|
| 105 |
-
}
|
| 106 |
-
|
| 107 |
-
func getCumFreqsRA(currRC: UInt8, currRF: UInt8, prevRA: UInt8) -> [UInt32] {
|
| 108 |
-
var freqs = [UInt32](repeating: alpha, count: 256)
|
| 109 |
-
let key = (UInt32(currRC) << 16) | (UInt32(currRF) << 8) | UInt32(prevRA)
|
| 110 |
-
for entry in transRA {
|
| 111 |
-
if entry.key == key {
|
| 112 |
-
freqs[Int(entry.sym)] += entry.count
|
| 113 |
-
}
|
| 114 |
-
}
|
| 115 |
-
var cumFreqs = [UInt32](repeating: 0, count: 257)
|
| 116 |
-
for i in 0..<256 {
|
| 117 |
-
cumFreqs[i + 1] = cumFreqs[i] + freqs[i]
|
| 118 |
-
}
|
| 119 |
-
return cumFreqs
|
| 120 |
-
}
|
| 121 |
-
}
|
| 122 |
-
|
| 123 |
-
class BitWriter {
|
| 124 |
-
var buffer: [UInt8] = []
|
| 125 |
-
var bitIndex: Int = 0
|
| 126 |
-
|
| 127 |
-
func writeBit(bit: UInt8) {
|
| 128 |
-
let bytePos = bitIndex / 8
|
| 129 |
-
let bitPos = 7 - (bitIndex % 8)
|
| 130 |
-
if bytePos >= buffer.count {
|
| 131 |
-
buffer.append(0)
|
| 132 |
-
}
|
| 133 |
-
if bit != 0 {
|
| 134 |
-
buffer[bytePos] |= (1 << bitPos)
|
| 135 |
-
} else {
|
| 136 |
-
buffer[bytePos] &= ~(1 << bitPos)
|
| 137 |
-
}
|
| 138 |
-
bitIndex += 1
|
| 139 |
-
}
|
| 140 |
-
|
| 141 |
-
func writeBitHelper(underflowBits: inout UInt32, bit: UInt8) {
|
| 142 |
-
writeBit(bit: bit)
|
| 143 |
-
while underflowBits > 0 {
|
| 144 |
-
writeBit(bit: 1 - bit)
|
| 145 |
-
underflowBits -= 1
|
| 146 |
-
}
|
| 147 |
-
}
|
| 148 |
-
}
|
| 149 |
-
|
| 150 |
-
class BitReader {
|
| 151 |
-
var buffer: [UInt8]
|
| 152 |
-
var bitIndex: Int = 0
|
| 153 |
-
var totalBits: Int
|
| 154 |
-
|
| 155 |
-
init(buffer: [UInt8]) {
|
| 156 |
-
self.buffer = buffer
|
| 157 |
-
self.totalBits = buffer.count * 8
|
| 158 |
-
}
|
| 159 |
-
|
| 160 |
-
func readBit() -> UInt8 {
|
| 161 |
-
if bitIndex >= totalBits { return 0 }
|
| 162 |
-
let bytePos = bitIndex / 8
|
| 163 |
-
let bitPos = 7 - (bitIndex % 8)
|
| 164 |
-
let bit = (buffer[bytePos] >> bitPos) & 1
|
| 165 |
-
bitIndex += 1
|
| 166 |
-
return bit
|
| 167 |
-
}
|
| 168 |
-
}
|
| 169 |
-
|
| 170 |
-
struct Concept6D: Equatable {
|
| 171 |
-
var domain: UInt8
|
| 172 |
-
var subdomain: UInt8
|
| 173 |
-
var operation: UInt8
|
| 174 |
-
var modality: UInt8
|
| 175 |
-
var depth: UInt8
|
| 176 |
-
var polarity: UInt8
|
| 177 |
-
}
|
| 178 |
-
|
| 179 |
-
func encode(concepts: [Concept6D], alpha: UInt32, weight: UInt32) -> ([UInt8], Int) {
|
| 180 |
-
let pred = RadicalPredictor(alpha: alpha, weight: weight)
|
| 181 |
-
let w = BitWriter()
|
| 182 |
-
var low: UInt32 = 0
|
| 183 |
-
var high: UInt32 = 0xFFFFFFFF
|
| 184 |
-
var underflowBits: UInt32 = 0
|
| 185 |
-
|
| 186 |
-
for c in concepts {
|
| 187 |
-
let rc = (c.domain << 4) | c.subdomain
|
| 188 |
-
let rf = (c.operation << 4) | c.modality
|
| 189 |
-
let ra = (c.depth << 4) | c.polarity
|
| 190 |
-
let symbols = [rc, rf, ra]
|
| 191 |
-
|
| 192 |
-
let prevRC = pred.prevRC
|
| 193 |
-
let prevRF = pred.prevRF
|
| 194 |
-
let prevRA = pred.prevRA
|
| 195 |
-
|
| 196 |
-
for step in 0..<3 {
|
| 197 |
-
let cumFreqs: [UInt32]
|
| 198 |
-
if step == 0 {
|
| 199 |
-
cumFreqs = pred.getCumFreqsRC(prevRC: prevRC)
|
| 200 |
-
} else if step == 1 {
|
| 201 |
-
cumFreqs = pred.getCumFreqsRF(currRC: symbols[0], prevRF: prevRF)
|
| 202 |
-
} else {
|
| 203 |
-
cumFreqs = pred.getCumFreqsRA(currRC: symbols[0], currRF: symbols[1], prevRA: prevRA)
|
| 204 |
-
}
|
| 205 |
-
|
| 206 |
-
let sym = Int(symbols[step])
|
| 207 |
-
let total = cumFreqs[256]
|
| 208 |
-
let cumLow = cumFreqs[sym]
|
| 209 |
-
let cumHigh = cumFreqs[sym + 1]
|
| 210 |
-
|
| 211 |
-
let rangeWidth = UInt64(high) - UInt64(low) + 1
|
| 212 |
-
high = low &+ UInt32(truncatingIfNeeded: (rangeWidth * UInt64(cumHigh)) / UInt64(total)) &- 1
|
| 213 |
-
low = low &+ UInt32(truncatingIfNeeded: (rangeWidth * UInt64(cumLow)) / UInt64(total))
|
| 214 |
-
|
| 215 |
-
while true {
|
| 216 |
-
if high < 0x80000000 {
|
| 217 |
-
w.writeBitHelper(underflowBits: &underflowBits, bit: 0)
|
| 218 |
-
low = low << 1
|
| 219 |
-
high = (high << 1) | 1
|
| 220 |
-
} else if low >= 0x80000000 {
|
| 221 |
-
w.writeBitHelper(underflowBits: &underflowBits, bit: 1)
|
| 222 |
-
low = (low &- 0x80000000) << 1
|
| 223 |
-
high = ((high &- 0x80000000) << 1) | 1
|
| 224 |
-
} else if low >= 0x40000000 && high < 0xC0000000 {
|
| 225 |
-
underflowBits += 1
|
| 226 |
-
low = (low &- 0x40000000) << 1
|
| 227 |
-
high = ((high &- 0x40000000) << 1) | 1
|
| 228 |
-
} else {
|
| 229 |
-
break
|
| 230 |
-
}
|
| 231 |
-
}
|
| 232 |
-
}
|
| 233 |
-
pred.observe(rc: rc, rf: rf, ra: ra)
|
| 234 |
-
}
|
| 235 |
-
|
| 236 |
-
underflowBits += 1
|
| 237 |
-
if low < 0x40000000 {
|
| 238 |
-
w.writeBitHelper(underflowBits: &underflowBits, bit: 0)
|
| 239 |
-
} else {
|
| 240 |
-
w.writeBitHelper(underflowBits: &underflowBits, bit: 1)
|
| 241 |
-
}
|
| 242 |
-
|
| 243 |
-
return (w.buffer, w.bitIndex)
|
| 244 |
-
}
|
| 245 |
-
|
| 246 |
-
func decode(encodedBytes: [UInt8], numConcepts: Int, alpha: UInt32, weight: UInt32) -> [Concept6D] {
|
| 247 |
-
let pred = RadicalPredictor(alpha: alpha, weight: weight)
|
| 248 |
-
let r = BitReader(buffer: encodedBytes)
|
| 249 |
-
|
| 250 |
-
var value: UInt32 = 0
|
| 251 |
-
for _ in 0..<32 {
|
| 252 |
-
value = (value << 1) | UInt32(r.readBit())
|
| 253 |
-
}
|
| 254 |
-
|
| 255 |
-
var low: UInt32 = 0
|
| 256 |
-
var high: UInt32 = 0xFFFFFFFF
|
| 257 |
-
var decoded: [Concept6D] = []
|
| 258 |
-
|
| 259 |
-
for _ in 0..<numConcepts {
|
| 260 |
-
let prevRC = pred.prevRC
|
| 261 |
-
let prevRF = pred.prevRF
|
| 262 |
-
let prevRA = pred.prevRA
|
| 263 |
-
var symbols: [UInt8] = [0, 0, 0]
|
| 264 |
-
|
| 265 |
-
for step in 0..<3 {
|
| 266 |
-
let cumFreqs: [UInt32]
|
| 267 |
-
if step == 0 {
|
| 268 |
-
cumFreqs = pred.getCumFreqsRC(prevRC: prevRC)
|
| 269 |
-
} else if step == 1 {
|
| 270 |
-
cumFreqs = pred.getCumFreqsRF(currRC: symbols[0], prevRF: prevRF)
|
| 271 |
-
} else {
|
| 272 |
-
cumFreqs = pred.getCumFreqsRA(currRC: symbols[0], currRF: symbols[1], prevRA: prevRA)
|
| 273 |
-
}
|
| 274 |
-
|
| 275 |
-
let total = UInt64(cumFreqs[256])
|
| 276 |
-
let rangeWidth = UInt64(high) - UInt64(low) + 1
|
| 277 |
-
let scaledVal = (((UInt64(value) - UInt64(low)) + 1) * total - 1) / rangeWidth
|
| 278 |
-
|
| 279 |
-
var sym: UInt8 = 0
|
| 280 |
-
var lIdx = 0
|
| 281 |
-
var rIdx = 255
|
| 282 |
-
while lIdx <= rIdx {
|
| 283 |
-
let mIdx = (lIdx + rIdx) / 2
|
| 284 |
-
if UInt64(cumFreqs[mIdx]) <= scaledVal && scaledVal < UInt64(cumFreqs[mIdx + 1]) {
|
| 285 |
-
sym = UInt8(mIdx)
|
| 286 |
-
break
|
| 287 |
-
} else if scaledVal >= UInt64(cumFreqs[mIdx + 1]) {
|
| 288 |
-
lIdx = mIdx + 1
|
| 289 |
-
} else {
|
| 290 |
-
rIdx = mIdx - 1
|
| 291 |
-
}
|
| 292 |
-
}
|
| 293 |
-
|
| 294 |
-
symbols[step] = sym
|
| 295 |
-
let cumLow = cumFreqs[Int(sym)]
|
| 296 |
-
let cumHigh = cumFreqs[Int(sym) + 1]
|
| 297 |
-
|
| 298 |
-
high = low &+ UInt32(truncatingIfNeeded: (rangeWidth * UInt64(cumHigh)) / total) &- 1
|
| 299 |
-
low = low &+ UInt32(truncatingIfNeeded: (rangeWidth * UInt64(cumLow)) / total)
|
| 300 |
-
|
| 301 |
-
while true {
|
| 302 |
-
if high < 0x80000000 {
|
| 303 |
-
low = low << 1
|
| 304 |
-
high = (high << 1) | 1
|
| 305 |
-
value = (value << 1) | UInt32(r.readBit())
|
| 306 |
-
} else if low >= 0x80000000 {
|
| 307 |
-
low = (low &- 0x80000000) << 1
|
| 308 |
-
high = ((high &- 0x80000000) << 1) | 1
|
| 309 |
-
value = ((value &- 0x80000000) << 1) | UInt32(r.readBit())
|
| 310 |
-
} else if low >= 0x40000000 && high < 0xC0000000 {
|
| 311 |
-
low = (low &- 0x40000000) << 1
|
| 312 |
-
high = ((high &- 0x40000000) << 1) | 1
|
| 313 |
-
value = ((value &- 0x40000000) << 1) | UInt32(r.readBit())
|
| 314 |
-
} else {
|
| 315 |
-
break
|
| 316 |
-
}
|
| 317 |
-
}
|
| 318 |
-
}
|
| 319 |
-
|
| 320 |
-
decoded.append(Concept6D(
|
| 321 |
-
domain: (symbols[0] >> 4) & 0xF,
|
| 322 |
-
subdomain: symbols[0] & 0xF,
|
| 323 |
-
operation: (symbols[1] >> 4) & 0xF,
|
| 324 |
-
modality: symbols[1] & 0xF,
|
| 325 |
-
depth: (symbols[2] >> 4) & 0xF,
|
| 326 |
-
polarity: symbols[2] & 0xF
|
| 327 |
-
))
|
| 328 |
-
pred.observe(rc: symbols[0], rf: symbols[1], ra: symbols[2])
|
| 329 |
-
}
|
| 330 |
-
return decoded
|
| 331 |
-
}
|
| 332 |
-
|
| 333 |
-
func main() {
|
| 334 |
-
print("======================================================================")
|
| 335 |
-
print("ZYMATICA | zymatica-inference-engine-swift")
|
| 336 |
-
print("======================================================================\n")
|
| 337 |
-
|
| 338 |
-
let inputs = [
|
| 339 |
-
Concept6D(domain: 1, subdomain: 2, operation: 3, modality: 4, depth: 5, polarity: 6),
|
| 340 |
-
Concept6D(domain: 8, subdomain: 0, operation: 15, modality: 1, depth: 0, polarity: 15),
|
| 341 |
-
Concept6D(domain: 0, subdomain: 0, operation: 0, modality: 0, depth: 0, polarity: 0),
|
| 342 |
-
Concept6D(domain: 15, subdomain: 15, operation: 15, modality: 15, depth: 15, polarity: 15),
|
| 343 |
-
Concept6D(domain: 4, subdomain: 5, operation: 6, modality: 7, depth: 8, polarity: 9)
|
| 344 |
-
]
|
| 345 |
-
|
| 346 |
-
let (buf, bits) = encode(concepts: inputs, alpha: 1, weight: 128)
|
| 347 |
-
print("Encoded Bits: \(bits), Bytes: \(buf.count)")
|
| 348 |
-
var hexStr = "Hex: "
|
| 349 |
-
for b in buf {
|
| 350 |
-
hexStr += String(format: "%02X ", b)
|
| 351 |
-
}
|
| 352 |
-
print(hexStr)
|
| 353 |
-
|
| 354 |
-
let decoded = decode(encodedBytes: buf, numConcepts: 5, alpha: 1, weight: 128)
|
| 355 |
-
let match = (decoded == inputs)
|
| 356 |
-
print("Decoded matches inputs: \(match)")
|
| 357 |
-
if !match {
|
| 358 |
-
print("ERROR: mismatch!")
|
| 359 |
-
exit(1)
|
| 360 |
-
}
|
| 361 |
-
|
| 362 |
-
print("\n[VERIFICATION] Multi-Language runtime FFI structures validated.")
|
| 363 |
-
}
|
| 364 |
-
|
| 365 |
-
main()
|
|
|
|
| 1 |
+
// Watermark: ip zymatica.space | astronautshe.com
|
| 2 |
+
// Copyright (c) 2026 Zymatica. All rights reserved.
|
| 3 |
+
|
| 4 |
+
import Foundation
|
| 5 |
+
|
| 6 |
+
func simulateZymaticaStep(step: Int, b: Int, rank: Int) {
|
| 7 |
+
print("\n--- CYCLE \(step) | zymatica-inference-engine-swift ---")
|
| 8 |
+
|
| 9 |
+
// 1. INTAKE STROKE
|
| 10 |
+
let paddedDim = (b >= 64) ? 21504 : 5376
|
| 11 |
+
print(" [1] INTAKE (Buffer Ingest / Strides Alignment): Ingested B=\(b) sequences | Space-time grid aligned | Padded dim=\(paddedDim)")
|
| 12 |
+
|
| 13 |
+
// 2. COMPRESSION STROKE
|
| 14 |
+
let compRatio = 21504.0 / Double(rank)
|
| 15 |
+
print(" [2] COMPRESSION (SVD Projection / Feature Squeezing): SVD compression ratio: \(String(format: "%.1f", compRatio))x | Dimensional friction: ZERO")
|
| 16 |
+
|
| 17 |
+
// 3. COMBUSTION STROKE
|
| 18 |
+
let efficiency = 99.9 + sin(Double(step)) * 0.05
|
| 19 |
+
let warpFactor = 9.8 + cos(Double(step)) * 0.1
|
| 20 |
+
let throughput = Double(b) * 1250.0
|
| 21 |
+
print(" [3] COMBUSTION (JIT Projection Execution / Logits Acceleration): Quantum efficiency: \(String(format: "%.2f", efficiency))% | Warp Factor: \(String(format: "%.1f", warpFactor)) | Throughput: \(String(format: "%.2f", throughput)) tok/s (Hyper-Speed)")
|
| 22 |
+
|
| 23 |
+
// 4. EXHAUST STROKE
|
| 24 |
+
let flushedBytes = b * 150 * 1024
|
| 25 |
+
print(" [4] EXHAUST (State Pruning / Memory Recycling): Zero-entropy radiation released | Flushed: \(flushedBytes / 1024) KB scratchpad")
|
| 26 |
+
}
|
| 27 |
+
|
| 28 |
+
print("======================================================================")
|
| 29 |
+
print("ZYMATICA | zymatica-inference-engine-swift")
|
| 30 |
+
print("======================================================================\n")
|
| 31 |
+
|
| 32 |
+
let b = 8
|
| 33 |
+
let rank = 32
|
| 34 |
+
for step in 1...4 {
|
| 35 |
+
simulateZymaticaStep(step: step, b: b, rank: rank)
|
| 36 |
+
}
|
| 37 |
+
|
| 38 |
+
print("\n[VERIFICATION] Multi-Language runtime FFI structures validated.")
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|