My aggregated monorepo of OCaml code, automaintained
-brotli
-6757
-1
ocaml-brotli/.gitignore
-1
ocaml-brotli/.gitignore
···
1
-
_build
-89
ocaml-brotli/README.md
-89
ocaml-brotli/README.md
···
1
-
# ocaml-brotli
2
-
3
-
A pure OCaml implementation of the [Brotli](https://www.rfc-editor.org/rfc/rfc7932) compression format (RFC 7932).
4
-
5
-
This implementation is based on the algorithms and data structures from the reference [Google Brotli C library](https://github.com/google/brotli), rewritten in idiomatic OCaml without any C dependencies.
6
-
7
-
## Features
8
-
9
-
- Pure OCaml - no C bindings or external dependencies
10
-
- Compression quality levels 0-11
11
-
- Simple string-based API
12
-
- Low-allocation buffer API
13
-
- Streaming compression support
14
-
- Optional [bytesrw](https://erratique.ch/software/bytesrw) integration for stream processing
15
-
16
-
## Installation
17
-
18
-
```
19
-
opam install brotli
20
-
```
21
-
22
-
## Usage
23
-
24
-
### Simple API
25
-
26
-
```ocaml
27
-
(* Compress a string *)
28
-
let compressed = Brotli.compress "Hello, World!"
29
-
30
-
(* Compress with higher quality (0-11, default is 1) *)
31
-
let compressed = Brotli.compress ~quality:6 data
32
-
33
-
(* Decompress *)
34
-
match Brotli.decompress compressed with
35
-
| Ok decompressed -> print_endline decompressed
36
-
| Error msg -> failwith msg
37
-
38
-
(* Or use the exception-raising variant *)
39
-
let decompressed = Brotli.decompress_exn compressed
40
-
```
41
-
42
-
### Low-allocation API
43
-
44
-
```ocaml
45
-
let src = Bytes.of_string "data to compress"
46
-
let dst = Bytes.create (Brotli.max_compressed_length (Bytes.length src))
47
-
48
-
let compressed_len =
49
-
Brotli.compress_into
50
-
~src ~src_pos:0 ~src_len:(Bytes.length src)
51
-
~dst ~dst_pos:0 ()
52
-
```
53
-
54
-
### With bytesrw (optional)
55
-
56
-
When the `bytesrw` package is installed, the `brotli.bytesrw` sublibrary provides streaming compression and decompression:
57
-
58
-
```ocaml
59
-
open Bytesrw
60
-
61
-
(* Compress a byte reader *)
62
-
let compressed_reader = Bytesrw_brotli.compress_reads ~quality:4 reader
63
-
64
-
(* Decompress a byte reader *)
65
-
let decompressed_reader = Bytesrw_brotli.decompress_reads reader
66
-
```
67
-
68
-
## Quality Levels
69
-
70
-
| Quality | Description |
71
-
|---------|-------------|
72
-
| 0 | Stored (uncompressed) blocks only |
73
-
| 1 | Huffman-only compression (default) |
74
-
| 2-3 | LZ77 with simple hash table matching |
75
-
| 4 | Hash chains with dictionary matching |
76
-
| 5-6 | Context mode selection |
77
-
| 7-9 | Multiple literal Huffman trees |
78
-
| 10-11 | Optimal parsing |
79
-
80
-
Higher quality levels produce smaller output but take longer to compress.
81
-
82
-
## References
83
-
84
-
- [RFC 7932 - Brotli Compressed Data Format](https://www.rfc-editor.org/rfc/rfc7932)
85
-
- [Google Brotli C library](https://github.com/google/brotli) - the reference implementation this library is based on
86
-
87
-
## License
88
-
89
-
ISC
-35
ocaml-brotli/brotli.opam
-35
ocaml-brotli/brotli.opam
···
1
-
# This file is generated by dune, edit dune-project instead
2
-
opam-version: "2.0"
3
-
synopsis: "Pure OCaml implementation of Brotli compression"
4
-
description: """
5
-
A pure OCaml implementation of the Brotli compression format (RFC 7932).
6
-
When the optional bytesrw dependency is installed, the brotli.bytesrw
7
-
sublibrary provides streaming-style compression and decompression."""
8
-
maintainer: ["Anil Madhavapeddy <anil@recoil.org>"]
9
-
authors: ["Anil Madhavapeddy <anil@recoil.org>"]
10
-
license: "ISC"
11
-
homepage: "https://tangled.org/anil.recoil.org/ocaml-brotli"
12
-
bug-reports: "https://tangled.org/anil.recoil.org/ocaml-brotli/issues"
13
-
depends: [
14
-
"dune" {>= "3.21"}
15
-
"ocaml" {>= "5.2.0"}
16
-
"alcotest" {with-test & >= "1.7.0"}
17
-
"odoc" {with-doc}
18
-
]
19
-
depopts: ["bytesrw"]
20
-
build: [
21
-
["dune" "subst"] {dev}
22
-
[
23
-
"dune"
24
-
"build"
25
-
"-p"
26
-
name
27
-
"-j"
28
-
jobs
29
-
"@install"
30
-
"@runtest" {with-test}
31
-
"@doc" {with-doc}
32
-
]
33
-
]
34
-
dev-repo: "git+https://tangled.org/anil.recoil.org/ocaml-brotli"
35
-
x-maintenance-intent: ["(latest)"]
-184
ocaml-brotli/bytesrw/bytesrw_brotli.ml
-184
ocaml-brotli/bytesrw/bytesrw_brotli.ml
···
1
-
(*---------------------------------------------------------------------------
2
-
Copyright (c) 2024 The brotli programmers. All rights reserved.
3
-
SPDX-License-Identifier: ISC
4
-
---------------------------------------------------------------------------*)
5
-
6
-
(* Bytesrw integration for Brotli compression (RFC 7932)
7
-
8
-
This implementation provides streaming compression and decompression
9
-
using the Brotli format. Both compression and decompression buffer
10
-
the entire input to achieve optimal compression ratios. *)
11
-
12
-
open Bytesrw
13
-
14
-
(* Error handling *)
15
-
16
-
type Bytes.Stream.error += Error of string
17
-
18
-
let format_error =
19
-
let case msg = Error msg in
20
-
let message = function Error msg -> msg | _ -> assert false in
21
-
Bytes.Stream.make_format_error ~format:"brotli" ~case ~message
22
-
23
-
let error = Bytes.Stream.error format_error
24
-
let reader_error = Bytes.Reader.error format_error
25
-
let writer_error = Bytes.Writer.error format_error
26
-
27
-
(* Library parameters *)
28
-
29
-
let default_slice_length = 65536 (* 64KB *)
30
-
31
-
type quality = int
32
-
let default_quality = 1
33
-
let no_compression = 0
34
-
let best_speed = 1
35
-
let best_compression = 11
36
-
37
-
(* Decompress reads - buffers entire input, decompresses, then emits slices *)
38
-
39
-
let decompress_reads () ?pos ?(slice_length = default_slice_length) r =
40
-
(* Buffer all input first *)
41
-
let input_buffer = Buffer.create slice_length in
42
-
let rec read_all () =
43
-
let slice = Bytes.Reader.read r in
44
-
if Bytes.Slice.is_eod slice then ()
45
-
else begin
46
-
Bytes.Slice.add_to_buffer input_buffer slice;
47
-
read_all ()
48
-
end
49
-
in
50
-
read_all ();
51
-
52
-
(* Decompress using low-allocation API *)
53
-
let input_len = Buffer.length input_buffer in
54
-
let input = Bytes.unsafe_of_string (Buffer.contents input_buffer) in
55
-
(* Start with 4x input size estimate, grow if needed *)
56
-
let initial_size = max 256 (input_len * 4) in
57
-
let output = ref (Bytes.create initial_size) in
58
-
let rec try_decompress size =
59
-
output := Bytes.create size;
60
-
try
61
-
Brotli.decompress_into ~src:input ~src_pos:0 ~src_len:input_len
62
-
~dst:!output ~dst_pos:0
63
-
with
64
-
| Brotli.Brotli_error Brotli.Output_overrun ->
65
-
if size > 256 * 1024 * 1024 then
66
-
reader_error r "Output too large"
67
-
else
68
-
try_decompress (size * 2)
69
-
in
70
-
let decompressed_len = try_decompress initial_size in
71
-
72
-
(* Create a reader from the decompressed data *)
73
-
let output_pos = ref 0 in
74
-
75
-
let read () =
76
-
if !output_pos >= decompressed_len then Bytes.Slice.eod
77
-
else begin
78
-
let len = min slice_length (decompressed_len - !output_pos) in
79
-
let slice = Bytes.Slice.make !output ~first:!output_pos ~length:len in
80
-
output_pos := !output_pos + len;
81
-
slice
82
-
end
83
-
in
84
-
Bytes.Reader.make ?pos ~slice_length read
85
-
86
-
(* Decompress writes - buffers input, decompresses on eod *)
87
-
88
-
let decompress_writes () ?pos ?(slice_length = default_slice_length) ~eod w =
89
-
let input_buffer = Buffer.create slice_length in
90
-
91
-
let write = function
92
-
| slice when Bytes.Slice.is_eod slice ->
93
-
(* Decompress using low-allocation API *)
94
-
let input_len = Buffer.length input_buffer in
95
-
let input = Bytes.unsafe_of_string (Buffer.contents input_buffer) in
96
-
let initial_size = max 256 (input_len * 4) in
97
-
let output = ref (Bytes.create initial_size) in
98
-
let rec try_decompress size =
99
-
output := Bytes.create size;
100
-
try
101
-
Brotli.decompress_into ~src:input ~src_pos:0 ~src_len:input_len
102
-
~dst:!output ~dst_pos:0
103
-
with
104
-
| Brotli.Brotli_error Brotli.Output_overrun ->
105
-
if size > 256 * 1024 * 1024 then
106
-
writer_error w "Output too large"
107
-
else
108
-
try_decompress (size * 2)
109
-
in
110
-
let decompressed_len = try_decompress initial_size in
111
-
Bytes.Writer.write_string w (Bytes.sub_string !output 0 decompressed_len);
112
-
if eod then Bytes.Writer.write_eod w
113
-
| slice ->
114
-
Bytes.Slice.add_to_buffer input_buffer slice
115
-
in
116
-
Bytes.Writer.make ?pos ~slice_length write
117
-
118
-
(* Compress reads - buffers entire input, compresses, then emits slices *)
119
-
120
-
let compress_reads ?(quality = default_quality) ()
121
-
?pos ?(slice_length = default_slice_length) r
122
-
=
123
-
(* Buffer all input first - this allows better compression *)
124
-
let input_buffer = Buffer.create slice_length in
125
-
let rec read_all () =
126
-
let slice = Bytes.Reader.read r in
127
-
if Bytes.Slice.is_eod slice then ()
128
-
else begin
129
-
Bytes.Slice.add_to_buffer input_buffer slice;
130
-
read_all ()
131
-
end
132
-
in
133
-
read_all ();
134
-
135
-
(* Compress using low-allocation API *)
136
-
let input_len = Buffer.length input_buffer in
137
-
let input = Bytes.unsafe_of_string (Buffer.contents input_buffer) in
138
-
let max_len = Brotli.max_compressed_length input_len in
139
-
let compressed = Bytes.create max_len in
140
-
let compressed_len =
141
-
try Brotli.compress_into ~quality ~src:input ~src_pos:0 ~src_len:input_len
142
-
~dst:compressed ~dst_pos:0 ()
143
-
with exn -> error (Printexc.to_string exn)
144
-
in
145
-
146
-
(* Create a reader from the compressed data *)
147
-
let output_pos = ref 0 in
148
-
149
-
let read () =
150
-
if !output_pos >= compressed_len then Bytes.Slice.eod
151
-
else begin
152
-
let len = min slice_length (compressed_len - !output_pos) in
153
-
let slice = Bytes.Slice.make compressed ~first:!output_pos ~length:len in
154
-
output_pos := !output_pos + len;
155
-
slice
156
-
end
157
-
in
158
-
Bytes.Reader.make ?pos ~slice_length read
159
-
160
-
(* Compress writes - buffers input, compresses on eod *)
161
-
162
-
let compress_writes ?(quality = default_quality) ()
163
-
?pos ?(slice_length = default_slice_length) ~eod w
164
-
=
165
-
let input_buffer = Buffer.create slice_length in
166
-
167
-
let write = function
168
-
| slice when Bytes.Slice.is_eod slice ->
169
-
(* Compress using low-allocation API *)
170
-
let input_len = Buffer.length input_buffer in
171
-
let input = Bytes.unsafe_of_string (Buffer.contents input_buffer) in
172
-
let max_len = Brotli.max_compressed_length input_len in
173
-
let compressed = Bytes.create max_len in
174
-
let compressed_len =
175
-
try Brotli.compress_into ~quality ~src:input ~src_pos:0 ~src_len:input_len
176
-
~dst:compressed ~dst_pos:0 ()
177
-
with exn -> writer_error w (Printexc.to_string exn)
178
-
in
179
-
Bytes.Writer.write_string w (Bytes.sub_string compressed 0 compressed_len);
180
-
if eod then Bytes.Writer.write_eod w
181
-
| slice ->
182
-
Bytes.Slice.add_to_buffer input_buffer slice
183
-
in
184
-
Bytes.Writer.make ?pos ~slice_length write
-88
ocaml-brotli/bytesrw/bytesrw_brotli.mli
-88
ocaml-brotli/bytesrw/bytesrw_brotli.mli
···
1
-
(*---------------------------------------------------------------------------
2
-
Copyright (c) 2024 The brotli programmers. All rights reserved.
3
-
SPDX-License-Identifier: ISC
4
-
---------------------------------------------------------------------------*)
5
-
6
-
(** Brotli streams (pure OCaml)
7
-
8
-
This module provides support for reading and writing
9
-
{{:https://www.rfc-editor.org/rfc/rfc7932}Brotli} compressed streams
10
-
using a pure OCaml implementation.
11
-
12
-
{b Slice lengths.} The slice length of readers created by filters of
13
-
this module defaults to {!default_slice_length}. The hinted slice length
14
-
of writers created by filters of this module defaults to
15
-
{!default_slice_length} and they write on their writers with slices
16
-
that respect their desires.
17
-
18
-
{b Positions.} The positions of readers and writers created by filters
19
-
of this module default to [0].
20
-
21
-
{b Buffering.} Unlike streaming compression formats, Brotli achieves
22
-
better compression by seeing more context. This implementation buffers
23
-
the entire input before compressing/decompressing to achieve optimal
24
-
compression ratios. *)
25
-
26
-
open Bytesrw
27
-
28
-
(** {1:errors Errors} *)
29
-
30
-
type Bytes.Stream.error += Error of string (** *)
31
-
(** The type for Brotli stream errors.
32
-
33
-
Except for the {{!lib}library parameters}, all functions of this
34
-
module and resulting readers and writers may raise
35
-
{!Bytesrw.Bytes.Stream.Error} with this error. *)
36
-
37
-
(** {1:decompress Decompress} *)
38
-
39
-
val decompress_reads : unit -> Bytes.Reader.filter
40
-
(** [decompress_reads () r] filters the reads of [r] by decompressing
41
-
a Brotli stream. The reader errors if the stream is malformed or
42
-
truncated. *)
43
-
44
-
val decompress_writes : unit -> Bytes.Writer.filter
45
-
(** [decompress_writes () w ~eod] filters writes on [w] by decompressing
46
-
a Brotli stream until {!Bytesrw.Bytes.Slice.eod} is written. If [eod]
47
-
is [false], the last {!Bytesrw.Bytes.Slice.eod} is not written on [w]
48
-
and at this point [w] can be used again to perform other non-filtered
49
-
writes. *)
50
-
51
-
(** {1:compress Compress} *)
52
-
53
-
type quality = int
54
-
(** The type for compression quality levels.
55
-
56
-
An integer between [0] and [11]. See {!Brotli} for quality level
57
-
descriptions. Defaults to {!default_quality}. *)
58
-
59
-
val compress_reads : ?quality:quality -> unit -> Bytes.Reader.filter
60
-
(** [compress_reads ?quality () r] filters the reads of [r] by compressing
61
-
them to a Brotli stream at quality [quality] (defaults to
62
-
{!default_quality}). *)
63
-
64
-
val compress_writes : ?quality:quality -> unit -> Bytes.Writer.filter
65
-
(** [compress_writes ?quality () w ~eod] filters writes on [w] by compressing
66
-
them to a Brotli stream at quality [quality] (defaults to
67
-
{!default_quality}) until {!Bytesrw.Bytes.Slice.eod} is written. If [eod]
68
-
is [false], the latter is not written on [w] and at that point [w] can
69
-
be used again to perform non-filtered writes. *)
70
-
71
-
(** {1:lib Library parameters} *)
72
-
73
-
val default_slice_length : int
74
-
(** [default_slice_length] is [64KB]. *)
75
-
76
-
(** {2:quality_levels Quality levels} *)
77
-
78
-
val default_quality : quality
79
-
(** [default_quality] is [1], fast compression. *)
80
-
81
-
val no_compression : quality
82
-
(** [no_compression] is [0], stored blocks only. *)
83
-
84
-
val best_speed : quality
85
-
(** [best_speed] is [1], Huffman-only compression. *)
86
-
87
-
val best_compression : quality
88
-
(** [best_compression] is [11], optimal parsing with deep hash chains. *)
-7
ocaml-brotli/bytesrw/dune
-7
ocaml-brotli/bytesrw/dune
-5
ocaml-brotli/bytesrw/test/dune
-5
ocaml-brotli/bytesrw/test/dune
-225
ocaml-brotli/bytesrw/test/test_bytesrw_brotli.ml
-225
ocaml-brotli/bytesrw/test/test_bytesrw_brotli.ml
···
1
-
(* Tests for bytesrw_brotli *)
2
-
3
-
open Bytesrw
4
-
5
-
let test_compress_reads_empty () =
6
-
let r = Bytes.Reader.of_string "" in
7
-
let cr = Bytesrw_brotli.compress_reads () r in
8
-
let result = Bytes.Reader.to_string cr in
9
-
(* Compressed empty input should still produce some output (header) *)
10
-
Alcotest.(check bool) "non-empty output" true (String.length result > 0);
11
-
(* Decompress to verify *)
12
-
match Brotli.decompress result with
13
-
| Ok s -> Alcotest.(check string) "roundtrip" "" s
14
-
| Error e -> Alcotest.fail e
15
-
16
-
let test_compress_reads_simple () =
17
-
let input = "Hello, World!" in
18
-
let r = Bytes.Reader.of_string input in
19
-
let cr = Bytesrw_brotli.compress_reads () r in
20
-
let compressed = Bytes.Reader.to_string cr in
21
-
match Brotli.decompress compressed with
22
-
| Ok s -> Alcotest.(check string) "roundtrip" input s
23
-
| Error e -> Alcotest.fail e
24
-
25
-
let test_decompress_reads_simple () =
26
-
let input = "Hello, World!" in
27
-
let compressed = Brotli.compress input in
28
-
let r = Bytes.Reader.of_string compressed in
29
-
let dr = Bytesrw_brotli.decompress_reads () r in
30
-
let result = Bytes.Reader.to_string dr in
31
-
Alcotest.(check string) "decompress" input result
32
-
33
-
let test_roundtrip_reads () =
34
-
let input = String.make 1000 'X' ^ String.init 1000 (fun i -> Char.chr (i mod 256)) in
35
-
let r = Bytes.Reader.of_string input in
36
-
let cr = Bytesrw_brotli.compress_reads () r in
37
-
let dr = Bytesrw_brotli.decompress_reads () cr in
38
-
let result = Bytes.Reader.to_string dr in
39
-
Alcotest.(check int) "length" (String.length input) (String.length result);
40
-
Alcotest.(check string) "content" input result
41
-
42
-
let test_compress_writes_simple () =
43
-
let input = "Hello, World!" in
44
-
let b = Buffer.create 256 in
45
-
let w = Bytes.Writer.of_buffer b in
46
-
let cw = Bytesrw_brotli.compress_writes () ~eod:true w in
47
-
Bytes.Writer.write_string cw input;
48
-
Bytes.Writer.write_eod cw;
49
-
let compressed = Buffer.contents b in
50
-
match Brotli.decompress compressed with
51
-
| Ok s -> Alcotest.(check string) "roundtrip" input s
52
-
| Error e -> Alcotest.fail e
53
-
54
-
let test_decompress_writes_simple () =
55
-
let input = "Hello, World!" in
56
-
let compressed = Brotli.compress input in
57
-
let b = Buffer.create 256 in
58
-
let w = Bytes.Writer.of_buffer b in
59
-
let dw = Bytesrw_brotli.decompress_writes () ~eod:true w in
60
-
Bytes.Writer.write_string dw compressed;
61
-
Bytes.Writer.write_eod dw;
62
-
let result = Buffer.contents b in
63
-
Alcotest.(check string) "decompress" input result
64
-
65
-
let test_roundtrip_writes () =
66
-
let input = String.make 1000 'Y' ^ String.init 1000 (fun i -> Char.chr (i mod 256)) in
67
-
68
-
(* Compress *)
69
-
let b1 = Buffer.create 256 in
70
-
let w1 = Bytes.Writer.of_buffer b1 in
71
-
let cw = Bytesrw_brotli.compress_writes () ~eod:true w1 in
72
-
Bytes.Writer.write_string cw input;
73
-
Bytes.Writer.write_eod cw;
74
-
let compressed = Buffer.contents b1 in
75
-
76
-
(* Decompress *)
77
-
let b2 = Buffer.create 256 in
78
-
let w2 = Bytes.Writer.of_buffer b2 in
79
-
let dw = Bytesrw_brotli.decompress_writes () ~eod:true w2 in
80
-
Bytes.Writer.write_string dw compressed;
81
-
Bytes.Writer.write_eod dw;
82
-
let result = Buffer.contents b2 in
83
-
84
-
Alcotest.(check int) "length" (String.length input) (String.length result);
85
-
Alcotest.(check string) "content" input result
86
-
87
-
let test_slice_length () =
88
-
(* Test with different slice lengths *)
89
-
let input = String.init 10000 (fun i -> Char.chr (i mod 256)) in
90
-
let slice_lengths = [64; 256; 1024; 8192] in
91
-
List.iter (fun slice_length ->
92
-
let r = Bytes.Reader.of_string input in
93
-
let cr = Bytesrw_brotli.compress_reads ~slice_length () r in
94
-
let dr = Bytesrw_brotli.decompress_reads ~slice_length () cr in
95
-
let result = Bytes.Reader.to_string dr in
96
-
Alcotest.(check int) (Printf.sprintf "length@%d" slice_length)
97
-
(String.length input) (String.length result);
98
-
Alcotest.(check string) (Printf.sprintf "content@%d" slice_length) input result
99
-
) slice_lengths
100
-
101
-
let test_quality_levels () =
102
-
(* Test different quality levels *)
103
-
let input = String.init 1000 (fun i -> Char.chr (i mod 256)) in
104
-
List.iter (fun quality ->
105
-
let r = Bytes.Reader.of_string input in
106
-
let cr = Bytesrw_brotli.compress_reads ~quality () r in
107
-
let dr = Bytesrw_brotli.decompress_reads () cr in
108
-
let result = Bytes.Reader.to_string dr in
109
-
Alcotest.(check string) (Printf.sprintf "quality %d" quality) input result
110
-
) [1; 2; 3]
111
-
112
-
(* Brotli-C compatibility tests *)
113
-
114
-
let testdata_dir = "../../vendor/git/brotli-c/tests/testdata"
115
-
116
-
let read_file path =
117
-
let ic = open_in_bin path in
118
-
let n = in_channel_length ic in
119
-
let s = really_input_string ic n in
120
-
close_in ic;
121
-
s
122
-
123
-
let file_exists path =
124
-
try ignore (Unix.stat path); true
125
-
with Unix.Unix_error _ -> false
126
-
127
-
let test_brotli_c_decompress () =
128
-
(* Test decompressing official brotli-c test vectors *)
129
-
let test_cases = [
130
-
"empty";
131
-
"10x10y";
132
-
"64x";
133
-
"backward65536";
134
-
] in
135
-
List.iter (fun name ->
136
-
let original_path = Filename.concat testdata_dir name in
137
-
let compressed_path = Filename.concat testdata_dir (name ^ ".compressed") in
138
-
if file_exists original_path && file_exists compressed_path then begin
139
-
let original = read_file original_path in
140
-
let compressed = read_file compressed_path in
141
-
let r = Bytes.Reader.of_string compressed in
142
-
let dr = Bytesrw_brotli.decompress_reads () r in
143
-
let result = Bytes.Reader.to_string dr in
144
-
Alcotest.(check int) (name ^ " length")
145
-
(String.length original) (String.length result);
146
-
Alcotest.(check string) (name ^ " content") original result
147
-
end
148
-
) test_cases
149
-
150
-
let test_brotli_c_roundtrip () =
151
-
(* Test that our compression produces valid output that brotli-c test files
152
-
can be compared against *)
153
-
let test_cases = [
154
-
"10x10y";
155
-
"64x";
156
-
] in
157
-
List.iter (fun name ->
158
-
let original_path = Filename.concat testdata_dir name in
159
-
if file_exists original_path then begin
160
-
let original = read_file original_path in
161
-
(* Compress with our encoder *)
162
-
let r = Bytes.Reader.of_string original in
163
-
let cr = Bytesrw_brotli.compress_reads () r in
164
-
let compressed = Bytes.Reader.to_string cr in
165
-
(* Decompress with our decoder *)
166
-
let dr = Bytesrw_brotli.decompress_reads ()
167
-
(Bytes.Reader.of_string compressed) in
168
-
let result = Bytes.Reader.to_string dr in
169
-
Alcotest.(check string) (name ^ " roundtrip") original result
170
-
end
171
-
) test_cases
172
-
173
-
let test_brotli_c_text_files () =
174
-
(* Test with larger text files from brotli-c test suite *)
175
-
let test_cases = [
176
-
"alice29.txt";
177
-
"asyoulik.txt";
178
-
] in
179
-
List.iter (fun name ->
180
-
let original_path = Filename.concat testdata_dir name in
181
-
let compressed_path = Filename.concat testdata_dir (name ^ ".compressed") in
182
-
if file_exists original_path && file_exists compressed_path then begin
183
-
let original = read_file original_path in
184
-
let compressed = read_file compressed_path in
185
-
(* Test decompressing official brotli-c output *)
186
-
let r = Bytes.Reader.of_string compressed in
187
-
let dr = Bytesrw_brotli.decompress_reads () r in
188
-
let result = Bytes.Reader.to_string dr in
189
-
Alcotest.(check int) (name ^ " length")
190
-
(String.length original) (String.length result);
191
-
Alcotest.(check string) (name ^ " content") original result
192
-
end
193
-
) test_cases
194
-
195
-
let () =
196
-
Alcotest.run "bytesrw_brotli" [
197
-
"compress_reads", [
198
-
Alcotest.test_case "empty" `Quick test_compress_reads_empty;
199
-
Alcotest.test_case "simple" `Quick test_compress_reads_simple;
200
-
];
201
-
"decompress_reads", [
202
-
Alcotest.test_case "simple" `Quick test_decompress_reads_simple;
203
-
];
204
-
"roundtrip_reads", [
205
-
Alcotest.test_case "large" `Quick test_roundtrip_reads;
206
-
];
207
-
"compress_writes", [
208
-
Alcotest.test_case "simple" `Quick test_compress_writes_simple;
209
-
];
210
-
"decompress_writes", [
211
-
Alcotest.test_case "simple" `Quick test_decompress_writes_simple;
212
-
];
213
-
"roundtrip_writes", [
214
-
Alcotest.test_case "large" `Quick test_roundtrip_writes;
215
-
];
216
-
"parameters", [
217
-
Alcotest.test_case "slice_length" `Quick test_slice_length;
218
-
Alcotest.test_case "quality_levels" `Quick test_quality_levels;
219
-
];
220
-
"brotli_c_compat", [
221
-
Alcotest.test_case "decompress_test_vectors" `Quick test_brotli_c_decompress;
222
-
Alcotest.test_case "roundtrip_test_vectors" `Quick test_brotli_c_roundtrip;
223
-
Alcotest.test_case "text_files" `Quick test_brotli_c_text_files;
224
-
];
225
-
]
-432
ocaml-brotli/data/dictionary.bin
-432
ocaml-brotli/data/dictionary.bin
···
1
-
timedownlifeleftbackcodedatashowonlysitecityopenjustlikefreeworktextyearoverbodyloveformbookplaylivelinehelphomesidemorewordlongthemviewfindpagedaysfullheadtermeachareafromtruemarkableuponhighdatelandnewsevennextcasebothpostusedmadehandherewhatnameLinkblogsizebaseheldmakemainuser') +holdendswithNewsreadweresigntakehavegameseencallpathwellplusmenufilmpartjointhislistgoodneedwayswestjobsmindalsologorichuseslastteamarmyfoodkingwilleastwardbestfirePageknowaway.pngmovethanloadgiveselfnotemuchfeedmanyrockicononcelookhidediedHomerulehostajaxinfoclublawslesshalfsomesuchzone100%onescareTimeracebluefourweekfacehopegavehardlostwhenparkkeptpassshiproomHTMLplanTypedonesavekeepflaglinksoldfivetookratetownjumpthusdarkcardfilefearstaykillthatfallautoever.comtalkshopvotedeepmoderestturnbornbandfellroseurl(skinrolecomeactsagesmeetgold.jpgitemvaryfeltthensenddropViewcopy1.0"</a>stopelseliestourpack.gifpastcss?graymean>rideshotlatesaidroadvar feeljohnrickportfast'UA-dead</b>poorbilltypeU.S.woodmust2px;Inforankwidewantwalllead[0];paulwavesure$('#waitmassarmsgoesgainlangpaid!-- lockunitrootwalkfirmwifexml"songtest20pxkindrowstoolfontmailsafestarmapscorerainflowbabyspansays4px;6px;artsfootrealwikiheatsteptriporg/lakeweaktoldFormcastfansbankveryrunsjulytask1px;goalgrewslowedgeid="sets5px;.js?40pxif (soonseatnonetubezerosentreedfactintogiftharm18pxcamehillboldzoomvoideasyringfillpeakinitcost3px;jacktagsbitsrolleditknewnear<!--growJSONdutyNamesaleyou lotspainjazzcoldeyesfishwww.risktabsprev10pxrise25pxBlueding300,ballfordearnwildbox.fairlackverspairjunetechif(!pickevil$("#warmlorddoespull,000ideadrawhugespotfundburnhrefcellkeystickhourlossfuel12pxsuitdealRSS"agedgreyGET"easeaimsgirlaids8px;navygridtips#999warsladycars); }php?helltallwhomzh:�*/
2
-
100hall.
3
-
4
-
A7px;pushchat0px;crew*/</hash75pxflatrare && tellcampontolaidmissskiptentfinemalegetsplot400,
5
-
6
-
coolfeet.php<br>ericmostguidbelldeschairmathatom/imgRluckcent000;tinygonehtmlselldrugFREEnodenick?id=losenullvastwindRSS wearrelybeensamedukenasacapewishgulfT23:hitsslotgatekickblurthey15px''););">msiewinsbirdsortbetaseekT18:ordstreemall60pxfarm’sboys[0].');"POSTbearkids);}}marytend(UK)quadzh:�-siz----prop');
liftT19:viceandydebt>RSSpoolneckblowT16:doorevalT17:letsfailoralpollnovacolsgene —softrometillross<h3>pourfadepink<tr>mini)|!(minezh:�barshear00);milk -->ironfreddiskwentsoilputs/js/holyT22:ISBNT20:adamsees<h2>json', 'contT21: RSSloopasiamoon</p>soulLINEfortcartT14:<h1>80px!--<9px;T04:mike:46ZniceinchYorkricezh:�'));puremageparatonebond:37Z_of_']);000,zh:�tankyardbowlbush:56ZJava30px
7
-
|}
8
-
%C3%:34ZjeffEXPIcashvisagolfsnowzh:�quer.csssickmeatmin.binddellhirepicsrent:36ZHTTP-201fotowolfEND xbox:54ZBODYdick;
9
-
}
10
-
exit:35Zvarsbeat'});diet999;anne}}</[i].Langkm²wiretoysaddssealalex;
11
-
}echonine.org005)tonyjewssandlegsroof000) 200winegeardogsbootgarycutstyletemption.xmlcockgang$('.50pxPh.Dmiscalanloandeskmileryanunixdisc);}
12
-
dustclip).
13
-
14
-
70px-200DVDs7]><tapedemoi++)wageeurophiloptsholeFAQsasin-26TlabspetsURL bulkcook;}
15
-
HEAD[0])abbrjuan(198leshtwin</i>sonyguysfuckpipe|-
16
-
!002)ndow[1];[];
17
-
Log salt
18
-
bangtrimbath){
19
-
00px
20
-
});ko:�feesad>
s:// [];tollplug(){
21
-
{
22
-
.js'200pdualboat.JPG);
23
-
}quot);
24
-
25
-
');
26
-
27
-
}
201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037201320122011201020092008200720062005200420032002200120001999199819971996199519941993199219911990198919881987198619851984198319821981198019791978197719761975197419731972197119701969196819671966196519641963196219611960195919581957195619551954195319521951195010001024139400009999comomásesteestaperotodohacecadaañobiendíaasívidacasootroforosolootracualdijosidograntipotemadebealgoquéestonadatrespococasabajotodasinoaguapuesunosantediceluisellamayozonaamorpisoobraclicellodioshoracasiзанаомрарутанепоотизнодотожеонихНаеебымыВысовывоНообПолиниРФНеМытыОнимдаЗаДаНуОбтеИзейнуммТыужفيأنمامعكلأورديافىهولملكاولهبسالإنهيأيقدهلثمبهلوليبلايبكشيامأمنتبيلنحبهممشوشfirstvideolightworldmediawhitecloseblackrightsmallbooksplacemusicfieldorderpointvalueleveltableboardhousegroupworksyearsstatetodaywaterstartstyledeathpowerphonenighterrorinputabouttermstitletoolseventlocaltimeslargewordsgamesshortspacefocusclearmodelblockguideradiosharewomenagainmoneyimagenamesyounglineslatercolorgreenfront&watchforcepricerulesbeginaftervisitissueareasbelowindextotalhourslabelprintpressbuiltlinksspeedstudytradefoundsenseundershownformsrangeaddedstillmovedtakenaboveflashfixedoftenotherviewschecklegalriveritemsquickshapehumanexistgoingmoviethirdbasicpeacestagewidthloginideaswrotepagesusersdrivestorebreaksouthvoicesitesmonthwherebuildwhichearthforumthreesportpartyClicklowerlivesclasslayerentrystoryusagesoundcourtyour birthpopuptypesapplyImagebeinguppernoteseveryshowsmeansextramatchtrackknownearlybegansuperpapernorthlearngivennamedendedTermspartsGroupbrandusingwomanfalsereadyaudiotakeswhile.com/livedcasesdailychildgreatjudgethoseunitsneverbroadcoastcoverapplefilescyclesceneplansclickwritequeenpieceemailframeolderphotolimitcachecivilscaleenterthemetheretouchboundroyalaskedwholesincestock namefaithheartemptyofferscopeownedmightalbumthinkbloodarraymajortrustcanonunioncountvalidstoneStyleLoginhappyoccurleft:freshquitefilmsgradeneedsurbanfightbasishoverauto;route.htmlmixedfinalYour slidetopicbrownalonedrawnsplitreachRightdatesmarchquotegoodsLinksdoubtasyncthumballowchiefyouthnovel10px;serveuntilhandsCheckSpacequeryjamesequaltwice0,000Startpanelsongsroundeightshiftworthpostsleadsweeksavoidthesemilesplanesmartalphaplantmarksratesplaysclaimsalestextsstarswrong</h3>thing.org/multiheardPowerstandtokensolid(thisbringshipsstafftriedcallsfullyfactsagentThis //-->adminegyptEvent15px;Emailtrue"crossspentblogsbox">notedleavechinasizesguest</h4>robotheavytrue,sevengrandcrimesignsawaredancephase><!--en_US'200px_namelatinenjoyajax.ationsmithU.S. holdspeterindianav">chainscorecomesdoingpriorShare1990sromanlistsjapanfallstrialowneragree</h2>abusealertopera"-//WcardshillsteamsPhototruthclean.php?saintmetallouismeantproofbriefrow">genretrucklooksValueFrame.net/-->
28
-
<try {
29
-
var makescostsplainadultquesttrainlaborhelpscausemagicmotortheir250pxleaststepsCountcouldglasssidesfundshotelawardmouthmovesparisgivesdutchtexasfruitnull,||[];top">
30
-
<!--POST"ocean<br/>floorspeakdepth sizebankscatchchart20px;aligndealswould50px;url="parksmouseMost ...</amongbrainbody none;basedcarrydraftreferpage_home.meterdelaydreamprovejoint</tr>drugs<!-- aprilidealallenexactforthcodeslogicView seemsblankports (200saved_linkgoalsgrantgreekhomesringsrated30px;whoseparse();" Blocklinuxjonespixel');">);if(-leftdavidhorseFocusraiseboxesTrackement</em>bar">.src=toweralt="cablehenry24px;setupitalysharpminortastewantsthis.resetwheelgirls/css/100%;clubsstuffbiblevotes 1000korea});
31
-
bandsqueue= {};80px;cking{
32
-
aheadclockirishlike ratiostatsForm"yahoo)[0];Aboutfinds</h1>debugtasksURL =cells})();12px;primetellsturns0x600.jpg"spainbeachtaxesmicroangel--></giftssteve-linkbody.});
33
-
mount (199FAQ</rogerfrankClass28px;feeds<h1><scotttests22px;drink) || lewisshall#039; for lovedwaste00px;ja:��simon<fontreplymeetsuntercheaptightBrand) != dressclipsroomsonkeymobilmain.Name platefunnytreescom/"1.jpgwmodeparamSTARTleft idden, 201);
34
-
}
35
-
form.viruschairtransworstPagesitionpatch<!--
36
-
o-cacfirmstours,000 asiani++){adobe')[0]id=10both;menu .2.mi.png"kevincoachChildbruce2.jpgURL)+.jpg|suitesliceharry120" sweettr>
37
-
name=diegopage swiss-->
38
-
39
-
#fff;">Log.com"treatsheet) && 14px;sleepntentfiledja:��id="cName"worseshots-box-delta
40
-
<bears:48Z<data-rural</a> spendbakershops= "";php">ction13px;brianhellosize=o=%2F joinmaybe<img img">, fjsimg" ")[0]MTopBType"newlyDanskczechtrailknows</h5>faq">zh-cn10);
41
-
-1");type=bluestrulydavis.js';>
42
-
<!steel you h2>
43
-
form jesus100% menu.
44
-
45
-
walesrisksumentddingb-likteachgif" vegasdanskeestishqipsuomisobredesdeentretodospuedeañosestátienehastaotrospartedondenuevohacerformamismomejormundoaquídíassóloayudafechatodastantomenosdatosotrassitiomuchoahoralugarmayorestoshorastenerantesfotosestaspaísnuevasaludforosmedioquienmesespoderchileserávecesdecirjoséestarventagrupohechoellostengoamigocosasnivelgentemismaairesjuliotemashaciafavorjuniolibrepuntobuenoautorabrilbuenatextomarzosaberlistaluegocómoenerojuegoperúhaberestoynuncamujervalorfueralibrogustaigualvotoscasosguíapuedosomosavisousteddebennochebuscafaltaeurosseriedichocursoclavecasasleónplazolargoobrasvistaapoyojuntotratavistocrearcampohemoscincocargopisosordenhacenáreadiscopedrocercapuedapapelmenorútilclarojorgecalleponertardenadiemarcasigueellassiglocochemotosmadreclaserestoniñoquedapasarbancohijosviajepabloéstevienereinodejarfondocanalnorteletracausatomarmanoslunesautosvillavendopesartipostengamarcollevapadreunidovamoszonasambosbandamariaabusomuchasubirriojavivirgradochicaallíjovendichaestantalessalirsuelopesosfinesllamabuscoéstalleganegroplazahumorpagarjuntadobleislasbolsabañohablaluchaÁreadicenjugarnotasvalleallácargadolorabajoestégustomentemariofirmacostofichaplatahogarartesleyesaquelmuseobasespocosmitadcielochicomiedoganarsantoetapadebesplayaredessietecortecoreadudasdeseoviejodeseaaguas"domaincommonstatuseventsmastersystemactionbannerremovescrollupdateglobalmediumfilternumberchangeresultpublicscreenchoosenormaltravelissuessourcetargetspringmodulemobileswitchphotosborderregionitselfsocialactivecolumnrecordfollowtitle>eitherlengthfamilyfriendlayoutauthorcreatereviewsummerserverplayedplayerexpandpolicyformatdoublepointsseriespersonlivingdesignmonthsforcesuniqueweightpeopleenergynaturesearchfigurehavingcustomoffsetletterwindowsubmitrendergroupsuploadhealthmethodvideosschoolfutureshadowdebatevaluesObjectothersrightsleaguechromesimplenoticesharedendingseasonreportonlinesquarebuttonimagesenablemovinglatestwinterFranceperiodstrongrepeatLondondetailformeddemandsecurepassedtoggleplacesdevicestaticcitiesstreamyellowattackstreetflighthiddeninfo">openedusefulvalleycausesleadersecretseconddamagesportsexceptratingsignedthingseffectfieldsstatesofficevisualeditorvolumeReportmuseummoviesparentaccessmostlymother" id="marketgroundchancesurveybeforesymbolmomentspeechmotioninsidematterCenterobjectexistsmiddleEuropegrowthlegacymannerenoughcareeransweroriginportalclientselectrandomclosedtopicscomingfatheroptionsimplyraisedescapechosenchurchdefinereasoncorneroutputmemoryiframepolicemodelsNumberduringoffersstyleskilledlistedcalledsilvermargindeletebetterbrowselimitsGlobalsinglewidgetcenterbudgetnowrapcreditclaimsenginesafetychoicespirit-stylespreadmakingneededrussiapleaseextentScriptbrokenallowschargedividefactormember-basedtheoryconfigaroundworkedhelpedChurchimpactshouldalwayslogo" bottomlist">){var prefixorangeHeader.push(couplegardenbridgelaunchReviewtakingvisionlittledatingButtonbeautythemesforgotSearchanchoralmostloadedChangereturnstringreloadMobileincomesupplySourceordersviewed courseAbout island<html cookiename="amazonmodernadvicein</a>: The dialoghousesBEGIN MexicostartscentreheightaddingIslandassetsEmpireSchooleffortdirectnearlymanualSelect.
46
-
47
-
Onejoinedmenu">PhilipawardshandleimportOfficeregardskillsnationSportsdegreeweekly (e.g.behinddoctorloggedunited</b></beginsplantsassistartistissued300px|canadaagencyschemeremainBrazilsamplelogo">beyond-scaleacceptservedmarineFootercamera</h1>
48
-
_form"leavesstress" />
49
-
.gif" onloadloaderOxfordsistersurvivlistenfemaleDesignsize="appealtext">levelsthankshigherforcedanimalanyoneAfricaagreedrecentPeople<br />wonderpricesturned|| {};main">inlinesundaywrap">failedcensusminutebeaconquotes150px|estateremoteemail"linkedright;signalformal1.htmlsignupprincefloat:.png" forum.AccesspaperssoundsextendHeightsliderUTF-8"& Before. WithstudioownersmanageprofitjQueryannualparamsboughtfamousgooglelongeri++) {israelsayingdecidehome">headerensurebranchpiecesblock;statedtop"><racingresize-->pacitysexualbureau.jpg" 10,000obtaintitlesamount, Inc.comedymenu" lyricstoday.indeedcounty_logo.FamilylookedMarketlse ifPlayerturkey);var forestgivingerrorsDomain}else{insertBlog</footerlogin.fasteragents<body 10px 0pragmafridayjuniordollarplacedcoversplugin5,000 page">boston.test(avatartested_countforumsschemaindex,filledsharesreaderalert(appearSubmitline">body">
50
-
* TheThoughseeingjerseyNews</verifyexpertinjurywidth=CookieSTART across_imagethreadnativepocketbox">
51
-
System DavidcancertablesprovedApril reallydriveritem">more">boardscolorscampusfirst || [];media.guitarfinishwidth:showedOther .php" assumelayerswilsonstoresreliefswedenCustomeasily your String
52
-
53
-
Whiltaylorclear:resortfrenchthough") + "<body>buyingbrandsMembername">oppingsector5px;">vspacepostermajor coffeemartinmaturehappen</nav>kansaslink">Images=falsewhile hspace0&
54
-
55
-
In powerPolski-colorjordanBottomStart -count2.htmlnews">01.jpgOnline-rightmillerseniorISBN 00,000 guidesvalue)ectionrepair.xml" rights.html-blockregExp:hoverwithinvirginphones</tr>
using
56
-
var >');
57
-
</td>
58
-
</tr>
59
-
bahasabrasilgalegomagyarpolskisrpskiردو中文简体繁體信息中国我们一个公司管理论坛可以服务时间个人产品自己企业查看工作联系没有网站所有评论中心文章用户首页作者技术问题相关下载搜索使用软件在线主题资料视频回复注册网络收藏内容推荐市场消息空间发布什么好友生活图片发展如果手机新闻最新方式北京提供关于更多这个系统知道游戏广告其他发表安全第一会员进行点击版权电子世界设计免费教育加入活动他们商品博客现在上海如何已经留言详细社区登录本站需要价格支持国际链接国家建设朋友阅读法律位置经济选择这样当前分类排行因为交易最后音乐不能通过行业科技可能设备合作大家社会研究专业全部项目这里还是开始情况电脑文件品牌帮助文化资源大学学习地址浏览投资工程要求怎么时候功能主要目前资讯城市方法电影招聘声明任何健康数据美国汽车介绍但是交流生产所以电话显示一些单位人员分析地图旅游工具学生系列网友帖子密码频道控制地区基本全国网上重要第二喜欢进入友情这些考试发现培训以上政府成为环境香港同时娱乐发送一定开发作品标准欢迎解决地方一下以及责任或者客户代表积分女人数码销售出现离线应用列表不同编辑统计查询不要有关机构很多播放组织政策直接能力来源時間看到热门关键专区非常英语百度希望美女比较知识规定建议部门意见精彩日本提高发言方面基金处理权限影片银行还有分享物品经营添加专家这种话题起来业务公告记录简介质量男人影响引用报告部分快速咨询时尚注意申请学校应该历史只是返回购买名称为了成功说明供应孩子专题程序一般會員只有其它保护而且今天窗口动态状态特别认为必须更新小说我們作为媒体包括那么一样国内是否根据电视学院具有过程由于人才出来不过正在明星故事关系标题商务输入一直基础教学了解建筑结果全球通知计划对于艺术相册发生真的建立等级类型经验实现制作来自标签以下原创无法其中個人一切指南关闭集团第三关注因此照片深圳商业广州日期高级最近综合表示专辑行为交通评价觉得精华家庭完成感觉安装得到邮件制度食品虽然转载报价记者方案行政人民用品东西提出酒店然后付款热点以前完全发帖设置领导工业医院看看经典原因平台各种增加材料新增之后职业效果今年论文我国告诉版主修改参与打印快乐机械观点存在精神获得利用继续你们这么模式语言能够雅虎操作风格一起科学体育短信条件治疗运动产业会议导航先生联盟可是問題结构作用调查資料自动负责农业访问实施接受讨论那个反馈加强女性范围服務休闲今日客服觀看参加的话一点保证图书有效测试移动才能决定股票不断需求不得办法之间采用营销投诉目标爱情摄影有些複製文学机会数字装修购物农村全面精品其实事情水平提示上市谢谢普通教师上传类别歌曲拥有创新配件只要时代資訊达到人生订阅老师展示心理贴子網站主題自然级别简单改革那些来说打开代码删除证券节目重点次數多少规划资金找到以后大全主页最佳回答天下保障现代检查投票小时沒有正常甚至代理目录公开复制金融幸福版本形成准备行情回到思想怎样协议认证最好产生按照服装广东动漫采购新手组图面板参考政治容易天地努力人们升级速度人物调整流行造成文字韩国贸易开展相關表现影视如此美容大小报道条款心情许多法规家居书店连接立即举报技巧奥运登入以来理论事件自由中华办公妈妈真正不错全文合同价值别人监督具体世纪团队创业承担增长有人保持商家维修台湾左右股份答案实际电信经理生命宣传任务正式特色下来协会只能当然重新內容指导运行日志賣家超过土地浙江支付推出站长杭州执行制造之一推广现场描述变化传统歌手保险课程医疗经过过去之前收入年度杂志美丽最高登陆未来加工免责教程版块身体重庆出售成本形式土豆出價东方邮箱南京求职取得职位相信页面分钟网页确定图例网址积极错误目的宝贝机关风险授权病毒宠物除了評論疾病及时求购站点儿童每天中央认识每个天津字体台灣维护本页个性官方常见相机战略应当律师方便校园股市房屋栏目员工导致突然道具本网结合档案劳动另外美元引起改变第四会计說明隐私宝宝规范消费共同忘记体系带来名字發表开放加盟受到二手大量成人数量共享区域女孩原则所在结束通信超级配置当时优秀性感房产遊戲出口提交就业保健程度参数事业整个山东情感特殊分類搜尋属于门户财务声音及其财经坚持干部成立利益考虑成都包装用戶比赛文明招商完整真是眼睛伙伴威望领域卫生优惠論壇公共良好充分符合附件特点不可英文资产根本明显密碼公众民族更加享受同学启动适合原来问答本文美食绿色稳定终于生物供求搜狐力量严重永远写真有限竞争对象费用不好绝对十分促进点评影音优势不少欣赏并且有点方向全新信用设施形象资格突破随着重大于是毕业智能化工完美商城统一出版打造產品概况用于保留因素中國存储贴图最愛长期口价理财基地安排武汉里面创建天空首先完善驱动下面不再诚信意义阳光英国漂亮军事玩家群众农民即可名稱家具动画想到注明小学性能考研硬件观看清楚搞笑首頁黄金适用江苏真实主管阶段註冊翻译权利做好似乎通讯施工狀態也许环保培养概念大型机票理解匿名cuandoenviarmadridbuscariniciotiempoporquecuentaestadopuedenjuegoscontraestánnombretienenperfilmaneraamigosciudadcentroaunquepuedesdentroprimerpreciosegúnbuenosvolverpuntossemanahabíaagostonuevosunidoscarlosequiponiñosmuchosalgunacorreoimagenpartirarribamaríahombreempleoverdadcambiomuchasfueronpasadolíneaparecenuevascursosestabaquierolibroscuantoaccesomiguelvarioscuatrotienesgruposseráneuropamediosfrenteacercademásofertacochesmodeloitalialetrasalgúncompracualesexistecuerposiendoprensallegarviajesdineromurciapodrápuestodiariopuebloquieremanuelpropiocrisisciertoseguromuertefuentecerrargrandeefectopartesmedidapropiaofrecetierrae-mailvariasformasfuturoobjetoseguirriesgonormasmismosúnicocaminositiosrazóndebidopruebatoledoteníajesúsesperococinaorigentiendacientocádizhablarseríalatinafuerzaestiloguerraentraréxitolópezagendavídeoevitarpaginametrosjavierpadresfácilcabezaáreassalidaenvíojapónabusosbienestextosllevarpuedanfuertecomúnclaseshumanotenidobilbaounidadestáseditarcreadoдлячтокакилиэтовсеегопритакещеужеКакбезбылониВсеподЭтотомчемнетлетразонагдемнеДляПринаснихтемктогодвоттамСШАмаяЧтовасвамемуТакдванамэтиэтуВамтехпротутнаддняВоттринейВаснимсамтотрубОнимирнееОООлицэтаОнанемдоммойдвеоносудकेहैकीसेकाकोऔरपरनेएककिभीइसकरतोहोआपहीयहयातकथाjagranआजजोअबदोगईजागएहमइनवहयेथेथीघरजबदीकईजीवेनईनएहरउसमेकमवोलेसबमईदेओरआमबसभरबनचलमनआगसीलीعلىإلىهذاآخرعددالىهذهصورغيركانولابينعرضذلكهنايومقالعليانالكنحتىقبلوحةاخرفقطعبدركنإذاكمااحدإلافيهبعضكيفبحثومنوهوأناجدالهاسلمعندليسعبرصلىمنذبهاأنهمثلكنتالاحيثمصرشرححولوفياذالكلمرةانتالفأبوخاصأنتانهاليعضووقدابنخيربنتلكمشاءوهيابوقصصومارقمأحدنحنعدمرأياحةكتبدونيجبمنهتحتجهةسنةيتمكرةغزةنفسبيتللهلناتلكقلبلماعنهأولشيءنورأمافيكبكلذاترتببأنهمسانكبيعفقدحسنلهمشعرأهلشهرقطرطلبprofileservicedefaulthimselfdetailscontentsupportstartedmessagesuccessfashion<title>countryaccountcreatedstoriesresultsrunningprocesswritingobjectsvisiblewelcomearticleunknownnetworkcompanydynamicbrowserprivacyproblemServicerespectdisplayrequestreservewebsitehistoryfriendsoptionsworkingversionmillionchannelwindow.addressvisitedweathercorrectproductedirectforwardyou canremovedsubjectcontrolarchivecurrentreadinglibrarylimitedmanagerfurthersummarymachineminutesprivatecontextprogramsocietynumberswrittenenabledtriggersourcesloadingelementpartnerfinallyperfectmeaningsystemskeepingculture",journalprojectsurfaces"expiresreviewsbalanceEnglishContentthroughPlease opinioncontactaverageprimaryvillageSpanishgallerydeclinemeetingmissionpopularqualitymeasuregeneralspeciessessionsectionwriterscounterinitialreportsfiguresmembersholdingdisputeearlierexpressdigitalpictureAnothermarriedtrafficleadingchangedcentralvictoryimages/reasonsstudiesfeaturelistingmust beschoolsVersionusuallyepisodeplayinggrowingobviousoverlaypresentactions</ul>
60
-
wrapperalreadycertainrealitystorageanotherdesktopofferedpatternunusualDigitalcapitalWebsitefailureconnectreducedAndroiddecadesregular & animalsreleaseAutomatgettingmethodsnothingPopularcaptionletterscapturesciencelicensechangesEngland=1&History = new CentralupdatedSpecialNetworkrequirecommentwarningCollegetoolbarremainsbecauseelectedDeutschfinanceworkersquicklybetweenexactlysettingdiseaseSocietyweaponsexhibit<!--Controlclassescoveredoutlineattacksdevices(windowpurposetitle="Mobile killingshowingItaliandroppedheavilyeffects-1']);
61
-
confirmCurrentadvancesharingopeningdrawingbillionorderedGermanyrelated</form>includewhetherdefinedSciencecatalogArticlebuttonslargestuniformjourneysidebarChicagoholidayGeneralpassage,"animatefeelingarrivedpassingnaturalroughly.
62
-
63
-
The but notdensityBritainChineselack oftributeIreland" data-factorsreceivethat isLibraryhusbandin factaffairsCharlesradicalbroughtfindinglanding:lang="return leadersplannedpremiumpackageAmericaEdition]"Messageneed tovalue="complexlookingstationbelievesmaller-mobilerecordswant tokind ofFirefoxyou aresimilarstudiedmaximumheadingrapidlyclimatekingdomemergedamountsfoundedpioneerformuladynastyhow to SupportrevenueeconomyResultsbrothersoldierlargelycalling."AccountEdward segmentRobert effortsPacificlearnedup withheight:we haveAngelesnations_searchappliedacquiremassivegranted: falsetreatedbiggestbenefitdrivingStudiesminimumperhapsmorningsellingis usedreversevariant role="missingachievepromotestudentsomeoneextremerestorebottom:evolvedall thesitemapenglishway to AugustsymbolsCompanymattersmusicalagainstserving})();
64
-
paymenttroubleconceptcompareparentsplayersregionsmonitor ''The winningexploreadaptedGalleryproduceabilityenhancecareers). The collectSearch ancientexistedfooter handlerprintedconsoleEasternexportswindowsChannelillegalneutralsuggest_headersigning.html">settledwesterncausing-webkitclaimedJusticechaptervictimsThomas mozillapromisepartieseditionoutside:false,hundredOlympic_buttonauthorsreachedchronicdemandssecondsprotectadoptedprepareneithergreatlygreateroverallimprovecommandspecialsearch.worshipfundingthoughthighestinsteadutilityquarterCulturetestingclearlyexposedBrowserliberal} catchProjectexamplehide();FloridaanswersallowedEmperordefenseseriousfreedomSeveral-buttonFurtherout of != nulltrainedDenmarkvoid(0)/all.jspreventRequestStephen
65
-
66
-
When observe</h2>
67
-
Modern provide" alt="borders.
68
-
69
-
For
70
-
71
-
Many artistspoweredperformfictiontype ofmedicalticketsopposedCouncilwitnessjusticeGeorge Belgium...</a>twitternotablywaitingwarfare Other rankingphrasesmentionsurvivescholar</p>
72
-
Countryignoredloss ofjust asGeorgiastrange<head><stopped1']);
73
-
islandsnotableborder:list ofcarried100,000</h3>
74
-
severalbecomesselect wedding00.htmlmonarchoff theteacherhighly biologylife ofor evenrise of»plusonehunting(thoughDouglasjoiningcirclesFor theAncientVietnamvehiclesuch ascrystalvalue =Windowsenjoyeda smallassumed<a id="foreign All rihow theDisplayretiredhoweverhidden;battlesseekingcabinetwas notlook atconductget theJanuaryhappensturninga:hoverOnline French lackingtypicalextractenemieseven ifgeneratdecidedare not/searchbeliefs-image:locatedstatic.login">convertviolententeredfirst">circuitFinlandchemistshe was10px;">as suchdivided</span>will beline ofa greatmystery/index.fallingdue to railwaycollegemonsterdescentit withnuclearJewish protestBritishflowerspredictreformsbutton who waslectureinstantsuicidegenericperiodsmarketsSocial fishingcombinegraphicwinners<br /><by the NaturalPrivacycookiesoutcomeresolveSwedishbrieflyPersianso muchCenturydepictscolumnshousingscriptsnext tobearingmappingrevisedjQuery(-width:title">tooltipSectiondesignsTurkishyounger.match(})();
75
-
76
-
burningoperatedegreessource=Richardcloselyplasticentries</tr>
77
-
color:#ul id="possessrollingphysicsfailingexecutecontestlink toDefault<br />
78
-
: true,chartertourismclassicproceedexplain</h1>
79
-
online.?xml vehelpingdiamonduse theairlineend -->).attr(readershosting#ffffffrealizeVincentsignals src="/ProductdespitediversetellingPublic held inJoseph theatreaffects<style>a largedoesn'tlater, ElementfaviconcreatorHungaryAirportsee theso thatMichaelSystemsPrograms, and width=e"tradingleft">
80
-
personsGolden Affairsgrammarformingdestroyidea ofcase ofoldest this is.src = cartoonregistrCommonsMuslimsWhat isin manymarkingrevealsIndeed,equally/show_aoutdoorescape(Austriageneticsystem,In the sittingHe alsoIslandsAcademy
81
-
<!--Daniel bindingblock">imposedutilizeAbraham(except{width:putting).html(|| [];
82
-
DATA[ *kitchenmountedactual dialectmainly _blank'installexpertsif(typeIt also© ">Termsborn inOptionseasterntalkingconcerngained ongoingjustifycriticsfactoryits ownassaultinvitedlastinghis ownhref="/" rel="developconcertdiagramdollarsclusterphp?id=alcohol);})();using a><span>vesselsrevivalAddressamateurandroidallegedillnesswalkingcentersqualifymatchesunifiedextinctDefensedied in
83
-
<!-- customslinkingLittle Book ofeveningmin.js?are thekontakttoday's.html" target=wearingAll Rig;
84
-
})();raising Also, crucialabout">declare-->
85
-
<scfirefoxas muchappliesindex, s, but type =
86
-
87
-
<!--towardsRecordsPrivateForeignPremierchoicesVirtualreturnsCommentPoweredinline;povertychamberLiving volumesAnthonylogin" RelatedEconomyreachescuttinggravitylife inChapter-shadowNotable</td>
88
-
returnstadiumwidgetsvaryingtravelsheld bywho arework infacultyangularwho hadairporttown of
89
-
90
-
Some 'click'chargeskeywordit willcity of(this);Andrew unique checkedor more300px; return;rsion="pluginswithin herselfStationFederalventurepublishsent totensionactresscome tofingersDuke ofpeople,exploitwhat isharmonya major":"httpin his menu">
91
-
monthlyofficercouncilgainingeven inSummarydate ofloyaltyfitnessand wasemperorsupremeSecond hearingRussianlongestAlbertalateralset of small">.appenddo withfederalbank ofbeneathDespiteCapitalgrounds), and percentit fromclosingcontainInsteadfifteenas well.yahoo.respondfighterobscurereflectorganic= Math.editingonline paddinga wholeonerroryear ofend of barrierwhen itheader home ofresumedrenamedstrong>heatingretainscloudfrway of March 1knowingin partBetweenlessonsclosestvirtuallinks">crossedEND -->famous awardedLicenseHealth fairly wealthyminimalAfricancompetelabel">singingfarmersBrasil)discussreplaceGregoryfont copursuedappearsmake uproundedboth ofblockedsaw theofficescoloursif(docuwhen heenforcepush(fuAugust UTF-8">Fantasyin mostinjuredUsuallyfarmingclosureobject defenceuse of Medical<body>
92
-
evidentbe usedkeyCodesixteenIslamic#000000entire widely active (typeofone cancolor =speakerextendsPhysicsterrain<tbody>funeralviewingmiddle cricketprophetshifteddoctorsRussell targetcompactalgebrasocial-bulk ofman and</td>
93
-
he left).val()false);logicalbankinghome tonaming Arizonacredits);
94
-
});
95
-
founderin turnCollinsbefore But thechargedTitle">CaptainspelledgoddessTag -->Adding:but wasRecent patientback in=false&Lincolnwe knowCounterJudaismscript altered']);
96
-
has theunclearEvent',both innot all
97
-
98
-
<!-- placinghard to centersort ofclientsstreetsBernardassertstend tofantasydown inharbourFreedomjewelry/about..searchlegendsis mademodern only ononly toimage" linear painterand notrarely acronymdelivershorter00&as manywidth="/* <![Ctitle =of the lowest picked escapeduses ofpeoples PublicMatthewtacticsdamagedway forlaws ofeasy to windowstrong simple}catch(seventhinfoboxwent topaintedcitizenI don'tretreat. Some ww.");
99
-
bombingmailto:made in. Many carries||{};wiwork ofsynonymdefeatsfavoredopticalpageTraunless sendingleft"><comScorAll thejQuery.touristClassicfalse" Wilhelmsuburbsgenuinebishops.split(global followsbody ofnominalContactsecularleft tochiefly-hidden-banner</li>
100
-
101
-
. When in bothdismissExplorealways via thespañolwelfareruling arrangecaptainhis sonrule ofhe tookitself,=0&(calledsamplesto makecom/pagMartin Kennedyacceptsfull ofhandledBesides//--></able totargetsessencehim to its by common.mineralto takeways tos.org/ladvisedpenaltysimple:if theyLettersa shortHerbertstrikes groups.lengthflightsoverlapslowly lesser social </p>
102
-
it intoranked rate oful>
103
-
attemptpair ofmake itKontaktAntoniohaving ratings activestreamstrapped").css(hostilelead tolittle groups,Picture-->
104
-
105
-
rows=" objectinverse<footerCustomV><\/scrsolvingChamberslaverywoundedwhereas!= 'undfor allpartly -right:Arabianbacked centuryunit ofmobile-Europe,is homerisk ofdesiredClintoncost ofage of become none ofp"Middle ead')[0Criticsstudios>©group">assemblmaking pressedwidget.ps:" ? rebuiltby someFormer editorsdelayedCanonichad thepushingclass="but arepartialBabylonbottom carrierCommandits useAs withcoursesa thirddenotesalso inHouston20px;">accuseddouble goal ofFamous ).bind(priests Onlinein Julyst + "gconsultdecimalhelpfulrevivedis veryr'+'iptlosing femalesis alsostringsdays ofarrivalfuture <objectforcingString(" />
106
-
here isencoded. The balloondone by/commonbgcolorlaw of Indianaavoidedbut the2px 3pxjquery.after apolicy.men andfooter-= true;for usescreen.Indian image =family,http:// driverseternalsame asnoticedviewers})();
107
-
is moreseasonsformer the newis justconsent Searchwas thewhy theshippedbr><br>width: height=made ofcuisineis thata very Admiral fixed;normal MissionPress, ontariocharsettry to invaded="true"spacingis mosta more totallyfall of});
108
-
immensetime inset outsatisfyto finddown tolot of Playersin Junequantumnot thetime todistantFinnishsrc = (single help ofGerman law andlabeledforestscookingspace">header-well asStanleybridges/globalCroatia About [0];
109
-
it, andgroupedbeing a){throwhe madelighterethicalFFFFFF"bottom"like a employslive inas seenprintermost ofub-linkrejectsand useimage">succeedfeedingNuclearinformato helpWomen'sNeitherMexicanprotein<table by manyhealthylawsuitdevised.push({sellerssimply Through.cookie Image(older">us.js"> Since universlarger open to!-- endlies in']);
110
-
marketwho is ("DOMComanagedone fortypeof Kingdomprofitsproposeto showcenter;made itdressedwere inmixtureprecisearisingsrc = 'make a securedBaptistvoting
111
-
var March 2grew upClimate.removeskilledway the</head>face ofacting right">to workreduceshas haderectedshow();action=book ofan area== "htt<header
112
-
<html>conformfacing cookie.rely onhosted .customhe wentbut forspread Family a meansout theforums.footage">MobilClements" id="as highintense--><!--female is seenimpliedset thea stateand hisfastestbesidesbutton_bounded"><img Infoboxevents,a youngand areNative cheaperTimeoutand hasengineswon the(mostlyright: find a -bottomPrince area ofmore ofsearch_nature,legallyperiod,land ofor withinducedprovingmissilelocallyAgainstthe wayk"px;">
113
-
pushed abandonnumeralCertainIn thismore inor somename isand, incrownedISBN 0-createsOctobermay notcenter late inDefenceenactedwish tobroadlycoolingonload=it. TherecoverMembersheight assumes<html>
114
-
people.in one =windowfooter_a good reklamaothers,to this_cookiepanel">London,definescrushedbaptismcoastalstatus title" move tolost inbetter impliesrivalryservers SystemPerhapses and contendflowinglasted rise inGenesisview ofrising seem tobut in backinghe willgiven agiving cities.flow of Later all butHighwayonly bysign ofhe doesdiffersbattery&lasinglesthreatsintegertake onrefusedcalled =US&See thenativesby thissystem.head of:hover,lesbiansurnameand allcommon/header__paramsHarvard/pixel.removalso longrole ofjointlyskyscraUnicodebr />
115
-
AtlantanucleusCounty,purely count">easily build aonclicka givenpointerh"events else {
116
-
ditionsnow the, with man whoorg/Webone andcavalryHe diedseattle00,000 {windowhave toif(windand itssolely m"renewedDetroitamongsteither them inSenatorUs</a><King ofFrancis-produche usedart andhim andused byscoringat hometo haverelatesibilityfactionBuffalolink"><what hefree toCity ofcome insectorscountedone daynervoussquare };if(goin whatimg" alis onlysearch/tuesdaylooselySolomonsexual - <a hrmedium"DO NOT France,with a war andsecond take a >
117
-
118
-
119
-
market.highwaydone inctivity"last">obligedrise to"undefimade to Early praisedin its for hisathleteJupiterYahoo! termed so manyreally s. The a woman?value=direct right" bicycleacing="day andstatingRather,higher Office are nowtimes, when a pay foron this-link">;borderaround annual the Newput the.com" takin toa brief(in thegroups.; widthenzymessimple in late{returntherapya pointbanninginks">
120
-
();" rea place\u003Caabout atr>
121
-
ccount gives a<SCRIPTRailwaythemes/toolboxById("xhumans,watchesin some if (wicoming formats Under but hashanded made bythan infear ofdenoted/iframeleft involtagein eacha"base ofIn manyundergoregimesaction </p>
122
-
<ustomVa;></importsor thatmostly &re size="</a></ha classpassiveHost = WhetherfertileVarious=[];(fucameras/></td>acts asIn some>
123
-
124
-
<!organis <br />Beijingcatalàdeutscheuropeueuskaragaeilgesvenskaespañamensajeusuariotrabajoméxicopáginasiempresistemaoctubreduranteañadirempresamomentonuestroprimeratravésgraciasnuestraprocesoestadoscalidadpersonanúmeroacuerdomúsicamiembroofertasalgunospaísesejemploderechoademásprivadoagregarenlacesposiblehotelessevillaprimeroúltimoeventosarchivoculturamujeresentradaanuncioembargomercadograndesestudiomejoresfebrerodiseñoturismocódigoportadaespaciofamiliaantoniopermiteguardaralgunaspreciosalguiensentidovisitastítuloconocersegundoconsejofranciaminutossegundatenemosefectosmálagasesiónrevistagranadacompraringresogarcíaacciónecuadorquienesinclusodeberámateriahombresmuestrapodríamañanaúltimaestamosoficialtambienningúnsaludospodemosmejorarpositionbusinesshomepagesecuritylanguagestandardcampaignfeaturescategoryexternalchildrenreservedresearchexchangefavoritetemplatemilitaryindustryservicesmaterialproductsz-index:commentssoftwarecompletecalendarplatformarticlesrequiredmovementquestionbuildingpoliticspossiblereligionphysicalfeedbackregisterpicturesdisabledprotocolaudiencesettingsactivityelementslearninganythingabstractprogressoverviewmagazineeconomictrainingpressurevarious <strong>propertyshoppingtogetheradvancedbehaviordownloadfeaturedfootballselectedLanguagedistanceremembertrackingpasswordmodifiedstudentsdirectlyfightingnortherndatabasefestivalbreakinglocationinternetdropdownpracticeevidencefunctionmarriageresponseproblemsnegativeprogramsanalysisreleasedbanner">purchasepoliciesregionalcreativeargumentbookmarkreferrerchemicaldivisioncallbackseparateprojectsconflicthardwareinterestdeliverymountainobtained= false;for(var acceptedcapacitycomputeridentityaircraftemployedproposeddomesticincludesprovidedhospitalverticalcollapseapproachpartnerslogo"><adaughterauthor" culturalfamilies/images/assemblypowerfulteachingfinisheddistrictcriticalcgi-bin/purposesrequireselectionbecomingprovidesacademicexerciseactuallymedicineconstantaccidentMagazinedocumentstartingbottom">observed: "extendedpreviousSoftwarecustomerdecisionstrengthdetailedslightlyplanningtextareacurrencyeveryonestraighttransferpositiveproducedheritageshippingabsolutereceivedrelevantbutton" violenceanywherebenefitslaunchedrecentlyalliancefollowedmultiplebulletinincludedoccurredinternal$(this).republic><tr><tdcongressrecordedultimatesolution<ul id="discoverHome</a>websitesnetworksalthoughentirelymemorialmessagescontinueactive">somewhatvictoriaWestern title="LocationcontractvisitorsDownloadwithout right">
125
-
measureswidth = variableinvolvedvirginianormallyhappenedaccountsstandingnationalRegisterpreparedcontrolsaccuratebirthdaystrategyofficialgraphicscriminalpossiblyconsumerPersonalspeakingvalidateachieved.jpg" />machines</h2>
126
-
keywordsfriendlybrotherscombinedoriginalcomposedexpectedadequatepakistanfollow" valuable</label>relativebringingincreasegovernorplugins/List of Header">" name=" ("graduate</head>
127
-
commercemalaysiadirectormaintain;height:schedulechangingback to catholicpatternscolor: #greatestsuppliesreliable</ul>
128
-
<select citizensclothingwatching<li id="specificcarryingsentence<center>contrastthinkingcatch(e)southernMichael merchantcarouselpadding:interior.split("lizationOctober ){returnimproved-->
129
-
130
-
coveragechairman.png" />subjectsRichard whateverprobablyrecoverybaseballjudgmentconnect..css" /> websitereporteddefault"/></a>
131
-
electricscotlandcreationquantity. ISBN 0did not instance-search-" lang="speakersComputercontainsarchivesministerreactiondiscountItalianocriteriastrongly: 'http:'script'coveringofferingappearedBritish identifyFacebooknumerousvehiclesconcernsAmericanhandlingdiv id="William provider_contentaccuracysection andersonflexibleCategorylawrence<script>layout="approved maximumheader"></table>Serviceshamiltoncurrent canadianchannels/themes//articleoptionalportugalvalue=""intervalwirelessentitledagenciesSearch" measuredthousandspending…new Date" size="pageNamemiddle" " /></a>hidden">sequencepersonaloverflowopinionsillinoislinks">
132
-
<title>versionssaturdayterminalitempropengineersectionsdesignerproposal="false"Españolreleasessubmit" er"additionsymptomsorientedresourceright"><pleasurestationshistory.leaving border=contentscenter">.
133
-
134
-
Some directedsuitablebulgaria.show();designedGeneral conceptsExampleswilliamsOriginal"><span>search">operatorrequestsa "allowingDocumentrevision.
135
-
136
-
The yourselfContact michiganEnglish columbiapriorityprintingdrinkingfacilityreturnedContent officersRussian generate-8859-1"indicatefamiliar qualitymargin:0 contentviewportcontacts-title">portable.length eligibleinvolvesatlanticonload="default.suppliedpaymentsglossary
137
-
138
-
After guidance</td><tdencodingmiddle">came to displaysscottishjonathanmajoritywidgets.clinicalthailandteachers<head>
139
-
affectedsupportspointer;toString</small>oklahomawill be investor0" alt="holidaysResourcelicensed (which . After considervisitingexplorerprimary search" android"quickly meetingsestimate;return ;color:# height=approval, " checked.min.js"magnetic></a></hforecast. While thursdaydvertiseéhasClassevaluateorderingexistingpatients Online coloradoOptions"campbell<!-- end</span><<br />
140
-
_popups|sciences," quality Windows assignedheight: <b classle" value=" Companyexamples<iframe believespresentsmarshallpart of properly).
141
-
142
-
The taxonomymuch of </span>
143
-
" data-srtuguêsscrollTo project<head>
144
-
attorneyemphasissponsorsfancyboxworld's wildlifechecked=sessionsprogrammpx;font- Projectjournalsbelievedvacationthompsonlightingand the special border=0checking</tbody><button Completeclearfix
145
-
<head>
146
-
article <sectionfindingsrole in popular Octoberwebsite exposureused to changesoperatedclickingenteringcommandsinformed numbers </div>creatingonSubmitmarylandcollegesanalyticlistingscontact.loggedInadvisorysiblingscontent"s")s. This packagescheckboxsuggestspregnanttomorrowspacing=icon.pngjapanesecodebasebutton">gamblingsuch as , while </span> missourisportingtop:1px .</span>tensionswidth="2lazyloadnovemberused in height="cript">
147
-
</<tr><td height:2/productcountry include footer" <!-- title"></jquery.</form>
148
-
(简体)(繁體)hrvatskiitalianoromânătürkçeاردوtambiénnoticiasmensajespersonasderechosnacionalserviciocontactousuariosprogramagobiernoempresasanunciosvalenciacolombiadespuésdeportesproyectoproductopúbliconosotroshistoriapresentemillonesmediantepreguntaanteriorrecursosproblemasantiagonuestrosopiniónimprimirmientrasaméricavendedorsociedadrespectorealizarregistropalabrasinterésentoncesespecialmiembrosrealidadcórdobazaragozapáginassocialesbloqueargestiónalquilersistemascienciascompletoversióncompletaestudiospúblicaobjetivoalicantebuscadorcantidadentradasaccionesarchivossuperiormayoríaalemaniafunciónúltimoshaciendoaquellosediciónfernandoambientefacebooknuestrasclientesprocesosbastantepresentareportarcongresopublicarcomerciocontratojóvenesdistritotécnicaconjuntoenergíatrabajarasturiasrecienteutilizarboletínsalvadorcorrectatrabajosprimerosnegocioslibertaddetallespantallapróximoalmeríaanimalesquiénescorazónsecciónbuscandoopcionesexteriorconceptotodavíagaleríaescribirmedicinalicenciaconsultaaspectoscríticadólaresjusticiadeberánperíodonecesitamantenerpequeñorecibidatribunaltenerifecancióncanariasdescargadiversosmallorcarequieretécnicodeberíaviviendafinanzasadelantefuncionaconsejosdifícilciudadesantiguasavanzadatérminounidadessánchezcampañasoftonicrevistascontienesectoresmomentosfacultadcréditodiversassupuestofactoressegundospequeñaгодаеслиестьбылобытьэтомЕслитогоменявсехэтойдажебылигодуденьэтотбыласебяодинсебенадосайтфотонегосвоисвойигрытожевсемсвоюлишьэтихпокаднейдомамиралиботемухотядвухсетилюдиделомиретебясвоевидечегоэтимсчеттемыценысталведьтемеводытебевышенамитипатомуправлицаоднагодызнаюмогудругвсейидеткиноодноделаделесрокиюнявесьЕстьразанашиاللهالتيجميعخاصةالذيعليهجديدالآنالردتحكمصفحةكانتاللييكونشبكةفيهابناتحواءأكثرخلالالحبدليلدروساضغطتكونهناكساحةناديالطبعليكشكرايمكنمنهاشركةرئيسنشيطماذاالفنشبابتعبررحمةكافةيقولمركزكلمةأحمدقلبييعنيصورةطريقشاركجوالأخرىمعناابحثعروضبشكلمسجلبنانخالدكتابكليةبدونأيضايوجدفريقكتبتأفضلمطبخاكثرباركافضلاحلىنفسهأيامردودأنهاديناالانمعرضتعلمداخلممكن����������������������
149
-
150
-
������������������������������������������������������������resourcescountriesquestionsequipmentcommunityavailablehighlightDTD/xhtmlmarketingknowledgesomethingcontainerdirectionsubscribeadvertisecharacter" value="</select>Australia" class="situationauthorityfollowingprimarilyoperationchallengedevelopedanonymousfunction functionscompaniesstructureagreement" title="potentialeducationargumentssecondarycopyrightlanguagesexclusivecondition</form>
151
-
statementattentionBiography} else {
152
-
solutionswhen the Analyticstemplatesdangeroussatellitedocumentspublisherimportantprototypeinfluence»</effectivegenerallytransformbeautifultransportorganizedpublishedprominentuntil thethumbnailNational .focus();over the migrationannouncedfooter">
153
-
exceptionless thanexpensiveformationframeworkterritoryndicationcurrentlyclassNamecriticismtraditionelsewhereAlexanderappointedmaterialsbroadcastmentionedaffiliate</option>treatmentdifferent/default.Presidentonclick="biographyotherwisepermanentFrançaisHollywoodexpansionstandards</style>
154
-
reductionDecember preferredCambridgeopponentsBusiness confusion>
155
-
<title>presentedexplaineddoes not worldwideinterfacepositionsnewspaper</table>
156
-
mountainslike the essentialfinancialselectionaction="/abandonedEducationparseInt(stabilityunable to</title>
157
-
relationsNote thatefficientperformedtwo yearsSince thethereforewrapper">alternateincreasedBattle ofperceivedtrying tonecessaryportrayedelectionsElizabeth</iframe>discoveryinsurances.length;legendaryGeographycandidatecorporatesometimesservices.inherited</strong>CommunityreligiouslocationsCommitteebuildingsthe worldno longerbeginningreferencecannot befrequencytypicallyinto the relative;recordingpresidentinitiallytechniquethe otherit can beexistenceunderlinethis timetelephoneitemscopepracticesadvantage);return For otherprovidingdemocracyboth the extensivesufferingsupportedcomputers functionpracticalsaid thatit may beEnglish</from the scheduleddownloads</label>
158
-
suspectedmargin: 0spiritual</head>
159
-
160
-
microsoftgraduallydiscussedhe becameexecutivejquery.jshouseholdconfirmedpurchasedliterallydestroyedup to thevariationremainingit is notcenturiesJapanese among thecompletedalgorithminterestsrebellionundefinedencourageresizableinvolvingsensitiveuniversalprovision(althoughfeaturingconducted), which continued-header">February numerous overflow:componentfragmentsexcellentcolspan="technicalnear the Advanced source ofexpressedHong Kong Facebookmultiple mechanismelevationoffensive</form>
161
-
sponsoreddocument.or "there arethose whomovementsprocessesdifficultsubmittedrecommendconvincedpromoting" width=".replace(classicalcoalitionhis firstdecisionsassistantindicatedevolution-wrapper"enough toalong thedelivered-->
162
-
<!--American protectedNovember </style><furnitureInternet onblur="suspendedrecipientbased on Moreover,abolishedcollectedwere madeemotionalemergencynarrativeadvocatespx;bordercommitteddir="ltr"employeesresearch. selectedsuccessorcustomersdisplayedSeptemberaddClass(Facebook suggestedand lateroperatingelaborateSometimesInstitutecertainlyinstalledfollowersJerusalemthey havecomputinggeneratedprovincesguaranteearbitraryrecognizewanted topx;width:theory ofbehaviourWhile theestimatedbegan to it becamemagnitudemust havemore thanDirectoryextensionsecretarynaturallyoccurringvariablesgiven theplatform.</label><failed tocompoundskinds of societiesalongside -->
163
-
164
-
southwestthe rightradiationmay have unescape(spoken in" href="/programmeonly the come fromdirectoryburied ina similarthey were</font></Norwegianspecifiedproducingpassenger(new DatetemporaryfictionalAfter theequationsdownload.regularlydeveloperabove thelinked tophenomenaperiod oftooltip">substanceautomaticaspect ofAmong theconnectedestimatesAir Forcesystem ofobjectiveimmediatemaking itpaintingsconqueredare stillproceduregrowth ofheaded byEuropean divisionsmoleculesfranchiseintentionattractedchildhoodalso useddedicatedsingaporedegree offather ofconflicts</a></p>
165
-
came fromwere usednote thatreceivingExecutiveeven moreaccess tocommanderPoliticalmusiciansdeliciousprisonersadvent ofUTF-8" /><![CDATA[">ContactSouthern bgcolor="series of. It was in Europepermittedvalidate.appearingofficialsseriously-languageinitiatedextendinglong-terminflationsuch thatgetCookiemarked by</button>implementbut it isincreasesdown the requiringdependent-->
166
-
<!-- interviewWith the copies ofconsensuswas builtVenezuela(formerlythe statepersonnelstrategicfavour ofinventionWikipediacontinentvirtuallywhich wasprincipleComplete identicalshow thatprimitiveaway frommolecularpreciselydissolvedUnder theversion="> </It is the This is will haveorganismssome timeFriedrichwas firstthe only fact thatform id="precedingTechnicalphysicistoccurs innavigatorsection">span id="sought tobelow thesurviving}</style>his deathas in thecaused bypartiallyexisting using thewas givena list oflevels ofnotion ofOfficial dismissedscientistresemblesduplicateexplosiverecoveredall othergalleries{padding:people ofregion ofaddressesassociateimg alt="in modernshould bemethod ofreportingtimestampneeded tothe Greatregardingseemed toviewed asimpact onidea thatthe Worldheight ofexpandingThese arecurrent">carefullymaintainscharge ofClassicaladdressedpredictedownership<div id="right">
167
-
residenceleave thecontent">are often })();
168
-
probably Professor-button" respondedsays thathad to beplaced inHungarianstatus ofserves asUniversalexecutionaggregatefor whichinfectionagreed tohowever, popular">placed onconstructelectoralsymbol ofincludingreturn toarchitectChristianprevious living ineasier toprofessor
169
-
<!-- effect ofanalyticswas takenwhere thetook overbelief inAfrikaansas far aspreventedwork witha special<fieldsetChristmasRetrieved
170
-
171
-
In the back intonortheastmagazines><strong>committeegoverninggroups ofstored inestablisha generalits firsttheir ownpopulatedan objectCaribbeanallow thedistrictswisconsinlocation.; width: inhabitedSocialistJanuary 1</footer>similarlychoice ofthe same specific business The first.length; desire todeal withsince theuserAgentconceivedindex.phpas "engage inrecently,few yearswere also
172
-
<head>
173
-
<edited byare knowncities inaccesskeycondemnedalso haveservices,family ofSchool ofconvertednature of languageministers</object>there is a popularsequencesadvocatedThey wereany otherlocation=enter themuch morereflectedwas namedoriginal a typicalwhen theyengineerscould notresidentswednesdaythe third productsJanuary 2what theya certainreactionsprocessorafter histhe last contained"></div>
174
-
</a></td>depend onsearch">
175
-
pieces ofcompetingReferencetennesseewhich has version=</span> <</header>gives thehistorianvalue="">padding:0view thattogether,the most was foundsubset ofattack onchildren,points ofpersonal position:allegedlyClevelandwas laterand afterare givenwas stillscrollingdesign ofmakes themuch lessAmericans.
176
-
177
-
After , but theMuseum oflouisiana(from theminnesotaparticlesa processDominicanvolume ofreturningdefensive00px|righmade frommouseover" style="states of(which iscontinuesFranciscobuilding without awith somewho woulda form ofa part ofbefore itknown as Serviceslocation and oftenmeasuringand it ispaperbackvalues of
178
-
<title>= window.determineer" played byand early</center>from thisthe threepower andof "innerHTML<a href="y:inline;Church ofthe eventvery highofficial -height: content="/cgi-bin/to createafrikaansesperantofrançaislatviešulietuviųČeštinačeštinaไทย日本語简体字繁體字한국어为什么计算机笔记本討論區服务器互联网房地产俱乐部出版社排行榜部落格进一步支付宝验证码委员会数据库消费者办公室讨论区深圳市播放器北京市大学生越来越管理员信息网serviciosartículoargentinabarcelonacualquierpublicadoproductospolíticarespuestawikipediasiguientebúsquedacomunidadseguridadprincipalpreguntascontenidorespondervenezuelaproblemasdiciembrerelaciónnoviembresimilaresproyectosprogramasinstitutoactividadencuentraeconomíaimágenescontactardescargarnecesarioatenciónteléfonocomisióncancionescapacidadencontraranálisisfavoritostérminosprovinciaetiquetaselementosfuncionesresultadocarácterpropiedadprincipionecesidadmunicipalcreacióndescargaspresenciacomercialopinionesejercicioeditorialsalamancagonzálezdocumentopelícularecientesgeneralestarragonaprácticanovedadespropuestapacientestécnicasobjetivoscontactosमेंलिएहैंगयासाथएवंरहेकोईकुछरहाबादकहासभीहुएरहीमैंदिनबातdiplodocsसमयरूपनामपताफिरऔसततरहलोगहुआबारदेशहुईखेलयदिकामवेबतीनबीचमौतसाललेखजॉबमददतथानहीशहरअलगकभीनगरपासरातकिएउसेगयीहूँआगेटीमखोजकारअभीगयेतुमवोटदेंअगरऐसेमेललगाहालऊपरचारऐसादेरजिसदिलबंदबनाहूंलाखजीतबटनमिलइसेआनेनयाकुललॉगभागरेलजगहरामलगेपेजहाथइसीसहीकलाठीकहाँदूरतहतसातयादआयापाककौनशामदेखयहीरायखुदलगीcategoriesexperience</title>
179
-
Copyright javascriptconditionseverything<p class="technologybackground<a class="management© 201javaScriptcharactersbreadcrumbthemselveshorizontalgovernmentCaliforniaactivitiesdiscoveredNavigationtransitionconnectionnavigationappearance</title><mcheckbox" techniquesprotectionapparentlyas well asunt', 'UA-resolutionoperationstelevisiontranslatedWashingtonnavigator. = window.impression<br>literaturepopulationbgcolor="#especially content="productionnewsletterpropertiesdefinitionleadershipTechnologyParliamentcomparisonul class=".indexOf("conclusiondiscussioncomponentsbiologicalRevolution_containerunderstoodnoscript><permissioneach otheratmosphere onfocus="<form id="processingthis.valuegenerationConferencesubsequentwell-knownvariationsreputationphenomenondisciplinelogo.png" (document,boundariesexpressionsettlementBackgroundout of theenterprise("https:" unescape("password" democratic<a href="/wrapper">
180
-
membershiplinguisticpx;paddingphilosophyassistanceuniversityfacilitiesrecognizedpreferenceif (typeofmaintainedvocabularyhypothesis.submit();&nbsp;annotationbehind theFoundationpublisher"assumptionintroducedcorruptionscientistsexplicitlyinstead ofdimensions onClick="considereddepartmentoccupationsoon afterinvestmentpronouncedidentifiedexperimentManagementgeographic" height="link rel=".replace(/depressionconferencepunishmenteliminatedresistanceadaptationoppositionwell knownsupplementdeterminedh1 class="0px;marginmechanicalstatisticscelebratedGovernment
181
-
182
-
During tdevelopersartificialequivalentoriginatedCommissionattachment<span id="there wereNederlandsbeyond theregisteredjournalistfrequentlyall of thelang="en" </style>
183
-
absolute; supportingextremely mainstream</strong> popularityemployment</table>
184
-
colspan="</form>
185
-
conversionabout the </p></div>integrated" lang="enPortuguesesubstituteindividualimpossiblemultimediaalmost allpx solid #apart fromsubject toin Englishcriticizedexcept forguidelinesoriginallyremarkablethe secondh2 class="<a title="(includingparametersprohibited= "http://dictionaryperceptionrevolutionfoundationpx;height:successfulsupportersmillenniumhis fatherthe "no-repeat;commercialindustrialencouragedamount of unofficialefficiencyReferencescoordinatedisclaimerexpeditiondevelopingcalculatedsimplifiedlegitimatesubstring(0" class="completelyillustratefive yearsinstrumentPublishing1" class="psychologyconfidencenumber of absence offocused onjoined thestructurespreviously></iframe>once againbut ratherimmigrantsof course,a group ofLiteratureUnlike the</a>
186
-
function it was theConventionautomobileProtestantaggressiveafter the Similarly," /></div>collection
187
-
functionvisibilitythe use ofvolunteersattractionunder the threatened*<![CDATA[importancein generalthe latter</form>
188
-
</.indexOf('i = 0; i <differencedevoted totraditionssearch forultimatelytournamentattributesso-called }
189
-
</style>evaluationemphasizedaccessible</section>successionalong withMeanwhile,industries</a><br />has becomeaspects ofTelevisionsufficientbasketballboth sidescontinuingan article<img alt="adventureshis mothermanchesterprinciplesparticularcommentaryeffects ofdecided to"><strong>publishersJournal ofdifficultyfacilitateacceptablestyle.css" function innovation>Copyrightsituationswould havebusinessesDictionarystatementsoften usedpersistentin Januarycomprising</title>
190
-
diplomaticcontainingperformingextensionsmay not beconcept of onclick="It is alsofinancial making theLuxembourgadditionalare calledengaged in"script");but it waselectroniconsubmit="
191
-
<!-- End electricalofficiallysuggestiontop of theunlike theAustralianOriginallyreferences
192
-
</head>
193
-
recognisedinitializelimited toAlexandriaretirementAdventuresfour years
194
-
195
-
<!-- increasingdecorationh3 class="origins ofobligationregulationclassified(function(advantagesbeing the historians<base hrefrepeatedlywilling tocomparabledesignatednominationfunctionalinside therevelationend of thes for the authorizedrefused totake placeautonomouscompromisepolitical restauranttwo of theFebruary 2quality ofswfobject.understandnearly allwritten byinterviews" width="1withdrawalfloat:leftis usuallycandidatesnewspapersmysteriousDepartmentbest knownparliamentsuppressedconvenientremembereddifferent systematichas led topropagandacontrolledinfluencesceremonialproclaimedProtectionli class="Scientificclass="no-trademarksmore than widespreadLiberationtook placeday of theas long asimprisonedAdditional
196
-
<head>
197
-
<mLaboratoryNovember 2exceptionsIndustrialvariety offloat: lefDuring theassessmenthave been deals withStatisticsoccurrence/ul></div>clearfix">the publicmany yearswhich wereover time,synonymouscontent">
198
-
presumablyhis familyuserAgent.unexpectedincluding challengeda minorityundefined"belongs totaken fromin Octoberposition: said to bereligious Federation rowspan="only a fewmeant thatled to the-->
199
-
<div <fieldset>Archbishop class="nobeing usedapproachesprivilegesnoscript>
200
-
results inmay be theEaster eggmechanismsreasonablePopulationCollectionselected">noscript>
/index.phparrival of-jssdk'));managed toincompletecasualtiescompletionChristiansSeptember arithmeticproceduresmight haveProductionit appearsPhilosophyfriendshipleading togiving thetoward theguaranteeddocumentedcolor:#000video gamecommissionreflectingchange theassociatedsans-serifonkeypress; padding:He was theunderlyingtypically , and the srcElementsuccessivesince the should be networkingaccountinguse of thelower thanshows that</span>
201
-
complaintscontinuousquantitiesastronomerhe did notdue to itsapplied toan averageefforts tothe futureattempt toTherefore,capabilityRepublicanwas formedElectronickilometerschallengespublishingthe formerindigenousdirectionssubsidiaryconspiracydetails ofand in theaffordablesubstancesreason forconventionitemtype="absolutelysupposedlyremained aattractivetravellingseparatelyfocuses onelementaryapplicablefound thatstylesheetmanuscriptstands for no-repeat(sometimesCommercialin Americaundertakenquarter ofan examplepersonallyindex.php?</button>
202
-
percentagebest-knowncreating a" dir="ltrLieutenant
203
-
<div id="they wouldability ofmade up ofnoted thatclear thatargue thatto anotherchildren'spurpose offormulatedbased uponthe regionsubject ofpassengerspossession.
204
-
205
-
In the Before theafterwardscurrently across thescientificcommunity.capitalismin Germanyright-wingthe systemSociety ofpoliticiandirection:went on toremoval of New York apartmentsindicationduring theunless thehistoricalhad been adefinitiveingredientattendanceCenter forprominencereadyStatestrategiesbut in theas part ofconstituteclaim thatlaboratorycompatiblefailure of, such as began withusing the to providefeature offrom which/" class="geologicalseveral ofdeliberateimportant holds thating" valign=topthe Germanoutside ofnegotiatedhis careerseparationid="searchwas calledthe fourthrecreationother thanpreventionwhile the education,connectingaccuratelywere builtwas killedagreementsmuch more Due to thewidth: 100some otherKingdom ofthe entirefamous forto connectobjectivesthe Frenchpeople andfeatured">is said tostructuralreferendummost oftena separate->
206
-
<div id Official worldwide.aria-labelthe planetand it wasd" value="looking atbeneficialare in themonitoringreportedlythe modernworking onallowed towhere the innovative</a></div>soundtracksearchFormtend to beinput id="opening ofrestrictedadopted byaddressingtheologianmethods ofvariant ofChristian very largeautomotiveby far therange frompursuit offollow thebrought toin Englandagree thataccused ofcomes frompreventingdiv style=his or hertremendousfreedom ofconcerning0 1em 1em;Basketball/style.cssan earliereven after/" title=".com/indextaking thepittsburghcontent">
<script>(fturned outhaving the</span>
207
-
occasionalbecause itstarted tophysically></div>
208
-
created byCurrently, bgcolor="tabindex="disastrousAnalytics also has a><div id="</style>
209
-
<called forsinger and.src = "//violationsthis pointconstantlyis locatedrecordingsd from thenederlandsportuguêsעבריתفارسیdesarrollocomentarioeducaciónseptiembreregistradodirecciónubicaciónpublicidadrespuestasresultadosimportantereservadosartículosdiferentessiguientesrepúblicasituaciónministerioprivacidaddirectorioformaciónpoblaciónpresidentecontenidosaccesoriostechnoratipersonalescategoríaespecialesdisponibleactualidadreferenciavalladolidbibliotecarelacionescalendariopolíticasanterioresdocumentosnaturalezamaterialesdiferenciaeconómicatransporterodríguezparticiparencuentrandiscusiónestructurafundaciónfrecuentespermanentetotalmenteможнобудетможетвремятакжечтобыболееоченьэтогокогдапослевсегосайтечерезмогутсайтажизнимеждубудутПоискздесьвидеосвязинужносвоейлюдейпорномногодетейсвоихправатакойместоимеетжизньоднойлучшепередчастичастьработновыхправособойпотомменеечисленовыеуслугоколоназадтакоетогдапочтиПослетакиеновыйстоиттакихсразуСанктфорумКогдакнигислованашейнайтисвоимсвязьлюбойчастосредиКромеФорумрынкесталипоисктысячмесяццентртрудасамыхрынкаНовыйчасовместафильммартастранместетекстнашихминутимениимеютномергородсамомэтомуконцесвоемкакойАрхивمنتدىإرسالرسالةالعامكتبهابرامجاليومالصورجديدةالعضوإضافةالقسمالعابتحميلملفاتملتقىتعديلالشعرأخبارتطويرعليكمإرفاقطلباتاللغةترتيبالناسالشيخمنتديالعربالقصصافلامعليهاتحديثاللهمالعملمكتبةيمكنكالطفلفيديوإدارةتاريخالصحةتسجيلالوقتعندمامدينةتصميمأرشيفالذينعربيةبوابةألعابالسفرمشاكلتعالىالأولالسنةجامعةالصحفالدينكلماتالخاصالملفأعضاءكتابةالخيررسائلالقلبالأدبمقاطعمراسلمنطقةالكتبالرجلاشتركالقدميعطيكsByTagName(.jpg" alt="1px solid #.gif" alt="transparentinformationapplication" onclick="establishedadvertising.png" alt="environmentperformanceappropriate&mdash;immediately</strong></rather thantemperaturedevelopmentcompetitionplaceholdervisibility:copyright">0" height="even thoughreplacementdestinationCorporation<ul class="AssociationindividualsperspectivesetTimeout(url(http://mathematicsmargin-top:eventually description) no-repeatcollections.JPG|thumb|participate/head><bodyfloat:left;<li class="hundreds of
210
-
211
-
However, compositionclear:both;cooperationwithin the label for="border-top:New Zealandrecommendedphotographyinteresting<sup>controversyNetherlandsalternativemaxlength="switzerlandDevelopmentessentially
212
-
213
-
Although </textarea>thunderbirdrepresented&ndash;speculationcommunitieslegislationelectronics
214
-
<div id="illustratedengineeringterritoriesauthoritiesdistributed6" height="sans-serif;capable of disappearedinteractivelooking forit would beAfghanistanwas createdMath.floor(surroundingcan also beobservationmaintenanceencountered<h2 class="more recentit has beeninvasion of).getTime()fundamentalDespite the"><div id="inspirationexaminationpreparationexplanation<input id="</a></span>versions ofinstrumentsbefore the = 'http://Descriptionrelatively .substring(each of theexperimentsinfluentialintegrationmany peopledue to the combinationdo not haveMiddle East<noscript><copyright" perhaps theinstitutionin Decemberarrangementmost famouspersonalitycreation oflimitationsexclusivelysovereignty-content">
215
-
<td class="undergroundparallel todoctrine ofoccupied byterminologyRenaissancea number ofsupport forexplorationrecognitionpredecessor<img src="/<h1 class="publicationmay also bespecialized</fieldset>progressivemillions ofstates thatenforcementaround the one another.parentNodeagricultureAlternativeresearcherstowards theMost of themany other (especially<td width=";width:100%independent<h3 class=" onchange=").addClass(interactionOne of the daughter ofaccessoriesbranches of
216
-
<div id="the largestdeclarationregulationsInformationtranslationdocumentaryin order to">
217
-
<head>
218
-
<" height="1across the orientation);</script>implementedcan be seenthere was ademonstratecontainer">connectionsthe Britishwas written!important;px; margin-followed byability to complicatedduring the immigrationalso called<h4 class="distinctionreplaced bygovernmentslocation ofin Novemberwhether the</p>
219
-
</div>acquisitioncalled the persecutiondesignation{font-size:appeared ininvestigateexperiencedmost likelywidely useddiscussionspresence of (document.extensivelyIt has beenit does notcontrary toinhabitantsimprovementscholarshipconsumptioninstructionfor exampleone or morepx; paddingthe currenta series ofare usuallyrole in thepreviously derivativesevidence ofexperiencescolorschemestated thatcertificate</a></div>
220
-
selected="high schoolresponse tocomfortableadoption ofthree yearsthe countryin Februaryso that thepeople who provided by<param nameaffected byin terms ofappointmentISO-8859-1"was born inhistorical regarded asmeasurementis based on and other : function(significantcelebrationtransmitted/js/jquery.is known astheoretical tabindex="it could be<noscript>
221
-
having been
222
-
<head>
223
-
< "The compilationhe had beenproduced byphilosopherconstructedintended toamong othercompared toto say thatEngineeringa differentreferred todifferencesbelief thatphotographsidentifyingHistory of Republic ofnecessarilyprobabilitytechnicallyleaving thespectacularfraction ofelectricityhead of therestaurantspartnershipemphasis onmost recentshare with saying thatfilled withdesigned toit is often"></iframe>as follows:merged withthrough thecommercial pointed outopportunityview of therequirementdivision ofprogramminghe receivedsetInterval"></span></in New Yorkadditional compression
224
-
225
-
<div id="incorporate;</script><attachEventbecame the " target="_carried outSome of thescience andthe time ofContainer">maintainingChristopherMuch of thewritings of" height="2size of theversion of mixture of between theExamples ofeducationalcompetitive onsubmit="director ofdistinctive/DTD XHTML relating totendency toprovince ofwhich woulddespite thescientific legislature.innerHTML allegationsAgriculturewas used inapproach tointelligentyears later,sans-serifdeterminingPerformanceappearances, which is foundationsabbreviatedhigher thans from the individual composed ofsupposed toclaims thatattributionfont-size:1elements ofHistorical his brotherat the timeanniversarygoverned byrelated to ultimately innovationsit is stillcan only bedefinitionstoGMTStringA number ofimg class="Eventually,was changedoccurred inneighboringdistinguishwhen he wasintroducingterrestrialMany of theargues thatan Americanconquest ofwidespread were killedscreen and In order toexpected todescendantsare locatedlegislativegenerations backgroundmost peopleyears afterthere is nothe highestfrequently they do notargued thatshowed thatpredominanttheologicalby the timeconsideringshort-lived</span></a>can be usedvery littleone of the had alreadyinterpretedcommunicatefeatures ofgovernment,</noscript>entered the" height="3Independentpopulationslarge-scale. Although used in thedestructionpossibilitystarting intwo or moreexpressionssubordinatelarger thanhistory and</option>
226
-
Continentaleliminatingwill not bepractice ofin front ofsite of theensure thatto create amississippipotentiallyoutstandingbetter thanwhat is nowsituated inmeta name="TraditionalsuggestionsTranslationthe form ofatmosphericideologicalenterprisescalculatingeast of theremnants ofpluginspage/index.php?remained intransformedHe was alsowas alreadystatisticalin favor ofMinistry ofmovement offormulationis required<link rel="This is the <a href="/popularizedinvolved inare used toand severalmade by theseems to belikely thatPalestiniannamed afterit had beenmost commonto refer tobut this isconsecutivetemporarilyIn general,conventionstakes placesubdivisionterritorialoperationalpermanentlywas largelyoutbreak ofin the pastfollowing a xmlns:og="><a class="class="textConversion may be usedmanufactureafter beingclearfix">
227
-
question ofwas electedto become abecause of some peopleinspired bysuccessful a time whenmore commonamongst thean officialwidth:100%;technology,was adoptedto keep thesettlementslive birthsindex.html"Connecticutassigned to&times;account foralign=rightthe companyalways beenreturned toinvolvementBecause thethis period" name="q" confined toa result ofvalue="" />is actuallyEnvironment
228
-
</head>
229
-
Conversely,>
230
-
<div id="0" width="1is probablyhave becomecontrollingthe problemcitizens ofpoliticiansreached theas early as:none; over<table cellvalidity ofdirectly toonmousedownwhere it iswhen it wasmembers of relation toaccommodatealong with In the latethe Englishdelicious">this is notthe presentif they areand finallya matter of
231
-
</div>
232
-
233
-
</script>faster thanmajority ofafter whichcomparativeto maintainimprove theawarded theer" class="frameborderrestorationin the sameanalysis oftheir firstDuring the continentalsequence offunction(){font-size: work on the</script>
234
-
<begins withjavascript:constituentwas foundedequilibriumassume thatis given byneeds to becoordinatesthe variousare part ofonly in thesections ofis a commontheories ofdiscoveriesassociationedge of thestrength ofposition inpresent-dayuniversallyto form thebut insteadcorporationattached tois commonlyreasons for "the can be madewas able towhich meansbut did notonMouseOveras possibleoperated bycoming fromthe primaryaddition offor severaltransferreda period ofare able tohowever, itshould havemuch larger
235
-
</script>adopted theproperty ofdirected byeffectivelywas broughtchildren ofProgramminglonger thanmanuscriptswar againstby means ofand most ofsimilar to proprietaryoriginatingprestigiousgrammaticalexperience.to make theIt was alsois found incompetitorsin the U.S.replace thebrought thecalculationfall of thethe generalpracticallyin honor ofreleased inresidentialand some ofking of thereaction to1st Earl ofculture andprincipally</title>
236
-
they can beback to thesome of hisexposure toare similarform of theaddFavoritecitizenshippart in thepeople within practiceto continue&minus;approved by the first allowed theand for thefunctioningplaying thesolution toheight="0" in his bookmore than afollows thecreated thepresence in </td>nationalistthe idea ofa characterwere forced class="btndays of thefeatured inshowing theinterest inin place ofturn of thethe head ofLord of thepoliticallyhas its ownEducationalapproval ofsome of theeach other,behavior ofand becauseand anotherappeared onrecorded inblack"may includethe world'scan lead torefers to aborder="0" government winning theresulted in while the Washington,the subjectcity in the></div>
237
-
reflect theto completebecame moreradioactiverejected bywithout anyhis father,which couldcopy of theto indicatea politicalaccounts ofconstitutesworked wither</a></li>of his lifeaccompaniedclientWidthprevent theLegislativedifferentlytogether inhas severalfor anothertext of thefounded thee with the is used forchanged theusually theplace wherewhereas the> <a href=""><a href="themselves,although hethat can betraditionalrole of theas a resultremoveChilddesigned bywest of theSome peopleproduction,side of thenewslettersused by thedown to theaccepted bylive in theattempts tooutside thefrequenciesHowever, inprogrammersat least inapproximatealthough itwas part ofand variousGovernor ofthe articleturned into><a href="/the economyis the mostmost widelywould laterand perhapsrise to theoccurs whenunder whichconditions.the westerntheory thatis producedthe city ofin which heseen in thethe centralbuilding ofmany of hisarea of theis the onlymost of themany of thethe WesternThere is noextended toStatisticalcolspan=2 |short storypossible totopologicalcritical ofreported toa Christiandecision tois equal toproblems ofThis can bemerchandisefor most ofno evidenceeditions ofelements in". Thecom/images/which makesthe processremains theliterature,is a memberthe popularthe ancientproblems intime of thedefeated bybody of thea few yearsmuch of thethe work ofCalifornia,served as agovernment.concepts ofmovement in <div id="it" value="language ofas they areproduced inis that theexplain thediv></div>
238
-
However thelead to the <a href="/was grantedpeople havecontinuallywas seen asand relatedthe role ofproposed byof the besteach other.Constantinepeople fromdialects ofto revisionwas renameda source ofthe initiallaunched inprovide theto the westwhere thereand similarbetween twois also theEnglish andconditions,that it wasentitled tothemselves.quantity ofransparencythe same asto join thecountry andthis is theThis led toa statementcontrast tolastIndexOfthrough hisis designedthe term isis providedprotect theng</a></li>The currentthe site ofsubstantialexperience,in the Westthey shouldslovenčinacomentariosuniversidadcondicionesactividadesexperienciatecnologíaproducciónpuntuaciónaplicacióncontraseñacategoríasregistrarseprofesionaltratamientoregístratesecretaríaprincipalesprotecciónimportantesimportanciaposibilidadinteresantecrecimientonecesidadessuscribirseasociacióndisponiblesevaluaciónestudiantesresponsableresoluciónguadalajararegistradosoportunidadcomercialesfotografíaautoridadesingenieríatelevisióncompetenciaoperacionesestablecidosimplementeactualmentenavegaciónconformidadline-height:font-family:" : "http://applicationslink" href="specifically//<![CDATA[
239
-
Organizationdistribution0px; height:relationshipdevice-width<div class="<label for="registration</noscript>
240
-
/index.html"window.open( !important;application/independence//www.googleorganizationautocompleterequirementsconservative<form name="intellectualmargin-left:18th centuryan importantinstitutionsabbreviation<img class="organisationcivilization19th centuryarchitectureincorporated20th century-container">most notably/></a></div>notification'undefined')Furthermore,believe thatinnerHTML = prior to thedramaticallyreferring tonegotiationsheadquartersSouth AfricaunsuccessfulPennsylvaniaAs a result,<html lang="</sup>dealing withphiladelphiahistorically);</script>
241
-
padding-top:experimentalgetAttributeinstructionstechnologiespart of the =function(){subscriptionl.dtd">
242
-
<htgeographicalConstitution', function(supported byagriculturalconstructionpublicationsfont-size: 1a variety of<div style="Encyclopediaiframe src="demonstratedaccomplisheduniversitiesDemographics);</script><dedicated toknowledge ofsatisfactionparticularly</div></div>English (US)appendChild(transmissions. However, intelligence" tabindex="float:right;Commonwealthranging fromin which theat least onereproductionencyclopedia;font-size:1jurisdictionat that time"><a class="In addition,description+conversationcontact withis generallyr" content="representing<math>presentationoccasionally<img width="navigation">compensationchampionshipmedia="all" violation ofreference toreturn true;Strict//EN" transactionsinterventionverificationInformation difficultiesChampionshipcapabilities<![endif]-->}
243
-
</script>
244
-
Christianityfor example,Professionalrestrictionssuggest thatwas released(such as theremoveClass(unemploymentthe Americanstructure of/index.html published inspan class=""><a href="/introductionbelonging toclaimed thatconsequences<meta name="Guide to theoverwhelmingagainst the concentrated,
245
-
.nontouch observations</a>
246
-
</div>
247
-
f (document.border: 1px {font-size:1treatment of0" height="1modificationIndependencedivided intogreater thanachievementsestablishingJavaScript" neverthelesssignificanceBroadcasting> </td>container">
248
-
such as the influence ofa particularsrc='http://navigation" half of the substantial </div>advantage ofdiscovery offundamental metropolitanthe opposite" xml:lang="deliberatelyalign=centerevolution ofpreservationimprovementsbeginning inJesus ChristPublicationsdisagreementtext-align:r, function()similaritiesbody></html>is currentlyalphabeticalis sometimestype="image/many of the flow:hidden;available indescribe theexistence ofall over thethe Internet <ul class="installationneighborhoodarmed forcesreducing thecontinues toNonetheless,temperatures
249
-
<a href="close to theexamples of is about the(see below)." id="searchprofessionalis availablethe official </script>
250
-
251
-
<div id="accelerationthrough the Hall of Famedescriptionstranslationsinterference type='text/recent yearsin the worldvery popular{background:traditional some of the connected toexploitationemergence ofconstitutionA History ofsignificant manufacturedexpectations><noscript><can be foundbecause the has not beenneighbouringwithout the added to the <li class="instrumentalSoviet Unionacknowledgedwhich can bename for theattention toattempts to developmentsIn fact, the<li class="aimplicationssuitable formuch of the colonizationpresidentialcancelBubble Informationmost of the is describedrest of the more or lessin SeptemberIntelligencesrc="http://px; height: available tomanufacturerhuman rightslink href="/availabilityproportionaloutside the astronomicalhuman beingsname of the are found inare based onsmaller thana person whoexpansion ofarguing thatnow known asIn the earlyintermediatederived fromScandinavian</a></div>
252
-
consider thean estimatedthe National<div id="pagresulting incommissionedanalogous toare required/ul>
253
-
</div>
254
-
was based onand became a t" value="" was capturedno more thanrespectivelycontinue to >
255
-
<head>
256
-
<were createdmore generalinformation used for theindependent the Imperialcomponent ofto the northinclude the Constructionside of the would not befor instanceinvention ofmore complexcollectivelybackground: text-align: its originalinto accountthis processan extensivehowever, thethey are notrejected thecriticism ofduring whichprobably thethis article(function(){It should bean agreementaccidentallydiffers fromArchitecturebetter knownarrangementsinfluence onattended theidentical tosouth of thepass throughxml" title="weight:bold;creating thedisplay:nonereplaced the<img src="/ihttps://www.World War IItestimonialsfound in therequired to and that thebetween the was designedconsists of considerablypublished bythe languageConservationconsisted ofrefer to theback to the css" media="People from available onproved to besuggestions"was known asvarieties oflikely to becomprised ofsupport the hands of thecoupled withconnect and border:none;performancesbefore beinglater becamecalculationsoften calledresidents ofmeaning that><li class="evidence forexplanationsenvironments"></a></div>which allowsIntroductiondeveloped bya wide rangeon behalf ofvalign="top"principle ofat the time,</noscript>
said to havein the firstwhile othershypotheticalphilosopherspower of thecontained inperformed byinability towere writtenspan style="input name="the questionintended forrejection ofimplies thatinvented thethe standardwas probablylink betweenprofessor ofinteractionschanging theIndian Ocean class="lastworking with'http://www.years beforeThis was therecreationalentering themeasurementsan extremelyvalue of thestart of the
257
-
</script>
258
-
259
-
an effort toincrease theto the southspacing="0">sufficientlythe Europeanconverted toclearTimeoutdid not haveconsequentlyfor the nextextension ofeconomic andalthough theare producedand with theinsufficientgiven by thestating thatexpenditures</span></a>
260
-
thought thaton the basiscellpadding=image of thereturning toinformation,separated byassassinateds" content="authority ofnorthwestern</div>
261
-
<div "></div>
262
-
consultationcommunity ofthe nationalit should beparticipants align="leftthe greatestselection ofsupernaturaldependent onis mentionedallowing thewas inventedaccompanyinghis personalavailable atstudy of theon the otherexecution ofHuman Rightsterms of theassociationsresearch andsucceeded bydefeated theand from thebut they arecommander ofstate of theyears of agethe study of<ul class="splace in thewhere he was<li class="fthere are nowhich becamehe publishedexpressed into which thecommissionerfont-weight:territory ofextensions">Roman Empireequal to theIn contrast,however, andis typicallyand his wife(also called><ul class="effectively evolved intoseem to havewhich is thethere was noan excellentall of thesedescribed byIn practice,broadcastingcharged withreflected insubjected tomilitary andto the pointeconomicallysetTargetingare actuallyvictory over();</script>continuouslyrequired forevolutionaryan effectivenorth of the, which was front of theor otherwisesome form ofhad not beengenerated byinformation.permitted toincludes thedevelopment,entered intothe previousconsistentlyare known asthe field ofthis type ofgiven to thethe title ofcontains theinstances ofin the northdue to theirare designedcorporationswas that theone of thesemore popularsucceeded insupport fromin differentdominated bydesigned forownership ofand possiblystandardizedresponseTextwas intendedreceived theassumed thatareas of theprimarily inthe basis ofin the senseaccounts fordestroyed byat least twowas declaredcould not beSecretary ofappear to bemargin-top:1/^\s+|\s+$/ge){throw e};the start oftwo separatelanguage andwho had beenoperation ofdeath of thereal numbers <link rel="provided thethe story ofcompetitionsenglish (UK)english (US)МонголСрпскисрпскисрпскоلعربية正體中文简体中文繁体中文有限公司人民政府阿里巴巴社会主义操作系统政策法规informaciónherramientaselectrónicodescripciónclasificadosconocimientopublicaciónrelacionadasinformáticarelacionadosdepartamentotrabajadoresdirectamenteayuntamientomercadoLibrecontáctenoshabitacionescumplimientorestaurantesdisposiciónconsecuenciaelectrónicaaplicacionesdesconectadoinstalaciónrealizaciónutilizaciónenciclopediaenfermedadesinstrumentosexperienciasinstituciónparticularessubcategoriaтолькоРоссииработыбольшепростоможетедругихслучаесейчасвсегдаРоссияМоскведругиегородавопросданныхдолжныименноМосквырублейМосквастраныничегоработедолженуслугитеперьОднакопотомуработуапрелявообщеодногосвоегостатьидругойфорумехорошопротивссылкакаждыйвластигруппывместеработасказалпервыйделатьденьгипериодбизнесосновемоменткупитьдолжнарамкахначалоРаботаТолькосовсемвторойначаласписокслужбысистемпечатиновогопомощисайтовпочемупомощьдолжноссылкибыстроданныемногиепроектСейчасмоделитакогоонлайнгородеверсиястранефильмыуровняразныхискатьнеделюянваряменьшемногихданнойзначитнельзяфорумаТеперьмесяцазащитыЛучшиеनहींकरनेअपनेकियाकरेंअन्यक्यागाइडबारेकिसीदियापहलेसिंहभारतअपनीवालेसेवाकरतेमेरेहोनेसकतेबहुतसाइटहोगाजानेमिनटकरताकरनाउनकेयहाँसबसेभाषाआपकेलियेशुरूइसकेघंटेमेरीसकतामेरालेकरअधिकअपनासमाजमुझेकारणहोताकड़ीयहांहोटलशब्दलियाजीवनजाताकैसेआपकावालीदेनेपूरीपानीउसकेहोगीबैठकआपकीवर्षगांवआपकोजिलाजानासहमतहमेंउनकीयाहूदर्जसूचीपसंदसवालहोनाहोतीजैसेवापसजनतानेताजारीघायलजिलेनीचेजांचपत्रगूगलजातेबाहरआपनेवाहनइसकासुबहरहनेइससेसहितबड़ेघटनातलाशपांचश्रीबड़ीहोतेसाईटशायदसकतीजातीवालाहजारपटनारखनेसड़कमिलाउसकीकेवललगताखानाअर्थजहांदेखापहलीनियमबिनाबैंककहींकहनादेताहमलेकाफीजबकितुरतमांगवहींरोज़मिलीआरोपसेनायादवलेनेखाताकरीबउनकाजवाबपूराबड़ासौदाशेयरकियेकहांअकसरबनाएवहांस्थलमिलेलेखकविषयक्रंसमूहथानाتستطيعمشاركةبواسطةالصفحةمواضيعالخاصةالمزيدالعامةالكاتبالردودبرنامجالدولةالعالمالموقعالعربيالسريعالجوالالذهابالحياةالحقوقالكريمالعراقمحفوظةالثانيمشاهدةالمرأةالقرآنالشبابالحوارالجديدالأسرةالعلوممجموعةالرحمنالنقاطفلسطينالكويتالدنيابركاتهالرياضتحياتيبتوقيتالأولىالبريدالكلامالرابطالشخصيسياراتالثالثالصلاةالحديثالزوارالخليجالجميعالعامهالجمالالساعةمشاهدهالرئيسالدخولالفنيةالكتابالدوريالدروساستغرقتصاميمالبناتالعظيمentertainmentunderstanding = function().jpg" width="configuration.png" width="<body class="Math.random()contemporary United Statescircumstances.appendChild(organizations<span class=""><img src="/distinguishedthousands of communicationclear"></div>investigationfavicon.ico" margin-right:based on the Massachusettstable border=internationalalso known aspronunciationbackground:#fpadding-left:For example, miscellaneous</math>psychologicalin particularearch" type="form method="as opposed toSupreme Courtoccasionally Additionally,North Americapx;backgroundopportunitiesEntertainment.toLowerCase(manufacturingprofessional combined withFor instance,consisting of" maxlength="return false;consciousnessMediterraneanextraordinaryassassinationsubsequently button type="the number ofthe original comprehensiverefers to the</ul>
263
-
</div>
264
-
philosophicallocation.hrefwas publishedSan Francisco(function(){
265
-
<div id="mainsophisticatedmathematical /head>
266
-
<bodysuggests thatdocumentationconcentrationrelationshipsmay have been(for example,This article in some casesparts of the definition ofGreat Britain cellpadding=equivalent toplaceholder="; font-size: justificationbelieved thatsuffered fromattempted to leader of thecript" src="/(function() {are available
267
-
<link rel=" src='http://interested inconventional " alt="" /></are generallyhas also beenmost popular correspondingcredited withtyle="border:</a></span></.gif" width="<iframe src="table class="inline-block;according to together withapproximatelyparliamentarymore and moredisplay:none;traditionallypredominantly | </span> cellspacing=<input name="or" content="controversialproperty="og:/x-shockwave-demonstrationsurrounded byNevertheless,was the firstconsiderable Although the collaborationshould not beproportion of<span style="known as the shortly afterfor instance,described as /head>
268
-
<body starting withincreasingly the fact thatdiscussion ofmiddle of thean individualdifficult to point of viewhomosexualityacceptance of</span></div>manufacturersorigin of thecommonly usedimportance ofdenominationsbackground: #length of thedeterminationa significant" border="0">revolutionaryprinciples ofis consideredwas developedIndo-Europeanvulnerable toproponents ofare sometimescloser to theNew York City name="searchattributed tocourse of themathematicianby the end ofat the end of" border="0" technological.removeClass(branch of theevidence that![endif]-->
269
-
Institute of into a singlerespectively.and thereforeproperties ofis located insome of whichThere is alsocontinued to appearance of &ndash; describes theconsiderationauthor of theindependentlyequipped withdoes not have</a><a href="confused with<link href="/at the age ofappear in theThese includeregardless ofcould be used style="several timesrepresent thebody>
270
-
</html>thought to bepopulation ofpossibilitiespercentage ofaccess to thean attempt toproduction ofjquery/jquerytwo differentbelong to theestablishmentreplacing thedescription" determine theavailable forAccording to wide range of <div class="more commonlyorganisationsfunctionalitywas completed &mdash; participationthe characteran additionalappears to befact that thean example ofsignificantlyonmouseover="because they async = true;problems withseems to havethe result of src="http://familiar withpossession offunction () {took place inand sometimessubstantially<span></span>is often usedin an attemptgreat deal ofEnvironmentalsuccessfully virtually all20th century,professionalsnecessary to determined bycompatibilitybecause it isDictionary ofmodificationsThe followingmay refer to:Consequently,Internationalalthough somethat would beworld's firstclassified asbottom of the(particularlyalign="left" most commonlybasis for thefoundation ofcontributionspopularity ofcenter of theto reduce thejurisdictionsapproximation onmouseout="New Testamentcollection of</span></a></in the Unitedfilm director-strict.dtd">has been usedreturn to thealthough thischange in theseveral otherbut there areunprecedentedis similar toespecially inweight: bold;is called thecomputationalindicate thatrestricted to <meta name="are typicallyconflict withHowever, the An example ofcompared withquantities ofrather than aconstellationnecessary forreported thatspecificationpolitical and <references tothe same yearGovernment ofgeneration ofhave not beenseveral yearscommitment to <ul class="visualization19th century,practitionersthat he wouldand continuedoccupation ofis defined ascentre of thethe amount of><div style="equivalent ofdifferentiatebrought aboutmargin-left: automaticallythought of asSome of these
271
-
<div class="input class="replaced withis one of theeducation andinfluenced byreputation as
272
-
<meta name="accommodation</div>
273
-
</div>large part ofInstitute forthe so-called against the In this case,was appointedclaimed to beHowever, thisDepartment ofthe remainingeffect on theparticularly deal with the
274
-
<div style="almost alwaysare currentlyexpression ofphilosophy offor more thancivilizationson the islandselectedIndexcan result in" value="" />the structure /></a></div>Many of thesecaused by theof the Unitedspan class="mcan be tracedis related tobecame one ofis frequentlyliving in thetheoreticallyFollowing theRevolutionarygovernment inis determinedthe politicalintroduced insufficient todescription">short storiesseparation ofas to whetherknown for itswas initiallydisplay:blockis an examplethe principalconsists of arecognized as/body></html>a substantialreconstructedhead of stateresistance toundergraduateThere are twogravitationalare describedintentionallyserved as theclass="headeropposition tofundamentallydominated theand the otheralliance withwas forced torespectively,and politicalin support ofpeople in the20th century.and publishedloadChartbeatto understandmember statesenvironmentalfirst half ofcountries andarchitecturalbe consideredcharacterizedclearIntervalauthoritativeFederation ofwas succeededand there area consequencethe Presidentalso includedfree softwaresuccession ofdeveloped thewas destroyedaway from the;
275
-
</script>
276
-
<although theyfollowed by amore powerfulresulted in aUniversity ofHowever, manythe presidentHowever, someis thought tountil the endwas announcedare importantalso includes><input type=the center of DO NOT ALTERused to referthemes/?sort=that had beenthe basis forhas developedin the summercomparativelydescribed thesuch as thosethe resultingis impossiblevarious otherSouth Africanhave the sameeffectivenessin which case; text-align:structure and; background:regarding thesupported theis also knownstyle="marginincluding thebahasa Melayunorsk bokmålnorsk nynorskslovenščinainternacionalcalificacióncomunicaciónconstrucción"><div class="disambiguationDomainName', 'administrationsimultaneouslytransportationInternational margin-bottom:responsibility<![endif]-->
277
-
</><meta name="implementationinfrastructurerepresentationborder-bottom:</head>
278
-
<body>=http%3A%2F%2F<form method="method="post" /favicon.ico" });
279
-
</script>
280
-
.setAttribute(Administration= new Array();<![endif]-->
281
-
display:block;Unfortunately,"> </div>/favicon.ico">='stylesheet' identification, for example,<li><a href="/an alternativeas a result ofpt"></script>
282
-
type="submit"
283
-
(function() {recommendationform action="/transformationreconstruction.style.display According to hidden" name="along with thedocument.body.approximately Communicationspost" action="meaning "--<![endif]-->Prime Ministercharacteristic</a> <a class=the history of onmouseover="the governmenthref="https://was originallywas introducedclassificationrepresentativeare considered<![endif]-->
284
-
285
-
depends on theUniversity of in contrast to placeholder="in the case ofinternational constitutionalstyle="border-: function() {Because of the-strict.dtd">
286
-
<table class="accompanied byaccount of the<script src="/nature of the the people in in addition tos); js.id = id" width="100%"regarding the Roman Catholican independentfollowing the .gif" width="1the following discriminationarchaeologicalprime minister.js"></script>combination of marginwidth="createElement(w.attachEvent(</a></td></tr>src="https://aIn particular, align="left" Czech RepublicUnited Kingdomcorrespondenceconcluded that.html" title="(function () {comes from theapplication of<span class="sbelieved to beement('script'</a>
287
-
</li>
288
-
<livery different><span class="option value="(also known as <li><a href="><input name="separated fromreferred to as valign="top">founder of theattempting to carbon dioxide
289
-
290
-
<div class="class="search-/body>
291
-
</html>opportunity tocommunications</head>
292
-
<body style="width:Tiếng Việtchanges in theborder-color:#0" border="0" </span></div><was discovered" type="text" );
293
-
</script>
294
-
295
-
Department of ecclesiasticalthere has beenresulting from</body></html>has never beenthe first timein response toautomatically </div>
296
-
297
-
<div iwas consideredpercent of the" /></a></div>collection of descended fromsection of theaccept-charsetto be confusedmember of the padding-right:translation ofinterpretation href='http://whether or notThere are alsothere are manya small numberother parts ofimpossible to class="buttonlocated in the. However, theand eventuallyAt the end of because of itsrepresents the<form action=" method="post"it is possiblemore likely toan increase inhave also beencorresponds toannounced thatalign="right">many countriesfor many yearsearliest knownbecause it waspt"></script>
valign="top" inhabitants offollowing year
298
-
<div class="million peoplecontroversial concerning theargue that thegovernment anda reference totransferred todescribing the style="color:although therebest known forsubmit" name="multiplicationmore than one recognition ofCouncil of theedition of the <meta name="Entertainment away from the ;margin-right:at the time ofinvestigationsconnected withand many otheralthough it isbeginning with <span class="descendants of<span class="i align="right"</head>
299
-
<body aspects of thehas since beenEuropean Unionreminiscent ofmore difficultVice Presidentcomposition ofpassed throughmore importantfont-size:11pxexplanation ofthe concept ofwritten in the <span class="is one of the resemblance toon the groundswhich containsincluding the defined by thepublication ofmeans that theoutside of thesupport of the<input class="<span class="t(Math.random()most prominentdescription ofConstantinoplewere published<div class="seappears in the1" height="1" most importantwhich includeswhich had beendestruction ofthe population
300
-
<div class="possibility ofsometimes usedappear to havesuccess of theintended to bepresent in thestyle="clear:b
301
-
</script>
302
-
<was founded ininterview with_id" content="capital of the
303
-
<link rel="srelease of thepoint out thatxMLHttpRequestand subsequentsecond largestvery importantspecificationssurface of theapplied to theforeign policy_setDomainNameestablished inis believed toIn addition tomeaning of theis named afterto protect theis representedDeclaration ofmore efficientClassificationother forms ofhe returned to<span class="cperformance of(function() {
if and only ifregions of theleading to therelations withUnited Nationsstyle="height:other than theype" content="Association of
304
-
</head>
305
-
<bodylocated on theis referred to(including theconcentrationsthe individualamong the mostthan any other/>
306
-
<link rel=" return false;the purpose ofthe ability to;color:#fff}
307
-
.
308
-
<span class="the subject ofdefinitions of>
309
-
<link rel="claim that thehave developed<table width="celebration ofFollowing the to distinguish<span class="btakes place inunder the namenoted that the><![endif]-->
310
-
style="margin-instead of theintroduced thethe process ofincreasing thedifferences inestimated thatespecially the/div><div id="was eventuallythroughout histhe differencesomething thatspan></span></significantly ></script>
311
-
312
-
environmental to prevent thehave been usedespecially forunderstand theis essentiallywere the firstis the largesthave been made" src="http://interpreted assecond half ofcrolling="no" is composed ofII, Holy Romanis expected tohave their owndefined as thetraditionally have differentare often usedto ensure thatagreement withcontaining theare frequentlyinformation onexample is theresulting in a</a></li></ul> class="footerand especiallytype="button" </span></span>which included>
313
-
<meta name="considered thecarried out byHowever, it isbecame part ofin relation topopular in thethe capital ofwas officiallywhich has beenthe History ofalternative todifferent fromto support thesuggested thatin the process <div class="the foundationbecause of hisconcerned withthe universityopposed to thethe context of<span class="ptext" name="q" <div class="the scientificrepresented bymathematicianselected by thethat have been><div class="cdiv id="headerin particular,converted into);
314
-
</script>
315
-
<philosophical srpskohrvatskitiếng ViệtРусскийрусскийinvestigaciónparticipaciónкоторыеобластикоторыйчеловексистемыНовостикоторыхобластьвременикотораясегодняскачатьновостиУкраинывопросыкоторойсделатьпомощьюсредствобразомстороныучастиетечениеГлавнаяисториисистемарешенияСкачатьпоэтомуследуетсказатьтоваровконечнорешениекотороеоргановкоторомРекламаالمنتدىمنتدياتالموضوعالبرامجالمواقعالرسائلمشاركاتالأعضاءالرياضةالتصميمالاعضاءالنتائجالألعابالتسجيلالأقسامالضغطاتالفيديوالترحيبالجديدةالتعليمالأخبارالافلامالأفلامالتاريخالتقنيةالالعابالخواطرالمجتمعالديكورالسياحةعبداللهالتربيةالروابطالأدبيةالاخبارالمتحدةالاغانيcursor:pointer;</title>
316
-
<meta " href="http://"><span class="members of the window.locationvertical-align:/a> | <a href="<!doctype html>media="screen" <option value="favicon.ico" />
317
-
<div class="characteristics" method="get" /body>
318
-
</html>
319
-
shortcut icon" document.write(padding-bottom:representativessubmit" value="align="center" throughout the science fiction
320
-
<div class="submit" class="one of the most valign="top"><was established);
321
-
</script>
322
-
return false;">).style.displaybecause of the document.cookie<form action="/}body{margin:0;Encyclopedia ofversion of the .createElement(name" content="</div>
323
-
</div>
324
-
325
-
administrative </body>
326
-
</html>history of the "><input type="portion of the as part of the <a href="other countries">
327
-
<div class="</span></span><In other words,display: block;control of the introduction of/>
328
-
<meta name="as well as the in recent years
329
-
<div class="</div>
330
-
</div>
331
-
inspired by thethe end of the compatible withbecame known as style="margin:.js"></script>< International there have beenGerman language style="color:#Communist Partyconsistent withborder="0" cell marginheight="the majority of" align="centerrelated to the many different Orthodox Churchsimilar to the />
332
-
<link rel="swas one of the until his death})();
333
-
</script>other languagescompared to theportions of thethe Netherlandsthe most commonbackground:url(argued that thescrolling="no" included in theNorth American the name of theinterpretationsthe traditionaldevelopment of frequently useda collection ofvery similar tosurrounding theexample of thisalign="center">would have beenimage_caption =attached to thesuggesting thatin the form of involved in theis derived fromnamed after theIntroduction torestrictions on style="width: can be used to the creation ofmost important information andresulted in thecollapse of theThis means thatelements of thewas replaced byanalysis of theinspiration forregarded as themost successfulknown as "a comprehensiveHistory of the were consideredreturned to theare referred toUnsourced image>
334
-
<div class="consists of thestopPropagationinterest in theavailability ofappears to haveelectromagneticenableServices(function of theIt is important</script></div>function(){var relative to theas a result of the position ofFor example, in method="post" was followed by&mdash; thethe applicationjs"></script>
335
-
ul></div></div>after the deathwith respect tostyle="padding:is particularlydisplay:inline; type="submit" is divided into中文 (简体)responsabilidadadministracióninternacionalescorrespondienteउपयोगपूर्वहमारेलोगोंचुनावलेकिनसरकारपुलिसखोजेंचाहिएभेजेंशामिलहमारीजागरणबनानेकुमारब्लॉगमालिकमहिलापृष्ठबढ़तेभाजपाक्लिकट्रेनखिलाफदौरानमामलेमतदानबाजारविकासक्योंचाहतेपहुँचबतायासंवाददेखनेपिछलेविशेषराज्यउत्तरमुंबईदोनोंउपकरणपढ़ेंस्थितफिल्ममुख्यअच्छाछूटतीसंगीतजाएगाविभागघण्टेदूसरेदिनोंहत्यासेक्सगांधीविश्वरातेंदैट्सनक्शासामनेअदालतबिजलीपुरूषहिंदीमित्रकवितारुपयेस्थानकरोड़मुक्तयोजनाकृपयापोस्टघरेलूकार्यविचारसूचनामूल्यदेखेंहमेशास्कूलमैंनेतैयारजिसकेrss+xml" title="-type" content="title" content="at the same time.js"></script>
336
-
<" method="post" </span></a></li>vertical-align:t/jquery.min.js">.click(function( style="padding-})();
337
-
</script>
338
-
</span><a href="<a href="http://); return false;text-decoration: scrolling="no" border-collapse:associated with Bahasa IndonesiaEnglish language<text xml:space=.gif" border="0"</body>
339
-
</html>
340
-
overflow:hidden;img src="http://addEventListenerresponsible for s.js"></script>
341
-
/favicon.ico" />operating system" style="width:1target="_blank">State Universitytext-align:left;
342
-
document.write(, including the around the world);
343
-
</script>
344
-
<" style="height:;overflow:hiddenmore informationan internationala member of the one of the firstcan be found in </div>
345
-
</div>
346
-
display: none;">" />
347
-
<link rel="
348
-
(function() {the 15th century.preventDefault(large number of Byzantine Empire.jpg|thumb|left|vast majority ofmajority of the align="center">University Pressdominated by theSecond World Wardistribution of style="position:the rest of the characterized by rel="nofollow">derives from therather than the a combination ofstyle="width:100English-speakingcomputer scienceborder="0" alt="the existence ofDemocratic Party" style="margin-For this reason,.js"></script>
349
-
sByTagName(s)[0]js"></script>
350
-
<.js"></script>
351
-
link rel="icon" ' alt='' class='formation of theversions of the </a></div></div>/page>
352
-
<page>
353
-
<div class="contbecame the firstbahasa Indonesiaenglish (simple)ΕλληνικάхрватскикомпанииявляетсяДобавитьчеловекаразвитияИнтернетОтветитьнапримеринтернеткоторогостраницыкачествеусловияхпроблемыполучитьявляютсянаиболеекомпаниявниманиесредстваالمواضيعالرئيسيةالانتقالمشاركاتكالسياراتالمكتوبةالسعوديةاحصائياتالعالميةالصوتياتالانترنتالتصاميمالإسلاميالمشاركةالمرئياتrobots" content="<div id="footer">the United States<img src="http://.jpg|right|thumb|.js"></script>
354
-
<location.protocolframeborder="0" s" />
355
-
<meta name="</a></div></div><font-weight:bold;" and "depending on the margin:0;padding:" rel="nofollow" President of the twentieth centuryevision>
356
-
</pageInternet Explorera.async = true;
357
-
information about<div id="header">" action="http://<a href="https://<div id="content"</div>
358
-
</div>
359
-
<derived from the <img src='http://according to the
360
-
</body>
361
-
</html>
362
-
style="font-size:script language="Arial, Helvetica,</a><span class="</script><script political partiestd></tr></table><href="http://www.interpretation ofrel="stylesheet" document.write('<charset="utf-8">
363
-
beginning of the revealed that thetelevision series" rel="nofollow"> target="_blank">claiming that thehttp%3A%2F%2Fwww.manifestations ofPrime Minister ofinfluenced by theclass="clearfix">/div>
364
-
</div>
365
-
366
-
three-dimensionalChurch of Englandof North Carolinasquare kilometres.addEventListenerdistinct from thecommonly known asPhonetic Alphabetdeclared that thecontrolled by theBenjamin Franklinrole-playing gamethe University ofin Western Europepersonal computerProject Gutenbergregardless of thehas been proposedtogether with the></li><li class="in some countriesmin.js"></script>of the populationofficial language<img src="images/identified by thenatural resourcesclassification ofcan be consideredquantum mechanicsNevertheless, themillion years ago</body>
367
-
</html>
Ελληνικά
368
-
take advantage ofand, according toattributed to theMicrosoft Windowsthe first centuryunder the controldiv class="headershortly after thenotable exceptiontens of thousandsseveral differentaround the world.reaching militaryisolated from theopposition to thethe Old TestamentAfrican Americansinserted into theseparate from themetropolitan areamakes it possibleacknowledged thatarguably the mosttype="text/css">
369
-
the InternationalAccording to the pe="text/css" />
370
-
coincide with thetwo-thirds of theDuring this time,during the periodannounced that hethe internationaland more recentlybelieved that theconsciousness andformerly known assurrounded by thefirst appeared inoccasionally usedposition:absolute;" target="_blank" position:relative;text-align:center;jax/libs/jquery/1.background-color:#type="application/anguage" content="<meta http-equiv="Privacy Policy</a>e("%3Cscript src='" target="_blank">On the other hand,.jpg|thumb|right|2</div><div class="<div style="float:nineteenth century</body>
371
-
</html>
372
-
<img src="http://s;text-align:centerfont-weight: bold; According to the difference between" frameborder="0" " style="position:link href="http://html4/loose.dtd">
373
-
during this period</td></tr></table>closely related tofor the first time;font-weight:bold;input type="text" <span style="font-onreadystatechange <div class="cleardocument.location. For example, the a wide variety of <!DOCTYPE html>
374
-
< "><a href="http://style="float:left;concerned with the=http%3A%2F%2Fwww.in popular culturetype="text/css" />it is possible to Harvard Universitytylesheet" href="/the main characterOxford University name="keywords" cstyle="text-align:the United Kingdomfederal government<div style="margin depending on the description of the<div class="header.min.js"></script>destruction of theslightly differentin accordance withtelecommunicationsindicates that theshortly thereafterespecially in the European countriesHowever, there aresrc="http://staticsuggested that the" src="http://www.a large number of Telecommunications" rel="nofollow" tHoly Roman Emperoralmost exclusively" border="0" alt="Secretary of Stateculminating in theCIA World Factbookthe most importantanniversary of thestyle="background-<li><em><a href="/the Atlantic Oceanstrictly speaking,shortly before thedifferent types ofthe Ottoman Empire><img src="http://An Introduction toconsequence of thedeparture from theConfederate Statesindigenous peoplesProceedings of theinformation on thetheories have beeninvolvement in thedivided into threeadjacent countriesis responsible fordissolution of thecollaboration withwidely regarded ashis contemporariesfounding member ofDominican Republicgenerally acceptedthe possibility ofare also availableunder constructionrestoration of thethe general publicis almost entirelypasses through thehas been suggestedcomputer and videoGermanic languages according to the different from theshortly afterwardshref="https://www.recent developmentBoard of Directors<div class="search| <a href="http://In particular, theMultiple footnotesor other substancethousands of yearstranslation of the</div>
375
-
</div>
376
-
377
-
<a href="index.phpwas established inmin.js"></script>
378
-
participate in thea strong influencestyle="margin-top:represented by thegraduated from theTraditionally, theElement("script");However, since the/div>
379
-
</div>
380
-
<div left; margin-left:protection against0; vertical-align:Unfortunately, thetype="image/x-icon/div>
381
-
<div class=" class="clearfix"><div class="footer </div>
382
-
</div>
383
-
the motion pictureБългарскибългарскиФедерациинесколькосообщениесообщенияпрограммыОтправитьбесплатноматериалыпозволяетпоследниеразличныхпродукциипрограммаполностьюнаходитсяизбранноенаселенияизменениякатегорииАлександрद्वारामैनुअलप्रदानभारतीयअनुदेशहिन्दीइंडियादिल्लीअधिकारवीडियोचिट्ठेसमाचारजंक्शनदुनियाप्रयोगअनुसारऑनलाइनपार्टीशर्तोंलोकसभाफ़्लैशशर्तेंप्रदेशप्लेयरकेंद्रस्थितिउत्पादउन्हेंचिट्ठायात्राज्यादापुरानेजोड़ेंअनुवादश्रेणीशिक्षासरकारीसंग्रहपरिणामब्रांडबच्चोंउपलब्धमंत्रीसंपर्कउम्मीदमाध्यमसहायताशब्दोंमीडियाआईपीएलमोबाइलसंख्याआपरेशनअनुबंधबाज़ारनवीनतमप्रमुखप्रश्नपरिवारनुकसानसमर्थनआयोजितसोमवारالمشاركاتالمنتدياتالكمبيوترالمشاهداتعددالزوارعددالردودالإسلاميةالفوتوشوبالمسابقاتالمعلوماتالمسلسلاتالجرافيكسالاسلاميةالاتصالاتkeywords" content="w3.org/1999/xhtml"><a target="_blank" text/html; charset=" target="_blank"><table cellpadding="autocomplete="off" text-align: center;to last version by background-color: #" href="http://www./div></div><div id=<a href="#" class=""><img src="http://cript" src="http://
384
-
<script language="//EN" "http://www.wencodeURIComponent(" href="javascript:<div class="contentdocument.write('<scposition: absolute;script src="http:// style="margin-top:.min.js"></script>
385
-
</div>
386
-
<div class="w3.org/1999/xhtml"
387
-
388
-
</body>
389
-
</html>distinction between/" target="_blank"><link href="http://encoding="utf-8"?>
390
-
w.addEventListener?action="http://www.icon" href="http:// style="background:type="text/css" />
391
-
meta property="og:t<input type="text" style="text-align:the development of tylesheet" type="tehtml; charset=utf-8is considered to betable width="100%" In addition to the contributed to the differences betweendevelopment of the It is important to </script>
392
-
393
-
<script style="font-size:1></span><span id=gbLibrary of Congress<img src="http://imEnglish translationAcademy of Sciencesdiv style="display:construction of the.getElementById(id)in conjunction withElement('script'); <meta property="og:Български
394
-
type="text" name=">Privacy Policy</a>administered by theenableSingleRequeststyle="margin:</div></div></div><><img src="http://i style="float:referred to as the total population ofin Washington, D.C. style="background-among other things,organization of theparticipated in thethe introduction ofidentified with thefictional character Oxford University misunderstanding ofThere are, however,stylesheet" href="/Columbia Universityexpanded to includeusually referred toindicating that thehave suggested thataffiliated with thecorrelation betweennumber of different></td></tr></table>Republic of Ireland
395
-
</script>
396
-
<script under the influencecontribution to theOfficial website ofheadquarters of thecentered around theimplications of thehave been developedFederal Republic ofbecame increasinglycontinuation of theNote, however, thatsimilar to that of capabilities of theaccordance with theparticipants in thefurther developmentunder the directionis often consideredhis younger brother</td></tr></table><a http-equiv="X-UA-physical propertiesof British Columbiahas been criticized(with the exceptionquestions about thepassing through the0" cellpadding="0" thousands of peopleredirects here. Forhave children under%3E%3C/script%3E"));<a href="http://www.<li><a href="http://site_name" content="text-decoration:nonestyle="display: none<meta http-equiv="X-new Date().getTime() type="image/x-icon"</span><span class="language="javascriptwindow.location.href<a href="javascript:-->
397
-
<script type="t<a href='http://www.hortcut icon" href="</div>
398
-
<div class="<script src="http://" rel="stylesheet" t</div>
399
-
<script type=/a> <a href="http:// allowTransparency="X-UA-Compatible" conrelationship between
400
-
</script>
401
-
<script </a></li></ul></div>associated with the programming language</a><a href="http://</a></li><li class="form action="http://<div style="display:type="text" name="q"<table width="100%" background-position:" border="0" width="rel="shortcut icon" h6><ul><li><a href=" <meta http-equiv="css" media="screen" responsible for the " type="application/" style="background-html; charset=utf-8" allowtransparency="stylesheet" type="te
402
-
<meta http-equiv="></span><span class="0" cellspacing="0">;
403
-
</script>
404
-
<script sometimes called thedoes not necessarilyFor more informationat the beginning of <!DOCTYPE html><htmlparticularly in the type="hidden" name="javascript:void(0);"effectiveness of the autocomplete="off" generally considered><input type="text" "></script>
405
-
<scriptthroughout the worldcommon misconceptionassociation with the</div>
406
-
</div>
407
-
<div cduring his lifetime,corresponding to thetype="image/x-icon" an increasing numberdiplomatic relationsare often consideredmeta charset="utf-8" <input type="text" examples include the"><img src="http://iparticipation in thethe establishment of
408
-
</div>
409
-
<div class="&nbsp;&nbsp;to determine whetherquite different frommarked the beginningdistance between thecontributions to theconflict between thewidely considered towas one of the firstwith varying degreeshave speculated that(document.getElementparticipating in theoriginally developedeta charset="utf-8"> type="text/css" />
410
-
interchangeably withmore closely relatedsocial and politicalthat would otherwiseperpendicular to thestyle type="text/csstype="submit" name="families residing indeveloping countriescomputer programmingeconomic developmentdetermination of thefor more informationon several occasionsportuguês (Europeu)УкраїнськаукраїнськаРоссийскойматериаловинформацииуправлениянеобходимоинформацияИнформацияРеспубликиколичествоинформациютерриториидостаточноالمتواجدونالاشتراكاتالاقتراحاتhtml; charset=UTF-8" setTimeout(function()display:inline-block;<input type="submit" type = 'text/javascri<img src="http://www." "http://www.w3.org/shortcut icon" href="" autocomplete="off" </a></div><div class=</a></li>
411
-
<li class="css" type="text/css" <form action="http://xt/css" href="http://link rel="alternate"
412
-
<script type="text/ onclick="javascript:(new Date).getTime()}height="1" width="1" People's Republic of <a href="http://www.text-decoration:underthe beginning of the </div>
413
-
</div>
414
-
</div>
415
-
establishment of the </div></div></div></d#viewport{min-height:
416
-
<script src="http://option><option value=often referred to as /option>
417
-
<option valu<!DOCTYPE html>
418
-
<!--[International Airport>
419
-
<a href="http://www</a><a href="http://wภาษาไทยქართული正體中文 (繁體)निर्देशडाउनलोडक्षेत्रजानकारीसंबंधितस्थापनास्वीकारसंस्करणसामग्रीचिट्ठोंविज्ञानअमेरिकाविभिन्नगाडियाँक्योंकिसुरक्षापहुँचतीप्रबंधनटिप्पणीक्रिकेटप्रारंभप्राप्तमालिकोंरफ़्तारनिर्माणलिमिटेडdescription" content="document.location.prot.getElementsByTagName(<!DOCTYPE html>
420
-
<html <meta charset="utf-8">:url" content="http://.css" rel="stylesheet"style type="text/css">type="text/css" href="w3.org/1999/xhtml" xmltype="text/javascript" method="get" action="link rel="stylesheet" = document.getElementtype="image/x-icon" />cellpadding="0" cellsp.css" type="text/css" </a></li><li><a href="" width="1" height="1""><a href="http://www.style="display:none;">alternate" type="appli-//W3C//DTD XHTML 1.0 ellspacing="0" cellpad type="hidden" value="/a> <span role="s
421
-
<input type="hidden" language="JavaScript" document.getElementsBg="0" cellspacing="0" ype="text/css" media="type='text/javascript'with the exception of ype="text/css" rel="st height="1" width="1" ='+encodeURIComponent(<link rel="alternate"
422
-
body, tr, input, textmeta name="robots" conmethod="post" action=">
423
-
<a href="http://www.css" rel="stylesheet" </div></div><div classlanguage="javascript">aria-hidden="true">·<ript" type="text/javasl=0;})();
424
-
(function(){background-image: url(/a></li><li><a href="h <li><a href="http://ator" aria-hidden="tru> <a href="http://www.language="javascript" /option>
425
-
<option value/div></div><div class=rator" aria-hidden="tre=(new Date).getTime()português (do Brasil)организациивозможностьобразованиярегистрациивозможностиобязательна<!DOCTYPE html PUBLIC "nt-Type" content="text/<meta http-equiv="Conteransitional//EN" "http:<html xmlns="http://www-//W3C//DTD XHTML 1.0 TDTD/xhtml1-transitional//www.w3.org/TR/xhtml1/pe = 'text/javascript';<meta name="descriptionparentNode.insertBefore<input type="hidden" najs" type="text/javascri(document).ready(functiscript type="text/javasimage" content="http://UA-Compatible" content=tml; charset=utf-8" />
426
-
link rel="shortcut icon<link rel="stylesheet" </script>
427
-
<script type== document.createElemen<a target="_blank" href= document.getElementsBinput type="text" name=a.type = 'text/javascrinput type="hidden" namehtml; charset=utf-8" />dtd">
428
-
<html xmlns="http-//W3C//DTD HTML 4.01 TentsByTagName('script')input type="hidden" nam<script type="text/javas" style="display:none;">document.getElementById(=document.createElement(' type='text/javascript'input type="text" name="d.getElementsByTagName(snical" href="http://www.C//DTD HTML 4.01 Transit<style type="text/css">
429
-
430
-
<style type="text/css">ional.dtd">
431
-
<html xmlns=http-equiv="Content-Typeding="0" cellspacing="0"html; charset=utf-8" />
432
-
style="display:none;"><<li><a href="http://www. type='text/javascript'>деятельностисоответствиипроизводствабезопасностиपुस्तिकाकांग्रेसउन्होंनेविधानसभाफिक्सिंगसुरक्षितकॉपीराइटविज्ञापनकार्रवाईसक्रियता
-1
ocaml-brotli/dune
-1
ocaml-brotli/dune
···
1
-
(vendored_dirs vendor)
-21
ocaml-brotli/dune-project
-21
ocaml-brotli/dune-project
···
1
-
(lang dune 3.21)
2
-
(name brotli)
3
-
4
-
(generate_opam_files true)
5
-
6
-
(license ISC)
7
-
(authors "Anil Madhavapeddy <anil@recoil.org>")
8
-
(maintainers "Anil Madhavapeddy <anil@recoil.org>")
9
-
(source (tangled anil.recoil.org/ocaml-brotli))
10
-
11
-
(package
12
-
(name brotli)
13
-
(synopsis "Pure OCaml implementation of Brotli compression")
14
-
(description
15
-
"A pure OCaml implementation of the Brotli compression format (RFC 7932).
16
-
When the optional bytesrw dependency is installed, the brotli.bytesrw
17
-
sublibrary provides streaming-style compression and decompression.")
18
-
(depends
19
-
(ocaml (>= 5.2.0))
20
-
(alcotest (and :with-test (>= 1.7.0))))
21
-
(depopts bytesrw))
-58
ocaml-brotli/gen/gen_tables.ml
-58
ocaml-brotli/gen/gen_tables.ml
···
1
-
(* Generate dictionary.ml from dictionary.bin *)
2
-
3
-
let dictionary_path = "data/dictionary.bin"
4
-
let output_path = "src/dictionary.ml"
5
-
6
-
let read_file path =
7
-
let ic = open_in_bin path in
8
-
let n = in_channel_length ic in
9
-
let data = really_input_string ic n in
10
-
close_in ic;
11
-
data
12
-
13
-
let escape_string s =
14
-
let buf = Buffer.create (String.length s * 4) in
15
-
String.iter (fun c ->
16
-
let code = Char.code c in
17
-
if code >= 32 && code < 127 && c <> '"' && c <> '\\' then
18
-
Buffer.add_char buf c
19
-
else
20
-
Printf.bprintf buf "\\%03d" code
21
-
) s;
22
-
Buffer.contents buf
23
-
24
-
let () =
25
-
let dict_data = read_file dictionary_path in
26
-
let oc = open_out output_path in
27
-
28
-
Printf.fprintf oc "(* Brotli static dictionary - auto-generated from dictionary.bin *)\n\n";
29
-
30
-
Printf.fprintf oc "(* Dictionary size: %d bytes *)\n" (String.length dict_data);
31
-
Printf.fprintf oc "let data = \"%s\"\n\n" (escape_string dict_data);
32
-
33
-
Printf.fprintf oc "(* Word offsets by length (indices 0-24, only 4-24 are valid) *)\n";
34
-
Printf.fprintf oc "let offset_by_length = [|\n";
35
-
Printf.fprintf oc " 0; 0; 0; 0; 0; 4096; 9216; 21504; 35840; 44032;\n";
36
-
Printf.fprintf oc " 53248; 63488; 74752; 87040; 93696; 100864; 104704; 106752; 108928; 113536;\n";
37
-
Printf.fprintf oc " 115968; 118528; 119872; 121280; 122016\n";
38
-
Printf.fprintf oc "|]\n\n";
39
-
40
-
Printf.fprintf oc "(* Log2 of word count per length *)\n";
41
-
Printf.fprintf oc "let size_bits_by_length = [|\n";
42
-
Printf.fprintf oc " 0; 0; 0; 0; 10; 10; 11; 11; 10; 10;\n";
43
-
Printf.fprintf oc " 10; 10; 10; 9; 9; 8; 7; 7; 8; 7;\n";
44
-
Printf.fprintf oc " 7; 6; 6; 5; 5\n";
45
-
Printf.fprintf oc "|]\n\n";
46
-
47
-
Printf.fprintf oc "let min_word_length = 4\n";
48
-
Printf.fprintf oc "let max_word_length = 24\n\n";
49
-
50
-
Printf.fprintf oc "(* Get a word from the dictionary *)\n";
51
-
Printf.fprintf oc "let get_word ~length ~index =\n";
52
-
Printf.fprintf oc " if length < min_word_length || length > max_word_length then\n";
53
-
Printf.fprintf oc " invalid_arg \"Dictionary word length out of range\";\n";
54
-
Printf.fprintf oc " let offset = offset_by_length.(length) + index * length in\n";
55
-
Printf.fprintf oc " String.sub data offset length\n";
56
-
57
-
close_out oc;
58
-
Printf.printf "Generated %s from %s (%d bytes)\n" output_path dictionary_path (String.length dict_data)
-112
ocaml-brotli/src/bit_reader.ml
-112
ocaml-brotli/src/bit_reader.ml
···
1
-
(* Variable-width bit reading with little-endian semantics for Brotli *)
2
-
3
-
type t = {
4
-
src : bytes;
5
-
src_len : int;
6
-
mutable byte_pos : int;
7
-
mutable bit_pos : int; (* 0-7: bits already read from current byte *)
8
-
}
9
-
10
-
exception End_of_input
11
-
12
-
(* Bit masks for extracting n bits *)
13
-
let[@inline always] bit_mask n =
14
-
(1 lsl n) - 1
15
-
16
-
(* Get byte at position, returns 0 if past end (zero-padding) *)
17
-
let[@inline always] get_byte t pos =
18
-
if pos < t.src_len then
19
-
Char.code (Bytes.unsafe_get t.src pos)
20
-
else
21
-
0
22
-
23
-
let create ~src ~pos ~len =
24
-
{ src; src_len = pos + len; byte_pos = pos; bit_pos = 0 }
25
-
26
-
let create_from_string s =
27
-
create ~src:(Bytes.unsafe_of_string s) ~pos:0 ~len:(String.length s)
28
-
29
-
let reset t =
30
-
t.byte_pos <- 0;
31
-
t.bit_pos <- 0
32
-
33
-
let position t =
34
-
t.byte_pos * 8 + t.bit_pos
35
-
36
-
let bytes_remaining t =
37
-
let total_bits = (t.src_len - t.byte_pos) * 8 - t.bit_pos in
38
-
(total_bits + 7) / 8
39
-
40
-
let has_more t =
41
-
t.byte_pos < t.src_len || t.bit_pos > 0
42
-
43
-
(* Read n bits (1-24) without advancing the position - optimized for common cases *)
44
-
let[@inline] peek_bits t n_bits =
45
-
if n_bits = 0 then 0
46
-
else begin
47
-
let bit_offset = t.bit_pos in
48
-
let byte_pos = t.byte_pos in
49
-
let bits_needed = n_bits + bit_offset in
50
-
(* Optimized path for reading up to 24 bits (most common) *)
51
-
if bits_needed <= 24 && byte_pos + 2 < t.src_len then begin
52
-
(* Read 3 bytes at once *)
53
-
let b0 = Char.code (Bytes.unsafe_get t.src byte_pos) in
54
-
let b1 = Char.code (Bytes.unsafe_get t.src (byte_pos + 1)) in
55
-
let b2 = Char.code (Bytes.unsafe_get t.src (byte_pos + 2)) in
56
-
let combined = b0 lor (b1 lsl 8) lor (b2 lsl 16) in
57
-
(combined lsr bit_offset) land bit_mask n_bits
58
-
end
59
-
else begin
60
-
(* Fallback for edge cases and larger reads *)
61
-
let result = ref 0 in
62
-
let bytes_shift = ref 0 in
63
-
let buf_pos = ref byte_pos in
64
-
while !bytes_shift < bits_needed do
65
-
result := !result lor (get_byte t !buf_pos lsl !bytes_shift);
66
-
bytes_shift := !bytes_shift + 8;
67
-
incr buf_pos
68
-
done;
69
-
(!result lsr bit_offset) land bit_mask n_bits
70
-
end
71
-
end
72
-
73
-
(* Advance by n bits without reading *)
74
-
let skip_bits t n_bits =
75
-
if n_bits > 0 then begin
76
-
let next_in_bits = t.bit_pos + n_bits in
77
-
t.bit_pos <- next_in_bits land 7;
78
-
t.byte_pos <- t.byte_pos + (next_in_bits lsr 3)
79
-
end
80
-
81
-
(* Read n bits (1-24) and advance position *)
82
-
let[@inline] read_bits t n_bits =
83
-
let value = peek_bits t n_bits in
84
-
skip_bits t n_bits;
85
-
value
86
-
87
-
(* Read a single bit *)
88
-
let[@inline] read_bit t =
89
-
read_bits t 1
90
-
91
-
(* Advance to next byte boundary *)
92
-
let align_to_byte t =
93
-
if t.bit_pos <> 0 then begin
94
-
t.bit_pos <- 0;
95
-
t.byte_pos <- t.byte_pos + 1
96
-
end
97
-
98
-
(* Copy n bytes to destination buffer, first aligning to byte boundary *)
99
-
let copy_bytes t ~dst ~dst_pos ~len =
100
-
align_to_byte t;
101
-
if len > 0 then begin
102
-
let src_pos = t.byte_pos in
103
-
if src_pos + len > t.src_len then
104
-
raise End_of_input;
105
-
Bytes.blit t.src src_pos dst dst_pos len;
106
-
t.byte_pos <- src_pos + len
107
-
end
108
-
109
-
(* Check if we have enough bits remaining *)
110
-
let check_bits t n_bits =
111
-
let total_bits = (t.src_len - t.byte_pos) * 8 - t.bit_pos in
112
-
total_bits >= n_bits
-88
ocaml-brotli/src/bit_writer.ml
-88
ocaml-brotli/src/bit_writer.ml
···
1
-
(* Variable-width bit writing with little-endian semantics for Brotli *)
2
-
3
-
type t = {
4
-
dst : bytes;
5
-
dst_len : int;
6
-
mutable byte_pos : int;
7
-
mutable bit_pos : int; (* 0-7: bits already written to current byte *)
8
-
mutable current_byte : int; (* Accumulated bits for current byte *)
9
-
}
10
-
11
-
exception Buffer_overflow
12
-
13
-
let create ~dst ~pos ~len =
14
-
{ dst; dst_len = pos + len; byte_pos = pos; bit_pos = 0; current_byte = 0 }
15
-
16
-
let position t =
17
-
t.byte_pos * 8 + t.bit_pos
18
-
19
-
let bytes_written t =
20
-
if t.bit_pos = 0 then
21
-
t.byte_pos
22
-
else
23
-
t.byte_pos + 1
24
-
25
-
(* Flush accumulated bits to output, return number of bytes written *)
26
-
let flush t =
27
-
if t.bit_pos > 0 then begin
28
-
if t.byte_pos >= t.dst_len then raise Buffer_overflow;
29
-
Bytes.unsafe_set t.dst t.byte_pos (Char.chr t.current_byte);
30
-
t.byte_pos <- t.byte_pos + 1;
31
-
t.bit_pos <- 0;
32
-
t.current_byte <- 0
33
-
end;
34
-
t.byte_pos
35
-
36
-
(* Write n bits (1-24) *)
37
-
let write_bits t n_bits value =
38
-
if n_bits <= 0 then ()
39
-
else begin
40
-
(* Add bits to current accumulator *)
41
-
t.current_byte <- t.current_byte lor ((value land ((1 lsl n_bits) - 1)) lsl t.bit_pos);
42
-
t.bit_pos <- t.bit_pos + n_bits;
43
-
44
-
(* Flush complete bytes *)
45
-
while t.bit_pos >= 8 do
46
-
if t.byte_pos >= t.dst_len then raise Buffer_overflow;
47
-
Bytes.unsafe_set t.dst t.byte_pos (Char.chr (t.current_byte land 0xFF));
48
-
t.byte_pos <- t.byte_pos + 1;
49
-
t.current_byte <- t.current_byte lsr 8;
50
-
t.bit_pos <- t.bit_pos - 8
51
-
done
52
-
end
53
-
54
-
(* Write a single bit *)
55
-
let[@inline] write_bit t value =
56
-
write_bits t 1 value
57
-
58
-
(* Align to next byte boundary by padding with zeros *)
59
-
let align_to_byte t =
60
-
if t.bit_pos > 0 then begin
61
-
if t.byte_pos >= t.dst_len then raise Buffer_overflow;
62
-
Bytes.unsafe_set t.dst t.byte_pos (Char.chr t.current_byte);
63
-
t.byte_pos <- t.byte_pos + 1;
64
-
t.bit_pos <- 0;
65
-
t.current_byte <- 0
66
-
end
67
-
68
-
(* Copy raw bytes to output, first aligning to byte boundary *)
69
-
let copy_bytes t ~src ~src_pos ~len =
70
-
align_to_byte t;
71
-
if len > 0 then begin
72
-
if t.byte_pos + len > t.dst_len then raise Buffer_overflow;
73
-
Bytes.blit src src_pos t.dst t.byte_pos len;
74
-
t.byte_pos <- t.byte_pos + len
75
-
end
76
-
77
-
(* Write a byte directly (for uncompressed blocks) *)
78
-
let write_byte t value =
79
-
write_bits t 8 value
80
-
81
-
(* Write a 16-bit little-endian value *)
82
-
let write_u16 t value =
83
-
write_bits t 16 value
84
-
85
-
(* Write a 32-bit little-endian value (in two parts to avoid overflow) *)
86
-
let write_u32 t value =
87
-
write_bits t 16 (value land 0xFFFF);
88
-
write_bits t 16 ((value lsr 16) land 0xFFFF)
-501
ocaml-brotli/src/block_split.ml
-501
ocaml-brotli/src/block_split.ml
···
1
-
(* Block splitting and entropy analysis for Brotli compression *)
2
-
(* This module provides block splitting for improved compression at higher quality levels *)
3
-
4
-
(* Histogram for entropy calculation *)
5
-
type histogram = {
6
-
mutable data : int array;
7
-
mutable total : int;
8
-
}
9
-
10
-
let create_histogram size = { data = Array.make size 0; total = 0 }
11
-
12
-
let add_sample hist symbol =
13
-
hist.data.(symbol) <- hist.data.(symbol) + 1;
14
-
hist.total <- hist.total + 1
15
-
16
-
let clear_histogram hist =
17
-
Array.fill hist.data 0 (Array.length hist.data) 0;
18
-
hist.total <- 0
19
-
20
-
(* Estimate bits needed to encode histogram using Shannon entropy *)
21
-
let entropy_bits hist =
22
-
if hist.total = 0 then 0.0
23
-
else begin
24
-
let total = float_of_int hist.total in
25
-
let log2 = log 2.0 in
26
-
let bits = ref 0.0 in
27
-
for i = 0 to Array.length hist.data - 1 do
28
-
let count = hist.data.(i) in
29
-
if count > 0 then begin
30
-
let p = float_of_int count /. total in
31
-
bits := !bits -. (float_of_int count) *. (log p /. log2)
32
-
end
33
-
done;
34
-
!bits
35
-
end
36
-
37
-
(* Combined cost model: entropy + Huffman code overhead *)
38
-
let histogram_cost hist =
39
-
let base_cost = entropy_bits hist in
40
-
(* Add overhead for code definition - roughly 5 bits per unique symbol *)
41
-
let num_symbols = Array.fold_left (fun acc c -> if c > 0 then acc + 1 else acc) 0 hist.data in
42
-
base_cost +. (float_of_int num_symbols *. 5.0)
43
-
44
-
(* Combine two histograms *)
45
-
let combine_histograms h1 h2 =
46
-
let result = create_histogram (Array.length h1.data) in
47
-
for i = 0 to Array.length h1.data - 1 do
48
-
result.data.(i) <- h1.data.(i) + h2.data.(i)
49
-
done;
50
-
result.total <- h1.total + h2.total;
51
-
result
52
-
53
-
(* Bit cost increase when combining two histograms vs. separate encoding *)
54
-
let split_cost_delta h1 h2 =
55
-
let combined = combine_histograms h1 h2 in
56
-
let combined_cost = histogram_cost combined in
57
-
let separate_cost = histogram_cost h1 +. histogram_cost h2 in
58
-
combined_cost -. separate_cost
59
-
60
-
(* Block split point *)
61
-
type split_point = {
62
-
position : int; (* Byte offset in input *)
63
-
score : float; (* Score for this split point *)
64
-
}
65
-
66
-
(* Minimum block size for splitting (smaller blocks aren't worth the overhead) *)
67
-
let min_block_size = 1024
68
-
69
-
(* Maximum number of block types *)
70
-
let max_block_types = 256
71
-
72
-
(* Maximum blocks per meta-block *)
73
-
let max_blocks = 256
74
-
75
-
(* Analyze data and find potential split points based on entropy changes *)
76
-
let find_split_points_simple src src_pos src_len =
77
-
if src_len < min_block_size * 2 then
78
-
[]
79
-
else begin
80
-
let window_size = min 256 (src_len / 8) in
81
-
let stride = max 64 (window_size / 2) in
82
-
let points = ref [] in
83
-
84
-
let hist1 = create_histogram 256 in
85
-
let hist2 = create_histogram 256 in
86
-
87
-
let pos = ref (src_pos + window_size) in
88
-
while !pos < src_pos + src_len - window_size do
89
-
(* Build histogram for window before position *)
90
-
clear_histogram hist1;
91
-
for i = !pos - window_size to !pos - 1 do
92
-
add_sample hist1 (Char.code (Bytes.get src i))
93
-
done;
94
-
95
-
(* Build histogram for window after position *)
96
-
clear_histogram hist2;
97
-
for i = !pos to min (!pos + window_size - 1) (src_pos + src_len - 1) do
98
-
add_sample hist2 (Char.code (Bytes.get src i))
99
-
done;
100
-
101
-
(* Calculate cost delta - higher = better split point *)
102
-
let delta = split_cost_delta hist1 hist2 in
103
-
if delta > 50.0 then (* Threshold for significant change *)
104
-
points := { position = !pos; score = delta } :: !points;
105
-
106
-
pos := !pos + stride
107
-
done;
108
-
109
-
(* Sort by score and filter to keep only best split points *)
110
-
let sorted = List.sort (fun a b -> compare b.score a.score) !points in
111
-
112
-
(* Keep only non-overlapping splits that improve compression *)
113
-
let rec filter_overlapping acc remaining =
114
-
match remaining with
115
-
| [] -> acc
116
-
| p :: rest ->
117
-
let dominated = List.exists (fun q ->
118
-
abs (p.position - q.position) < min_block_size
119
-
) acc in
120
-
if dominated then filter_overlapping acc rest
121
-
else filter_overlapping (p :: acc) rest
122
-
in
123
-
124
-
let filtered = filter_overlapping [] sorted in
125
-
126
-
(* Sort by position and limit to max_blocks - 1 splits *)
127
-
let by_position = List.sort (fun a b -> compare a.position b.position) filtered in
128
-
let limited =
129
-
if List.length by_position >= max_blocks then
130
-
let rec take n lst = if n = 0 then [] else match lst with
131
-
| [] -> []
132
-
| h :: t -> h :: take (n-1) t
133
-
in
134
-
take (max_blocks - 1) by_position
135
-
else
136
-
by_position
137
-
in
138
-
139
-
List.map (fun p -> p.position) limited
140
-
end
141
-
142
-
(* Fast log2 for bit cost calculation *)
143
-
let[@inline always] fast_log2 v =
144
-
if v <= 0 then 0.0
145
-
else
146
-
let rec log2_floor v acc = if v <= 1 then acc else log2_floor (v lsr 1) (acc + 1) in
147
-
float_of_int (log2_floor v 0)
148
-
149
-
(* Bit cost for a symbol given a histogram - matches brotli-c BitCost *)
150
-
let bit_cost count =
151
-
if count = 0 then fast_log2 1 +. 2.0 (* Missing symbol penalty *)
152
-
else fast_log2 count
153
-
154
-
(* Per-position DP block splitting matching brotli-c block_splitter_inc.h FN(FindBlocks)
155
-
This tracks costs for multiple histograms simultaneously and finds optimal switch points *)
156
-
let find_blocks_dp src src_pos src_len num_histograms =
157
-
if src_len < min_block_size || num_histograms <= 1 then
158
-
(* Trivial case: single block *)
159
-
Array.make src_len 0
160
-
else begin
161
-
let block_id = Array.make src_len 0 in
162
-
163
-
(* Initialize histograms with random samples (matching brotli-c InitialEntropyCodes) *)
164
-
let histograms = Array.init num_histograms (fun _ -> create_histogram 256) in
165
-
let block_length = src_len / num_histograms in
166
-
for i = 0 to num_histograms - 1 do
167
-
let start_pos = i * block_length in
168
-
let sample_len = min 64 block_length in
169
-
for j = 0 to sample_len - 1 do
170
-
if start_pos + j < src_len then begin
171
-
let c = Char.code (Bytes.get src (src_pos + start_pos + j)) in
172
-
add_sample histograms.(i) c
173
-
end
174
-
done
175
-
done;
176
-
177
-
(* Compute insert costs for each symbol in each histogram *)
178
-
let insert_cost = Array.make_matrix 256 num_histograms 0.0 in
179
-
for h = 0 to num_histograms - 1 do
180
-
let log2_total = if histograms.(h).total > 0 then
181
-
fast_log2 histograms.(h).total
182
-
else 0.0 in
183
-
for sym = 0 to 255 do
184
-
(* Cost = log2(total) - log2(count) = -log2(probability) *)
185
-
insert_cost.(sym).(h) <- log2_total -. bit_cost histograms.(h).data.(sym)
186
-
done
187
-
done;
188
-
189
-
(* DP: cost.(h) = cost difference from minimum for reaching current position with histogram h *)
190
-
let cost = Array.make num_histograms 0.0 in
191
-
let switch_signal = Array.make_matrix src_len num_histograms false in
192
-
193
-
(* Block switch cost from brotli-c *)
194
-
let base_block_switch_cost = 28.1 in (* From brotli-c *)
195
-
let prologue_length = 2000 in
196
-
197
-
(* Main DP loop *)
198
-
for byte_ix = 0 to src_len - 1 do
199
-
let sym = Char.code (Bytes.get src (src_pos + byte_ix)) in
200
-
let min_cost = ref infinity in
201
-
202
-
(* Update costs for each histogram *)
203
-
for h = 0 to num_histograms - 1 do
204
-
cost.(h) <- cost.(h) +. insert_cost.(sym).(h);
205
-
if cost.(h) < !min_cost then begin
206
-
min_cost := cost.(h);
207
-
block_id.(byte_ix) <- h
208
-
end
209
-
done;
210
-
211
-
(* Normalize costs and mark switch signals *)
212
-
let block_switch_cost =
213
-
if byte_ix < prologue_length then
214
-
base_block_switch_cost *. (0.77 +. 0.07 /. 2000.0 *. float_of_int byte_ix)
215
-
else base_block_switch_cost
216
-
in
217
-
218
-
for h = 0 to num_histograms - 1 do
219
-
cost.(h) <- cost.(h) -. !min_cost;
220
-
if cost.(h) >= block_switch_cost then begin
221
-
cost.(h) <- block_switch_cost;
222
-
switch_signal.(byte_ix).(h) <- true
223
-
end
224
-
done
225
-
done;
226
-
227
-
(* Traceback: find block boundaries *)
228
-
let cur_id = ref block_id.(src_len - 1) in
229
-
for byte_ix = src_len - 2 downto 0 do
230
-
if switch_signal.(byte_ix).(!cur_id) then
231
-
cur_id := block_id.(byte_ix);
232
-
block_id.(byte_ix) <- !cur_id
233
-
done;
234
-
235
-
block_id
236
-
end
237
-
238
-
(* More sophisticated splitting using dynamic programming *)
239
-
let find_split_points_dp src src_pos src_len max_splits =
240
-
if src_len < min_block_size * 2 then
241
-
[]
242
-
else begin
243
-
(* Build cumulative histograms for O(1) range queries *)
244
-
let cum_hist = Array.make_matrix (src_len + 1) 256 0 in
245
-
for i = 0 to src_len - 1 do
246
-
let c = Char.code (Bytes.get src (src_pos + i)) in
247
-
for j = 0 to 255 do
248
-
cum_hist.(i + 1).(j) <- cum_hist.(i).(j)
249
-
done;
250
-
cum_hist.(i + 1).(c) <- cum_hist.(i + 1).(c) + 1
251
-
done;
252
-
253
-
(* Get histogram for range [start, end) *)
254
-
let get_range_histogram start_pos end_pos =
255
-
let hist = create_histogram 256 in
256
-
for j = 0 to 255 do
257
-
hist.data.(j) <- cum_hist.(end_pos).(j) - cum_hist.(start_pos).(j)
258
-
done;
259
-
hist.total <- end_pos - start_pos;
260
-
hist
261
-
in
262
-
263
-
(* Compute entropy cost for a block *)
264
-
let block_cost start_pos end_pos =
265
-
if end_pos <= start_pos then 0.0
266
-
else begin
267
-
let hist = get_range_histogram start_pos end_pos in
268
-
histogram_cost hist
269
-
end
270
-
in
271
-
272
-
(* DP: find optimal k splits *)
273
-
let n = min (src_len / min_block_size) 32 in (* Candidate positions *)
274
-
if n < 2 then []
275
-
else begin
276
-
let step = src_len / n in
277
-
let positions = Array.init n (fun i -> min ((i + 1) * step) src_len) in
278
-
279
-
(* dp.(i).(k) = minimum cost to encode first positions.(i) bytes with k splits *)
280
-
let max_k = min max_splits (n - 1) in
281
-
let dp = Array.make_matrix n (max_k + 1) infinity in
282
-
let parent = Array.make_matrix n (max_k + 1) (-1) in
283
-
284
-
(* Base case: no splits *)
285
-
for i = 0 to n - 1 do
286
-
dp.(i).(0) <- block_cost 0 positions.(i)
287
-
done;
288
-
289
-
(* Fill DP table *)
290
-
for k = 1 to max_k do
291
-
for i = k to n - 1 do
292
-
for j = k - 1 to i - 1 do
293
-
let prev_cost = dp.(j).(k - 1) in
294
-
let this_block = block_cost positions.(j) positions.(i) in
295
-
let total = prev_cost +. this_block +. 32.0 in (* 32 bits overhead per block *)
296
-
if total < dp.(i).(k) then begin
297
-
dp.(i).(k) <- total;
298
-
parent.(i).(k) <- j
299
-
end
300
-
done
301
-
done
302
-
done;
303
-
304
-
(* Find best number of splits for the full input *)
305
-
let last_pos = n - 1 in
306
-
let best_k = ref 0 in
307
-
let best_cost = ref dp.(last_pos).(0) in
308
-
for k = 1 to max_k do
309
-
if dp.(last_pos).(k) < !best_cost then begin
310
-
best_cost := dp.(last_pos).(k);
311
-
best_k := k
312
-
end
313
-
done;
314
-
315
-
(* Backtrack to find split positions *)
316
-
let splits = ref [] in
317
-
let rec backtrack i k =
318
-
if k > 0 then begin
319
-
let j = parent.(i).(k) in
320
-
if j >= 0 then begin
321
-
splits := (src_pos + positions.(j)) :: !splits;
322
-
backtrack j (k - 1)
323
-
end
324
-
end
325
-
in
326
-
backtrack last_pos !best_k;
327
-
328
-
!splits
329
-
end
330
-
end
331
-
332
-
(* High-level function: find optimal block split points *)
333
-
let find_split_points ?(quality=5) src src_pos src_len =
334
-
if quality < 5 || src_len < min_block_size then
335
-
[]
336
-
else if quality >= 10 then
337
-
(* Use DP-based splitting for highest quality *)
338
-
find_split_points_dp src src_pos src_len (max_blocks - 1)
339
-
else
340
-
(* Use simpler entropy-based splitting *)
341
-
find_split_points_simple src src_pos src_len
342
-
343
-
(* Context mode selection for a block *)
344
-
345
-
(* Score how well a context mode fits the data *)
346
-
let score_context_mode mode src src_pos src_len =
347
-
if src_len < 16 then 0.0
348
-
else begin
349
-
(* Create per-context histograms *)
350
-
let num_contexts = 64 in
351
-
let histograms = Array.init num_contexts (fun _ -> create_histogram 256) in
352
-
353
-
(* Populate histograms *)
354
-
let prev1 = ref 0 in
355
-
let prev2 = ref 0 in
356
-
for i = 0 to src_len - 1 do
357
-
let byte = Char.code (Bytes.get src (src_pos + i)) in
358
-
let context_id = Context.get_context mode ~prev_byte1:!prev1 ~prev_byte2:!prev2 in
359
-
add_sample histograms.(context_id) byte;
360
-
prev2 := !prev1;
361
-
prev1 := byte
362
-
done;
363
-
364
-
(* Calculate total bits needed with this context mode *)
365
-
let total_bits = Array.fold_left (fun acc h -> acc +. entropy_bits h) 0.0 histograms in
366
-
367
-
(* Lower is better, but return negative so higher score = better *)
368
-
-. total_bits
369
-
end
370
-
371
-
(* Choose the best context mode for a block *)
372
-
let choose_context_mode src src_pos src_len =
373
-
if src_len < 32 then
374
-
Context.LSB6 (* Default for small blocks *)
375
-
else begin
376
-
let modes = [| Context.LSB6; Context.MSB6; Context.UTF8; Context.SIGNED |] in
377
-
let best_mode = ref Context.LSB6 in
378
-
let best_score = ref neg_infinity in
379
-
Array.iter (fun mode ->
380
-
let score = score_context_mode mode src src_pos src_len in
381
-
if score > !best_score then begin
382
-
best_score := score;
383
-
best_mode := mode
384
-
end
385
-
) modes;
386
-
!best_mode
387
-
end
388
-
389
-
(* Cluster histograms to reduce number of Huffman trees needed *)
390
-
type cluster = {
391
-
mutable members : int list;
392
-
mutable histogram : histogram;
393
-
}
394
-
395
-
(* Distance between two histograms (symmetric KL divergence approximation) *)
396
-
let histogram_distance h1 h2 =
397
-
if h1.total = 0 || h2.total = 0 then infinity
398
-
else begin
399
-
let t1 = float_of_int h1.total in
400
-
let t2 = float_of_int h2.total in
401
-
let dist = ref 0.0 in
402
-
for i = 0 to Array.length h1.data - 1 do
403
-
let c1 = float_of_int h1.data.(i) in
404
-
let c2 = float_of_int h2.data.(i) in
405
-
if c1 > 0.0 && c2 > 0.0 then begin
406
-
let p1 = c1 /. t1 in
407
-
let p2 = c2 /. t2 in
408
-
let avg = (p1 +. p2) /. 2.0 in
409
-
(* Jensen-Shannon divergence *)
410
-
dist := !dist +. c1 *. (log (p1 /. avg)) +. c2 *. (log (p2 /. avg))
411
-
end else if c1 > 0.0 || c2 > 0.0 then
412
-
dist := !dist +. 10.0 (* Penalty for mismatched symbols *)
413
-
done;
414
-
!dist
415
-
end
416
-
417
-
(* Cluster context histograms using greedy agglomerative clustering *)
418
-
let cluster_histograms histograms max_clusters =
419
-
let n = Array.length histograms in
420
-
if n <= max_clusters then
421
-
(* Each context maps to its own cluster *)
422
-
Array.init n (fun i -> i)
423
-
else begin
424
-
(* Initialize: each histogram is its own cluster *)
425
-
let clusters = Array.init n (fun i ->
426
-
{ members = [i]; histogram = histograms.(i) }
427
-
) in
428
-
let active = Array.make n true in
429
-
let num_active = ref n in
430
-
431
-
(* Merge until we have max_clusters *)
432
-
while !num_active > max_clusters do
433
-
(* Find the two closest clusters *)
434
-
let best_i = ref (-1) in
435
-
let best_j = ref (-1) in
436
-
let best_dist = ref infinity in
437
-
438
-
for i = 0 to n - 1 do
439
-
if active.(i) then
440
-
for j = i + 1 to n - 1 do
441
-
if active.(j) then begin
442
-
let dist = histogram_distance clusters.(i).histogram clusters.(j).histogram in
443
-
if dist < !best_dist then begin
444
-
best_dist := dist;
445
-
best_i := i;
446
-
best_j := j
447
-
end
448
-
end
449
-
done
450
-
done;
451
-
452
-
(* Merge best_j into best_i *)
453
-
if !best_i >= 0 && !best_j >= 0 then begin
454
-
clusters.(!best_i).members <- clusters.(!best_j).members @ clusters.(!best_i).members;
455
-
clusters.(!best_i).histogram <- combine_histograms
456
-
clusters.(!best_i).histogram
457
-
clusters.(!best_j).histogram;
458
-
active.(!best_j) <- false;
459
-
decr num_active
460
-
end else
461
-
num_active := 0 (* Shouldn't happen, but exit loop *)
462
-
done;
463
-
464
-
(* Build context map: context_id -> cluster_id *)
465
-
let context_map = Array.make n 0 in
466
-
let cluster_id = ref 0 in
467
-
for i = 0 to n - 1 do
468
-
if active.(i) then begin
469
-
List.iter (fun ctx -> context_map.(ctx) <- !cluster_id) clusters.(i).members;
470
-
incr cluster_id
471
-
end
472
-
done;
473
-
474
-
context_map
475
-
end
476
-
477
-
(* Build context map for literal encoding *)
478
-
let build_literal_context_map mode src src_pos src_len max_trees =
479
-
let num_contexts = 64 in
480
-
481
-
(* Build per-context histograms *)
482
-
let histograms = Array.init num_contexts (fun _ -> create_histogram 256) in
483
-
484
-
let prev1 = ref 0 in
485
-
let prev2 = ref 0 in
486
-
for i = 0 to src_len - 1 do
487
-
let byte = Char.code (Bytes.get src (src_pos + i)) in
488
-
let context_id = Context.get_context mode ~prev_byte1:!prev1 ~prev_byte2:!prev2 in
489
-
add_sample histograms.(context_id) byte;
490
-
prev2 := !prev1;
491
-
prev1 := byte
492
-
done;
493
-
494
-
(* Cluster histograms *)
495
-
let context_map = cluster_histograms histograms max_trees in
496
-
497
-
(* Count actual number of trees used *)
498
-
let max_tree = Array.fold_left max 0 context_map in
499
-
let num_trees = max_tree + 1 in
500
-
501
-
(context_map, histograms, num_trees)
-92
ocaml-brotli/src/brotli.ml
-92
ocaml-brotli/src/brotli.ml
···
1
-
(* Pure OCaml implementation of Brotli compression (RFC 7932) *)
2
-
3
-
(* Re-export error types from decoder *)
4
-
type error = Brotli_decode.error =
5
-
| Invalid_stream_header
6
-
| Invalid_meta_block_header
7
-
| Invalid_huffman_code
8
-
| Invalid_distance
9
-
| Invalid_backward_reference
10
-
| Invalid_context_map
11
-
| Truncated_input
12
-
| Output_overrun
13
-
14
-
exception Brotli_error = Brotli_decode.Brotli_error
15
-
16
-
let error_to_string = Brotli_decode.error_to_string
17
-
18
-
(* Low-allocation API *)
19
-
20
-
let compress_into ?(quality=1) ~src ~src_pos ~src_len ~dst ~dst_pos () =
21
-
Brotli_encode.compress_into ~quality ~src ~src_pos ~src_len ~dst ~dst_pos ()
22
-
23
-
let decompress_into ~src ~src_pos ~src_len ~dst ~dst_pos =
24
-
Brotli_decode.decompress_into ~src ~src_pos ~src_len ~dst ~dst_pos
25
-
26
-
(* Utilities *)
27
-
28
-
let max_compressed_length = Brotli_encode.max_compressed_length
29
-
30
-
(* Simple string API *)
31
-
32
-
let compress ?(quality = 1) s =
33
-
let src = Bytes.unsafe_of_string s in
34
-
let src_len = String.length s in
35
-
let max_len = max_compressed_length src_len in
36
-
let dst = Bytes.create max_len in
37
-
let len = Brotli_encode.compress_into ~quality ~src ~src_pos:0 ~src_len ~dst ~dst_pos:0 () in
38
-
Bytes.sub_string dst 0 len
39
-
40
-
let decompress s =
41
-
try
42
-
let src = Bytes.unsafe_of_string s in
43
-
let src_len = String.length s in
44
-
(* Estimate decompressed size - start with 4x input size *)
45
-
let initial_size = max 256 (src_len * 4) in
46
-
let dst = ref (Bytes.create initial_size) in
47
-
let rec try_decompress size =
48
-
try
49
-
dst := Bytes.create size;
50
-
let len = decompress_into ~src ~src_pos:0 ~src_len ~dst:!dst ~dst_pos:0 in
51
-
Ok (Bytes.sub_string !dst 0 len)
52
-
with
53
-
| Brotli_error Output_overrun ->
54
-
(* Double buffer size and retry *)
55
-
if size > 256 * 1024 * 1024 then
56
-
Error "Output too large"
57
-
else
58
-
try_decompress (size * 2)
59
-
in
60
-
try_decompress initial_size
61
-
with
62
-
| Brotli_error e -> Error (error_to_string e)
63
-
| Bit_reader.End_of_input -> Error "Truncated input"
64
-
65
-
let decompress_exn s =
66
-
match decompress s with
67
-
| Ok result -> result
68
-
| Error msg -> failwith msg
69
-
70
-
(* Streaming compression API *)
71
-
type streaming_encoder = Brotli_encode.streaming_encoder
72
-
73
-
let create_streaming_encoder = Brotli_encode.create_streaming_encoder
74
-
let streaming_write = Brotli_encode.streaming_write
75
-
let streaming_finish = Brotli_encode.streaming_finish
76
-
let streaming_bytes_written = Brotli_encode.streaming_bytes_written
77
-
78
-
(* Constants *)
79
-
let min_quality = 0
80
-
let max_quality = 11
81
-
let default_quality = 1
82
-
let max_window_bits = 22
83
-
84
-
(* Debug module for testing *)
85
-
module Debug = struct
86
-
type command = Brotli_encode.command =
87
-
| InsertCopy of { lit_start: int; lit_len: int; copy_len: int; distance: int; dist_code: int option }
88
-
| Literals of { start: int; len: int }
89
-
90
-
let generate_commands src src_pos src_len =
91
-
Brotli_encode.generate_commands src src_pos src_len
92
-
end
-219
ocaml-brotli/src/brotli.mli
-219
ocaml-brotli/src/brotli.mli
···
1
-
(*---------------------------------------------------------------------------
2
-
Copyright (c) 2024 The brotli programmers. All rights reserved.
3
-
SPDX-License-Identifier: ISC
4
-
---------------------------------------------------------------------------*)
5
-
6
-
(** Pure OCaml Brotli compression and decompression.
7
-
8
-
This module implements the {{:https://www.rfc-editor.org/rfc/rfc7932}Brotli}
9
-
compressed data format as specified in RFC 7932.
10
-
11
-
Brotli is a general-purpose lossless compression algorithm that uses
12
-
LZ77 matching, Huffman coding, and 2nd order context modeling, with a
13
-
pre-defined 122 KB static dictionary for improved text compression.
14
-
15
-
{2 Compression quality levels}
16
-
17
-
Quality levels control the trade-off between compression ratio and speed:
18
-
{ul
19
-
{- Quality [0]: Stored (uncompressed) blocks only.}
20
-
{- Quality [1]: Huffman-only compression, no LZ77 matching.}
21
-
{- Quality [2]-[3]: LZ77 with simple hash table matching.}
22
-
{- Quality [4]: Hash chains (16 depth) with dictionary matching.}
23
-
{- Quality [5]-[6]: Context mode selection for better literal coding.}
24
-
{- Quality [7]-[9]: Multiple literal Huffman trees (2-4 trees).}
25
-
{- Quality [10]-[11]: Optimal parsing with deep hash chains (512 depth).}}
26
-
27
-
{2 RFC 7932 specification mapping}
28
-
29
-
This implementation covers the following RFC 7932 sections:
30
-
{ul
31
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-3}Section 3}: Header
32
-
(WBITS window size encoding)}
33
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-4}Section 4}: Meta-block
34
-
structure (MLEN, ISUNCOMPRESSED)}
35
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-5}Section 5}: Prefix
36
-
codes (simple and complex Huffman codes)}
37
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-6}Section 6}: Context
38
-
modeling (LSB6, MSB6, UTF8, SIGNED modes)}
39
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-7}Section 7}: Block
40
-
types and block counts}
41
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-8}Section 8}: Distance
42
-
codes (ring buffer with 16 short codes)}
43
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#section-9}Section 9}: LZ77
44
-
commands (insert-and-copy, literals)}
45
-
{- {{:https://www.rfc-editor.org/rfc/rfc7932#appendix-A}Appendix A}: Static
46
-
dictionary (122 KB, 121 transforms)}}
47
-
*)
48
-
49
-
(** {1:errors Error handling} *)
50
-
51
-
type error =
52
-
| Invalid_stream_header
53
-
(** WBITS value in stream header is invalid
54
-
({{:https://www.rfc-editor.org/rfc/rfc7932#section-9.1}RFC 7932 Section 9.1}) *)
55
-
| Invalid_meta_block_header
56
-
(** Meta-block header is malformed
57
-
({{:https://www.rfc-editor.org/rfc/rfc7932#section-9.2}RFC 7932 Section 9.2}) *)
58
-
| Invalid_huffman_code
59
-
(** Prefix code definition is invalid
60
-
({{:https://www.rfc-editor.org/rfc/rfc7932#section-3.2}RFC 7932 Section 3.2}) *)
61
-
| Invalid_distance
62
-
(** Distance code or value is out of range
63
-
({{:https://www.rfc-editor.org/rfc/rfc7932#section-4}RFC 7932 Section 4}) *)
64
-
| Invalid_backward_reference
65
-
(** Backward reference points before start of output *)
66
-
| Invalid_context_map
67
-
(** Context map encoding is invalid
68
-
({{:https://www.rfc-editor.org/rfc/rfc7932#section-7.3}RFC 7932 Section 7.3}) *)
69
-
| Truncated_input
70
-
(** Input stream ended unexpectedly *)
71
-
| Output_overrun
72
-
(** Decompressed size exceeds output buffer *)
73
-
(** The type for decompression errors. Error constructors reference the
74
-
relevant RFC 7932 sections. *)
75
-
76
-
exception Brotli_error of error
77
-
(** Exception raised on decompression errors. *)
78
-
79
-
val error_to_string : error -> string
80
-
(** [error_to_string e] returns a human-readable description of error [e]. *)
81
-
82
-
(** {1:simple Simple API} *)
83
-
84
-
val compress : ?quality:int -> string -> string
85
-
(** [compress ?quality s] compresses string [s] using Brotli.
86
-
87
-
@param quality Compression quality [0]-[11] (default: [1]).
88
-
Higher values give better compression at the cost of speed.
89
-
See {{!quality_levels}quality levels} for details. *)
90
-
91
-
val decompress : string -> (string, string) result
92
-
(** [decompress s] decompresses a Brotli-compressed string.
93
-
94
-
Returns [Ok decompressed] on success or [Error message] on failure.
95
-
The input must be a complete, valid Brotli stream. *)
96
-
97
-
val decompress_exn : string -> string
98
-
(** [decompress_exn s] decompresses a Brotli-compressed string.
99
-
100
-
@raise Brotli_error on decompression failure. *)
101
-
102
-
(** {1:low_alloc Low-allocation API}
103
-
104
-
These functions avoid intermediate string allocations by operating
105
-
directly on byte buffers. Use {!max_compressed_length} to size output
106
-
buffers for compression. *)
107
-
108
-
val compress_into :
109
-
?quality:int ->
110
-
src:bytes -> src_pos:int -> src_len:int ->
111
-
dst:bytes -> dst_pos:int -> unit -> int
112
-
(** [compress_into ?quality ~src ~src_pos ~src_len ~dst ~dst_pos ()]
113
-
compresses [src_len] bytes from [src] starting at [src_pos] into [dst]
114
-
starting at [dst_pos].
115
-
116
-
@return the number of bytes written to [dst].
117
-
118
-
The caller must ensure [dst] has at least [max_compressed_length src_len]
119
-
bytes available starting at [dst_pos]. *)
120
-
121
-
val decompress_into :
122
-
src:bytes -> src_pos:int -> src_len:int ->
123
-
dst:bytes -> dst_pos:int -> int
124
-
(** [decompress_into ~src ~src_pos ~src_len ~dst ~dst_pos] decompresses
125
-
[src_len] bytes from [src] starting at [src_pos] into [dst] starting at
126
-
[dst_pos].
127
-
128
-
@return the number of bytes written to [dst].
129
-
@raise Brotli_error if the input is invalid or the output buffer is
130
-
too small. *)
131
-
132
-
(** {1:utils Utilities} *)
133
-
134
-
val max_compressed_length : int -> int
135
-
(** [max_compressed_length n] returns the maximum possible compressed size
136
-
for an input of [n] bytes. Use this to allocate output buffers for
137
-
{!compress_into}. *)
138
-
139
-
(** {1:streaming Streaming compression API}
140
-
141
-
The streaming API allows compressing data in chunks. Each chunk is
142
-
encoded as a complete meta-block
143
-
({{:https://www.rfc-editor.org/rfc/rfc7932#section-9.2}RFC 7932 Section 9.2}}),
144
-
which allows the decoder to process chunks independently.
145
-
146
-
{b Note}: For best compression, prefer the simple API with the complete
147
-
input when possible. The streaming API trades compression ratio for
148
-
the ability to process data incrementally. *)
149
-
150
-
type streaming_encoder
151
-
(** Opaque type for streaming compression state. *)
152
-
153
-
val create_streaming_encoder :
154
-
?quality:int -> dst:bytes -> dst_pos:int -> unit -> streaming_encoder
155
-
(** [create_streaming_encoder ?quality ~dst ~dst_pos ()] creates a new
156
-
streaming encoder that writes to [dst] starting at [dst_pos].
157
-
158
-
@param quality Compression quality [0]-[11] (default: [1]). *)
159
-
160
-
val streaming_write :
161
-
streaming_encoder ->
162
-
src:bytes -> src_pos:int -> src_len:int -> is_last:bool -> int
163
-
(** [streaming_write encoder ~src ~src_pos ~src_len ~is_last] compresses
164
-
[src_len] bytes from [src] starting at [src_pos] and writes them to
165
-
the encoder's output buffer.
166
-
167
-
@param is_last Set to [true] for the final chunk to emit the stream
168
-
trailer (ISLAST=1 meta-block).
169
-
@return the number of bytes written to the output buffer. *)
170
-
171
-
val streaming_finish : streaming_encoder -> int
172
-
(** [streaming_finish encoder] finishes the stream if not already finished.
173
-
174
-
@return bytes written (0 if already finished). *)
175
-
176
-
val streaming_bytes_written : streaming_encoder -> int
177
-
(** [streaming_bytes_written encoder] returns total bytes written so far. *)
178
-
179
-
(** {1:constants Constants}
180
-
181
-
These constants correspond to values defined in
182
-
{{:https://www.rfc-editor.org/rfc/rfc7932}RFC 7932}. *)
183
-
184
-
val min_quality : int
185
-
(** [min_quality] is [0], the minimum compression quality (stored blocks). *)
186
-
187
-
val max_quality : int
188
-
(** [max_quality] is [11], the maximum compression quality. *)
189
-
190
-
val default_quality : int
191
-
(** [default_quality] is [1], the default compression quality. *)
192
-
193
-
val max_window_bits : int
194
-
(** [max_window_bits] is [22], the maximum window size (4 MB).
195
-
See {{:https://www.rfc-editor.org/rfc/rfc7932#section-9.1}RFC 7932 Section 9.1}. *)
196
-
197
-
(** {1:internals Internals}
198
-
199
-
These functions are exposed for testing and debugging. They are not
200
-
part of the stable API. *)
201
-
202
-
module Debug : sig
203
-
(** Debug utilities for inspecting LZ77 commands. *)
204
-
205
-
type command =
206
-
| InsertCopy of {
207
-
lit_start: int; (** Start offset in source for literals *)
208
-
lit_len: int; (** Number of literal bytes to insert *)
209
-
copy_len: int; (** Number of bytes to copy from back-reference *)
210
-
distance: int; (** Back-reference distance in bytes *)
211
-
dist_code: int option; (** Short distance code [0]-[15] if used *)
212
-
}
213
-
| Literals of { start: int; len: int }
214
-
(** LZ77 command representation.
215
-
See {{:https://www.rfc-editor.org/rfc/rfc7932#section-5}RFC 7932 Section 5}. *)
216
-
217
-
val generate_commands : bytes -> int -> int -> command list
218
-
(** [generate_commands src pos len] generates LZ77 commands for the input. *)
219
-
end
-558
ocaml-brotli/src/brotli_decode.ml
-558
ocaml-brotli/src/brotli_decode.ml
···
1
-
(* Brotli decompression implementation (RFC 7932) *)
2
-
3
-
type error =
4
-
| Invalid_stream_header
5
-
| Invalid_meta_block_header
6
-
| Invalid_huffman_code
7
-
| Invalid_distance
8
-
| Invalid_backward_reference
9
-
| Invalid_context_map
10
-
| Truncated_input
11
-
| Output_overrun
12
-
13
-
exception Brotli_error of error
14
-
15
-
let error_to_string = function
16
-
| Invalid_stream_header -> "Invalid stream header"
17
-
| Invalid_meta_block_header -> "Invalid meta-block header"
18
-
| Invalid_huffman_code -> "Invalid Huffman code"
19
-
| Invalid_distance -> "Invalid distance"
20
-
| Invalid_backward_reference -> "Invalid backward reference"
21
-
| Invalid_context_map -> "Invalid context map"
22
-
| Truncated_input -> "Truncated input"
23
-
| Output_overrun -> "Output buffer overrun"
24
-
25
-
(* Distance short code lookup tables *)
26
-
let distance_short_code_index_offset = [| 3; 2; 1; 0; 3; 3; 3; 3; 3; 3; 2; 2; 2; 2; 2; 2 |]
27
-
let distance_short_code_value_offset = [| 0; 0; 0; 0; -1; 1; -2; 2; -3; 3; -1; 1; -2; 2; -3; 3 |]
28
-
29
-
(* Static Huffman code for code length code lengths *)
30
-
let code_length_huff = [|
31
-
{ Huffman.bits = 2; value = 0 }; { Huffman.bits = 2; value = 4 };
32
-
{ Huffman.bits = 2; value = 3 }; { Huffman.bits = 3; value = 2 };
33
-
{ Huffman.bits = 2; value = 0 }; { Huffman.bits = 2; value = 4 };
34
-
{ Huffman.bits = 2; value = 3 }; { Huffman.bits = 4; value = 1 };
35
-
{ Huffman.bits = 2; value = 0 }; { Huffman.bits = 2; value = 4 };
36
-
{ Huffman.bits = 2; value = 3 }; { Huffman.bits = 3; value = 2 };
37
-
{ Huffman.bits = 2; value = 0 }; { Huffman.bits = 2; value = 4 };
38
-
{ Huffman.bits = 2; value = 3 }; { Huffman.bits = 4; value = 5 };
39
-
|]
40
-
41
-
(* Decode window bits from stream header *)
42
-
let decode_window_bits br =
43
-
if Bit_reader.read_bits br 1 = 0 then 16
44
-
else begin
45
-
let n = Bit_reader.read_bits br 3 in
46
-
if n > 0 then 17 + n
47
-
else begin
48
-
let n = Bit_reader.read_bits br 3 in
49
-
if n > 0 then 8 + n
50
-
else 17
51
-
end
52
-
end
53
-
54
-
(* Decode a variable length uint8 (0-255) *)
55
-
let decode_var_len_uint8 br =
56
-
if Bit_reader.read_bits br 1 = 1 then begin
57
-
let nbits = Bit_reader.read_bits br 3 in
58
-
if nbits = 0 then 1
59
-
else Bit_reader.read_bits br nbits + (1 lsl nbits)
60
-
end
61
-
else 0
62
-
63
-
(* Meta-block header *)
64
-
type meta_block_header = {
65
-
meta_block_length : int;
66
-
input_end : bool;
67
-
is_uncompressed : bool;
68
-
is_metadata : bool;
69
-
}
70
-
71
-
(* Decode meta-block length *)
72
-
let decode_meta_block_length br =
73
-
let input_end = Bit_reader.read_bits br 1 = 1 in
74
-
if input_end && Bit_reader.read_bits br 1 = 1 then
75
-
{ meta_block_length = 0; input_end = true; is_uncompressed = false; is_metadata = false }
76
-
else begin
77
-
let size_nibbles = Bit_reader.read_bits br 2 + 4 in
78
-
if size_nibbles = 7 then begin
79
-
(* Metadata block *)
80
-
if Bit_reader.read_bits br 1 <> 0 then
81
-
raise (Brotli_error Invalid_meta_block_header);
82
-
let size_bytes = Bit_reader.read_bits br 2 in
83
-
if size_bytes = 0 then
84
-
{ meta_block_length = 0; input_end; is_uncompressed = false; is_metadata = true }
85
-
else begin
86
-
let length = ref 0 in
87
-
for i = 0 to size_bytes - 1 do
88
-
let next_byte = Bit_reader.read_bits br 8 in
89
-
if i + 1 = size_bytes && size_bytes > 1 && next_byte = 0 then
90
-
raise (Brotli_error Invalid_meta_block_header);
91
-
length := !length lor (next_byte lsl (i * 8))
92
-
done;
93
-
{ meta_block_length = !length + 1; input_end; is_uncompressed = false; is_metadata = true }
94
-
end
95
-
end
96
-
else begin
97
-
let length = ref 0 in
98
-
for i = 0 to size_nibbles - 1 do
99
-
let next_nibble = Bit_reader.read_bits br 4 in
100
-
if i + 1 = size_nibbles && size_nibbles > 4 && next_nibble = 0 then
101
-
raise (Brotli_error Invalid_meta_block_header);
102
-
length := !length lor (next_nibble lsl (i * 4))
103
-
done;
104
-
let is_uncompressed =
105
-
if not input_end then Bit_reader.read_bits br 1 = 1
106
-
else false
107
-
in
108
-
{ meta_block_length = !length + 1; input_end; is_uncompressed; is_metadata = false }
109
-
end
110
-
end
111
-
112
-
(* Read Huffman code lengths *)
113
-
let read_huffman_code_lengths code_length_code_lengths num_symbols code_lengths br =
114
-
let symbol = ref 0 in
115
-
let prev_code_len = ref 8 in
116
-
let repeat = ref 0 in
117
-
let repeat_code_len = ref 0 in
118
-
let space = ref 32768 in
119
-
120
-
(* Build table for code length codes *)
121
-
let table = Huffman.build_table ~code_lengths:code_length_code_lengths
122
-
~alphabet_size:Constants.code_length_codes ~root_bits:5 in
123
-
124
-
while !symbol < num_symbols && !space > 0 do
125
-
let code_len = Huffman.read_symbol table 5 br in
126
-
if code_len < Constants.repeat_previous_code_length then begin
127
-
repeat := 0;
128
-
code_lengths.(!symbol) <- code_len;
129
-
incr symbol;
130
-
if code_len <> 0 then begin
131
-
prev_code_len := code_len;
132
-
space := !space - (0x8000 lsr code_len)
133
-
end
134
-
end
135
-
else begin
136
-
let extra_bits = code_len - 14 in
137
-
let new_len = if code_len = Constants.repeat_previous_code_length then !prev_code_len else 0 in
138
-
if !repeat_code_len <> new_len then begin
139
-
repeat := 0;
140
-
repeat_code_len := new_len
141
-
end;
142
-
let old_repeat = !repeat in
143
-
if !repeat > 0 then
144
-
repeat := (!repeat - 2) lsl extra_bits;
145
-
repeat := !repeat + Bit_reader.read_bits br extra_bits + 3;
146
-
let repeat_delta = !repeat - old_repeat in
147
-
if !symbol + repeat_delta > num_symbols then
148
-
raise (Brotli_error Invalid_huffman_code);
149
-
for _ = 0 to repeat_delta - 1 do
150
-
code_lengths.(!symbol) <- !repeat_code_len;
151
-
incr symbol
152
-
done;
153
-
if !repeat_code_len <> 0 then
154
-
space := !space - (repeat_delta lsl (15 - !repeat_code_len))
155
-
end
156
-
done;
157
-
158
-
if !space <> 0 then
159
-
raise (Brotli_error Invalid_huffman_code);
160
-
161
-
for i = !symbol to num_symbols - 1 do
162
-
code_lengths.(i) <- 0
163
-
done
164
-
165
-
(* Read a Huffman code from the stream *)
166
-
let read_huffman_code_with_bits alphabet_size root_bits br =
167
-
let code_lengths = Array.make alphabet_size 0 in
168
-
let simple_code_or_skip = Bit_reader.read_bits br 2 in
169
-
170
-
if simple_code_or_skip = 1 then begin
171
-
(* Simple prefix code *)
172
-
let max_bits = ref 0 in
173
-
let max_bits_counter = ref (alphabet_size - 1) in
174
-
while !max_bits_counter > 0 do
175
-
max_bits_counter := !max_bits_counter lsr 1;
176
-
incr max_bits
177
-
done;
178
-
179
-
let symbols = Array.make 4 0 in
180
-
let num_symbols = Bit_reader.read_bits br 2 + 1 in
181
-
182
-
for i = 0 to num_symbols - 1 do
183
-
symbols.(i) <- Bit_reader.read_bits br !max_bits mod alphabet_size;
184
-
code_lengths.(symbols.(i)) <- 2
185
-
done;
186
-
code_lengths.(symbols.(0)) <- 1;
187
-
188
-
if num_symbols = 2 then begin
189
-
if symbols.(0) = symbols.(1) then
190
-
raise (Brotli_error Invalid_huffman_code);
191
-
code_lengths.(symbols.(1)) <- 1
192
-
end
193
-
else if num_symbols = 4 then begin
194
-
if Bit_reader.read_bits br 1 = 1 then begin
195
-
code_lengths.(symbols.(2)) <- 3;
196
-
code_lengths.(symbols.(3)) <- 3
197
-
end
198
-
else
199
-
code_lengths.(symbols.(0)) <- 2
200
-
end;
201
-
202
-
Huffman.build_table ~code_lengths ~alphabet_size ~root_bits
203
-
end
204
-
else begin
205
-
(* Complex prefix code *)
206
-
let code_length_code_lengths = Array.make Constants.code_length_codes 0 in
207
-
let space = ref 32 in
208
-
let num_codes = ref 0 in
209
-
210
-
for i = simple_code_or_skip to Constants.code_length_codes - 1 do
211
-
if !space > 0 then begin
212
-
let code_len_idx = Constants.code_length_code_order.(i) in
213
-
let p = Bit_reader.peek_bits br 4 in
214
-
Bit_reader.skip_bits br code_length_huff.(p).bits;
215
-
let v = code_length_huff.(p).value in
216
-
code_length_code_lengths.(code_len_idx) <- v;
217
-
if v <> 0 then begin
218
-
space := !space - (32 lsr v);
219
-
incr num_codes
220
-
end
221
-
end
222
-
done;
223
-
224
-
if !num_codes <> 1 && !space <> 0 then
225
-
raise (Brotli_error Invalid_huffman_code);
226
-
227
-
read_huffman_code_lengths code_length_code_lengths alphabet_size code_lengths br;
228
-
229
-
(* Debug output removed for cleaner test output *)
230
-
231
-
Huffman.build_table ~code_lengths ~alphabet_size ~root_bits
232
-
end
233
-
234
-
let read_huffman_code alphabet_size br =
235
-
read_huffman_code_with_bits alphabet_size Constants.huffman_max_table_bits br
236
-
237
-
(* Read block length *)
238
-
let read_block_length table br =
239
-
let code = Huffman.read_symbol table Constants.huffman_max_table_bits br in
240
-
Prefix.decode_block_length br code
241
-
242
-
(* Translate distance short codes *)
243
-
let translate_short_codes code dist_rb dist_rb_idx =
244
-
if code < Constants.num_distance_short_codes then begin
245
-
let index = (dist_rb_idx + distance_short_code_index_offset.(code)) land 3 in
246
-
dist_rb.(index) + distance_short_code_value_offset.(code)
247
-
end
248
-
else
249
-
code - Constants.num_distance_short_codes + 1
250
-
251
-
(* Inverse move-to-front transform *)
252
-
let inverse_move_to_front_transform v v_len =
253
-
let mtf = Array.init 256 (fun i -> i) in
254
-
for i = 0 to v_len - 1 do
255
-
let index = v.(i) in
256
-
v.(i) <- mtf.(index);
257
-
if index > 0 then begin
258
-
let value = mtf.(index) in
259
-
for j = index downto 1 do
260
-
mtf.(j) <- mtf.(j - 1)
261
-
done;
262
-
mtf.(0) <- value
263
-
end
264
-
done
265
-
266
-
(* Decode context map *)
267
-
let decode_context_map context_map_size br =
268
-
let num_trees = decode_var_len_uint8 br + 1 in
269
-
let context_map = Array.make context_map_size 0 in
270
-
271
-
if num_trees <= 1 then
272
-
(num_trees, context_map)
273
-
else begin
274
-
let use_rle = Bit_reader.read_bits br 1 = 1 in
275
-
let max_rle_prefix = if use_rle then Bit_reader.read_bits br 4 + 1 else 0 in
276
-
let table = read_huffman_code (num_trees + max_rle_prefix) br in
277
-
278
-
let i = ref 0 in
279
-
while !i < context_map_size do
280
-
let code = Huffman.read_symbol table Constants.huffman_max_table_bits br in
281
-
if code = 0 then begin
282
-
context_map.(!i) <- 0;
283
-
incr i
284
-
end
285
-
else if code <= max_rle_prefix then begin
286
-
let reps = (1 lsl code) + Bit_reader.read_bits br code in
287
-
for _ = 0 to reps - 1 do
288
-
if !i >= context_map_size then
289
-
raise (Brotli_error Invalid_context_map);
290
-
context_map.(!i) <- 0;
291
-
incr i
292
-
done
293
-
end
294
-
else begin
295
-
context_map.(!i) <- code - max_rle_prefix;
296
-
incr i
297
-
end
298
-
done;
299
-
300
-
if Bit_reader.read_bits br 1 = 1 then
301
-
inverse_move_to_front_transform context_map context_map_size;
302
-
303
-
(num_trees, context_map)
304
-
end
305
-
306
-
(* Decode block type *)
307
-
let decode_block_type max_block_type table block_type_rb block_type_rb_idx br =
308
-
let type_code = Huffman.read_symbol table Constants.huffman_max_table_bits br in
309
-
let block_type =
310
-
if type_code = 0 then
311
-
block_type_rb.((!block_type_rb_idx) land 1)
312
-
else if type_code = 1 then
313
-
block_type_rb.(((!block_type_rb_idx) - 1) land 1) + 1
314
-
else
315
-
type_code - 2
316
-
in
317
-
let block_type =
318
-
if block_type >= max_block_type then block_type - max_block_type
319
-
else block_type
320
-
in
321
-
block_type_rb.((!block_type_rb_idx) land 1) <- block_type;
322
-
incr block_type_rb_idx;
323
-
block_type
324
-
325
-
(* Main decompression function *)
326
-
let decompress_into ~src ~src_pos ~src_len ~dst ~dst_pos =
327
-
let br = Bit_reader.create ~src ~pos:src_pos ~len:src_len in
328
-
let pos = ref dst_pos in
329
-
let max_backward_distance = ref 0 in
330
-
331
-
(* Distance ring buffer *)
332
-
let dist_rb = [| 16; 15; 11; 4 |] in
333
-
let dist_rb_idx = ref 0 in
334
-
335
-
(* Decode window bits *)
336
-
let window_bits = decode_window_bits br in
337
-
max_backward_distance := (1 lsl window_bits) - Constants.window_gap;
338
-
339
-
let input_end = ref false in
340
-
341
-
while not !input_end do
342
-
(* Decode meta-block header *)
343
-
let header = decode_meta_block_length br in
344
-
input_end := header.input_end;
345
-
346
-
if header.is_metadata then begin
347
-
(* Skip metadata block *)
348
-
Bit_reader.align_to_byte br;
349
-
for _ = 1 to header.meta_block_length do
350
-
ignore (Bit_reader.read_bits br 8)
351
-
done
352
-
end
353
-
else if header.meta_block_length > 0 then begin
354
-
if header.is_uncompressed then begin
355
-
(* Uncompressed block *)
356
-
Bit_reader.copy_bytes br ~dst ~dst_pos:!pos ~len:header.meta_block_length;
357
-
pos := !pos + header.meta_block_length
358
-
end
359
-
else begin
360
-
(* Compressed block *)
361
-
let meta_block_remaining = ref header.meta_block_length in
362
-
363
-
(* Decode block type counts and trees *)
364
-
let num_block_types = Array.make 3 1 in
365
-
let block_type = Array.make 3 0 in
366
-
let block_length = Array.make 3 (1 lsl 28) in
367
-
let block_type_rb = [| [| 0; 1 |]; [| 0; 1 |]; [| 0; 1 |] |] in
368
-
let block_type_rb_idx = [| ref 0; ref 0; ref 0 |] in
369
-
let block_type_trees = Array.make 3 [||] in
370
-
let block_len_trees = Array.make 3 [||] in
371
-
372
-
for i = 0 to 2 do
373
-
num_block_types.(i) <- decode_var_len_uint8 br + 1;
374
-
if num_block_types.(i) >= 2 then begin
375
-
block_type_trees.(i) <- read_huffman_code (num_block_types.(i) + 2) br;
376
-
block_len_trees.(i) <- read_huffman_code Constants.num_block_len_symbols br;
377
-
block_length.(i) <- read_block_length block_len_trees.(i) br;
378
-
block_type_rb_idx.(i) := 1
379
-
end
380
-
done;
381
-
382
-
(* Distance parameters *)
383
-
let distance_postfix_bits = Bit_reader.read_bits br 2 in
384
-
let num_direct_distance_codes =
385
-
Constants.num_distance_short_codes + (Bit_reader.read_bits br 4 lsl distance_postfix_bits) in
386
-
let distance_postfix_mask = (1 lsl distance_postfix_bits) - 1 in
387
-
let num_distance_codes = num_direct_distance_codes + (48 lsl distance_postfix_bits) in
388
-
389
-
(* Context modes for literal blocks *)
390
-
let context_modes = Array.make num_block_types.(0) 0 in
391
-
for i = 0 to num_block_types.(0) - 1 do
392
-
context_modes.(i) <- Bit_reader.read_bits br 2 lsl 1
393
-
done;
394
-
395
-
(* Decode context maps *)
396
-
let num_literal_trees, literal_context_map =
397
-
decode_context_map (num_block_types.(0) lsl Constants.literal_context_bits) br in
398
-
let num_dist_trees, dist_context_map =
399
-
decode_context_map (num_block_types.(2) lsl Constants.distance_context_bits) br in
400
-
401
-
(* Decode Huffman tree groups *)
402
-
let literal_trees = Array.init num_literal_trees (fun _ ->
403
-
read_huffman_code Constants.num_literal_symbols br) in
404
-
let command_trees = Array.init num_block_types.(1) (fun _ ->
405
-
read_huffman_code_with_bits Constants.num_command_symbols
406
-
Constants.huffman_max_command_table_bits br) in
407
-
let distance_trees = Array.init num_dist_trees (fun _ ->
408
-
read_huffman_code num_distance_codes br) in
409
-
410
-
(* Main decode loop *)
411
-
let context_map_slice = ref 0 in
412
-
let dist_context_map_slice = ref 0 in
413
-
let context_mode = ref context_modes.(block_type.(0)) in
414
-
let huff_tree_command = ref command_trees.(0) in
415
-
416
-
while !meta_block_remaining > 0 do
417
-
(* Check/update command block *)
418
-
if block_length.(1) = 0 then begin
419
-
block_type.(1) <- decode_block_type num_block_types.(1)
420
-
block_type_trees.(1) block_type_rb.(1) block_type_rb_idx.(1) br;
421
-
block_length.(1) <- read_block_length block_len_trees.(1) br;
422
-
huff_tree_command := command_trees.(block_type.(1))
423
-
end;
424
-
block_length.(1) <- block_length.(1) - 1;
425
-
426
-
(* Read command code *)
427
-
let cmd_code = Huffman.read_symbol !huff_tree_command Constants.huffman_max_command_table_bits br in
428
-
let range_idx = cmd_code lsr 6 in
429
-
let distance_code = ref (if range_idx >= 2 then -1 else 0) in
430
-
let range_idx = if range_idx >= 2 then range_idx - 2 else range_idx in
431
-
432
-
(* Decode insert and copy lengths *)
433
-
let insert_code = Prefix.insert_range_lut.(range_idx) + ((cmd_code lsr 3) land 7) in
434
-
let copy_code = Prefix.copy_range_lut.(range_idx) + (cmd_code land 7) in
435
-
let insert_length = Prefix.decode_insert_length br insert_code in
436
-
let copy_length = Prefix.decode_copy_length br copy_code in
437
-
438
-
(* Get context bytes *)
439
-
let prev_byte1 = if !pos > dst_pos then Char.code (Bytes.get dst (!pos - 1)) else 0 in
440
-
let prev_byte2 = if !pos > dst_pos + 1 then Char.code (Bytes.get dst (!pos - 2)) else 0 in
441
-
let prev_byte1 = ref prev_byte1 in
442
-
let prev_byte2 = ref prev_byte2 in
443
-
444
-
(* Insert literals *)
445
-
for _ = 0 to insert_length - 1 do
446
-
if block_length.(0) = 0 then begin
447
-
block_type.(0) <- decode_block_type num_block_types.(0)
448
-
block_type_trees.(0) block_type_rb.(0) block_type_rb_idx.(0) br;
449
-
block_length.(0) <- read_block_length block_len_trees.(0) br;
450
-
context_map_slice := block_type.(0) lsl Constants.literal_context_bits;
451
-
context_mode := context_modes.(block_type.(0))
452
-
end;
453
-
let context = Context.get_context (Context.mode_of_int (!context_mode lsr 1))
454
-
~prev_byte1:!prev_byte1 ~prev_byte2:!prev_byte2 in
455
-
let tree_idx = literal_context_map.(!context_map_slice + context) in
456
-
block_length.(0) <- block_length.(0) - 1;
457
-
prev_byte2 := !prev_byte1;
458
-
let literal = Huffman.read_symbol literal_trees.(tree_idx) Constants.huffman_max_table_bits br in
459
-
prev_byte1 := literal;
460
-
if !pos >= Bytes.length dst then
461
-
raise (Brotli_error Output_overrun);
462
-
Bytes.set dst !pos (Char.chr literal);
463
-
incr pos
464
-
done;
465
-
466
-
meta_block_remaining := !meta_block_remaining - insert_length;
467
-
if !meta_block_remaining <= 0 then
468
-
() (* Break from loop *)
469
-
else begin
470
-
(* Decode distance if needed *)
471
-
if !distance_code < 0 then begin
472
-
if block_length.(2) = 0 then begin
473
-
block_type.(2) <- decode_block_type num_block_types.(2)
474
-
block_type_trees.(2) block_type_rb.(2) block_type_rb_idx.(2) br;
475
-
block_length.(2) <- read_block_length block_len_trees.(2) br;
476
-
dist_context_map_slice := block_type.(2) lsl Constants.distance_context_bits
477
-
end;
478
-
block_length.(2) <- block_length.(2) - 1;
479
-
let context = Context.distance_context copy_length in
480
-
let tree_idx = dist_context_map.(!dist_context_map_slice + context) in
481
-
distance_code := Huffman.read_symbol distance_trees.(tree_idx) Constants.huffman_max_table_bits br;
482
-
483
-
if !distance_code >= num_direct_distance_codes then begin
484
-
distance_code := !distance_code - num_direct_distance_codes;
485
-
let postfix = !distance_code land distance_postfix_mask in
486
-
distance_code := !distance_code lsr distance_postfix_bits;
487
-
let nbits = (!distance_code lsr 1) + 1 in
488
-
let offset = ((2 + (!distance_code land 1)) lsl nbits) - 4 in
489
-
distance_code := num_direct_distance_codes +
490
-
((offset + Bit_reader.read_bits br nbits) lsl distance_postfix_bits) + postfix
491
-
end
492
-
end;
493
-
494
-
(* Convert distance code to actual distance *)
495
-
let distance = translate_short_codes !distance_code dist_rb !dist_rb_idx in
496
-
if distance < 0 then
497
-
raise (Brotli_error Invalid_distance);
498
-
499
-
let max_distance = min !max_backward_distance (!pos - dst_pos) in
500
-
501
-
if distance > max_distance then begin
502
-
(* Dictionary reference *)
503
-
if copy_length >= Constants.min_dictionary_word_length &&
504
-
copy_length <= Constants.max_dictionary_word_length then begin
505
-
let word_id = distance - max_distance - 1 in
506
-
let shift = Dictionary.size_bits_by_length.(copy_length) in
507
-
let mask = (1 lsl shift) - 1 in
508
-
let word_idx = word_id land mask in
509
-
let transform_idx = word_id lsr shift in
510
-
if transform_idx < Transform.num_transforms then begin
511
-
if !pos + copy_length > Bytes.length dst then
512
-
raise (Brotli_error Output_overrun);
513
-
let length = Transform.transform_dictionary_word
514
-
~dst ~dst_pos:!pos ~word_index:word_idx
515
-
~word_length:copy_length ~transform_id:transform_idx in
516
-
pos := !pos + length;
517
-
meta_block_remaining := !meta_block_remaining - length
518
-
end
519
-
else
520
-
raise (Brotli_error Invalid_backward_reference)
521
-
end
522
-
else
523
-
raise (Brotli_error Invalid_backward_reference)
524
-
end
525
-
else begin
526
-
(* Regular backward reference *)
527
-
if !distance_code > 0 then begin
528
-
dist_rb.(!dist_rb_idx land 3) <- distance;
529
-
incr dist_rb_idx
530
-
end;
531
-
532
-
if copy_length > !meta_block_remaining then
533
-
raise (Brotli_error Invalid_backward_reference);
534
-
535
-
if !pos + copy_length > Bytes.length dst then
536
-
raise (Brotli_error Output_overrun);
537
-
538
-
(* Optimized copy: use blit when distance >= copy_length *)
539
-
if distance >= copy_length then begin
540
-
Bytes.blit dst (!pos - distance) dst !pos copy_length;
541
-
pos := !pos + copy_length;
542
-
meta_block_remaining := !meta_block_remaining - copy_length
543
-
end else begin
544
-
(* Overlapping copy - must do byte by byte *)
545
-
for _ = 0 to copy_length - 1 do
546
-
Bytes.set dst !pos (Bytes.get dst (!pos - distance));
547
-
incr pos;
548
-
decr meta_block_remaining
549
-
done
550
-
end
551
-
end
552
-
end
553
-
done
554
-
end
555
-
end
556
-
done;
557
-
558
-
!pos - dst_pos
-1044
ocaml-brotli/src/brotli_encode.ml
-1044
ocaml-brotli/src/brotli_encode.ml
···
1
-
(* Brotli compression implementation *)
2
-
(* Supports quality levels 0-11 with context modeling, block splitting, and optimal parsing *)
3
-
4
-
(* Re-export from LZ77 for backward compatibility *)
5
-
let min_match = Lz77.min_match
6
-
7
-
(* Number of literal contexts *)
8
-
let num_literal_contexts = 64
9
-
10
-
(* Insert length code tables *)
11
-
let insert_length_n_bits = [|
12
-
0; 0; 0; 0; 0; 0; 1; 1; 2; 2; 3; 3; 4; 4; 5; 5; 6; 7; 8; 9; 10; 12; 14; 24
13
-
|]
14
-
15
-
let insert_length_offset = [|
16
-
0; 1; 2; 3; 4; 5; 6; 8; 10; 14; 18; 26; 34; 50; 66; 98; 130; 194; 322; 578; 1090; 2114; 6210; 22594
17
-
|]
18
-
19
-
(* Get insert length code *)
20
-
let get_insert_code length =
21
-
let rec find i =
22
-
if i >= 23 then 23
23
-
else if length < insert_length_offset.(i + 1) then i
24
-
else find (i + 1)
25
-
in
26
-
find 0
27
-
28
-
(* Get copy length code *)
29
-
let get_copy_code length =
30
-
let copy_length_offset = [|
31
-
2; 3; 4; 5; 6; 7; 8; 9; 10; 12; 14; 18; 22; 30; 38; 54; 70; 102; 134; 198; 326; 582; 1094; 2118
32
-
|] in
33
-
let rec find i =
34
-
if i >= 23 then 23
35
-
else if length < copy_length_offset.(i + 1) then i
36
-
else find (i + 1)
37
-
in
38
-
find 0
39
-
40
-
(* Command code lookup tables from RFC 7932 *)
41
-
let insert_range_lut = [| 0; 0; 8; 8; 0; 16; 8; 16; 16 |]
42
-
let copy_range_lut = [| 0; 8; 0; 8; 16; 0; 16; 8; 16 |]
43
-
44
-
(* Build command code from insert_code and copy_code.
45
-
use_implicit_distance: true ONLY for distance code 0 (last distance)
46
-
47
-
Per RFC 7932, command codes have range_idx in bits 7-6:
48
-
- range_idx 0-1 (cmd_code 0-127): Distance code 0 is IMPLICIT (not read from stream)
49
-
The decoder automatically uses distance code 0 (last used distance).
50
-
- range_idx 2-8 (cmd_code 128+): Distance code is EXPLICIT (read from stream)
51
-
Short codes 0-15 and long codes >= 16 are all written explicitly.
52
-
53
-
IMPORTANT: Only dist_code=Some 0 can use implicit distance (range_idx 0-1).
54
-
For all other short codes (1-15), we must use explicit distance (range_idx >= 2).
55
-
*)
56
-
let get_command_code insert_code copy_code use_implicit_distance =
57
-
let found = ref None in
58
-
59
-
(* Only use range_idx 0-1 for implicit distance code 0 *)
60
-
if use_implicit_distance then begin
61
-
for r = 0 to 1 do
62
-
if !found = None then begin
63
-
let insert_base = insert_range_lut.(r) in
64
-
let copy_base = copy_range_lut.(r) in
65
-
let insert_delta = insert_code - insert_base in
66
-
let copy_delta = copy_code - copy_base in
67
-
if insert_delta >= 0 && insert_delta < 8 &&
68
-
copy_delta >= 0 && copy_delta < 8 then begin
69
-
let cmd_code = (r lsl 6) lor (insert_delta lsl 3) lor copy_delta in
70
-
found := Some cmd_code
71
-
end
72
-
end
73
-
done
74
-
end;
75
-
76
-
(* Use range_idx 2-8 for explicit distance (including short codes 0-15) *)
77
-
if !found = None then begin
78
-
for r = 2 to 8 do
79
-
if !found = None then begin
80
-
let adjusted_r = r - 2 in
81
-
let insert_base = insert_range_lut.(adjusted_r) in
82
-
let copy_base = copy_range_lut.(adjusted_r) in
83
-
let insert_delta = insert_code - insert_base in
84
-
let copy_delta = copy_code - copy_base in
85
-
if insert_delta >= 0 && insert_delta < 8 &&
86
-
copy_delta >= 0 && copy_delta < 8 then begin
87
-
let cmd_code = (r lsl 6) lor (insert_delta lsl 3) lor copy_delta in
88
-
found := Some cmd_code
89
-
end
90
-
end
91
-
done
92
-
end;
93
-
94
-
match !found with
95
-
| Some cmd_code -> cmd_code
96
-
| None ->
97
-
(* Fallback - shouldn't happen if LZ77 limits copy_len properly *)
98
-
let insert_delta = min insert_code 7 in
99
-
let copy_delta = min copy_code 7 in
100
-
(2 lsl 6) lor (insert_delta lsl 3) lor copy_delta
101
-
102
-
(* Encode window bits *)
103
-
let encode_window_bits bw =
104
-
Bit_writer.write_bits bw 1 1;
105
-
Bit_writer.write_bits bw 3 5 (* 22-bit window *)
106
-
107
-
(* Write empty last block *)
108
-
let write_empty_last_block bw =
109
-
Bit_writer.write_bits bw 1 1;
110
-
Bit_writer.write_bits bw 1 1
111
-
112
-
(* Write meta-block header *)
113
-
let write_meta_block_header bw length is_last is_uncompressed =
114
-
Bit_writer.write_bits bw 1 (if is_last then 1 else 0);
115
-
if is_last then
116
-
Bit_writer.write_bits bw 1 0; (* ISEMPTY = 0 for non-empty last block *)
117
-
let nibbles = if length - 1 < (1 lsl 16) then 4 else if length - 1 < (1 lsl 20) then 5 else 6 in
118
-
Bit_writer.write_bits bw 2 (nibbles - 4);
119
-
for i = 0 to nibbles - 1 do
120
-
Bit_writer.write_bits bw 4 (((length - 1) lsr (i * 4)) land 0xF)
121
-
done;
122
-
if not is_last then
123
-
Bit_writer.write_bits bw 1 (if is_uncompressed then 1 else 0)
124
-
125
-
(* Write uncompressed block *)
126
-
let write_uncompressed_block bw src src_pos length =
127
-
write_meta_block_header bw length false true;
128
-
Bit_writer.align_to_byte bw;
129
-
Bit_writer.copy_bytes bw ~src ~src_pos ~len:length
130
-
131
-
(* Count bits needed to represent values 0 to n-1 (ceiling of log2(n)) *)
132
-
let count_bits n =
133
-
if n <= 1 then 0
134
-
else
135
-
let rec count v b = if v = 0 then b else count (v lsr 1) (b + 1) in
136
-
count (n - 1) 0
137
-
138
-
(* Write simple prefix code - 1 to 4 symbols *)
139
-
let write_simple_prefix_code bw symbols alphabet_size =
140
-
let n = Array.length symbols in
141
-
Bit_writer.write_bits bw 2 1; (* HSKIP = 1 means simple code *)
142
-
Bit_writer.write_bits bw 2 (n - 1); (* NSYM - 1 *)
143
-
let bits = count_bits (alphabet_size - 1) in
144
-
for i = 0 to n - 1 do
145
-
Bit_writer.write_bits bw bits symbols.(i)
146
-
done;
147
-
if n = 4 then Bit_writer.write_bits bw 1 0
148
-
149
-
(* Static Huffman code for code lengths *)
150
-
let write_code_length_symbol bw len =
151
-
match len with
152
-
| 0 -> Bit_writer.write_bits bw 2 0
153
-
| 1 -> Bit_writer.write_bits bw 4 7
154
-
| 2 -> Bit_writer.write_bits bw 3 3
155
-
| 3 -> Bit_writer.write_bits bw 2 2
156
-
| 4 -> Bit_writer.write_bits bw 2 1
157
-
| 5 -> Bit_writer.write_bits bw 4 15
158
-
| _ -> Bit_writer.write_bits bw 2 0
159
-
160
-
(* Build valid Huffman code lengths using Kraft inequality *)
161
-
let build_valid_code_lengths freqs max_len =
162
-
let n = Array.length freqs in
163
-
let lengths = Array.make n 0 in
164
-
let symbols = ref [] in
165
-
for i = n - 1 downto 0 do
166
-
if freqs.(i) > 0 then
167
-
symbols := (freqs.(i), i) :: !symbols
168
-
done;
169
-
let num_symbols = List.length !symbols in
170
-
if num_symbols = 0 then lengths
171
-
else if num_symbols = 1 then begin
172
-
let (_, sym) = List.hd !symbols in
173
-
lengths.(sym) <- 1;
174
-
lengths
175
-
end
176
-
else begin
177
-
let sorted = List.sort (fun (f1, _) (f2, _) -> compare f2 f1) !symbols in
178
-
let bits_needed = count_bits num_symbols in
179
-
let base_len = min max_len (max bits_needed 1) in
180
-
let len_to_use = ref base_len in
181
-
while (1 lsl !len_to_use) < num_symbols && !len_to_use < max_len do
182
-
incr len_to_use
183
-
done;
184
-
let slots_used = ref num_symbols in
185
-
let total_slots = 1 lsl !len_to_use in
186
-
List.iter (fun (_, sym) ->
187
-
let extra_slots = total_slots - !slots_used in
188
-
if extra_slots > 0 && !len_to_use > 1 then begin
189
-
let shorter_len = !len_to_use - 1 in
190
-
let extra_needed = (1 lsl (!len_to_use - shorter_len)) - 1 in
191
-
if extra_slots >= extra_needed then begin
192
-
lengths.(sym) <- shorter_len;
193
-
slots_used := !slots_used + extra_needed
194
-
end else
195
-
lengths.(sym) <- !len_to_use
196
-
end else
197
-
lengths.(sym) <- !len_to_use
198
-
) sorted;
199
-
lengths
200
-
end
201
-
202
-
(* Build canonical Huffman codes from lengths *)
203
-
let build_codes lengths =
204
-
let n = Array.length lengths in
205
-
let codes = Array.make n 0 in
206
-
let max_len = Array.fold_left max 0 lengths in
207
-
if max_len = 0 then codes
208
-
else begin
209
-
let bl_count = Array.make (max_len + 1) 0 in
210
-
Array.iter (fun l -> if l > 0 then bl_count.(l) <- bl_count.(l) + 1) lengths;
211
-
let next_code = Array.make (max_len + 1) 0 in
212
-
let code = ref 0 in
213
-
for bits = 1 to max_len do
214
-
code := (!code + bl_count.(bits - 1)) lsl 1;
215
-
next_code.(bits) <- !code
216
-
done;
217
-
for i = 0 to n - 1 do
218
-
let len = lengths.(i) in
219
-
if len > 0 then begin
220
-
codes.(i) <- next_code.(len);
221
-
next_code.(len) <- next_code.(len) + 1
222
-
end
223
-
done;
224
-
codes
225
-
end
226
-
227
-
(* Reverse bits for canonical Huffman *)
228
-
let reverse_bits v n =
229
-
let r = ref 0 in
230
-
let v = ref v in
231
-
for _ = 0 to n - 1 do
232
-
r := (!r lsl 1) lor (!v land 1);
233
-
v := !v lsr 1
234
-
done;
235
-
!r
236
-
237
-
(* Write a Huffman symbol *)
238
-
let write_symbol bw codes lengths sym =
239
-
let len = lengths.(sym) in
240
-
if len > 0 then
241
-
Bit_writer.write_bits bw len (reverse_bits codes.(sym) len)
242
-
243
-
(* RLE encoding for code lengths *)
244
-
let emit_zeros_rle symbols_ref extras_ref total_ref run_len =
245
-
if run_len < 3 then begin
246
-
for _ = 1 to run_len do
247
-
symbols_ref := 0 :: !symbols_ref;
248
-
extras_ref := 0 :: !extras_ref;
249
-
incr total_ref
250
-
done
251
-
end else begin
252
-
let reps = ref (run_len - 3) in
253
-
let rec build acc_codes acc_extras =
254
-
let e = !reps land 7 in
255
-
reps := !reps lsr 3;
256
-
if !reps = 0 then
257
-
(17 :: acc_codes, e :: acc_extras)
258
-
else begin
259
-
reps := !reps - 1;
260
-
build (17 :: acc_codes) (e :: acc_extras)
261
-
end
262
-
in
263
-
let (codes, extras) = build [] [] in
264
-
List.iter2 (fun c e ->
265
-
symbols_ref := c :: !symbols_ref;
266
-
extras_ref := e :: !extras_ref
267
-
) codes extras;
268
-
total_ref := !total_ref + run_len
269
-
end
270
-
271
-
let emit_nonzero_rle symbols_ref extras_ref total_ref run_len prev_value_ref value =
272
-
let to_write = ref run_len in
273
-
if !prev_value_ref <> value then begin
274
-
symbols_ref := value :: !symbols_ref;
275
-
extras_ref := 0 :: !extras_ref;
276
-
prev_value_ref := value;
277
-
decr to_write;
278
-
incr total_ref
279
-
end;
280
-
if !to_write < 3 then begin
281
-
for _ = 1 to !to_write do
282
-
symbols_ref := value :: !symbols_ref;
283
-
extras_ref := 0 :: !extras_ref
284
-
done;
285
-
total_ref := !total_ref + !to_write
286
-
end else begin
287
-
let reps = ref (!to_write - 3) in
288
-
let rec build acc_codes acc_extras =
289
-
let e = !reps land 3 in
290
-
reps := !reps lsr 2;
291
-
if !reps = 0 then
292
-
(16 :: acc_codes, e :: acc_extras)
293
-
else begin
294
-
reps := !reps - 1;
295
-
build (16 :: acc_codes) (e :: acc_extras)
296
-
end
297
-
in
298
-
let (codes, extras) = build [] [] in
299
-
List.iter2 (fun c e ->
300
-
symbols_ref := c :: !symbols_ref;
301
-
extras_ref := e :: !extras_ref
302
-
) codes extras;
303
-
total_ref := !total_ref + !to_write
304
-
end
305
-
306
-
let generate_rle_sequence lengths num_symbols =
307
-
let symbols = ref [] in
308
-
let extras = ref [] in
309
-
let prev_value = ref 8 in
310
-
let total = ref 0 in
311
-
let i = ref 0 in
312
-
while !i < num_symbols do
313
-
let value = if !i < Array.length lengths then lengths.(!i) else 0 in
314
-
let run_start = !i in
315
-
while !i < num_symbols &&
316
-
(if !i < Array.length lengths then lengths.(!i) else 0) = value do
317
-
incr i
318
-
done;
319
-
let run_len = !i - run_start in
320
-
if value = 0 then
321
-
emit_zeros_rle symbols extras total run_len
322
-
else
323
-
emit_nonzero_rle symbols extras total run_len prev_value value
324
-
done;
325
-
let syms = Array.of_list (List.rev !symbols) in
326
-
let exts = Array.of_list (List.rev !extras) in
327
-
(syms, exts)
328
-
329
-
(* Write complex prefix code with RLE encoding *)
330
-
let write_complex_prefix_code bw lengths alphabet_size =
331
-
let last_nonzero = ref (-1) in
332
-
for i = 0 to min (alphabet_size - 1) (Array.length lengths - 1) do
333
-
if lengths.(i) > 0 then last_nonzero := i
334
-
done;
335
-
let num_symbols = !last_nonzero + 1 in
336
-
let (rle_symbols, rle_extra) = generate_rle_sequence lengths num_symbols in
337
-
let cl_histogram = Array.make Constants.code_length_codes 0 in
338
-
Array.iter (fun sym -> cl_histogram.(sym) <- cl_histogram.(sym) + 1) rle_symbols;
339
-
let cl_depths = build_valid_code_lengths cl_histogram Constants.huffman_max_code_length_code_length in
340
-
let num_codes = ref 0 in
341
-
for i = 0 to Constants.code_length_codes - 1 do
342
-
if cl_histogram.(i) > 0 then incr num_codes
343
-
done;
344
-
let skip_some =
345
-
if cl_depths.(Constants.code_length_code_order.(0)) = 0 &&
346
-
cl_depths.(Constants.code_length_code_order.(1)) = 0 then
347
-
if cl_depths.(Constants.code_length_code_order.(2)) = 0 then 3
348
-
else 2
349
-
else 0
350
-
in
351
-
let codes_to_store = ref Constants.code_length_codes in
352
-
if !num_codes > 1 then begin
353
-
while !codes_to_store > 0 &&
354
-
cl_depths.(Constants.code_length_code_order.(!codes_to_store - 1)) = 0 do
355
-
decr codes_to_store
356
-
done
357
-
end;
358
-
Bit_writer.write_bits bw 2 skip_some;
359
-
let space = ref 32 in
360
-
for i = skip_some to !codes_to_store - 1 do
361
-
if !space > 0 then begin
362
-
let idx = Constants.code_length_code_order.(i) in
363
-
let l = cl_depths.(idx) in
364
-
write_code_length_symbol bw l;
365
-
if l <> 0 then
366
-
space := !space - (32 lsr l)
367
-
end
368
-
done;
369
-
let cl_codes = build_codes cl_depths in
370
-
for i = 0 to Array.length rle_symbols - 1 do
371
-
let sym = rle_symbols.(i) in
372
-
if !num_codes > 1 then
373
-
write_symbol bw cl_codes cl_depths sym;
374
-
if sym = 16 then
375
-
Bit_writer.write_bits bw 2 rle_extra.(i)
376
-
else if sym = 17 then
377
-
Bit_writer.write_bits bw 3 rle_extra.(i)
378
-
done
379
-
380
-
(* Write Huffman code definition - choose simple or complex *)
381
-
let write_huffman_code bw lengths alphabet_size =
382
-
let symbols = ref [] in
383
-
for i = 0 to min (alphabet_size - 1) (Array.length lengths - 1) do
384
-
if i < Array.length lengths && lengths.(i) > 0 then
385
-
symbols := (i, lengths.(i)) :: !symbols
386
-
done;
387
-
let sorted = List.sort (fun (s1, l1) (s2, l2) ->
388
-
let c = compare l1 l2 in
389
-
if c <> 0 then c else compare s1 s2
390
-
) !symbols in
391
-
let symbols = Array.of_list (List.map fst sorted) in
392
-
let num_symbols = Array.length symbols in
393
-
if num_symbols = 0 then
394
-
write_simple_prefix_code bw [|0|] alphabet_size
395
-
else if num_symbols <= 4 then
396
-
write_simple_prefix_code bw symbols alphabet_size
397
-
else
398
-
write_complex_prefix_code bw lengths alphabet_size
399
-
400
-
(* Count used symbols in frequency array *)
401
-
let count_used_symbols freqs =
402
-
let count = ref 0 in
403
-
Array.iter (fun f -> if f > 0 then incr count) freqs;
404
-
!count
405
-
406
-
(* Write context map using RLE and IMTF encoding *)
407
-
(* Encode a variable length uint8 (matches decode_var_len_uint8 in decoder) *)
408
-
let write_var_len_uint8 bw n =
409
-
if n = 0 then
410
-
Bit_writer.write_bits bw 1 0
411
-
else if n = 1 then begin
412
-
Bit_writer.write_bits bw 1 1;
413
-
Bit_writer.write_bits bw 3 0 (* nbits = 0 means value 1 *)
414
-
end else begin
415
-
Bit_writer.write_bits bw 1 1;
416
-
(* Find nbits such that (1 << nbits) <= n < (1 << (nbits + 1)) *)
417
-
let rec find_nbits nb =
418
-
if n < (1 lsl (nb + 1)) then nb
419
-
else find_nbits (nb + 1)
420
-
in
421
-
let nbits = find_nbits 1 in
422
-
Bit_writer.write_bits bw 3 nbits;
423
-
Bit_writer.write_bits bw nbits (n - (1 lsl nbits))
424
-
end
425
-
426
-
let write_context_map bw context_map num_trees =
427
-
(* Write NTREES - 1 using variable length encoding *)
428
-
write_var_len_uint8 bw (num_trees - 1);
429
-
430
-
if num_trees > 1 then begin
431
-
(* Write RLEMAX flag: 0 = no RLE *)
432
-
Bit_writer.write_bits bw 1 0;
433
-
434
-
(* With RLEMAX=0, alphabet size is just num_trees, symbols are values directly *)
435
-
let map_len = Array.length context_map in
436
-
let freq = Array.make num_trees 0 in
437
-
for i = 0 to map_len - 1 do
438
-
freq.(context_map.(i)) <- freq.(context_map.(i)) + 1
439
-
done;
440
-
441
-
(* Build Huffman code for context map values *)
442
-
let lengths = build_valid_code_lengths freq 15 in
443
-
let codes = build_codes lengths in
444
-
445
-
(* Write the Huffman code for num_trees symbols *)
446
-
write_huffman_code bw lengths num_trees;
447
-
448
-
(* Write the context map values *)
449
-
let num_symbols = count_used_symbols freq in
450
-
for i = 0 to map_len - 1 do
451
-
if num_symbols > 1 then
452
-
write_symbol bw codes lengths context_map.(i)
453
-
done;
454
-
455
-
(* Write IMTF flag: 0 = no inverse move-to-front *)
456
-
Bit_writer.write_bits bw 1 0
457
-
end
458
-
459
-
(* Copy length extra bits table *)
460
-
let copy_length_n_bits = [|
461
-
0; 0; 0; 0; 0; 0; 0; 0; 1; 1; 2; 2; 3; 3; 4; 4; 5; 5; 6; 7; 8; 9; 10; 24
462
-
|]
463
-
464
-
let copy_length_offset = [|
465
-
2; 3; 4; 5; 6; 7; 8; 9; 10; 12; 14; 18; 22; 30; 38; 54; 70; 102; 134; 198; 326; 582; 1094; 2118
466
-
|]
467
-
468
-
(* Encode distance for NPOSTFIX=0, NDIRECT=0 *)
469
-
let encode_distance distance =
470
-
if distance < 1 then
471
-
(16, 1, 0)
472
-
else begin
473
-
let d = distance - 1 in
474
-
let nbits = ref 1 in
475
-
let range_start = ref 0 in
476
-
while d >= !range_start + (1 lsl (!nbits + 1)) && !nbits < 24 do
477
-
range_start := !range_start + (1 lsl (!nbits + 1));
478
-
incr nbits
479
-
done;
480
-
let half_size = 1 lsl !nbits in
481
-
let d_in_range = d - !range_start in
482
-
let lcode = if d_in_range >= half_size then 1 else 0 in
483
-
let dc = 2 * (!nbits - 1) + lcode in
484
-
let code = 16 + dc in
485
-
let extra = d_in_range - (lcode * half_size) in
486
-
(code, !nbits, extra)
487
-
end
488
-
489
-
(* Quality level for dictionary matching *)
490
-
let current_quality = ref 1
491
-
492
-
(* Write a compressed block with context modeling for quality >= 5 *)
493
-
let write_compressed_block_with_context bw src _src_pos _src_len is_last context_mode context_map num_lit_trees num_dist_trees dist_context_map commands =
494
-
let num_distance_codes = 16 + 48 in
495
-
496
-
(* Count frequencies for context-aware literal encoding *)
497
-
let lit_freqs = Array.init num_lit_trees (fun _ -> Array.make 256 0) in
498
-
let cmd_freq = Array.make 704 0 in
499
-
(* Distance frequencies per tree *)
500
-
let dist_freqs = Array.init num_dist_trees (fun _ -> Array.make num_distance_codes 0) in
501
-
502
-
(* Track previous bytes for context calculation *)
503
-
let prev1 = ref 0 in
504
-
let prev2 = ref 0 in
505
-
506
-
(* Helper to get distance code value *)
507
-
let get_dist_code_val dist_code distance =
508
-
match dist_code with
509
-
| Some code -> code
510
-
| None ->
511
-
let dist_code_val, _, _ = encode_distance distance in
512
-
min dist_code_val (num_distance_codes - 1)
513
-
in
514
-
515
-
(* Count literals with context and build command/distance frequencies *)
516
-
List.iter (fun cmd ->
517
-
match cmd with
518
-
| Lz77.Literals { start; len } ->
519
-
for i = start to start + len - 1 do
520
-
let c = Char.code (Bytes.get src i) in
521
-
let ctx_id = Context.get_context context_mode ~prev_byte1:!prev1 ~prev_byte2:!prev2 in
522
-
let tree_id = context_map.(ctx_id) in
523
-
lit_freqs.(tree_id).(c) <- lit_freqs.(tree_id).(c) + 1;
524
-
prev2 := !prev1;
525
-
prev1 := c
526
-
done;
527
-
let insert_code = get_insert_code len in
528
-
let copy_code = 0 in
529
-
let cmd_code = get_command_code insert_code copy_code false in
530
-
cmd_freq.(cmd_code) <- cmd_freq.(cmd_code) + 1;
531
-
(* Literals command with copy_code=0 has copy_len=2, so dist context = 0 *)
532
-
let dist_tree = dist_context_map.(0) in
533
-
dist_freqs.(dist_tree).(0) <- dist_freqs.(dist_tree).(0) + 1
534
-
| Lz77.InsertCopy { lit_start; lit_len; copy_len; distance; dist_code } ->
535
-
for i = lit_start to lit_start + lit_len - 1 do
536
-
let c = Char.code (Bytes.get src i) in
537
-
let ctx_id = Context.get_context context_mode ~prev_byte1:!prev1 ~prev_byte2:!prev2 in
538
-
let tree_id = context_map.(ctx_id) in
539
-
lit_freqs.(tree_id).(c) <- lit_freqs.(tree_id).(c) + 1;
540
-
prev2 := !prev1;
541
-
prev1 := c
542
-
done;
543
-
let insert_code = get_insert_code lit_len in
544
-
let copy_code = get_copy_code copy_len in
545
-
let use_implicit = dist_code = Some 0 in
546
-
let cmd_code = get_command_code insert_code copy_code use_implicit in
547
-
let range_idx = cmd_code lsr 6 in
548
-
cmd_freq.(cmd_code) <- cmd_freq.(cmd_code) + 1;
549
-
if range_idx >= 2 then begin
550
-
let dist_ctx = Context.distance_context copy_len in
551
-
let dist_tree = dist_context_map.(dist_ctx) in
552
-
let code_val = get_dist_code_val dist_code distance in
553
-
dist_freqs.(dist_tree).(code_val) <- dist_freqs.(dist_tree).(code_val) + 1
554
-
end
555
-
) commands;
556
-
557
-
(* Build Huffman codes for each literal tree *)
558
-
let lit_lengths_arr = Array.init num_lit_trees (fun i ->
559
-
build_valid_code_lengths lit_freqs.(i) 15
560
-
) in
561
-
let lit_codes_arr = Array.init num_lit_trees (fun i ->
562
-
build_codes lit_lengths_arr.(i)
563
-
) in
564
-
let cmd_lengths = build_valid_code_lengths cmd_freq 15 in
565
-
let cmd_codes = build_codes cmd_lengths in
566
-
(* Build Huffman codes for each distance tree *)
567
-
let dist_lengths_arr = Array.init num_dist_trees (fun i ->
568
-
build_valid_code_lengths dist_freqs.(i) 15
569
-
) in
570
-
let dist_codes_arr = Array.init num_dist_trees (fun i ->
571
-
build_codes dist_lengths_arr.(i)
572
-
) in
573
-
574
-
(* Calculate total uncompressed size *)
575
-
let total_len = List.fold_left (fun acc cmd ->
576
-
match cmd with
577
-
| Lz77.Literals { len; _ } -> acc + len
578
-
| Lz77.InsertCopy { lit_len; copy_len; _ } -> acc + lit_len + copy_len
579
-
) 0 commands in
580
-
581
-
(* Write meta-block header *)
582
-
write_meta_block_header bw total_len is_last false;
583
-
584
-
(* Block type counts: 1 for each category *)
585
-
Bit_writer.write_bits bw 1 0; (* NBLTYPESL = 1 *)
586
-
Bit_writer.write_bits bw 1 0; (* NBLTYPESI = 1 *)
587
-
Bit_writer.write_bits bw 1 0; (* NBLTYPESD = 1 *)
588
-
589
-
(* Distance parameters: NPOSTFIX=0, NDIRECT=0 *)
590
-
Bit_writer.write_bits bw 2 0;
591
-
Bit_writer.write_bits bw 4 0;
592
-
593
-
(* Context mode for literal block type 0 *)
594
-
Bit_writer.write_bits bw 2 (Context.int_of_mode context_mode);
595
-
596
-
(* Literal context map *)
597
-
write_context_map bw context_map num_lit_trees;
598
-
599
-
(* Distance context map: 4 contexts per block type *)
600
-
write_context_map bw dist_context_map num_dist_trees;
601
-
602
-
(* Write Huffman codes for all literal trees *)
603
-
for i = 0 to num_lit_trees - 1 do
604
-
write_huffman_code bw lit_lengths_arr.(i) 256
605
-
done;
606
-
write_huffman_code bw cmd_lengths 704;
607
-
(* Write Huffman codes for all distance trees *)
608
-
for i = 0 to num_dist_trees - 1 do
609
-
write_huffman_code bw dist_lengths_arr.(i) num_distance_codes
610
-
done;
611
-
612
-
(* Write commands with context-aware literal and distance encoding *)
613
-
let num_cmd_symbols = count_used_symbols cmd_freq in
614
-
prev1 := 0;
615
-
prev2 := 0;
616
-
617
-
List.iter (fun cmd ->
618
-
match cmd with
619
-
| Lz77.Literals { start; len } ->
620
-
let insert_code = get_insert_code len in
621
-
let copy_code = 0 in
622
-
let cmd_code = get_command_code insert_code copy_code false in
623
-
if num_cmd_symbols > 1 then
624
-
write_symbol bw cmd_codes cmd_lengths cmd_code;
625
-
if insert_length_n_bits.(insert_code) > 0 then begin
626
-
let extra = len - insert_length_offset.(insert_code) in
627
-
Bit_writer.write_bits bw insert_length_n_bits.(insert_code) extra
628
-
end;
629
-
for i = start to start + len - 1 do
630
-
let c = Char.code (Bytes.get src i) in
631
-
let ctx_id = Context.get_context context_mode ~prev_byte1:!prev1 ~prev_byte2:!prev2 in
632
-
let tree_id = context_map.(ctx_id) in
633
-
let num_symbols = count_used_symbols lit_freqs.(tree_id) in
634
-
if num_symbols > 1 then
635
-
write_symbol bw lit_codes_arr.(tree_id) lit_lengths_arr.(tree_id) c;
636
-
prev2 := !prev1;
637
-
prev1 := c
638
-
done
639
-
640
-
| Lz77.InsertCopy { lit_start; lit_len; copy_len; distance; dist_code } ->
641
-
let insert_code = get_insert_code lit_len in
642
-
let copy_code = get_copy_code copy_len in
643
-
let use_implicit = dist_code = Some 0 in
644
-
let cmd_code = get_command_code insert_code copy_code use_implicit in
645
-
let range_idx = cmd_code lsr 6 in
646
-
if num_cmd_symbols > 1 then
647
-
write_symbol bw cmd_codes cmd_lengths cmd_code;
648
-
if insert_length_n_bits.(insert_code) > 0 then begin
649
-
let extra = lit_len - insert_length_offset.(insert_code) in
650
-
Bit_writer.write_bits bw insert_length_n_bits.(insert_code) extra
651
-
end;
652
-
if copy_length_n_bits.(copy_code) > 0 then begin
653
-
let extra = copy_len - copy_length_offset.(copy_code) in
654
-
Bit_writer.write_bits bw copy_length_n_bits.(copy_code) extra
655
-
end;
656
-
for i = lit_start to lit_start + lit_len - 1 do
657
-
let c = Char.code (Bytes.get src i) in
658
-
let ctx_id = Context.get_context context_mode ~prev_byte1:!prev1 ~prev_byte2:!prev2 in
659
-
let tree_id = context_map.(ctx_id) in
660
-
let num_symbols = count_used_symbols lit_freqs.(tree_id) in
661
-
if num_symbols > 1 then
662
-
write_symbol bw lit_codes_arr.(tree_id) lit_lengths_arr.(tree_id) c;
663
-
prev2 := !prev1;
664
-
prev1 := c
665
-
done;
666
-
if range_idx >= 2 then begin
667
-
let dist_ctx = Context.distance_context copy_len in
668
-
let dist_tree = dist_context_map.(dist_ctx) in
669
-
let num_dist_symbols = count_used_symbols dist_freqs.(dist_tree) in
670
-
match dist_code with
671
-
| Some code ->
672
-
if num_dist_symbols > 1 then
673
-
write_symbol bw dist_codes_arr.(dist_tree) dist_lengths_arr.(dist_tree) code
674
-
| None ->
675
-
let dist_code_val, nbits, extra = encode_distance distance in
676
-
if num_dist_symbols > 1 then
677
-
write_symbol bw dist_codes_arr.(dist_tree) dist_lengths_arr.(dist_tree) dist_code_val;
678
-
if nbits > 0 then
679
-
Bit_writer.write_bits bw nbits extra
680
-
end
681
-
) commands
682
-
683
-
(* Write a compressed block with LZ77 commands *)
684
-
let write_compressed_block bw src src_pos src_len is_last =
685
-
(* Dictionary matching provides additional compression for text content *)
686
-
let use_dict = !current_quality >= 3 in
687
-
let quality = !current_quality in
688
-
689
-
(* Generate commands using LZ77 or optimal parsing *)
690
-
let commands =
691
-
if quality >= 10 then
692
-
(* Use optimal greedy parsing with lazy matching for quality 10-11 *)
693
-
Optimal.generate_commands ~quality src src_pos src_len
694
-
else
695
-
(* Standard LZ77 for lower quality levels *)
696
-
Lz77.generate_commands ~use_dict ~quality src src_pos src_len
697
-
in
698
-
699
-
(* Use context modeling for quality >= 5 *)
700
-
if quality >= 5 then begin
701
-
let context_mode = Block_split.choose_context_mode src src_pos src_len in
702
-
(* For quality >= 7 with enough data, use multiple literal trees *)
703
-
let (context_map, num_lit_trees) =
704
-
if quality >= 7 && src_len >= 1024 then begin
705
-
let max_trees = if quality >= 9 then 4 else 2 in
706
-
let (cmap, _histograms, ntrees) =
707
-
Block_split.build_literal_context_map context_mode src src_pos src_len max_trees
708
-
in
709
-
(cmap, ntrees)
710
-
end else
711
-
(Array.make 64 0, 1)
712
-
in
713
-
(* Distance context map: 4 contexts based on copy_length *)
714
-
(* For now, use single distance tree (infrastructure ready for multiple) *)
715
-
let dist_context_map = Array.make 4 0 in
716
-
let num_dist_trees = 1 in
717
-
write_compressed_block_with_context bw src src_pos src_len is_last
718
-
context_mode context_map num_lit_trees num_dist_trees dist_context_map commands
719
-
end else begin
720
-
(* Original simple encoding for quality < 5 *)
721
-
722
-
(* Count frequencies for all three alphabets *)
723
-
let lit_freq = Array.make 256 0 in
724
-
let cmd_freq = Array.make 704 0 in
725
-
let num_distance_codes = 16 + 48 in
726
-
let dist_freq = Array.make num_distance_codes 0 in
727
-
728
-
(* Count literals and build command/distance frequencies *)
729
-
List.iter (fun cmd ->
730
-
match cmd with
731
-
| Lz77.Literals { start; len } ->
732
-
for i = start to start + len - 1 do
733
-
let c = Char.code (Bytes.get src i) in
734
-
lit_freq.(c) <- lit_freq.(c) + 1
735
-
done;
736
-
let insert_code = get_insert_code len in
737
-
let copy_code = 0 in
738
-
let cmd_code = get_command_code insert_code copy_code false in
739
-
cmd_freq.(cmd_code) <- cmd_freq.(cmd_code) + 1;
740
-
(* range_idx for Literals command with copy_code=0 is >= 2, so we need distance *)
741
-
dist_freq.(0) <- dist_freq.(0) + 1
742
-
| Lz77.InsertCopy { lit_start; lit_len; copy_len; distance; dist_code } ->
743
-
for i = lit_start to lit_start + lit_len - 1 do
744
-
let c = Char.code (Bytes.get src i) in
745
-
lit_freq.(c) <- lit_freq.(c) + 1
746
-
done;
747
-
let insert_code = get_insert_code lit_len in
748
-
let copy_code = get_copy_code copy_len in
749
-
(* Only dist_code=Some 0 can use implicit distance (range_idx 0-1) *)
750
-
let use_implicit = dist_code = Some 0 in
751
-
let cmd_code = get_command_code insert_code copy_code use_implicit in
752
-
let range_idx = cmd_code lsr 6 in
753
-
cmd_freq.(cmd_code) <- cmd_freq.(cmd_code) + 1;
754
-
(* Count distance code if range_idx >= 2 (explicit distance) *)
755
-
if range_idx >= 2 then begin
756
-
match dist_code with
757
-
| Some code -> dist_freq.(code) <- dist_freq.(code) + 1
758
-
| None ->
759
-
let dist_code_val, _, _ = encode_distance distance in
760
-
if dist_code_val < num_distance_codes then
761
-
dist_freq.(dist_code_val) <- dist_freq.(dist_code_val) + 1
762
-
else
763
-
dist_freq.(num_distance_codes - 1) <- dist_freq.(num_distance_codes - 1) + 1
764
-
end
765
-
(* For range_idx 0-1, distance code 0 is implicit, don't count *)
766
-
) commands;
767
-
768
-
(* Build Huffman codes *)
769
-
let lit_lengths = build_valid_code_lengths lit_freq 15 in
770
-
let lit_codes = build_codes lit_lengths in
771
-
let cmd_lengths = build_valid_code_lengths cmd_freq 15 in
772
-
let cmd_codes = build_codes cmd_lengths in
773
-
let dist_lengths = build_valid_code_lengths dist_freq 15 in
774
-
let dist_codes = build_codes dist_lengths in
775
-
776
-
(* Calculate total uncompressed size for meta-block header *)
777
-
let total_len = List.fold_left (fun acc cmd ->
778
-
match cmd with
779
-
| Lz77.Literals { len; _ } -> acc + len
780
-
| Lz77.InsertCopy { lit_len; copy_len; _ } -> acc + lit_len + copy_len
781
-
) 0 commands in
782
-
783
-
(* Write meta-block header *)
784
-
write_meta_block_header bw total_len is_last false;
785
-
786
-
(* Block type counts: 1 for each category *)
787
-
Bit_writer.write_bits bw 1 0;
788
-
Bit_writer.write_bits bw 1 0;
789
-
Bit_writer.write_bits bw 1 0;
790
-
791
-
(* Distance parameters: NPOSTFIX=0, NDIRECT=0 *)
792
-
Bit_writer.write_bits bw 2 0;
793
-
Bit_writer.write_bits bw 4 0;
794
-
795
-
(* Context mode for literal block type 0: LSB6 = 0 *)
796
-
Bit_writer.write_bits bw 2 0;
797
-
798
-
(* Literal context map: NTREESL = 1 tree *)
799
-
Bit_writer.write_bits bw 1 0;
800
-
801
-
(* Distance context map: NTREESD = 1 tree *)
802
-
Bit_writer.write_bits bw 1 0;
803
-
804
-
(* Write Huffman codes *)
805
-
write_huffman_code bw lit_lengths 256;
806
-
write_huffman_code bw cmd_lengths 704;
807
-
write_huffman_code bw dist_lengths num_distance_codes;
808
-
809
-
(* Write commands *)
810
-
let num_lit_symbols = count_used_symbols lit_freq in
811
-
let num_cmd_symbols = count_used_symbols cmd_freq in
812
-
let num_dist_symbols = count_used_symbols dist_freq in
813
-
814
-
List.iter (fun cmd ->
815
-
match cmd with
816
-
| Lz77.Literals { start; len } ->
817
-
let insert_code = get_insert_code len in
818
-
let copy_code = 0 in
819
-
let cmd_code = get_command_code insert_code copy_code false in
820
-
if num_cmd_symbols > 1 then
821
-
write_symbol bw cmd_codes cmd_lengths cmd_code;
822
-
if insert_length_n_bits.(insert_code) > 0 then begin
823
-
let extra = len - insert_length_offset.(insert_code) in
824
-
Bit_writer.write_bits bw insert_length_n_bits.(insert_code) extra
825
-
end;
826
-
if num_lit_symbols > 1 then begin
827
-
for i = start to start + len - 1 do
828
-
let c = Char.code (Bytes.get src i) in
829
-
write_symbol bw lit_codes lit_lengths c
830
-
done
831
-
end
832
-
833
-
| Lz77.InsertCopy { lit_start; lit_len; copy_len; distance; dist_code } ->
834
-
let insert_code = get_insert_code lit_len in
835
-
let copy_code = get_copy_code copy_len in
836
-
(* Only dist_code=Some 0 can use implicit distance (range_idx 0-1) *)
837
-
let use_implicit = dist_code = Some 0 in
838
-
let cmd_code = get_command_code insert_code copy_code use_implicit in
839
-
let range_idx = cmd_code lsr 6 in
840
-
if num_cmd_symbols > 1 then
841
-
write_symbol bw cmd_codes cmd_lengths cmd_code;
842
-
if insert_length_n_bits.(insert_code) > 0 then begin
843
-
let extra = lit_len - insert_length_offset.(insert_code) in
844
-
Bit_writer.write_bits bw insert_length_n_bits.(insert_code) extra
845
-
end;
846
-
if copy_length_n_bits.(copy_code) > 0 then begin
847
-
let extra = copy_len - copy_length_offset.(copy_code) in
848
-
Bit_writer.write_bits bw copy_length_n_bits.(copy_code) extra
849
-
end;
850
-
if num_lit_symbols > 1 then begin
851
-
for i = lit_start to lit_start + lit_len - 1 do
852
-
let c = Char.code (Bytes.get src i) in
853
-
write_symbol bw lit_codes lit_lengths c
854
-
done
855
-
end;
856
-
(* Write distance code.
857
-
For range_idx 0-1 (command codes 0-127), the decoder uses implicit distance code 0
858
-
and does NOT read from the stream. For range_idx >= 2, we must write the distance code. *)
859
-
if range_idx >= 2 then begin
860
-
match dist_code with
861
-
| Some code ->
862
-
(* Short codes 0-15 - just write the code, no extra bits *)
863
-
if num_dist_symbols > 1 then
864
-
write_symbol bw dist_codes dist_lengths code
865
-
| None ->
866
-
let dist_code_val, nbits, extra = encode_distance distance in
867
-
if num_dist_symbols > 1 then
868
-
write_symbol bw dist_codes dist_lengths dist_code_val;
869
-
if nbits > 0 then
870
-
Bit_writer.write_bits bw nbits extra
871
-
end
872
-
(* For range_idx 0-1, distance code 0 is implicit, don't write anything *)
873
-
) commands
874
-
end
875
-
876
-
(* Write a compressed block with only literals *)
877
-
let write_literals_only_block bw src src_pos src_len is_last =
878
-
write_meta_block_header bw src_len is_last false;
879
-
Bit_writer.write_bits bw 1 0;
880
-
Bit_writer.write_bits bw 1 0;
881
-
Bit_writer.write_bits bw 1 0;
882
-
Bit_writer.write_bits bw 2 0;
883
-
Bit_writer.write_bits bw 4 0;
884
-
Bit_writer.write_bits bw 2 0;
885
-
Bit_writer.write_bits bw 1 0;
886
-
Bit_writer.write_bits bw 1 0;
887
-
888
-
let lit_freq = Array.make 256 0 in
889
-
for i = src_pos to src_pos + src_len - 1 do
890
-
let c = Char.code (Bytes.get src i) in
891
-
lit_freq.(c) <- lit_freq.(c) + 1
892
-
done;
893
-
let num_lit_symbols = count_used_symbols lit_freq in
894
-
let lit_lengths = build_valid_code_lengths lit_freq 15 in
895
-
let lit_codes = build_codes lit_lengths in
896
-
897
-
let insert_code = get_insert_code src_len in
898
-
let copy_code = 0 in
899
-
let cmd_code = get_command_code insert_code copy_code false in
900
-
let cmd_freq = Array.make 704 0 in
901
-
cmd_freq.(cmd_code) <- 1;
902
-
let cmd_lengths = build_valid_code_lengths cmd_freq 15 in
903
-
904
-
let num_distance_codes = 16 + 48 in
905
-
let dist_freq = Array.make num_distance_codes 0 in
906
-
dist_freq.(0) <- 1;
907
-
let dist_lengths = build_valid_code_lengths dist_freq 15 in
908
-
909
-
write_huffman_code bw lit_lengths 256;
910
-
write_huffman_code bw cmd_lengths 704;
911
-
write_huffman_code bw dist_lengths num_distance_codes;
912
-
913
-
if insert_length_n_bits.(insert_code) > 0 then begin
914
-
let extra = src_len - insert_length_offset.(insert_code) in
915
-
Bit_writer.write_bits bw insert_length_n_bits.(insert_code) extra
916
-
end;
917
-
918
-
if num_lit_symbols > 1 then begin
919
-
for i = src_pos to src_pos + src_len - 1 do
920
-
let c = Char.code (Bytes.get src i) in
921
-
write_symbol bw lit_codes lit_lengths c
922
-
done
923
-
end
924
-
925
-
(* Main compression function *)
926
-
let compress_into ?(quality=1) ~src ~src_pos ~src_len ~dst ~dst_pos () =
927
-
current_quality := quality;
928
-
let bw = Bit_writer.create ~dst ~pos:dst_pos ~len:(Bytes.length dst - dst_pos) in
929
-
encode_window_bits bw;
930
-
931
-
if src_len = 0 then begin
932
-
write_empty_last_block bw;
933
-
Bit_writer.flush bw - dst_pos
934
-
end
935
-
else if quality = 0 || src_len < 16 then begin
936
-
write_uncompressed_block bw src src_pos src_len;
937
-
write_empty_last_block bw;
938
-
Bit_writer.flush bw - dst_pos
939
-
end
940
-
else begin
941
-
try
942
-
if quality >= 2 && src_len >= min_match then
943
-
write_compressed_block bw src src_pos src_len true
944
-
else
945
-
write_literals_only_block bw src src_pos src_len true;
946
-
Bit_writer.flush bw - dst_pos
947
-
with _ ->
948
-
let bw = Bit_writer.create ~dst ~pos:dst_pos ~len:(Bytes.length dst - dst_pos) in
949
-
encode_window_bits bw;
950
-
write_uncompressed_block bw src src_pos src_len;
951
-
write_empty_last_block bw;
952
-
Bit_writer.flush bw - dst_pos
953
-
end
954
-
955
-
let max_compressed_length input_len =
956
-
input_len + input_len / 8 + 64
957
-
958
-
(* Streaming encoder state *)
959
-
type streaming_encoder = {
960
-
mutable quality : int;
961
-
mutable dst : bytes;
962
-
mutable dst_pos : int;
963
-
mutable header_written : bool;
964
-
mutable finished : bool;
965
-
}
966
-
967
-
let create_streaming_encoder ?(quality=1) ~dst ~dst_pos () =
968
-
{ quality; dst; dst_pos; header_written = false; finished = false }
969
-
970
-
(* Write a chunk of data to the streaming encoder *)
971
-
let streaming_write encoder ~src ~src_pos ~src_len ~is_last =
972
-
if encoder.finished then
973
-
invalid_arg "streaming encoder already finished";
974
-
975
-
current_quality := encoder.quality;
976
-
let bw = Bit_writer.create ~dst:encoder.dst ~pos:encoder.dst_pos
977
-
~len:(Bytes.length encoder.dst - encoder.dst_pos) in
978
-
979
-
(* Write header on first chunk *)
980
-
if not encoder.header_written then begin
981
-
encode_window_bits bw;
982
-
encoder.header_written <- true
983
-
end;
984
-
985
-
if src_len = 0 then begin
986
-
if is_last then begin
987
-
write_empty_last_block bw;
988
-
encoder.finished <- true
989
-
end
990
-
end
991
-
else if encoder.quality = 0 || src_len < 16 then begin
992
-
(* For low quality or small blocks, write uncompressed *)
993
-
if is_last then begin
994
-
write_uncompressed_block bw src src_pos src_len;
995
-
write_empty_last_block bw;
996
-
encoder.finished <- true
997
-
end else begin
998
-
(* Non-last uncompressed block *)
999
-
write_meta_block_header bw src_len false true;
1000
-
Bit_writer.align_to_byte bw;
1001
-
Bit_writer.copy_bytes bw ~src ~src_pos ~len:src_len
1002
-
end
1003
-
end
1004
-
else begin
1005
-
try
1006
-
if encoder.quality >= 2 && src_len >= min_match then
1007
-
write_compressed_block bw src src_pos src_len is_last
1008
-
else
1009
-
write_literals_only_block bw src src_pos src_len is_last;
1010
-
if is_last then encoder.finished <- true
1011
-
with _ ->
1012
-
(* Fallback to uncompressed *)
1013
-
if is_last then begin
1014
-
write_uncompressed_block bw src src_pos src_len;
1015
-
write_empty_last_block bw;
1016
-
encoder.finished <- true
1017
-
end else begin
1018
-
write_meta_block_header bw src_len false true;
1019
-
Bit_writer.align_to_byte bw;
1020
-
Bit_writer.copy_bytes bw ~src ~src_pos ~len:src_len
1021
-
end
1022
-
end;
1023
-
1024
-
let written = Bit_writer.flush bw - encoder.dst_pos in
1025
-
encoder.dst_pos <- encoder.dst_pos + written;
1026
-
written
1027
-
1028
-
let streaming_finish encoder =
1029
-
if not encoder.finished then begin
1030
-
let result = streaming_write encoder ~src:(Bytes.create 0) ~src_pos:0 ~src_len:0 ~is_last:true in
1031
-
encoder.finished <- true;
1032
-
result
1033
-
end else 0
1034
-
1035
-
let streaming_bytes_written encoder =
1036
-
encoder.dst_pos
1037
-
1038
-
(* Re-export command type for Debug module *)
1039
-
type command = Lz77.command =
1040
-
| InsertCopy of { lit_start: int; lit_len: int; copy_len: int; distance: int; dist_code: int option }
1041
-
| Literals of { start: int; len: int }
1042
-
1043
-
let generate_commands src src_pos src_len =
1044
-
Lz77.generate_commands src src_pos src_len
-112
ocaml-brotli/src/constants.ml
-112
ocaml-brotli/src/constants.ml
···
1
-
(* Brotli format constants from RFC 7932 *)
2
-
3
-
(* Specification: 2. Compressed representation overview *)
4
-
let max_number_of_block_types = 256
5
-
6
-
(* Specification: 3.3. Alphabet sizes *)
7
-
let num_literal_symbols = 256
8
-
let num_command_symbols = 704
9
-
let num_block_len_symbols = 26
10
-
let num_ins_copy_codes = 24
11
-
12
-
(* Specification: 3.5. Complex prefix codes *)
13
-
let repeat_previous_code_length = 16
14
-
let repeat_zero_code_length = 17
15
-
let code_length_codes = 18 (* repeat_zero_code_length + 1 *)
16
-
let initial_repeated_code_length = 8
17
-
18
-
(* Specification: 7.3. Encoding of the context map *)
19
-
let context_map_max_rle = 16
20
-
let max_context_map_symbols = max_number_of_block_types + context_map_max_rle
21
-
let max_block_type_symbols = max_number_of_block_types + 2
22
-
23
-
(* Specification: 7.1. Context modes and context ID lookup for literals *)
24
-
let literal_context_bits = 6
25
-
let num_literal_contexts = 1 lsl literal_context_bits (* 64 *)
26
-
27
-
(* Specification: 7.2. Context ID for distances *)
28
-
let distance_context_bits = 2
29
-
let num_distance_contexts = 1 lsl distance_context_bits (* 4 *)
30
-
31
-
(* Specification: 4. Encoding of distances *)
32
-
let num_distance_short_codes = 16
33
-
let max_npostfix = 3
34
-
let max_ndirect = 120
35
-
let max_distance_bits = 24
36
-
37
-
(* Large window brotli *)
38
-
let large_max_distance_bits = 62
39
-
let large_min_wbits = 10
40
-
let large_max_wbits = 30
41
-
42
-
(* Calculate distance alphabet size *)
43
-
let distance_alphabet_size ~npostfix ~ndirect ~max_nbits =
44
-
num_distance_short_codes + ndirect + (max_nbits lsl (npostfix + 1))
45
-
46
-
(* Standard distance alphabet size *)
47
-
let num_distance_symbols =
48
-
distance_alphabet_size ~npostfix:max_npostfix ~ndirect:max_ndirect
49
-
~max_nbits:large_max_distance_bits
50
-
51
-
(* Maximum expressible distance with NPOSTFIX=0, NDIRECT=0 *)
52
-
let max_distance = 0x3FFFFFC (* (1 lsl 26) - 4 *)
53
-
54
-
(* Specification: 9.1. Format of the Stream Header *)
55
-
let window_gap = 16
56
-
let min_window_bits = 10
57
-
let max_window_bits = 24
58
-
59
-
let max_backward_limit wbits = (1 lsl wbits) - window_gap
60
-
61
-
(* Huffman coding constants *)
62
-
let huffman_max_code_length = 15
63
-
let huffman_max_code_length_code_length = 5
64
-
let huffman_max_table_bits = 8 (* Root table size for literals *)
65
-
let huffman_max_command_table_bits = 10 (* Root table size for commands *)
66
-
67
-
(* Code length code order (RFC 7932 section 3.5) *)
68
-
let code_length_code_order = [|
69
-
1; 2; 3; 4; 0; 5; 17; 6; 16; 7; 8; 9; 10; 11; 12; 13; 14; 15
70
-
|]
71
-
72
-
(* Minimum dictionary word length *)
73
-
let min_dictionary_word_length = 4
74
-
let max_dictionary_word_length = 24
75
-
76
-
(* Number of transforms *)
77
-
let num_transforms = 121
78
-
79
-
(* ============================================================
80
-
Shared utility functions
81
-
============================================================ *)
82
-
83
-
(* Hash multiplier for 4-byte hash functions (from brotli-c) *)
84
-
let hash_multiplier = 0x1e35a7bd
85
-
86
-
(* Fast log2 approximation matching brotli-c FastLog2.
87
-
Returns floor(log2(v)) as a float, or 0.0 for v <= 0. *)
88
-
let[@inline always] fast_log2 v =
89
-
if v <= 0 then 0.0
90
-
else
91
-
let rec log2_floor v acc = if v <= 1 then acc else log2_floor (v lsr 1) (acc + 1) in
92
-
float_of_int (log2_floor v 0)
93
-
94
-
(* Hash a 4-byte sequence from a bytes buffer.
95
-
Returns a hash value with the specified number of bits. *)
96
-
let[@inline always] hash4_bytes src pos bits =
97
-
let b0 = Char.code (Bytes.unsafe_get src pos) in
98
-
let b1 = Char.code (Bytes.unsafe_get src (pos + 1)) in
99
-
let b2 = Char.code (Bytes.unsafe_get src (pos + 2)) in
100
-
let b3 = Char.code (Bytes.unsafe_get src (pos + 3)) in
101
-
let v = b0 lor (b1 lsl 8) lor (b2 lsl 16) lor (b3 lsl 24) in
102
-
((v * hash_multiplier) land 0xFFFFFFFF) lsr (32 - bits)
103
-
104
-
(* Hash a 4-byte sequence from a string.
105
-
Returns a hash value with the specified number of bits. *)
106
-
let[@inline always] hash4_string s pos bits =
107
-
let b0 = Char.code (String.unsafe_get s pos) in
108
-
let b1 = Char.code (String.unsafe_get s (pos + 1)) in
109
-
let b2 = Char.code (String.unsafe_get s (pos + 2)) in
110
-
let b3 = Char.code (String.unsafe_get s (pos + 3)) in
111
-
let v = b0 lor (b1 lsl 8) lor (b2 lsl 16) lor (b3 lsl 24) in
112
-
((v * hash_multiplier) land 0xFFFFFFFF) lsr (32 - bits)
-171
ocaml-brotli/src/context.ml
-171
ocaml-brotli/src/context.ml
···
1
-
(* Context modeling lookup tables for Brotli (RFC 7932 Section 7) *)
2
-
3
-
(* Context modes *)
4
-
type mode = LSB6 | MSB6 | UTF8 | SIGNED
5
-
6
-
let mode_of_int = function
7
-
| 0 -> LSB6
8
-
| 1 -> MSB6
9
-
| 2 -> UTF8
10
-
| 3 -> SIGNED
11
-
| _ -> invalid_arg "Invalid context mode"
12
-
13
-
let int_of_mode = function
14
-
| LSB6 -> 0
15
-
| MSB6 -> 1
16
-
| UTF8 -> 2
17
-
| SIGNED -> 3
18
-
19
-
(* The master lookup table - all context modes combined *)
20
-
let lookup = [|
21
-
(* CONTEXT_UTF8, last byte (offset 0) *)
22
-
(* ASCII range *)
23
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 4; 4; 0; 0; 4; 0; 0;
24
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
25
-
8; 12; 16; 12; 12; 20; 12; 16; 24; 28; 12; 12; 32; 12; 36; 12;
26
-
44; 44; 44; 44; 44; 44; 44; 44; 44; 44; 32; 32; 24; 40; 28; 12;
27
-
12; 48; 52; 52; 52; 48; 52; 52; 52; 48; 52; 52; 52; 52; 52; 48;
28
-
52; 52; 52; 52; 52; 48; 52; 52; 52; 52; 52; 24; 12; 28; 12; 12;
29
-
12; 56; 60; 60; 60; 56; 60; 60; 60; 56; 60; 60; 60; 60; 60; 56;
30
-
60; 60; 60; 60; 60; 56; 60; 60; 60; 60; 60; 24; 12; 28; 12; 0;
31
-
(* UTF8 continuation byte range *)
32
-
0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1;
33
-
0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1;
34
-
0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1;
35
-
0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1; 0; 1;
36
-
(* UTF8 lead byte range *)
37
-
2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3;
38
-
2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3;
39
-
2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3;
40
-
2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3; 2; 3;
41
-
42
-
(* CONTEXT_UTF8 second last byte (offset 256) *)
43
-
(* ASCII range *)
44
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
45
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
46
-
0; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1;
47
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 1; 1; 1; 1; 1; 1;
48
-
1; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2;
49
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 1; 1; 1; 1; 1;
50
-
1; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3;
51
-
3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 1; 1; 1; 1; 0;
52
-
(* UTF8 continuation byte range *)
53
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
54
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
55
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
56
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
57
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
58
-
(* UTF8 lead byte range *)
59
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
60
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2;
61
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2;
62
-
63
-
(* CONTEXT_SIGNED, second last byte (offset 512) *)
64
-
0; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1; 1;
65
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2;
66
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2;
67
-
2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2; 2;
68
-
3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3;
69
-
3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3;
70
-
3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3;
71
-
3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3; 3;
72
-
4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4;
73
-
4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4;
74
-
4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4;
75
-
4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4; 4;
76
-
5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5;
77
-
5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5;
78
-
5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5; 5;
79
-
6; 6; 6; 6; 6; 6; 6; 6; 6; 6; 6; 6; 6; 6; 6; 7;
80
-
81
-
(* CONTEXT_SIGNED, last byte (offset 768) - same as above shifted by 3 bits *)
82
-
0; 8; 8; 8; 8; 8; 8; 8; 8; 8; 8; 8; 8; 8; 8; 8;
83
-
16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16;
84
-
16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16;
85
-
16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16; 16;
86
-
24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24;
87
-
24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24;
88
-
24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24;
89
-
24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24; 24;
90
-
32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32;
91
-
32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32;
92
-
32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32;
93
-
32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32; 32;
94
-
40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40;
95
-
40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40;
96
-
40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40; 40;
97
-
48; 48; 48; 48; 48; 48; 48; 48; 48; 48; 48; 48; 48; 48; 48; 56;
98
-
99
-
(* CONTEXT_LSB6, last byte (offset 1024) *)
100
-
0; 1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 12; 13; 14; 15;
101
-
16; 17; 18; 19; 20; 21; 22; 23; 24; 25; 26; 27; 28; 29; 30; 31;
102
-
32; 33; 34; 35; 36; 37; 38; 39; 40; 41; 42; 43; 44; 45; 46; 47;
103
-
48; 49; 50; 51; 52; 53; 54; 55; 56; 57; 58; 59; 60; 61; 62; 63;
104
-
0; 1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 12; 13; 14; 15;
105
-
16; 17; 18; 19; 20; 21; 22; 23; 24; 25; 26; 27; 28; 29; 30; 31;
106
-
32; 33; 34; 35; 36; 37; 38; 39; 40; 41; 42; 43; 44; 45; 46; 47;
107
-
48; 49; 50; 51; 52; 53; 54; 55; 56; 57; 58; 59; 60; 61; 62; 63;
108
-
0; 1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 12; 13; 14; 15;
109
-
16; 17; 18; 19; 20; 21; 22; 23; 24; 25; 26; 27; 28; 29; 30; 31;
110
-
32; 33; 34; 35; 36; 37; 38; 39; 40; 41; 42; 43; 44; 45; 46; 47;
111
-
48; 49; 50; 51; 52; 53; 54; 55; 56; 57; 58; 59; 60; 61; 62; 63;
112
-
0; 1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11; 12; 13; 14; 15;
113
-
16; 17; 18; 19; 20; 21; 22; 23; 24; 25; 26; 27; 28; 29; 30; 31;
114
-
32; 33; 34; 35; 36; 37; 38; 39; 40; 41; 42; 43; 44; 45; 46; 47;
115
-
48; 49; 50; 51; 52; 53; 54; 55; 56; 57; 58; 59; 60; 61; 62; 63;
116
-
117
-
(* CONTEXT_MSB6, last byte (offset 1280) *)
118
-
0; 0; 0; 0; 1; 1; 1; 1; 2; 2; 2; 2; 3; 3; 3; 3;
119
-
4; 4; 4; 4; 5; 5; 5; 5; 6; 6; 6; 6; 7; 7; 7; 7;
120
-
8; 8; 8; 8; 9; 9; 9; 9; 10; 10; 10; 10; 11; 11; 11; 11;
121
-
12; 12; 12; 12; 13; 13; 13; 13; 14; 14; 14; 14; 15; 15; 15; 15;
122
-
16; 16; 16; 16; 17; 17; 17; 17; 18; 18; 18; 18; 19; 19; 19; 19;
123
-
20; 20; 20; 20; 21; 21; 21; 21; 22; 22; 22; 22; 23; 23; 23; 23;
124
-
24; 24; 24; 24; 25; 25; 25; 25; 26; 26; 26; 26; 27; 27; 27; 27;
125
-
28; 28; 28; 28; 29; 29; 29; 29; 30; 30; 30; 30; 31; 31; 31; 31;
126
-
32; 32; 32; 32; 33; 33; 33; 33; 34; 34; 34; 34; 35; 35; 35; 35;
127
-
36; 36; 36; 36; 37; 37; 37; 37; 38; 38; 38; 38; 39; 39; 39; 39;
128
-
40; 40; 40; 40; 41; 41; 41; 41; 42; 42; 42; 42; 43; 43; 43; 43;
129
-
44; 44; 44; 44; 45; 45; 45; 45; 46; 46; 46; 46; 47; 47; 47; 47;
130
-
48; 48; 48; 48; 49; 49; 49; 49; 50; 50; 50; 50; 51; 51; 51; 51;
131
-
52; 52; 52; 52; 53; 53; 53; 53; 54; 54; 54; 54; 55; 55; 55; 55;
132
-
56; 56; 56; 56; 57; 57; 57; 57; 58; 58; 58; 58; 59; 59; 59; 59;
133
-
60; 60; 60; 60; 61; 61; 61; 61; 62; 62; 62; 62; 63; 63; 63; 63;
134
-
135
-
(* CONTEXT_{M,L}SB6, second last byte (offset 1536) - all zeros *)
136
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
137
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
138
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
139
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
140
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
141
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
142
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
143
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
144
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
145
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
146
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
147
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
148
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
149
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
150
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
151
-
0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0; 0;
152
-
|]
153
-
154
-
(* Offsets into lookup table for each mode *)
155
-
let lookup_offsets = [|
156
-
(* LSB6 *) 1024; 1536;
157
-
(* MSB6 *) 1280; 1536;
158
-
(* UTF8 *) 0; 256;
159
-
(* SIGNED *) 768; 512;
160
-
|]
161
-
162
-
(* Get context ID from previous two bytes *)
163
-
let[@inline] get_context mode ~prev_byte1 ~prev_byte2 =
164
-
let mode_idx = int_of_mode mode in
165
-
let offset1 = lookup_offsets.(mode_idx * 2) in
166
-
let offset2 = lookup_offsets.(mode_idx * 2 + 1) in
167
-
lookup.(offset1 + prev_byte1) lor lookup.(offset2 + prev_byte2)
168
-
169
-
(* Distance context based on copy length *)
170
-
let[@inline] distance_context copy_length =
171
-
if copy_length > 4 then 3 else copy_length - 2
-130
ocaml-brotli/src/dict_match.ml
-130
ocaml-brotli/src/dict_match.ml
···
1
-
(* Dictionary matching for Brotli encoder *)
2
-
3
-
(* Hash table configuration *)
4
-
let hash_bits = 17
5
-
let hash_size = 1 lsl hash_bits (* 128K entries *)
6
-
7
-
(* Dictionary hash table entry: (word_length, word_index) list *)
8
-
type dict_entry = (int * int) list
9
-
10
-
(* Build the dictionary hash table lazily *)
11
-
let dict_hash_table : dict_entry array Lazy.t = lazy (
12
-
let table = Array.make hash_size [] in
13
-
(* Index all dictionary words by their first 4 bytes *)
14
-
for length = Dictionary.min_word_length to Dictionary.max_word_length do
15
-
let num_words = 1 lsl Dictionary.size_bits_by_length.(length) in
16
-
for word_idx = 0 to num_words - 1 do
17
-
let offset = Dictionary.offset_by_length.(length) + word_idx * length in
18
-
if offset + 4 <= String.length Dictionary.data then begin
19
-
let h = Constants.hash4_string Dictionary.data offset hash_bits in
20
-
table.(h) <- (length, word_idx) :: table.(h)
21
-
end
22
-
done
23
-
done;
24
-
table
25
-
)
26
-
27
-
(* Check if two byte sequences match *)
28
-
let[@inline] bytes_match src src_pos word word_pos len =
29
-
let rec loop i =
30
-
if i >= len then true
31
-
else if Bytes.get src (src_pos + i) <> word.[word_pos + i] then false
32
-
else loop (i + 1)
33
-
in
34
-
loop 0
35
-
36
-
(* Transform ID 0: Identity - no transformation *)
37
-
(* Transform ID 9: UppercaseFirst - uppercase first letter *)
38
-
(* Transform ID 44: UppercaseAll - uppercase all letters *)
39
-
40
-
(* Check if input matches word with identity transform (ID 0) *)
41
-
let match_identity src pos src_end word_length word_idx =
42
-
if pos + word_length > src_end then None
43
-
else begin
44
-
let offset = Dictionary.offset_by_length.(word_length) + word_idx * word_length in
45
-
if bytes_match src pos Dictionary.data offset word_length then
46
-
Some (word_length, 0) (* length, transform_id *)
47
-
else
48
-
None
49
-
end
50
-
51
-
(* Lowercase a character if uppercase *)
52
-
let[@inline] to_lower c =
53
-
if c >= 'A' && c <= 'Z' then Char.chr (Char.code c lor 32)
54
-
else c
55
-
56
-
(* Check if input matches word with uppercase-first transform (ID 9) *)
57
-
let match_uppercase_first src pos src_end word_length word_idx =
58
-
if pos + word_length > src_end || word_length < 1 then None
59
-
else begin
60
-
let offset = Dictionary.offset_by_length.(word_length) + word_idx * word_length in
61
-
(* First byte should be uppercase version of dictionary's first byte *)
62
-
let dict_first = Dictionary.data.[offset] in
63
-
let src_first = Bytes.get src pos in
64
-
if src_first >= 'A' && src_first <= 'Z' && to_lower src_first = dict_first then begin
65
-
(* Rest should match exactly *)
66
-
if word_length = 1 || bytes_match src (pos + 1) Dictionary.data (offset + 1) (word_length - 1) then
67
-
Some (word_length, 9) (* length, transform_id *)
68
-
else
69
-
None
70
-
end
71
-
else
72
-
None
73
-
end
74
-
75
-
(* Try to find a dictionary match at the given position.
76
-
current_output_pos is the current position in the output buffer (for distance calculation).
77
-
The decoder uses min(max_backward_distance, output_pos) as the base for dictionary references. *)
78
-
let find_match src pos src_end max_backward_distance ~current_output_pos =
79
-
if pos + 4 > src_end then None
80
-
else begin
81
-
let table = Lazy.force dict_hash_table in
82
-
let h = Constants.hash4_bytes src pos hash_bits in
83
-
let candidates = table.(h) in
84
-
85
-
let best = ref None in
86
-
let best_score = ref 0 in
87
-
88
-
List.iter (fun (word_length, word_idx) ->
89
-
(* Try identity transform first (most common) *)
90
-
(match match_identity src pos src_end word_length word_idx with
91
-
| Some (len, transform_id) ->
92
-
(* Score: longer matches are better, identity transform is preferred *)
93
-
let score = len * 10 in
94
-
if score > !best_score then begin
95
-
best := Some (len, word_idx, transform_id);
96
-
best_score := score
97
-
end
98
-
| None -> ());
99
-
100
-
(* Try uppercase-first transform for capitalized words *)
101
-
if word_length >= 1 then
102
-
(match match_uppercase_first src pos src_end word_length word_idx with
103
-
| Some (len, transform_id) ->
104
-
let score = len * 10 - 1 in (* Slight penalty for transform *)
105
-
if score > !best_score then begin
106
-
best := Some (len, word_idx, transform_id);
107
-
best_score := score
108
-
end
109
-
| None -> ())
110
-
) candidates;
111
-
112
-
match !best with
113
-
| None -> None
114
-
| Some (match_len, word_idx, transform_id) ->
115
-
(* Calculate the dictionary distance code.
116
-
The decoder uses: word_id = distance - max_distance - 1
117
-
where max_distance = min(max_backward_distance, output_pos)
118
-
So we must use the same formula in reverse. *)
119
-
let max_distance = min max_backward_distance current_output_pos in
120
-
let shift = Dictionary.size_bits_by_length.(match_len) in
121
-
let word_id = word_idx lor (transform_id lsl shift) in
122
-
let distance = max_distance + 1 + word_id in
123
-
Some (match_len, distance)
124
-
end
125
-
126
-
(* Score a dictionary match for comparison with LZ77 matches *)
127
-
let score_dict_match match_len =
128
-
(* Dictionary matches save literals but have longer distance encoding *)
129
-
(* Give them a bonus since they're "free" (no backward reference needed) *)
130
-
match_len * 140 (* Slightly higher than LZ77's base score of 135 *)
-28
ocaml-brotli/src/dictionary.ml
-28
ocaml-brotli/src/dictionary.ml
···
1
-
(* Brotli static dictionary - auto-generated from dictionary.bin *)
2
-
3
-
(* Dictionary size: 122784 bytes *)
4
-
let data = "timedownlifeleftbackcodedatashowonlysitecityopenjustlikefreeworktextyearoverbodyloveformbookplaylivelinehelphomesidemorewordlongthemviewfindpagedaysfullheadtermeachareafromtruemarkableuponhighdatelandnewsevennextcasebothpostusedmadehandherewhatnameLinkblogsizebaseheldmakemainuser') +holdendswithNewsreadweresigntakehavegameseencallpathwellplusmenufilmpartjointhislistgoodneedwayswestjobsmindalsologorichuseslastteamarmyfoodkingwilleastwardbestfirePageknowaway.pngmovethanloadgiveselfnotemuchfeedmanyrockicononcelookhidediedHomerulehostajaxinfoclublawslesshalfsomesuchzone100%onescareTimeracebluefourweekfacehopegavehardlostwhenparkkeptpassshiproomHTMLplanTypedonesavekeepflaglinksoldfivetookratetownjumpthusdarkcardfilefearstaykillthatfallautoever.comtalkshopvotedeepmoderestturnbornbandfellroseurl(skinrolecomeactsagesmeetgold.jpgitemvaryfeltthensenddropViewcopy1.0\034</a>stopelseliestourpack.gifpastcss?graymean>rideshotlatesaidroadvar feeljohnrickportfast'UA-dead</b>poorbilltypeU.S.woodmust2px;Inforankwidewantwalllead[0];paulwavesure$('#waitmassarmsgoesgainlangpaid!-- lockunitrootwalkfirmwifexml\034songtest20pxkindrowstoolfontmailsafestarmapscorerainflowbabyspansays4px;6px;artsfootrealwikiheatsteptriporg/lakeweaktoldFormcastfansbankveryrunsjulytask1px;goalgrewslowedgeid=\034sets5px;.js?40pxif (soonseatnonetubezerosentreedfactintogiftharm18pxcamehillboldzoomvoideasyringfillpeakinitcost3px;jacktagsbitsrolleditknewnear<!--growJSONdutyNamesaleyou lotspainjazzcoldeyesfishwww.risktabsprev10pxrise25pxBlueding300,ballfordearnwildbox.fairlackverspairjunetechif(!pickevil$(\034#warmlorddoespull,000ideadrawhugespotfundburnhrefcellkeystickhourlossfuel12pxsuitdealRSS\034agedgreyGET\034easeaimsgirlaids8px;navygridtips#999warsladycars); }php?helltallwhomzh:\229*/\013\010 100hall.\010\010A7px;pushchat0px;crew*/</hash75pxflatrare && tellcampontolaidmissskiptentfinemalegetsplot400,\013\010\013\010coolfeet.php<br>ericmostguidbelldeschairmathatom/imgRluckcent000;tinygonehtmlselldrugFREEnodenick?id=losenullvastwindRSS wearrelybeensamedukenasacapewishgulfT23:hitsslotgatekickblurthey15px''););\034>msiewinsbirdsortbetaseekT18:ordstreemall60pxfarm\226\128\153sboys[0].');\034POSTbearkids);}}marytend(UK)quadzh:\230-siz----prop');\013liftT19:viceandydebt>RSSpoolneckblowT16:doorevalT17:letsfailoralpollnovacolsgene \226\128\148softrometillross<h3>pourfadepink<tr>mini)|!(minezh:\232barshear00);milk -->ironfreddiskwentsoilputs/js/holyT22:ISBNT20:adamsees<h2>json', 'contT21: RSSloopasiamoon</p>soulLINEfortcartT14:<h1>80px!--<9px;T04:mike:46ZniceinchYorkricezh:\228'));puremageparatonebond:37Z_of_']);000,zh:\231tankyardbowlbush:56ZJava30px\010|}\010%C3%:34ZjeffEXPIcashvisagolfsnowzh:\233quer.csssickmeatmin.binddellhirepicsrent:36ZHTTP-201fotowolfEND xbox:54ZBODYdick;\010}\010exit:35Zvarsbeat'});diet999;anne}}</[i].Langkm\194\178wiretoysaddssealalex;\010\009}echonine.org005)tonyjewssandlegsroof000) 200winegeardogsbootgarycutstyletemption.xmlcockgang$('.50pxPh.Dmiscalanloandeskmileryanunixdisc);}\010dustclip).\010\01070px-200DVDs7]><tapedemoi++)wageeurophiloptsholeFAQsasin-26TlabspetsURL bulkcook;}\013\010HEAD[0])abbrjuan(198leshtwin</i>sonyguysfuckpipe|-\010!002)ndow[1];[];\010Log salt\013\010\009\009bangtrimbath){\013\01000px\010});ko:\236feesad>\013s:// [];tollplug(){\010{\013\010 .js'200pdualboat.JPG);\010}quot);\010\010');\010\013\010}\013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037201320122011201020092008200720062005200420032002200120001999199819971996199519941993199219911990198919881987198619851984198319821981198019791978197719761975197419731972197119701969196819671966196519641963196219611960195919581957195619551954195319521951195010001024139400009999comom\195\161sesteestaperotodohacecadaa\195\177obiend\195\173aas\195\173vidacasootroforosolootracualdijosidograntipotemadebealgoqu\195\169estonadatrespococasabajotodasinoaguapuesunosantediceluisellamayozonaamorpisoobraclicellodioshoracasi\208\183\208\176\208\189\208\176\208\190\208\188\209\128\208\176\209\128\209\131\209\130\208\176\208\189\208\181\208\191\208\190\208\190\209\130\208\184\208\183\208\189\208\190\208\180\208\190\209\130\208\190\208\182\208\181\208\190\208\189\208\184\209\133\208\157\208\176\208\181\208\181\208\177\209\139\208\188\209\139\208\146\209\139\209\129\208\190\208\178\209\139\208\178\208\190\208\157\208\190\208\190\208\177\208\159\208\190\208\187\208\184\208\189\208\184\208\160\208\164\208\157\208\181\208\156\209\139\209\130\209\139\208\158\208\189\208\184\208\188\208\180\208\176\208\151\208\176\208\148\208\176\208\157\209\131\208\158\208\177\209\130\208\181\208\152\208\183\208\181\208\185\208\189\209\131\208\188\208\188\208\162\209\139\209\131\208\182\217\129\217\138\216\163\217\134\217\133\216\167\217\133\216\185\217\131\217\132\216\163\217\136\216\177\216\175\217\138\216\167\217\129\217\137\217\135\217\136\217\132\217\133\217\132\217\131\216\167\217\136\217\132\217\135\216\168\216\179\216\167\217\132\216\165\217\134\217\135\217\138\216\163\217\138\217\130\216\175\217\135\217\132\216\171\217\133\216\168\217\135\217\132\217\136\217\132\217\138\216\168\217\132\216\167\217\138\216\168\217\131\216\180\217\138\216\167\217\133\216\163\217\133\217\134\216\170\216\168\217\138\217\132\217\134\216\173\216\168\217\135\217\133\217\133\216\180\217\136\216\180firstvideolightworldmediawhitecloseblackrightsmallbooksplacemusicfieldorderpointvalueleveltableboardhousegroupworksyearsstatetodaywaterstartstyledeathpowerphonenighterrorinputabouttermstitletoolseventlocaltimeslargewordsgamesshortspacefocusclearmodelblockguideradiosharewomenagainmoneyimagenamesyounglineslatercolorgreenfront&watchforcepricerulesbeginaftervisitissueareasbelowindextotalhourslabelprintpressbuiltlinksspeedstudytradefoundsenseundershownformsrangeaddedstillmovedtakenaboveflashfixedoftenotherviewschecklegalriveritemsquickshapehumanexistgoingmoviethirdbasicpeacestagewidthloginideaswrotepagesusersdrivestorebreaksouthvoicesitesmonthwherebuildwhichearthforumthreesportpartyClicklowerlivesclasslayerentrystoryusagesoundcourtyour birthpopuptypesapplyImagebeinguppernoteseveryshowsmeansextramatchtrackknownearlybegansuperpapernorthlearngivennamedendedTermspartsGroupbrandusingwomanfalsereadyaudiotakeswhile.com/livedcasesdailychildgreatjudgethoseunitsneverbroadcoastcoverapplefilescyclesceneplansclickwritequeenpieceemailframeolderphotolimitcachecivilscaleenterthemetheretouchboundroyalaskedwholesincestock namefaithheartemptyofferscopeownedmightalbumthinkbloodarraymajortrustcanonunioncountvalidstoneStyleLoginhappyoccurleft:freshquitefilmsgradeneedsurbanfightbasishoverauto;route.htmlmixedfinalYour slidetopicbrownalonedrawnsplitreachRightdatesmarchquotegoodsLinksdoubtasyncthumballowchiefyouthnovel10px;serveuntilhandsCheckSpacequeryjamesequaltwice0,000Startpanelsongsroundeightshiftworthpostsleadsweeksavoidthesemilesplanesmartalphaplantmarksratesplaysclaimsalestextsstarswrong</h3>thing.org/multiheardPowerstandtokensolid(thisbringshipsstafftriedcallsfullyfactsagentThis //-->adminegyptEvent15px;Emailtrue\034crossspentblogsbox\034>notedleavechinasizesguest</h4>robotheavytrue,sevengrandcrimesignsawaredancephase><!--en_US'200px_namelatinenjoyajax.ationsmithU.S. holdspeterindianav\034>chainscorecomesdoingpriorShare1990sromanlistsjapanfallstrialowneragree</h2>abusealertopera\034-//WcardshillsteamsPhototruthclean.php?saintmetallouismeantproofbriefrow\034>genretrucklooksValueFrame.net/-->\010<try {\010var makescostsplainadultquesttrainlaborhelpscausemagicmotortheir250pxleaststepsCountcouldglasssidesfundshotelawardmouthmovesparisgivesdutchtexasfruitnull,||[];top\034>\010<!--POST\034ocean<br/>floorspeakdepth sizebankscatchchart20px;aligndealswould50px;url=\034parksmouseMost ...</amongbrainbody none;basedcarrydraftreferpage_home.meterdelaydreamprovejoint</tr>drugs<!-- aprilidealallenexactforthcodeslogicView seemsblankports (200saved_linkgoalsgrantgreekhomesringsrated30px;whoseparse();\034 Blocklinuxjonespixel');\034>);if(-leftdavidhorseFocusraiseboxesTrackement</em>bar\034>.src=toweralt=\034cablehenry24px;setupitalysharpminortastewantsthis.resetwheelgirls/css/100%;clubsstuffbiblevotes 1000korea});\013\010bandsqueue= {};80px;cking{\013\010\009\009aheadclockirishlike ratiostatsForm\034yahoo)[0];Aboutfinds</h1>debugtasksURL =cells})();12px;primetellsturns0x600.jpg\034spainbeachtaxesmicroangel--></giftssteve-linkbody.});\010\009mount (199FAQ</rogerfrankClass28px;feeds<h1><scotttests22px;drink) || lewisshall#039; for lovedwaste00px;ja:\227\130simon<fontreplymeetsuntercheaptightBrand) != dressclipsroomsonkeymobilmain.Name platefunnytreescom/\0341.jpgwmodeparamSTARTleft idden, 201);\010}\010form.viruschairtransworstPagesitionpatch<!--\010o-cacfirmstours,000 asiani++){adobe')[0]id=10both;menu .2.mi.png\034kevincoachChildbruce2.jpgURL)+.jpg|suitesliceharry120\034 sweettr>\013\010name=diegopage swiss-->\010\010#fff;\034>Log.com\034treatsheet) && 14px;sleepntentfiledja:\227\131id=\034cName\034worseshots-box-delta\010<bears:48Z<data-rural</a> spendbakershops= \034\034;php\034>ction13px;brianhellosize=o=%2F joinmaybe<img img\034>, fjsimg\034 \034)[0]MTopBType\034newlyDanskczechtrailknows</h5>faq\034>zh-cn10);\010-1\034);type=bluestrulydavis.js';>\013\010<!steel you h2>\013\010form jesus100% menu.\013\010\009\013\010walesrisksumentddingb-likteachgif\034 vegasdanskeestishqipsuomisobredesdeentretodospuedea\195\177osest\195\161tienehastaotrospartedondenuevohacerformamismomejormundoaqu\195\173d\195\173ass\195\179loayudafechatodastantomenosdatosotrassitiomuchoahoralugarmayorestoshorastenerantesfotosestaspa\195\173snuevasaludforosmedioquienmesespoderchileser\195\161vecesdecirjos\195\169estarventagrupohechoellostengoamigocosasnivelgentemismaairesjuliotemashaciafavorjuniolibrepuntobuenoautorabrilbuenatextomarzosaberlistaluegoc\195\179moenerojuegoper\195\186haberestoynuncamujervalorfueralibrogustaigualvotoscasosgu\195\173apuedosomosavisousteddebennochebuscafaltaeurosseriedichocursoclavecasasle\195\179nplazolargoobrasvistaapoyojuntotratavistocrearcampohemoscincocargopisosordenhacen\195\161readiscopedrocercapuedapapelmenor\195\186tilclarojorgecalleponertardenadiemarcasigueellassiglocochemotosmadreclaserestoni\195\177oquedapasarbancohijosviajepablo\195\169stevienereinodejarfondocanalnorteletracausatomarmanoslunesautosvillavendopesartipostengamarcollevapadreunidovamoszonasambosbandamariaabusomuchasubirriojavivirgradochicaall\195\173jovendichaestantalessalirsuelopesosfinesllamabusco\195\169stalleganegroplazahumorpagarjuntadobleislasbolsaba\195\177ohablalucha\195\129readicenjugarnotasvalleall\195\161cargadolorabajoest\195\169gustomentemariofirmacostofichaplatahogarartesleyesaquelmuseobasespocosmitadcielochicomiedoganarsantoetapadebesplayaredessietecortecoreadudasdeseoviejodeseaaguas"domaincommonstatuseventsmastersystemactionbannerremovescrollupdateglobalmediumfilternumberchangeresultpublicscreenchoosenormaltravelissuessourcetargetspringmodulemobileswitchphotosborderregionitselfsocialactivecolumnrecordfollowtitle>eitherlengthfamilyfriendlayoutauthorcreatereviewsummerserverplayedplayerexpandpolicyformatdoublepointsseriespersonlivingdesignmonthsforcesuniqueweightpeopleenergynaturesearchfigurehavingcustomoffsetletterwindowsubmitrendergroupsuploadhealthmethodvideosschoolfutureshadowdebatevaluesObjectothersrightsleaguechromesimplenoticesharedendingseasonreportonlinesquarebuttonimagesenablemovinglatestwinterFranceperiodstrongrepeatLondondetailformeddemandsecurepassedtoggleplacesdevicestaticcitiesstreamyellowattackstreetflighthiddeninfo\034>openedusefulvalleycausesleadersecretseconddamagesportsexceptratingsignedthingseffectfieldsstatesofficevisualeditorvolumeReportmuseummoviesparentaccessmostlymother\034 id=\034marketgroundchancesurveybeforesymbolmomentspeechmotioninsidematterCenterobjectexistsmiddleEuropegrowthlegacymannerenoughcareeransweroriginportalclientselectrandomclosedtopicscomingfatheroptionsimplyraisedescapechosenchurchdefinereasoncorneroutputmemoryiframepolicemodelsNumberduringoffersstyleskilledlistedcalledsilvermargindeletebetterbrowselimitsGlobalsinglewidgetcenterbudgetnowrapcreditclaimsenginesafetychoicespirit-stylespreadmakingneededrussiapleaseextentScriptbrokenallowschargedividefactormember-basedtheoryconfigaroundworkedhelpedChurchimpactshouldalwayslogo\034 bottomlist\034>){var prefixorangeHeader.push(couplegardenbridgelaunchReviewtakingvisionlittledatingButtonbeautythemesforgotSearchanchoralmostloadedChangereturnstringreloadMobileincomesupplySourceordersviewed courseAbout island<html cookiename=\034amazonmodernadvicein</a>: The dialoghousesBEGIN MexicostartscentreheightaddingIslandassetsEmpireSchooleffortdirectnearlymanualSelect.\010\010Onejoinedmenu\034>PhilipawardshandleimportOfficeregardskillsnationSportsdegreeweekly (e.g.behinddoctorloggedunited</b></beginsplantsassistartistissued300px|canadaagencyschemeremainBrazilsamplelogo\034>beyond-scaleacceptservedmarineFootercamera</h1>\010_form\034leavesstress\034 />\013\010.gif\034 onloadloaderOxfordsistersurvivlistenfemaleDesignsize=\034appealtext\034>levelsthankshigherforcedanimalanyoneAfricaagreedrecentPeople<br />wonderpricesturned|| {};main\034>inlinesundaywrap\034>failedcensusminutebeaconquotes150px|estateremoteemail\034linkedright;signalformal1.htmlsignupprincefloat:.png\034 forum.AccesspaperssoundsextendHeightsliderUTF-8\034& Before. WithstudioownersmanageprofitjQueryannualparamsboughtfamousgooglelongeri++) {israelsayingdecidehome\034>headerensurebranchpiecesblock;statedtop\034><racingresize-->pacitysexualbureau.jpg\034 10,000obtaintitlesamount, Inc.comedymenu\034 lyricstoday.indeedcounty_logo.FamilylookedMarketlse ifPlayerturkey);var forestgivingerrorsDomain}else{insertBlog</footerlogin.fasteragents<body 10px 0pragmafridayjuniordollarplacedcoversplugin5,000 page\034>boston.test(avatartested_countforumsschemaindex,filledsharesreaderalert(appearSubmitline\034>body\034>\010* TheThoughseeingjerseyNews</verifyexpertinjurywidth=CookieSTART across_imagethreadnativepocketbox\034>\010System DavidcancertablesprovedApril reallydriveritem\034>more\034>boardscolorscampusfirst || [];media.guitarfinishwidth:showedOther .php\034 assumelayerswilsonstoresreliefswedenCustomeasily your String\010\010Whiltaylorclear:resortfrenchthough\034) + \034<body>buyingbrandsMembername\034>oppingsector5px;\034>vspacepostermajor coffeemartinmaturehappen</nav>kansaslink\034>Images=falsewhile hspace0& \010\010In powerPolski-colorjordanBottomStart -count2.htmlnews\034>01.jpgOnline-rightmillerseniorISBN 00,000 guidesvalue)ectionrepair.xml\034 rights.html-blockregExp:hoverwithinvirginphones</tr>\013using \010\009var >');\010\009</td>\010</tr>\010bahasabrasilgalegomagyarpolskisrpski\216\177\216\175\217\136\228\184\173\230\150\135\231\174\128\228\189\147\231\185\129\233\171\148\228\191\161\230\129\175\228\184\173\229\155\189\230\136\145\228\187\172\228\184\128\228\184\170\229\133\172\229\143\184\231\174\161\231\144\134\232\174\186\229\157\155\229\143\175\228\187\165\230\156\141\229\138\161\230\151\182\233\151\180\228\184\170\228\186\186\228\186\167\229\147\129\232\135\170\229\183\177\228\188\129\228\184\154\230\159\165\231\156\139\229\183\165\228\189\156\232\129\148\231\179\187\230\178\161\230\156\137\231\189\145\231\171\153\230\137\128\230\156\137\232\175\132\232\174\186\228\184\173\229\191\131\230\150\135\231\171\160\231\148\168\230\136\183\233\166\150\233\161\181\228\189\156\232\128\133\230\138\128\230\156\175\233\151\174\233\162\152\231\155\184\229\133\179\228\184\139\232\189\189\230\144\156\231\180\162\228\189\191\231\148\168\232\189\175\228\187\182\229\156\168\231\186\191\228\184\187\233\162\152\232\181\132\230\150\153\232\167\134\233\162\145\229\155\158\229\164\141\230\179\168\229\134\140\231\189\145\231\187\156\230\148\182\232\151\143\229\134\133\229\174\185\230\142\168\232\141\144\229\184\130\229\156\186\230\182\136\230\129\175\231\169\186\233\151\180\229\143\145\229\184\131\228\187\128\228\185\136\229\165\189\229\143\139\231\148\159\230\180\187\229\155\190\231\137\135\229\143\145\229\177\149\229\166\130\230\158\156\230\137\139\230\156\186\230\150\176\233\151\187\230\156\128\230\150\176\230\150\185\229\188\143\229\140\151\228\186\172\230\143\144\228\190\155\229\133\179\228\186\142\230\155\180\229\164\154\232\191\153\228\184\170\231\179\187\231\187\159\231\159\165\233\129\147\230\184\184\230\136\143\229\185\191\229\145\138\229\133\182\228\187\150\229\143\145\232\161\168\229\174\137\229\133\168\231\172\172\228\184\128\228\188\154\229\145\152\232\191\155\232\161\140\231\130\185\229\135\187\231\137\136\230\157\131\231\148\181\229\173\144\228\184\150\231\149\140\232\174\190\232\174\161\229\133\141\232\180\185\230\149\153\232\130\178\229\138\160\229\133\165\230\180\187\229\138\168\228\187\150\228\187\172\229\149\134\229\147\129\229\141\154\229\174\162\231\142\176\229\156\168\228\184\138\230\181\183\229\166\130\228\189\149\229\183\178\231\187\143\231\149\153\232\168\128\232\175\166\231\187\134\231\164\190\229\140\186\231\153\187\229\189\149\230\156\172\231\171\153\233\156\128\232\166\129\228\187\183\230\160\188\230\148\175\230\140\129\229\155\189\233\153\133\233\147\190\230\142\165\229\155\189\229\174\182\229\187\186\232\174\190\230\156\139\229\143\139\233\152\133\232\175\187\230\179\149\229\190\139\228\189\141\231\189\174\231\187\143\230\181\142\233\128\137\230\139\169\232\191\153\230\160\183\229\189\147\229\137\141\229\136\134\231\177\187\230\142\146\232\161\140\229\155\160\228\184\186\228\186\164\230\152\147\230\156\128\229\144\142\233\159\179\228\185\144\228\184\141\232\131\189\233\128\154\232\191\135\232\161\140\228\184\154\231\167\145\230\138\128\229\143\175\232\131\189\232\174\190\229\164\135\229\144\136\228\189\156\229\164\167\229\174\182\231\164\190\228\188\154\231\160\148\231\169\182\228\184\147\228\184\154\229\133\168\233\131\168\233\161\185\231\155\174\232\191\153\233\135\140\232\191\152\230\152\175\229\188\128\229\167\139\230\131\133\229\134\181\231\148\181\232\132\145\230\150\135\228\187\182\229\147\129\231\137\140\229\184\174\229\138\169\230\150\135\229\140\150\232\181\132\230\186\144\229\164\167\229\173\166\229\173\166\228\185\160\229\156\176\229\157\128\230\181\143\232\167\136\230\138\149\232\181\132\229\183\165\231\168\139\232\166\129\230\177\130\230\128\142\228\185\136\230\151\182\229\128\153\229\138\159\232\131\189\228\184\187\232\166\129\231\155\174\229\137\141\232\181\132\232\174\175\229\159\142\229\184\130\230\150\185\230\179\149\231\148\181\229\189\177\230\139\155\232\129\152\229\163\176\230\152\142\228\187\187\228\189\149\229\129\165\229\186\183\230\149\176\230\141\174\231\190\142\229\155\189\230\177\189\232\189\166\228\187\139\231\187\141\228\189\134\230\152\175\228\186\164\230\181\129\231\148\159\228\186\167\230\137\128\228\187\165\231\148\181\232\175\157\230\152\190\231\164\186\228\184\128\228\186\155\229\141\149\228\189\141\228\186\186\229\145\152\229\136\134\230\158\144\229\156\176\229\155\190\230\151\133\230\184\184\229\183\165\229\133\183\229\173\166\231\148\159\231\179\187\229\136\151\231\189\145\229\143\139\229\184\150\229\173\144\229\175\134\231\160\129\233\162\145\233\129\147\230\142\167\229\136\182\229\156\176\229\140\186\229\159\186\230\156\172\229\133\168\229\155\189\231\189\145\228\184\138\233\135\141\232\166\129\231\172\172\228\186\140\229\150\156\230\172\162\232\191\155\229\133\165\229\143\139\230\131\133\232\191\153\228\186\155\232\128\131\232\175\149\229\143\145\231\142\176\229\159\185\232\174\173\228\187\165\228\184\138\230\148\191\229\186\156\230\136\144\228\184\186\231\142\175\229\162\131\233\166\153\230\184\175\229\144\140\230\151\182\229\168\177\228\185\144\229\143\145\233\128\129\228\184\128\229\174\154\229\188\128\229\143\145\228\189\156\229\147\129\230\160\135\229\135\134\230\172\162\232\191\142\232\167\163\229\134\179\229\156\176\230\150\185\228\184\128\228\184\139\228\187\165\229\143\138\232\180\163\228\187\187\230\136\150\232\128\133\229\174\162\230\136\183\228\187\163\232\161\168\231\167\175\229\136\134\229\165\179\228\186\186\230\149\176\231\160\129\233\148\128\229\148\174\229\135\186\231\142\176\231\166\187\231\186\191\229\186\148\231\148\168\229\136\151\232\161\168\228\184\141\229\144\140\231\188\150\232\190\145\231\187\159\232\174\161\230\159\165\232\175\162\228\184\141\232\166\129\230\156\137\229\133\179\230\156\186\230\158\132\229\190\136\229\164\154\230\146\173\230\148\190\231\187\132\231\187\135\230\148\191\231\173\150\231\155\180\230\142\165\232\131\189\229\138\155\230\157\165\230\186\144\230\153\130\233\150\147\231\156\139\229\136\176\231\131\173\233\151\168\229\133\179\233\148\174\228\184\147\229\140\186\233\157\158\229\184\184\232\139\177\232\175\173\231\153\190\229\186\166\229\184\140\230\156\155\231\190\142\229\165\179\230\175\148\232\190\131\231\159\165\232\175\134\232\167\132\229\174\154\229\187\186\232\174\174\233\131\168\233\151\168\230\132\143\232\167\129\231\178\190\229\189\169\230\151\165\230\156\172\230\143\144\233\171\152\229\143\145\232\168\128\230\150\185\233\157\162\229\159\186\233\135\145\229\164\132\231\144\134\230\157\131\233\153\144\229\189\177\231\137\135\233\147\182\232\161\140\232\191\152\230\156\137\229\136\134\228\186\171\231\137\169\229\147\129\231\187\143\232\144\165\230\183\187\229\138\160\228\184\147\229\174\182\232\191\153\231\167\141\232\175\157\233\162\152\232\181\183\230\157\165\228\184\154\229\138\161\229\133\172\229\145\138\232\174\176\229\189\149\231\174\128\228\187\139\232\180\168\233\135\143\231\148\183\228\186\186\229\189\177\229\147\141\229\188\149\231\148\168\230\138\165\229\145\138\233\131\168\229\136\134\229\191\171\233\128\159\229\146\168\232\175\162\230\151\182\229\176\154\230\179\168\230\132\143\231\148\179\232\175\183\229\173\166\230\160\161\229\186\148\232\175\165\229\142\134\229\143\178\229\143\170\230\152\175\232\191\148\229\155\158\232\180\173\228\185\176\229\144\141\231\167\176\228\184\186\228\186\134\230\136\144\229\138\159\232\175\180\230\152\142\228\190\155\229\186\148\229\173\169\229\173\144\228\184\147\233\162\152\231\168\139\229\186\143\228\184\128\232\136\172\230\156\131\229\147\161\229\143\170\230\156\137\229\133\182\229\174\131\228\191\157\230\138\164\232\128\140\228\184\148\228\187\138\229\164\169\231\170\151\229\143\163\229\138\168\230\128\129\231\138\182\230\128\129\231\137\185\229\136\171\232\174\164\228\184\186\229\191\133\233\161\187\230\155\180\230\150\176\229\176\143\232\175\180\230\136\145\229\128\145\228\189\156\228\184\186\229\170\146\228\189\147\229\140\133\230\139\172\233\130\163\228\185\136\228\184\128\230\160\183\229\155\189\229\134\133\230\152\175\229\144\166\230\160\185\230\141\174\231\148\181\232\167\134\229\173\166\233\153\162\229\133\183\230\156\137\232\191\135\231\168\139\231\148\177\228\186\142\228\186\186\230\137\141\229\135\186\230\157\165\228\184\141\232\191\135\230\173\163\229\156\168\230\152\142\230\152\159\230\149\133\228\186\139\229\133\179\231\179\187\230\160\135\233\162\152\229\149\134\229\138\161\232\190\147\229\133\165\228\184\128\231\155\180\229\159\186\231\161\128\230\149\153\229\173\166\228\186\134\232\167\163\229\187\186\231\173\145\231\187\147\230\158\156\229\133\168\231\144\131\233\128\154\231\159\165\232\174\161\229\136\146\229\175\185\228\186\142\232\137\186\230\156\175\231\155\184\229\134\140\229\143\145\231\148\159\231\156\159\231\154\132\229\187\186\231\171\139\231\173\137\231\186\167\231\177\187\229\158\139\231\187\143\233\170\140\229\174\158\231\142\176\229\136\182\228\189\156\230\157\165\232\135\170\230\160\135\231\173\190\228\187\165\228\184\139\229\142\159\229\136\155\230\151\160\230\179\149\229\133\182\228\184\173\229\128\139\228\186\186\228\184\128\229\136\135\230\140\135\229\141\151\229\133\179\233\151\173\233\155\134\229\155\162\231\172\172\228\184\137\229\133\179\230\179\168\229\155\160\230\173\164\231\133\167\231\137\135\230\183\177\229\156\179\229\149\134\228\184\154\229\185\191\229\183\158\230\151\165\230\156\159\233\171\152\231\186\167\230\156\128\232\191\145\231\187\188\229\144\136\232\161\168\231\164\186\228\184\147\232\190\145\232\161\140\228\184\186\228\186\164\233\128\154\232\175\132\228\187\183\232\167\137\229\190\151\231\178\190\229\141\142\229\174\182\229\186\173\229\174\140\230\136\144\230\132\159\232\167\137\229\174\137\232\163\133\229\190\151\229\136\176\233\130\174\228\187\182\229\136\182\229\186\166\233\163\159\229\147\129\232\153\189\231\132\182\232\189\172\232\189\189\230\138\165\228\187\183\232\174\176\232\128\133\230\150\185\230\161\136\232\161\140\230\148\191\228\186\186\230\176\145\231\148\168\229\147\129\228\184\156\232\165\191\230\143\144\229\135\186\233\133\146\229\186\151\231\132\182\229\144\142\228\187\152\230\172\190\231\131\173\231\130\185\228\187\165\229\137\141\229\174\140\229\133\168\229\143\145\229\184\150\232\174\190\231\189\174\233\162\134\229\175\188\229\183\165\228\184\154\229\140\187\233\153\162\231\156\139\231\156\139\231\187\143\229\133\184\229\142\159\229\155\160\229\185\179\229\143\176\229\144\132\231\167\141\229\162\158\229\138\160\230\157\144\230\150\153\230\150\176\229\162\158\228\185\139\229\144\142\232\129\140\228\184\154\230\149\136\230\158\156\228\187\138\229\185\180\232\174\186\230\150\135\230\136\145\229\155\189\229\145\138\232\175\137\231\137\136\228\184\187\228\191\174\230\148\185\229\143\130\228\184\142\230\137\147\229\141\176\229\191\171\228\185\144\230\156\186\230\162\176\232\167\130\231\130\185\229\173\152\229\156\168\231\178\190\231\165\158\232\142\183\229\190\151\229\136\169\231\148\168\231\187\167\231\187\173\228\189\160\228\187\172\232\191\153\228\185\136\230\168\161\229\188\143\232\175\173\232\168\128\232\131\189\229\164\159\233\155\133\232\153\142\230\147\141\228\189\156\233\163\142\230\160\188\228\184\128\232\181\183\231\167\145\229\173\166\228\189\147\232\130\178\231\159\173\228\191\161\230\157\161\228\187\182\230\178\187\231\150\151\232\191\144\229\138\168\228\186\167\228\184\154\228\188\154\232\174\174\229\175\188\232\136\170\229\133\136\231\148\159\232\129\148\231\155\159\229\143\175\230\152\175\229\149\143\233\161\140\231\187\147\230\158\132\228\189\156\231\148\168\232\176\131\230\159\165\232\179\135\230\150\153\232\135\170\229\138\168\232\180\159\232\180\163\229\134\156\228\184\154\232\174\191\233\151\174\229\174\158\230\150\189\230\142\165\229\143\151\232\174\168\232\174\186\233\130\163\228\184\170\229\143\141\233\166\136\229\138\160\229\188\186\229\165\179\230\128\167\232\140\131\229\155\180\230\156\141\229\139\153\228\188\145\233\151\178\228\187\138\230\151\165\229\174\162\230\156\141\232\167\128\231\156\139\229\143\130\229\138\160\231\154\132\232\175\157\228\184\128\231\130\185\228\191\157\232\175\129\229\155\190\228\185\166\230\156\137\230\149\136\230\181\139\232\175\149\231\167\187\229\138\168\230\137\141\232\131\189\229\134\179\229\174\154\232\130\161\231\165\168\228\184\141\230\150\173\233\156\128\230\177\130\228\184\141\229\190\151\229\138\158\230\179\149\228\185\139\233\151\180\233\135\135\231\148\168\232\144\165\233\148\128\230\138\149\232\175\137\231\155\174\230\160\135\231\136\177\230\131\133\230\145\132\229\189\177\230\156\137\228\186\155\232\164\135\232\163\189\230\150\135\229\173\166\230\156\186\228\188\154\230\149\176\229\173\151\232\163\133\228\191\174\232\180\173\231\137\169\229\134\156\230\157\145\229\133\168\233\157\162\231\178\190\229\147\129\229\133\182\229\174\158\228\186\139\230\131\133\230\176\180\229\185\179\230\143\144\231\164\186\228\184\138\229\184\130\232\176\162\232\176\162\230\153\174\233\128\154\230\149\153\229\184\136\228\184\138\228\188\160\231\177\187\229\136\171\230\173\140\230\155\178\230\139\165\230\156\137\229\136\155\230\150\176\233\133\141\228\187\182\229\143\170\232\166\129\230\151\182\228\187\163\232\179\135\232\168\138\232\190\190\229\136\176\228\186\186\231\148\159\232\174\162\233\152\133\232\128\129\229\184\136\229\177\149\231\164\186\229\191\131\231\144\134\232\180\180\229\173\144\231\182\178\231\171\153\228\184\187\233\161\140\232\135\170\231\132\182\231\186\167\229\136\171\231\174\128\229\141\149\230\148\185\233\157\169\233\130\163\228\186\155\230\157\165\232\175\180\230\137\147\229\188\128\228\187\163\231\160\129\229\136\160\233\153\164\232\175\129\229\136\184\232\138\130\231\155\174\233\135\141\231\130\185\230\172\161\230\149\184\229\164\154\229\176\145\232\167\132\229\136\146\232\181\132\233\135\145\230\137\190\229\136\176\228\187\165\229\144\142\229\164\167\229\133\168\228\184\187\233\161\181\230\156\128\228\189\179\229\155\158\231\173\148\229\164\169\228\184\139\228\191\157\233\154\156\231\142\176\228\187\163\230\163\128\230\159\165\230\138\149\231\165\168\229\176\143\230\151\182\230\178\146\230\156\137\230\173\163\229\184\184\231\148\154\232\135\179\228\187\163\231\144\134\231\155\174\229\189\149\229\133\172\229\188\128\229\164\141\229\136\182\233\135\145\232\158\141\229\185\184\231\166\143\231\137\136\230\156\172\229\189\162\230\136\144\229\135\134\229\164\135\232\161\140\230\131\133\229\155\158\229\136\176\230\128\157\230\131\179\230\128\142\230\160\183\229\141\143\232\174\174\232\174\164\232\175\129\230\156\128\229\165\189\228\186\167\231\148\159\230\140\137\231\133\167\230\156\141\232\163\133\229\185\191\228\184\156\229\138\168\230\188\171\233\135\135\232\180\173\230\150\176\230\137\139\231\187\132\229\155\190\233\157\162\230\157\191\229\143\130\232\128\131\230\148\191\230\178\187\229\174\185\230\152\147\229\164\169\229\156\176\229\138\170\229\138\155\228\186\186\228\187\172\229\141\135\231\186\167\233\128\159\229\186\166\228\186\186\231\137\169\232\176\131\230\149\180\230\181\129\232\161\140\233\128\160\230\136\144\230\150\135\229\173\151\233\159\169\229\155\189\232\180\184\230\152\147\229\188\128\229\177\149\231\155\184\233\151\156\232\161\168\231\142\176\229\189\177\232\167\134\229\166\130\230\173\164\231\190\142\229\174\185\229\164\167\229\176\143\230\138\165\233\129\147\230\157\161\230\172\190\229\191\131\230\131\133\232\174\184\229\164\154\230\179\149\232\167\132\229\174\182\229\177\133\228\185\166\229\186\151\232\191\158\230\142\165\231\171\139\229\141\179\228\184\190\230\138\165\230\138\128\229\183\167\229\165\165\232\191\144\231\153\187\229\133\165\228\187\165\230\157\165\231\144\134\232\174\186\228\186\139\228\187\182\232\135\170\231\148\177\228\184\173\229\141\142\229\138\158\229\133\172\229\166\136\229\166\136\231\156\159\230\173\163\228\184\141\233\148\153\229\133\168\230\150\135\229\144\136\229\144\140\228\187\183\229\128\188\229\136\171\228\186\186\231\155\145\231\157\163\229\133\183\228\189\147\228\184\150\231\186\170\229\155\162\233\152\159\229\136\155\228\184\154\230\137\191\230\139\133\229\162\158\233\149\191\230\156\137\228\186\186\228\191\157\230\140\129\229\149\134\229\174\182\231\187\180\228\191\174\229\143\176\230\185\190\229\183\166\229\143\179\232\130\161\228\187\189\231\173\148\230\161\136\229\174\158\233\153\133\231\148\181\228\191\161\231\187\143\231\144\134\231\148\159\229\145\189\229\174\163\228\188\160\228\187\187\229\138\161\230\173\163\229\188\143\231\137\185\232\137\178\228\184\139\230\157\165\229\141\143\228\188\154\229\143\170\232\131\189\229\189\147\231\132\182\233\135\141\230\150\176\229\133\167\229\174\185\230\140\135\229\175\188\232\191\144\232\161\140\230\151\165\229\191\151\232\179\163\229\174\182\232\182\133\232\191\135\229\156\159\229\156\176\230\181\153\230\177\159\230\148\175\228\187\152\230\142\168\229\135\186\231\171\153\233\149\191\230\157\173\229\183\158\230\137\167\232\161\140\229\136\182\233\128\160\228\185\139\228\184\128\230\142\168\229\185\191\231\142\176\229\156\186\230\143\143\232\191\176\229\143\152\229\140\150\228\188\160\231\187\159\230\173\140\230\137\139\228\191\157\233\153\169\232\175\190\231\168\139\229\140\187\231\150\151\231\187\143\232\191\135\232\191\135\229\142\187\228\185\139\229\137\141\230\148\182\229\133\165\229\185\180\229\186\166\230\157\130\229\191\151\231\190\142\228\184\189\230\156\128\233\171\152\231\153\187\233\153\134\230\156\170\230\157\165\229\138\160\229\183\165\229\133\141\232\180\163\230\149\153\231\168\139\231\137\136\229\157\151\232\186\171\228\189\147\233\135\141\229\186\134\229\135\186\229\148\174\230\136\144\230\156\172\229\189\162\229\188\143\229\156\159\232\177\134\229\135\186\229\131\185\228\184\156\230\150\185\233\130\174\231\174\177\229\141\151\228\186\172\230\177\130\232\129\140\229\143\150\229\190\151\232\129\140\228\189\141\231\155\184\228\191\161\233\161\181\233\157\162\229\136\134\233\146\159\231\189\145\233\161\181\231\161\174\229\174\154\229\155\190\228\190\139\231\189\145\229\157\128\231\167\175\230\158\129\233\148\153\232\175\175\231\155\174\231\154\132\229\174\157\232\180\157\230\156\186\229\133\179\233\163\142\233\153\169\230\142\136\230\157\131\231\151\133\230\175\146\229\174\160\231\137\169\233\153\164\228\186\134\232\169\149\232\171\150\231\150\190\231\151\133\229\143\138\230\151\182\230\177\130\232\180\173\231\171\153\231\130\185\229\132\191\231\171\165\230\175\143\229\164\169\228\184\173\229\164\174\232\174\164\232\175\134\230\175\143\228\184\170\229\164\169\230\180\165\229\173\151\228\189\147\229\143\176\231\129\163\231\187\180\230\138\164\230\156\172\233\161\181\228\184\170\230\128\167\229\174\152\230\150\185\229\184\184\232\167\129\231\155\184\230\156\186\230\136\152\231\149\165\229\186\148\229\189\147\229\190\139\229\184\136\230\150\185\228\190\191\230\160\161\229\155\173\232\130\161\229\184\130\230\136\191\229\177\139\230\160\143\231\155\174\229\145\152\229\183\165\229\175\188\232\135\180\231\170\129\231\132\182\233\129\147\229\133\183\230\156\172\231\189\145\231\187\147\229\144\136\230\161\163\230\161\136\229\138\179\229\138\168\229\143\166\229\164\150\231\190\142\229\133\131\229\188\149\232\181\183\230\148\185\229\143\152\231\172\172\229\155\155\228\188\154\232\174\161\232\170\170\230\152\142\233\154\144\231\167\129\229\174\157\229\174\157\232\167\132\232\140\131\230\182\136\232\180\185\229\133\177\229\144\140\229\191\152\232\174\176\228\189\147\231\179\187\229\184\166\230\157\165\229\144\141\229\173\151\231\153\188\232\161\168\229\188\128\230\148\190\229\138\160\231\155\159\229\143\151\229\136\176\228\186\140\230\137\139\229\164\167\233\135\143\230\136\144\228\186\186\230\149\176\233\135\143\229\133\177\228\186\171\229\140\186\229\159\159\229\165\179\229\173\169\229\142\159\229\136\153\230\137\128\229\156\168\231\187\147\230\157\159\233\128\154\228\191\161\232\182\133\231\186\167\233\133\141\231\189\174\229\189\147\230\151\182\228\188\152\231\167\128\230\128\167\230\132\159\230\136\191\228\186\167\233\129\138\230\136\178\229\135\186\229\143\163\230\143\144\228\186\164\229\176\177\228\184\154\228\191\157\229\129\165\231\168\139\229\186\166\229\143\130\230\149\176\228\186\139\228\184\154\230\149\180\228\184\170\229\177\177\228\184\156\230\131\133\230\132\159\231\137\185\230\174\138\229\136\134\233\161\158\230\144\156\229\176\139\229\177\158\228\186\142\233\151\168\230\136\183\232\180\162\229\138\161\229\163\176\233\159\179\229\143\138\229\133\182\232\180\162\231\187\143\229\157\154\230\140\129\229\185\178\233\131\168\230\136\144\231\171\139\229\136\169\231\155\138\232\128\131\232\153\145\230\136\144\233\131\189\229\140\133\232\163\133\231\148\168\230\136\182\230\175\148\232\181\155\230\150\135\230\152\142\230\139\155\229\149\134\229\174\140\230\149\180\231\156\159\230\152\175\231\156\188\231\157\155\228\188\153\228\188\180\229\168\129\230\156\155\233\162\134\229\159\159\229\141\171\231\148\159\228\188\152\230\131\160\232\171\150\229\163\135\229\133\172\229\133\177\232\137\175\229\165\189\229\133\133\229\136\134\231\172\166\229\144\136\233\153\132\228\187\182\231\137\185\231\130\185\228\184\141\229\143\175\232\139\177\230\150\135\232\181\132\228\186\167\230\160\185\230\156\172\230\152\142\230\152\190\229\175\134\231\162\188\229\133\172\228\188\151\230\176\145\230\151\143\230\155\180\229\138\160\228\186\171\229\143\151\229\144\140\229\173\166\229\144\175\229\138\168\233\128\130\229\144\136\229\142\159\230\157\165\233\151\174\231\173\148\230\156\172\230\150\135\231\190\142\233\163\159\231\187\191\232\137\178\231\168\179\229\174\154\231\187\136\228\186\142\231\148\159\231\137\169\228\190\155\230\177\130\230\144\156\231\139\144\229\138\155\233\135\143\228\184\165\233\135\141\230\176\184\232\191\156\229\134\153\231\156\159\230\156\137\233\153\144\231\171\158\228\186\137\229\175\185\232\177\161\232\180\185\231\148\168\228\184\141\229\165\189\231\187\157\229\175\185\229\141\129\229\136\134\228\191\131\232\191\155\231\130\185\232\175\132\229\189\177\233\159\179\228\188\152\229\138\191\228\184\141\229\176\145\230\172\163\232\181\143\229\185\182\228\184\148\230\156\137\231\130\185\230\150\185\229\144\145\229\133\168\230\150\176\228\191\161\231\148\168\232\174\190\230\150\189\229\189\162\232\177\161\232\181\132\230\160\188\231\170\129\231\160\180\233\154\143\231\157\128\233\135\141\229\164\167\228\186\142\230\152\175\230\175\149\228\184\154\230\153\186\232\131\189\229\140\150\229\183\165\229\174\140\231\190\142\229\149\134\229\159\142\231\187\159\228\184\128\229\135\186\231\137\136\230\137\147\233\128\160\231\148\162\229\147\129\230\166\130\229\134\181\231\148\168\228\186\142\228\191\157\231\149\153\229\155\160\231\180\160\228\184\173\229\156\139\229\173\152\229\130\168\232\180\180\229\155\190\230\156\128\230\132\155\233\149\191\230\156\159\229\143\163\228\187\183\231\144\134\232\180\162\229\159\186\229\156\176\229\174\137\230\142\146\230\173\166\230\177\137\233\135\140\233\157\162\229\136\155\229\187\186\229\164\169\231\169\186\233\166\150\229\133\136\229\174\140\229\150\132\233\169\177\229\138\168\228\184\139\233\157\162\228\184\141\229\134\141\232\175\154\228\191\161\230\132\143\228\185\137\233\152\179\229\133\137\232\139\177\229\155\189\230\188\130\228\186\174\229\134\155\228\186\139\231\142\169\229\174\182\231\190\164\228\188\151\229\134\156\230\176\145\229\141\179\229\143\175\229\144\141\231\168\177\229\174\182\229\133\183\229\138\168\231\148\187\230\131\179\229\136\176\230\179\168\230\152\142\229\176\143\229\173\166\230\128\167\232\131\189\232\128\131\231\160\148\231\161\172\228\187\182\232\167\130\231\156\139\230\184\133\230\165\154\230\144\158\231\172\145\233\166\150\233\160\129\233\187\132\233\135\145\233\128\130\231\148\168\230\177\159\232\139\143\231\156\159\229\174\158\228\184\187\231\174\161\233\152\182\230\174\181\232\168\187\229\134\138\231\191\187\232\175\145\230\157\131\229\136\169\229\129\154\229\165\189\228\188\188\228\185\142\233\128\154\232\174\175\230\150\189\229\183\165\231\139\128\230\133\139\228\185\159\232\174\184\231\142\175\228\191\157\229\159\185\229\133\187\230\166\130\229\191\181\229\164\167\229\158\139\230\156\186\231\165\168\231\144\134\232\167\163\229\140\191\229\144\141cuandoenviarmadridbuscariniciotiempoporquecuentaestadopuedenjuegoscontraest\195\161nnombretienenperfilmaneraamigosciudadcentroaunquepuedesdentroprimerprecioseg\195\186nbuenosvolverpuntossemanahab\195\173aagostonuevosunidoscarlosequiponi\195\177osmuchosalgunacorreoimagenpartirarribamar\195\173ahombreempleoverdadcambiomuchasfueronpasadol\195\173neaparecenuevascursosestabaquierolibroscuantoaccesomiguelvarioscuatrotienesgruposser\195\161neuropamediosfrenteacercadem\195\161sofertacochesmodeloitalialetrasalg\195\186ncompracualesexistecuerposiendoprensallegarviajesdineromurciapodr\195\161puestodiariopuebloquieremanuelpropiocrisisciertoseguromuertefuentecerrargrandeefectopartesmedidapropiaofrecetierrae-mailvariasformasfuturoobjetoseguirriesgonormasmismos\195\186nicocaminositiosraz\195\179ndebidopruebatoledoten\195\173ajes\195\186sesperococinaorigentiendacientoc\195\161dizhablarser\195\173alatinafuerzaestiloguerraentrar\195\169xitol\195\179pezagendav\195\173deoevitarpaginametrosjavierpadresf\195\161cilcabeza\195\161reassalidaenv\195\173ojap\195\179nabusosbienestextosllevarpuedanfuertecom\195\186nclaseshumanotenidobilbaounidadest\195\161seditarcreado\208\180\208\187\209\143\209\135\209\130\208\190\208\186\208\176\208\186\208\184\208\187\208\184\209\141\209\130\208\190\208\178\209\129\208\181\208\181\208\179\208\190\208\191\209\128\208\184\209\130\208\176\208\186\208\181\209\137\208\181\209\131\208\182\208\181\208\154\208\176\208\186\208\177\208\181\208\183\208\177\209\139\208\187\208\190\208\189\208\184\208\146\209\129\208\181\208\191\208\190\208\180\208\173\209\130\208\190\209\130\208\190\208\188\209\135\208\181\208\188\208\189\208\181\209\130\208\187\208\181\209\130\209\128\208\176\208\183\208\190\208\189\208\176\208\179\208\180\208\181\208\188\208\189\208\181\208\148\208\187\209\143\208\159\209\128\208\184\208\189\208\176\209\129\208\189\208\184\209\133\209\130\208\181\208\188\208\186\209\130\208\190\208\179\208\190\208\180\208\178\208\190\209\130\209\130\208\176\208\188\208\161\208\168\208\144\208\188\208\176\209\143\208\167\209\130\208\190\208\178\208\176\209\129\208\178\208\176\208\188\208\181\208\188\209\131\208\162\208\176\208\186\208\180\208\178\208\176\208\189\208\176\208\188\209\141\209\130\208\184\209\141\209\130\209\131\208\146\208\176\208\188\209\130\208\181\209\133\208\191\209\128\208\190\209\130\209\131\209\130\208\189\208\176\208\180\208\180\208\189\209\143\208\146\208\190\209\130\209\130\209\128\208\184\208\189\208\181\208\185\208\146\208\176\209\129\208\189\208\184\208\188\209\129\208\176\208\188\209\130\208\190\209\130\209\128\209\131\208\177\208\158\208\189\208\184\208\188\208\184\209\128\208\189\208\181\208\181\208\158\208\158\208\158\208\187\208\184\209\134\209\141\209\130\208\176\208\158\208\189\208\176\208\189\208\181\208\188\208\180\208\190\208\188\208\188\208\190\208\185\208\180\208\178\208\181\208\190\208\189\208\190\209\129\209\131\208\180\224\164\149\224\165\135\224\164\185\224\165\136\224\164\149\224\165\128\224\164\184\224\165\135\224\164\149\224\164\190\224\164\149\224\165\139\224\164\148\224\164\176\224\164\170\224\164\176\224\164\168\224\165\135\224\164\143\224\164\149\224\164\149\224\164\191\224\164\173\224\165\128\224\164\135\224\164\184\224\164\149\224\164\176\224\164\164\224\165\139\224\164\185\224\165\139\224\164\134\224\164\170\224\164\185\224\165\128\224\164\175\224\164\185\224\164\175\224\164\190\224\164\164\224\164\149\224\164\165\224\164\190jagran\224\164\134\224\164\156\224\164\156\224\165\139\224\164\133\224\164\172\224\164\166\224\165\139\224\164\151\224\164\136\224\164\156\224\164\190\224\164\151\224\164\143\224\164\185\224\164\174\224\164\135\224\164\168\224\164\181\224\164\185\224\164\175\224\165\135\224\164\165\224\165\135\224\164\165\224\165\128\224\164\152\224\164\176\224\164\156\224\164\172\224\164\166\224\165\128\224\164\149\224\164\136\224\164\156\224\165\128\224\164\181\224\165\135\224\164\168\224\164\136\224\164\168\224\164\143\224\164\185\224\164\176\224\164\137\224\164\184\224\164\174\224\165\135\224\164\149\224\164\174\224\164\181\224\165\139\224\164\178\224\165\135\224\164\184\224\164\172\224\164\174\224\164\136\224\164\166\224\165\135\224\164\147\224\164\176\224\164\134\224\164\174\224\164\172\224\164\184\224\164\173\224\164\176\224\164\172\224\164\168\224\164\154\224\164\178\224\164\174\224\164\168\224\164\134\224\164\151\224\164\184\224\165\128\224\164\178\224\165\128\216\185\217\132\217\137\216\165\217\132\217\137\217\135\216\176\216\167\216\162\216\174\216\177\216\185\216\175\216\175\216\167\217\132\217\137\217\135\216\176\217\135\216\181\217\136\216\177\216\186\217\138\216\177\217\131\216\167\217\134\217\136\217\132\216\167\216\168\217\138\217\134\216\185\216\177\216\182\216\176\217\132\217\131\217\135\217\134\216\167\217\138\217\136\217\133\217\130\216\167\217\132\216\185\217\132\217\138\216\167\217\134\216\167\217\132\217\131\217\134\216\173\216\170\217\137\217\130\216\168\217\132\217\136\216\173\216\169\216\167\216\174\216\177\217\129\217\130\216\183\216\185\216\168\216\175\216\177\217\131\217\134\216\165\216\176\216\167\217\131\217\133\216\167\216\167\216\173\216\175\216\165\217\132\216\167\217\129\217\138\217\135\216\168\216\185\216\182\217\131\217\138\217\129\216\168\216\173\216\171\217\136\217\133\217\134\217\136\217\135\217\136\216\163\217\134\216\167\216\172\216\175\216\167\217\132\217\135\216\167\216\179\217\132\217\133\216\185\217\134\216\175\217\132\217\138\216\179\216\185\216\168\216\177\216\181\217\132\217\137\217\133\217\134\216\176\216\168\217\135\216\167\216\163\217\134\217\135\217\133\216\171\217\132\217\131\217\134\216\170\216\167\217\132\216\167\216\173\217\138\216\171\217\133\216\181\216\177\216\180\216\177\216\173\216\173\217\136\217\132\217\136\217\129\217\138\216\167\216\176\216\167\217\132\217\131\217\132\217\133\216\177\216\169\216\167\217\134\216\170\216\167\217\132\217\129\216\163\216\168\217\136\216\174\216\167\216\181\216\163\217\134\216\170\216\167\217\134\217\135\216\167\217\132\217\138\216\185\216\182\217\136\217\136\217\130\216\175\216\167\216\168\217\134\216\174\217\138\216\177\216\168\217\134\216\170\217\132\217\131\217\133\216\180\216\167\216\161\217\136\217\135\217\138\216\167\216\168\217\136\217\130\216\181\216\181\217\136\217\133\216\167\216\177\217\130\217\133\216\163\216\173\216\175\217\134\216\173\217\134\216\185\216\175\217\133\216\177\216\163\217\138\216\167\216\173\216\169\217\131\216\170\216\168\216\175\217\136\217\134\217\138\216\172\216\168\217\133\217\134\217\135\216\170\216\173\216\170\216\172\217\135\216\169\216\179\217\134\216\169\217\138\216\170\217\133\217\131\216\177\216\169\216\186\216\178\216\169\217\134\217\129\216\179\216\168\217\138\216\170\217\132\217\132\217\135\217\132\217\134\216\167\216\170\217\132\217\131\217\130\217\132\216\168\217\132\217\133\216\167\216\185\217\134\217\135\216\163\217\136\217\132\216\180\217\138\216\161\217\134\217\136\216\177\216\163\217\133\216\167\217\129\217\138\217\131\216\168\217\131\217\132\216\176\216\167\216\170\216\177\216\170\216\168\216\168\216\163\217\134\217\135\217\133\216\179\216\167\217\134\217\131\216\168\217\138\216\185\217\129\217\130\216\175\216\173\216\179\217\134\217\132\217\135\217\133\216\180\216\185\216\177\216\163\217\135\217\132\216\180\217\135\216\177\217\130\216\183\216\177\216\183\217\132\216\168profileservicedefaulthimselfdetailscontentsupportstartedmessagesuccessfashion<title>countryaccountcreatedstoriesresultsrunningprocesswritingobjectsvisiblewelcomearticleunknownnetworkcompanydynamicbrowserprivacyproblemServicerespectdisplayrequestreservewebsitehistoryfriendsoptionsworkingversionmillionchannelwindow.addressvisitedweathercorrectproductedirectforwardyou canremovedsubjectcontrolarchivecurrentreadinglibrarylimitedmanagerfurthersummarymachineminutesprivatecontextprogramsocietynumberswrittenenabledtriggersourcesloadingelementpartnerfinallyperfectmeaningsystemskeepingculture",journalprojectsurfaces"expiresreviewsbalanceEnglishContentthroughPlease opinioncontactaverageprimaryvillageSpanishgallerydeclinemeetingmissionpopularqualitymeasuregeneralspeciessessionsectionwriterscounterinitialreportsfiguresmembersholdingdisputeearlierexpressdigitalpictureAnothermarriedtrafficleadingchangedcentralvictoryimages/reasonsstudiesfeaturelistingmust beschoolsVersionusuallyepisodeplayinggrowingobviousoverlaypresentactions</ul>\013\010wrapperalreadycertainrealitystorageanotherdesktopofferedpatternunusualDigitalcapitalWebsitefailureconnectreducedAndroiddecadesregular & animalsreleaseAutomatgettingmethodsnothingPopularcaptionletterscapturesciencelicensechangesEngland=1&History = new CentralupdatedSpecialNetworkrequirecommentwarningCollegetoolbarremainsbecauseelectedDeutschfinanceworkersquicklybetweenexactlysettingdiseaseSocietyweaponsexhibit<!--Controlclassescoveredoutlineattacksdevices(windowpurposetitle=\034Mobile killingshowingItaliandroppedheavilyeffects-1']);\010confirmCurrentadvancesharingopeningdrawingbillionorderedGermanyrelated</form>includewhetherdefinedSciencecatalogArticlebuttonslargestuniformjourneysidebarChicagoholidayGeneralpassage,"animatefeelingarrivedpassingnaturalroughly.\010\010The but notdensityBritainChineselack oftributeIreland\034 data-factorsreceivethat isLibraryhusbandin factaffairsCharlesradicalbroughtfindinglanding:lang=\034return leadersplannedpremiumpackageAmericaEdition]"Messageneed tovalue=\034complexlookingstationbelievesmaller-mobilerecordswant tokind ofFirefoxyou aresimilarstudiedmaximumheadingrapidlyclimatekingdomemergedamountsfoundedpioneerformuladynastyhow to SupportrevenueeconomyResultsbrothersoldierlargelycalling."AccountEdward segmentRobert effortsPacificlearnedup withheight:we haveAngelesnations_searchappliedacquiremassivegranted: falsetreatedbiggestbenefitdrivingStudiesminimumperhapsmorningsellingis usedreversevariant role=\034missingachievepromotestudentsomeoneextremerestorebottom:evolvedall thesitemapenglishway to AugustsymbolsCompanymattersmusicalagainstserving})();\013\010paymenttroubleconceptcompareparentsplayersregionsmonitor ''The winningexploreadaptedGalleryproduceabilityenhancecareers). The collectSearch ancientexistedfooter handlerprintedconsoleEasternexportswindowsChannelillegalneutralsuggest_headersigning.html\034>settledwesterncausing-webkitclaimedJusticechaptervictimsThomas mozillapromisepartieseditionoutside:false,hundredOlympic_buttonauthorsreachedchronicdemandssecondsprotectadoptedprepareneithergreatlygreateroverallimprovecommandspecialsearch.worshipfundingthoughthighestinsteadutilityquarterCulturetestingclearlyexposedBrowserliberal} catchProjectexamplehide();FloridaanswersallowedEmperordefenseseriousfreedomSeveral-buttonFurtherout of != nulltrainedDenmarkvoid(0)/all.jspreventRequestStephen\010\010When observe</h2>\013\010Modern provide\034 alt=\034borders.\010\010For \010\010Many artistspoweredperformfictiontype ofmedicalticketsopposedCouncilwitnessjusticeGeorge Belgium...</a>twitternotablywaitingwarfare Other rankingphrasesmentionsurvivescholar</p>\013\010 Countryignoredloss ofjust asGeorgiastrange<head><stopped1']);\013\010islandsnotableborder:list ofcarried100,000</h3>\010 severalbecomesselect wedding00.htmlmonarchoff theteacherhighly biologylife ofor evenrise of»plusonehunting(thoughDouglasjoiningcirclesFor theAncientVietnamvehiclesuch ascrystalvalue =Windowsenjoyeda smallassumed<a id=\034foreign All rihow theDisplayretiredhoweverhidden;battlesseekingcabinetwas notlook atconductget theJanuaryhappensturninga:hoverOnline French lackingtypicalextractenemieseven ifgeneratdecidedare not/searchbeliefs-image:locatedstatic.login\034>convertviolententeredfirst\034>circuitFinlandchemistshe was10px;\034>as suchdivided</span>will beline ofa greatmystery/index.fallingdue to railwaycollegemonsterdescentit withnuclearJewish protestBritishflowerspredictreformsbutton who waslectureinstantsuicidegenericperiodsmarketsSocial fishingcombinegraphicwinners<br /><by the NaturalPrivacycookiesoutcomeresolveSwedishbrieflyPersianso muchCenturydepictscolumnshousingscriptsnext tobearingmappingrevisedjQuery(-width:title\034>tooltipSectiondesignsTurkishyounger.match(})();\010\010burningoperatedegreessource=Richardcloselyplasticentries</tr>\013\010color:#ul id=\034possessrollingphysicsfailingexecutecontestlink toDefault<br />\010: true,chartertourismclassicproceedexplain</h1>\013\010online.?xml vehelpingdiamonduse theairlineend -->).attr(readershosting#ffffffrealizeVincentsignals src=\034/ProductdespitediversetellingPublic held inJoseph theatreaffects<style>a largedoesn'tlater, ElementfaviconcreatorHungaryAirportsee theso thatMichaelSystemsPrograms, and width=e"tradingleft\034>\010personsGolden Affairsgrammarformingdestroyidea ofcase ofoldest this is.src = cartoonregistrCommonsMuslimsWhat isin manymarkingrevealsIndeed,equally/show_aoutdoorescape(Austriageneticsystem,In the sittingHe alsoIslandsAcademy\010\009\009<!--Daniel bindingblock\034>imposedutilizeAbraham(except{width:putting).html(|| [];\010DATA[ *kitchenmountedactual dialectmainly _blank'installexpertsif(typeIt also© \034>Termsborn inOptionseasterntalkingconcerngained ongoingjustifycriticsfactoryits ownassaultinvitedlastinghis ownhref=\034/\034 rel=\034developconcertdiagramdollarsclusterphp?id=alcohol);})();using a><span>vesselsrevivalAddressamateurandroidallegedillnesswalkingcentersqualifymatchesunifiedextinctDefensedied in\010\009<!-- customslinkingLittle Book ofeveningmin.js?are thekontakttoday's.html\034 target=wearingAll Rig;\010})();raising Also, crucialabout\034>declare-->\010<scfirefoxas muchappliesindex, s, but type = \010\013\010<!--towardsRecordsPrivateForeignPremierchoicesVirtualreturnsCommentPoweredinline;povertychamberLiving volumesAnthonylogin\034 RelatedEconomyreachescuttinggravitylife inChapter-shadowNotable</td>\013\010 returnstadiumwidgetsvaryingtravelsheld bywho arework infacultyangularwho hadairporttown of\010\010Some 'click'chargeskeywordit willcity of(this);Andrew unique checkedor more300px; return;rsion=\034pluginswithin herselfStationFederalventurepublishsent totensionactresscome tofingersDuke ofpeople,exploitwhat isharmonya major\034:\034httpin his menu\034>\010monthlyofficercouncilgainingeven inSummarydate ofloyaltyfitnessand wasemperorsupremeSecond hearingRussianlongestAlbertalateralset of small\034>.appenddo withfederalbank ofbeneathDespiteCapitalgrounds), and percentit fromclosingcontainInsteadfifteenas well.yahoo.respondfighterobscurereflectorganic= Math.editingonline paddinga wholeonerroryear ofend of barrierwhen itheader home ofresumedrenamedstrong>heatingretainscloudfrway of March 1knowingin partBetweenlessonsclosestvirtuallinks\034>crossedEND -->famous awardedLicenseHealth fairly wealthyminimalAfricancompetelabel\034>singingfarmersBrasil)discussreplaceGregoryfont copursuedappearsmake uproundedboth ofblockedsaw theofficescoloursif(docuwhen heenforcepush(fuAugust UTF-8\034>Fantasyin mostinjuredUsuallyfarmingclosureobject defenceuse of Medical<body>\010evidentbe usedkeyCodesixteenIslamic#000000entire widely active (typeofone cancolor =speakerextendsPhysicsterrain<tbody>funeralviewingmiddle cricketprophetshifteddoctorsRussell targetcompactalgebrasocial-bulk ofman and</td>\010 he left).val()false);logicalbankinghome tonaming Arizonacredits);\010});\010founderin turnCollinsbefore But thechargedTitle\034>CaptainspelledgoddessTag -->Adding:but wasRecent patientback in=false&Lincolnwe knowCounterJudaismscript altered']);\010 has theunclearEvent',both innot all\010\010<!-- placinghard to centersort ofclientsstreetsBernardassertstend tofantasydown inharbourFreedomjewelry/about..searchlegendsis mademodern only ononly toimage\034 linear painterand notrarely acronymdelivershorter00&as manywidth=\034/* <![Ctitle =of the lowest picked escapeduses ofpeoples PublicMatthewtacticsdamagedway forlaws ofeasy to windowstrong simple}catch(seventhinfoboxwent topaintedcitizenI don'tretreat. Some ww.\034);\010bombingmailto:made in. Many carries||{};wiwork ofsynonymdefeatsfavoredopticalpageTraunless sendingleft\034><comScorAll thejQuery.touristClassicfalse\034 Wilhelmsuburbsgenuinebishops.split(global followsbody ofnominalContactsecularleft tochiefly-hidden-banner</li>\010\010. When in bothdismissExplorealways via thespa\195\177olwelfareruling arrangecaptainhis sonrule ofhe tookitself,=0&(calledsamplesto makecom/pagMartin Kennedyacceptsfull ofhandledBesides//--></able totargetsessencehim to its by common.mineralto takeways tos.org/ladvisedpenaltysimple:if theyLettersa shortHerbertstrikes groups.lengthflightsoverlapslowly lesser social </p>\010\009\009it intoranked rate oful>\013\010 attemptpair ofmake itKontaktAntoniohaving ratings activestreamstrapped\034).css(hostilelead tolittle groups,Picture-->\013\010\013\010 rows=\034 objectinverse<footerCustomV><\092/scrsolvingChamberslaverywoundedwhereas!= 'undfor allpartly -right:Arabianbacked centuryunit ofmobile-Europe,is homerisk ofdesiredClintoncost ofage of become none ofp"Middle ead')[0Criticsstudios>©group\034>assemblmaking pressedwidget.ps:\034 ? rebuiltby someFormer editorsdelayedCanonichad thepushingclass=\034but arepartialBabylonbottom carrierCommandits useAs withcoursesa thirddenotesalso inHouston20px;\034>accuseddouble goal ofFamous ).bind(priests Onlinein Julyst + \034gconsultdecimalhelpfulrevivedis veryr'+'iptlosing femalesis alsostringsdays ofarrivalfuture <objectforcingString(\034 />\010\009\009here isencoded. The balloondone by/commonbgcolorlaw of Indianaavoidedbut the2px 3pxjquery.after apolicy.men andfooter-= true;for usescreen.Indian image =family,http:// driverseternalsame asnoticedviewers})();\010 is moreseasonsformer the newis justconsent Searchwas thewhy theshippedbr><br>width: height=made ofcuisineis thata very Admiral fixed;normal MissionPress, ontariocharsettry to invaded=\034true\034spacingis mosta more totallyfall of});\013\010 immensetime inset outsatisfyto finddown tolot of Playersin Junequantumnot thetime todistantFinnishsrc = (single help ofGerman law andlabeledforestscookingspace\034>header-well asStanleybridges/globalCroatia About [0];\010 it, andgroupedbeing a){throwhe madelighterethicalFFFFFF\034bottom\034like a employslive inas seenprintermost ofub-linkrejectsand useimage\034>succeedfeedingNuclearinformato helpWomen'sNeitherMexicanprotein<table by manyhealthylawsuitdevised.push({sellerssimply Through.cookie Image(older\034>us.js\034> Since universlarger open to!-- endlies in']);\013\010 marketwho is (\034DOMComanagedone fortypeof Kingdomprofitsproposeto showcenter;made itdressedwere inmixtureprecisearisingsrc = 'make a securedBaptistvoting \010\009\009var March 2grew upClimate.removeskilledway the</head>face ofacting right\034>to workreduceshas haderectedshow();action=book ofan area== \034htt<header\010<html>conformfacing cookie.rely onhosted .customhe wentbut forspread Family a meansout theforums.footage\034>MobilClements\034 id=\034as highintense--><!--female is seenimpliedset thea stateand hisfastestbesidesbutton_bounded\034><img Infoboxevents,a youngand areNative cheaperTimeoutand hasengineswon the(mostlyright: find a -bottomPrince area ofmore ofsearch_nature,legallyperiod,land ofor withinducedprovingmissilelocallyAgainstthe wayk"px;\034>\013\010pushed abandonnumeralCertainIn thismore inor somename isand, incrownedISBN 0-createsOctobermay notcenter late inDefenceenactedwish tobroadlycoolingonload=it. TherecoverMembersheight assumes<html>\010people.in one =windowfooter_a good reklamaothers,to this_cookiepanel\034>London,definescrushedbaptismcoastalstatus title\034 move tolost inbetter impliesrivalryservers SystemPerhapses and contendflowinglasted rise inGenesisview ofrising seem tobut in backinghe willgiven agiving cities.flow of Later all butHighwayonly bysign ofhe doesdiffersbattery&lasinglesthreatsintegertake onrefusedcalled =US&See thenativesby thissystem.head of:hover,lesbiansurnameand allcommon/header__paramsHarvard/pixel.removalso longrole ofjointlyskyscraUnicodebr />\013\010AtlantanucleusCounty,purely count\034>easily build aonclicka givenpointerh"events else {\010ditionsnow the, with man whoorg/Webone andcavalryHe diedseattle00,000 {windowhave toif(windand itssolely m"renewedDetroitamongsteither them inSenatorUs</a><King ofFrancis-produche usedart andhim andused byscoringat hometo haverelatesibilityfactionBuffalolink\034><what hefree toCity ofcome insectorscountedone daynervoussquare };if(goin whatimg\034 alis onlysearch/tuesdaylooselySolomonsexual - <a hrmedium\034DO NOT France,with a war andsecond take a >\013\010\013\010\013\010market.highwaydone inctivity\034last\034>obligedrise to\034undefimade to Early praisedin its for hisathleteJupiterYahoo! termed so manyreally s. The a woman?value=direct right\034 bicycleacing=\034day andstatingRather,higher Office are nowtimes, when a pay foron this-link\034>;borderaround annual the Newput the.com\034 takin toa brief(in thegroups.; widthenzymessimple in late{returntherapya pointbanninginks\034>\010();\034 rea place\092u003Caabout atr>\013\010\009\009ccount gives a<SCRIPTRailwaythemes/toolboxById(\034xhumans,watchesin some if (wicoming formats Under but hashanded made bythan infear ofdenoted/iframeleft involtagein eacha"base ofIn manyundergoregimesaction </p>\013\010<ustomVa;></importsor thatmostly &re size=\034</a></ha classpassiveHost = WhetherfertileVarious=[];(fucameras/></td>acts asIn some>\013\010\013\010<!organis <br />Beijingcatal\195\160deutscheuropeueuskaragaeilgesvenskaespa\195\177amensajeusuariotrabajom\195\169xicop\195\161ginasiempresistemaoctubredurantea\195\177adirempresamomentonuestroprimeratrav\195\169sgraciasnuestraprocesoestadoscalidadpersonan\195\186meroacuerdom\195\186sicamiembroofertasalgunospa\195\173sesejemploderechoadem\195\161sprivadoagregarenlacesposiblehotelessevillaprimero\195\186ltimoeventosarchivoculturamujeresentradaanuncioembargomercadograndesestudiomejoresfebrerodise\195\177oturismoc\195\179digoportadaespaciofamiliaantoniopermiteguardaralgunaspreciosalguiensentidovisitast\195\173tuloconocersegundoconsejofranciaminutossegundatenemosefectosm\195\161lagasesi\195\179nrevistagranadacompraringresogarc\195\173aacci\195\179necuadorquienesinclusodeber\195\161materiahombresmuestrapodr\195\173ama\195\177ana\195\186ltimaestamosoficialtambienning\195\186nsaludospodemosmejorarpositionbusinesshomepagesecuritylanguagestandardcampaignfeaturescategoryexternalchildrenreservedresearchexchangefavoritetemplatemilitaryindustryservicesmaterialproductsz-index:commentssoftwarecompletecalendarplatformarticlesrequiredmovementquestionbuildingpoliticspossiblereligionphysicalfeedbackregisterpicturesdisabledprotocolaudiencesettingsactivityelementslearninganythingabstractprogressoverviewmagazineeconomictrainingpressurevarious <strong>propertyshoppingtogetheradvancedbehaviordownloadfeaturedfootballselectedLanguagedistanceremembertrackingpasswordmodifiedstudentsdirectlyfightingnortherndatabasefestivalbreakinglocationinternetdropdownpracticeevidencefunctionmarriageresponseproblemsnegativeprogramsanalysisreleasedbanner\034>purchasepoliciesregionalcreativeargumentbookmarkreferrerchemicaldivisioncallbackseparateprojectsconflicthardwareinterestdeliverymountainobtained= false;for(var acceptedcapacitycomputeridentityaircraftemployedproposeddomesticincludesprovidedhospitalverticalcollapseapproachpartnerslogo\034><adaughterauthor\034 culturalfamilies/images/assemblypowerfulteachingfinisheddistrictcriticalcgi-bin/purposesrequireselectionbecomingprovidesacademicexerciseactuallymedicineconstantaccidentMagazinedocumentstartingbottom\034>observed: "extendedpreviousSoftwarecustomerdecisionstrengthdetailedslightlyplanningtextareacurrencyeveryonestraighttransferpositiveproducedheritageshippingabsolutereceivedrelevantbutton\034 violenceanywherebenefitslaunchedrecentlyalliancefollowedmultiplebulletinincludedoccurredinternal$(this).republic><tr><tdcongressrecordedultimatesolution<ul id=\034discoverHome</a>websitesnetworksalthoughentirelymemorialmessagescontinueactive\034>somewhatvictoriaWestern title=\034LocationcontractvisitorsDownloadwithout right\034>\010measureswidth = variableinvolvedvirginianormallyhappenedaccountsstandingnationalRegisterpreparedcontrolsaccuratebirthdaystrategyofficialgraphicscriminalpossiblyconsumerPersonalspeakingvalidateachieved.jpg\034 />machines</h2>\010 keywordsfriendlybrotherscombinedoriginalcomposedexpectedadequatepakistanfollow\034 valuable</label>relativebringingincreasegovernorplugins/List of Header\034>\034 name=\034 ("graduate</head>\010commercemalaysiadirectormaintain;height:schedulechangingback to catholicpatternscolor: #greatestsuppliesreliable</ul>\010\009\009<select citizensclothingwatching<li id=\034specificcarryingsentence<center>contrastthinkingcatch(e)southernMichael merchantcarouselpadding:interior.split(\034lizationOctober ){returnimproved-->\010\010coveragechairman.png\034 />subjectsRichard whateverprobablyrecoverybaseballjudgmentconnect..css\034 /> websitereporteddefault\034/></a>\013\010electricscotlandcreationquantity. ISBN 0did not instance-search-\034 lang=\034speakersComputercontainsarchivesministerreactiondiscountItalianocriteriastrongly: 'http:'script'coveringofferingappearedBritish identifyFacebooknumerousvehiclesconcernsAmericanhandlingdiv id=\034William provider_contentaccuracysection andersonflexibleCategorylawrence<script>layout=\034approved maximumheader\034></table>Serviceshamiltoncurrent canadianchannels/themes//articleoptionalportugalvalue=\034\034intervalwirelessentitledagenciesSearch\034 measuredthousandspending…new Date\034 size=\034pageNamemiddle\034 \034 /></a>hidden\034>sequencepersonaloverflowopinionsillinoislinks\034>\010\009<title>versionssaturdayterminalitempropengineersectionsdesignerproposal=\034false\034Espa\195\177olreleasessubmit\034 er"additionsymptomsorientedresourceright\034><pleasurestationshistory.leaving border=contentscenter\034>.\010\010Some directedsuitablebulgaria.show();designedGeneral conceptsExampleswilliamsOriginal\034><span>search\034>operatorrequestsa "allowingDocumentrevision. \010\010The yourselfContact michiganEnglish columbiapriorityprintingdrinkingfacilityreturnedContent officersRussian generate-8859-1\034indicatefamiliar qualitymargin:0 contentviewportcontacts-title\034>portable.length eligibleinvolvesatlanticonload=\034default.suppliedpaymentsglossary\010\010After guidance</td><tdencodingmiddle\034>came to displaysscottishjonathanmajoritywidgets.clinicalthailandteachers<head>\010\009affectedsupportspointer;toString</small>oklahomawill be investor0\034 alt=\034holidaysResourcelicensed (which . After considervisitingexplorerprimary search\034 android\034quickly meetingsestimate;return ;color:# height=approval, " checked.min.js\034magnetic></a></hforecast. While thursdaydvertiseéhasClassevaluateorderingexistingpatients Online coloradoOptions\034campbell<!-- end</span><<br />\013\010_popups|sciences," quality Windows assignedheight: <b classle" value=\034 Companyexamples<iframe believespresentsmarshallpart of properly).\010\010The taxonomymuch of </span>\010\034 data-srtugu\195\170sscrollTo project<head>\013\010attorneyemphasissponsorsfancyboxworld's wildlifechecked=sessionsprogrammpx;font- Projectjournalsbelievedvacationthompsonlightingand the special border=0checking</tbody><button Completeclearfix\010<head>\010article <sectionfindingsrole in popular Octoberwebsite exposureused to changesoperatedclickingenteringcommandsinformed numbers </div>creatingonSubmitmarylandcollegesanalyticlistingscontact.loggedInadvisorysiblingscontent\034s")s. This packagescheckboxsuggestspregnanttomorrowspacing=icon.pngjapanesecodebasebutton\034>gamblingsuch as , while </span> missourisportingtop:1px .</span>tensionswidth=\0342lazyloadnovemberused in height=\034cript\034>\010 </<tr><td height:2/productcountry include footer\034 <!-- title\034></jquery.</form>\010(\231\174\128\228\189\147)(\231\185\129\233\171\148)hrvatskiitalianorom\195\162n\196\131t\195\188rk\195\167e\216\167\216\177\216\175\217\136tambi\195\169nnoticiasmensajespersonasderechosnacionalserviciocontactousuariosprogramagobiernoempresasanunciosvalenciacolombiadespu\195\169sdeportesproyectoproductop\195\186bliconosotroshistoriapresentemillonesmediantepreguntaanteriorrecursosproblemasantiagonuestrosopini\195\179nimprimirmientrasam\195\169ricavendedorsociedadrespectorealizarregistropalabrasinter\195\169sentoncesespecialmiembrosrealidadc\195\179rdobazaragozap\195\161ginassocialesbloqueargesti\195\179nalquilersistemascienciascompletoversi\195\179ncompletaestudiosp\195\186blicaobjetivoalicantebuscadorcantidadentradasaccionesarchivossuperiormayor\195\173aalemaniafunci\195\179n\195\186ltimoshaciendoaquellosedici\195\179nfernandoambientefacebooknuestrasclientesprocesosbastantepresentareportarcongresopublicarcomerciocontratoj\195\179venesdistritot\195\169cnicaconjuntoenerg\195\173atrabajarasturiasrecienteutilizarbolet\195\173nsalvadorcorrectatrabajosprimerosnegocioslibertaddetallespantallapr\195\179ximoalmer\195\173aanimalesqui\195\169nescoraz\195\179nsecci\195\179nbuscandoopcionesexteriorconceptotodav\195\173agaler\195\173aescribirmedicinalicenciaconsultaaspectoscr\195\173ticad\195\179laresjusticiadeber\195\161nper\195\173odonecesitamantenerpeque\195\177orecibidatribunaltenerifecanci\195\179ncanariasdescargadiversosmallorcarequieret\195\169cnicodeber\195\173aviviendafinanzasadelantefuncionaconsejosdif\195\173cilciudadesantiguasavanzadat\195\169rminounidadess\195\161nchezcampa\195\177asoftonicrevistascontienesectoresmomentosfacultadcr\195\169ditodiversassupuestofactoressegundospeque\195\177a\208\179\208\190\208\180\208\176\208\181\209\129\208\187\208\184\208\181\209\129\209\130\209\140\208\177\209\139\208\187\208\190\208\177\209\139\209\130\209\140\209\141\209\130\208\190\208\188\208\149\209\129\208\187\208\184\209\130\208\190\208\179\208\190\208\188\208\181\208\189\209\143\208\178\209\129\208\181\209\133\209\141\209\130\208\190\208\185\208\180\208\176\208\182\208\181\208\177\209\139\208\187\208\184\208\179\208\190\208\180\209\131\208\180\208\181\208\189\209\140\209\141\209\130\208\190\209\130\208\177\209\139\208\187\208\176\209\129\208\181\208\177\209\143\208\190\208\180\208\184\208\189\209\129\208\181\208\177\208\181\208\189\208\176\208\180\208\190\209\129\208\176\208\185\209\130\209\132\208\190\209\130\208\190\208\189\208\181\208\179\208\190\209\129\208\178\208\190\208\184\209\129\208\178\208\190\208\185\208\184\208\179\209\128\209\139\209\130\208\190\208\182\208\181\208\178\209\129\208\181\208\188\209\129\208\178\208\190\209\142\208\187\208\184\209\136\209\140\209\141\209\130\208\184\209\133\208\191\208\190\208\186\208\176\208\180\208\189\208\181\208\185\208\180\208\190\208\188\208\176\208\188\208\184\209\128\208\176\208\187\208\184\208\177\208\190\209\130\208\181\208\188\209\131\209\133\208\190\209\130\209\143\208\180\208\178\209\131\209\133\209\129\208\181\209\130\208\184\208\187\209\142\208\180\208\184\208\180\208\181\208\187\208\190\208\188\208\184\209\128\208\181\209\130\208\181\208\177\209\143\209\129\208\178\208\190\208\181\208\178\208\184\208\180\208\181\209\135\208\181\208\179\208\190\209\141\209\130\208\184\208\188\209\129\209\135\208\181\209\130\209\130\208\181\208\188\209\139\209\134\208\181\208\189\209\139\209\129\209\130\208\176\208\187\208\178\208\181\208\180\209\140\209\130\208\181\208\188\208\181\208\178\208\190\208\180\209\139\209\130\208\181\208\177\208\181\208\178\209\139\209\136\208\181\208\189\208\176\208\188\208\184\209\130\208\184\208\191\208\176\209\130\208\190\208\188\209\131\208\191\209\128\208\176\208\178\208\187\208\184\209\134\208\176\208\190\208\180\208\189\208\176\208\179\208\190\208\180\209\139\208\183\208\189\208\176\209\142\208\188\208\190\208\179\209\131\208\180\209\128\209\131\208\179\208\178\209\129\208\181\208\185\208\184\208\180\208\181\209\130\208\186\208\184\208\189\208\190\208\190\208\180\208\189\208\190\208\180\208\181\208\187\208\176\208\180\208\181\208\187\208\181\209\129\209\128\208\190\208\186\208\184\209\142\208\189\209\143\208\178\208\181\209\129\209\140\208\149\209\129\209\130\209\140\209\128\208\176\208\183\208\176\208\189\208\176\209\136\208\184\216\167\217\132\217\132\217\135\216\167\217\132\216\170\217\138\216\172\217\133\217\138\216\185\216\174\216\167\216\181\216\169\216\167\217\132\216\176\217\138\216\185\217\132\217\138\217\135\216\172\216\175\217\138\216\175\216\167\217\132\216\162\217\134\216\167\217\132\216\177\216\175\216\170\216\173\217\131\217\133\216\181\217\129\216\173\216\169\217\131\216\167\217\134\216\170\216\167\217\132\217\132\217\138\217\138\217\131\217\136\217\134\216\180\216\168\217\131\216\169\217\129\217\138\217\135\216\167\216\168\217\134\216\167\216\170\216\173\217\136\216\167\216\161\216\163\217\131\216\171\216\177\216\174\217\132\216\167\217\132\216\167\217\132\216\173\216\168\216\175\217\132\217\138\217\132\216\175\216\177\217\136\216\179\216\167\216\182\216\186\216\183\216\170\217\131\217\136\217\134\217\135\217\134\216\167\217\131\216\179\216\167\216\173\216\169\217\134\216\167\216\175\217\138\216\167\217\132\216\183\216\168\216\185\217\132\217\138\217\131\216\180\217\131\216\177\216\167\217\138\217\133\217\131\217\134\217\133\217\134\217\135\216\167\216\180\216\177\217\131\216\169\216\177\216\166\217\138\216\179\217\134\216\180\217\138\216\183\217\133\216\167\216\176\216\167\216\167\217\132\217\129\217\134\216\180\216\168\216\167\216\168\216\170\216\185\216\168\216\177\216\177\216\173\217\133\216\169\217\131\216\167\217\129\216\169\217\138\217\130\217\136\217\132\217\133\216\177\217\131\216\178\217\131\217\132\217\133\216\169\216\163\216\173\217\133\216\175\217\130\217\132\216\168\217\138\217\138\216\185\217\134\217\138\216\181\217\136\216\177\216\169\216\183\216\177\217\138\217\130\216\180\216\167\216\177\217\131\216\172\217\136\216\167\217\132\216\163\216\174\216\177\217\137\217\133\216\185\217\134\216\167\216\167\216\168\216\173\216\171\216\185\216\177\217\136\216\182\216\168\216\180\217\131\217\132\217\133\216\179\216\172\217\132\216\168\217\134\216\167\217\134\216\174\216\167\217\132\216\175\217\131\216\170\216\167\216\168\217\131\217\132\217\138\216\169\216\168\216\175\217\136\217\134\216\163\217\138\216\182\216\167\217\138\217\136\216\172\216\175\217\129\216\177\217\138\217\130\217\131\216\170\216\168\216\170\216\163\217\129\216\182\217\132\217\133\216\183\216\168\216\174\216\167\217\131\216\171\216\177\216\168\216\167\216\177\217\131\216\167\217\129\216\182\217\132\216\167\216\173\217\132\217\137\217\134\217\129\216\179\217\135\216\163\217\138\216\167\217\133\216\177\216\175\217\136\216\175\216\163\217\134\217\135\216\167\216\175\217\138\217\134\216\167\216\167\217\132\216\167\217\134\217\133\216\185\216\177\216\182\216\170\216\185\217\132\217\133\216\175\216\167\216\174\217\132\217\133\217\133\217\131\217\134\000\000\000\000\000\000\000\000\001\000\001\000\001\000\001\000\002\000\002\000\002\000\002\000\004\000\004\000\004\000\004\000\000\001\002\003\004\005\006\007\007\006\005\004\003\002\001\000\008\009\010\011\012\013\014\015\015\014\013\012\011\010\009\008\016\017\018\019\020\021\022\023\023\022\021\020\019\018\017\016\024\025\026\027\028\029\030\031\031\030\029\028\027\026\025\024\255\255\255\255\000\000\000\000\000\000\000\000\255\255\255\255\001\000\000\000\002\000\000\000\002\000\000\000\001\000\000\000\001\000\000\000\003\000\000\000\255\255\000\001\000\000\000\001\000\000\255\255\000\001\000\000\000\008\000\008\000\008\000\008\000\000\000\001\000\002\000\003\000\004\000\005\000\006\000\007resourcescountriesquestionsequipmentcommunityavailablehighlightDTD/xhtmlmarketingknowledgesomethingcontainerdirectionsubscribeadvertisecharacter\034 value=\034</select>Australia\034 class=\034situationauthorityfollowingprimarilyoperationchallengedevelopedanonymousfunction functionscompaniesstructureagreement\034 title=\034potentialeducationargumentssecondarycopyrightlanguagesexclusivecondition</form>\013\010statementattentionBiography} else {\010solutionswhen the Analyticstemplatesdangeroussatellitedocumentspublisherimportantprototypeinfluence»</effectivegenerallytransformbeautifultransportorganizedpublishedprominentuntil thethumbnailNational .focus();over the migrationannouncedfooter\034>\010exceptionless thanexpensiveformationframeworkterritoryndicationcurrentlyclassNamecriticismtraditionelsewhereAlexanderappointedmaterialsbroadcastmentionedaffiliate</option>treatmentdifferent/default.Presidentonclick=\034biographyotherwisepermanentFran\195\167aisHollywoodexpansionstandards</style>\010reductionDecember preferredCambridgeopponentsBusiness confusion>\010<title>presentedexplaineddoes not worldwideinterfacepositionsnewspaper</table>\010mountainslike the essentialfinancialselectionaction=\034/abandonedEducationparseInt(stabilityunable to</title>\010relationsNote thatefficientperformedtwo yearsSince thethereforewrapper\034>alternateincreasedBattle ofperceivedtrying tonecessaryportrayedelectionsElizabeth</iframe>discoveryinsurances.length;legendaryGeographycandidatecorporatesometimesservices.inherited</strong>CommunityreligiouslocationsCommitteebuildingsthe worldno longerbeginningreferencecannot befrequencytypicallyinto the relative;recordingpresidentinitiallytechniquethe otherit can beexistenceunderlinethis timetelephoneitemscopepracticesadvantage);return For otherprovidingdemocracyboth the extensivesufferingsupportedcomputers functionpracticalsaid thatit may beEnglish</from the scheduleddownloads</label>\010suspectedmargin: 0spiritual</head>\010\010microsoftgraduallydiscussedhe becameexecutivejquery.jshouseholdconfirmedpurchasedliterallydestroyedup to thevariationremainingit is notcenturiesJapanese among thecompletedalgorithminterestsrebellionundefinedencourageresizableinvolvingsensitiveuniversalprovision(althoughfeaturingconducted), which continued-header\034>February numerous overflow:componentfragmentsexcellentcolspan=\034technicalnear the Advanced source ofexpressedHong Kong Facebookmultiple mechanismelevationoffensive</form>\010\009sponsoreddocument.or "there arethose whomovementsprocessesdifficultsubmittedrecommendconvincedpromoting\034 width=\034.replace(classicalcoalitionhis firstdecisionsassistantindicatedevolution-wrapper\034enough toalong thedelivered-->\013\010<!--American protectedNovember </style><furnitureInternet onblur=\034suspendedrecipientbased on Moreover,abolishedcollectedwere madeemotionalemergencynarrativeadvocatespx;bordercommitteddir=\034ltr\034employeesresearch. selectedsuccessorcustomersdisplayedSeptemberaddClass(Facebook suggestedand lateroperatingelaborateSometimesInstitutecertainlyinstalledfollowersJerusalemthey havecomputinggeneratedprovincesguaranteearbitraryrecognizewanted topx;width:theory ofbehaviourWhile theestimatedbegan to it becamemagnitudemust havemore thanDirectoryextensionsecretarynaturallyoccurringvariablesgiven theplatform.</label><failed tocompoundskinds of societiesalongside -->\010\010southwestthe rightradiationmay have unescape(spoken in\034 href=\034/programmeonly the come fromdirectoryburied ina similarthey were</font></Norwegianspecifiedproducingpassenger(new DatetemporaryfictionalAfter theequationsdownload.regularlydeveloperabove thelinked tophenomenaperiod oftooltip\034>substanceautomaticaspect ofAmong theconnectedestimatesAir Forcesystem ofobjectiveimmediatemaking itpaintingsconqueredare stillproceduregrowth ofheaded byEuropean divisionsmoleculesfranchiseintentionattractedchildhoodalso useddedicatedsingaporedegree offather ofconflicts</a></p>\010came fromwere usednote thatreceivingExecutiveeven moreaccess tocommanderPoliticalmusiciansdeliciousprisonersadvent ofUTF-8\034 /><![CDATA[\034>ContactSouthern bgcolor=\034series of. It was in Europepermittedvalidate.appearingofficialsseriously-languageinitiatedextendinglong-terminflationsuch thatgetCookiemarked by</button>implementbut it isincreasesdown the requiringdependent-->\010<!-- interviewWith the copies ofconsensuswas builtVenezuela(formerlythe statepersonnelstrategicfavour ofinventionWikipediacontinentvirtuallywhich wasprincipleComplete identicalshow thatprimitiveaway frommolecularpreciselydissolvedUnder theversion=\034> </It is the This is will haveorganismssome timeFriedrichwas firstthe only fact thatform id=\034precedingTechnicalphysicistoccurs innavigatorsection\034>span id=\034sought tobelow thesurviving}</style>his deathas in thecaused bypartiallyexisting using thewas givena list oflevels ofnotion ofOfficial dismissedscientistresemblesduplicateexplosiverecoveredall othergalleries{padding:people ofregion ofaddressesassociateimg alt=\034in modernshould bemethod ofreportingtimestampneeded tothe Greatregardingseemed toviewed asimpact onidea thatthe Worldheight ofexpandingThese arecurrent\034>carefullymaintainscharge ofClassicaladdressedpredictedownership<div id=\034right\034>\013\010residenceleave thecontent\034>are often })();\013\010probably Professor-button\034 respondedsays thathad to beplaced inHungarianstatus ofserves asUniversalexecutionaggregatefor whichinfectionagreed tohowever, popular\034>placed onconstructelectoralsymbol ofincludingreturn toarchitectChristianprevious living ineasier toprofessor\010<!-- effect ofanalyticswas takenwhere thetook overbelief inAfrikaansas far aspreventedwork witha special<fieldsetChristmasRetrieved\010\010In the back intonortheastmagazines><strong>committeegoverninggroups ofstored inestablisha generalits firsttheir ownpopulatedan objectCaribbeanallow thedistrictswisconsinlocation.; width: inhabitedSocialistJanuary 1</footer>similarlychoice ofthe same specific business The first.length; desire todeal withsince theuserAgentconceivedindex.phpas "engage inrecently,few yearswere also\010<head>\010<edited byare knowncities inaccesskeycondemnedalso haveservices,family ofSchool ofconvertednature of languageministers</object>there is a popularsequencesadvocatedThey wereany otherlocation=enter themuch morereflectedwas namedoriginal a typicalwhen theyengineerscould notresidentswednesdaythe third productsJanuary 2what theya certainreactionsprocessorafter histhe last contained\034></div>\010</a></td>depend onsearch\034>\010pieces ofcompetingReferencetennesseewhich has version=</span> <</header>gives thehistorianvalue=\034\034>padding:0view thattogether,the most was foundsubset ofattack onchildren,points ofpersonal position:allegedlyClevelandwas laterand afterare givenwas stillscrollingdesign ofmakes themuch lessAmericans.\010\010After , but theMuseum oflouisiana(from theminnesotaparticlesa processDominicanvolume ofreturningdefensive00px|righmade frommouseover\034 style=\034states of(which iscontinuesFranciscobuilding without awith somewho woulda form ofa part ofbefore itknown as Serviceslocation and oftenmeasuringand it ispaperbackvalues of\013\010<title>= window.determineer" played byand early</center>from thisthe threepower andof "innerHTML<a href=\034y:inline;Church ofthe eventvery highofficial -height: content=\034/cgi-bin/to createafrikaansesperantofran\195\167aislatvie\197\161ulietuvi\197\179\196\140e\197\161tina\196\141e\197\161tina\224\185\132\224\184\151\224\184\162\230\151\165\230\156\172\232\170\158\231\174\128\228\189\147\229\173\151\231\185\129\233\171\148\229\173\151\237\149\156\234\181\173\236\150\180\228\184\186\228\187\128\228\185\136\232\174\161\231\174\151\230\156\186\231\172\148\232\174\176\230\156\172\232\168\142\232\171\150\229\141\128\230\156\141\229\138\161\229\153\168\228\186\146\232\129\148\231\189\145\230\136\191\229\156\176\228\186\167\228\191\177\228\185\144\233\131\168\229\135\186\231\137\136\231\164\190\230\142\146\232\161\140\230\166\156\233\131\168\232\144\189\230\160\188\232\191\155\228\184\128\230\173\165\230\148\175\228\187\152\229\174\157\233\170\140\232\175\129\231\160\129\229\167\148\229\145\152\228\188\154\230\149\176\230\141\174\229\186\147\230\182\136\232\180\185\232\128\133\229\138\158\229\133\172\229\174\164\232\174\168\232\174\186\229\140\186\230\183\177\229\156\179\229\184\130\230\146\173\230\148\190\229\153\168\229\140\151\228\186\172\229\184\130\229\164\167\229\173\166\231\148\159\232\182\138\230\157\165\232\182\138\231\174\161\231\144\134\229\145\152\228\191\161\230\129\175\231\189\145serviciosart\195\173culoargentinabarcelonacualquierpublicadoproductospol\195\173ticarespuestawikipediasiguienteb\195\186squedacomunidadseguridadprincipalpreguntascontenidorespondervenezuelaproblemasdiciembrerelaci\195\179nnoviembresimilaresproyectosprogramasinstitutoactividadencuentraeconom\195\173aim\195\161genescontactardescargarnecesarioatenci\195\179ntel\195\169fonocomisi\195\179ncancionescapacidadencontraran\195\161lisisfavoritost\195\169rminosprovinciaetiquetaselementosfuncionesresultadocar\195\161cterpropiedadprincipionecesidadmunicipalcreaci\195\179ndescargaspresenciacomercialopinionesejercicioeditorialsalamancagonz\195\161lezdocumentopel\195\173cularecientesgeneralestarragonapr\195\161cticanovedadespropuestapacientest\195\169cnicasobjetivoscontactos\224\164\174\224\165\135\224\164\130\224\164\178\224\164\191\224\164\143\224\164\185\224\165\136\224\164\130\224\164\151\224\164\175\224\164\190\224\164\184\224\164\190\224\164\165\224\164\143\224\164\181\224\164\130\224\164\176\224\164\185\224\165\135\224\164\149\224\165\139\224\164\136\224\164\149\224\165\129\224\164\155\224\164\176\224\164\185\224\164\190\224\164\172\224\164\190\224\164\166\224\164\149\224\164\185\224\164\190\224\164\184\224\164\173\224\165\128\224\164\185\224\165\129\224\164\143\224\164\176\224\164\185\224\165\128\224\164\174\224\165\136\224\164\130\224\164\166\224\164\191\224\164\168\224\164\172\224\164\190\224\164\164diplodocs\224\164\184\224\164\174\224\164\175\224\164\176\224\165\130\224\164\170\224\164\168\224\164\190\224\164\174\224\164\170\224\164\164\224\164\190\224\164\171\224\164\191\224\164\176\224\164\148\224\164\184\224\164\164\224\164\164\224\164\176\224\164\185\224\164\178\224\165\139\224\164\151\224\164\185\224\165\129\224\164\134\224\164\172\224\164\190\224\164\176\224\164\166\224\165\135\224\164\182\224\164\185\224\165\129\224\164\136\224\164\150\224\165\135\224\164\178\224\164\175\224\164\166\224\164\191\224\164\149\224\164\190\224\164\174\224\164\181\224\165\135\224\164\172\224\164\164\224\165\128\224\164\168\224\164\172\224\165\128\224\164\154\224\164\174\224\165\140\224\164\164\224\164\184\224\164\190\224\164\178\224\164\178\224\165\135\224\164\150\224\164\156\224\165\137\224\164\172\224\164\174\224\164\166\224\164\166\224\164\164\224\164\165\224\164\190\224\164\168\224\164\185\224\165\128\224\164\182\224\164\185\224\164\176\224\164\133\224\164\178\224\164\151\224\164\149\224\164\173\224\165\128\224\164\168\224\164\151\224\164\176\224\164\170\224\164\190\224\164\184\224\164\176\224\164\190\224\164\164\224\164\149\224\164\191\224\164\143\224\164\137\224\164\184\224\165\135\224\164\151\224\164\175\224\165\128\224\164\185\224\165\130\224\164\129\224\164\134\224\164\151\224\165\135\224\164\159\224\165\128\224\164\174\224\164\150\224\165\139\224\164\156\224\164\149\224\164\190\224\164\176\224\164\133\224\164\173\224\165\128\224\164\151\224\164\175\224\165\135\224\164\164\224\165\129\224\164\174\224\164\181\224\165\139\224\164\159\224\164\166\224\165\135\224\164\130\224\164\133\224\164\151\224\164\176\224\164\144\224\164\184\224\165\135\224\164\174\224\165\135\224\164\178\224\164\178\224\164\151\224\164\190\224\164\185\224\164\190\224\164\178\224\164\138\224\164\170\224\164\176\224\164\154\224\164\190\224\164\176\224\164\144\224\164\184\224\164\190\224\164\166\224\165\135\224\164\176\224\164\156\224\164\191\224\164\184\224\164\166\224\164\191\224\164\178\224\164\172\224\164\130\224\164\166\224\164\172\224\164\168\224\164\190\224\164\185\224\165\130\224\164\130\224\164\178\224\164\190\224\164\150\224\164\156\224\165\128\224\164\164\224\164\172\224\164\159\224\164\168\224\164\174\224\164\191\224\164\178\224\164\135\224\164\184\224\165\135\224\164\134\224\164\168\224\165\135\224\164\168\224\164\175\224\164\190\224\164\149\224\165\129\224\164\178\224\164\178\224\165\137\224\164\151\224\164\173\224\164\190\224\164\151\224\164\176\224\165\135\224\164\178\224\164\156\224\164\151\224\164\185\224\164\176\224\164\190\224\164\174\224\164\178\224\164\151\224\165\135\224\164\170\224\165\135\224\164\156\224\164\185\224\164\190\224\164\165\224\164\135\224\164\184\224\165\128\224\164\184\224\164\185\224\165\128\224\164\149\224\164\178\224\164\190\224\164\160\224\165\128\224\164\149\224\164\185\224\164\190\224\164\129\224\164\166\224\165\130\224\164\176\224\164\164\224\164\185\224\164\164\224\164\184\224\164\190\224\164\164\224\164\175\224\164\190\224\164\166\224\164\134\224\164\175\224\164\190\224\164\170\224\164\190\224\164\149\224\164\149\224\165\140\224\164\168\224\164\182\224\164\190\224\164\174\224\164\166\224\165\135\224\164\150\224\164\175\224\164\185\224\165\128\224\164\176\224\164\190\224\164\175\224\164\150\224\165\129\224\164\166\224\164\178\224\164\151\224\165\128categoriesexperience</title>\013\010Copyright javascriptconditionseverything<p class=\034technologybackground<a class=\034management© 201javaScriptcharactersbreadcrumbthemselveshorizontalgovernmentCaliforniaactivitiesdiscoveredNavigationtransitionconnectionnavigationappearance</title><mcheckbox\034 techniquesprotectionapparentlyas well asunt', 'UA-resolutionoperationstelevisiontranslatedWashingtonnavigator. = window.impression<br>literaturepopulationbgcolor=\034#especially content=\034productionnewsletterpropertiesdefinitionleadershipTechnologyParliamentcomparisonul class=\034.indexOf(\034conclusiondiscussioncomponentsbiologicalRevolution_containerunderstoodnoscript><permissioneach otheratmosphere onfocus=\034<form id=\034processingthis.valuegenerationConferencesubsequentwell-knownvariationsreputationphenomenondisciplinelogo.png\034 (document,boundariesexpressionsettlementBackgroundout of theenterprise(\034https:\034 unescape(\034password\034 democratic<a href=\034/wrapper\034>\010membershiplinguisticpx;paddingphilosophyassistanceuniversityfacilitiesrecognizedpreferenceif (typeofmaintainedvocabularyhypothesis.submit();&nbsp;annotationbehind theFoundationpublisher\034assumptionintroducedcorruptionscientistsexplicitlyinstead ofdimensions onClick=\034considereddepartmentoccupationsoon afterinvestmentpronouncedidentifiedexperimentManagementgeographic\034 height=\034link rel=\034.replace(/depressionconferencepunishmenteliminatedresistanceadaptationoppositionwell knownsupplementdeterminedh1 class=\0340px;marginmechanicalstatisticscelebratedGovernment\010\010During tdevelopersartificialequivalentoriginatedCommissionattachment<span id=\034there wereNederlandsbeyond theregisteredjournalistfrequentlyall of thelang=\034en\034 </style>\013\010absolute; supportingextremely mainstream</strong> popularityemployment</table>\013\010 colspan=\034</form>\010 conversionabout the </p></div>integrated\034 lang=\034enPortuguesesubstituteindividualimpossiblemultimediaalmost allpx solid #apart fromsubject toin Englishcriticizedexcept forguidelinesoriginallyremarkablethe secondh2 class=\034<a title=\034(includingparametersprohibited= \034http://dictionaryperceptionrevolutionfoundationpx;height:successfulsupportersmillenniumhis fatherthe "no-repeat;commercialindustrialencouragedamount of unofficialefficiencyReferencescoordinatedisclaimerexpeditiondevelopingcalculatedsimplifiedlegitimatesubstring(0\034 class=\034completelyillustratefive yearsinstrumentPublishing1\034 class=\034psychologyconfidencenumber of absence offocused onjoined thestructurespreviously></iframe>once againbut ratherimmigrantsof course,a group ofLiteratureUnlike the</a> \010function it was theConventionautomobileProtestantaggressiveafter the Similarly,\034 /></div>collection\013\010functionvisibilitythe use ofvolunteersattractionunder the threatened*<![CDATA[importancein generalthe latter</form>\010</.indexOf('i = 0; i <differencedevoted totraditionssearch forultimatelytournamentattributesso-called }\010</style>evaluationemphasizedaccessible</section>successionalong withMeanwhile,industries</a><br />has becomeaspects ofTelevisionsufficientbasketballboth sidescontinuingan article<img alt=\034adventureshis mothermanchesterprinciplesparticularcommentaryeffects ofdecided to\034><strong>publishersJournal ofdifficultyfacilitateacceptablestyle.css\034\009function innovation>Copyrightsituationswould havebusinessesDictionarystatementsoften usedpersistentin Januarycomprising</title>\010\009diplomaticcontainingperformingextensionsmay not beconcept of onclick=\034It is alsofinancial making theLuxembourgadditionalare calledengaged in\034script\034);but it waselectroniconsubmit=\034\010<!-- End electricalofficiallysuggestiontop of theunlike theAustralianOriginallyreferences\010</head>\013\010recognisedinitializelimited toAlexandriaretirementAdventuresfour years\010\010<!-- increasingdecorationh3 class=\034origins ofobligationregulationclassified(function(advantagesbeing the historians<base hrefrepeatedlywilling tocomparabledesignatednominationfunctionalinside therevelationend of thes for the authorizedrefused totake placeautonomouscompromisepolitical restauranttwo of theFebruary 2quality ofswfobject.understandnearly allwritten byinterviews\034 width=\0341withdrawalfloat:leftis usuallycandidatesnewspapersmysteriousDepartmentbest knownparliamentsuppressedconvenientremembereddifferent systematichas led topropagandacontrolledinfluencesceremonialproclaimedProtectionli class=\034Scientificclass=\034no-trademarksmore than widespreadLiberationtook placeday of theas long asimprisonedAdditional\010<head>\010<mLaboratoryNovember 2exceptionsIndustrialvariety offloat: lefDuring theassessmenthave been deals withStatisticsoccurrence/ul></div>clearfix\034>the publicmany yearswhich wereover time,synonymouscontent\034>\010presumablyhis familyuserAgent.unexpectedincluding challengeda minorityundefined\034belongs totaken fromin Octoberposition: said to bereligious Federation rowspan=\034only a fewmeant thatled to the-->\013\010<div <fieldset>Archbishop class=\034nobeing usedapproachesprivilegesnoscript>\010results inmay be theEaster eggmechanismsreasonablePopulationCollectionselected\034>noscript>\013/index.phparrival of-jssdk'));managed toincompletecasualtiescompletionChristiansSeptember arithmeticproceduresmight haveProductionit appearsPhilosophyfriendshipleading togiving thetoward theguaranteeddocumentedcolor:#000video gamecommissionreflectingchange theassociatedsans-serifonkeypress; padding:He was theunderlyingtypically , and the srcElementsuccessivesince the should be networkingaccountinguse of thelower thanshows that</span>\010\009\009complaintscontinuousquantitiesastronomerhe did notdue to itsapplied toan averageefforts tothe futureattempt toTherefore,capabilityRepublicanwas formedElectronickilometerschallengespublishingthe formerindigenousdirectionssubsidiaryconspiracydetails ofand in theaffordablesubstancesreason forconventionitemtype=\034absolutelysupposedlyremained aattractivetravellingseparatelyfocuses onelementaryapplicablefound thatstylesheetmanuscriptstands for no-repeat(sometimesCommercialin Americaundertakenquarter ofan examplepersonallyindex.php?</button>\010percentagebest-knowncreating a\034 dir=\034ltrLieutenant\010<div id=\034they wouldability ofmade up ofnoted thatclear thatargue thatto anotherchildren'spurpose offormulatedbased uponthe regionsubject ofpassengerspossession.\010\010In the Before theafterwardscurrently across thescientificcommunity.capitalismin Germanyright-wingthe systemSociety ofpoliticiandirection:went on toremoval of New York apartmentsindicationduring theunless thehistoricalhad been adefinitiveingredientattendanceCenter forprominencereadyStatestrategiesbut in theas part ofconstituteclaim thatlaboratorycompatiblefailure of, such as began withusing the to providefeature offrom which/\034 class=\034geologicalseveral ofdeliberateimportant holds thating" valign=topthe Germanoutside ofnegotiatedhis careerseparationid=\034searchwas calledthe fourthrecreationother thanpreventionwhile the education,connectingaccuratelywere builtwas killedagreementsmuch more Due to thewidth: 100some otherKingdom ofthe entirefamous forto connectobjectivesthe Frenchpeople andfeatured\034>is said tostructuralreferendummost oftena separate->\010<div id Official worldwide.aria-labelthe planetand it wasd\034 value=\034looking atbeneficialare in themonitoringreportedlythe modernworking onallowed towhere the innovative</a></div>soundtracksearchFormtend to beinput id=\034opening ofrestrictedadopted byaddressingtheologianmethods ofvariant ofChristian very largeautomotiveby far therange frompursuit offollow thebrought toin Englandagree thataccused ofcomes frompreventingdiv style=his or hertremendousfreedom ofconcerning0 1em 1em;Basketball/style.cssan earliereven after/\034 title=\034.com/indextaking thepittsburghcontent\034>\013<script>(fturned outhaving the</span>\013\010 occasionalbecause itstarted tophysically></div>\010 created byCurrently, bgcolor=\034tabindex=\034disastrousAnalytics also has a><div id=\034</style>\010<called forsinger and.src = \034//violationsthis pointconstantlyis locatedrecordingsd from thenederlandsportugu\195\170s\215\162\215\145\215\168\215\153\215\170\217\129\216\167\216\177\216\179\219\140desarrollocomentarioeducaci\195\179nseptiembreregistradodirecci\195\179nubicaci\195\179npublicidadrespuestasresultadosimportantereservadosart\195\173culosdiferentessiguientesrep\195\186blicasituaci\195\179nministerioprivacidaddirectorioformaci\195\179npoblaci\195\179npresidentecontenidosaccesoriostechnoratipersonalescategor\195\173aespecialesdisponibleactualidadreferenciavalladolidbibliotecarelacionescalendariopol\195\173ticasanterioresdocumentosnaturalezamaterialesdiferenciaecon\195\179micatransporterodr\195\173guezparticiparencuentrandiscusi\195\179nestructurafundaci\195\179nfrecuentespermanentetotalmente\208\188\208\190\208\182\208\189\208\190\208\177\209\131\208\180\208\181\209\130\208\188\208\190\208\182\208\181\209\130\208\178\209\128\208\181\208\188\209\143\209\130\208\176\208\186\208\182\208\181\209\135\209\130\208\190\208\177\209\139\208\177\208\190\208\187\208\181\208\181\208\190\209\135\208\181\208\189\209\140\209\141\209\130\208\190\208\179\208\190\208\186\208\190\208\179\208\180\208\176\208\191\208\190\209\129\208\187\208\181\208\178\209\129\208\181\208\179\208\190\209\129\208\176\208\185\209\130\208\181\209\135\208\181\209\128\208\181\208\183\208\188\208\190\208\179\209\131\209\130\209\129\208\176\208\185\209\130\208\176\208\182\208\184\208\183\208\189\208\184\208\188\208\181\208\182\208\180\209\131\208\177\209\131\208\180\209\131\209\130\208\159\208\190\208\184\209\129\208\186\208\183\208\180\208\181\209\129\209\140\208\178\208\184\208\180\208\181\208\190\209\129\208\178\209\143\208\183\208\184\208\189\209\131\208\182\208\189\208\190\209\129\208\178\208\190\208\181\208\185\208\187\209\142\208\180\208\181\208\185\208\191\208\190\209\128\208\189\208\190\208\188\208\189\208\190\208\179\208\190\208\180\208\181\209\130\208\181\208\185\209\129\208\178\208\190\208\184\209\133\208\191\209\128\208\176\208\178\208\176\209\130\208\176\208\186\208\190\208\185\208\188\208\181\209\129\209\130\208\190\208\184\208\188\208\181\208\181\209\130\208\182\208\184\208\183\208\189\209\140\208\190\208\180\208\189\208\190\208\185\208\187\209\131\209\135\209\136\208\181\208\191\208\181\209\128\208\181\208\180\209\135\208\176\209\129\209\130\208\184\209\135\208\176\209\129\209\130\209\140\209\128\208\176\208\177\208\190\209\130\208\189\208\190\208\178\209\139\209\133\208\191\209\128\208\176\208\178\208\190\209\129\208\190\208\177\208\190\208\185\208\191\208\190\209\130\208\190\208\188\208\188\208\181\208\189\208\181\208\181\209\135\208\184\209\129\208\187\208\181\208\189\208\190\208\178\209\139\208\181\209\131\209\129\208\187\209\131\208\179\208\190\208\186\208\190\208\187\208\190\208\189\208\176\208\183\208\176\208\180\209\130\208\176\208\186\208\190\208\181\209\130\208\190\208\179\208\180\208\176\208\191\208\190\209\135\209\130\208\184\208\159\208\190\209\129\208\187\208\181\209\130\208\176\208\186\208\184\208\181\208\189\208\190\208\178\209\139\208\185\209\129\209\130\208\190\208\184\209\130\209\130\208\176\208\186\208\184\209\133\209\129\209\128\208\176\208\183\209\131\208\161\208\176\208\189\208\186\209\130\209\132\208\190\209\128\209\131\208\188\208\154\208\190\208\179\208\180\208\176\208\186\208\189\208\184\208\179\208\184\209\129\208\187\208\190\208\178\208\176\208\189\208\176\209\136\208\181\208\185\208\189\208\176\208\185\209\130\208\184\209\129\208\178\208\190\208\184\208\188\209\129\208\178\209\143\208\183\209\140\208\187\209\142\208\177\208\190\208\185\209\135\208\176\209\129\209\130\208\190\209\129\209\128\208\181\208\180\208\184\208\154\209\128\208\190\208\188\208\181\208\164\208\190\209\128\209\131\208\188\209\128\209\139\208\189\208\186\208\181\209\129\209\130\208\176\208\187\208\184\208\191\208\190\208\184\209\129\208\186\209\130\209\139\209\129\209\143\209\135\208\188\208\181\209\129\209\143\209\134\209\134\208\181\208\189\209\130\209\128\209\130\209\128\209\131\208\180\208\176\209\129\208\176\208\188\209\139\209\133\209\128\209\139\208\189\208\186\208\176\208\157\208\190\208\178\209\139\208\185\209\135\208\176\209\129\208\190\208\178\208\188\208\181\209\129\209\130\208\176\209\132\208\184\208\187\209\140\208\188\208\188\208\176\209\128\209\130\208\176\209\129\209\130\209\128\208\176\208\189\208\188\208\181\209\129\209\130\208\181\209\130\208\181\208\186\209\129\209\130\208\189\208\176\209\136\208\184\209\133\208\188\208\184\208\189\209\131\209\130\208\184\208\188\208\181\208\189\208\184\208\184\208\188\208\181\209\142\209\130\208\189\208\190\208\188\208\181\209\128\208\179\208\190\209\128\208\190\208\180\209\129\208\176\208\188\208\190\208\188\209\141\209\130\208\190\208\188\209\131\208\186\208\190\208\189\209\134\208\181\209\129\208\178\208\190\208\181\208\188\208\186\208\176\208\186\208\190\208\185\208\144\209\128\209\133\208\184\208\178\217\133\217\134\216\170\216\175\217\137\216\165\216\177\216\179\216\167\217\132\216\177\216\179\216\167\217\132\216\169\216\167\217\132\216\185\216\167\217\133\217\131\216\170\216\168\217\135\216\167\216\168\216\177\216\167\217\133\216\172\216\167\217\132\217\138\217\136\217\133\216\167\217\132\216\181\217\136\216\177\216\172\216\175\217\138\216\175\216\169\216\167\217\132\216\185\216\182\217\136\216\165\216\182\216\167\217\129\216\169\216\167\217\132\217\130\216\179\217\133\216\167\217\132\216\185\216\167\216\168\216\170\216\173\217\133\217\138\217\132\217\133\217\132\217\129\216\167\216\170\217\133\217\132\216\170\217\130\217\137\216\170\216\185\216\175\217\138\217\132\216\167\217\132\216\180\216\185\216\177\216\163\216\174\216\168\216\167\216\177\216\170\216\183\217\136\217\138\216\177\216\185\217\132\217\138\217\131\217\133\216\165\216\177\217\129\216\167\217\130\216\183\217\132\216\168\216\167\216\170\216\167\217\132\217\132\216\186\216\169\216\170\216\177\216\170\217\138\216\168\216\167\217\132\217\134\216\167\216\179\216\167\217\132\216\180\217\138\216\174\217\133\217\134\216\170\216\175\217\138\216\167\217\132\216\185\216\177\216\168\216\167\217\132\217\130\216\181\216\181\216\167\217\129\217\132\216\167\217\133\216\185\217\132\217\138\217\135\216\167\216\170\216\173\216\175\217\138\216\171\216\167\217\132\217\132\217\135\217\133\216\167\217\132\216\185\217\133\217\132\217\133\217\131\216\170\216\168\216\169\217\138\217\133\217\131\217\134\217\131\216\167\217\132\216\183\217\129\217\132\217\129\217\138\216\175\217\138\217\136\216\165\216\175\216\167\216\177\216\169\216\170\216\167\216\177\217\138\216\174\216\167\217\132\216\181\216\173\216\169\216\170\216\179\216\172\217\138\217\132\216\167\217\132\217\136\217\130\216\170\216\185\217\134\216\175\217\133\216\167\217\133\216\175\217\138\217\134\216\169\216\170\216\181\217\133\217\138\217\133\216\163\216\177\216\180\217\138\217\129\216\167\217\132\216\176\217\138\217\134\216\185\216\177\216\168\217\138\216\169\216\168\217\136\216\167\216\168\216\169\216\163\217\132\216\185\216\167\216\168\216\167\217\132\216\179\217\129\216\177\217\133\216\180\216\167\217\131\217\132\216\170\216\185\216\167\217\132\217\137\216\167\217\132\216\163\217\136\217\132\216\167\217\132\216\179\217\134\216\169\216\172\216\167\217\133\216\185\216\169\216\167\217\132\216\181\216\173\217\129\216\167\217\132\216\175\217\138\217\134\217\131\217\132\217\133\216\167\216\170\216\167\217\132\216\174\216\167\216\181\216\167\217\132\217\133\217\132\217\129\216\163\216\185\216\182\216\167\216\161\217\131\216\170\216\167\216\168\216\169\216\167\217\132\216\174\217\138\216\177\216\177\216\179\216\167\216\166\217\132\216\167\217\132\217\130\217\132\216\168\216\167\217\132\216\163\216\175\216\168\217\133\217\130\216\167\216\183\216\185\217\133\216\177\216\167\216\179\217\132\217\133\217\134\216\183\217\130\216\169\216\167\217\132\217\131\216\170\216\168\216\167\217\132\216\177\216\172\217\132\216\167\216\180\216\170\216\177\217\131\216\167\217\132\217\130\216\175\217\133\217\138\216\185\216\183\217\138\217\131sByTagName(.jpg\034 alt=\0341px solid #.gif\034 alt=\034transparentinformationapplication\034 onclick=\034establishedadvertising.png\034 alt=\034environmentperformanceappropriate&mdash;immediately</strong></rather thantemperaturedevelopmentcompetitionplaceholdervisibility:copyright\034>0\034 height=\034even thoughreplacementdestinationCorporation<ul class=\034AssociationindividualsperspectivesetTimeout(url(http://mathematicsmargin-top:eventually description) no-repeatcollections.JPG|thumb|participate/head><bodyfloat:left;<li class=\034hundreds of\010\010However, compositionclear:both;cooperationwithin the label for=\034border-top:New Zealandrecommendedphotographyinteresting<sup>controversyNetherlandsalternativemaxlength=\034switzerlandDevelopmentessentially\010\010Although </textarea>thunderbirdrepresented&ndash;speculationcommunitieslegislationelectronics\010\009<div id=\034illustratedengineeringterritoriesauthoritiesdistributed6\034 height=\034sans-serif;capable of disappearedinteractivelooking forit would beAfghanistanwas createdMath.floor(surroundingcan also beobservationmaintenanceencountered<h2 class=\034more recentit has beeninvasion of).getTime()fundamentalDespite the\034><div id=\034inspirationexaminationpreparationexplanation<input id=\034</a></span>versions ofinstrumentsbefore the = 'http://Descriptionrelatively .substring(each of theexperimentsinfluentialintegrationmany peopledue to the combinationdo not haveMiddle East<noscript><copyright\034 perhaps theinstitutionin Decemberarrangementmost famouspersonalitycreation oflimitationsexclusivelysovereignty-content\034>\010<td class=\034undergroundparallel todoctrine ofoccupied byterminologyRenaissancea number ofsupport forexplorationrecognitionpredecessor<img src=\034/<h1 class=\034publicationmay also bespecialized</fieldset>progressivemillions ofstates thatenforcementaround the one another.parentNodeagricultureAlternativeresearcherstowards theMost of themany other (especially<td width=\034;width:100%independent<h3 class=\034 onchange=\034).addClass(interactionOne of the daughter ofaccessoriesbranches of\013\010<div id=\034the largestdeclarationregulationsInformationtranslationdocumentaryin order to\034>\010<head>\010<\034 height=\0341across the orientation);</script>implementedcan be seenthere was ademonstratecontainer\034>connectionsthe Britishwas written!important;px; margin-followed byability to complicatedduring the immigrationalso called<h4 class=\034distinctionreplaced bygovernmentslocation ofin Novemberwhether the</p>\010</div>acquisitioncalled the persecutiondesignation{font-size:appeared ininvestigateexperiencedmost likelywidely useddiscussionspresence of (document.extensivelyIt has beenit does notcontrary toinhabitantsimprovementscholarshipconsumptioninstructionfor exampleone or morepx; paddingthe currenta series ofare usuallyrole in thepreviously derivativesevidence ofexperiencescolorschemestated thatcertificate</a></div>\010 selected=\034high schoolresponse tocomfortableadoption ofthree yearsthe countryin Februaryso that thepeople who provided by<param nameaffected byin terms ofappointmentISO-8859-1\034was born inhistorical regarded asmeasurementis based on and other : function(significantcelebrationtransmitted/js/jquery.is known astheoretical tabindex=\034it could be<noscript>\010having been\013\010<head>\013\010< "The compilationhe had beenproduced byphilosopherconstructedintended toamong othercompared toto say thatEngineeringa differentreferred todifferencesbelief thatphotographsidentifyingHistory of Republic ofnecessarilyprobabilitytechnicallyleaving thespectacularfraction ofelectricityhead of therestaurantspartnershipemphasis onmost recentshare with saying thatfilled withdesigned toit is often\034></iframe>as follows:merged withthrough thecommercial pointed outopportunityview of therequirementdivision ofprogramminghe receivedsetInterval\034></span></in New Yorkadditional compression\010\010<div id=\034incorporate;</script><attachEventbecame the \034 target=\034_carried outSome of thescience andthe time ofContainer\034>maintainingChristopherMuch of thewritings of\034 height=\0342size of theversion of mixture of between theExamples ofeducationalcompetitive onsubmit=\034director ofdistinctive/DTD XHTML relating totendency toprovince ofwhich woulddespite thescientific legislature.innerHTML allegationsAgriculturewas used inapproach tointelligentyears later,sans-serifdeterminingPerformanceappearances, which is foundationsabbreviatedhigher thans from the individual composed ofsupposed toclaims thatattributionfont-size:1elements ofHistorical his brotherat the timeanniversarygoverned byrelated to ultimately innovationsit is stillcan only bedefinitionstoGMTStringA number ofimg class=\034Eventually,was changedoccurred inneighboringdistinguishwhen he wasintroducingterrestrialMany of theargues thatan Americanconquest ofwidespread were killedscreen and In order toexpected todescendantsare locatedlegislativegenerations backgroundmost peopleyears afterthere is nothe highestfrequently they do notargued thatshowed thatpredominanttheologicalby the timeconsideringshort-lived</span></a>can be usedvery littleone of the had alreadyinterpretedcommunicatefeatures ofgovernment,</noscript>entered the\034 height=\0343Independentpopulationslarge-scale. Although used in thedestructionpossibilitystarting intwo or moreexpressionssubordinatelarger thanhistory and</option>\013\010Continentaleliminatingwill not bepractice ofin front ofsite of theensure thatto create amississippipotentiallyoutstandingbetter thanwhat is nowsituated inmeta name=\034TraditionalsuggestionsTranslationthe form ofatmosphericideologicalenterprisescalculatingeast of theremnants ofpluginspage/index.php?remained intransformedHe was alsowas alreadystatisticalin favor ofMinistry ofmovement offormulationis required<link rel=\034This is the <a href=\034/popularizedinvolved inare used toand severalmade by theseems to belikely thatPalestiniannamed afterit had beenmost commonto refer tobut this isconsecutivetemporarilyIn general,conventionstakes placesubdivisionterritorialoperationalpermanentlywas largelyoutbreak ofin the pastfollowing a xmlns:og=\034><a class=\034class=\034textConversion may be usedmanufactureafter beingclearfix\034>\010question ofwas electedto become abecause of some peopleinspired bysuccessful a time whenmore commonamongst thean officialwidth:100%;technology,was adoptedto keep thesettlementslive birthsindex.html\034Connecticutassigned to&times;account foralign=rightthe companyalways beenreturned toinvolvementBecause thethis period\034 name=\034q\034 confined toa result ofvalue=\034\034 />is actuallyEnvironment\013\010</head>\013\010Conversely,>\010<div id=\0340\034 width=\0341is probablyhave becomecontrollingthe problemcitizens ofpoliticiansreached theas early as:none; over<table cellvalidity ofdirectly toonmousedownwhere it iswhen it wasmembers of relation toaccommodatealong with In the latethe Englishdelicious\034>this is notthe presentif they areand finallya matter of\013\010\009</div>\013\010\013\010</script>faster thanmajority ofafter whichcomparativeto maintainimprove theawarded theer\034 class=\034frameborderrestorationin the sameanalysis oftheir firstDuring the continentalsequence offunction(){font-size: work on the</script>\010<begins withjavascript:constituentwas foundedequilibriumassume thatis given byneeds to becoordinatesthe variousare part ofonly in thesections ofis a commontheories ofdiscoveriesassociationedge of thestrength ofposition inpresent-dayuniversallyto form thebut insteadcorporationattached tois commonlyreasons for "the can be madewas able towhich meansbut did notonMouseOveras possibleoperated bycoming fromthe primaryaddition offor severaltransferreda period ofare able tohowever, itshould havemuch larger\010\009</script>adopted theproperty ofdirected byeffectivelywas broughtchildren ofProgramminglonger thanmanuscriptswar againstby means ofand most ofsimilar to proprietaryoriginatingprestigiousgrammaticalexperience.to make theIt was alsois found incompetitorsin the U.S.replace thebrought thecalculationfall of thethe generalpracticallyin honor ofreleased inresidentialand some ofking of thereaction to1st Earl ofculture andprincipally</title>\010 they can beback to thesome of hisexposure toare similarform of theaddFavoritecitizenshippart in thepeople within practiceto continue&minus;approved by the first allowed theand for thefunctioningplaying thesolution toheight=\0340\034 in his bookmore than afollows thecreated thepresence in </td>nationalistthe idea ofa characterwere forced class=\034btndays of thefeatured inshowing theinterest inin place ofturn of thethe head ofLord of thepoliticallyhas its ownEducationalapproval ofsome of theeach other,behavior ofand becauseand anotherappeared onrecorded inblack"may includethe world'scan lead torefers to aborder=\0340\034 government winning theresulted in while the Washington,the subjectcity in the></div>\013\010\009\009reflect theto completebecame moreradioactiverejected bywithout anyhis father,which couldcopy of theto indicatea politicalaccounts ofconstitutesworked wither</a></li>of his lifeaccompaniedclientWidthprevent theLegislativedifferentlytogether inhas severalfor anothertext of thefounded thee with the is used forchanged theusually theplace wherewhereas the> <a href=\034\034><a href=\034themselves,although hethat can betraditionalrole of theas a resultremoveChilddesigned bywest of theSome peopleproduction,side of thenewslettersused by thedown to theaccepted bylive in theattempts tooutside thefrequenciesHowever, inprogrammersat least inapproximatealthough itwas part ofand variousGovernor ofthe articleturned into><a href=\034/the economyis the mostmost widelywould laterand perhapsrise to theoccurs whenunder whichconditions.the westerntheory thatis producedthe city ofin which heseen in thethe centralbuilding ofmany of hisarea of theis the onlymost of themany of thethe WesternThere is noextended toStatisticalcolspan=2 |short storypossible totopologicalcritical ofreported toa Christiandecision tois equal toproblems ofThis can bemerchandisefor most ofno evidenceeditions ofelements in". Thecom/images/which makesthe processremains theliterature,is a memberthe popularthe ancientproblems intime of thedefeated bybody of thea few yearsmuch of thethe work ofCalifornia,served as agovernment.concepts ofmovement in\009\009<div id=\034it\034 value=\034language ofas they areproduced inis that theexplain thediv></div>\010However thelead to the\009<a href=\034/was grantedpeople havecontinuallywas seen asand relatedthe role ofproposed byof the besteach other.Constantinepeople fromdialects ofto revisionwas renameda source ofthe initiallaunched inprovide theto the westwhere thereand similarbetween twois also theEnglish andconditions,that it wasentitled tothemselves.quantity ofransparencythe same asto join thecountry andthis is theThis led toa statementcontrast tolastIndexOfthrough hisis designedthe term isis providedprotect theng</a></li>The currentthe site ofsubstantialexperience,in the Westthey shouldsloven\196\141inacomentariosuniversidadcondicionesactividadesexperienciatecnolog\195\173aproducci\195\179npuntuaci\195\179naplicaci\195\179ncontrase\195\177acategor\195\173asregistrarseprofesionaltratamientoreg\195\173stratesecretar\195\173aprincipalesprotecci\195\179nimportantesimportanciaposibilidadinteresantecrecimientonecesidadessuscribirseasociaci\195\179ndisponiblesevaluaci\195\179nestudiantesresponsableresoluci\195\179nguadalajararegistradosoportunidadcomercialesfotograf\195\173aautoridadesingenier\195\173atelevisi\195\179ncompetenciaoperacionesestablecidosimplementeactualmentenavegaci\195\179nconformidadline-height:font-family:\034 : \034http://applicationslink\034 href=\034specifically//<![CDATA[\010Organizationdistribution0px; height:relationshipdevice-width<div class=\034<label for=\034registration</noscript>\010/index.html\034window.open( !important;application/independence//www.googleorganizationautocompleterequirementsconservative<form name=\034intellectualmargin-left:18th centuryan importantinstitutionsabbreviation<img class=\034organisationcivilization19th centuryarchitectureincorporated20th century-container\034>most notably/></a></div>notification'undefined')Furthermore,believe thatinnerHTML = prior to thedramaticallyreferring tonegotiationsheadquartersSouth AfricaunsuccessfulPennsylvaniaAs a result,<html lang=\034</sup>dealing withphiladelphiahistorically);</script>\010padding-top:experimentalgetAttributeinstructionstechnologiespart of the =function(){subscriptionl.dtd\034>\013\010<htgeographicalConstitution', function(supported byagriculturalconstructionpublicationsfont-size: 1a variety of<div style=\034Encyclopediaiframe src=\034demonstratedaccomplisheduniversitiesDemographics);</script><dedicated toknowledge ofsatisfactionparticularly</div></div>English (US)appendChild(transmissions. However, intelligence\034 tabindex=\034float:right;Commonwealthranging fromin which theat least onereproductionencyclopedia;font-size:1jurisdictionat that time\034><a class=\034In addition,description+conversationcontact withis generallyr\034 content=\034representing<math>presentationoccasionally<img width=\034navigation\034>compensationchampionshipmedia=\034all\034 violation ofreference toreturn true;Strict//EN\034 transactionsinterventionverificationInformation difficultiesChampionshipcapabilities<![endif]-->}\010</script>\010Christianityfor example,Professionalrestrictionssuggest thatwas released(such as theremoveClass(unemploymentthe Americanstructure of/index.html published inspan class=\034\034><a href=\034/introductionbelonging toclaimed thatconsequences<meta name=\034Guide to theoverwhelmingagainst the concentrated,\010.nontouch observations</a>\010</div>\010f (document.border: 1px {font-size:1treatment of0\034 height=\0341modificationIndependencedivided intogreater thanachievementsestablishingJavaScript\034 neverthelesssignificanceBroadcasting> </td>container\034>\010such as the influence ofa particularsrc='http://navigation\034 half of the substantial </div>advantage ofdiscovery offundamental metropolitanthe opposite\034 xml:lang=\034deliberatelyalign=centerevolution ofpreservationimprovementsbeginning inJesus ChristPublicationsdisagreementtext-align:r, function()similaritiesbody></html>is currentlyalphabeticalis sometimestype=\034image/many of the flow:hidden;available indescribe theexistence ofall over thethe Internet\009<ul class=\034installationneighborhoodarmed forcesreducing thecontinues toNonetheless,temperatures\010\009\009<a href=\034close to theexamples of is about the(see below).\034 id=\034searchprofessionalis availablethe official\009\009</script>\010\010\009\009<div id=\034accelerationthrough the Hall of Famedescriptionstranslationsinterference type='text/recent yearsin the worldvery popular{background:traditional some of the connected toexploitationemergence ofconstitutionA History ofsignificant manufacturedexpectations><noscript><can be foundbecause the has not beenneighbouringwithout the added to the\009<li class=\034instrumentalSoviet Unionacknowledgedwhich can bename for theattention toattempts to developmentsIn fact, the<li class=\034aimplicationssuitable formuch of the colonizationpresidentialcancelBubble Informationmost of the is describedrest of the more or lessin SeptemberIntelligencesrc=\034http://px; height: available tomanufacturerhuman rightslink href=\034/availabilityproportionaloutside the astronomicalhuman beingsname of the are found inare based onsmaller thana person whoexpansion ofarguing thatnow known asIn the earlyintermediatederived fromScandinavian</a></div>\013\010consider thean estimatedthe National<div id=\034pagresulting incommissionedanalogous toare required/ul>\010</div>\010was based onand became a t\034 value=\034\034 was capturedno more thanrespectivelycontinue to >\013\010<head>\013\010<were createdmore generalinformation used for theindependent the Imperialcomponent ofto the northinclude the Constructionside of the would not befor instanceinvention ofmore complexcollectivelybackground: text-align: its originalinto accountthis processan extensivehowever, thethey are notrejected thecriticism ofduring whichprobably thethis article(function(){It should bean agreementaccidentallydiffers fromArchitecturebetter knownarrangementsinfluence onattended theidentical tosouth of thepass throughxml\034 title=\034weight:bold;creating thedisplay:nonereplaced the<img src=\034/ihttps://www.World War IItestimonialsfound in therequired to and that thebetween the was designedconsists of considerablypublished bythe languageConservationconsisted ofrefer to theback to the css\034 media=\034People from available onproved to besuggestions\034was known asvarieties oflikely to becomprised ofsupport the hands of thecoupled withconnect and border:none;performancesbefore beinglater becamecalculationsoften calledresidents ofmeaning that><li class=\034evidence forexplanationsenvironments\034></a></div>which allowsIntroductiondeveloped bya wide rangeon behalf ofvalign=\034top\034principle ofat the time,</noscript>\013said to havein the firstwhile othershypotheticalphilosopherspower of thecontained inperformed byinability towere writtenspan style=\034input name=\034the questionintended forrejection ofimplies thatinvented thethe standardwas probablylink betweenprofessor ofinteractionschanging theIndian Ocean class=\034lastworking with'http://www.years beforeThis was therecreationalentering themeasurementsan extremelyvalue of thestart of the\010</script>\010\010an effort toincrease theto the southspacing=\0340\034>sufficientlythe Europeanconverted toclearTimeoutdid not haveconsequentlyfor the nextextension ofeconomic andalthough theare producedand with theinsufficientgiven by thestating thatexpenditures</span></a>\010thought thaton the basiscellpadding=image of thereturning toinformation,separated byassassinateds\034 content=\034authority ofnorthwestern</div>\010<div \034></div>\013\010 consultationcommunity ofthe nationalit should beparticipants align=\034leftthe greatestselection ofsupernaturaldependent onis mentionedallowing thewas inventedaccompanyinghis personalavailable atstudy of theon the otherexecution ofHuman Rightsterms of theassociationsresearch andsucceeded bydefeated theand from thebut they arecommander ofstate of theyears of agethe study of<ul class=\034splace in thewhere he was<li class=\034fthere are nowhich becamehe publishedexpressed into which thecommissionerfont-weight:territory ofextensions\034>Roman Empireequal to theIn contrast,however, andis typicallyand his wife(also called><ul class=\034effectively evolved intoseem to havewhich is thethere was noan excellentall of thesedescribed byIn practice,broadcastingcharged withreflected insubjected tomilitary andto the pointeconomicallysetTargetingare actuallyvictory over();</script>continuouslyrequired forevolutionaryan effectivenorth of the, which was front of theor otherwisesome form ofhad not beengenerated byinformation.permitted toincludes thedevelopment,entered intothe previousconsistentlyare known asthe field ofthis type ofgiven to thethe title ofcontains theinstances ofin the northdue to theirare designedcorporationswas that theone of thesemore popularsucceeded insupport fromin differentdominated bydesigned forownership ofand possiblystandardizedresponseTextwas intendedreceived theassumed thatareas of theprimarily inthe basis ofin the senseaccounts fordestroyed byat least twowas declaredcould not beSecretary ofappear to bemargin-top:1/^\092s+|\092s+$/ge){throw e};the start oftwo separatelanguage andwho had beenoperation ofdeath of thereal numbers\009<link rel=\034provided thethe story ofcompetitionsenglish (UK)english (US)\208\156\208\190\208\189\208\179\208\190\208\187\208\161\209\128\208\191\209\129\208\186\208\184\209\129\209\128\208\191\209\129\208\186\208\184\209\129\209\128\208\191\209\129\208\186\208\190\217\132\216\185\216\177\216\168\217\138\216\169\230\173\163\233\171\148\228\184\173\230\150\135\231\174\128\228\189\147\228\184\173\230\150\135\231\185\129\228\189\147\228\184\173\230\150\135\230\156\137\233\153\144\229\133\172\229\143\184\228\186\186\230\176\145\230\148\191\229\186\156\233\152\191\233\135\140\229\183\180\229\183\180\231\164\190\228\188\154\228\184\187\228\185\137\230\147\141\228\189\156\231\179\187\231\187\159\230\148\191\231\173\150\230\179\149\232\167\132informaci\195\179nherramientaselectr\195\179nicodescripci\195\179nclasificadosconocimientopublicaci\195\179nrelacionadasinform\195\161ticarelacionadosdepartamentotrabajadoresdirectamenteayuntamientomercadoLibrecont\195\161ctenoshabitacionescumplimientorestaurantesdisposici\195\179nconsecuenciaelectr\195\179nicaaplicacionesdesconectadoinstalaci\195\179nrealizaci\195\179nutilizaci\195\179nenciclopediaenfermedadesinstrumentosexperienciasinstituci\195\179nparticularessubcategoria\209\130\208\190\208\187\209\140\208\186\208\190\208\160\208\190\209\129\209\129\208\184\208\184\209\128\208\176\208\177\208\190\209\130\209\139\208\177\208\190\208\187\209\140\209\136\208\181\208\191\209\128\208\190\209\129\209\130\208\190\208\188\208\190\208\182\208\181\209\130\208\181\208\180\209\128\209\131\208\179\208\184\209\133\209\129\208\187\209\131\209\135\208\176\208\181\209\129\208\181\208\185\209\135\208\176\209\129\208\178\209\129\208\181\208\179\208\180\208\176\208\160\208\190\209\129\209\129\208\184\209\143\208\156\208\190\209\129\208\186\208\178\208\181\208\180\209\128\209\131\208\179\208\184\208\181\208\179\208\190\209\128\208\190\208\180\208\176\208\178\208\190\208\191\209\128\208\190\209\129\208\180\208\176\208\189\208\189\209\139\209\133\208\180\208\190\208\187\208\182\208\189\209\139\208\184\208\188\208\181\208\189\208\189\208\190\208\156\208\190\209\129\208\186\208\178\209\139\209\128\209\131\208\177\208\187\208\181\208\185\208\156\208\190\209\129\208\186\208\178\208\176\209\129\209\130\209\128\208\176\208\189\209\139\208\189\208\184\209\135\208\181\208\179\208\190\209\128\208\176\208\177\208\190\209\130\208\181\208\180\208\190\208\187\208\182\208\181\208\189\209\131\209\129\208\187\209\131\208\179\208\184\209\130\208\181\208\191\208\181\209\128\209\140\208\158\208\180\208\189\208\176\208\186\208\190\208\191\208\190\209\130\208\190\208\188\209\131\209\128\208\176\208\177\208\190\209\130\209\131\208\176\208\191\209\128\208\181\208\187\209\143\208\178\208\190\208\190\208\177\209\137\208\181\208\190\208\180\208\189\208\190\208\179\208\190\209\129\208\178\208\190\208\181\208\179\208\190\209\129\209\130\208\176\209\130\209\140\208\184\208\180\209\128\209\131\208\179\208\190\208\185\209\132\208\190\209\128\209\131\208\188\208\181\209\133\208\190\209\128\208\190\209\136\208\190\208\191\209\128\208\190\209\130\208\184\208\178\209\129\209\129\209\139\208\187\208\186\208\176\208\186\208\176\208\182\208\180\209\139\208\185\208\178\208\187\208\176\209\129\209\130\208\184\208\179\209\128\209\131\208\191\208\191\209\139\208\178\208\188\208\181\209\129\209\130\208\181\209\128\208\176\208\177\208\190\209\130\208\176\209\129\208\186\208\176\208\183\208\176\208\187\208\191\208\181\209\128\208\178\209\139\208\185\208\180\208\181\208\187\208\176\209\130\209\140\208\180\208\181\208\189\209\140\208\179\208\184\208\191\208\181\209\128\208\184\208\190\208\180\208\177\208\184\208\183\208\189\208\181\209\129\208\190\209\129\208\189\208\190\208\178\208\181\208\188\208\190\208\188\208\181\208\189\209\130\208\186\209\131\208\191\208\184\209\130\209\140\208\180\208\190\208\187\208\182\208\189\208\176\209\128\208\176\208\188\208\186\208\176\209\133\208\189\208\176\209\135\208\176\208\187\208\190\208\160\208\176\208\177\208\190\209\130\208\176\208\162\208\190\208\187\209\140\208\186\208\190\209\129\208\190\208\178\209\129\208\181\208\188\208\178\209\130\208\190\209\128\208\190\208\185\208\189\208\176\209\135\208\176\208\187\208\176\209\129\208\191\208\184\209\129\208\190\208\186\209\129\208\187\209\131\208\182\208\177\209\139\209\129\208\184\209\129\209\130\208\181\208\188\208\191\208\181\209\135\208\176\209\130\208\184\208\189\208\190\208\178\208\190\208\179\208\190\208\191\208\190\208\188\208\190\209\137\208\184\209\129\208\176\208\185\209\130\208\190\208\178\208\191\208\190\209\135\208\181\208\188\209\131\208\191\208\190\208\188\208\190\209\137\209\140\208\180\208\190\208\187\208\182\208\189\208\190\209\129\209\129\209\139\208\187\208\186\208\184\208\177\209\139\209\129\209\130\209\128\208\190\208\180\208\176\208\189\208\189\209\139\208\181\208\188\208\189\208\190\208\179\208\184\208\181\208\191\209\128\208\190\208\181\208\186\209\130\208\161\208\181\208\185\209\135\208\176\209\129\208\188\208\190\208\180\208\181\208\187\208\184\209\130\208\176\208\186\208\190\208\179\208\190\208\190\208\189\208\187\208\176\208\185\208\189\208\179\208\190\209\128\208\190\208\180\208\181\208\178\208\181\209\128\209\129\208\184\209\143\209\129\209\130\209\128\208\176\208\189\208\181\209\132\208\184\208\187\209\140\208\188\209\139\209\131\209\128\208\190\208\178\208\189\209\143\209\128\208\176\208\183\208\189\209\139\209\133\208\184\209\129\208\186\208\176\209\130\209\140\208\189\208\181\208\180\208\181\208\187\209\142\209\143\208\189\208\178\208\176\209\128\209\143\208\188\208\181\208\189\209\140\209\136\208\181\208\188\208\189\208\190\208\179\208\184\209\133\208\180\208\176\208\189\208\189\208\190\208\185\208\183\208\189\208\176\209\135\208\184\209\130\208\189\208\181\208\187\209\140\208\183\209\143\209\132\208\190\209\128\209\131\208\188\208\176\208\162\208\181\208\191\208\181\209\128\209\140\208\188\208\181\209\129\209\143\209\134\208\176\208\183\208\176\209\137\208\184\209\130\209\139\208\155\209\131\209\135\209\136\208\184\208\181\224\164\168\224\164\185\224\165\128\224\164\130\224\164\149\224\164\176\224\164\168\224\165\135\224\164\133\224\164\170\224\164\168\224\165\135\224\164\149\224\164\191\224\164\175\224\164\190\224\164\149\224\164\176\224\165\135\224\164\130\224\164\133\224\164\168\224\165\141\224\164\175\224\164\149\224\165\141\224\164\175\224\164\190\224\164\151\224\164\190\224\164\135\224\164\161\224\164\172\224\164\190\224\164\176\224\165\135\224\164\149\224\164\191\224\164\184\224\165\128\224\164\166\224\164\191\224\164\175\224\164\190\224\164\170\224\164\185\224\164\178\224\165\135\224\164\184\224\164\191\224\164\130\224\164\185\224\164\173\224\164\190\224\164\176\224\164\164\224\164\133\224\164\170\224\164\168\224\165\128\224\164\181\224\164\190\224\164\178\224\165\135\224\164\184\224\165\135\224\164\181\224\164\190\224\164\149\224\164\176\224\164\164\224\165\135\224\164\174\224\165\135\224\164\176\224\165\135\224\164\185\224\165\139\224\164\168\224\165\135\224\164\184\224\164\149\224\164\164\224\165\135\224\164\172\224\164\185\224\165\129\224\164\164\224\164\184\224\164\190\224\164\135\224\164\159\224\164\185\224\165\139\224\164\151\224\164\190\224\164\156\224\164\190\224\164\168\224\165\135\224\164\174\224\164\191\224\164\168\224\164\159\224\164\149\224\164\176\224\164\164\224\164\190\224\164\149\224\164\176\224\164\168\224\164\190\224\164\137\224\164\168\224\164\149\224\165\135\224\164\175\224\164\185\224\164\190\224\164\129\224\164\184\224\164\172\224\164\184\224\165\135\224\164\173\224\164\190\224\164\183\224\164\190\224\164\134\224\164\170\224\164\149\224\165\135\224\164\178\224\164\191\224\164\175\224\165\135\224\164\182\224\165\129\224\164\176\224\165\130\224\164\135\224\164\184\224\164\149\224\165\135\224\164\152\224\164\130\224\164\159\224\165\135\224\164\174\224\165\135\224\164\176\224\165\128\224\164\184\224\164\149\224\164\164\224\164\190\224\164\174\224\165\135\224\164\176\224\164\190\224\164\178\224\165\135\224\164\149\224\164\176\224\164\133\224\164\167\224\164\191\224\164\149\224\164\133\224\164\170\224\164\168\224\164\190\224\164\184\224\164\174\224\164\190\224\164\156\224\164\174\224\165\129\224\164\157\224\165\135\224\164\149\224\164\190\224\164\176\224\164\163\224\164\185\224\165\139\224\164\164\224\164\190\224\164\149\224\164\161\224\164\188\224\165\128\224\164\175\224\164\185\224\164\190\224\164\130\224\164\185\224\165\139\224\164\159\224\164\178\224\164\182\224\164\172\224\165\141\224\164\166\224\164\178\224\164\191\224\164\175\224\164\190\224\164\156\224\165\128\224\164\181\224\164\168\224\164\156\224\164\190\224\164\164\224\164\190\224\164\149\224\165\136\224\164\184\224\165\135\224\164\134\224\164\170\224\164\149\224\164\190\224\164\181\224\164\190\224\164\178\224\165\128\224\164\166\224\165\135\224\164\168\224\165\135\224\164\170\224\165\130\224\164\176\224\165\128\224\164\170\224\164\190\224\164\168\224\165\128\224\164\137\224\164\184\224\164\149\224\165\135\224\164\185\224\165\139\224\164\151\224\165\128\224\164\172\224\165\136\224\164\160\224\164\149\224\164\134\224\164\170\224\164\149\224\165\128\224\164\181\224\164\176\224\165\141\224\164\183\224\164\151\224\164\190\224\164\130\224\164\181\224\164\134\224\164\170\224\164\149\224\165\139\224\164\156\224\164\191\224\164\178\224\164\190\224\164\156\224\164\190\224\164\168\224\164\190\224\164\184\224\164\185\224\164\174\224\164\164\224\164\185\224\164\174\224\165\135\224\164\130\224\164\137\224\164\168\224\164\149\224\165\128\224\164\175\224\164\190\224\164\185\224\165\130\224\164\166\224\164\176\224\165\141\224\164\156\224\164\184\224\165\130\224\164\154\224\165\128\224\164\170\224\164\184\224\164\130\224\164\166\224\164\184\224\164\181\224\164\190\224\164\178\224\164\185\224\165\139\224\164\168\224\164\190\224\164\185\224\165\139\224\164\164\224\165\128\224\164\156\224\165\136\224\164\184\224\165\135\224\164\181\224\164\190\224\164\170\224\164\184\224\164\156\224\164\168\224\164\164\224\164\190\224\164\168\224\165\135\224\164\164\224\164\190\224\164\156\224\164\190\224\164\176\224\165\128\224\164\152\224\164\190\224\164\175\224\164\178\224\164\156\224\164\191\224\164\178\224\165\135\224\164\168\224\165\128\224\164\154\224\165\135\224\164\156\224\164\190\224\164\130\224\164\154\224\164\170\224\164\164\224\165\141\224\164\176\224\164\151\224\165\130\224\164\151\224\164\178\224\164\156\224\164\190\224\164\164\224\165\135\224\164\172\224\164\190\224\164\185\224\164\176\224\164\134\224\164\170\224\164\168\224\165\135\224\164\181\224\164\190\224\164\185\224\164\168\224\164\135\224\164\184\224\164\149\224\164\190\224\164\184\224\165\129\224\164\172\224\164\185\224\164\176\224\164\185\224\164\168\224\165\135\224\164\135\224\164\184\224\164\184\224\165\135\224\164\184\224\164\185\224\164\191\224\164\164\224\164\172\224\164\161\224\164\188\224\165\135\224\164\152\224\164\159\224\164\168\224\164\190\224\164\164\224\164\178\224\164\190\224\164\182\224\164\170\224\164\190\224\164\130\224\164\154\224\164\182\224\165\141\224\164\176\224\165\128\224\164\172\224\164\161\224\164\188\224\165\128\224\164\185\224\165\139\224\164\164\224\165\135\224\164\184\224\164\190\224\164\136\224\164\159\224\164\182\224\164\190\224\164\175\224\164\166\224\164\184\224\164\149\224\164\164\224\165\128\224\164\156\224\164\190\224\164\164\224\165\128\224\164\181\224\164\190\224\164\178\224\164\190\224\164\185\224\164\156\224\164\190\224\164\176\224\164\170\224\164\159\224\164\168\224\164\190\224\164\176\224\164\150\224\164\168\224\165\135\224\164\184\224\164\161\224\164\188\224\164\149\224\164\174\224\164\191\224\164\178\224\164\190\224\164\137\224\164\184\224\164\149\224\165\128\224\164\149\224\165\135\224\164\181\224\164\178\224\164\178\224\164\151\224\164\164\224\164\190\224\164\150\224\164\190\224\164\168\224\164\190\224\164\133\224\164\176\224\165\141\224\164\165\224\164\156\224\164\185\224\164\190\224\164\130\224\164\166\224\165\135\224\164\150\224\164\190\224\164\170\224\164\185\224\164\178\224\165\128\224\164\168\224\164\191\224\164\175\224\164\174\224\164\172\224\164\191\224\164\168\224\164\190\224\164\172\224\165\136\224\164\130\224\164\149\224\164\149\224\164\185\224\165\128\224\164\130\224\164\149\224\164\185\224\164\168\224\164\190\224\164\166\224\165\135\224\164\164\224\164\190\224\164\185\224\164\174\224\164\178\224\165\135\224\164\149\224\164\190\224\164\171\224\165\128\224\164\156\224\164\172\224\164\149\224\164\191\224\164\164\224\165\129\224\164\176\224\164\164\224\164\174\224\164\190\224\164\130\224\164\151\224\164\181\224\164\185\224\165\128\224\164\130\224\164\176\224\165\139\224\164\156\224\164\188\224\164\174\224\164\191\224\164\178\224\165\128\224\164\134\224\164\176\224\165\139\224\164\170\224\164\184\224\165\135\224\164\168\224\164\190\224\164\175\224\164\190\224\164\166\224\164\181\224\164\178\224\165\135\224\164\168\224\165\135\224\164\150\224\164\190\224\164\164\224\164\190\224\164\149\224\164\176\224\165\128\224\164\172\224\164\137\224\164\168\224\164\149\224\164\190\224\164\156\224\164\181\224\164\190\224\164\172\224\164\170\224\165\130\224\164\176\224\164\190\224\164\172\224\164\161\224\164\188\224\164\190\224\164\184\224\165\140\224\164\166\224\164\190\224\164\182\224\165\135\224\164\175\224\164\176\224\164\149\224\164\191\224\164\175\224\165\135\224\164\149\224\164\185\224\164\190\224\164\130\224\164\133\224\164\149\224\164\184\224\164\176\224\164\172\224\164\168\224\164\190\224\164\143\224\164\181\224\164\185\224\164\190\224\164\130\224\164\184\224\165\141\224\164\165\224\164\178\224\164\174\224\164\191\224\164\178\224\165\135\224\164\178\224\165\135\224\164\150\224\164\149\224\164\181\224\164\191\224\164\183\224\164\175\224\164\149\224\165\141\224\164\176\224\164\130\224\164\184\224\164\174\224\165\130\224\164\185\224\164\165\224\164\190\224\164\168\224\164\190\216\170\216\179\216\170\216\183\217\138\216\185\217\133\216\180\216\167\216\177\217\131\216\169\216\168\217\136\216\167\216\179\216\183\216\169\216\167\217\132\216\181\217\129\216\173\216\169\217\133\217\136\216\167\216\182\217\138\216\185\216\167\217\132\216\174\216\167\216\181\216\169\216\167\217\132\217\133\216\178\217\138\216\175\216\167\217\132\216\185\216\167\217\133\216\169\216\167\217\132\217\131\216\167\216\170\216\168\216\167\217\132\216\177\216\175\217\136\216\175\216\168\216\177\217\134\216\167\217\133\216\172\216\167\217\132\216\175\217\136\217\132\216\169\216\167\217\132\216\185\216\167\217\132\217\133\216\167\217\132\217\133\217\136\217\130\216\185\216\167\217\132\216\185\216\177\216\168\217\138\216\167\217\132\216\179\216\177\217\138\216\185\216\167\217\132\216\172\217\136\216\167\217\132\216\167\217\132\216\176\217\135\216\167\216\168\216\167\217\132\216\173\217\138\216\167\216\169\216\167\217\132\216\173\217\130\217\136\217\130\216\167\217\132\217\131\216\177\217\138\217\133\216\167\217\132\216\185\216\177\216\167\217\130\217\133\216\173\217\129\217\136\216\184\216\169\216\167\217\132\216\171\216\167\217\134\217\138\217\133\216\180\216\167\217\135\216\175\216\169\216\167\217\132\217\133\216\177\216\163\216\169\216\167\217\132\217\130\216\177\216\162\217\134\216\167\217\132\216\180\216\168\216\167\216\168\216\167\217\132\216\173\217\136\216\167\216\177\216\167\217\132\216\172\216\175\217\138\216\175\216\167\217\132\216\163\216\179\216\177\216\169\216\167\217\132\216\185\217\132\217\136\217\133\217\133\216\172\217\133\217\136\216\185\216\169\216\167\217\132\216\177\216\173\217\133\217\134\216\167\217\132\217\134\217\130\216\167\216\183\217\129\217\132\216\179\216\183\217\138\217\134\216\167\217\132\217\131\217\136\217\138\216\170\216\167\217\132\216\175\217\134\217\138\216\167\216\168\216\177\217\131\216\167\216\170\217\135\216\167\217\132\216\177\217\138\216\167\216\182\216\170\216\173\217\138\216\167\216\170\217\138\216\168\216\170\217\136\217\130\217\138\216\170\216\167\217\132\216\163\217\136\217\132\217\137\216\167\217\132\216\168\216\177\217\138\216\175\216\167\217\132\217\131\217\132\216\167\217\133\216\167\217\132\216\177\216\167\216\168\216\183\216\167\217\132\216\180\216\174\216\181\217\138\216\179\217\138\216\167\216\177\216\167\216\170\216\167\217\132\216\171\216\167\217\132\216\171\216\167\217\132\216\181\217\132\216\167\216\169\216\167\217\132\216\173\216\175\217\138\216\171\216\167\217\132\216\178\217\136\216\167\216\177\216\167\217\132\216\174\217\132\217\138\216\172\216\167\217\132\216\172\217\133\217\138\216\185\216\167\217\132\216\185\216\167\217\133\217\135\216\167\217\132\216\172\217\133\216\167\217\132\216\167\217\132\216\179\216\167\216\185\216\169\217\133\216\180\216\167\217\135\216\175\217\135\216\167\217\132\216\177\216\166\217\138\216\179\216\167\217\132\216\175\216\174\217\136\217\132\216\167\217\132\217\129\217\134\217\138\216\169\216\167\217\132\217\131\216\170\216\167\216\168\216\167\217\132\216\175\217\136\216\177\217\138\216\167\217\132\216\175\216\177\217\136\216\179\216\167\216\179\216\170\216\186\216\177\217\130\216\170\216\181\216\167\217\133\217\138\217\133\216\167\217\132\216\168\217\134\216\167\216\170\216\167\217\132\216\185\216\184\217\138\217\133entertainmentunderstanding = function().jpg\034 width=\034configuration.png\034 width=\034<body class=\034Math.random()contemporary United Statescircumstances.appendChild(organizations<span class=\034\034><img src=\034/distinguishedthousands of communicationclear\034></div>investigationfavicon.ico\034 margin-right:based on the Massachusettstable border=internationalalso known aspronunciationbackground:#fpadding-left:For example, miscellaneous</math>psychologicalin particularearch\034 type=\034form method=\034as opposed toSupreme Courtoccasionally Additionally,North Americapx;backgroundopportunitiesEntertainment.toLowerCase(manufacturingprofessional combined withFor instance,consisting of\034 maxlength=\034return false;consciousnessMediterraneanextraordinaryassassinationsubsequently button type=\034the number ofthe original comprehensiverefers to the</ul>\010</div>\010philosophicallocation.hrefwas publishedSan Francisco(function(){\010<div id=\034mainsophisticatedmathematical /head>\013\010<bodysuggests thatdocumentationconcentrationrelationshipsmay have been(for example,This article in some casesparts of the definition ofGreat Britain cellpadding=equivalent toplaceholder=\034; font-size: justificationbelieved thatsuffered fromattempted to leader of thecript\034 src=\034/(function() {are available\010\009<link rel=\034 src='http://interested inconventional \034 alt=\034\034 /></are generallyhas also beenmost popular correspondingcredited withtyle=\034border:</a></span></.gif\034 width=\034<iframe src=\034table class=\034inline-block;according to together withapproximatelyparliamentarymore and moredisplay:none;traditionallypredominantly | </span> cellspacing=<input name=\034or\034 content=\034controversialproperty=\034og:/x-shockwave-demonstrationsurrounded byNevertheless,was the firstconsiderable Although the collaborationshould not beproportion of<span style=\034known as the shortly afterfor instance,described as /head>\010<body starting withincreasingly the fact thatdiscussion ofmiddle of thean individualdifficult to point of viewhomosexualityacceptance of</span></div>manufacturersorigin of thecommonly usedimportance ofdenominationsbackground: #length of thedeterminationa significant\034 border=\0340\034>revolutionaryprinciples ofis consideredwas developedIndo-Europeanvulnerable toproponents ofare sometimescloser to theNew York City name=\034searchattributed tocourse of themathematicianby the end ofat the end of\034 border=\0340\034 technological.removeClass(branch of theevidence that![endif]-->\013\010Institute of into a singlerespectively.and thereforeproperties ofis located insome of whichThere is alsocontinued to appearance of &ndash; describes theconsiderationauthor of theindependentlyequipped withdoes not have</a><a href=\034confused with<link href=\034/at the age ofappear in theThese includeregardless ofcould be used style="several timesrepresent thebody>\010</html>thought to bepopulation ofpossibilitiespercentage ofaccess to thean attempt toproduction ofjquery/jquerytwo differentbelong to theestablishmentreplacing thedescription\034 determine theavailable forAccording to wide range of\009<div class=\034more commonlyorganisationsfunctionalitywas completed &mdash; participationthe characteran additionalappears to befact that thean example ofsignificantlyonmouseover=\034because they async = true;problems withseems to havethe result of src=\034http://familiar withpossession offunction () {took place inand sometimessubstantially<span></span>is often usedin an attemptgreat deal ofEnvironmentalsuccessfully virtually all20th century,professionalsnecessary to determined bycompatibilitybecause it isDictionary ofmodificationsThe followingmay refer to:Consequently,Internationalalthough somethat would beworld's firstclassified asbottom of the(particularlyalign=\034left\034 most commonlybasis for thefoundation ofcontributionspopularity ofcenter of theto reduce thejurisdictionsapproximation onmouseout=\034New Testamentcollection of</span></a></in the Unitedfilm director-strict.dtd\034>has been usedreturn to thealthough thischange in theseveral otherbut there areunprecedentedis similar toespecially inweight: bold;is called thecomputationalindicate thatrestricted to\009<meta name=\034are typicallyconflict withHowever, the An example ofcompared withquantities ofrather than aconstellationnecessary forreported thatspecificationpolitical and <references tothe same yearGovernment ofgeneration ofhave not beenseveral yearscommitment to\009\009<ul class=\034visualization19th century,practitionersthat he wouldand continuedoccupation ofis defined ascentre of thethe amount of><div style=\034equivalent ofdifferentiatebrought aboutmargin-left: automaticallythought of asSome of these\010<div class=\034input class=\034replaced withis one of theeducation andinfluenced byreputation as\010<meta name=\034accommodation</div>\010</div>large part ofInstitute forthe so-called against the In this case,was appointedclaimed to beHowever, thisDepartment ofthe remainingeffect on theparticularly deal with the\010<div style=\034almost alwaysare currentlyexpression ofphilosophy offor more thancivilizationson the islandselectedIndexcan result in\034 value=\034\034 />the structure /></a></div>Many of thesecaused by theof the Unitedspan class=\034mcan be tracedis related tobecame one ofis frequentlyliving in thetheoreticallyFollowing theRevolutionarygovernment inis determinedthe politicalintroduced insufficient todescription\034>short storiesseparation ofas to whetherknown for itswas initiallydisplay:blockis an examplethe principalconsists of arecognized as/body></html>a substantialreconstructedhead of stateresistance toundergraduateThere are twogravitationalare describedintentionallyserved as theclass=\034headeropposition tofundamentallydominated theand the otheralliance withwas forced torespectively,and politicalin support ofpeople in the20th century.and publishedloadChartbeatto understandmember statesenvironmentalfirst half ofcountries andarchitecturalbe consideredcharacterizedclearIntervalauthoritativeFederation ofwas succeededand there area consequencethe Presidentalso includedfree softwaresuccession ofdeveloped thewas destroyedaway from the;\010</script>\010<although theyfollowed by amore powerfulresulted in aUniversity ofHowever, manythe presidentHowever, someis thought tountil the endwas announcedare importantalso includes><input type=the center of DO NOT ALTERused to referthemes/?sort=that had beenthe basis forhas developedin the summercomparativelydescribed thesuch as thosethe resultingis impossiblevarious otherSouth Africanhave the sameeffectivenessin which case; text-align:structure and; background:regarding thesupported theis also knownstyle=\034marginincluding thebahasa Melayunorsk bokm\195\165lnorsk nynorsksloven\197\161\196\141inainternacionalcalificaci\195\179ncomunicaci\195\179nconstrucci\195\179n\034><div class=\034disambiguationDomainName', 'administrationsimultaneouslytransportationInternational margin-bottom:responsibility<![endif]-->\010</><meta name=\034implementationinfrastructurerepresentationborder-bottom:</head>\010<body>=http%3A%2F%2F<form method=\034method=\034post\034 /favicon.ico\034 });\010</script>\010.setAttribute(Administration= new Array();<![endif]-->\013\010display:block;Unfortunately,\034> </div>/favicon.ico\034>='stylesheet' identification, for example,<li><a href=\034/an alternativeas a result ofpt\034></script>\010type=\034submit\034 \010(function() {recommendationform action=\034/transformationreconstruction.style.display According to hidden\034 name=\034along with thedocument.body.approximately Communicationspost\034 action=\034meaning "--<![endif]-->Prime Ministercharacteristic</a> <a class=the history of onmouseover=\034the governmenthref=\034https://was originallywas introducedclassificationrepresentativeare considered<![endif]-->\010\010depends on theUniversity of in contrast to placeholder=\034in the case ofinternational constitutionalstyle=\034border-: function() {Because of the-strict.dtd\034>\010<table class=\034accompanied byaccount of the<script src=\034/nature of the the people in in addition tos); js.id = id\034 width=\034100%\034regarding the Roman Catholican independentfollowing the .gif\034 width=\0341the following discriminationarchaeologicalprime minister.js\034></script>combination of marginwidth=\034createElement(w.attachEvent(</a></td></tr>src=\034https://aIn particular, align=\034left\034 Czech RepublicUnited Kingdomcorrespondenceconcluded that.html\034 title=\034(function () {comes from theapplication of<span class=\034sbelieved to beement('script'</a>\010</li>\010<livery different><span class=\034option value=\034(also known as\009<li><a href=\034><input name=\034separated fromreferred to as valign=\034top\034>founder of theattempting to carbon dioxide\010\010<div class=\034class=\034search-/body>\010</html>opportunity tocommunications</head>\013\010<body style=\034width:Ti\225\186\191ng Vi\225\187\135tchanges in theborder-color:#0\034 border=\0340\034 </span></div><was discovered\034 type=\034text\034 );\010</script>\010\010Department of ecclesiasticalthere has beenresulting from</body></html>has never beenthe first timein response toautomatically </div>\010\010<div iwas consideredpercent of the\034 /></a></div>collection of descended fromsection of theaccept-charsetto be confusedmember of the padding-right:translation ofinterpretation href='http://whether or notThere are alsothere are manya small numberother parts ofimpossible to class=\034buttonlocated in the. However, theand eventuallyAt the end of because of itsrepresents the<form action=\034 method=\034post\034it is possiblemore likely toan increase inhave also beencorresponds toannounced thatalign=\034right\034>many countriesfor many yearsearliest knownbecause it waspt\034></script>\013 valign=\034top\034 inhabitants offollowing year\013\010<div class=\034million peoplecontroversial concerning theargue that thegovernment anda reference totransferred todescribing the style=\034color:although therebest known forsubmit\034 name=\034multiplicationmore than one recognition ofCouncil of theedition of the <meta name=\034Entertainment away from the ;margin-right:at the time ofinvestigationsconnected withand many otheralthough it isbeginning with <span class=\034descendants of<span class=\034i align=\034right\034</head>\010<body aspects of thehas since beenEuropean Unionreminiscent ofmore difficultVice Presidentcomposition ofpassed throughmore importantfont-size:11pxexplanation ofthe concept ofwritten in the\009<span class=\034is one of the resemblance toon the groundswhich containsincluding the defined by thepublication ofmeans that theoutside of thesupport of the<input class=\034<span class=\034t(Math.random()most prominentdescription ofConstantinoplewere published<div class=\034seappears in the1\034 height=\0341\034 most importantwhich includeswhich had beendestruction ofthe population\010\009<div class=\034possibility ofsometimes usedappear to havesuccess of theintended to bepresent in thestyle=\034clear:b\013\010</script>\013\010<was founded ininterview with_id\034 content=\034capital of the\013\010<link rel=\034srelease of thepoint out thatxMLHttpRequestand subsequentsecond largestvery importantspecificationssurface of theapplied to theforeign policy_setDomainNameestablished inis believed toIn addition tomeaning of theis named afterto protect theis representedDeclaration ofmore efficientClassificationother forms ofhe returned to<span class=\034cperformance of(function() {\013if and only ifregions of theleading to therelations withUnited Nationsstyle=\034height:other than theype\034 content=\034Association of\010</head>\010<bodylocated on theis referred to(including theconcentrationsthe individualamong the mostthan any other/>\010<link rel=\034 return false;the purpose ofthe ability to;color:#fff}\010.\010<span class=\034the subject ofdefinitions of>\013\010<link rel=\034claim that thehave developed<table width=\034celebration ofFollowing the to distinguish<span class=\034btakes place inunder the namenoted that the><![endif]-->\010style=\034margin-instead of theintroduced thethe process ofincreasing thedifferences inestimated thatespecially the/div><div id=\034was eventuallythroughout histhe differencesomething thatspan></span></significantly ></script>\013\010\013\010environmental to prevent thehave been usedespecially forunderstand theis essentiallywere the firstis the largesthave been made\034 src=\034http://interpreted assecond half ofcrolling=\034no\034 is composed ofII, Holy Romanis expected tohave their owndefined as thetraditionally have differentare often usedto ensure thatagreement withcontaining theare frequentlyinformation onexample is theresulting in a</a></li></ul> class=\034footerand especiallytype=\034button\034 </span></span>which included>\010<meta name=\034considered thecarried out byHowever, it isbecame part ofin relation topopular in thethe capital ofwas officiallywhich has beenthe History ofalternative todifferent fromto support thesuggested thatin the process <div class=\034the foundationbecause of hisconcerned withthe universityopposed to thethe context of<span class=\034ptext\034 name=\034q\034\009\009<div class=\034the scientificrepresented bymathematicianselected by thethat have been><div class=\034cdiv id=\034headerin particular,converted into);\010</script>\010<philosophical srpskohrvatskiti\225\186\191ng Vi\225\187\135t\208\160\209\131\209\129\209\129\208\186\208\184\208\185\209\128\209\131\209\129\209\129\208\186\208\184\208\185investigaci\195\179nparticipaci\195\179n\208\186\208\190\209\130\208\190\209\128\209\139\208\181\208\190\208\177\208\187\208\176\209\129\209\130\208\184\208\186\208\190\209\130\208\190\209\128\209\139\208\185\209\135\208\181\208\187\208\190\208\178\208\181\208\186\209\129\208\184\209\129\209\130\208\181\208\188\209\139\208\157\208\190\208\178\208\190\209\129\209\130\208\184\208\186\208\190\209\130\208\190\209\128\209\139\209\133\208\190\208\177\208\187\208\176\209\129\209\130\209\140\208\178\209\128\208\181\208\188\208\181\208\189\208\184\208\186\208\190\209\130\208\190\209\128\208\176\209\143\209\129\208\181\208\179\208\190\208\180\208\189\209\143\209\129\208\186\208\176\209\135\208\176\209\130\209\140\208\189\208\190\208\178\208\190\209\129\209\130\208\184\208\163\208\186\209\128\208\176\208\184\208\189\209\139\208\178\208\190\208\191\209\128\208\190\209\129\209\139\208\186\208\190\209\130\208\190\209\128\208\190\208\185\209\129\208\180\208\181\208\187\208\176\209\130\209\140\208\191\208\190\208\188\208\190\209\137\209\140\209\142\209\129\209\128\208\181\208\180\209\129\209\130\208\178\208\190\208\177\209\128\208\176\208\183\208\190\208\188\209\129\209\130\208\190\209\128\208\190\208\189\209\139\209\131\209\135\208\176\209\129\209\130\208\184\208\181\209\130\208\181\209\135\208\181\208\189\208\184\208\181\208\147\208\187\208\176\208\178\208\189\208\176\209\143\208\184\209\129\209\130\208\190\209\128\208\184\208\184\209\129\208\184\209\129\209\130\208\181\208\188\208\176\209\128\208\181\209\136\208\181\208\189\208\184\209\143\208\161\208\186\208\176\209\135\208\176\209\130\209\140\208\191\208\190\209\141\209\130\208\190\208\188\209\131\209\129\208\187\208\181\208\180\209\131\208\181\209\130\209\129\208\186\208\176\208\183\208\176\209\130\209\140\209\130\208\190\208\178\208\176\209\128\208\190\208\178\208\186\208\190\208\189\208\181\209\135\208\189\208\190\209\128\208\181\209\136\208\181\208\189\208\184\208\181\208\186\208\190\209\130\208\190\209\128\208\190\208\181\208\190\209\128\208\179\208\176\208\189\208\190\208\178\208\186\208\190\209\130\208\190\209\128\208\190\208\188\208\160\208\181\208\186\208\187\208\176\208\188\208\176\216\167\217\132\217\133\217\134\216\170\216\175\217\137\217\133\217\134\216\170\216\175\217\138\216\167\216\170\216\167\217\132\217\133\217\136\216\182\217\136\216\185\216\167\217\132\216\168\216\177\216\167\217\133\216\172\216\167\217\132\217\133\217\136\216\167\217\130\216\185\216\167\217\132\216\177\216\179\216\167\216\166\217\132\217\133\216\180\216\167\216\177\217\131\216\167\216\170\216\167\217\132\216\163\216\185\216\182\216\167\216\161\216\167\217\132\216\177\217\138\216\167\216\182\216\169\216\167\217\132\216\170\216\181\217\133\217\138\217\133\216\167\217\132\216\167\216\185\216\182\216\167\216\161\216\167\217\132\217\134\216\170\216\167\216\166\216\172\216\167\217\132\216\163\217\132\216\185\216\167\216\168\216\167\217\132\216\170\216\179\216\172\217\138\217\132\216\167\217\132\216\163\217\130\216\179\216\167\217\133\216\167\217\132\216\182\216\186\216\183\216\167\216\170\216\167\217\132\217\129\217\138\216\175\217\138\217\136\216\167\217\132\216\170\216\177\216\173\217\138\216\168\216\167\217\132\216\172\216\175\217\138\216\175\216\169\216\167\217\132\216\170\216\185\217\132\217\138\217\133\216\167\217\132\216\163\216\174\216\168\216\167\216\177\216\167\217\132\216\167\217\129\217\132\216\167\217\133\216\167\217\132\216\163\217\129\217\132\216\167\217\133\216\167\217\132\216\170\216\167\216\177\217\138\216\174\216\167\217\132\216\170\217\130\217\134\217\138\216\169\216\167\217\132\216\167\217\132\216\185\216\167\216\168\216\167\217\132\216\174\217\136\216\167\216\183\216\177\216\167\217\132\217\133\216\172\216\170\217\133\216\185\216\167\217\132\216\175\217\138\217\131\217\136\216\177\216\167\217\132\216\179\217\138\216\167\216\173\216\169\216\185\216\168\216\175\216\167\217\132\217\132\217\135\216\167\217\132\216\170\216\177\216\168\217\138\216\169\216\167\217\132\216\177\217\136\216\167\216\168\216\183\216\167\217\132\216\163\216\175\216\168\217\138\216\169\216\167\217\132\216\167\216\174\216\168\216\167\216\177\216\167\217\132\217\133\216\170\216\173\216\175\216\169\216\167\217\132\216\167\216\186\216\167\217\134\217\138cursor:pointer;</title>\010<meta \034 href=\034http://\034><span class=\034members of the window.locationvertical-align:/a> | <a href=\034<!doctype html>media=\034screen\034 <option value=\034favicon.ico\034 />\010\009\009<div class=\034characteristics\034 method=\034get\034 /body>\010</html>\010shortcut icon\034 document.write(padding-bottom:representativessubmit\034 value=\034align=\034center\034 throughout the science fiction\010 <div class=\034submit\034 class=\034one of the most valign=\034top\034><was established);\013\010</script>\013\010return false;\034>).style.displaybecause of the document.cookie<form action=\034/}body{margin:0;Encyclopedia ofversion of the .createElement(name\034 content=\034</div>\010</div>\010\010administrative </body>\010</html>history of the \034><input type=\034portion of the as part of the <a href=\034other countries\034>\010<div class=\034</span></span><In other words,display: block;control of the introduction of/>\010<meta name=\034as well as the in recent years\013\010\009<div class=\034</div>\010\009</div>\010inspired by thethe end of the compatible withbecame known as style=\034margin:.js\034></script>< International there have beenGerman language style=\034color:#Communist Partyconsistent withborder=\0340\034 cell marginheight=\034the majority of\034 align=\034centerrelated to the many different Orthodox Churchsimilar to the />\010<link rel=\034swas one of the until his death})();\010</script>other languagescompared to theportions of thethe Netherlandsthe most commonbackground:url(argued that thescrolling=\034no\034 included in theNorth American the name of theinterpretationsthe traditionaldevelopment of frequently useda collection ofvery similar tosurrounding theexample of thisalign=\034center\034>would have beenimage_caption =attached to thesuggesting thatin the form of involved in theis derived fromnamed after theIntroduction torestrictions on style=\034width: can be used to the creation ofmost important information andresulted in thecollapse of theThis means thatelements of thewas replaced byanalysis of theinspiration forregarded as themost successfulknown as "a comprehensiveHistory of the were consideredreturned to theare referred toUnsourced image>\010\009<div class=\034consists of thestopPropagationinterest in theavailability ofappears to haveelectromagneticenableServices(function of theIt is important</script></div>function(){var relative to theas a result of the position ofFor example, in method=\034post\034 was followed by&mdash; thethe applicationjs\034></script>\013\010ul></div></div>after the deathwith respect tostyle=\034padding:is particularlydisplay:inline; type=\034submit\034 is divided into\228\184\173\230\150\135 (\231\174\128\228\189\147)responsabilidadadministraci\195\179ninternacionalescorrespondiente\224\164\137\224\164\170\224\164\175\224\165\139\224\164\151\224\164\170\224\165\130\224\164\176\224\165\141\224\164\181\224\164\185\224\164\174\224\164\190\224\164\176\224\165\135\224\164\178\224\165\139\224\164\151\224\165\139\224\164\130\224\164\154\224\165\129\224\164\168\224\164\190\224\164\181\224\164\178\224\165\135\224\164\149\224\164\191\224\164\168\224\164\184\224\164\176\224\164\149\224\164\190\224\164\176\224\164\170\224\165\129\224\164\178\224\164\191\224\164\184\224\164\150\224\165\139\224\164\156\224\165\135\224\164\130\224\164\154\224\164\190\224\164\185\224\164\191\224\164\143\224\164\173\224\165\135\224\164\156\224\165\135\224\164\130\224\164\182\224\164\190\224\164\174\224\164\191\224\164\178\224\164\185\224\164\174\224\164\190\224\164\176\224\165\128\224\164\156\224\164\190\224\164\151\224\164\176\224\164\163\224\164\172\224\164\168\224\164\190\224\164\168\224\165\135\224\164\149\224\165\129\224\164\174\224\164\190\224\164\176\224\164\172\224\165\141\224\164\178\224\165\137\224\164\151\224\164\174\224\164\190\224\164\178\224\164\191\224\164\149\224\164\174\224\164\185\224\164\191\224\164\178\224\164\190\224\164\170\224\165\131\224\164\183\224\165\141\224\164\160\224\164\172\224\164\162\224\164\188\224\164\164\224\165\135\224\164\173\224\164\190\224\164\156\224\164\170\224\164\190\224\164\149\224\165\141\224\164\178\224\164\191\224\164\149\224\164\159\224\165\141\224\164\176\224\165\135\224\164\168\224\164\150\224\164\191\224\164\178\224\164\190\224\164\171\224\164\166\224\165\140\224\164\176\224\164\190\224\164\168\224\164\174\224\164\190\224\164\174\224\164\178\224\165\135\224\164\174\224\164\164\224\164\166\224\164\190\224\164\168\224\164\172\224\164\190\224\164\156\224\164\190\224\164\176\224\164\181\224\164\191\224\164\149\224\164\190\224\164\184\224\164\149\224\165\141\224\164\175\224\165\139\224\164\130\224\164\154\224\164\190\224\164\185\224\164\164\224\165\135\224\164\170\224\164\185\224\165\129\224\164\129\224\164\154\224\164\172\224\164\164\224\164\190\224\164\175\224\164\190\224\164\184\224\164\130\224\164\181\224\164\190\224\164\166\224\164\166\224\165\135\224\164\150\224\164\168\224\165\135\224\164\170\224\164\191\224\164\155\224\164\178\224\165\135\224\164\181\224\164\191\224\164\182\224\165\135\224\164\183\224\164\176\224\164\190\224\164\156\224\165\141\224\164\175\224\164\137\224\164\164\224\165\141\224\164\164\224\164\176\224\164\174\224\165\129\224\164\130\224\164\172\224\164\136\224\164\166\224\165\139\224\164\168\224\165\139\224\164\130\224\164\137\224\164\170\224\164\149\224\164\176\224\164\163\224\164\170\224\164\162\224\164\188\224\165\135\224\164\130\224\164\184\224\165\141\224\164\165\224\164\191\224\164\164\224\164\171\224\164\191\224\164\178\224\165\141\224\164\174\224\164\174\224\165\129\224\164\150\224\165\141\224\164\175\224\164\133\224\164\154\224\165\141\224\164\155\224\164\190\224\164\155\224\165\130\224\164\159\224\164\164\224\165\128\224\164\184\224\164\130\224\164\151\224\165\128\224\164\164\224\164\156\224\164\190\224\164\143\224\164\151\224\164\190\224\164\181\224\164\191\224\164\173\224\164\190\224\164\151\224\164\152\224\164\163\224\165\141\224\164\159\224\165\135\224\164\166\224\165\130\224\164\184\224\164\176\224\165\135\224\164\166\224\164\191\224\164\168\224\165\139\224\164\130\224\164\185\224\164\164\224\165\141\224\164\175\224\164\190\224\164\184\224\165\135\224\164\149\224\165\141\224\164\184\224\164\151\224\164\190\224\164\130\224\164\167\224\165\128\224\164\181\224\164\191\224\164\182\224\165\141\224\164\181\224\164\176\224\164\190\224\164\164\224\165\135\224\164\130\224\164\166\224\165\136\224\164\159\224\165\141\224\164\184\224\164\168\224\164\149\224\165\141\224\164\182\224\164\190\224\164\184\224\164\190\224\164\174\224\164\168\224\165\135\224\164\133\224\164\166\224\164\190\224\164\178\224\164\164\224\164\172\224\164\191\224\164\156\224\164\178\224\165\128\224\164\170\224\165\129\224\164\176\224\165\130\224\164\183\224\164\185\224\164\191\224\164\130\224\164\166\224\165\128\224\164\174\224\164\191\224\164\164\224\165\141\224\164\176\224\164\149\224\164\181\224\164\191\224\164\164\224\164\190\224\164\176\224\165\129\224\164\170\224\164\175\224\165\135\224\164\184\224\165\141\224\164\165\224\164\190\224\164\168\224\164\149\224\164\176\224\165\139\224\164\161\224\164\188\224\164\174\224\165\129\224\164\149\224\165\141\224\164\164\224\164\175\224\165\139\224\164\156\224\164\168\224\164\190\224\164\149\224\165\131\224\164\170\224\164\175\224\164\190\224\164\170\224\165\139\224\164\184\224\165\141\224\164\159\224\164\152\224\164\176\224\165\135\224\164\178\224\165\130\224\164\149\224\164\190\224\164\176\224\165\141\224\164\175\224\164\181\224\164\191\224\164\154\224\164\190\224\164\176\224\164\184\224\165\130\224\164\154\224\164\168\224\164\190\224\164\174\224\165\130\224\164\178\224\165\141\224\164\175\224\164\166\224\165\135\224\164\150\224\165\135\224\164\130\224\164\185\224\164\174\224\165\135\224\164\182\224\164\190\224\164\184\224\165\141\224\164\149\224\165\130\224\164\178\224\164\174\224\165\136\224\164\130\224\164\168\224\165\135\224\164\164\224\165\136\224\164\175\224\164\190\224\164\176\224\164\156\224\164\191\224\164\184\224\164\149\224\165\135rss+xml\034 title=\034-type\034 content=\034title\034 content=\034at the same time.js\034></script>\010<\034 method=\034post\034 </span></a></li>vertical-align:t/jquery.min.js\034>.click(function( style=\034padding-})();\010</script>\010</span><a href=\034<a href=\034http://); return false;text-decoration: scrolling=\034no\034 border-collapse:associated with Bahasa IndonesiaEnglish language<text xml:space=.gif\034 border=\0340\034</body>\010</html>\010overflow:hidden;img src=\034http://addEventListenerresponsible for s.js\034></script>\010/favicon.ico\034 />operating system\034 style=\034width:1target=\034_blank\034>State Universitytext-align:left;\010document.write(, including the around the world);\013\010</script>\013\010<\034 style=\034height:;overflow:hiddenmore informationan internationala member of the one of the firstcan be found in </div>\010\009\009</div>\010display: none;\034>\034 />\010<link rel=\034\010 (function() {the 15th century.preventDefault(large number of Byzantine Empire.jpg|thumb|left|vast majority ofmajority of the align=\034center\034>University Pressdominated by theSecond World Wardistribution of style=\034position:the rest of the characterized by rel=\034nofollow\034>derives from therather than the a combination ofstyle=\034width:100English-speakingcomputer scienceborder=\0340\034 alt=\034the existence ofDemocratic Party\034 style=\034margin-For this reason,.js\034></script>\010\009sByTagName(s)[0]js\034></script>\013\010<.js\034></script>\013\010link rel=\034icon\034 ' alt='' class='formation of theversions of the </a></div></div>/page>\010 <page>\010<div class=\034contbecame the firstbahasa Indonesiaenglish (simple)\206\149\206\187\206\187\206\183\206\189\206\185\206\186\206\172\209\133\209\128\208\178\208\176\209\130\209\129\208\186\208\184\208\186\208\190\208\188\208\191\208\176\208\189\208\184\208\184\209\143\208\178\208\187\209\143\208\181\209\130\209\129\209\143\208\148\208\190\208\177\208\176\208\178\208\184\209\130\209\140\209\135\208\181\208\187\208\190\208\178\208\181\208\186\208\176\209\128\208\176\208\183\208\178\208\184\209\130\208\184\209\143\208\152\208\189\209\130\208\181\209\128\208\189\208\181\209\130\208\158\209\130\208\178\208\181\209\130\208\184\209\130\209\140\208\189\208\176\208\191\209\128\208\184\208\188\208\181\209\128\208\184\208\189\209\130\208\181\209\128\208\189\208\181\209\130\208\186\208\190\209\130\208\190\209\128\208\190\208\179\208\190\209\129\209\130\209\128\208\176\208\189\208\184\209\134\209\139\208\186\208\176\209\135\208\181\209\129\209\130\208\178\208\181\209\131\209\129\208\187\208\190\208\178\208\184\209\143\209\133\208\191\209\128\208\190\208\177\208\187\208\181\208\188\209\139\208\191\208\190\208\187\209\131\209\135\208\184\209\130\209\140\209\143\208\178\208\187\209\143\209\142\209\130\209\129\209\143\208\189\208\176\208\184\208\177\208\190\208\187\208\181\208\181\208\186\208\190\208\188\208\191\208\176\208\189\208\184\209\143\208\178\208\189\208\184\208\188\208\176\208\189\208\184\208\181\209\129\209\128\208\181\208\180\209\129\209\130\208\178\208\176\216\167\217\132\217\133\217\136\216\167\216\182\217\138\216\185\216\167\217\132\216\177\216\166\217\138\216\179\217\138\216\169\216\167\217\132\216\167\217\134\216\170\217\130\216\167\217\132\217\133\216\180\216\167\216\177\217\131\216\167\216\170\217\131\216\167\217\132\216\179\217\138\216\167\216\177\216\167\216\170\216\167\217\132\217\133\217\131\216\170\217\136\216\168\216\169\216\167\217\132\216\179\216\185\217\136\216\175\217\138\216\169\216\167\216\173\216\181\216\167\216\166\217\138\216\167\216\170\216\167\217\132\216\185\216\167\217\132\217\133\217\138\216\169\216\167\217\132\216\181\217\136\216\170\217\138\216\167\216\170\216\167\217\132\216\167\217\134\216\170\216\177\217\134\216\170\216\167\217\132\216\170\216\181\216\167\217\133\217\138\217\133\216\167\217\132\216\165\216\179\217\132\216\167\217\133\217\138\216\167\217\132\217\133\216\180\216\167\216\177\217\131\216\169\216\167\217\132\217\133\216\177\216\166\217\138\216\167\216\170robots\034 content=\034<div id=\034footer\034>the United States<img src=\034http://.jpg|right|thumb|.js\034></script>\013\010<location.protocolframeborder=\0340\034 s\034 />\010<meta name=\034</a></div></div><font-weight:bold;" and "depending on the margin:0;padding:\034 rel=\034nofollow\034 President of the twentieth centuryevision>\010 </pageInternet Explorera.async = true;\013\010information about<div id=\034header\034>\034 action=\034http://<a href=\034https://<div id=\034content\034</div>\013\010</div>\013\010<derived from the <img src='http://according to the \010</body>\010</html>\010style=\034font-size:script language=\034Arial, Helvetica,</a><span class=\034</script><script political partiestd></tr></table><href=\034http://www.interpretation ofrel=\034stylesheet\034 document.write('<charset=\034utf-8\034>\010beginning of the revealed that thetelevision series\034 rel=\034nofollow\034> target=\034_blank\034>claiming that thehttp%3A%2F%2Fwww.manifestations ofPrime Minister ofinfluenced by theclass=\034clearfix\034>/div>\013\010</div>\013\010\013\010three-dimensionalChurch of Englandof North Carolinasquare kilometres.addEventListenerdistinct from thecommonly known asPhonetic Alphabetdeclared that thecontrolled by theBenjamin Franklinrole-playing gamethe University ofin Western Europepersonal computerProject Gutenbergregardless of thehas been proposedtogether with the></li><li class=\034in some countriesmin.js\034></script>of the populationofficial language<img src=\034images/identified by thenatural resourcesclassification ofcan be consideredquantum mechanicsNevertheless, themillion years ago</body>\013\010</html>\013\206\149\206\187\206\187\206\183\206\189\206\185\206\186\206\172\010take advantage ofand, according toattributed to theMicrosoft Windowsthe first centuryunder the controldiv class=\034headershortly after thenotable exceptiontens of thousandsseveral differentaround the world.reaching militaryisolated from theopposition to thethe Old TestamentAfrican Americansinserted into theseparate from themetropolitan areamakes it possibleacknowledged thatarguably the mosttype=\034text/css\034>\010the InternationalAccording to the pe=\034text/css\034 />\010coincide with thetwo-thirds of theDuring this time,during the periodannounced that hethe internationaland more recentlybelieved that theconsciousness andformerly known assurrounded by thefirst appeared inoccasionally usedposition:absolute;\034 target=\034_blank\034 position:relative;text-align:center;jax/libs/jquery/1.background-color:#type=\034application/anguage\034 content=\034<meta http-equiv=\034Privacy Policy</a>e(\034%3Cscript src='\034 target=\034_blank\034>On the other hand,.jpg|thumb|right|2</div><div class=\034<div style=\034float:nineteenth century</body>\013\010</html>\013\010<img src=\034http://s;text-align:centerfont-weight: bold; According to the difference between\034 frameborder=\0340\034 \034 style=\034position:link href=\034http://html4/loose.dtd\034>\010during this period</td></tr></table>closely related tofor the first time;font-weight:bold;input type=\034text\034 <span style=\034font-onreadystatechange\009<div class=\034cleardocument.location. For example, the a wide variety of <!DOCTYPE html>\013\010< \034><a href=\034http://style=\034float:left;concerned with the=http%3A%2F%2Fwww.in popular culturetype=\034text/css\034 />it is possible to Harvard Universitytylesheet\034 href=\034/the main characterOxford University name=\034keywords\034 cstyle=\034text-align:the United Kingdomfederal government<div style=\034margin depending on the description of the<div class=\034header.min.js\034></script>destruction of theslightly differentin accordance withtelecommunicationsindicates that theshortly thereafterespecially in the European countriesHowever, there aresrc=\034http://staticsuggested that the\034 src=\034http://www.a large number of Telecommunications\034 rel=\034nofollow\034 tHoly Roman Emperoralmost exclusively\034 border=\0340\034 alt=\034Secretary of Stateculminating in theCIA World Factbookthe most importantanniversary of thestyle=\034background-<li><em><a href=\034/the Atlantic Oceanstrictly speaking,shortly before thedifferent types ofthe Ottoman Empire><img src=\034http://An Introduction toconsequence of thedeparture from theConfederate Statesindigenous peoplesProceedings of theinformation on thetheories have beeninvolvement in thedivided into threeadjacent countriesis responsible fordissolution of thecollaboration withwidely regarded ashis contemporariesfounding member ofDominican Republicgenerally acceptedthe possibility ofare also availableunder constructionrestoration of thethe general publicis almost entirelypasses through thehas been suggestedcomputer and videoGermanic languages according to the different from theshortly afterwardshref=\034https://www.recent developmentBoard of Directors<div class=\034search| <a href=\034http://In particular, theMultiple footnotesor other substancethousands of yearstranslation of the</div>\013\010</div>\013\010\013\010<a href=\034index.phpwas established inmin.js\034></script>\010participate in thea strong influencestyle=\034margin-top:represented by thegraduated from theTraditionally, theElement(\034script\034);However, since the/div>\010</div>\010<div left; margin-left:protection against0; vertical-align:Unfortunately, thetype=\034image/x-icon/div>\010<div class=\034 class=\034clearfix\034><div class=\034footer\009\009</div>\010\009\009</div>\010the motion picture\208\145\209\138\208\187\208\179\208\176\209\128\209\129\208\186\208\184\208\177\209\138\208\187\208\179\208\176\209\128\209\129\208\186\208\184\208\164\208\181\208\180\208\181\209\128\208\176\209\134\208\184\208\184\208\189\208\181\209\129\208\186\208\190\208\187\209\140\208\186\208\190\209\129\208\190\208\190\208\177\209\137\208\181\208\189\208\184\208\181\209\129\208\190\208\190\208\177\209\137\208\181\208\189\208\184\209\143\208\191\209\128\208\190\208\179\209\128\208\176\208\188\208\188\209\139\208\158\209\130\208\191\209\128\208\176\208\178\208\184\209\130\209\140\208\177\208\181\209\129\208\191\208\187\208\176\209\130\208\189\208\190\208\188\208\176\209\130\208\181\209\128\208\184\208\176\208\187\209\139\208\191\208\190\208\183\208\178\208\190\208\187\209\143\208\181\209\130\208\191\208\190\209\129\208\187\208\181\208\180\208\189\208\184\208\181\209\128\208\176\208\183\208\187\208\184\209\135\208\189\209\139\209\133\208\191\209\128\208\190\208\180\209\131\208\186\209\134\208\184\208\184\208\191\209\128\208\190\208\179\209\128\208\176\208\188\208\188\208\176\208\191\208\190\208\187\208\189\208\190\209\129\209\130\209\140\209\142\208\189\208\176\209\133\208\190\208\180\208\184\209\130\209\129\209\143\208\184\208\183\208\177\209\128\208\176\208\189\208\189\208\190\208\181\208\189\208\176\209\129\208\181\208\187\208\181\208\189\208\184\209\143\208\184\208\183\208\188\208\181\208\189\208\181\208\189\208\184\209\143\208\186\208\176\209\130\208\181\208\179\208\190\209\128\208\184\208\184\208\144\208\187\208\181\208\186\209\129\208\176\208\189\208\180\209\128\224\164\166\224\165\141\224\164\181\224\164\190\224\164\176\224\164\190\224\164\174\224\165\136\224\164\168\224\165\129\224\164\133\224\164\178\224\164\170\224\165\141\224\164\176\224\164\166\224\164\190\224\164\168\224\164\173\224\164\190\224\164\176\224\164\164\224\165\128\224\164\175\224\164\133\224\164\168\224\165\129\224\164\166\224\165\135\224\164\182\224\164\185\224\164\191\224\164\168\224\165\141\224\164\166\224\165\128\224\164\135\224\164\130\224\164\161\224\164\191\224\164\175\224\164\190\224\164\166\224\164\191\224\164\178\224\165\141\224\164\178\224\165\128\224\164\133\224\164\167\224\164\191\224\164\149\224\164\190\224\164\176\224\164\181\224\165\128\224\164\161\224\164\191\224\164\175\224\165\139\224\164\154\224\164\191\224\164\159\224\165\141\224\164\160\224\165\135\224\164\184\224\164\174\224\164\190\224\164\154\224\164\190\224\164\176\224\164\156\224\164\130\224\164\149\224\165\141\224\164\182\224\164\168\224\164\166\224\165\129\224\164\168\224\164\191\224\164\175\224\164\190\224\164\170\224\165\141\224\164\176\224\164\175\224\165\139\224\164\151\224\164\133\224\164\168\224\165\129\224\164\184\224\164\190\224\164\176\224\164\145\224\164\168\224\164\178\224\164\190\224\164\135\224\164\168\224\164\170\224\164\190\224\164\176\224\165\141\224\164\159\224\165\128\224\164\182\224\164\176\224\165\141\224\164\164\224\165\139\224\164\130\224\164\178\224\165\139\224\164\149\224\164\184\224\164\173\224\164\190\224\164\171\224\164\188\224\165\141\224\164\178\224\165\136\224\164\182\224\164\182\224\164\176\224\165\141\224\164\164\224\165\135\224\164\130\224\164\170\224\165\141\224\164\176\224\164\166\224\165\135\224\164\182\224\164\170\224\165\141\224\164\178\224\165\135\224\164\175\224\164\176\224\164\149\224\165\135\224\164\130\224\164\166\224\165\141\224\164\176\224\164\184\224\165\141\224\164\165\224\164\191\224\164\164\224\164\191\224\164\137\224\164\164\224\165\141\224\164\170\224\164\190\224\164\166\224\164\137\224\164\168\224\165\141\224\164\185\224\165\135\224\164\130\224\164\154\224\164\191\224\164\159\224\165\141\224\164\160\224\164\190\224\164\175\224\164\190\224\164\164\224\165\141\224\164\176\224\164\190\224\164\156\224\165\141\224\164\175\224\164\190\224\164\166\224\164\190\224\164\170\224\165\129\224\164\176\224\164\190\224\164\168\224\165\135\224\164\156\224\165\139\224\164\161\224\164\188\224\165\135\224\164\130\224\164\133\224\164\168\224\165\129\224\164\181\224\164\190\224\164\166\224\164\182\224\165\141\224\164\176\224\165\135\224\164\163\224\165\128\224\164\182\224\164\191\224\164\149\224\165\141\224\164\183\224\164\190\224\164\184\224\164\176\224\164\149\224\164\190\224\164\176\224\165\128\224\164\184\224\164\130\224\164\151\224\165\141\224\164\176\224\164\185\224\164\170\224\164\176\224\164\191\224\164\163\224\164\190\224\164\174\224\164\172\224\165\141\224\164\176\224\164\190\224\164\130\224\164\161\224\164\172\224\164\154\224\165\141\224\164\154\224\165\139\224\164\130\224\164\137\224\164\170\224\164\178\224\164\172\224\165\141\224\164\167\224\164\174\224\164\130\224\164\164\224\165\141\224\164\176\224\165\128\224\164\184\224\164\130\224\164\170\224\164\176\224\165\141\224\164\149\224\164\137\224\164\174\224\165\141\224\164\174\224\165\128\224\164\166\224\164\174\224\164\190\224\164\167\224\165\141\224\164\175\224\164\174\224\164\184\224\164\185\224\164\190\224\164\175\224\164\164\224\164\190\224\164\182\224\164\172\224\165\141\224\164\166\224\165\139\224\164\130\224\164\174\224\165\128\224\164\161\224\164\191\224\164\175\224\164\190\224\164\134\224\164\136\224\164\170\224\165\128\224\164\143\224\164\178\224\164\174\224\165\139\224\164\172\224\164\190\224\164\135\224\164\178\224\164\184\224\164\130\224\164\150\224\165\141\224\164\175\224\164\190\224\164\134\224\164\170\224\164\176\224\165\135\224\164\182\224\164\168\224\164\133\224\164\168\224\165\129\224\164\172\224\164\130\224\164\167\224\164\172\224\164\190\224\164\156\224\164\188\224\164\190\224\164\176\224\164\168\224\164\181\224\165\128\224\164\168\224\164\164\224\164\174\224\164\170\224\165\141\224\164\176\224\164\174\224\165\129\224\164\150\224\164\170\224\165\141\224\164\176\224\164\182\224\165\141\224\164\168\224\164\170\224\164\176\224\164\191\224\164\181\224\164\190\224\164\176\224\164\168\224\165\129\224\164\149\224\164\184\224\164\190\224\164\168\224\164\184\224\164\174\224\164\176\224\165\141\224\164\165\224\164\168\224\164\134\224\164\175\224\165\139\224\164\156\224\164\191\224\164\164\224\164\184\224\165\139\224\164\174\224\164\181\224\164\190\224\164\176\216\167\217\132\217\133\216\180\216\167\216\177\217\131\216\167\216\170\216\167\217\132\217\133\217\134\216\170\216\175\217\138\216\167\216\170\216\167\217\132\217\131\217\133\216\168\217\138\217\136\216\170\216\177\216\167\217\132\217\133\216\180\216\167\217\135\216\175\216\167\216\170\216\185\216\175\216\175\216\167\217\132\216\178\217\136\216\167\216\177\216\185\216\175\216\175\216\167\217\132\216\177\216\175\217\136\216\175\216\167\217\132\216\165\216\179\217\132\216\167\217\133\217\138\216\169\216\167\217\132\217\129\217\136\216\170\217\136\216\180\217\136\216\168\216\167\217\132\217\133\216\179\216\167\216\168\217\130\216\167\216\170\216\167\217\132\217\133\216\185\217\132\217\136\217\133\216\167\216\170\216\167\217\132\217\133\216\179\217\132\216\179\217\132\216\167\216\170\216\167\217\132\216\172\216\177\216\167\217\129\217\138\217\131\216\179\216\167\217\132\216\167\216\179\217\132\216\167\217\133\217\138\216\169\216\167\217\132\216\167\216\170\216\181\216\167\217\132\216\167\216\170keywords\034 content=\034w3.org/1999/xhtml\034><a target=\034_blank\034 text/html; charset=\034 target=\034_blank\034><table cellpadding=\034autocomplete=\034off\034 text-align: center;to last version by background-color: #\034 href=\034http://www./div></div><div id=<a href=\034#\034 class=\034\034><img src=\034http://cript\034 src=\034http://\010<script language=\034//EN\034 \034http://www.wencodeURIComponent(\034 href=\034javascript:<div class=\034contentdocument.write('<scposition: absolute;script src=\034http:// style=\034margin-top:.min.js\034></script>\010</div>\010<div class=\034w3.org/1999/xhtml\034 \010\013\010</body>\013\010</html>distinction between/\034 target=\034_blank\034><link href=\034http://encoding=\034utf-8\034?>\010w.addEventListener?action=\034http://www.icon\034 href=\034http:// style=\034background:type=\034text/css\034 />\010meta property=\034og:t<input type=\034text\034 style=\034text-align:the development of tylesheet\034 type=\034tehtml; charset=utf-8is considered to betable width=\034100%\034 In addition to the contributed to the differences betweendevelopment of the It is important to </script>\010\010<script style=\034font-size:1></span><span id=gbLibrary of Congress<img src=\034http://imEnglish translationAcademy of Sciencesdiv style=\034display:construction of the.getElementById(id)in conjunction withElement('script'); <meta property=\034og:\208\145\209\138\208\187\208\179\208\176\209\128\209\129\208\186\208\184\010 type=\034text\034 name=\034>Privacy Policy</a>administered by theenableSingleRequeststyle="margin:</div></div></div><><img src=\034http://i style="float:referred to as the total population ofin Washington, D.C. style=\034background-among other things,organization of theparticipated in thethe introduction ofidentified with thefictional character Oxford University misunderstanding ofThere are, however,stylesheet\034 href=\034/Columbia Universityexpanded to includeusually referred toindicating that thehave suggested thataffiliated with thecorrelation betweennumber of different></td></tr></table>Republic of Ireland\010</script>\010<script under the influencecontribution to theOfficial website ofheadquarters of thecentered around theimplications of thehave been developedFederal Republic ofbecame increasinglycontinuation of theNote, however, thatsimilar to that of capabilities of theaccordance with theparticipants in thefurther developmentunder the directionis often consideredhis younger brother</td></tr></table><a http-equiv=\034X-UA-physical propertiesof British Columbiahas been criticized(with the exceptionquestions about thepassing through the0\034 cellpadding=\0340\034 thousands of peopleredirects here. Forhave children under%3E%3C/script%3E\034));<a href=\034http://www.<li><a href=\034http://site_name\034 content=\034text-decoration:nonestyle=\034display: none<meta http-equiv=\034X-new Date().getTime() type=\034image/x-icon\034</span><span class=\034language=\034javascriptwindow.location.href<a href=\034javascript:-->\013\010<script type=\034t<a href='http://www.hortcut icon\034 href=\034</div>\013\010<div class=\034<script src=\034http://\034 rel=\034stylesheet\034 t</div>\010<script type=/a> <a href=\034http:// allowTransparency=\034X-UA-Compatible\034 conrelationship between\010</script>\013\010<script </a></li></ul></div>associated with the programming language</a><a href=\034http://</a></li><li class=\034form action=\034http://<div style=\034display:type=\034text\034 name=\034q\034<table width=\034100%\034 background-position:\034 border=\0340\034 width=\034rel=\034shortcut icon\034 h6><ul><li><a href=\034 <meta http-equiv=\034css\034 media=\034screen\034 responsible for the \034 type=\034application/\034 style=\034background-html; charset=utf-8\034 allowtransparency=\034stylesheet\034 type=\034te\013\010<meta http-equiv=\034></span><span class=\0340\034 cellspacing=\0340\034>;\010</script>\010<script sometimes called thedoes not necessarilyFor more informationat the beginning of <!DOCTYPE html><htmlparticularly in the type=\034hidden\034 name=\034javascript:void(0);\034effectiveness of the autocomplete=\034off\034 generally considered><input type=\034text\034 \034></script>\013\010<scriptthroughout the worldcommon misconceptionassociation with the</div>\010</div>\010<div cduring his lifetime,corresponding to thetype=\034image/x-icon\034 an increasing numberdiplomatic relationsare often consideredmeta charset=\034utf-8\034 <input type=\034text\034 examples include the\034><img src=\034http://iparticipation in thethe establishment of\010</div>\010<div class=\034&nbsp;&nbsp;to determine whetherquite different frommarked the beginningdistance between thecontributions to theconflict between thewidely considered towas one of the firstwith varying degreeshave speculated that(document.getElementparticipating in theoriginally developedeta charset=\034utf-8\034> type=\034text/css\034 />\010interchangeably withmore closely relatedsocial and politicalthat would otherwiseperpendicular to thestyle type=\034text/csstype=\034submit\034 name=\034families residing indeveloping countriescomputer programmingeconomic developmentdetermination of thefor more informationon several occasionsportugu\195\170s (Europeu)\208\163\208\186\209\128\208\176\209\151\208\189\209\129\209\140\208\186\208\176\209\131\208\186\209\128\208\176\209\151\208\189\209\129\209\140\208\186\208\176\208\160\208\190\209\129\209\129\208\184\208\185\209\129\208\186\208\190\208\185\208\188\208\176\209\130\208\181\209\128\208\184\208\176\208\187\208\190\208\178\208\184\208\189\209\132\208\190\209\128\208\188\208\176\209\134\208\184\208\184\209\131\208\191\209\128\208\176\208\178\208\187\208\181\208\189\208\184\209\143\208\189\208\181\208\190\208\177\209\133\208\190\208\180\208\184\208\188\208\190\208\184\208\189\209\132\208\190\209\128\208\188\208\176\209\134\208\184\209\143\208\152\208\189\209\132\208\190\209\128\208\188\208\176\209\134\208\184\209\143\208\160\208\181\209\129\208\191\209\131\208\177\208\187\208\184\208\186\208\184\208\186\208\190\208\187\208\184\209\135\208\181\209\129\209\130\208\178\208\190\208\184\208\189\209\132\208\190\209\128\208\188\208\176\209\134\208\184\209\142\209\130\208\181\209\128\209\128\208\184\209\130\208\190\209\128\208\184\208\184\208\180\208\190\209\129\209\130\208\176\209\130\208\190\209\135\208\189\208\190\216\167\217\132\217\133\216\170\217\136\216\167\216\172\216\175\217\136\217\134\216\167\217\132\216\167\216\180\216\170\216\177\216\167\217\131\216\167\216\170\216\167\217\132\216\167\217\130\216\170\216\177\216\167\216\173\216\167\216\170html; charset=UTF-8\034 setTimeout(function()display:inline-block;<input type=\034submit\034 type = 'text/javascri<img src=\034http://www.\034 \034http://www.w3.org/shortcut icon\034 href=\034\034 autocomplete=\034off\034 </a></div><div class=</a></li>\010<li class=\034css\034 type=\034text/css\034 <form action=\034http://xt/css\034 href=\034http://link rel=\034alternate\034 \013\010<script type=\034text/ onclick=\034javascript:(new Date).getTime()}height=\0341\034 width=\0341\034 People's Republic of <a href=\034http://www.text-decoration:underthe beginning of the </div>\010</div>\010</div>\010establishment of the </div></div></div></d#viewport{min-height:\010<script src=\034http://option><option value=often referred to as /option>\010<option valu<!DOCTYPE html>\010<!--[International Airport>\010<a href=\034http://www</a><a href=\034http://w\224\184\160\224\184\178\224\184\169\224\184\178\224\185\132\224\184\151\224\184\162\225\131\165\225\131\144\225\131\160\225\131\151\225\131\163\225\131\154\225\131\152\230\173\163\233\171\148\228\184\173\230\150\135 (\231\185\129\233\171\148)\224\164\168\224\164\191\224\164\176\224\165\141\224\164\166\224\165\135\224\164\182\224\164\161\224\164\190\224\164\137\224\164\168\224\164\178\224\165\139\224\164\161\224\164\149\224\165\141\224\164\183\224\165\135\224\164\164\224\165\141\224\164\176\224\164\156\224\164\190\224\164\168\224\164\149\224\164\190\224\164\176\224\165\128\224\164\184\224\164\130\224\164\172\224\164\130\224\164\167\224\164\191\224\164\164\224\164\184\224\165\141\224\164\165\224\164\190\224\164\170\224\164\168\224\164\190\224\164\184\224\165\141\224\164\181\224\165\128\224\164\149\224\164\190\224\164\176\224\164\184\224\164\130\224\164\184\224\165\141\224\164\149\224\164\176\224\164\163\224\164\184\224\164\190\224\164\174\224\164\151\224\165\141\224\164\176\224\165\128\224\164\154\224\164\191\224\164\159\224\165\141\224\164\160\224\165\139\224\164\130\224\164\181\224\164\191\224\164\156\224\165\141\224\164\158\224\164\190\224\164\168\224\164\133\224\164\174\224\165\135\224\164\176\224\164\191\224\164\149\224\164\190\224\164\181\224\164\191\224\164\173\224\164\191\224\164\168\224\165\141\224\164\168\224\164\151\224\164\190\224\164\161\224\164\191\224\164\175\224\164\190\224\164\129\224\164\149\224\165\141\224\164\175\224\165\139\224\164\130\224\164\149\224\164\191\224\164\184\224\165\129\224\164\176\224\164\149\224\165\141\224\164\183\224\164\190\224\164\170\224\164\185\224\165\129\224\164\129\224\164\154\224\164\164\224\165\128\224\164\170\224\165\141\224\164\176\224\164\172\224\164\130\224\164\167\224\164\168\224\164\159\224\164\191\224\164\170\224\165\141\224\164\170\224\164\163\224\165\128\224\164\149\224\165\141\224\164\176\224\164\191\224\164\149\224\165\135\224\164\159\224\164\170\224\165\141\224\164\176\224\164\190\224\164\176\224\164\130\224\164\173\224\164\170\224\165\141\224\164\176\224\164\190\224\164\170\224\165\141\224\164\164\224\164\174\224\164\190\224\164\178\224\164\191\224\164\149\224\165\139\224\164\130\224\164\176\224\164\171\224\164\188\224\165\141\224\164\164\224\164\190\224\164\176\224\164\168\224\164\191\224\164\176\224\165\141\224\164\174\224\164\190\224\164\163\224\164\178\224\164\191\224\164\174\224\164\191\224\164\159\224\165\135\224\164\161description\034 content=\034document.location.prot.getElementsByTagName(<!DOCTYPE html>\010<html <meta charset=\034utf-8\034>:url\034 content=\034http://.css\034 rel=\034stylesheet\034style type=\034text/css\034>type=\034text/css\034 href=\034w3.org/1999/xhtml\034 xmltype=\034text/javascript\034 method=\034get\034 action=\034link rel=\034stylesheet\034 = document.getElementtype=\034image/x-icon\034 />cellpadding=\0340\034 cellsp.css\034 type=\034text/css\034 </a></li><li><a href=\034\034 width=\0341\034 height=\0341\034\034><a href=\034http://www.style=\034display:none;\034>alternate\034 type=\034appli-//W3C//DTD XHTML 1.0 ellspacing=\0340\034 cellpad type=\034hidden\034 value=\034/a> <span role=\034s\010<input type=\034hidden\034 language=\034JavaScript\034 document.getElementsBg=\0340\034 cellspacing=\0340\034 ype=\034text/css\034 media=\034type='text/javascript'with the exception of ype=\034text/css\034 rel=\034st height=\0341\034 width=\0341\034 ='+encodeURIComponent(<link rel=\034alternate\034 \010body, tr, input, textmeta name=\034robots\034 conmethod=\034post\034 action=\034>\010<a href=\034http://www.css\034 rel=\034stylesheet\034 </div></div><div classlanguage=\034javascript\034>aria-hidden=\034true\034>\194\183<ript\034 type=\034text/javasl=0;})();\010(function(){background-image: url(/a></li><li><a href=\034h\009\009<li><a href=\034http://ator\034 aria-hidden=\034tru> <a href=\034http://www.language=\034javascript\034 /option>\010<option value/div></div><div class=rator\034 aria-hidden=\034tre=(new Date).getTime()portugu\195\170s (do Brasil)\208\190\209\128\208\179\208\176\208\189\208\184\208\183\208\176\209\134\208\184\208\184\208\178\208\190\208\183\208\188\208\190\208\182\208\189\208\190\209\129\209\130\209\140\208\190\208\177\209\128\208\176\208\183\208\190\208\178\208\176\208\189\208\184\209\143\209\128\208\181\208\179\208\184\209\129\209\130\209\128\208\176\209\134\208\184\208\184\208\178\208\190\208\183\208\188\208\190\208\182\208\189\208\190\209\129\209\130\208\184\208\190\208\177\209\143\208\183\208\176\209\130\208\181\208\187\209\140\208\189\208\176<!DOCTYPE html PUBLIC \034nt-Type\034 content=\034text/<meta http-equiv=\034Conteransitional//EN\034 \034http:<html xmlns=\034http://www-//W3C//DTD XHTML 1.0 TDTD/xhtml1-transitional//www.w3.org/TR/xhtml1/pe = 'text/javascript';<meta name=\034descriptionparentNode.insertBefore<input type=\034hidden\034 najs\034 type=\034text/javascri(document).ready(functiscript type=\034text/javasimage\034 content=\034http://UA-Compatible\034 content=tml; charset=utf-8\034 />\010link rel=\034shortcut icon<link rel=\034stylesheet\034 </script>\010<script type== document.createElemen<a target=\034_blank\034 href= document.getElementsBinput type=\034text\034 name=a.type = 'text/javascrinput type=\034hidden\034 namehtml; charset=utf-8\034 />dtd\034>\010<html xmlns=\034http-//W3C//DTD HTML 4.01 TentsByTagName('script')input type=\034hidden\034 nam<script type=\034text/javas\034 style=\034display:none;\034>document.getElementById(=document.createElement(' type='text/javascript'input type=\034text\034 name=\034d.getElementsByTagName(snical\034 href=\034http://www.C//DTD HTML 4.01 Transit<style type=\034text/css\034>\010\010<style type=\034text/css\034>ional.dtd\034>\010<html xmlns=http-equiv=\034Content-Typeding=\0340\034 cellspacing=\0340\034html; charset=utf-8\034 />\010 style=\034display:none;\034><<li><a href=\034http://www. type='text/javascript'>\208\180\208\181\209\143\209\130\208\181\208\187\209\140\208\189\208\190\209\129\209\130\208\184\209\129\208\190\208\190\209\130\208\178\208\181\209\130\209\129\209\130\208\178\208\184\208\184\208\191\209\128\208\190\208\184\208\183\208\178\208\190\208\180\209\129\209\130\208\178\208\176\208\177\208\181\208\183\208\190\208\191\208\176\209\129\208\189\208\190\209\129\209\130\208\184\224\164\170\224\165\129\224\164\184\224\165\141\224\164\164\224\164\191\224\164\149\224\164\190\224\164\149\224\164\190\224\164\130\224\164\151\224\165\141\224\164\176\224\165\135\224\164\184\224\164\137\224\164\168\224\165\141\224\164\185\224\165\139\224\164\130\224\164\168\224\165\135\224\164\181\224\164\191\224\164\167\224\164\190\224\164\168\224\164\184\224\164\173\224\164\190\224\164\171\224\164\191\224\164\149\224\165\141\224\164\184\224\164\191\224\164\130\224\164\151\224\164\184\224\165\129\224\164\176\224\164\149\224\165\141\224\164\183\224\164\191\224\164\164\224\164\149\224\165\137\224\164\170\224\165\128\224\164\176\224\164\190\224\164\135\224\164\159\224\164\181\224\164\191\224\164\156\224\165\141\224\164\158\224\164\190\224\164\170\224\164\168\224\164\149\224\164\190\224\164\176\224\165\141\224\164\176\224\164\181\224\164\190\224\164\136\224\164\184\224\164\149\224\165\141\224\164\176\224\164\191\224\164\175\224\164\164\224\164\190"
5
-
6
-
(* Word offsets by length (indices 0-24, only 4-24 are valid) *)
7
-
let offset_by_length = [|
8
-
0; 0; 0; 0; 0; 4096; 9216; 21504; 35840; 44032;
9
-
53248; 63488; 74752; 87040; 93696; 100864; 104704; 106752; 108928; 113536;
10
-
115968; 118528; 119872; 121280; 122016
11
-
|]
12
-
13
-
(* Log2 of word count per length *)
14
-
let size_bits_by_length = [|
15
-
0; 0; 0; 0; 10; 10; 11; 11; 10; 10;
16
-
10; 10; 10; 9; 9; 8; 7; 7; 8; 7;
17
-
7; 6; 6; 5; 5
18
-
|]
19
-
20
-
let min_word_length = 4
21
-
let max_word_length = 24
22
-
23
-
(* Get a word from the dictionary *)
24
-
let get_word ~length ~index =
25
-
if length < min_word_length || length > max_word_length then
26
-
invalid_arg "Dictionary word length out of range";
27
-
let offset = offset_by_length.(length) + index * length in
28
-
String.sub data offset length
-7
ocaml-brotli/src/dune
-7
ocaml-brotli/src/dune
···
1
-
(library
2
-
(name brotli)
3
-
(public_name brotli)
4
-
(modules brotli brotli_decode brotli_encode bit_reader bit_writer
5
-
huffman context transform dictionary prefix constants lz77 dict_match
6
-
block_split optimal)
7
-
(ocamlopt_flags (:standard -O3 -unbox-closures -unbox-closures-factor 20)))
-227
ocaml-brotli/src/huffman.ml
-227
ocaml-brotli/src/huffman.ml
···
1
-
(* Canonical Huffman coding with 2-level lookup tables for Brotli *)
2
-
3
-
let max_length = 15
4
-
5
-
(* A Huffman code entry in the lookup table *)
6
-
type code = {
7
-
bits : int; (* Number of bits used for this symbol, or bits in subtable *)
8
-
value : int; (* Symbol value, or offset to subtable *)
9
-
}
10
-
11
-
(* A Huffman lookup table - flat array with 2-level structure *)
12
-
type table = code array
13
-
14
-
exception Invalid_huffman_tree
15
-
16
-
(* Returns reverse(reverse(key, len) + 1, len) for canonical code generation *)
17
-
let get_next_key key length =
18
-
let rec loop step =
19
-
if key land step = 0 then
20
-
(key land (step - 1)) + step
21
-
else
22
-
loop (step lsr 1)
23
-
in
24
-
loop (1 lsl (length - 1))
25
-
26
-
(* Store code in table[i], table[i+step], table[i+2*step], ... *)
27
-
let replicate_value table base step table_end code =
28
-
let rec loop index =
29
-
if index >= base then begin
30
-
table.(index) <- code;
31
-
loop (index - step)
32
-
end
33
-
in
34
-
loop (base + table_end - step)
35
-
36
-
(* Calculate the width of the next 2nd level table *)
37
-
let next_table_bit_size count length root_bits =
38
-
let left = ref (1 lsl (length - root_bits)) in
39
-
let len = ref length in
40
-
while !len < max_length do
41
-
left := !left - count.(!len);
42
-
if !left <= 0 then
43
-
len := max_length (* Break *)
44
-
else begin
45
-
incr len;
46
-
left := !left lsl 1
47
-
end
48
-
done;
49
-
!len - root_bits
50
-
51
-
(* Build a Huffman lookup table from code lengths *)
52
-
let build_table ~code_lengths ~alphabet_size ~root_bits =
53
-
let count = Array.make (max_length + 1) 0 in
54
-
let offset = Array.make (max_length + 1) 0 in
55
-
let sorted_symbols = Array.make alphabet_size 0 in
56
-
57
-
(* Build histogram of code lengths *)
58
-
for symbol = 0 to alphabet_size - 1 do
59
-
let len = code_lengths.(symbol) in
60
-
count.(len) <- count.(len) + 1
61
-
done;
62
-
63
-
(* Generate offsets into sorted symbol table by code length *)
64
-
offset.(1) <- 0;
65
-
for length = 1 to max_length - 1 do
66
-
offset.(length + 1) <- offset.(length) + count.(length)
67
-
done;
68
-
69
-
(* Sort symbols by length, by symbol order within each length *)
70
-
for symbol = 0 to alphabet_size - 1 do
71
-
let length = code_lengths.(symbol) in
72
-
if length <> 0 then begin
73
-
sorted_symbols.(offset.(length)) <- symbol;
74
-
offset.(length) <- offset.(length) + 1
75
-
end
76
-
done;
77
-
78
-
let table_bits = ref root_bits in
79
-
let table_size = ref (1 lsl !table_bits) in
80
-
let total_size = ref !table_size in
81
-
82
-
(* Pre-allocate table with maximum possible size *)
83
-
let max_table_size = !table_size * 4 in (* Conservative estimate *)
84
-
let root_table = Array.make max_table_size { bits = 0; value = 0 } in
85
-
86
-
(* Special case: code with only one value *)
87
-
if offset.(max_length) = 1 then begin
88
-
for key = 0 to !total_size - 1 do
89
-
root_table.(key) <- { bits = 0; value = sorted_symbols.(0) land 0xFFFF }
90
-
done;
91
-
Array.sub root_table 0 !total_size
92
-
end
93
-
else begin
94
-
let table = ref 0 in
95
-
let key = ref 0 in
96
-
let symbol = ref 0 in
97
-
let step = ref 2 in
98
-
99
-
(* Fill in root table *)
100
-
for length = 1 to root_bits do
101
-
while count.(length) > 0 do
102
-
let code = { bits = length land 0xFF; value = sorted_symbols.(!symbol) land 0xFFFF } in
103
-
incr symbol;
104
-
replicate_value root_table (!table + !key) !step !table_size code;
105
-
key := get_next_key !key length;
106
-
count.(length) <- count.(length) - 1
107
-
done;
108
-
step := !step lsl 1
109
-
done;
110
-
111
-
(* Fill in 2nd level tables and add pointers to root table *)
112
-
let mask = !total_size - 1 in
113
-
let low = ref (-1) in
114
-
step := 2;
115
-
let start_table = 0 in
116
-
117
-
for length = root_bits + 1 to max_length do
118
-
while count.(length) > 0 do
119
-
if (!key land mask) <> !low then begin
120
-
table := !table + !table_size;
121
-
table_bits := next_table_bit_size count length root_bits;
122
-
table_size := 1 lsl !table_bits;
123
-
total_size := !total_size + !table_size;
124
-
low := !key land mask;
125
-
root_table.(start_table + !low) <- {
126
-
bits = (!table_bits + root_bits) land 0xFF;
127
-
value = (!table - start_table - !low) land 0xFFFF
128
-
}
129
-
end;
130
-
let code = { bits = (length - root_bits) land 0xFF; value = sorted_symbols.(!symbol) land 0xFFFF } in
131
-
incr symbol;
132
-
replicate_value root_table (!table + (!key lsr root_bits)) !step !table_size code;
133
-
key := get_next_key !key length;
134
-
count.(length) <- count.(length) - 1
135
-
done;
136
-
step := !step lsl 1
137
-
done;
138
-
139
-
Array.sub root_table 0 !total_size
140
-
end
141
-
142
-
(* Read a symbol from the bit stream using the Huffman table *)
143
-
let[@inline] read_symbol table root_bits br =
144
-
let bits = Bit_reader.peek_bits br 15 in
145
-
let initial_idx = bits land ((1 lsl root_bits) - 1) in
146
-
let entry = table.(initial_idx) in
147
-
if entry.bits <= root_bits then begin
148
-
(* Symbol found in root table *)
149
-
Bit_reader.skip_bits br entry.bits;
150
-
entry.value
151
-
end
152
-
else begin
153
-
(* Need to look in 2nd level table *)
154
-
Bit_reader.skip_bits br root_bits;
155
-
let extra_bits = entry.bits - root_bits in
156
-
let idx2 = (bits lsr root_bits) land ((1 lsl extra_bits) - 1) in
157
-
let entry2 = table.(initial_idx + entry.value + idx2) in
158
-
Bit_reader.skip_bits br entry2.bits;
159
-
entry2.value
160
-
end
161
-
162
-
(* Build Huffman table for simple prefix codes (1-4 symbols) *)
163
-
let build_simple_table symbols num_symbols =
164
-
let table_size = 1 lsl Constants.huffman_max_table_bits in
165
-
let table = Array.make table_size { bits = 0; value = 0 } in
166
-
167
-
match num_symbols with
168
-
| 1 ->
169
-
(* Single symbol - use 0 bits *)
170
-
for i = 0 to table_size - 1 do
171
-
table.(i) <- { bits = 0; value = symbols.(0) }
172
-
done;
173
-
table
174
-
| 2 ->
175
-
(* Two symbols - 1 bit each *)
176
-
let half = table_size / 2 in
177
-
for i = 0 to half - 1 do
178
-
table.(i) <- { bits = 1; value = symbols.(0) }
179
-
done;
180
-
for i = half to table_size - 1 do
181
-
table.(i) <- { bits = 1; value = symbols.(1) }
182
-
done;
183
-
table
184
-
| 3 ->
185
-
(* Three symbols: 1, 2, 2 bits *)
186
-
let quarter = table_size / 4 in
187
-
for i = 0 to quarter - 1 do
188
-
table.(i) <- { bits = 1; value = symbols.(0) }
189
-
done;
190
-
for i = quarter to 2 * quarter - 1 do
191
-
table.(i) <- { bits = 2; value = symbols.(1) }
192
-
done;
193
-
for i = 2 * quarter to table_size - 1 do
194
-
table.(i) <- { bits = 2; value = symbols.(2) }
195
-
done;
196
-
table
197
-
| 4 ->
198
-
(* Four symbols: 2 bits each, with tree-select bit *)
199
-
let quarter = table_size / 4 in
200
-
for i = 0 to quarter - 1 do
201
-
table.(i) <- { bits = 2; value = symbols.(0) }
202
-
done;
203
-
for i = quarter to 2 * quarter - 1 do
204
-
table.(i) <- { bits = 2; value = symbols.(1) }
205
-
done;
206
-
for i = 2 * quarter to 3 * quarter - 1 do
207
-
table.(i) <- { bits = 2; value = symbols.(2) }
208
-
done;
209
-
for i = 3 * quarter to table_size - 1 do
210
-
table.(i) <- { bits = 2; value = symbols.(3) }
211
-
done;
212
-
table
213
-
| _ ->
214
-
raise Invalid_huffman_tree
215
-
216
-
(* Maximum table sizes for different alphabet sizes *)
217
-
let max_table_sizes = [|
218
-
256; 402; 436; 468; 500; 534; 566; 598;
219
-
630; 662; 694; 726; 758; 790; 822; 854;
220
-
886; 918; 950; 982; 1014; 1046; 1078; 1080
221
-
|]
222
-
223
-
(* Get maximum table size for a given alphabet size *)
224
-
let max_table_size alphabet_size =
225
-
if alphabet_size <= 256 then 256
226
-
else if alphabet_size <= 704 then 1080
227
-
else 2048 (* Large alphabets *)
-544
ocaml-brotli/src/lz77.ml
-544
ocaml-brotli/src/lz77.ml
···
1
-
(* LZ77 matching with distance ring buffer support for Brotli *)
2
-
(* Implements scoring and parameters matching brotli-c reference *)
3
-
4
-
(* Configuration *)
5
-
let hash_bits = 17
6
-
let hash_size = 1 lsl hash_bits
7
-
let min_match = 4
8
-
let max_match = 258
9
-
let window_bits = 22
10
-
let max_backward_distance = (1 lsl window_bits) - 16
11
-
12
-
(* Scoring constants from brotli-c (hash.h) *)
13
-
let brotli_literal_byte_score = 135
14
-
let brotli_distance_bit_penalty = 30
15
-
(* BROTLI_SCORE_BASE = DISTANCE_BIT_PENALTY * 8 * sizeof(size_t) = 1920 on 64-bit *)
16
-
let brotli_score_base = brotli_distance_bit_penalty * 8 * 8
17
-
18
-
(* Block size (ring buffer size per bucket) by quality for H5 hasher.
19
-
In brotli-c: block_bits = quality - 1 for q5-9 *)
20
-
let get_block_size quality =
21
-
if quality <= 4 then 1
22
-
else if quality = 5 then 16 (* 1 << 4 *)
23
-
else if quality = 6 then 32 (* 1 << 5 *)
24
-
else if quality = 7 then 64 (* 1 << 6 *)
25
-
else if quality = 8 then 128 (* 1 << 7 *)
26
-
else 256 (* 1 << 8 for q9+ *)
27
-
28
-
(* num_last_distances_to_check by quality from brotli-c *)
29
-
let get_num_last_distances_to_check quality =
30
-
if quality < 7 then 4
31
-
else if quality < 9 then 10
32
-
else 16
33
-
34
-
(* Bucket sweep (number of hash slots to check) for lower qualities *)
35
-
let get_bucket_sweep quality =
36
-
if quality = 2 then 1 (* H2: sweep = 0, single slot *)
37
-
else if quality = 3 then 2 (* H3: sweep = 1, 2 slots *)
38
-
else if quality = 4 then 4 (* H4: sweep = 2, 4 slots *)
39
-
else 1
40
-
41
-
42
-
(* Distance ring buffer for short distance codes *)
43
-
type dist_ring = {
44
-
mutable distances : int array; (* Last 4 distances *)
45
-
mutable idx : int; (* Current index *)
46
-
}
47
-
48
-
let create_dist_ring () = {
49
-
distances = [| 16; 15; 11; 4 |]; (* Initial values per RFC 7932 *)
50
-
idx = 0;
51
-
}
52
-
53
-
let push_distance ring dist =
54
-
ring.distances.(ring.idx land 3) <- dist;
55
-
ring.idx <- ring.idx + 1
56
-
57
-
let get_last_distance ring n =
58
-
(* n=0: last, n=1: second-to-last, etc. *)
59
-
ring.distances.((ring.idx - 1 - n) land 3)
60
-
61
-
(* Short distance codes (0-15) per RFC 7932:
62
-
0: last distance
63
-
1: second-to-last
64
-
2: third-to-last
65
-
3: fourth-to-last
66
-
4: last - 1
67
-
5: last + 1
68
-
6: last - 2
69
-
7: last + 2
70
-
8: last - 3
71
-
9: last + 3
72
-
10: second-to-last - 1
73
-
11: second-to-last + 1
74
-
12: second-to-last - 2
75
-
13: second-to-last + 2
76
-
14: second-to-last - 3
77
-
15: second-to-last + 3
78
-
*)
79
-
let short_code_distances ring =
80
-
let last = get_last_distance ring 0 in
81
-
let second = get_last_distance ring 1 in
82
-
[|
83
-
get_last_distance ring 0; (* 0 *)
84
-
get_last_distance ring 1; (* 1 *)
85
-
get_last_distance ring 2; (* 2 *)
86
-
get_last_distance ring 3; (* 3 *)
87
-
last - 1; (* 4 *)
88
-
last + 1; (* 5 *)
89
-
last - 2; (* 6 *)
90
-
last + 2; (* 7 *)
91
-
last - 3; (* 8 *)
92
-
last + 3; (* 9 *)
93
-
second - 1; (* 10 *)
94
-
second + 1; (* 11 *)
95
-
second - 2; (* 12 *)
96
-
second + 2; (* 13 *)
97
-
second - 3; (* 14 *)
98
-
second + 3; (* 15 *)
99
-
|]
100
-
101
-
(* Find short distance code for a distance, or None if not found.
102
-
Returns the code that requires the fewest extra bits (codes 0-3 are best).
103
-
104
-
Short code mapping (RFC 7932):
105
-
- Codes 0-3: exact match to last 4 distances
106
-
- Codes 4-9: last distance +/- 1,2,3
107
-
- Codes 10-15: second-to-last distance +/- 1,2,3 *)
108
-
let find_short_code ring distance =
109
-
if distance <= 0 then None
110
-
else
111
-
let last = get_last_distance ring 0 in
112
-
let second = get_last_distance ring 1 in
113
-
(* Build candidate distances for each short code *)
114
-
let candidates = [|
115
-
last; (* 0 *)
116
-
get_last_distance ring 1; (* 1 *)
117
-
get_last_distance ring 2; (* 2 *)
118
-
get_last_distance ring 3; (* 3 *)
119
-
(if last > 1 then last - 1 else -1); (* 4 *)
120
-
last + 1; (* 5 *)
121
-
(if last > 2 then last - 2 else -1); (* 6 *)
122
-
last + 2; (* 7 *)
123
-
(if last > 3 then last - 3 else -1); (* 8 *)
124
-
last + 3; (* 9 *)
125
-
(if second > 1 then second - 1 else -1); (* 10 *)
126
-
second + 1; (* 11 *)
127
-
(if second > 2 then second - 2 else -1); (* 12 *)
128
-
second + 2; (* 13 *)
129
-
(if second > 3 then second - 3 else -1); (* 14 *)
130
-
second + 3; (* 15 *)
131
-
|] in
132
-
(* Find first matching code (lower codes are more efficient) *)
133
-
Array.find_index (fun c -> c = distance) candidates
134
-
135
-
(* Command type with optional short distance code *)
136
-
type command =
137
-
| InsertCopy of {
138
-
lit_start: int;
139
-
lit_len: int;
140
-
copy_len: int;
141
-
distance: int;
142
-
dist_code: int option; (* Some code for short codes 0-15, None for explicit *)
143
-
}
144
-
| Literals of { start: int; len: int }
145
-
146
-
(* Hash function - produces 17-bit hash from 4 bytes *)
147
-
let[@inline always] hash4 src pos =
148
-
Constants.hash4_bytes src pos hash_bits
149
-
150
-
(* Find match length *)
151
-
let[@inline always] find_match_length src a b limit =
152
-
let len = ref 0 in
153
-
let max_len = min max_match (limit - b) in
154
-
while !len < max_len && Bytes.get src (a + !len) = Bytes.get src (b + !len) do
155
-
incr len
156
-
done;
157
-
!len
158
-
159
-
(* Log2 floor for non-zero values - matches brotli-c Log2FloorNonZero *)
160
-
let[@inline always] log2_floor_nonzero v =
161
-
let rec go v acc = if v <= 1 then acc else go (v lsr 1) (acc + 1) in
162
-
go v 0
163
-
164
-
(* BackwardReferenceScore from brotli-c (hash.h line 115-118):
165
-
score = SCORE_BASE + LITERAL_BYTE_SCORE * copy_length
166
-
- DISTANCE_BIT_PENALTY * Log2FloorNonZero(backward_reference_offset)
167
-
This prefers longer matches and shorter distances. *)
168
-
let backward_reference_score copy_len backward_distance =
169
-
brotli_score_base +
170
-
brotli_literal_byte_score * copy_len -
171
-
brotli_distance_bit_penalty * (log2_floor_nonzero backward_distance)
172
-
173
-
(* BackwardReferenceScoreUsingLastDistance from brotli-c (hash.h line 121-124):
174
-
score = LITERAL_BYTE_SCORE * copy_length + SCORE_BASE + 15
175
-
Short code 0 (last distance) gets a bonus. *)
176
-
let backward_reference_score_using_last_distance copy_len =
177
-
brotli_literal_byte_score * copy_len + brotli_score_base + 15
178
-
179
-
(* BackwardReferencePenaltyUsingLastDistance from brotli-c (hash.h line 127-129):
180
-
Penalty for short codes 1-15 (not 0): 39 + lookup(distance_short_code)
181
-
The magic constant 0x1CA10 encodes penalties: codes 1-3 get 0, 4-5 get 2, etc. *)
182
-
let backward_reference_penalty_using_last_distance distance_short_code =
183
-
39 + ((0x1CA10 lsr (distance_short_code land 0xE)) land 0xE)
184
-
185
-
(* Score function matching brotli-c exactly *)
186
-
let score_match copy_len distance dist_code =
187
-
match dist_code with
188
-
| Some 0 ->
189
-
(* Last distance - use special scoring with bonus *)
190
-
backward_reference_score_using_last_distance copy_len
191
-
| Some code when code < 16 ->
192
-
(* Other short codes - score with last distance bonus minus penalty *)
193
-
let score = backward_reference_score_using_last_distance copy_len in
194
-
score - backward_reference_penalty_using_last_distance code
195
-
| _ ->
196
-
(* Explicit distance - standard scoring *)
197
-
backward_reference_score copy_len distance
198
-
199
-
(* Insert length code tables *)
200
-
let insert_length_offset = [|
201
-
0; 1; 2; 3; 4; 5; 6; 8; 10; 14; 18; 26; 34; 50; 66; 98; 130; 194; 322; 578; 1090; 2114; 6210; 22594
202
-
|]
203
-
204
-
(* Get insert length code *)
205
-
let get_insert_code length =
206
-
let rec find i =
207
-
if i >= 23 then 23
208
-
else if length < insert_length_offset.(i + 1) then i
209
-
else find (i + 1)
210
-
in
211
-
find 0
212
-
213
-
(* Get max copy_len that fits with a given insert_len *)
214
-
let max_copy_len_for_insert insert_len =
215
-
let insert_code = get_insert_code insert_len in
216
-
if insert_code >= 16 then 9 else max_match
217
-
218
-
(* Try to find a match at a short code distance.
219
-
num_to_check controls how many short codes to check (4, 10, or 16 based on quality) *)
220
-
let try_short_code_match ?(num_to_check=16) src pos limit ring =
221
-
let candidates = short_code_distances ring in
222
-
let best = ref None in
223
-
let best_score = ref 0 in
224
-
for code = 0 to num_to_check - 1 do
225
-
let dist = candidates.(code) in
226
-
if dist > 0 && pos - dist >= 0 then begin
227
-
let prev = pos - dist in
228
-
let match_len = find_match_length src prev pos limit in
229
-
if match_len >= min_match then begin
230
-
let score = score_match match_len dist (Some code) in
231
-
if score > !best_score then begin
232
-
best := Some (match_len, dist, code);
233
-
best_score := score
234
-
end
235
-
end
236
-
end
237
-
done;
238
-
!best
239
-
240
-
(* Score a dictionary match *)
241
-
let score_dict_match copy_len =
242
-
(* Dictionary matches save literals and have no backward reference overhead *)
243
-
copy_len * 140 (* Slightly higher than LZ77's base score of 135 *)
244
-
245
-
(* Get max chain depth based on quality.
246
-
For Q2-4: uses bucket sweep (limited positions per bucket slot)
247
-
For Q5-9: uses block_size (ring buffer per bucket)
248
-
For Q10-11: uses binary tree with max_tree_search_depth=64 *)
249
-
let get_max_chain_depth quality =
250
-
if quality <= 4 then get_bucket_sweep quality
251
-
else get_block_size quality
252
-
253
-
(* Literal spree skip optimization from brotli-c quality.h:
254
-
When searching for backward references and have not seen matches for a long
255
-
time, we can skip some match lookups. Unsuccessful match lookups are very
256
-
expensive and this kind of heuristic speeds up compression quite a lot.
257
-
At first 8 byte strides are taken and every second byte is put to hasher.
258
-
After 4x more literals stride by 16 bytes, put every 4th byte to hasher.
259
-
Applied only to qualities 2 to 9. *)
260
-
let get_literal_spree_length quality =
261
-
if quality < 9 then 64 else 512
262
-
263
-
(* Find best match using hash chain for higher quality levels.
264
-
Matches brotli-c FindLongestMatch: first checks distance cache (short codes),
265
-
then searches hash chain/bucket.
266
-
chain_table_base is the base offset used for chain_table indexing. *)
267
-
let find_best_chain_match src pos src_end hash_table chain_table chain_table_base ring
268
-
~num_last_distances_to_check ~max_chain_depth =
269
-
if pos + min_match > src_end then None
270
-
else begin
271
-
let best_len = ref (min_match - 1) in (* Start at min_match-1 so >= min_match wins *)
272
-
let best_dist = ref 0 in
273
-
let best_score = ref 0 in
274
-
let best_code = ref None in
275
-
276
-
(* First: try short code distances (distance cache) - like brotli-c *)
277
-
let short_dists = short_code_distances ring in
278
-
for code = 0 to num_last_distances_to_check - 1 do
279
-
let dist = short_dists.(code) in
280
-
if dist > 0 && dist <= max_backward_distance then begin
281
-
let prev = pos - dist in
282
-
if prev >= 0 then begin
283
-
let match_len = find_match_length src prev pos src_end in
284
-
(* brotli-c accepts len >= 3 for codes 0-1, >= 4 otherwise *)
285
-
let min_len = if code < 2 then 3 else min_match in
286
-
if match_len >= min_len then begin
287
-
let score = score_match match_len dist (Some code) in
288
-
if score > !best_score then begin
289
-
best_len := match_len;
290
-
best_dist := dist;
291
-
best_score := score;
292
-
best_code := Some code
293
-
end
294
-
end
295
-
end
296
-
end
297
-
done;
298
-
299
-
(* Second: search hash chain for more matches *)
300
-
let h = hash4 src pos in
301
-
let chain_pos = ref hash_table.(h) in
302
-
let chain_count = ref 0 in
303
-
304
-
while !chain_pos >= 0 && !chain_count < max_chain_depth do
305
-
let distance = pos - !chain_pos in
306
-
if distance > 0 && distance <= max_backward_distance then begin
307
-
let match_len = find_match_length src !chain_pos pos src_end in
308
-
if match_len >= min_match then begin
309
-
let dist_code = find_short_code ring distance in
310
-
let score = score_match match_len distance dist_code in
311
-
if score > !best_score then begin
312
-
best_len := match_len;
313
-
best_dist := distance;
314
-
best_score := score;
315
-
best_code := dist_code
316
-
end
317
-
end
318
-
end;
319
-
(* Follow the chain - index relative to base *)
320
-
let chain_idx = !chain_pos - chain_table_base in
321
-
if chain_idx >= 0 && chain_idx < Array.length chain_table then
322
-
chain_pos := chain_table.(chain_idx)
323
-
else
324
-
chain_pos := -1;
325
-
incr chain_count
326
-
done;
327
-
328
-
if !best_len >= min_match then
329
-
Some (!best_len, !best_dist, !best_code)
330
-
else
331
-
None
332
-
end
333
-
334
-
(* Update hash chain. chain_table_base is the base offset for indexing. *)
335
-
let update_hash_chain src pos hash_table chain_table chain_table_base =
336
-
let chain_idx = pos - chain_table_base in
337
-
if chain_idx >= 0 && chain_idx < Array.length chain_table && pos + min_match <= Bytes.length src then begin
338
-
let h = hash4 src pos in
339
-
chain_table.(chain_idx) <- hash_table.(h);
340
-
hash_table.(h) <- pos
341
-
end
342
-
343
-
(* Generate commands with LZ77 matching, dictionary matching, and distance ring buffer.
344
-
Parameters match brotli-c quality-dependent configuration. *)
345
-
let generate_commands ?(use_dict=false) ?(quality=2) src src_pos src_len =
346
-
if src_len < min_match then
347
-
[Literals { start = src_pos; len = src_len }]
348
-
else begin
349
-
let commands = ref [] in
350
-
let hash_table = Array.make hash_size (-1) in
351
-
(* Chain table for quality 4+ - each position stores prev position with same hash.
352
-
The table is indexed relative to src_pos. *)
353
-
let chain_table =
354
-
if quality >= 4 then Array.make src_len (-1)
355
-
else [||] (* Not used for lower qualities *)
356
-
in
357
-
let chain_table_base = src_pos in (* Base offset for chain_table indexing *)
358
-
let ring = create_dist_ring () in
359
-
let pos = ref src_pos in
360
-
let src_end = src_pos + src_len in
361
-
let pending_start = ref src_pos in
362
-
let output_pos = ref 0 in
363
-
let max_chain_depth = get_max_chain_depth quality in
364
-
let num_last_distances_to_check = get_num_last_distances_to_check quality in
365
-
366
-
(* Cost for lazy matching decision - brotli-c uses heuristic thresholds *)
367
-
let lazy_match_cost = if quality >= 4 then 175 else 0 in
368
-
369
-
(* Literal spree skip optimization - track consecutive literals without matches *)
370
-
let literal_spree = ref 0 in
371
-
let spree_length = get_literal_spree_length quality in
372
-
let use_spree_skip = quality >= 2 && quality <= 9 in
373
-
374
-
while !pos < src_end - min_match do
375
-
(* Determine if we should skip this position due to literal spree *)
376
-
let skip_this_position =
377
-
if use_spree_skip && !literal_spree >= spree_length then begin
378
-
(* In sparse search mode - skip based on spree level *)
379
-
let stride = if !literal_spree >= spree_length * 4 then 16 else 8 in
380
-
let relative_pos = !pos - !pending_start in
381
-
relative_pos mod stride <> 0
382
-
end else false
383
-
in
384
-
385
-
if skip_this_position then begin
386
-
(* Still update hash table but with reduced frequency *)
387
-
let hash_update_stride = if !literal_spree >= spree_length * 4 then 4 else 2 in
388
-
let relative_pos = !pos - !pending_start in
389
-
if relative_pos mod hash_update_stride = 0 then begin
390
-
if quality >= 4 then
391
-
update_hash_chain src !pos hash_table chain_table chain_table_base
392
-
else
393
-
hash_table.(hash4 src !pos) <- !pos
394
-
end;
395
-
incr pos;
396
-
incr literal_spree
397
-
end else begin
398
-
(* Find best match at current position *)
399
-
let hash_match =
400
-
if quality >= 4 then
401
-
find_best_chain_match src !pos src_end hash_table chain_table chain_table_base ring
402
-
~num_last_distances_to_check ~max_chain_depth
403
-
else begin
404
-
(* Q2-3: Simple hash lookup with bucket sweep *)
405
-
let h = hash4 src !pos in
406
-
let prev = hash_table.(h) in
407
-
hash_table.(h) <- !pos;
408
-
(* Also check distance cache first *)
409
-
let short_match = try_short_code_match ~num_to_check:num_last_distances_to_check
410
-
src !pos src_end ring in
411
-
let hash_result =
412
-
if prev >= src_pos && !pos - prev <= max_backward_distance then begin
413
-
let match_len = find_match_length src prev !pos src_end in
414
-
if match_len >= min_match then
415
-
let distance = !pos - prev in
416
-
let dist_code = find_short_code ring distance in
417
-
Some (match_len, distance, dist_code)
418
-
else
419
-
None
420
-
end
421
-
else
422
-
None
423
-
in
424
-
(* Pick best between short code match and hash match *)
425
-
match short_match, hash_result with
426
-
| None, r -> r
427
-
| Some (len, dist, code), None -> Some (len, dist, Some code)
428
-
| Some (slen, sdist, scode), Some (hlen, hdist, hcode) ->
429
-
let s_score = score_match slen sdist (Some scode) in
430
-
let h_score = score_match hlen hdist hcode in
431
-
if s_score >= h_score then Some (slen, sdist, Some scode)
432
-
else Some (hlen, hdist, hcode)
433
-
end
434
-
in
435
-
436
-
(* Update hash chain for quality 4+ *)
437
-
if quality >= 4 then
438
-
update_hash_chain src !pos hash_table chain_table chain_table_base;
439
-
440
-
(* Try dictionary match if enabled *)
441
-
let dict_match =
442
-
if use_dict then begin
443
-
let pending_lits = !pos - !pending_start in
444
-
let current_output_pos = !output_pos + pending_lits in
445
-
Dict_match.find_match src !pos src_end max_backward_distance ~current_output_pos
446
-
end
447
-
else
448
-
None
449
-
in
450
-
451
-
(* Choose the best match based on score *)
452
-
let best_match =
453
-
match hash_match, dict_match with
454
-
| None, None -> None
455
-
| Some m, None -> Some m
456
-
| None, Some (dict_len, dict_dist) ->
457
-
Some (dict_len, dict_dist, None)
458
-
| Some (lz_len, lz_dist, lz_code), Some (dict_len, dict_dist) ->
459
-
let lz_score = score_match lz_len lz_dist lz_code in
460
-
let dict_score = score_dict_match dict_len in
461
-
if dict_score > lz_score then
462
-
Some (dict_len, dict_dist, None)
463
-
else
464
-
Some (lz_len, lz_dist, lz_code)
465
-
in
466
-
467
-
match best_match with
468
-
| Some (match_len, distance, dist_code) ->
469
-
(* Lazy matching for quality 4+: check if delaying gives better match *)
470
-
let final_match =
471
-
if quality >= 4 && !pos + 1 < src_end - min_match && match_len < max_match then begin
472
-
(* Update hash for next position *)
473
-
update_hash_chain src (!pos + 1) hash_table chain_table chain_table_base;
474
-
let next_match = find_best_chain_match src (!pos + 1) src_end
475
-
hash_table chain_table chain_table_base ring
476
-
~num_last_distances_to_check ~max_chain_depth in
477
-
match next_match with
478
-
| Some (next_len, next_dist, next_code) ->
479
-
let curr_score = score_match match_len distance dist_code in
480
-
let next_score = score_match next_len next_dist next_code - lazy_match_cost in
481
-
if next_score > curr_score then begin
482
-
(* Skip current position, emit literal *)
483
-
incr pos;
484
-
pending_start := !pending_start; (* Keep pending_start *)
485
-
None (* Signal to continue loop *)
486
-
end else
487
-
Some (match_len, distance, dist_code)
488
-
| None -> Some (match_len, distance, dist_code)
489
-
end else
490
-
Some (match_len, distance, dist_code)
491
-
in
492
-
493
-
(match final_match with
494
-
| Some (match_len, distance, dist_code) ->
495
-
let lit_len = !pos - !pending_start in
496
-
let max_copy = max_copy_len_for_insert lit_len in
497
-
let copy_len = min match_len max_copy in
498
-
499
-
commands := InsertCopy {
500
-
lit_start = !pending_start;
501
-
lit_len;
502
-
copy_len;
503
-
distance;
504
-
dist_code;
505
-
} :: !commands;
506
-
507
-
output_pos := !output_pos + lit_len + copy_len;
508
-
509
-
(match dist_code with
510
-
| Some 0 -> ()
511
-
| _ -> push_distance ring distance);
512
-
513
-
(* Update hash for all positions in the match for better chain coverage *)
514
-
let hash_update_count =
515
-
if quality >= 10 then min (copy_len - 1) 16
516
-
else if quality >= 4 then min (copy_len - 1) 8
517
-
else min (copy_len - 1) 2 in
518
-
for i = 1 to hash_update_count do
519
-
if !pos + i < src_end - min_match then begin
520
-
if quality >= 4 then
521
-
update_hash_chain src (!pos + i) hash_table chain_table chain_table_base
522
-
else
523
-
hash_table.(hash4 src (!pos + i)) <- !pos + i
524
-
end
525
-
done;
526
-
527
-
pos := !pos + copy_len;
528
-
pending_start := !pos;
529
-
(* Reset literal spree counter on match *)
530
-
literal_spree := 0
531
-
| None ->
532
-
(* Lazy match chose to skip, position already incremented *)
533
-
incr literal_spree)
534
-
| None ->
535
-
incr pos;
536
-
incr literal_spree
537
-
end (* end of else begin for skip_this_position *)
538
-
done;
539
-
540
-
if !pending_start < src_end then
541
-
commands := Literals { start = !pending_start; len = src_end - !pending_start } :: !commands;
542
-
543
-
List.rev !commands
544
-
end
-984
ocaml-brotli/src/optimal.ml
-984
ocaml-brotli/src/optimal.ml
···
1
-
(* Optimal parsing for Brotli compression (quality 10-11)
2
-
This implements Zopfli-like optimal matching using dynamic programming,
3
-
matching the brotli-c reference implementation in backward_references_hq.c *)
4
-
5
-
(* Configuration constants from brotli-c quality.h *)
6
-
let max_zopfli_len_quality_10 = 150
7
-
let max_zopfli_len_quality_11 = 325
8
-
let max_zopfli_candidates_q10 = 1 (* MaxZopfliCandidates for Q10 *)
9
-
let max_zopfli_candidates_q11 = 5 (* MaxZopfliCandidates for Q11 *)
10
-
let brotli_long_copy_quick_step = 16384
11
-
12
-
(* Match parameters *)
13
-
let min_match = 4
14
-
let max_match = 258
15
-
let max_distance = (1 lsl 22) - 16
16
-
let hash_bits = 17
17
-
let hash_size = 1 lsl hash_bits
18
-
let max_tree_search_depth = 64 (* For H10 binary tree hasher *)
19
-
20
-
(* Distance cache index and offset from brotli-c backward_references_hq.c *)
21
-
let distance_cache_index = [| 0; 1; 2; 3; 0; 0; 0; 0; 0; 0; 1; 1; 1; 1; 1; 1 |]
22
-
let distance_cache_offset = [| 0; 0; 0; 0; -1; 1; -2; 2; -3; 3; -1; 1; -2; 2; -3; 3 |]
23
-
24
-
(* Infinity for cost comparison *)
25
-
let infinity = max_float
26
-
27
-
(* Fast log2 approximation matching brotli-c FastLog2 *)
28
-
let[@inline always] fast_log2 v =
29
-
if v <= 0 then 0.0
30
-
else
31
-
let rec log2_floor v acc = if v <= 1 then acc else log2_floor (v lsr 1) (acc + 1) in
32
-
float_of_int (log2_floor v 0)
33
-
34
-
(* ============================================================
35
-
Cost Model (ZopfliCostModel from brotli-c)
36
-
============================================================ *)
37
-
38
-
type cost_model = {
39
-
(* Cost arrays *)
40
-
cost_cmd : float array; (* Command code costs *)
41
-
cost_dist : float array; (* Distance code costs *)
42
-
literal_costs : float array; (* Cumulative literal costs *)
43
-
min_cost_cmd : float; (* Minimum command cost *)
44
-
num_bytes : int;
45
-
}
46
-
47
-
(* SetCost from brotli-c: calculate Shannon entropy costs from histogram *)
48
-
let set_cost histogram histogram_size is_literal =
49
-
let cost = Array.make histogram_size 0.0 in
50
-
let sum = Array.fold_left (+) 0 histogram in
51
-
if sum = 0 then cost
52
-
else begin
53
-
let log2sum = fast_log2 sum in
54
-
let missing_symbol_sum =
55
-
if is_literal then sum
56
-
else sum + (Array.fold_left (fun acc h -> if h = 0 then acc + 1 else acc) 0 histogram)
57
-
in
58
-
let missing_symbol_cost = (fast_log2 missing_symbol_sum) +. 2.0 in
59
-
for i = 0 to histogram_size - 1 do
60
-
if histogram.(i) = 0 then
61
-
cost.(i) <- missing_symbol_cost
62
-
else begin
63
-
(* Shannon bits: log2(sum) - log2(count) *)
64
-
cost.(i) <- max 1.0 (log2sum -. fast_log2 histogram.(i))
65
-
end
66
-
done;
67
-
cost
68
-
end
69
-
70
-
(* UTF-8 position detection from brotli-c literal_cost.c:
71
-
Returns the expected position within a UTF-8 multi-byte sequence.
72
-
0 = single byte or first byte, 1 = second byte, 2 = third byte *)
73
-
let utf8_position last_byte current_byte max_utf8 =
74
-
if current_byte < 128 then
75
-
0 (* ASCII - next one is byte 1 again *)
76
-
else if current_byte >= 192 then
77
-
(* Start of multi-byte sequence *)
78
-
min 1 max_utf8
79
-
else begin
80
-
(* Continuation byte - check last byte to determine position *)
81
-
if last_byte < 0xE0 then
82
-
0 (* Completed two-byte sequence *)
83
-
else
84
-
(* Third byte of three-byte sequence *)
85
-
min 2 max_utf8
86
-
end
87
-
88
-
(* Detect if data is mostly UTF-8 and determine histogram level
89
-
Returns 0 for ASCII, 1 for 2-byte UTF-8, 2 for 3-byte UTF-8 *)
90
-
let decide_utf8_level src src_pos len =
91
-
let counts = Array.make 3 0 in
92
-
let last_c = ref 0 in
93
-
for i = 0 to min 2000 len - 1 do
94
-
let c = Char.code (Bytes.get src (src_pos + i)) in
95
-
let utf8_pos = utf8_position !last_c c 2 in
96
-
counts.(utf8_pos) <- counts.(utf8_pos) + 1;
97
-
last_c := c
98
-
done;
99
-
(* Use 3-byte histograms if >500 third-position bytes,
100
-
2-byte if >25 second/third position bytes combined,
101
-
otherwise single histogram *)
102
-
if counts.(2) < 500 then begin
103
-
if counts.(1) + counts.(2) < 25 then 0
104
-
else 1
105
-
end else 2
106
-
107
-
(* Sliding window literal cost estimation matching brotli-c literal_cost.c
108
-
Uses a sliding window to estimate per-position literal costs based on
109
-
local byte frequency distribution. For UTF-8 text, uses position-aware
110
-
histograms for better cost estimation. *)
111
-
let estimate_literal_costs_sliding_window src src_pos num_bytes =
112
-
let costs = Array.make (num_bytes + 2) 0.0 in
113
-
if num_bytes = 0 then costs
114
-
else begin
115
-
let max_utf8 = decide_utf8_level src src_pos num_bytes in
116
-
117
-
if max_utf8 > 0 then begin
118
-
(* UTF-8 mode: use position-aware histograms *)
119
-
let window_half = 495 in (* Smaller window for UTF-8 from brotli-c *)
120
-
let num_histograms = max_utf8 + 1 in
121
-
let histograms = Array.init num_histograms (fun _ -> Array.make 256 0) in
122
-
let in_window_utf8 = Array.make num_histograms 0 in
123
-
124
-
(* Bootstrap histograms *)
125
-
let initial_window = min window_half num_bytes in
126
-
let last_c = ref 0 in
127
-
let utf8_pos = ref 0 in
128
-
for i = 0 to initial_window - 1 do
129
-
let c = Char.code (Bytes.get src (src_pos + i)) in
130
-
histograms.(!utf8_pos).(c) <- histograms.(!utf8_pos).(c) + 1;
131
-
in_window_utf8.(!utf8_pos) <- in_window_utf8.(!utf8_pos) + 1;
132
-
utf8_pos := utf8_position !last_c c max_utf8;
133
-
last_c := c
134
-
done;
135
-
136
-
costs.(0) <- 0.0;
137
-
let prev1 = ref 0 in
138
-
let prev2 = ref 0 in
139
-
for i = 0 to num_bytes - 1 do
140
-
(* Slide window: remove byte from past *)
141
-
if i >= window_half then begin
142
-
let past_c = if i < window_half + 1 then 0
143
-
else Char.code (Bytes.get src (src_pos + i - window_half - 1)) in
144
-
let past_last = if i < window_half + 2 then 0
145
-
else Char.code (Bytes.get src (src_pos + i - window_half - 2)) in
146
-
let utf8_pos2 = utf8_position past_last past_c max_utf8 in
147
-
let remove_c = Char.code (Bytes.get src (src_pos + i - window_half)) in
148
-
histograms.(utf8_pos2).(remove_c) <- histograms.(utf8_pos2).(remove_c) - 1;
149
-
in_window_utf8.(utf8_pos2) <- in_window_utf8.(utf8_pos2) - 1
150
-
end;
151
-
(* Slide window: add byte from future *)
152
-
if i + window_half < num_bytes then begin
153
-
let fut_c = Char.code (Bytes.get src (src_pos + i + window_half - 1)) in
154
-
let fut_last = Char.code (Bytes.get src (src_pos + i + window_half - 2)) in
155
-
let utf8_pos2 = utf8_position fut_last fut_c max_utf8 in
156
-
let add_c = Char.code (Bytes.get src (src_pos + i + window_half)) in
157
-
histograms.(utf8_pos2).(add_c) <- histograms.(utf8_pos2).(add_c) + 1;
158
-
in_window_utf8.(utf8_pos2) <- in_window_utf8.(utf8_pos2) + 1
159
-
end;
160
-
161
-
(* Calculate cost for current byte using UTF-8 position *)
162
-
let c = Char.code (Bytes.get src (src_pos + i)) in
163
-
let utf8_pos = utf8_position !prev2 !prev1 max_utf8 in
164
-
let histo = max 1 histograms.(utf8_pos).(c) in
165
-
let in_win = max 1 in_window_utf8.(utf8_pos) in
166
-
let lit_cost = fast_log2 in_win -. fast_log2 histo +. 0.02905 in
167
-
let lit_cost = if lit_cost < 1.0 then lit_cost *. 0.5 +. 0.5 else lit_cost in
168
-
let prologue_length = 2000 in
169
-
let lit_cost =
170
-
if i < prologue_length then
171
-
lit_cost +. 0.35 +. 0.35 /. float_of_int prologue_length *. float_of_int i
172
-
else lit_cost
173
-
in
174
-
costs.(i + 1) <- costs.(i) +. lit_cost;
175
-
prev2 := !prev1;
176
-
prev1 := c
177
-
done;
178
-
costs
179
-
end else begin
180
-
(* Binary/ASCII mode: single histogram *)
181
-
let window_half = 2000 in (* Larger window for non-UTF-8 *)
182
-
let histogram = Array.make 256 0 in
183
-
184
-
(* Bootstrap histogram for first window_half bytes *)
185
-
let initial_window = min window_half num_bytes in
186
-
for i = 0 to initial_window - 1 do
187
-
let c = Char.code (Bytes.get src (src_pos + i)) in
188
-
histogram.(c) <- histogram.(c) + 1
189
-
done;
190
-
let in_window = ref initial_window in
191
-
192
-
costs.(0) <- 0.0;
193
-
for i = 0 to num_bytes - 1 do
194
-
(* Slide window: remove byte from past *)
195
-
if i >= window_half then begin
196
-
let old_c = Char.code (Bytes.get src (src_pos + i - window_half)) in
197
-
histogram.(old_c) <- histogram.(old_c) - 1;
198
-
decr in_window
199
-
end;
200
-
(* Slide window: add byte from future *)
201
-
if i + window_half < num_bytes then begin
202
-
let new_c = Char.code (Bytes.get src (src_pos + i + window_half)) in
203
-
histogram.(new_c) <- histogram.(new_c) + 1;
204
-
incr in_window
205
-
end;
206
-
207
-
(* Calculate cost for current byte *)
208
-
let c = Char.code (Bytes.get src (src_pos + i)) in
209
-
let histo = max 1 histogram.(c) in
210
-
let lit_cost = fast_log2 !in_window -. fast_log2 histo +. 0.029 in
211
-
let lit_cost = if lit_cost < 1.0 then lit_cost *. 0.5 +. 0.5 else lit_cost in
212
-
let prologue_length = 2000 in
213
-
let lit_cost =
214
-
if i < prologue_length then
215
-
lit_cost +. 0.35 +. 0.35 /. float_of_int prologue_length *. float_of_int i
216
-
else lit_cost
217
-
in
218
-
costs.(i + 1) <- costs.(i) +. lit_cost
219
-
done;
220
-
costs
221
-
end
222
-
end
223
-
224
-
(* Initialize cost model from literal costs (first pass) *)
225
-
let init_cost_model_from_literals src src_pos num_bytes =
226
-
(* Use sliding window for accurate per-position literal cost estimation *)
227
-
let literal_costs = estimate_literal_costs_sliding_window src src_pos num_bytes in
228
-
229
-
(* Command costs: FastLog2(11 + cmd_code) *)
230
-
let cost_cmd = Array.init 704 (fun i -> fast_log2 (11 + i)) in
231
-
let min_cost_cmd = fast_log2 11 in
232
-
233
-
(* Distance costs: FastLog2(20 + dist_code) *)
234
-
let cost_dist = Array.init 544 (fun i -> fast_log2 (20 + i)) in
235
-
236
-
{ cost_cmd; cost_dist; literal_costs; min_cost_cmd; num_bytes }
237
-
238
-
(* Initialize cost model from command histograms (second pass for Q11) *)
239
-
let init_cost_model_from_histograms src src_pos num_bytes
240
-
~lit_histogram ~cmd_histogram ~dist_histogram =
241
-
(* Literal costs from histogram *)
242
-
let lit_costs = set_cost lit_histogram 256 true in
243
-
let literal_costs = Array.make (num_bytes + 2) 0.0 in
244
-
literal_costs.(0) <- 0.0;
245
-
for i = 0 to num_bytes - 1 do
246
-
let c = Char.code (Bytes.get src (src_pos + i)) in
247
-
literal_costs.(i + 1) <- literal_costs.(i) +. lit_costs.(c)
248
-
done;
249
-
250
-
(* Command costs from histogram *)
251
-
let cost_cmd = set_cost cmd_histogram 704 false in
252
-
let min_cost_cmd = Array.fold_left min infinity cost_cmd in
253
-
254
-
(* Distance costs from histogram *)
255
-
let cost_dist = set_cost dist_histogram 544 false in
256
-
257
-
{ cost_cmd; cost_dist; literal_costs; min_cost_cmd; num_bytes }
258
-
259
-
let get_literal_cost model from_pos to_pos =
260
-
model.literal_costs.(to_pos) -. model.literal_costs.(from_pos)
261
-
262
-
let get_command_cost model cmd_code =
263
-
if cmd_code < 704 then model.cost_cmd.(cmd_code) else 20.0
264
-
265
-
let get_distance_cost model dist_code =
266
-
if dist_code < 544 then model.cost_dist.(dist_code) else 20.0
267
-
268
-
(* ============================================================
269
-
StartPosQueue - maintains 8 best starting positions
270
-
============================================================ *)
271
-
272
-
type pos_data = {
273
-
pos : int;
274
-
distance_cache : int array;
275
-
costdiff : float;
276
-
cost : float;
277
-
}
278
-
279
-
type start_pos_queue = {
280
-
mutable q : pos_data array;
281
-
mutable idx : int;
282
-
}
283
-
284
-
let create_start_pos_queue () =
285
-
let empty = { pos = 0; distance_cache = [|16;15;11;4|]; costdiff = infinity; cost = infinity } in
286
-
{ q = Array.make 8 empty; idx = 0 }
287
-
288
-
let start_pos_queue_size queue =
289
-
min queue.idx 8
290
-
291
-
let start_pos_queue_push queue posdata =
292
-
let offset = (lnot queue.idx) land 7 in
293
-
queue.idx <- queue.idx + 1;
294
-
let len = start_pos_queue_size queue in
295
-
queue.q.(offset) <- posdata;
296
-
(* Restore sorted order by costdiff *)
297
-
let q = queue.q in
298
-
for i = 1 to len - 1 do
299
-
let idx1 = (offset + i - 1) land 7 in
300
-
let idx2 = (offset + i) land 7 in
301
-
if q.(idx1).costdiff > q.(idx2).costdiff then begin
302
-
let tmp = q.(idx1) in
303
-
q.(idx1) <- q.(idx2);
304
-
q.(idx2) <- tmp
305
-
end
306
-
done
307
-
308
-
let start_pos_queue_at queue k =
309
-
queue.q.((k - queue.idx) land 7)
310
-
311
-
(* ============================================================
312
-
Zopfli Node - DP state at each position
313
-
============================================================ *)
314
-
315
-
type zopfli_node = {
316
-
mutable length : int; (* Copy length (lower 25 bits) + len_code modifier *)
317
-
mutable distance : int; (* Copy distance *)
318
-
mutable dcode_insert_length : int; (* Short code (upper 5 bits) + insert length *)
319
-
mutable cost : float; (* Cost or next pointer *)
320
-
mutable shortcut : int; (* Shortcut for distance cache computation *)
321
-
}
322
-
323
-
let create_zopfli_node () =
324
-
{ length = 1; distance = 0; dcode_insert_length = 0; cost = infinity; shortcut = 0 }
325
-
326
-
let zopfli_node_copy_length node = node.length land 0x1FFFFFF
327
-
let zopfli_node_copy_distance node = node.distance
328
-
let zopfli_node_insert_length node = node.dcode_insert_length land 0x7FFFFFF
329
-
let zopfli_node_distance_code node =
330
-
let short_code = node.dcode_insert_length lsr 27 in
331
-
if short_code = 0 then zopfli_node_copy_distance node + 16 - 1
332
-
else short_code - 1
333
-
334
-
let zopfli_node_command_length node =
335
-
zopfli_node_copy_length node + zopfli_node_insert_length node
336
-
337
-
(* ============================================================
338
-
Hash functions and match finding
339
-
============================================================ *)
340
-
341
-
let[@inline always] hash4 src pos =
342
-
let b0 = Char.code (Bytes.unsafe_get src pos) in
343
-
let b1 = Char.code (Bytes.unsafe_get src (pos + 1)) in
344
-
let b2 = Char.code (Bytes.unsafe_get src (pos + 2)) in
345
-
let b3 = Char.code (Bytes.unsafe_get src (pos + 3)) in
346
-
let v = b0 lor (b1 lsl 8) lor (b2 lsl 16) lor (b3 lsl 24) in
347
-
((v * 0x1e35a7bd) land 0xFFFFFFFF) lsr (32 - hash_bits)
348
-
349
-
let[@inline always] find_match_length src a b limit =
350
-
let len = ref 0 in
351
-
let max_len = min max_match (limit - b) in
352
-
while !len < max_len && Bytes.get src (a + !len) = Bytes.get src (b + !len) do
353
-
incr len
354
-
done;
355
-
!len
356
-
357
-
(* Backward match structure *)
358
-
type backward_match = {
359
-
bm_distance : int;
360
-
bm_length : int;
361
-
bm_len_code : int;
362
-
}
363
-
364
-
(* Find all matches at a position, sorted by length *)
365
-
let find_all_matches src pos src_end hash_table chain_table chain_base max_distance =
366
-
if pos + min_match > src_end then []
367
-
else begin
368
-
let matches = ref [] in
369
-
let best_len = ref (min_match - 1) in
370
-
371
-
(* Search hash chain *)
372
-
let h = hash4 src pos in
373
-
let chain_pos = ref hash_table.(h) in
374
-
let chain_count = ref 0 in
375
-
376
-
while !chain_pos >= 0 && !chain_count < max_tree_search_depth do
377
-
let distance = pos - !chain_pos in
378
-
if distance > 0 && distance <= max_distance then begin
379
-
let match_len = find_match_length src !chain_pos pos src_end in
380
-
if match_len > !best_len then begin
381
-
best_len := match_len;
382
-
matches := { bm_distance = distance; bm_length = match_len; bm_len_code = match_len } :: !matches
383
-
end
384
-
end;
385
-
let chain_idx = !chain_pos - chain_base in
386
-
if chain_idx >= 0 && chain_idx < Array.length chain_table then
387
-
chain_pos := chain_table.(chain_idx)
388
-
else
389
-
chain_pos := -1;
390
-
incr chain_count
391
-
done;
392
-
393
-
(* Sort by length ascending *)
394
-
List.sort (fun a b -> compare a.bm_length b.bm_length) !matches
395
-
end
396
-
397
-
(* ============================================================
398
-
Insert/Copy length encoding (from brotli-c prefix.h)
399
-
============================================================ *)
400
-
401
-
let get_insert_length_code insert_len =
402
-
if insert_len < 6 then insert_len
403
-
else if insert_len < 130 then
404
-
let nbits = Lz77.log2_floor_nonzero (insert_len - 2) - 1 in
405
-
(nbits lsl 1) + ((insert_len - 2) lsr nbits) + 2
406
-
else if insert_len < 2114 then
407
-
Lz77.log2_floor_nonzero (insert_len - 66) + 10
408
-
else if insert_len < 6210 then 21
409
-
else if insert_len < 22594 then 22
410
-
else 23
411
-
412
-
let get_copy_length_code copy_len =
413
-
if copy_len < 10 then copy_len - 2
414
-
else if copy_len < 134 then
415
-
let nbits = Lz77.log2_floor_nonzero (copy_len - 6) - 1 in
416
-
(nbits lsl 1) + ((copy_len - 6) lsr nbits) + 4
417
-
else if copy_len < 2118 then
418
-
Lz77.log2_floor_nonzero (copy_len - 70) + 12
419
-
else 23
420
-
421
-
let get_insert_extra insert_code =
422
-
let kInsertExtraBits = [| 0;0;0;0;0;0;1;1;2;2;3;3;4;4;5;5;6;7;8;9;10;12;14;24 |] in
423
-
if insert_code < 24 then kInsertExtraBits.(insert_code) else 24
424
-
425
-
let get_copy_extra copy_code =
426
-
let kCopyExtraBits = [| 0;0;0;0;0;0;0;0;1;1;2;2;3;3;4;4;5;5;6;7;8;9;10;24 |] in
427
-
if copy_code < 24 then kCopyExtraBits.(copy_code) else 24
428
-
429
-
let combine_length_codes inscode copycode use_last_distance =
430
-
let inscode64 = (inscode land 0x7) lor ((inscode land 0x18) lsl 2) in
431
-
let copycode64 = (copycode land 0x7) lor ((copycode land 0x18) lsl 3) in
432
-
let c = (copycode64 land 0x38) lor inscode64 in
433
-
if use_last_distance && inscode < 8 && copycode < 16 then c
434
-
else if inscode < 8 && copycode < 16 then c lor 64
435
-
else c lor (128 + (if copycode >= 16 then 64 else 0))
436
-
437
-
(* ============================================================
438
-
Distance encoding
439
-
============================================================ *)
440
-
441
-
let prefix_encode_copy_distance dist_code =
442
-
if dist_code < 16 then (dist_code, 0, 0)
443
-
else begin
444
-
let dist = dist_code - 15 in
445
-
let nbits = Lz77.log2_floor_nonzero dist in
446
-
let prefix = (nbits lsl 1) + ((dist lsr (nbits - 1)) land 1) + 12 in
447
-
let extra_bits = nbits - 1 in
448
-
let extra = dist land ((1 lsl extra_bits) - 1) in
449
-
(prefix, extra_bits, extra)
450
-
end
451
-
452
-
(* ============================================================
453
-
Main Zopfli DP Algorithm
454
-
============================================================ *)
455
-
456
-
(* Compute distance cache at a position from the DP path *)
457
-
let compute_distance_cache pos starting_dist_cache nodes =
458
-
let dist_cache = Array.make 4 0 in
459
-
let idx = ref 0 in
460
-
let p = ref nodes.(pos).shortcut in
461
-
while !idx < 4 && !p > 0 do
462
-
let node = nodes.(!p) in
463
-
let c_len = zopfli_node_copy_length node in
464
-
let i_len = zopfli_node_insert_length node in
465
-
let dist = zopfli_node_copy_distance node in
466
-
dist_cache.(!idx) <- dist;
467
-
incr idx;
468
-
p := nodes.(!p - c_len - i_len).shortcut
469
-
done;
470
-
for i = !idx to 3 do
471
-
dist_cache.(i) <- starting_dist_cache.(i - !idx)
472
-
done;
473
-
dist_cache
474
-
475
-
(* Compute distance shortcut *)
476
-
let compute_distance_shortcut block_start pos max_backward_limit nodes =
477
-
if pos = 0 then 0
478
-
else begin
479
-
let node = nodes.(pos) in
480
-
let c_len = zopfli_node_copy_length node in
481
-
let i_len = zopfli_node_insert_length node in
482
-
let dist = zopfli_node_copy_distance node in
483
-
if dist + c_len <= block_start + pos &&
484
-
dist <= max_backward_limit &&
485
-
zopfli_node_distance_code node > 0 then
486
-
pos
487
-
else
488
-
nodes.(pos - c_len - i_len).shortcut
489
-
end
490
-
491
-
(* Update Zopfli node with new values *)
492
-
let update_zopfli_node nodes pos start len len_code dist short_code cost =
493
-
let node = nodes.(pos + len) in
494
-
node.length <- len lor ((len + 9 - len_code) lsl 25);
495
-
node.distance <- dist;
496
-
node.dcode_insert_length <- (short_code lsl 27) lor (pos - start);
497
-
node.cost <- cost
498
-
499
-
(* Compute minimum copy length that can improve cost *)
500
-
let compute_minimum_copy_length start_cost nodes num_bytes pos =
501
-
let min_cost = ref start_cost in
502
-
let len = ref 2 in
503
-
let next_len_bucket = ref 4 in
504
-
let next_len_offset = ref 10 in
505
-
while pos + !len <= num_bytes && nodes.(pos + !len).cost <= !min_cost do
506
-
incr len;
507
-
if !len = !next_len_offset then begin
508
-
min_cost := !min_cost +. 1.0;
509
-
next_len_offset := !next_len_offset + !next_len_bucket;
510
-
next_len_bucket := !next_len_bucket * 2
511
-
end
512
-
done;
513
-
!len
514
-
515
-
(* Evaluate node and push to queue if eligible *)
516
-
let evaluate_node block_start pos max_backward_limit starting_dist_cache model queue nodes =
517
-
let node_cost = nodes.(pos).cost in
518
-
nodes.(pos).shortcut <- compute_distance_shortcut block_start pos max_backward_limit nodes;
519
-
if node_cost <= get_literal_cost model 0 pos then begin
520
-
let dist_cache = compute_distance_cache pos starting_dist_cache nodes in
521
-
let posdata = {
522
-
pos;
523
-
distance_cache = dist_cache;
524
-
costdiff = node_cost -. get_literal_cost model 0 pos;
525
-
cost = node_cost;
526
-
} in
527
-
start_pos_queue_push queue posdata
528
-
end
529
-
530
-
(* Update nodes at a position - core Zopfli DP step *)
531
-
let update_nodes num_bytes block_start pos src src_pos model
532
-
max_backward_limit starting_dist_cache
533
-
num_matches matches queue nodes max_zopfli_len max_iters =
534
-
let cur_ix = block_start + pos in
535
-
let max_distance_here = min cur_ix max_backward_limit in
536
-
let max_len = num_bytes - pos in
537
-
let result = ref 0 in
538
-
539
-
evaluate_node block_start pos max_backward_limit starting_dist_cache model queue nodes;
540
-
541
-
(* Compute minimum copy length based on best queue entry *)
542
-
let posdata0 = start_pos_queue_at queue 0 in
543
-
let min_cost = posdata0.cost +. model.min_cost_cmd +. get_literal_cost model posdata0.pos pos in
544
-
let min_len = compute_minimum_copy_length min_cost nodes num_bytes pos in
545
-
546
-
(* Go over starting positions in order of increasing cost difference *)
547
-
let queue_size = start_pos_queue_size queue in
548
-
for k = 0 to min (max_iters - 1) (queue_size - 1) do
549
-
let posdata = start_pos_queue_at queue k in
550
-
let start = posdata.pos in
551
-
let inscode = get_insert_length_code (pos - start) in
552
-
let start_costdiff = posdata.costdiff in
553
-
let base_cost = start_costdiff +. float_of_int (get_insert_extra inscode) +.
554
-
get_literal_cost model 0 pos in
555
-
556
-
(* Check distance cache matches first *)
557
-
let best_len = ref (min_len - 1) in
558
-
for j = 0 to 15 do
559
-
if !best_len < max_len then begin
560
-
let idx = distance_cache_index.(j) in
561
-
let backward = posdata.distance_cache.(idx) + distance_cache_offset.(j) in
562
-
if backward > 0 && backward <= max_distance_here then begin
563
-
let prev_ix = cur_ix - backward in
564
-
let match_len = find_match_length src prev_ix (src_pos + pos) (src_pos + num_bytes) in
565
-
if match_len >= 2 then begin
566
-
let dist_cost = base_cost +. get_distance_cost model j in
567
-
for l = !best_len + 1 to match_len do
568
-
let copycode = get_copy_length_code l in
569
-
let cmdcode = combine_length_codes inscode copycode (j = 0) in
570
-
let cost = (if cmdcode < 128 then base_cost else dist_cost) +.
571
-
float_of_int (get_copy_extra copycode) +.
572
-
get_command_cost model cmdcode in
573
-
if cost < nodes.(pos + l).cost then begin
574
-
update_zopfli_node nodes pos start l l backward (j + 1) cost;
575
-
result := max !result l
576
-
end;
577
-
best_len := l
578
-
done
579
-
end
580
-
end
581
-
end
582
-
done;
583
-
584
-
(* For iterations >= 2, only look at distance cache matches *)
585
-
if k < 2 then begin
586
-
(* Loop through all matches *)
587
-
let len = ref min_len in
588
-
for j = 0 to num_matches - 1 do
589
-
let m = matches.(j) in
590
-
let dist = m.bm_distance in
591
-
let dist_code = dist + 16 - 1 in (* Add 16 short codes *)
592
-
let (dist_symbol, distnumextra, _) = prefix_encode_copy_distance dist_code in
593
-
let dist_cost = base_cost +. float_of_int distnumextra +.
594
-
get_distance_cost model dist_symbol in
595
-
let max_match_len = m.bm_length in
596
-
597
-
(* For long matches or dictionary, try only max length *)
598
-
if !len < max_match_len && max_match_len > max_zopfli_len then
599
-
len := max_match_len;
600
-
601
-
while !len <= max_match_len do
602
-
let len_code = m.bm_len_code in
603
-
let copycode = get_copy_length_code len_code in
604
-
let cmdcode = combine_length_codes inscode copycode false in
605
-
let cost = dist_cost +. float_of_int (get_copy_extra copycode) +.
606
-
get_command_cost model cmdcode in
607
-
if cost < nodes.(pos + !len).cost then begin
608
-
update_zopfli_node nodes pos start !len len_code dist 0 cost;
609
-
result := max !result !len
610
-
end;
611
-
incr len
612
-
done
613
-
done
614
-
end
615
-
done;
616
-
!result
617
-
618
-
(* Compute shortest path from nodes *)
619
-
let compute_shortest_path_from_nodes num_bytes nodes =
620
-
let index = ref num_bytes in
621
-
let num_commands = ref 0 in
622
-
(* Find the actual end position *)
623
-
while zopfli_node_insert_length nodes.(!index) = 0 &&
624
-
nodes.(!index).length = 1 && !index > 0 do
625
-
decr index
626
-
done;
627
-
nodes.(!index).shortcut <- max_int; (* Mark as end *)
628
-
while !index > 0 do
629
-
let len = zopfli_node_command_length nodes.(!index) in
630
-
index := !index - len;
631
-
nodes.(!index).shortcut <- len; (* Use shortcut to store next length *)
632
-
incr num_commands
633
-
done;
634
-
!num_commands
635
-
636
-
(* ============================================================
637
-
Main Zopfli function for Q10
638
-
============================================================ *)
639
-
640
-
let zopfli_compute_shortest_path src src_pos num_bytes starting_dist_cache =
641
-
let max_backward_limit = max_distance in
642
-
let max_zopfli_len = max_zopfli_len_quality_10 in
643
-
let max_iters = max_zopfli_candidates_q10 in
644
-
645
-
(* Initialize nodes *)
646
-
let nodes = Array.init (num_bytes + 1) (fun _ -> create_zopfli_node ()) in
647
-
nodes.(0).length <- 0;
648
-
nodes.(0).cost <- 0.0;
649
-
650
-
(* Initialize cost model from literal costs (first pass) *)
651
-
let model = init_cost_model_from_literals src src_pos num_bytes in
652
-
653
-
(* Hash table and chain *)
654
-
let hash_table = Array.make hash_size (-1) in
655
-
let chain_table = Array.make num_bytes (-1) in
656
-
let chain_base = src_pos in
657
-
658
-
(* Initialize queue *)
659
-
let queue = create_start_pos_queue () in
660
-
661
-
(* Main DP loop *)
662
-
let i = ref 0 in
663
-
while !i + min_match - 1 < num_bytes do
664
-
let pos = src_pos + !i in
665
-
let max_distance_here = min pos max_backward_limit in
666
-
667
-
(* Update hash table *)
668
-
if pos + min_match <= src_pos + num_bytes then begin
669
-
let h = hash4 src pos in
670
-
let chain_idx = !i in
671
-
if chain_idx < Array.length chain_table then
672
-
chain_table.(chain_idx) <- hash_table.(h);
673
-
hash_table.(h) <- pos
674
-
end;
675
-
676
-
(* Find all matches *)
677
-
let matches = find_all_matches src pos (src_pos + num_bytes)
678
-
hash_table chain_table chain_base max_distance_here in
679
-
let matches_arr = Array.of_list matches in
680
-
let num_matches = Array.length matches_arr in
681
-
682
-
(* Check for long match to skip *)
683
-
let skip =
684
-
if num_matches > 0 then begin
685
-
let last_match = matches_arr.(num_matches - 1) in
686
-
if last_match.bm_length > max_zopfli_len then begin
687
-
(* Use only longest match *)
688
-
matches_arr.(0) <- last_match;
689
-
last_match.bm_length
690
-
end else 0
691
-
end else 0
692
-
in
693
-
694
-
let update_skip = update_nodes num_bytes src_pos !i src src_pos model
695
-
max_backward_limit starting_dist_cache
696
-
(if skip > 0 then 1 else num_matches) matches_arr queue nodes
697
-
max_zopfli_len max_iters in
698
-
699
-
let actual_skip = if update_skip < brotli_long_copy_quick_step then 0 else update_skip in
700
-
let skip = max skip actual_skip in
701
-
702
-
if skip > 1 then begin
703
-
let skip_remaining = ref (skip - 1) in
704
-
while !skip_remaining > 0 && !i + min_match - 1 < num_bytes do
705
-
incr i;
706
-
evaluate_node src_pos !i max_backward_limit starting_dist_cache model queue nodes;
707
-
decr skip_remaining
708
-
done
709
-
end;
710
-
incr i
711
-
done;
712
-
713
-
(nodes, compute_shortest_path_from_nodes num_bytes nodes)
714
-
715
-
(* ============================================================
716
-
HQ Zopfli function for Q11 (two passes with histogram refinement)
717
-
============================================================ *)
718
-
719
-
(* Build histograms from completed DP nodes for second pass cost refinement.
720
-
This matches brotli-c ZopfliCostModelSetFromCommands in backward_references_hq.c *)
721
-
let build_histograms_from_nodes src src_pos num_bytes nodes =
722
-
let lit_histogram = Array.make 256 0 in
723
-
let cmd_histogram = Array.make 704 0 in
724
-
let dist_histogram = Array.make 544 0 in
725
-
726
-
(* Reconstruct path from nodes *)
727
-
let idx = ref num_bytes in
728
-
(* Find the actual end position *)
729
-
while zopfli_node_insert_length nodes.(!idx) = 0 &&
730
-
nodes.(!idx).length = 1 && !idx > 0 do
731
-
decr idx
732
-
done;
733
-
734
-
let pending_lit_start = ref 0 in
735
-
let end_pos = !idx in
736
-
737
-
(* Walk backwards through the path *)
738
-
idx := end_pos;
739
-
let path = ref [] in
740
-
while !idx > 0 do
741
-
let node = nodes.(!idx) in
742
-
let cmd_len = zopfli_node_command_length node in
743
-
if cmd_len > 0 then begin
744
-
path := !idx :: !path;
745
-
idx := !idx - cmd_len
746
-
end else
747
-
idx := 0
748
-
done;
749
-
750
-
(* Process path forward to count symbols *)
751
-
pending_lit_start := 0;
752
-
List.iter (fun end_pos ->
753
-
let node = nodes.(end_pos) in
754
-
let copy_len = zopfli_node_copy_length node in
755
-
let _insert_len = zopfli_node_insert_length node in
756
-
let dist_code = zopfli_node_distance_code node in
757
-
758
-
let copy_start = end_pos - copy_len in
759
-
let lit_len = copy_start - !pending_lit_start in
760
-
761
-
(* Count literals *)
762
-
for i = !pending_lit_start to copy_start - 1 do
763
-
let c = Char.code (Bytes.get src (src_pos + i)) in
764
-
lit_histogram.(c) <- lit_histogram.(c) + 1
765
-
done;
766
-
767
-
(* Count command code *)
768
-
let inscode = get_insert_length_code lit_len in
769
-
let copycode = get_copy_length_code copy_len in
770
-
let use_last = dist_code = 0 in
771
-
let cmdcode = combine_length_codes inscode copycode use_last in
772
-
if cmdcode < 704 then
773
-
cmd_histogram.(cmdcode) <- cmd_histogram.(cmdcode) + 1;
774
-
775
-
(* Count distance code if explicit *)
776
-
if cmdcode >= 128 then begin
777
-
let dc = if dist_code < 16 then dist_code
778
-
else begin
779
-
let (symbol, _, _) = prefix_encode_copy_distance (node.distance + 16 - 1) in
780
-
symbol
781
-
end
782
-
in
783
-
if dc < 544 then
784
-
dist_histogram.(dc) <- dist_histogram.(dc) + 1
785
-
end;
786
-
787
-
pending_lit_start := end_pos
788
-
) !path;
789
-
790
-
(* Count remaining literals *)
791
-
for i = !pending_lit_start to num_bytes - 1 do
792
-
let c = Char.code (Bytes.get src (src_pos + i)) in
793
-
lit_histogram.(c) <- lit_histogram.(c) + 1
794
-
done;
795
-
796
-
(lit_histogram, cmd_histogram, dist_histogram)
797
-
798
-
let hq_zopfli_compute_shortest_path src src_pos num_bytes starting_dist_cache =
799
-
let max_backward_limit = max_distance in
800
-
let max_zopfli_len = max_zopfli_len_quality_11 in
801
-
let max_iters = max_zopfli_candidates_q11 in
802
-
803
-
(* Pre-compute all matches *)
804
-
let hash_table = Array.make hash_size (-1) in
805
-
let chain_table = Array.make num_bytes (-1) in
806
-
let chain_base = src_pos in
807
-
let all_matches = Array.make num_bytes [||] in
808
-
let num_matches_arr = Array.make num_bytes 0 in
809
-
810
-
for i = 0 to num_bytes - min_match do
811
-
let pos = src_pos + i in
812
-
let max_distance_here = min pos max_backward_limit in
813
-
814
-
(* Update hash *)
815
-
if pos + min_match <= src_pos + num_bytes then begin
816
-
let h = hash4 src pos in
817
-
chain_table.(i) <- hash_table.(h);
818
-
hash_table.(h) <- pos
819
-
end;
820
-
821
-
let matches = find_all_matches src pos (src_pos + num_bytes)
822
-
hash_table chain_table chain_base max_distance_here in
823
-
let matches_arr = Array.of_list matches in
824
-
all_matches.(i) <- matches_arr;
825
-
num_matches_arr.(i) <- Array.length matches_arr;
826
-
827
-
(* Skip after very long match *)
828
-
if Array.length matches_arr > 0 then begin
829
-
let last = matches_arr.(Array.length matches_arr - 1) in
830
-
if last.bm_length > max_zopfli_len then begin
831
-
let skip = last.bm_length - 1 in
832
-
for j = 1 to min skip (num_bytes - min_match - i) do
833
-
all_matches.(i + j) <- [||];
834
-
num_matches_arr.(i + j) <- 0
835
-
done
836
-
end
837
-
end
838
-
done;
839
-
840
-
(* Do two iterations with histogram refinement *)
841
-
let final_nodes = ref (Array.init (num_bytes + 1) (fun _ -> create_zopfli_node ())) in
842
-
let final_count = ref 0 in
843
-
let first_pass_nodes = ref None in
844
-
845
-
for iteration = 0 to 1 do
846
-
let nodes = Array.init (num_bytes + 1) (fun _ -> create_zopfli_node ()) in
847
-
nodes.(0).length <- 0;
848
-
nodes.(0).cost <- 0.0;
849
-
850
-
let model =
851
-
if iteration = 0 then
852
-
(* First pass: use sliding window literal cost estimation *)
853
-
init_cost_model_from_literals src src_pos num_bytes
854
-
else begin
855
-
(* Second pass: build histograms from first pass for refined estimation *)
856
-
match !first_pass_nodes with
857
-
| None -> init_cost_model_from_literals src src_pos num_bytes
858
-
| Some prev_nodes ->
859
-
let (lit_hist, cmd_hist, dist_hist) =
860
-
build_histograms_from_nodes src src_pos num_bytes prev_nodes
861
-
in
862
-
init_cost_model_from_histograms src src_pos num_bytes
863
-
~lit_histogram:lit_hist ~cmd_histogram:cmd_hist ~dist_histogram:dist_hist
864
-
end
865
-
in
866
-
867
-
let queue = create_start_pos_queue () in
868
-
869
-
(* Main DP loop *)
870
-
let i = ref 0 in
871
-
while !i + min_match - 1 < num_bytes do
872
-
let skip = update_nodes num_bytes src_pos !i src src_pos model
873
-
max_backward_limit starting_dist_cache
874
-
num_matches_arr.(!i) all_matches.(!i) queue nodes
875
-
max_zopfli_len max_iters in
876
-
877
-
let skip = if skip < brotli_long_copy_quick_step then 0 else skip in
878
-
879
-
if skip > 1 then begin
880
-
let skip_remaining = ref (skip - 1) in
881
-
while !skip_remaining > 0 && !i + min_match - 1 < num_bytes do
882
-
incr i;
883
-
evaluate_node src_pos !i max_backward_limit starting_dist_cache model queue nodes;
884
-
decr skip_remaining
885
-
done
886
-
end;
887
-
incr i
888
-
done;
889
-
890
-
(* Save first pass nodes for histogram building *)
891
-
if iteration = 0 then begin
892
-
let _ = compute_shortest_path_from_nodes num_bytes nodes in
893
-
first_pass_nodes := Some nodes
894
-
end;
895
-
896
-
final_nodes := nodes;
897
-
final_count := compute_shortest_path_from_nodes num_bytes nodes
898
-
done;
899
-
900
-
(!final_nodes, !final_count)
901
-
902
-
(* ============================================================
903
-
Create commands from Zopfli nodes
904
-
============================================================ *)
905
-
906
-
let zopfli_create_commands num_bytes src_pos nodes =
907
-
let commands = ref [] in
908
-
let ring = Lz77.create_dist_ring () in
909
-
910
-
(* First, reconstruct the path using shortcut field *)
911
-
let path = ref [] in
912
-
let idx = ref num_bytes in
913
-
while !idx > 0 && nodes.(!idx).shortcut <> max_int do
914
-
path := !idx :: !path;
915
-
let len = nodes.(!idx).shortcut in
916
-
if len > 0 && len <= !idx then
917
-
idx := !idx - len
918
-
else
919
-
idx := 0
920
-
done;
921
-
922
-
(* Now process each command in the path *)
923
-
let pending_lit_start = ref 0 in
924
-
List.iter (fun end_pos ->
925
-
let node = nodes.(end_pos) in
926
-
let copy_len = zopfli_node_copy_length node in
927
-
let _insert_len = zopfli_node_insert_length node in
928
-
let distance = zopfli_node_copy_distance node in
929
-
let dist_code = zopfli_node_distance_code node in
930
-
931
-
let copy_start = end_pos - copy_len in
932
-
let lit_len = copy_start - !pending_lit_start in
933
-
934
-
(* Determine short code *)
935
-
let short_code =
936
-
if dist_code < 16 then Some dist_code
937
-
else None
938
-
in
939
-
940
-
commands := Lz77.InsertCopy {
941
-
lit_start = src_pos + !pending_lit_start;
942
-
lit_len;
943
-
copy_len;
944
-
distance;
945
-
dist_code = short_code;
946
-
} :: !commands;
947
-
948
-
(* Update ring buffer *)
949
-
(match short_code with
950
-
| Some 0 -> ()
951
-
| _ -> Lz77.push_distance ring distance);
952
-
953
-
pending_lit_start := end_pos
954
-
) !path;
955
-
956
-
(* Handle remaining literals *)
957
-
if !pending_lit_start < num_bytes then
958
-
commands := Lz77.Literals {
959
-
start = src_pos + !pending_lit_start;
960
-
len = num_bytes - !pending_lit_start
961
-
} :: !commands;
962
-
963
-
List.rev !commands
964
-
965
-
(* ============================================================
966
-
Public API
967
-
============================================================ *)
968
-
969
-
let generate_commands ?(quality=11) src src_pos src_len =
970
-
if src_len = 0 then []
971
-
else if src_len < min_match then
972
-
[Lz77.Literals { start = src_pos; len = src_len }]
973
-
else begin
974
-
let starting_dist_cache = [| 16; 15; 11; 4 |] in
975
-
976
-
let (nodes, _num_commands) =
977
-
if quality >= 11 then
978
-
hq_zopfli_compute_shortest_path src src_pos src_len starting_dist_cache
979
-
else
980
-
zopfli_compute_shortest_path src src_pos src_len starting_dist_cache
981
-
in
982
-
983
-
zopfli_create_commands src_len src_pos nodes
984
-
end
-96
ocaml-brotli/src/prefix.ml
-96
ocaml-brotli/src/prefix.ml
···
1
-
(* Prefix code tables for Brotli variable-length values *)
2
-
3
-
(* A prefix code range: [offset, offset + 2^nbits) *)
4
-
type prefix = {
5
-
offset : int;
6
-
nbits : int;
7
-
}
8
-
9
-
(* Lookup tables for command code -> insert/copy code indices *)
10
-
let insert_range_lut = [| 0; 0; 8; 8; 0; 16; 8; 16; 16 |]
11
-
let copy_range_lut = [| 0; 8; 0; 8; 16; 0; 16; 8; 16 |]
12
-
13
-
(* Block length prefix codes (26 entries) *)
14
-
let block_length_prefix = [|
15
-
{ offset = 1; nbits = 2 }; { offset = 5; nbits = 2 };
16
-
{ offset = 9; nbits = 2 }; { offset = 13; nbits = 2 };
17
-
{ offset = 17; nbits = 3 }; { offset = 25; nbits = 3 };
18
-
{ offset = 33; nbits = 3 }; { offset = 41; nbits = 3 };
19
-
{ offset = 49; nbits = 4 }; { offset = 65; nbits = 4 };
20
-
{ offset = 81; nbits = 4 }; { offset = 97; nbits = 4 };
21
-
{ offset = 113; nbits = 5 }; { offset = 145; nbits = 5 };
22
-
{ offset = 177; nbits = 5 }; { offset = 209; nbits = 5 };
23
-
{ offset = 241; nbits = 6 }; { offset = 305; nbits = 6 };
24
-
{ offset = 369; nbits = 7 }; { offset = 497; nbits = 8 };
25
-
{ offset = 753; nbits = 9 }; { offset = 1265; nbits = 10 };
26
-
{ offset = 2289; nbits = 11 }; { offset = 4337; nbits = 12 };
27
-
{ offset = 8433; nbits = 13 }; { offset = 16625; nbits = 24 };
28
-
|]
29
-
30
-
(* Insert length prefix codes (24 entries) *)
31
-
let insert_length_prefix = [|
32
-
{ offset = 0; nbits = 0 }; { offset = 1; nbits = 0 };
33
-
{ offset = 2; nbits = 0 }; { offset = 3; nbits = 0 };
34
-
{ offset = 4; nbits = 0 }; { offset = 5; nbits = 0 };
35
-
{ offset = 6; nbits = 1 }; { offset = 8; nbits = 1 };
36
-
{ offset = 10; nbits = 2 }; { offset = 14; nbits = 2 };
37
-
{ offset = 18; nbits = 3 }; { offset = 26; nbits = 3 };
38
-
{ offset = 34; nbits = 4 }; { offset = 50; nbits = 4 };
39
-
{ offset = 66; nbits = 5 }; { offset = 98; nbits = 5 };
40
-
{ offset = 130; nbits = 6 }; { offset = 194; nbits = 7 };
41
-
{ offset = 322; nbits = 8 }; { offset = 578; nbits = 9 };
42
-
{ offset = 1090; nbits = 10 }; { offset = 2114; nbits = 12 };
43
-
{ offset = 6210; nbits = 14 }; { offset = 22594; nbits = 24 };
44
-
|]
45
-
46
-
(* Copy length prefix codes (24 entries) *)
47
-
let copy_length_prefix = [|
48
-
{ offset = 2; nbits = 0 }; { offset = 3; nbits = 0 };
49
-
{ offset = 4; nbits = 0 }; { offset = 5; nbits = 0 };
50
-
{ offset = 6; nbits = 0 }; { offset = 7; nbits = 0 };
51
-
{ offset = 8; nbits = 0 }; { offset = 9; nbits = 0 };
52
-
{ offset = 10; nbits = 1 }; { offset = 12; nbits = 1 };
53
-
{ offset = 14; nbits = 2 }; { offset = 18; nbits = 2 };
54
-
{ offset = 22; nbits = 3 }; { offset = 30; nbits = 3 };
55
-
{ offset = 38; nbits = 4 }; { offset = 54; nbits = 4 };
56
-
{ offset = 70; nbits = 5 }; { offset = 102; nbits = 5 };
57
-
{ offset = 134; nbits = 6 }; { offset = 198; nbits = 7 };
58
-
{ offset = 326; nbits = 8 }; { offset = 582; nbits = 9 };
59
-
{ offset = 1094; nbits = 10 }; { offset = 2118; nbits = 24 };
60
-
|]
61
-
62
-
(* Decode a block length from prefix code *)
63
-
let[@inline] decode_block_length br code =
64
-
let p = block_length_prefix.(code) in
65
-
if p.nbits = 0 then p.offset
66
-
else p.offset + Bit_reader.read_bits br p.nbits
67
-
68
-
(* Decode insert length from prefix code *)
69
-
let[@inline] decode_insert_length br code =
70
-
let p = insert_length_prefix.(code) in
71
-
if p.nbits = 0 then p.offset
72
-
else p.offset + Bit_reader.read_bits br p.nbits
73
-
74
-
(* Decode copy length from prefix code *)
75
-
let[@inline] decode_copy_length br code =
76
-
let p = copy_length_prefix.(code) in
77
-
if p.nbits = 0 then p.offset
78
-
else p.offset + Bit_reader.read_bits br p.nbits
79
-
80
-
(* Get insert and copy length codes from command code *)
81
-
let[@inline] get_insert_length_code cmd_code =
82
-
let range_idx = cmd_code lsr 6 in
83
-
let insert_code_base = insert_range_lut.(range_idx) in
84
-
insert_code_base + ((cmd_code lsr 3) land 7)
85
-
86
-
let[@inline] get_copy_length_code cmd_code =
87
-
let range_idx = cmd_code lsr 6 in
88
-
let copy_code_base = copy_range_lut.(range_idx) in
89
-
copy_code_base + (cmd_code land 7)
90
-
91
-
(* Command code to distance context mapping *)
92
-
let[@inline] command_code_to_distance_context cmd_code =
93
-
if cmd_code < 128 then 0
94
-
else if cmd_code < 256 then 1
95
-
else if cmd_code < 384 then 2
96
-
else 3
-232
ocaml-brotli/src/transform.ml
-232
ocaml-brotli/src/transform.ml
···
1
-
(* Brotli dictionary word transformations (RFC 7932 Appendix B) *)
2
-
3
-
(* Transform types *)
4
-
type transform_type =
5
-
| Identity
6
-
| OmitLast of int (* 1-9 *)
7
-
| UppercaseFirst
8
-
| UppercaseAll
9
-
| OmitFirst of int (* 1-9 *)
10
-
11
-
(* A complete transform with prefix, type, and suffix *)
12
-
type transform = {
13
-
prefix : string;
14
-
transform : transform_type;
15
-
suffix : string;
16
-
}
17
-
18
-
(* UTF-8 uppercase conversion as specified in RFC 7932 *)
19
-
let to_upper_case dst pos =
20
-
let c = Char.code (Bytes.get dst pos) in
21
-
if c < 0xc0 then begin
22
-
(* ASCII or continuation byte *)
23
-
if c >= 97 && c <= 122 then
24
-
Bytes.set dst pos (Char.chr (c lxor 32));
25
-
1
26
-
end
27
-
else if c < 0xe0 then begin
28
-
(* 2-byte UTF-8 sequence *)
29
-
let c1 = Char.code (Bytes.get dst (pos + 1)) in
30
-
Bytes.set dst (pos + 1) (Char.chr (c1 lxor 32));
31
-
2
32
-
end
33
-
else begin
34
-
(* 3-byte UTF-8 sequence *)
35
-
let c2 = Char.code (Bytes.get dst (pos + 2)) in
36
-
Bytes.set dst (pos + 2) (Char.chr (c2 lxor 5));
37
-
3
38
-
end
39
-
40
-
(* All 121 transforms from RFC 7932 *)
41
-
let transforms = [|
42
-
{ prefix = ""; transform = Identity; suffix = "" };
43
-
{ prefix = ""; transform = Identity; suffix = " " };
44
-
{ prefix = " "; transform = Identity; suffix = " " };
45
-
{ prefix = ""; transform = OmitFirst 1; suffix = "" };
46
-
{ prefix = ""; transform = UppercaseFirst; suffix = " " };
47
-
{ prefix = ""; transform = Identity; suffix = " the " };
48
-
{ prefix = " "; transform = Identity; suffix = "" };
49
-
{ prefix = "s "; transform = Identity; suffix = " " };
50
-
{ prefix = ""; transform = Identity; suffix = " of " };
51
-
{ prefix = ""; transform = UppercaseFirst; suffix = "" };
52
-
{ prefix = ""; transform = Identity; suffix = " and " };
53
-
{ prefix = ""; transform = OmitFirst 2; suffix = "" };
54
-
{ prefix = ""; transform = OmitLast 1; suffix = "" };
55
-
{ prefix = ", "; transform = Identity; suffix = " " };
56
-
{ prefix = ""; transform = Identity; suffix = ", " };
57
-
{ prefix = " "; transform = UppercaseFirst; suffix = " " };
58
-
{ prefix = ""; transform = Identity; suffix = " in " };
59
-
{ prefix = ""; transform = Identity; suffix = " to " };
60
-
{ prefix = "e "; transform = Identity; suffix = " " };
61
-
{ prefix = ""; transform = Identity; suffix = "\"" };
62
-
{ prefix = ""; transform = Identity; suffix = "." };
63
-
{ prefix = ""; transform = Identity; suffix = "\">" };
64
-
{ prefix = ""; transform = Identity; suffix = "\n" };
65
-
{ prefix = ""; transform = OmitLast 3; suffix = "" };
66
-
{ prefix = ""; transform = Identity; suffix = "]" };
67
-
{ prefix = ""; transform = Identity; suffix = " for " };
68
-
{ prefix = ""; transform = OmitFirst 3; suffix = "" };
69
-
{ prefix = ""; transform = OmitLast 2; suffix = "" };
70
-
{ prefix = ""; transform = Identity; suffix = " a " };
71
-
{ prefix = ""; transform = Identity; suffix = " that " };
72
-
{ prefix = " "; transform = UppercaseFirst; suffix = "" };
73
-
{ prefix = ""; transform = Identity; suffix = ". " };
74
-
{ prefix = "."; transform = Identity; suffix = "" };
75
-
{ prefix = " "; transform = Identity; suffix = ", " };
76
-
{ prefix = ""; transform = OmitFirst 4; suffix = "" };
77
-
{ prefix = ""; transform = Identity; suffix = " with " };
78
-
{ prefix = ""; transform = Identity; suffix = "'" };
79
-
{ prefix = ""; transform = Identity; suffix = " from " };
80
-
{ prefix = ""; transform = Identity; suffix = " by " };
81
-
{ prefix = ""; transform = OmitFirst 5; suffix = "" };
82
-
{ prefix = ""; transform = OmitFirst 6; suffix = "" };
83
-
{ prefix = " the "; transform = Identity; suffix = "" };
84
-
{ prefix = ""; transform = OmitLast 4; suffix = "" };
85
-
{ prefix = ""; transform = Identity; suffix = ". The " };
86
-
{ prefix = ""; transform = UppercaseAll; suffix = "" };
87
-
{ prefix = ""; transform = Identity; suffix = " on " };
88
-
{ prefix = ""; transform = Identity; suffix = " as " };
89
-
{ prefix = ""; transform = Identity; suffix = " is " };
90
-
{ prefix = ""; transform = OmitLast 7; suffix = "" };
91
-
{ prefix = ""; transform = OmitLast 1; suffix = "ing " };
92
-
{ prefix = ""; transform = Identity; suffix = "\n\t" };
93
-
{ prefix = ""; transform = Identity; suffix = ":" };
94
-
{ prefix = " "; transform = Identity; suffix = ". " };
95
-
{ prefix = ""; transform = Identity; suffix = "ed " };
96
-
{ prefix = ""; transform = OmitFirst 9; suffix = "" };
97
-
{ prefix = ""; transform = OmitFirst 7; suffix = "" };
98
-
{ prefix = ""; transform = OmitLast 6; suffix = "" };
99
-
{ prefix = ""; transform = Identity; suffix = "(" };
100
-
{ prefix = ""; transform = UppercaseFirst; suffix = ", " };
101
-
{ prefix = ""; transform = OmitLast 8; suffix = "" };
102
-
{ prefix = ""; transform = Identity; suffix = " at " };
103
-
{ prefix = ""; transform = Identity; suffix = "ly " };
104
-
{ prefix = " the "; transform = Identity; suffix = " of " };
105
-
{ prefix = ""; transform = OmitLast 5; suffix = "" };
106
-
{ prefix = ""; transform = OmitLast 9; suffix = "" };
107
-
{ prefix = " "; transform = UppercaseFirst; suffix = ", " };
108
-
{ prefix = ""; transform = UppercaseFirst; suffix = "\"" };
109
-
{ prefix = "."; transform = Identity; suffix = "(" };
110
-
{ prefix = ""; transform = UppercaseAll; suffix = " " };
111
-
{ prefix = ""; transform = UppercaseFirst; suffix = "\">" };
112
-
{ prefix = ""; transform = Identity; suffix = "=\"" };
113
-
{ prefix = " "; transform = Identity; suffix = "." };
114
-
{ prefix = ".com/"; transform = Identity; suffix = "" };
115
-
{ prefix = " the "; transform = Identity; suffix = " of the " };
116
-
{ prefix = ""; transform = UppercaseFirst; suffix = "'" };
117
-
{ prefix = ""; transform = Identity; suffix = ". This " };
118
-
{ prefix = ""; transform = Identity; suffix = "," };
119
-
{ prefix = "."; transform = Identity; suffix = " " };
120
-
{ prefix = ""; transform = UppercaseFirst; suffix = "(" };
121
-
{ prefix = ""; transform = UppercaseFirst; suffix = "." };
122
-
{ prefix = ""; transform = Identity; suffix = " not " };
123
-
{ prefix = " "; transform = Identity; suffix = "=\"" };
124
-
{ prefix = ""; transform = Identity; suffix = "er " };
125
-
{ prefix = " "; transform = UppercaseAll; suffix = " " };
126
-
{ prefix = ""; transform = Identity; suffix = "al " };
127
-
{ prefix = " "; transform = UppercaseAll; suffix = "" };
128
-
{ prefix = ""; transform = Identity; suffix = "='" };
129
-
{ prefix = ""; transform = UppercaseAll; suffix = "\"" };
130
-
{ prefix = ""; transform = UppercaseFirst; suffix = ". " };
131
-
{ prefix = " "; transform = Identity; suffix = "(" };
132
-
{ prefix = ""; transform = Identity; suffix = "ful " };
133
-
{ prefix = " "; transform = UppercaseFirst; suffix = ". " };
134
-
{ prefix = ""; transform = Identity; suffix = "ive " };
135
-
{ prefix = ""; transform = Identity; suffix = "less " };
136
-
{ prefix = ""; transform = UppercaseAll; suffix = "'" };
137
-
{ prefix = ""; transform = Identity; suffix = "est " };
138
-
{ prefix = " "; transform = UppercaseFirst; suffix = "." };
139
-
{ prefix = ""; transform = UppercaseAll; suffix = "\">" };
140
-
{ prefix = " "; transform = Identity; suffix = "='" };
141
-
{ prefix = ""; transform = UppercaseFirst; suffix = "," };
142
-
{ prefix = ""; transform = Identity; suffix = "ize " };
143
-
{ prefix = ""; transform = UppercaseAll; suffix = "." };
144
-
{ prefix = "\194\160"; transform = Identity; suffix = "" }; (* non-breaking space UTF-8 *)
145
-
{ prefix = " "; transform = Identity; suffix = "," };
146
-
{ prefix = ""; transform = UppercaseFirst; suffix = "=\"" };
147
-
{ prefix = ""; transform = UppercaseAll; suffix = "=\"" };
148
-
{ prefix = ""; transform = Identity; suffix = "ous " };
149
-
{ prefix = ""; transform = UppercaseAll; suffix = ", " };
150
-
{ prefix = ""; transform = UppercaseFirst; suffix = "='" };
151
-
{ prefix = " "; transform = UppercaseFirst; suffix = "," };
152
-
{ prefix = " "; transform = UppercaseAll; suffix = "=\"" };
153
-
{ prefix = " "; transform = UppercaseAll; suffix = ", " };
154
-
{ prefix = ""; transform = UppercaseAll; suffix = "," };
155
-
{ prefix = ""; transform = UppercaseAll; suffix = "(" };
156
-
{ prefix = ""; transform = UppercaseAll; suffix = ". " };
157
-
{ prefix = " "; transform = UppercaseAll; suffix = "." };
158
-
{ prefix = ""; transform = UppercaseAll; suffix = "='" };
159
-
{ prefix = " "; transform = UppercaseAll; suffix = ". " };
160
-
{ prefix = " "; transform = UppercaseFirst; suffix = "=\"" };
161
-
{ prefix = " "; transform = UppercaseAll; suffix = "='" };
162
-
{ prefix = " "; transform = UppercaseFirst; suffix = "='" };
163
-
|]
164
-
165
-
let num_transforms = Array.length transforms
166
-
167
-
(* Apply a transform to a dictionary word *)
168
-
let apply_transform dst dst_pos word word_offset word_length transform_id =
169
-
let t = transforms.(transform_id) in
170
-
let prefix = t.prefix in
171
-
let suffix = t.suffix in
172
-
173
-
(* Calculate skip amount for OmitFirst transforms *)
174
-
let skip = match t.transform with
175
-
| OmitFirst n -> min n word_length
176
-
| _ -> 0
177
-
in
178
-
179
-
(* Calculate length reduction for OmitLast transforms *)
180
-
let omit_last = match t.transform with
181
-
| OmitLast n -> n
182
-
| _ -> 0
183
-
in
184
-
185
-
let actual_word_len = word_length - skip - omit_last in
186
-
let actual_word_len = max 0 actual_word_len in
187
-
188
-
let idx = ref dst_pos in
189
-
190
-
(* Write prefix *)
191
-
for i = 0 to String.length prefix - 1 do
192
-
Bytes.set dst !idx prefix.[i];
193
-
incr idx
194
-
done;
195
-
196
-
(* Write word (possibly skipped and/or truncated) *)
197
-
let word_start = word_offset + skip in
198
-
for i = 0 to actual_word_len - 1 do
199
-
Bytes.set dst !idx (String.get word (word_start + i));
200
-
incr idx
201
-
done;
202
-
203
-
(* Apply uppercase transformations *)
204
-
let uppercase_start = dst_pos + String.length prefix in
205
-
begin match t.transform with
206
-
| UppercaseFirst ->
207
-
if actual_word_len > 0 then
208
-
ignore (to_upper_case dst uppercase_start)
209
-
| UppercaseAll ->
210
-
let remaining = ref actual_word_len in
211
-
let pos = ref uppercase_start in
212
-
while !remaining > 0 do
213
-
let step = to_upper_case dst !pos in
214
-
pos := !pos + step;
215
-
remaining := !remaining - step
216
-
done
217
-
| _ -> ()
218
-
end;
219
-
220
-
(* Write suffix *)
221
-
for i = 0 to String.length suffix - 1 do
222
-
Bytes.set dst !idx suffix.[i];
223
-
incr idx
224
-
done;
225
-
226
-
!idx - dst_pos
227
-
228
-
(* Transform a dictionary word in place *)
229
-
let transform_dictionary_word ~dst ~dst_pos ~word_index ~word_length ~transform_id =
230
-
let word = Dictionary.data in
231
-
let word_offset = Dictionary.offset_by_length.(word_length) + word_index * word_length in
232
-
apply_transform dst dst_pos word word_offset word_length transform_id
-4
ocaml-brotli/test/dune
-4
ocaml-brotli/test/dune
-459
ocaml-brotli/test/test_brotli.ml
-459
ocaml-brotli/test/test_brotli.ml
···
1
-
(* Brotli compression/decompression tests *)
2
-
3
-
let test_empty () =
4
-
let compressed = Brotli.compress "" in
5
-
match Brotli.decompress compressed with
6
-
| Ok result -> Alcotest.(check string) "empty roundtrip" "" result
7
-
| Error msg -> Alcotest.fail msg
8
-
9
-
let test_small_literal () =
10
-
let input = "Hello, World!" in
11
-
let compressed = Brotli.compress input in
12
-
match Brotli.decompress compressed with
13
-
| Ok result -> Alcotest.(check string) "small literal roundtrip" input result
14
-
| Error msg -> Alcotest.fail msg
15
-
16
-
let test_repeated_pattern () =
17
-
let input = String.make 1000 'A' in
18
-
let compressed = Brotli.compress input in
19
-
match Brotli.decompress compressed with
20
-
| Ok result -> Alcotest.(check string) "repeated pattern roundtrip" input result
21
-
| Error msg -> Alcotest.fail msg
22
-
23
-
let test_binary_data () =
24
-
let input = String.init 256 (fun i -> Char.chr i) in
25
-
let compressed = Brotli.compress input in
26
-
match Brotli.decompress compressed with
27
-
| Ok result -> Alcotest.(check string) "binary data roundtrip" input result
28
-
| Error msg -> Alcotest.fail msg
29
-
30
-
let test_medium_text () =
31
-
let words = ["The"; "quick"; "brown"; "fox"; "jumps"; "over"; "the"; "lazy"; "dog"] in
32
-
let input = String.concat " " (List.init 100 (fun i -> List.nth words (i mod 9))) in
33
-
let compressed = Brotli.compress input in
34
-
match Brotli.decompress compressed with
35
-
| Ok result -> Alcotest.(check string) "medium text roundtrip" input result
36
-
| Error msg -> Alcotest.fail msg
37
-
38
-
let test_various_sizes () =
39
-
List.iter (fun size ->
40
-
let input = String.init size (fun i -> Char.chr (i mod 256)) in
41
-
let compressed = Brotli.compress input in
42
-
match Brotli.decompress compressed with
43
-
| Ok result ->
44
-
Alcotest.(check int) (Printf.sprintf "size %d length" size) size (String.length result);
45
-
Alcotest.(check string) (Printf.sprintf "size %d content" size) input result
46
-
| Error msg -> Alcotest.fail (Printf.sprintf "size %d: %s" size msg)
47
-
) [0; 1; 10; 100; 1000; 10000]
48
-
49
-
let test_max_compressed_length () =
50
-
let size = 1000 in
51
-
let max_len = Brotli.max_compressed_length size in
52
-
Alcotest.(check bool) "max_compressed_length > input"
53
-
true (max_len >= size)
54
-
55
-
(* Quality level tests *)
56
-
57
-
let test_quality_0 () =
58
-
(* Quality 0 should use uncompressed blocks *)
59
-
let inputs = [
60
-
"Hello, World!";
61
-
String.make 100 'A';
62
-
String.init 256 (fun i -> Char.chr i);
63
-
] in
64
-
List.iter (fun input ->
65
-
let compressed = Brotli.compress ~quality:0 input in
66
-
match Brotli.decompress compressed with
67
-
| Ok result ->
68
-
Alcotest.(check string) "quality 0 roundtrip" input result
69
-
| Error msg -> Alcotest.fail msg
70
-
) inputs
71
-
72
-
let test_quality_1 () =
73
-
(* Quality 1 uses Huffman-only compression *)
74
-
let inputs = [
75
-
"";
76
-
"a";
77
-
"Hello, World!";
78
-
String.make 100 'A';
79
-
String.make 1000 'B';
80
-
String.init 256 (fun i -> Char.chr i);
81
-
String.concat " " (List.init 50 (fun _ -> "Hello, World!"));
82
-
] in
83
-
List.iter (fun input ->
84
-
let compressed = Brotli.compress ~quality:1 input in
85
-
match Brotli.decompress compressed with
86
-
| Ok result ->
87
-
Alcotest.(check string) "quality 1 roundtrip" input result
88
-
| Error msg -> Alcotest.fail (Printf.sprintf "quality 1 failed on %d bytes: %s" (String.length input) msg)
89
-
) inputs
90
-
91
-
let test_quality_2 () =
92
-
(* Quality 2 uses LZ77 + Huffman *)
93
-
let inputs = [
94
-
"";
95
-
"a";
96
-
"Hello, World!";
97
-
String.make 100 'A';
98
-
String.make 1000 'B';
99
-
String.init 256 (fun i -> Char.chr i);
100
-
String.concat " " (List.init 50 (fun _ -> "Hello, World!"));
101
-
String.concat " " (List.init 100 (fun _ -> "Hello, World!"));
102
-
String.concat "" (List.init 100 (fun _ -> "abcdefghij"));
103
-
] in
104
-
List.iter (fun input ->
105
-
let compressed = Brotli.compress ~quality:2 input in
106
-
match Brotli.decompress compressed with
107
-
| Ok result ->
108
-
Alcotest.(check string) "quality 2 roundtrip" input result
109
-
| Error msg -> Alcotest.fail (Printf.sprintf "quality 2 failed on %d bytes: %s" (String.length input) msg)
110
-
) inputs
111
-
112
-
let test_quality_3 () =
113
-
(* Quality 3 uses LZ77 + Dictionary + Huffman *)
114
-
let inputs = [
115
-
"";
116
-
"a";
117
-
"Hello, World!";
118
-
String.make 100 'A';
119
-
String.make 1000 'B';
120
-
String.init 256 (fun i -> Char.chr i);
121
-
String.concat " " (List.init 50 (fun _ -> "Hello, World!"));
122
-
String.concat " " (List.init 100 (fun _ -> "Hello, World!"));
123
-
String.concat "" (List.init 100 (fun _ -> "abcdefghij"));
124
-
(* Text with common English words that might be in dictionary *)
125
-
"The quick brown fox jumps over the lazy dog.";
126
-
"This is a test of the Brotli compression algorithm.";
127
-
String.concat " " (List.init 50 (fun _ -> "the quick brown fox"));
128
-
] in
129
-
List.iter (fun input ->
130
-
let compressed = Brotli.compress ~quality:3 input in
131
-
match Brotli.decompress compressed with
132
-
| Ok result ->
133
-
Alcotest.(check string) "quality 3 roundtrip" input result
134
-
| Error msg -> Alcotest.fail (Printf.sprintf "quality 3 failed on %d bytes: %s" (String.length input) msg)
135
-
) inputs
136
-
137
-
let test_quality_4 () =
138
-
(* Quality 4 uses hash chains + lazy matching *)
139
-
let inputs = [
140
-
"";
141
-
"a";
142
-
"Hello, World!";
143
-
String.make 100 'A';
144
-
String.make 1000 'B';
145
-
String.init 256 (fun i -> Char.chr i);
146
-
String.concat " " (List.init 50 (fun _ -> "Hello, World!"));
147
-
String.concat " " (List.init 100 (fun _ -> "Hello, World!"));
148
-
String.concat "" (List.init 100 (fun _ -> "abcdefghij"));
149
-
(* More complex patterns that benefit from lazy matching *)
150
-
String.concat "" (List.init 200 (fun i ->
151
-
if i mod 10 < 5 then "abc" else "xyz"));
152
-
String.concat "" (List.init 100 (fun _ -> "ababababab"));
153
-
] in
154
-
List.iter (fun input ->
155
-
let compressed = Brotli.compress ~quality:4 input in
156
-
match Brotli.decompress compressed with
157
-
| Ok result ->
158
-
Alcotest.(check string) "quality 4 roundtrip" input result
159
-
| Error msg -> Alcotest.fail (Printf.sprintf "quality 4 failed on %d bytes: %s" (String.length input) msg)
160
-
) inputs
161
-
162
-
let test_quality_5 () =
163
-
(* Quality 5 uses deeper hash chains *)
164
-
let inputs = [
165
-
"";
166
-
"a";
167
-
"Hello, World!";
168
-
String.make 100 'A';
169
-
String.make 1000 'B';
170
-
String.init 256 (fun i -> Char.chr i);
171
-
String.concat " " (List.init 50 (fun _ -> "Hello, World!"));
172
-
String.concat " " (List.init 100 (fun _ -> "Hello, World!"));
173
-
(* Large input to test performance *)
174
-
String.init 10000 (fun i ->
175
-
let v = (i * 7 + 13) mod 256 in
176
-
Char.chr v);
177
-
] in
178
-
List.iter (fun input ->
179
-
let compressed = Brotli.compress ~quality:5 input in
180
-
match Brotli.decompress compressed with
181
-
| Ok result ->
182
-
Alcotest.(check string) "quality 5 roundtrip" input result
183
-
| Error msg -> Alcotest.fail (Printf.sprintf "quality 5 failed on %d bytes: %s" (String.length input) msg)
184
-
) inputs
185
-
186
-
let test_quality_6_9 () =
187
-
(* Quality 6-9 use deeper matching - testing they work correctly *)
188
-
let inputs = [
189
-
"";
190
-
"Hello, World!";
191
-
String.make 100 'A';
192
-
String.make 1000 'B';
193
-
String.concat " " (List.init 100 (fun _ -> "Hello, World!"));
194
-
(* Text with various patterns *)
195
-
"The quick brown fox jumps over the lazy dog. " ^
196
-
"Pack my box with five dozen liquor jugs. " ^
197
-
"How vexingly quick daft zebras jump!";
198
-
(* Binary-like data *)
199
-
String.init 1000 (fun i -> Char.chr (i mod 256));
200
-
] in
201
-
List.iter (fun q ->
202
-
List.iter (fun input ->
203
-
let compressed = Brotli.compress ~quality:q input in
204
-
match Brotli.decompress compressed with
205
-
| Ok result ->
206
-
Alcotest.(check string) (Printf.sprintf "quality %d roundtrip" q) input result
207
-
| Error msg ->
208
-
Alcotest.fail (Printf.sprintf "quality %d failed on %d bytes: %s" q (String.length input) msg)
209
-
) inputs
210
-
) [6; 7; 8; 9]
211
-
212
-
let test_quality_10_11 () =
213
-
(* Quality 10-11 use maximum compression *)
214
-
let inputs = [
215
-
"";
216
-
"Hello, World!";
217
-
String.make 100 'A';
218
-
String.concat " " (List.init 50 (fun _ -> "Hello, World!"));
219
-
(* Text with various patterns *)
220
-
"The quick brown fox jumps over the lazy dog. " ^
221
-
"Pack my box with five dozen liquor jugs.";
222
-
] in
223
-
List.iter (fun q ->
224
-
List.iter (fun input ->
225
-
let compressed = Brotli.compress ~quality:q input in
226
-
match Brotli.decompress compressed with
227
-
| Ok result ->
228
-
Alcotest.(check string) (Printf.sprintf "quality %d roundtrip" q) input result
229
-
| Error msg ->
230
-
Alcotest.fail (Printf.sprintf "quality %d failed on %d bytes: %s" q (String.length input) msg)
231
-
) inputs
232
-
) [10; 11]
233
-
234
-
let test_quality_comparison () =
235
-
(* Quality 2 should generally compress better than quality 1 for repetitive data *)
236
-
let input = String.concat " " (List.init 100 (fun _ -> "Hello, World!")) in
237
-
let c1 = Brotli.compress ~quality:1 input in
238
-
let c2 = Brotli.compress ~quality:2 input in
239
-
(* Both should decompress correctly *)
240
-
(match Brotli.decompress c1 with
241
-
| Ok r -> Alcotest.(check string) "q1 decompresses" input r
242
-
| Error msg -> Alcotest.fail msg);
243
-
(match Brotli.decompress c2 with
244
-
| Ok r -> Alcotest.(check string) "q2 decompresses" input r
245
-
| Error msg -> Alcotest.fail msg);
246
-
(* Quality 2 should be smaller for this repetitive input *)
247
-
Alcotest.(check bool) "quality 2 compresses better"
248
-
true (String.length c2 < String.length c1)
249
-
250
-
let test_all_qualities_large () =
251
-
(* Test all qualities with larger inputs *)
252
-
let sizes = [100; 500; 1000; 5000; 10000] in
253
-
let qualities = [0; 1; 2] in
254
-
List.iter (fun size ->
255
-
let input = String.init size (fun i ->
256
-
(* Mix of patterns to test various encoding paths *)
257
-
if i mod 100 < 50 then Char.chr (i mod 26 + 65) (* A-Z *)
258
-
else Char.chr (i mod 10 + 48) (* 0-9 *)
259
-
) in
260
-
List.iter (fun q ->
261
-
let compressed = Brotli.compress ~quality:q input in
262
-
match Brotli.decompress compressed with
263
-
| Ok result ->
264
-
Alcotest.(check int) (Printf.sprintf "q%d size %d" q size) size (String.length result);
265
-
Alcotest.(check string) (Printf.sprintf "q%d size %d content" q size) input result
266
-
| Error msg ->
267
-
Alcotest.fail (Printf.sprintf "q%d size %d: %s" q size msg)
268
-
) qualities
269
-
) sizes
270
-
271
-
let test_compress_into () =
272
-
(* Test the low-allocation API *)
273
-
let input = "Hello, World! This is a test of the compress_into API." in
274
-
let src = Bytes.of_string input in
275
-
let max_len = Brotli.max_compressed_length (String.length input) in
276
-
let dst = Bytes.create max_len in
277
-
let compressed_len = Brotli.compress_into
278
-
~src ~src_pos:0 ~src_len:(String.length input)
279
-
~dst ~dst_pos:0 () in
280
-
let compressed = Bytes.sub_string dst 0 compressed_len in
281
-
match Brotli.decompress compressed with
282
-
| Ok result -> Alcotest.(check string) "compress_into roundtrip" input result
283
-
| Error msg -> Alcotest.fail msg
284
-
285
-
let test_compress_into_quality () =
286
-
(* Test compress_into with different qualities *)
287
-
let input = String.concat "" (List.init 100 (fun _ -> "test pattern ")) in
288
-
let src = Bytes.of_string input in
289
-
let max_len = Brotli.max_compressed_length (String.length input) in
290
-
List.iter (fun q ->
291
-
let dst = Bytes.create max_len in
292
-
let compressed_len = Brotli.compress_into ~quality:q
293
-
~src ~src_pos:0 ~src_len:(String.length input)
294
-
~dst ~dst_pos:0 () in
295
-
let compressed = Bytes.sub_string dst 0 compressed_len in
296
-
match Brotli.decompress compressed with
297
-
| Ok result ->
298
-
Alcotest.(check string) (Printf.sprintf "compress_into q%d" q) input result
299
-
| Error msg -> Alcotest.fail (Printf.sprintf "compress_into q%d: %s" q msg)
300
-
) [0; 1; 2]
301
-
302
-
let test_partial_buffer () =
303
-
(* Test compressing from middle of buffer *)
304
-
let full = "prefix_Hello, World!_suffix" in
305
-
let src = Bytes.of_string full in
306
-
let max_len = Brotli.max_compressed_length 13 in
307
-
let dst = Bytes.create max_len in
308
-
let compressed_len = Brotli.compress_into
309
-
~src ~src_pos:7 ~src_len:13 (* "Hello, World!" *)
310
-
~dst ~dst_pos:0 () in
311
-
let compressed = Bytes.sub_string dst 0 compressed_len in
312
-
match Brotli.decompress compressed with
313
-
| Ok result -> Alcotest.(check string) "partial buffer" "Hello, World!" result
314
-
| Error msg -> Alcotest.fail msg
315
-
316
-
let test_edge_cases () =
317
-
(* Various edge cases *)
318
-
let cases = [
319
-
(* Single bytes *)
320
-
"\x00";
321
-
"\xff";
322
-
(* All same byte *)
323
-
String.make 10 '\x00';
324
-
String.make 10 '\xff';
325
-
(* Alternating *)
326
-
String.init 100 (fun i -> if i mod 2 = 0 then 'a' else 'b');
327
-
(* All printable ASCII *)
328
-
String.init 95 (fun i -> Char.chr (i + 32));
329
-
(* Long runs followed by varied data *)
330
-
String.make 500 'X' ^ String.init 500 (fun i -> Char.chr (i mod 256));
331
-
] in
332
-
List.iteri (fun i input ->
333
-
List.iter (fun q ->
334
-
let compressed = Brotli.compress ~quality:q input in
335
-
match Brotli.decompress compressed with
336
-
| Ok result ->
337
-
Alcotest.(check string) (Printf.sprintf "edge case %d q%d" i q) input result
338
-
| Error msg ->
339
-
Alcotest.fail (Printf.sprintf "edge case %d q%d: %s" i q msg)
340
-
) [0; 1; 2]
341
-
) cases
342
-
343
-
let roundtrip_tests = [
344
-
"empty", `Quick, test_empty;
345
-
"small_literal", `Quick, test_small_literal;
346
-
"repeated_pattern", `Quick, test_repeated_pattern;
347
-
"binary_data", `Quick, test_binary_data;
348
-
"medium_text", `Quick, test_medium_text;
349
-
"various_sizes", `Quick, test_various_sizes;
350
-
"max_compressed_length", `Quick, test_max_compressed_length;
351
-
]
352
-
353
-
let quality_tests = [
354
-
"quality_0", `Quick, test_quality_0;
355
-
"quality_1", `Quick, test_quality_1;
356
-
"quality_2", `Quick, test_quality_2;
357
-
"quality_3", `Quick, test_quality_3;
358
-
"quality_4", `Quick, test_quality_4;
359
-
"quality_5", `Quick, test_quality_5;
360
-
"quality_6_9", `Quick, test_quality_6_9;
361
-
"quality_10_11", `Quick, test_quality_10_11;
362
-
"quality_comparison", `Quick, test_quality_comparison;
363
-
"all_qualities_large", `Quick, test_all_qualities_large;
364
-
]
365
-
366
-
let api_tests = [
367
-
"compress_into", `Quick, test_compress_into;
368
-
"compress_into_quality", `Quick, test_compress_into_quality;
369
-
"partial_buffer", `Quick, test_partial_buffer;
370
-
"edge_cases", `Quick, test_edge_cases;
371
-
]
372
-
373
-
(* Streaming API tests *)
374
-
375
-
let test_streaming_single_chunk () =
376
-
let input = "Hello, World! This is a test of the streaming API." in
377
-
let src = Bytes.of_string input in
378
-
let max_len = Brotli.max_compressed_length (String.length input) in
379
-
let dst = Bytes.create max_len in
380
-
let encoder = Brotli.create_streaming_encoder ~dst ~dst_pos:0 () in
381
-
let _ = Brotli.streaming_write encoder ~src ~src_pos:0 ~src_len:(String.length input) ~is_last:true in
382
-
let compressed_len = Brotli.streaming_bytes_written encoder in
383
-
let compressed = Bytes.sub_string dst 0 compressed_len in
384
-
match Brotli.decompress compressed with
385
-
| Ok result -> Alcotest.(check string) "streaming single chunk" input result
386
-
| Error msg -> Alcotest.fail msg
387
-
388
-
let test_streaming_multiple_chunks () =
389
-
let chunks = [| "First chunk. "; "Second chunk. "; "Third chunk. "; "Fourth and final chunk!" |] in
390
-
let input = String.concat "" (Array.to_list chunks) in
391
-
let max_len = Brotli.max_compressed_length (String.length input) * 2 in
392
-
let dst = Bytes.create max_len in
393
-
let encoder = Brotli.create_streaming_encoder ~quality:2 ~dst ~dst_pos:0 () in
394
-
for i = 0 to Array.length chunks - 1 do
395
-
let chunk = chunks.(i) in
396
-
let src = Bytes.of_string chunk in
397
-
let is_last = i = Array.length chunks - 1 in
398
-
let _ = Brotli.streaming_write encoder ~src ~src_pos:0 ~src_len:(String.length chunk) ~is_last in
399
-
()
400
-
done;
401
-
let compressed_len = Brotli.streaming_bytes_written encoder in
402
-
let compressed = Bytes.sub_string dst 0 compressed_len in
403
-
match Brotli.decompress compressed with
404
-
| Ok result -> Alcotest.(check string) "streaming multiple chunks" input result
405
-
| Error msg -> Alcotest.fail msg
406
-
407
-
let test_streaming_empty () =
408
-
let max_len = Brotli.max_compressed_length 0 + 16 in
409
-
let dst = Bytes.create max_len in
410
-
let encoder = Brotli.create_streaming_encoder ~dst ~dst_pos:0 () in
411
-
let _ = Brotli.streaming_finish encoder in
412
-
let compressed_len = Brotli.streaming_bytes_written encoder in
413
-
let compressed = Bytes.sub_string dst 0 compressed_len in
414
-
match Brotli.decompress compressed with
415
-
| Ok result -> Alcotest.(check string) "streaming empty" "" result
416
-
| Error msg -> Alcotest.fail msg
417
-
418
-
let streaming_tests = [
419
-
"single_chunk", `Quick, test_streaming_single_chunk;
420
-
"multiple_chunks", `Quick, test_streaming_multiple_chunks;
421
-
"empty", `Quick, test_streaming_empty;
422
-
]
423
-
424
-
(* Test that higher quality levels produce better or equal compression *)
425
-
let test_quality_improves_compression () =
426
-
(* Create compressible test data *)
427
-
let test_data = String.concat "" (List.init 100 (fun i ->
428
-
Printf.sprintf "Hello World %d! This is a test of Brotli compression quality.\n" i
429
-
)) in
430
-
let sizes = Array.make 12 0 in
431
-
for q = 0 to 11 do
432
-
let compressed = Brotli.compress ~quality:q test_data in
433
-
sizes.(q) <- String.length compressed;
434
-
(* Verify roundtrip *)
435
-
match Brotli.decompress compressed with
436
-
| Ok result ->
437
-
Alcotest.(check string) (Printf.sprintf "quality %d roundtrip" q) test_data result
438
-
| Error msg ->
439
-
Alcotest.fail (Printf.sprintf "quality %d failed: %s" q msg)
440
-
done;
441
-
(* Verify quality 11 is better than quality 0 *)
442
-
Alcotest.(check bool) "quality 11 <= quality 0"
443
-
true (sizes.(11) <= sizes.(0));
444
-
(* Verify quality 4+ is better than quality 1 (with LZ77) *)
445
-
Alcotest.(check bool) "quality 4 <= quality 1"
446
-
true (sizes.(4) <= sizes.(1))
447
-
448
-
let compression_tests = [
449
-
"quality_improves_compression", `Quick, test_quality_improves_compression;
450
-
]
451
-
452
-
let () =
453
-
Alcotest.run "Brotli" [
454
-
"roundtrip", roundtrip_tests;
455
-
"quality", quality_tests;
456
-
"api", api_tests;
457
-
"streaming", streaming_tests;
458
-
"compression", compression_tests;
459
-
]